Brief announcement

Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
2009 Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09  
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages and O( n 3/2 log 1/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
more » ... transmissions than other gossip-based schemes.
doi:10.1145/1582716.1582775 dblp:conf/podc/ChenPH09 fatcat:5baj6camenghhodbipeslknx6y