An optimal data propagation algorithm for maximizing the lifespan of sensor networks

Authors:
Aubin Jarry;Pierre Leone;Olivier Powell;José Rolim
Affiliations:
Department of Informatics, University of Geneva, Switzerland;Department of Informatics, University of Geneva, Switzerland;Department of Informatics, University of Geneva, Switzerland;Department of Informatics, University of Geneva, Switzerland
Venue:
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Year:
2006

Citing 6
Cited 16

Smart dust protocols for local detection and propagation

Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking

Computer
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Energy balanced data propagation in wireless sensor networks

Wireless Networks
An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Energy optimal data propagation in wireless sensor networks

Journal of Parallel and Distributed Computing
Mitigating energy holes based on transmission range adjustment in wireless sensor networks

Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Maximizing network lifetime based on transmission range adjustment in wireless sensor networks

Computer Communications
Distributed routing in wireless sensor networks using energy welfare metric

Information Sciences: an International Journal
A novel approach for trade-off between computation and communication cost in wireless sensor networks

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Optimal data gathering paths and energy-balance mechanisms in wireless networks

Ad Hoc Networks
A pre-determined node deployment strategy to prolong network lifetime in wireless sensor network

Computer Communications
Close-to-optimal energy balanced data propagation via limited, local network density information

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Energy balanced data propagation in wireless sensor networks with diverse node mobility

Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Data propagation with guaranteed delivery for mobile networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Optimal data gathering paths and energy balance mechanisms in wireless networks

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Efficient energy management in wireless rechargeable sensor networks

Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Exploiting limited density information towards near-optimal energy balanced data propagation

Computer Communications
Avoiding Energy Holes to Maximize Network Lifetime in Gradient Sinking Sensor Networks

Wireless Personal Communications: An International Journal
Adaptive, limited knowledge wireless recharging in sensor networks

Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Full Length Article: Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

Information Fusion

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.