Steady-state analysis of a quantized average consensus algorithm using state-space description

Following our recently developed method we provide a proof of convergence of the average consensus algorithm with quantized communication links as proposed by Censi and Murray. Using a state-space framework for describing distributed algorithms, we can derive accurate bounds on the drift from the mean for algorithms with noisy links, either caused by an external noise or by quantization. We then test these bounds for several network topologies and compare with simulations.

[1]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[3]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Markus Rupp,et al.  A general formalism for the analysis of distributed algorithms , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[6]  Michael Rabbat,et al.  Distributed Average Consensus using Probabilistic Quantization , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[7]  R. Carli,et al.  The quantization error in the average consensus problem , 2008, 2008 16th Mediterranean Conference on Control and Automation.

[8]  Richard M. Murray,et al.  Real-valued average consensus over noisy quantized channels , 2009, 2009 American Control Conference.