Sciweavers

MSN
2007
Springer

Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks

13 years 8 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
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, i.e. paths that connect a given reference node to each of the other nodes so that the maximum transmission power required on any link of the path is minimised. 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 ...
Harri Haanpää, André Schumacher,
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where MSN
Authors Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen
Comments (0)