Abstract
In this paper, we 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. We 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 balancing MST-MIP algorithm is named BST-MIP. Extensive experiments show that MST-MIP has lower energy consumption than previous MIP proposals, while BST-MIP decreases the task duration up to 50%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, M., Gonzalez, S., Leung, V.: Applications and Design Issues of Mobile Agents in Wireless Sensor Networks. IEEE Wireless Communications Magazine (WCM), Special Issue on Wireless Sensor Networking 14(6), 20–26 (2007)
Qi, H., Wang, F.: Optimal itinerary analysis for mobile agents in ad hoc wireless sensor networks. In: Proceedings of the IEEE 2001 International Conference on Communications (ICC 2001), Helsinki, Finland (2001)
Wu, Q., Rao, N.S.V., Barhen, J., Iyengar, S.S., Vaishnavi, V.K., Qi, H., Chakrabarty, K.: On computing mobile agent routes for data fusion in distributed sensor networks. IEEE Trans. Knowledge and Data Engineering 16, 740–753 (2004)
Chen, M., Leung, V., Mao, S., Kwon, T., Li, M.: Energy-Efficient itinerary planning for mobile agents in wireless sensor networks. In: Proceedings of the IEEE 2009 International Conference on Communications (ICC 2009), Bresden, Germany, pp. 1–5 (2009)
Chen, M., Gonzlez, S., Zhang, Y., Leung, V.: Multi-agent itinerary planning for sensor networks. In: Proceedings of the IEEE 2009 International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2009), Las Palmas de Gran Canaria, Spain (2009)
Cai W., Chen M., Hara T., Shu L.: GA-MIP: Genetic Algorithm based Multiple Mobile Agents Itinerary Planning in Wireless Sensor Network. In: Proceeding of the 5th Annual International Wireless Internet Conference (WICON 2010), Singapore (March 2010)
Gavalas, D.: A Heuristic Algorithm for Designing Near-Optimal Mobile Agent Itineraries. Journal of Communications and Networks, IEEE/KICS 8(1), 123–131 (2006)
Gavalas, D., Mpitziopoulos, A., Pantziou, G., Konstantopoulos, C.: An Approach for Near-Optimal Distributed Data Fusion in Wireless Sensor Networks. In: Wireless Networks (2010), doi:10.1007/s11276-009-0211-0
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Chen, M., Cai, W., Gonzalez, S., Leung, V.C.M. (2010). Balanced Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks. In: Zheng, J., Simplot-Ryl, D., Leung, V.C.M. (eds) Ad Hoc Networks. ADHOCNETS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17994-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-17994-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17993-8
Online ISBN: 978-3-642-17994-5
eBook Packages: Computer ScienceComputer Science (R0)