Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
verfasst von : André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää
Erschienen in: Wireless Sensor Networks
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.