Data gathering in wireless sensor networks with mobile collectors

In this paper, we propose a new data gathering mechanism for large scale wireless sensor networks by introducing mobility into the network. A mobile data collector, or for convenience called M-collector in this paper, could be a mobile robot or a vehicle equipped with a powerful transceiver and battery, works like a mobile base station and gathers data while moving through the field. An M-collector starts the data gathering tour periodically from the static data sink, polls each sensor while traversing the transmission range of the sensor, then collects data directly from the sensor without relay (i.e., in a single hop), finally returns and uploads data to the data sink. Since data packets are gathered directly without relay and collision, the lifetime of sensors is expected to be prolonged, and sensors can be made very simple and inexpensive. We focus on the problem of minimizing the length of each data gathering tour and refer to this problem as the single-hop data gathering problem, or SHDGP for short. We first formalize the SHDGP problem into a mixed integer program and prove its NP-hardness. We then present a heuristic tour-planning algorithm for a single M-collector. For the applications with a strict distance/time constraint for each data gathering tour, we also utilize multiple M-collectors to traverse through several shorter sub-tours concurrently to satisfy the distance/time constraint. Our single-hop data gathering scheme will improve the scalability and solve intrinsic problems of large scale homogeneous networks, and can be used in both connected networks and disconnected networks. The simulation results demonstrate that the new data gathering algorithm can greatly reduce the moving distance of the collectors compared to the covering line approximation algorithm, and is close to the optimal algorithm in small networks. In addition, the proposed data gathering scheme can prolong the network lifetime significantly compared to a network which has only a static data collector, or a network in which the mobile collector can only move along straight lines.

[1]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[2]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3]  Mani B. Srivastava,et al.  Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines , 2004, 25th IEEE International Real-Time Systems Symposium.

[4]  Chen Zhang,et al.  ExScal: elements of an extreme scale wireless sensor network , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

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

[6]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[7]  Ashutosh Sabharwal,et al.  Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.

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

[9]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[10]  Gang Zhou,et al.  RID: radio interference detection in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Sandeep K. S. Gupta,et al.  Research challenges in wireless networks of biomedical sensors , 2001, MobiCom '01.

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[14]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[15]  Yuanyuan Yang,et al.  Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks , 2008, IEEE Transactions on Computers.

[16]  Gang Zhou,et al.  Impact of radio irregularity on wireless sensor networks , 2004, MobiSys '04.

[17]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[18]  Stefano Chessa,et al.  Crash faults identification in wireless sensor networks , 2002, Comput. Commun..

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

[20]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[22]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[23]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

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

[25]  Yuanyuan Yang,et al.  Energy efficient multi-hop polling in clusters of two-layered heterogeneous sensor networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[26]  Yang Zhang,et al.  CarTel: a distributed mobile sensor computing system , 2006, SenSys '06.

[27]  Edoardo S. Biagioni,et al.  The Application of Remote Sensor Technology To Assist the Recovery of Rare and Endangered Species , 2002, Int. J. High Perform. Comput. Appl..

[28]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.