@inproceedings{
    SOTH08,
    editor = "Verdone, R.",
    author = "Schumacher, André and Orponen, Pekka and Thaler, Thorn and Haanpää, Harri",
    volume = "4913",
    responsibleauthor = "Schumacher, André",
    title = "Lifetime maximisation in wireless sensor networks by distributed binary search",
    url = "http://dx.doi.org/10.1007/978-3-540-77690-1_15",
    series = "Lecture Notes in Computer Science",
    booktitle = "Proceedings of the 5th European Conference on Wireless Sensor Networks (EWSN'08, Bologna, Italy, January 2008)",
    publisher = "Springer-Verlag",
    corerank = "A",
    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.",
    note = "",
    flags = "copy public",
    year = "2008",
    keywords = "sensor networks, wireless networks, lifetime maximisation, energy-aware computation, distributed computation",
    impactfactor = "D3",
    pages = "237--252",
    address = "Berlin Heidelberg"
}