Balanced Itinerary Planning for Multiple Mobile Agents In Wireless Sensor Networks
In this paper, the authors consider the use of multiple mobile software agents to perform different tasks in Wireless Sensor Networks (WSNs). To this regard, determining the number of mobile agents in the WSN remains an open issue in solving Multi-agent Itinerary Planning (MIP) problem. The authors propose a novel scheme entitled MST-MIP based on minimum spanning tree, where each branch stemmed from the sink corresponds to a group of source nodes assigned for a mobile agent to visit. Furthermore, a balancing factor ? is introduced to achieve a flexible trade-off control between energy cost and task duration, and the balanced MST-MIP algorithm is named BST-MIP.