Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime

This paper explores the idea of exploiting the mobility of data collection points (sinks) for the purpose of increasing the lifetime of a wireless sensor network with energy-constrained nodes. We give a novel linear programming formulation for the joint problems of determining the movement of the sink and the sojourn time at different points in the network that induce the maximum network lifetime. Differently from previous solutions, our objective function maximizes the overall network lifetime (here defined as the time till the first node "dies" because of energy depletion) rather than minimizing the energy consumption at the nodes. For wireless sensor networks with up to 256 nodes our model produces sink movement patterns and sojourn times leading to a network lifetime up to almost five times that obtained with a static sink. Simulation results are performed to determine the distribution of the residual energy at the nodes over time. These results confirm that energy consumption varies with the current sink location, being the nodes more drained those in the proximity of the sink. Furthermore, the proposed solution for computing the sink movement results in a fair balancing of the energy depletion among the network nodes.

[1]  Ioannis Chatzigiannakis,et al.  An adaptive compulsory protocol for basic communication in highly changing ad-hoc mobile networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

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

[5]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[6]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[7]  Jorjeta G. Jetcheva,et al.  Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks , 2001, MobiHoc '01.

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

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

[10]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[11]  Paul G. Spirakis,et al.  An Efficient Communication Strategy for Ad-hoc Mobile Networks , 2001, DISC.

[12]  Mani Srivastava,et al.  Energy efficient routing in wireless sensor networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[13]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[14]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[15]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[16]  Edgar H. Callaway,et al.  Wireless Sensor Networks: Architectures and Protocols , 2003 .