Introduction to distributed algorithms
Introduction to distributed algorithms
Distributed Algorithms
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Automatica (Journal of IFAC)
On quantized consensus by means of gossip algorithm: part ii: convergence time
ACC'09 Proceedings of the 2009 conference on American Control Conference
Real-valued average consensus over noisy quantized channels
ACC'09 Proceedings of the 2009 conference on American Control Conference
Gossip consensus algorithms via quantized communication
Automatica (Journal of IFAC)
Real-valued average consensus over noisy quantized channels
ACC'09 Proceedings of the 2009 conference on American Control Conference
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Distributed consensus over digital networks with limited bandwidth and time-varying topologies
Automatica (Journal of IFAC)
| Hi-index | 0.01 |
This paper is concerned with the distributed averaging problem subject to a quantization constraint. Given a group of agents associated with scalar numbers, it is assumed that each pair of agents can communicate with a prescribed probability, and that the data being exchanged between them is quantized. In this part of the paper, it is proved that the stochastic gossip algorithm proposed in a recent paper leads to reaching the quantized consensus. Some important steady-state properties of the system (after reaching the consensus) are also derived. The results developed here hold true for any arbitrary quantization, provided that the tuning parameter of the gossip algorithm is chosen properiy. The expected value of the convergence time is lower and upper bounded in the second part of the paper.