Brief announcement: locality-based aggregate computation in wireless sensor networks

Authors:
Jen-Yeu Chen;Gopal Pandurangan;Jianghai Hu
Affiliations:
National Dong Hwa University, Hualien, Taiwan ROC;Purdue University, W. Lafayette, IN, USA;Purdue University, W. Lafayette, IN, USA
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 5
Cited 2

Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Geographic gossip: efficient aggregation for sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
Efficient gossip-based aggregate computation

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis

IEEE Transactions on Parallel and Distributed Systems

Fault-Tolerant aggregation: flow-updating meets mass-distribution

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An early-stopping protocol for computing aggregate functions in Sensor Networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages and O(n3/2/log1/2 n) one-hop wireless transmissions to obtain aggregates on a random geometric graph. This reduces the energy consumption by at least a factor of 1/log n over the standard uniform gossip algorithm. Experiments validate the theoretical results and show that DRR-gossip needs much less transmissions than other gossip-based schemes.