Tour and path planning methods for efficient data gathering using mobile elements

We consider a well-established model of data gathering in wireless sensor networks WSNs that combines mobile elements visiting some of the nodes, and wireless communication from the rest. Since wireless communication impacts the life-time of the network, there is a need to design the mobile element path so that the required communication is minimised, while the path length is bounded in length. Based on the required structure of the tour we investigate two variations of this problem. First, we consider mobile element tours that start and end at a predefined sink. Then we consider the unrestricted case, where the path is not required to return to the predefined sink node. We propose new algorithms that alternate between the path design and the multi-hop wireless communication routes, and iteratively improve the out-come of each phase. We compare the resulting performance of our algorithms with the best known comparable schemes in the literature.

[1]  David E. Culler,et al.  Mica: A Wireless Platform for Deeply Embedded Networks , 2002, IEEE Micro.

[2]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[3]  M. Aalsalem,et al.  A data caching approach for sensor applications , 2012, 2012 Computing, Communications and Applications Conference.

[4]  Yuanyuan Yang,et al.  Data gathering in wireless sensor networks with mobile collectors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[5]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[6]  S Sujatha,et al.  Efficient Data Gathering With Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks , 2014 .

[7]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[8]  Guoliang Xing,et al.  Rendezvous Planning in Wireless Sensor Networks with Mobile Elements , 2008, IEEE Transactions on Mobile Computing.

[9]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[10]  Matthew Lease,et al.  Making Sensor Networks Practical with Robots , 2002, Pervasive.

[11]  Subir Biswas,et al.  Joint routing and navigation protocols for data harvesting in sensor networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[12]  Weifa Liang,et al.  Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[13]  Chang-Gun Lee,et al.  Partitioning based mobile element scheduling in wireless sensor networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[14]  Khaled Almiani,et al.  Periodic Mobile Multi-Gateway Scheduling , 2008, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[15]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[16]  Yuanyuan Yang,et al.  A distributed optimal framework for mobile data gathering with concurrent data uploading in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[17]  Weifa Liang,et al.  Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[18]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[19]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[20]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[21]  Eylem Ekici,et al.  Mobility-based communication in wireless sensor networks , 2006, IEEE Communications Magazine.

[22]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[23]  Hyuk Lim,et al.  J-Sim: a simulation and emulation environment for wireless sensor networks , 2006, IEEE Wireless Communications.

[24]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[25]  Khaled Almiani,et al.  Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks , 2010, IEEE Local Computer Network Conference.

[26]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[27]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[28]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[29]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[30]  A SomasundaraA.,et al.  Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines , 2004 .

[31]  Mani B. Srivastava,et al.  Mobile Element Scheduling with Dynamic Deadlines , 2007, IEEE Transactions on Mobile Computing.

[32]  Gaurav S. Sukhatme,et al.  Networked infomechanical systems: a mobile embedded networked sensor platform , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[33]  Deborah Estrin,et al.  Controllably mobile infrastructure for low energy embedded networks , 2006, IEEE Transactions on Mobile Computing.

[34]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[35]  C. Ersoy,et al.  Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks , 2008, 2008 23rd International Symposium on Computer and Information Sciences.

[36]  Yuanyuan Yang,et al.  Optimization-Based Distributed Algorithms for Mobile Data Gathering in Wireless Sensor Networks , 2012, IEEE Trans. Mob. Comput..