A Mobile Agent Routing Protocol for Data Aggregation in Wireless Sensor Networks
- 247 Downloads
Mobile agent data aggregation routing forwards mobile agents in wireless sensor network to collect and aggregate data. The key objective of data aggregation routing is to maximise the number of collected data samples at the same time as minimising network resource consumption and data collection delay. This paper proposes a mobile agent routing protocol, called zone-based mobile agent aggregation. This protocol utilises a bottom-up mobile agent migration scheme in which the mobile agents start their journeys from the centre of the event regions to the sink aiming to reduce the MA itinerary cost and delay and increase data aggregation routing accuracy. In addition, the proposed protocol reduces the impact of network architecture, event source distribution model and/or data heterogeneity on the performance of data aggregation routing.
KeywordsWireless sensor networks Mobile agents Data aggregation Itinerary planning
- 1.X. Zhu and W. Zhang, A mobile agent-based clustering data fusion algorithm in wsn, International Journal of Electrical and Computer Engineering, Vol. 5, No. 5, pp. 277–280, 2010.Google Scholar
- 5.I. E. Venetis, G. Pantziou, D. Gavalas and C. Konstantopoulos, “Benchmarking mobile agent itinerary planning algorithms for data aggregation on wsns,” The Sixth International Conf on Ubiquitous and Future Networks (ICUF), Shanghai, China, Vol. 8–11, No. July, pp. 105–110, 2014.Google Scholar
- 6.H. Qi and F. Wang, “Optimal itinerary analysis for mobile agents in ad hoc wireless sensor networks,” In the proceedings of the13th International Conference on Wireless Communication, Calgary, Alberta, Canada, July 9-11, vol. 1, no. 1, pp. 147–153, 2001.Google Scholar
- 7.M. Chen, V. Leung, S. Mao, T. Kwon, and M. Li, “Energy-efficient itinerary planning for mobile agents in wireless sensor networks,” IEEE International Conference on Communications (ICC), Dresden, Germany, June 14-18, vol. 1, no. 1, pp. 1–5, 2009.Google Scholar
- 10.I. Solis and K. Obraczka, “The impact of timing in data aggregation for sensor networks,” IEEE International Conference on Communications (ICC), Paris, France, June, 20-24, vol. 6, pp. 3640–3645, 2004.Google Scholar
- 11.F. Ye, A. Chen, S. Lu, and L. Zhang, “A scalable solution to minimum cost forwarding in large sensor networks,” The 10th International Conference on Computer Communications and Networks, Scottsdale, Arizona, USA, October 15-17, vol. 5, no. 2, pp. 304–309, 2001.Google Scholar
- 13.C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” Second IEEE Workshop on Mobile Computer Systems and Applications (WMCSA ’99), New Orleans, Louisiana, USA, February 25-26, vol. 1, no. 1, pp. 90–100, 1999.Google Scholar
- 14.I. D. Chakeres and E. M. Belding-Royer, “The utility of hello messages for determining link connectivity,” 5th International Symposium on Wireless Personal Multimedia Communications (WPMC), Honolulu, Hawaii, October 27-30, vol. 2, pp. 504–508, 2002.Google Scholar
- 17.P. Uthansakul, M. E. Bialkowski, S. Durrani, K. Bialkowski, and A. Postula, “Effect of line of sight propagation on capacity of an indoor mimo system,” IEEE Antennas and Propagation Society International Symposium 2005, 3-8 July, Washington, DC, pp. 707–710, 2005.Google Scholar
- 18.X. Shen, Z. Wang, P. Jiang, R. Lin, and Y. Sun, “Connectivity and rssi based localization scheme for wireless sensor networks,” International Conference on Intelligent Computing (ICIC’05), Hefei, China, August 23-26, vol. 1, no. 2, pp. 578–587, 2005.Google Scholar
- 19.OMNET++, “Omnet++ simulator,” 2012, http://www.omnetpp.org/, Retrieved (March 2016).
- 20.A. Viklund, “Mixim code,” 2013, http://mixim.sourceforge.net/index.html, Retrieved (December, 2015).
- 21.A. Kopke, M. Swigulski, K. Wessel, D. Willkomm, P. K. Haneveld, T. Parker, O. Visser, H. Lichte, and S. Valentin, “Simulating wireless and mobile networks in omnet++ the mixim vision,” the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems (Simutools ’08), Marseille, France, March 3-7, vol. 1, no. 1, pp. 71–78, 2008.Google Scholar
- 23.M. Chen, S. Gonzalez, Y. Zhang and V. C. Leung, Multi-agent itinerary planning for sensor networks, Quality of Service in Heterogeneous Networks, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, Vol. 22, pp. 584–597, 2009.CrossRefGoogle Scholar
- 25.M. Chen, T. Kwon, Y. Yuan, Y. Choi and V. C. M. Leung, Mobile agent-based directed diffusion in wireless sensor networks, EURASIP Journal on Advances in Signal Processing, Vol. 2007, No. 1, p. 219, 2007.Google Scholar
- 26.S. S. A. Basurra, “Collision guided routing for ad-hoc mobile wireless networks,” Ph.D. dissertation, Department of Computer Science, University of Bath, October 2012.Google Scholar
- 27.S. A. R. Zaidi, M. Hafeez, S. A. Khayam, D. Mclernon, M. Ghogho, and K. Kim, “On minimum cost coverage in wireless sensor networks,” The 43rd Annual Conference on Information Sciences and Systems (CISS 09), Johns Hopkins University, Baltimore, MD, March 18-20, vol. 2, no. 3, pp. 213–218, 2009.Google Scholar