Abstract

AbstractDue to the distinctive advantages of mobile agents (MAs) in wireless sensor networks (WSNs), such as network bandwidth and energy savings as well as flexibility in their use for various applications, MAs have drawn substantial research interest in recent years. The majority of the suggested agent-based dynamic itinerary planning algorithms are effective at addressing node failure due to energy shortage. However, they do not account for the (1) MAs’ expanding size when visiting a series of nodes (2) producing inefficient groups of MAs itineraries, causing a delay in reporting data back to a sink node, and (3) most importantly, they lack support for securing the overall itinerary planning from an attacker who could spoil the execution of the MA when visiting a sequence of nodes and the data itself. In this paper, we propose a dynamic and secure multi-mobile agent itinerary planning approach based on a Directed Acyclic Graph modelling and AES algorithm to secure the itinerary planning mechanism from an attacker. The network will apply DAG technique to generate efficient groups based on leader nodes where encryption/decryption will also occur.KeywordsWireless sensor networkItinerary planningDynamic itineraryEncryptionData security

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call