Quantized average consensus on gossip digraphs with reduced computation
Kai Cai, Hideaki Ishii
SICE Journal of Control, Measurement, and System Integration, vol.4, no. 3, pp. 236-242, May 2011
(Special Issue on Advances in Networking for Distributed Control and Measurement)
Keywords: Quantized averaging, distributed consensus, randomized gossip algorithms
Abstract: The authors have recently proposed a class of randomized gossip algorithms which solve the distributed averaging problem on directed graphs, with the constraint that each node has an integer-valued state. The essence of this algorithm is to maintain local records, called “surplus”, of individual state updates, thereby achieving quantized average consensus even though the state sum of all nodes is not preserved. In this paper we study a modified version of this algorithm, whose feature is primarily in reducing both computation and communication effort. Concretely, each node needs to update fewer local variables, and can transmit surplus by requiring only one bit. Under this modified algorithm we prove that reaching the average is ensured for arbitrary strongly connected graphs. The condition of arbitrary strong connection is less restrictive than those known in the literature for either real-valued or quantized states; in particular, it does not require the special structure on the network called balanced. Finally, we provide numerical examples to illustrate the convergence result, with emphasis on convergence time analysis.
Disclaimer: This material is posted for timely dissemination of scholarly work. Copyright is retained by authors and the publisher.