The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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, such as 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 <it>Distributed Random Grouping (DRG)</it> 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 eigenstructure of the underlying graph in a novel way to show convergence and to bound the running time of our algorithms. We also present simulation results of our algorithm and compare its performance to various other known distributed algorithms. Simulations show that DRG needs far fewer transmissions than other distributed localized schemes.</p>
Probabilistic algorithms, randomized algorithms, distributed algorithms, sensor networks, fault tolerance, graph theory, aggregate, data query, stochastic processes.

G. Pandurangan, J. Chen and D. Xu, "Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 987-1000, 2006.
88 ms
(Ver 3.3 (11022016))