Lifetime maximization in wireless sensor networks by distributed binary search

Authors:
André Schumacher;Pekka Orponen;Thorn Thaler;Harri Haanpää
Affiliations:
Lab. for Theoretical Computer Science, Helsinki University of Technology, Finland;Lab. for Theoretical Computer Science, Helsinki University of Technology, Finland;Lab. for Theoretical Computer Science, Helsinki University of Technology, Finland;Lab. for Theoretical Computer Science, Helsinki University of Technology, Finland
Venue:
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Year:
2008

Citing 9
Cited 0

A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications
Towards optimal sleep scheduling in sensor networks for rare-event detection

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks

Mobile Networks and Applications
Tree-based distributed multicast algorithms for directional communications and lifetime optimization in wireless ad hoc networks

EURASIP Journal on Wireless Communications and Networking
A survey on sensor networks

IEEE Communications Magazine
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications
Lifetime maximization for multicasting in energy-constrained wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static transmission power levels. We present a simple and efficient distributed algorithm for this task that works by establishing the minimum power level at which the network stays connected. The algorithm is based on a binary search over the range of feasible transmission power levels and does not require prior knowledge of network topology. We study the performance of the resulting BSpan protocol by network simulations and compare the number of control messages required by BSpan to two other recently proposed methods, the Distributed Min-Max Tree (DMMT) and Maximum Lifetime Spanner (MLS) algorithms. We find that BSpan outperforms both DMMT and MLS significantly.