An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks

We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing the energy among individual sensors and maximizing the message flow in the network are equivalent. We propose a distributed and adaptive data propagation algorithm for balancing the energy among sensors in the network. The mixed routing algorithm we propose allows each sensor node to either send a message to one of its immediate neighbors, or to send it directly to the base station, the decision being based on a potential function depending on its remaining energy. By considering a simple model of the network and using a linear programming description of the message flow, we prove the strong result that an energy-balanced mixed strategy beats every other possible routing strategy in terms of lifespan maximization. Moreover, we provide sufficient conditions for ensuring the dynamic stability of the algorithm. The algorithm is inspired by the gradient-based routing scheme but by allowing to send messages directly to the base station we improve considerably the lifespan of the network. As a matter of fact, we show experimentally that our algorithm is close to optimal and that it even beats the best centralized multi-hop routing strategy.

[1]  José D. P. Rolim,et al.  An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks , 2005, DCOSS.

[2]  Paul G. Spirakis,et al.  Smart dust protocols for local detection and propagation , 2002, POMC '02.

[3]  José D. P. Rolim,et al.  Energy optimal data propagation in wireless sensor networks , 2005, J. Parallel Distributed Comput..

[4]  José D. P. Rolim,et al.  Energy balanced data propagation in wireless sensor networks , 2006, Wirel. Networks.

[5]  Viktor K. Prasanna,et al.  Maximum Data Gathering in Networked Sensor Systems , 2005, Int. J. Distributed Sens. Networks.

[6]  Paul G. Spirakis,et al.  A probabilistic algorithm for efficient and robust data propagation in smart dust networks , 2004 .

[7]  Jamal N. Al-Karaki,et al.  A Taxonomy of Routing Techniques in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

[8]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[9]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains: Ideology of induced chains , 1995 .

[10]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

[11]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains , 1995 .

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

[13]  José D. P. Rolim,et al.  Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy , 2005, ArXiv.

[14]  Jan M. Rabaey,et al.  PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking , 2000, Computer.