Improved sensor network lifetime with multiple mobile sinks

A critical issue for data gathering in wireless sensor networks is the formation of energy holes near the sinks. Sensors near the sinks have to participate in relaying data on behalf of other sensors and thus will deplete their energy very quickly, resulting in network partitioning and limitation of the network lifetime. The solution that we propose in this paper is to use mobile sinks that change their location when the nearby sensors' energy becomes low. In this way the sensors located near sinks change over time. In deciding a new location, a sink searches for zones with richer sensor energy. First, we study the improvement in network lifetime when sinks move on a predetermined path, along the perimeter of a hexagonal tiling. Two cases are considered for data gathering when sinks stop in the hexagon's corners and when the sinks stop on multiple locations on the hexagon perimeter. This study shows an improvement of up to 4.86 times in network lifetime. Second, we design a distributed and localized algorithm used by the sinks to decide their next movement location such that the virtual backbone formed by the sinks remains interconnected at all times. Two extensions of the distributed algorithm, coverage requirement and limitation of the time-delivery requirement, are also addressed. Simulation results are presented to verify our approaches.

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

[2]  Jie Wu,et al.  On Maintaining Sensor-Actor Connectivity in Wireless Sensor and Actor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[4]  Jian Li,et al.  An analytical model for the energy hole problem in many-to-one sensor networks , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[5]  Xiuzhen Cheng,et al.  TPS: a time-based positioning scheme for outdoor wireless sensor networks , 2004, IEEE INFOCOM 2004.

[6]  Limin Sun,et al.  HUMS: An Autonomous Moving Strategy for Mobile Sinks in Data-Gathering Sensor Networks , 2007, EURASIP J. Wirel. Commun. Netw..

[7]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

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

[9]  Ivan Stojmenovic,et al.  Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  M. N. Giriprasad,et al.  ENERGY EFFICIENT COVERAGE PROBLEMS IN WIRELESS Ad Hoc SENSOR NETWORKS , 2011 .

[11]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[12]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

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

[14]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

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