@inproceedings{
    HSTO07,
    editor = "Zhang, H. and Olariu, S. and Cao, J. and Johnson, D. B.",
    author = "Haanpää, Harri and Schumacher, André and Thaler, Thorn and Orponen, Pekka",
    volume = "4864",
    responsibleauthor = "Schumacher, André",
    title = "Distributed computation of maximum lifetime spanning subgraphs in sensor networks",
    url = "http://dx.doi.org/10.1007/978-3-540-77024-4_41",
    series = "Lecture Notes in Computer Science",
    booktitle = "Proceedings of the 3rd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'07, Beijing, China, December 2007)",
    publisher = "Springer-Verlag",
    corerank = "NA",
    abstract = "We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor network with stationary nodes and static power assignments. Our algorithm determines the transmission power level inducing the maximum-lifetime spanning subgraph of a network by means of a distributed breadth-first search for minmax-power communication paths starting from a given reference node. The performance of the resulting Maximum Lifetime Spanner (MLS) protocol is validated in a number of simulated networking scenarios. In particular, we study the performance of the protocol in terms of the number of required control messages, and compare it to the performance of a recently proposed Distributed Min-Max Tree (DMMT) algorithm. For all network scenarios we consider, MLS outperforms DMMT significantly. We also discuss bringing down the message complexity of our algorithm by initialising it with the Relative Neighbourhood Graph (RNG) of a transmission graph rather than the full graph, and present an efficient distributed method for reducing a given transmission graph to its RNG.",
    note = "",
    flags = "copy public",
    year = "2007",
    keywords = "sensor networks, wireless networks, lifetime maximisation, energy-aware computation, distributed computation, relative neighbourhood graphs",
    impactfactor = "D3",
    pages = "445--456",
    address = "Berlin Heidelberg"
}