Sciweavers

Share
IPSN
2005
Springer

Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

8 years 9 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Computing aggregates such as average, minimum, maximum and sum is fundamental to various primitive functions of a sensor network like system monitoring, data querying, and collaborative information processing. In this paper we present and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates. Our Distributed Random Grouping (DRG) algorithm is simple and natural and uses probabilistic grouping to progressively converge to the aggregate value. DRG is local and randomized and is naturally robust against dynamic topology changes from link/node failures. Although our algorithm is natural and simple, it is nontrivial to show that it converges to the correct aggregate value and to bound the time needed for convergence. Our analysis uses the eigen-structure of the underl...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where IPSN
Authors Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
Comments (0)
books