Distributed algorithm for lifetime maximization in delay-tolerant wireless sensor network with mobile sink

We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some degree of delay in delivering the data to the sink. Our main contribution is that the algorithm is distributed, and in addition, mostly uses local information. Such an algorithm can be implemented by parallel and/or distributed execution and the overhead of message passing is low. It is also possible to embed the algorithm into a network protocol so that the senor nodes and the sink can run it directly as part of the network operation. Our second contribution is that we give a proof of the algorithm's optimality and the boundedness of the queue sizes, both in the long-run average sense. The proof is based on analyzing a Lyapunov drift.

[1]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[2]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

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

[4]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[6]  Wei Wang,et al.  Using mobile relays to prolong the lifetime of wireless sensor networks , 2005, MobiCom '05.

[7]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

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

[9]  Sajal K. Das,et al.  Avoiding Energy Holes in Wireless Sensor Networks with Nonuniform Node Distribution , 2008, IEEE Transactions on Parallel and Distributed Systems.

[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]  Ye Xia,et al.  Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications , 2010, IEEE Transactions on Mobile Computing.

[12]  Ioannis Papadimitriou,et al.  Maximum Lifetime Routing to Mobile Sink in Wireless Sensor Networks , 2005 .

[13]  Jian Li,et al.  Analytical modeling and mitigation techniques for the energy hole problem in sensor networks , 2007, Pervasive Mob. Comput..

[14]  Leandros Tassiulas,et al.  Maximum lifetime routing in wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[15]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

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

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

[18]  Emanuel Melachrinoudis,et al.  A New MILP Formulation and Distributed Protocols for Wireless Sensor Networks Lifetime Maximization , 2006, 2006 IEEE International Conference on Communications.

[19]  Leonidas Georgiadis,et al.  A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink , 2006, IEEE Transactions on Wireless Communications.