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

Authors:
Harri Haanpää;André Schumacher;Pekka Orponen
Affiliations:
Department of Information and Computer Science, Helsinki University of Technology TKK, Helsinki, Finland;Department of Information and Computer Science, Helsinki University of Technology TKK, Helsinki, Finland;Department of Information and Computer Science, Helsinki University of Technology TKK, Helsinki, Finland
Venue:
Wireless Networks
Year:
2010

Citing 13
Cited 0

A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
Introduction to Algorithms

Introduction to Algorithms
Self-stabilizing multicast protocols for ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications
Towards optimal sleep scheduling in sensor networks for rare-event detection

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks

Mobile Networks and Applications
RNG-based searching and broadcasting algorithms over Internet graphs and peer-to-peer computing systems

AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Tree-based distributed multicast algorithms for directional communications and lifetime optimization in wireless ad hoc networks

EURASIP Journal on Wireless Communications and Networking
A survey on sensor networks

IEEE Communications Magazine
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications
Lifetime maximization for multicasting in energy-constrained wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 minmax-cost 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.