A Survey on Mobile Agent Itinerary Planning for Information Fusion in Wireless Sensor Networks

• Published in: Archives of computational methods in engineering Vol. 28; no. 3; pp. 1323 - 1334
• Main Authors: El Fissaoui, Mohamed, Beni-hssane, Abderrahim, Ouhmad, Slimane, El Makkaoui, Khalid
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Netherlands 01.05.2021; Springer Nature B.V
• Subjects: Agents (artificial intelligence); Algorithms; Client server systems; Data collection; Data integration; Energy consumption; Engineering; Mathematical and Computational Engineering; Multisensor fusion; Original Paper; Planing; Response time; Sensors; Wireless networks; Wireless sensor networks
• ISSN: 1134-3060; 1886-1784
• DOI: 10.1007/s11831-020-09417-1

In wireless sensor networks (WSNs), mobile agent (MA) is a new paradigm that has gained more attention lately. In this paradigm, MA migrates among sensor nodes (SNs) for data fusion. However, in comparison to traditional client/server paradigm; where each SN in the network sends its collected data to the sink, MA presents a good alternative in terms of energy consumption, response time and network lifetime. In this paradigm, the most critical properties of MA is the itinerary planning, it has always been an issue and a NP-hard problem. In this paper, we present a survey of the proposed itinerary planning approaches for MAs in WSNs. MA itinerary planning techniques can be classified into three categories: static itinerary planning, dynamic itinerary planning and hybrid itinerary planing. The benefits and shortcomings of different MA itinerary planning approaches are presented. Furthermore, we implement, simulate and compare the most prominent itinerary planning algorithms upon a common parameter space, making realistic network-level assumptions.