Lifetime maximisation in wireless sensor networks by distributed binary search

Reference:

André Schumacher, Pekka Orponen, Thorn Thaler, and Harri Haanpää. Lifetime maximisation in wireless sensor networks by distributed binary search. In R. Verdone, editor, Proceedings of the 5th European Conference on Wireless Sensor Networks (EWSN'08, Bologna, Italy, January 2008), volume 4913 of Lecture Notes in Computer Science, pages 237–252, Berlin Heidelberg, 2008. Springer-Verlag.

Abstract:

We consider the problem of determining the transmission power assignment that maximises 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.

Keywords:

sensor networks, wireless networks, lifetime maximisation, energy-aware computation, distributed computation

Suggested BibTeX entry:

@inproceedings{SOTH08,
    address = {Berlin Heidelberg},
    author = {Andr\'e Schumacher and Pekka Orponen and Thorn Thaler and Harri Haanp\"a\"a},
    booktitle = {Proceedings of the 5th European Conference on Wireless Sensor Networks (EWSN'08, Bologna, Italy, January 2008)},
    editor = {R. Verdone},
    pages = {237--252},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {Lifetime maximisation in wireless sensor networks by distributed binary search},
    volume = {4913},
    year = {2008},
}