An Energy-Efficient Data Collection Mechanism with a Mobile Sink for Wireless Sensor Networks

For wireless sensor networks (WSNs), mobile sink is an effective approach to extend network lifetime. In underwater or disconnected network, multi-hop routing mechanism is not applicable because of long transmission delay, high error rate, or disconnected network. Hence, it is necessary to use mobile sinks in order to collect data. In this paper, we consider the problem of collecting data from each sensor into the mobile sinks with energy constraints. We formulate the tour planning of a mobile sink collecting sensor data to the ellipse graph. Our scheme is to minimize the distance of the total tour and the total energy consumption, while satisfying the energy constraint of mobile sinks. Simulation results show that our scheme can effectively collect sensor data.

[1]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Yu-Chee Tseng,et al.  Using Mobile Mules for Collecting Data from an Isolated Wireless Sensor Network , 2010, 2010 39th International Conference on Parallel Processing.

[3]  Baoxian Zhang,et al.  Data Gathering Protocols for Wireless Sensor Networks with Mobile Sinks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

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

[6]  Yuanyuan Yang,et al.  Bounded relay hop mobile data gathering in wireless sensor networks , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[7]  Ke Li,et al.  Energy-constrained bi-objective data muling in underwater wireless sensor networks , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[8]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[9]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[10]  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).

[11]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[12]  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..

[13]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..