Sciweavers

Share
WINET
2010

Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs

8 years 5 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario. Using a graph-theoretic approach, we propose two distributed algorithms, MLS and BSPAN, that construct spanning trees with minimum maximum (minmax) edge cost. MLS is based on computation of minmaxcost paths from a reference node, while BSPAN performs a binary search over the range of power levels and exploits the wireless broadcast advantage. We also present a simple distributed method for pruning a graph to its Relative Neighborhood Graph, which reduces the worst-case message complexity of MLS under natural assumptions on the path-loss. In our network simulations both MLS and BSPAN significantly outperform the recently proposed Distributed Min-Max Tree algorithm in terms of number of messages required.
Harri Haanpää, André Schumacher,
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where WINET
Authors Harri Haanpää, André Schumacher, Pekka Orponen
Comments (0)
books