Matrix computations (3rd ed.)
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
Automatica (Journal of IFAC)
Polynomial filtering for fast convergence in distributed consensus
IEEE Transactions on Signal Processing
Accelerated distributed average consensus via localized node state prediction
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing - Part I
Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
IEEE Transactions on Signal Processing
Distributed Average Consensus With Dithered Quantization
IEEE Transactions on Signal Processing - Part I
Coding With Side Information for Rate-Constrained Consensus
IEEE Transactions on Signal Processing - Part I
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Distributed computation of averages over ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 35.68 |
The problem of distributed average consensus with quantized data is considered in this correspondence. Conventional consensus algorithms suffer from divergence when quantization errors are present. To address this issue, we introduce a modified quantization-based consensus protocol and exploit the temporal information collected from the iterative process, based on which we develop an efficient consensus algorithm. The proposed consensus algorithm is proved to converge to the true mean, i.e., the average of the initial state, in a mean square sense. It also presents an advantage of speeding up the convergence over the algorithm [P. Frasca, R. Carli, F. Fagnani, and S. Zampieri, "Average Consensus on Networks With Quantized Communication," Int. J. Robust Non-Linear Control, 2008, to be published] without exploitation of temporal information. Numerical results are presented to illustrate the effectiveness of the proposed algorithm.