On the convergence time of distributed quantized averaging algorithms

We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the communication rate, the memory capacities of agents and the computation precision are finite. The focus of this paper is on the study of the convergence time of the proposed quantized averaging algorithms. By appealing to random walks on graphs, we derive polynomial bounds on the expected convergence time of all the algorithms presented.

[1]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

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

[6]  R. Carli,et al.  Average consensus on networks with transmission noise or quantization , 2007, 2007 European Control Conference (ECC).

[7]  S. Martinez.  Distributed representation of spatial fields through an adaptive interpolation scheme , 2007, 2007 American Control Conference.

[8]  Robert Elsässer,et al.  Distributing Unit Size Workload Packages in Heterogeneous Networks , 2006, J. Graph Algorithms Appl..

[9]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[10]  Peter Winkler,et al.  Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.

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

[12]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[13]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[14]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[15]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[16]  F. Fagnani,et al.  Communication constraints in coordinated consensus problems , 2006, 2006 American Control Conference.

[17]  John N. Tsitsiklis,et al.  On Distributed Averaging Algorithms and Quantization Effects , 2008, IEEE Trans. Autom. Control..

[18]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[19]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[20]  Anna Scaglione,et al.  A scalable wireless communication architecture for average consensus , 2007, 2007 46th IEEE Conference on Decision and Control.

[21]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[22]  Alexandros G. Dimakis,et al.  Geographic Gossip: Efficient Averaging for Sensor Networks , 2007, IEEE Transactions on Signal Processing.

[23]  R. Carli,et al.  Communication constraints in the state agreement problem , 2005 .

[24]  J. Shamma,et al.  Belief consensus and distributed hypothesis testing in sensor networks , 2006 .