A new "data size" based algorithm for itinerary planning among mobile agents in wireless sensor networks
Imene Aloui, Okba Kazar, Laïd Kahloul, A. Aissaoui, Sylvie Servigne · 2016
The integration of mobile agent systems in the wireless sensor networks (WSN) has a positive impact on this type of networks. The itineraries followed by mobile agents have a influences significantly on the energy consumption. Finding an optimal sequence of visited source nodes (data sensors) is an NP-hard problem. Many researches have dealt with itinerary planning in WSNs through the use of a single agent (SIP: Single agent Itinerary Planning) or multiple mobile agents (MIP: Multiple agents Itinerary Planning). The itinerary planning, for multiple agents in WSN (MIP), must consider the following three issues: (i) the appropriate number of Mobile Agents, (ii) the suitable grouping of source-nodes, (iii) and finally, the optimal itinerary for each Mobile Agent to visit all its associated nodes. In the current MIP solutions, the geographical distance is the unique factor motivating to plan the itinerary of the agents. These solutions don't consider the data size provided by each node which is another factor affecting energy consumption too.