Broadcast gossip algorithms for consensus

IEEE Transactions on Signal Processing

Volumn 57, Issue 7, 2009, Pages 2748-2761

  Aysal, Tuncer Can ^a   Yildiz, Mehmet Ercan ^a   Sarwate, Anand D ^b,c   Scaglione, Anna ^a,d  

^a Cornell University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d University of California   (United States)

Author keywords

Broadcasting; Distributed average consensus; Gossip algorithms; Sensor networks

Indexed keywords

BROADCASTING ALGORITHM; COMMUNICATION COST; CONNECTED NETWORKS; CONNECTIVITY MODEL; CONVERGENCE RATES; CONVERGENCE SPEED; DISTRIBUTED AVERAGE CONSENSUS; GOSSIP ALGORITHMS; MEAN SQUARE; MEAN SQUARED ERROR; MIXING PARAMETERS; NUMERICAL RESULTS; PEER TO PEER; WIRELESS SENSOR;

AD HOC NETWORKS; ALGORITHMS; BROADCASTING; MEAN SQUARE ERROR; SENSOR NETWORKS; THREE TERM CONTROL SYSTEMS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

CONVERGENCE OF NUMERICAL METHODS;

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

References (37)

1. T. C. Aysal, M. E. Yildiz, and A. Scaglione, "Broadcast gossip algorithms," in Proc. 2008 IEEE Inf. Theory Workshop, Porto, Portugal, May 2008.
2. T. Aysal, M. Yildiz, A. Sarwate, and A. Scaglione, "Broadcast gossip algorithms- Design and analysis for consensus," in Proc. 47th IEEE Conf. Decision Contr. (CDC 2008), Cancun, Mexico, Dec. 2008.
3. C.C. Moallemi and B. V. Roy, "Consensus propagation," IEEE Trans. Inf. Theory, vol. 52, pp. 4753-4766, Nov. 2006.
4. R. Olfati-Saber and R. Murray, "Consensus problems in networks of agents with switching topology and time delays," IEEE Trans. Autom. Control, vol. 49, pp. 1520-1533, Sep. 2004.
5. W. Ren and R. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, pp. 655-661, 2005.
6. T. Vicsek, A. Czirok, E. B. Jacob, I. Cohen, and O. Schochet, "Novel type of phase transitions in a system of self-driven particles," Phys. Rev. Lett., vol. 75, pp. 1226-1229, 1995.
7. Y. Hatano and M. Mesbahi, "Agreement over random networks," in Proc. IEEE Conf. Decision Contr., Paradise Island, The Bahamas, Dec. 2004.
8. A. T. Salehi and A. Jadbabaie, "On consensus in random networks," in The Allerton Conf. Commun, Contr., Comput., Allerton House, IL, Sep. 2007.
9. S. Kar and J. M. F. Moura, "Sensor networks with random links: Topology design for distributed consensus," IEEE Trans. Signal Process., vol. 56, pp. 3315-3326, 2008.
10. N. Lynch, Distributed Algorithms. San Francisco, CA: Morgan Kaufmann, 1996.
11. L. Xiao, S. Boyd, and S. Lall, "A scheme for robust distributed sensor fusion based on average consensus," in Proce. IEEE/ACM Int. Symp. Inf. Process. Sensor Netw., Los Angeles, CA, Apr. 2005.
12. Y. Rabani, A. Sinclair, and R. Wanka, "Local divergence of markov chains and the analysis of iterative load-balancing schemes," in Proc. IEEE Symp. Found. Comput. Sci., Palo Alto, CA, Nov. 1998.
13. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, pp. 988-1001, 2003.
14. J. Tsitsiklis, "Problems in Decentralized Decision Making and Computation," Ph.D. dissertation, Dept. Elec. Eng. Comput. Sci., Massachusetts Inst. Technol. (M.I.T.), Boston, MA, 1984.
15. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, pp. 2508-2530, Jun. 2006.
16. D. Kempe, A. Dobra, and J. Gehrke, "Computing aggregate information using gossip," in Proc. Found. Comput. Sci., Cambridge, MA, Oct. 2003.
17. A. Nedic, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, "On distributed averaging algorithms and quantization effects," MIT, Cambridge, MA, LIDS Rep. 2274, 2007.
18. A. Nedic and A. Ozdaglar, "Convergence rate for consensus with delays," MIT, Cambridge, MA, LIDS Rep. 2774, 2007.
19. T. C. Aysal, M. J. Coates, and M. G. Rabbat, "Rates of convergence of distributed average consensus with probabilistic quantization," in Proc. Allerton Conf. Commun., Contr., Comput., Monticello, IL, Sep. 2007.
20. T. Aysal, M. Coates, and M. Rabbat, "Distributed average consensus using dithered quantization," IEEE Trans. Signal Process., vol. 56, pp. 4905-4918, 2008.
21. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient averaging for sensor networks," IEEE Trans. Signal Process., vol. 56, Mar. 2008.
22. F. Benezit, A. G. Dimakis, P. Thiran, and M. Vetterli, "Gossip along the way: Order-optimal consensus through randomized path averaging" in Proc. Allerton Conf. Commun., Contr., Comput., Allerton, IL, Sep. 2007.
23. T.C. Aysal, M. J. Coates, and M. G. Rabbat, "Distributed average consensus using probabilistic quantization," in Proc. IEEE Statist. Signal Process. Workshop, Madison, WI, Aug. 2007.
24. M.E. Yildiz and A. Scaglione, "Differential nested lattice encoding for consensus problems," in Proc. Inf. Process. Sensor Netw., Cambridge, MA, Apr. 2007.
25. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proc. 2006 ACM Symp. Principles of Distrib. Comput. (PODC), Denver, CO, Jul. 2006.
26. O. Ayaso, D. Shah, and M. Dahleh, "Lower bounds on information rates for distributed computation via noisy channels," in Proc. 45th Allerton Conf. Commun., Contr., Comput., Allerton, IL, Sep. 2007.
27. O. Ayaso, D. Shah, and M. Dahleh, "Counting bits for distributed function computation," in Proc. 2008 IEEE Symp. Inf. Theory (ISIT 2008), Toronto, ON, Canada, Jul. 2008.
28. F. Fagnani and S. Zampieri, "Randomized consensus algorithms over large scale networks," IEEE J. Sel. Areas Commun., vol. 26, pp. 634-649, 2008.
29. A. Giridhar and P. R. Kumar, "Towards a theory of in-network computation in wireless sensor networks," IEEE Commun. Mag., vol. 44, pp. 98-107, Apr. 2006.
30. A. Browder, Mathematical Analysis: An Introduction. New York: Springer-Verlag, 1996.
31. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging" Syst. Contr. Lett., vol. 53, pp. 65-78, 2004.
32. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1987.
33. 1, isoperimetric inequalities for graphs, and superconcentrators," J. Combin. Theory, Series B, vol. 38, pp. 73-88, 1985.
34. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," in Proc. Inf. Process. Sensor Netw., Nashville, TN, Apr. 2006.
35. S. Kar and J. M. F. Moura, "Distributed consensus algorithms in sensor networks with communication channel noise and random link failures," in Proc. 41st Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2007.
36. B. Polyak, Introduction to Optimization. New York: Optimization Software, Inc., 1987.
37. B. Mohar, "The Laplacian spectrum of graphs," in Graph Theory, Combinatories, and Applications, Y. Alavi, G. Chartrand, O. Oellermann, and A. Schwenk, Eds. New York: Wiley, 1991, vol. 2, pp. 871-898.