Order-optimal consensus through randomized path averaging

IEEE Transactions on Information Theory

Volumn 56, Issue 10, 2010, Pages 5150-5167

  Bénézit, Florence ^a   Dimakis, Alexandros G ^b   Thiran, Patrick ^a   Vetterli, Martin ^a,c  

^a EPFL   (Switzerland)

^b University of Southern California ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Average consensus; distributed algorithms; gossip algorithms; sensor networks

Indexed keywords

AVERAGE CONSENSUS; DISTANCE COMMUNICATION; DISTRIBUTED ALGORITHM; DISTRIBUTED INFORMATION PROCESSING; GEOGRAPHIC INFORMATION; GOSSIP ALGORITHMS; GRAPH TOPOLOGY; HIGH PROBABILITY; MARKOV CHAIN; MESSAGE PASSING ALGORITHM; MULTIHOP; NEAREST-NEIGHBORS; RANDOM GEOMETRIC GRAPHS; TRAVEL AGENCY;

AD HOC NETWORKS; ALGORITHMS; DATA PROCESSING; MARKOV PROCESSES; MESSAGE PASSING; OPTIMIZATION; SENSOR NETWORKS; TOPOLOGY;

WIRELESS SENSOR NETWORKS;

EID: 77956664383     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2060050     Document Type: Article

References (33)

1. T. C. Aysal, M. J. Coates, and M. G. Rabbat, "Distributed average consensus with dithered quantization," IEEE Trans. Signal Process., 2008.
2. P. Barooah, N. da Silva, and J. Hespanha, "Distributed optimal estimation from relative measurements for localization and time synchronization," presented at the DCOSS, 2006.
3. F. Bénézit, A. G. Dimakis, P. Thiran, and M. Vetterli, "Order-optimal consensus through randomized path averaging," presented at the Allerton Conf. Communication, Control, and Computing, 2007.
4. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and optimization of randomized gossip algorithms," presented at the 43rd Conf. Decision and Control, 2004.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, Special Issue joint issue with IEEE/ACM Trans. Netw., 2006.
7. P. Brémaud, Markov Chains. Gibbs Fields, Monte Carlo Simulation, and Queues. New York: Springer, 1999.
8. P. Denantes, Performance of Averaging Algorithms in Time-Varying Networks, EPFL, Tech. Rep., 2007.
9. P. Denantes, F. Bénézit, P. Thiran, and M. Vetterli, "Which distributed averaging algorithm should i choose for my sensor network?," presented at the IEEE Infocom, 2008.
10. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of markov chains," Ann. Appl. Probab., vol.1, 1991.
11. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," presented at the ACM/IEEE Symp. Information Processing in Sensor Networks, 2006.
12. F. Fagnani and S. Zampieri, "Randomized consensus algorithms over large scale networks," IEEE J. Sel. Areas Commun., 2008.
13. A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughputdelay trade-off in wireless networks," presented at the 24th Conf. IEEE Communications Society, 2004.
14. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol.46, no.2, pp. 388-404, Mar. 2000.
15. S. Kar and J. Moura, "Distributed consensus algorithms in sensor networks: Link failures and channel noise," IEEE Trans. Signal Process., 2008.
16. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," presented at the IEEE Conf. Foundations of Computer Science, 2003.
17. W. Li and H. Dai, "Location-aided fast distributed consensus," IEEE Trans. Inf. Theory, 2008.
18. C. Moallemi and B. V. Roy, Consensus Propagation, Stanford Univ., Stanford, CA, Tech. Rep., Jun. 2005.
19. 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
20. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
21. A. Nedic, A. Olshevsky, A. Ozdaglar, and J. Tsitsiklis, On Distributed Averaging Algorithms and Quantization Effects, MIT, LIDS, LIDS Tech. Rep. 2778, 2007, submitted for publication.
22. M. Penrose, "Random Geometric Graphs," in Oxford Studies in Probability. Oxford, U.K.: Oxford Univ. Press, 2003.
23. M. Rabbat, J. Haupt, A. Singh, and R. Nowak, "Decentralized compression and predistribution via randomized gossiping," presented at the ACM/IEEE Conf. Information Processing in Sensor Networks, Apr. 2006.
24. V. Saligrama, M. Alanyali, and O. Savas, "Distributed detection in sensor networks with packet losses and finite capacity links," IEEE Trans. Signal Process., vol.54, p. 4118, 2006.
25. S. Sanghavi, B. Hajek, and L. Massoulie, "Gossiping with multiple messages," IEEE Trans. Signal Process., vol.53, pp. 4640-4654, 2007.
26. O. Savas, M. Alanyali, and V. Saligrama, "Efficient in-network processing through local ad-hoc information coalescence," DCOSS, pp. 252-265, 2006.
27. J. Schiff, D. Antonelli, A. G. Dimakis, D. Chu, and M. Wainwright, "Robust message-passing for statistical inference in sensor networks," in Proc. 6th Int. Symp. Information Processing in Sensor Networks, Apr. 2007.
28. A. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow," Combin., Probab., Comput., vol.1, 1992.
29. D. Spanos, R. Olfati-Saber, and R. Murray, "Distributed Kalman filtering in sensor networks with quantifiable performance," presented at the 4th Int. Symp. Information Processing in Sensor Networks, 2005.
30. A. Tahbaz-Salehi and A. Jadbabaie, IEEE Trans. Autom. Control, vol.53, no.3, pp. 791-795, 2008.
31. J. Tsitsiklis, "Problems in Decentralized Decision-Making and Computation," Ph.D. dissertation, Dept. EECS, Massachusetts Inst. Technol., Cambridge, MA, 1984.
32. L. Xiao, S. Boyd, and S. Lall, "A scheme for asynchronous distributed sensor fusion based on average consensus," presented at the 4th Int. Symp. Information Processing in Sensor Networks, 2005.
33. A. G. Dimakis, S. Kar, J.M. F.Moura, M. G. Rabbat, and A. Scaglione, "Gossip algorithms for distributed signal processing," Proc. IEEE, Special Issue on Sensor Network Applications, to be published.