Geographic gossip: Efficient averaging for sensor networks

IEEE Transactions on Signal Processing

Volumn 56, Issue 3, 2008, Pages 1205-1216

  Dimakis, Alexandros D G ^a   Sarwate, Anand D ^a   Wainwright, Martin J ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Aggregation problems; Consensus problems; Distributed signal processing; Gossip algorithms; Message passing algorithms; Random geometric graphs; Sensor networks

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; MATHEMATICAL MODELS; MESSAGE PASSING; SENSOR NETWORKS;

DISTRIBUTED SIGNAL PROCESSING; GOSSIP ALGORITHMS; RANDOM GEOMETRIC GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 40749127156     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.908946     Document Type: Article

References (31)

1. A. D. G. Dimakis, A. D. Sarwate, and M. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," presented at the 5th Int. Symp. Information Processing in Sensor Networks (IPSN 2006), Nashville, TN, Apr. 2006.
2. D. Spanos, R. Olfati-Saber, and R. Murray, "Distributed Kalman filtering in sensor networks with quantifiable performance," in 2005 4th Int. Symp. Information Processing in Sensor Networks, Los Angeles, CA, 2005, pp. 133-139.
3. M. Rabbat, J. Haupt, A. Singh, and R. Nowak, "Decentralized compression and predistribution via randomized gossiping," presented at the 5th Int. Conf. Information Processing in Sensor Networks (IPSN 2006), Nashville, TN, Apr. 2006.
4. N. Alon, A. Barak, and U. Manber, "On disseminating information reliably without broadcasting," in Proc. 7th Int. Conf. Distributed Computing Systems (ICDS), Berlin, Germany, Sep. 1987, pp. 74-81.
5. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, "Rangefree localization schemes for large scale sensor networks," in Proc. 9th Annu. Int. Conf. Mobile Computing Networking, 2003.
6. D. Mosk-Aoyama and D. Shah, Information Dissemination via Gossip: Applications to Averaging and Coding. Apr. 2005 [Online]. Available: http://arxiv.org/cs.NI/0504029
7. G. Pottie and W. Kaiser, "Wireless integrated network sensors," Commun. ACM, vol. 43, pp. 51-58, May 2000.
8. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, "Randomized rumor spreading," in Proc. IEEE Conf. Foundations of Computer Science (FOCS), 2000.
9. K. Langendoen and N. Reijers, "Distributed localization in wireless sensor networks: A quantitative comparison," Comput. Netw., vol. 43, no. 4, pp. 499-518, Nov. 2003.
10. M. H. deGroot, "Reaching a consensus," J. Amer. Stat. Assoc., vol. 69, pp. 118-121, Mar. 1974.
11. J. Tsitsiklis, "Problems in decentralized decision-making and computation," PhD dissertation, EECS Dept., MIT, Cambridge, MA, 1984.
12. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. IEEE Conf. Foundations of Computer Science (FOCS), 2003.
13. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and optimization of randomized gossip algorithms," in Proc. 43rd Conf. Decision and Control (CDC 2004), 2004.
14. L. Xiao, S. Boyd, and S. Lall, "A scheme for asynchronous distributed sensor fusion based on average consensus," in Proc. 2005 4th Int. Symp. Information Processing in Sensor Networks, 2005.
15. V. Saligrama, M. Alanyali, and O. Savas, "Distributed detection in sensor networks with packet losses and finite capacity links," IEEE Trans. Signal Process., vol. 55, no. 11, pp. 4118-4132, Nov. 2006.
16. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis and applications," in Proc. 24th Conf. IEEE Communications Society (INFOCOM 2005), 2005.
17. J.-Y. Chen and D. X. G. Pandurangan, "Robust aggregates computation in wireless sensor networks: Distributed randomized algorithms and analysis," in Proc. 2005 4th Int. Symp. Information Processing in Sensor Networks, 2005.
18. C. C. Moallemi and B. van Roy, "Consensus propagation," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 1-13, Nov. 2006.
19. M. Alanyali, V. Saligrama, and O. Savas, "A random-walk model for distributed computation in energy-limited networks," presented at the 1st Workshop Information Theory and Its Applications, San Diego, CA, 2006.
20. M. Penrose, "Oxford studies in probability," in Random Geometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2003.
21. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, pp. 388-404, Mar. 2000.
22. A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughputdelay trade-off in wireless networks," in Proc. 24th Conf. IEEE Communications Society (INFOCOM 2004), 2004.
23. B. Bash, J. Byers, and J. Considine, "Approximately uniform random sampling in sensor networks," in Proc. 1st Workshop on Data Management in Sensor Networks (DMSN '04), Aug. 2004.
24. P. Flajolet and G. Martin, "Probabilistic counting algorithms for data base applications," J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, 1985.
25. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, pp. 2508-2530, Jun. 2006.
26. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, 2007 [Online]. Available: http://www.stat.berkeley.edu/ ~aldous/RWG/book.html, in preparation
27. B. Karp and H. Kung, "Greedy perimeter stateless routing," in Proc. ACM Conf. Mobile Computing and Networking (MOBICOM), Boston, MA, 2000, pp. 243-254, ACM.
28. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
29. R. Horn and C. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1987.
30. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proc. 25th ACM Symp. Principles of Distributed Computing Jul. 2006.
31. M. Rabbat, R. Nowak, and J. Bucklew, "Robust decentralized source localization via averaging," presented at the IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), Philadelphia, PA, Mar. 2005.