Topology design for fast convergence of network consensus algorithms

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2007, Pages 1029-1032

  Cao, Ming ^a   Wu, Chai Wah ^b  

^a Yale University   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; TOPOLOGY;

ALGEBRAIC CONNECTIVITY; ERGODICITY; FAST CONVERGENCE;

COMPUTER NETWORKS;

EID: 34548821643     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscas.2007.378145     Document Type: Conference Paper

References (21)

1. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation. Prentice Hall, 1989.
2. N. A. Lynch, Distributed algorithms. San Francisco: Morgan Kaufmann Publishers, 1996.
3. A. Jababaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Transactions on Automatic Control, vol. 48, pp. 988-1001, 2003.
4. M. Cao, A. S. Morse, and B. D. O. Anderson, "Reaching a consensus in a dynamically changing environment - A graphical approach," April 2006. Submitted to SIAM Journal on Control and Optimization.
5. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with swiching topology and time-delays," IEEE Transactions on Automatic Control, vol. 49, pp. 101-115, 2004.
6. M. Cao, D. A. Spielman, and A. S. Morse, "A lower bound on convergence of a distributed network consencus algorithm," in Proc. of the 44th IEEE CDC, pp. 2356-2361, 2005.
7. A. Olshevsky and J. N. Tsitsiklis, "Convergence speed in distributed consensus and averaging," in Proc. of the 45th IEEE CDC, 2006.
8. C. C. Moallemi and B. V. Roy, "Consensus propagation," IEEE Transactions on Information Theory. To appear.
9. C. W. Wu, "Agreement and consensus problems in groups of autonomous agents with linear dynamics," in Proceedings of 2005 IEEE International Symposium, on Circuits and Systems, pp. 292-295, 2005.
10. L. Xiao and S. Boyd, "Fast linear iteration for distributed averaging," System and control letters, vol. 53, pp. 65-78, 2004.
11. V. D. Blondel, J. M. Hendrichx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. of the 44th IEEE CDC, pp. 2996-3000, 2005.
12. J. Hajnal, "Weak ergodicity in nonhomogeneous markov chains," Proc. Comb. Phil Soc., vol. 54, pp. 233-246, 1958.
13. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Mathematical. Journal, vol. 23, no. 98, pp. 298-305, 1973.
14. C. W. Wu, "Algebraic connectivity of directed graphs," Linear and multilinear algebra, vol. 53, pp. 203-223, 2005.
15. R. Diestel, Graph Theory. Springer-Verlag New York, Inc., 1997.
16. R. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge University Press, 1985.
17. E. Seneta, "Coefficients of ergodicity: structure and applications," Advances in applied probability, vol. 11, pp. 576-590, 1979.
18. X. F. Wang and G. R. Chen, "Synchronization in small-world dynamical networks," International Journal, of Bifurcation and chaos, vol. 12, pp. 187-192, 2001.
19. C. W. Wu, "Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic circuits," Physics Letters A, vol. 319, pp. 495-503, 2003.
20. S. Kar, S. Aldosari, and J. M. F. Moura, "Topology for distributed inference on graphs," 2006. submitted.
21. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440-442, May 1998.