期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 57, 期 1, 页码 19-32出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2011.2160593
关键词
Distributed computation; gossip algorithm; network; quantization
资金
- Scalable, Data-driven, and Provably-correct Analysis of Networks [ONR MURI N00014-08-1-0747]
- Tools for the Analysis and Design of Complex Multi-Scale Networks [ARO MURI W911NF-08-1-0233]
- Institute for Collaborative Biotechnology [Army's W911NF-09-D-0001]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [0911041] Funding Source: National Science Foundation
This paper deals with the distributed averaging problem over a connected network of agents, subject to a quantization constraint. It is assumed that at each time update, only a pair of agents can update their own states in terms of the quantized data being exchanged. The agents are also required to communicate with one another in a stochastic fashion. It is shown that a quantized consensus is reached for an arbitrary quantizer by means of the stochastic gossip algorithm proposed in a recent paper. The expected value of the time at which a quantized consensus is reached is lower and upper bounded in terms of the topology of the graph for a uniform quantizer. In particular, it is shown that these bounds are related to the principal submatrices of the weighted Laplacian matrix. A convex optimization is also proposed to determine a set of probabilities used to pick a pair of agents that leads to a fast convergence of the gossip algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据