Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs

We study a general framework for broadcast gossip algorithms which use companion variables to solve the average consensus problem. Each node maintains an initial state and a companion variable. Iterative updates are performed asynchronously whereby one random node broadcasts its current state and companion variables and all other nodes receiving the broadcast update their state and companion variables. We provide conditions under which this scheme is guaranteed to converge to a consensus solution, where all nodes have the same limiting values, on any strongly connected directed graph. Under stronger conditions, which are reasonable when the underlying communication graph is undirected, we guarantee that the consensus value is equal to the average, both in expectation and in the mean-squared sense. Our analysis uses tools from non-negative matrix theory and perturbation theory. The perturbation results rely on a parameter being sufficiently small. We characterize the allowable upper bound as well as the optimal setting for the perturbation parameter as a function of the network topology, and this allows us to characterize the worst-case rate of convergence. Simulations illustrate that, in comparison to existing broadcast gossip algorithms, the approaches proposed in this paper have the advantage that they simultaneously can be guaranteed to converge to the average consensus and they converge in a small number of broadcasts.

[1]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[2]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[3]  Anand D. Sarwate,et al.  Broadcast gossip algorithms: Design and analysis for consensus , 2008, 2008 47th IEEE Conference on Decision and Control.

[4]  Mehmet E. Yildiz,et al.  Broadcast gossip algorithms , 2008, 2008 IEEE Information Theory Workshop.

[5]  Kai Cai,et al.  Average consensus on general digraphs , 2011, IEEE Conference on Decision and Control and European Control Conference.

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

[7]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[8]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[9]  Angelia Nedic,et al.  Asynchronous Broadcast-Based Convex Optimization Over a Network , 2011, IEEE Transactions on Automatic Control.

[10]  Fabio Fagnani,et al.  Broadcast Gossip Averaging: Interference and Unbiasedness in Large Abelian Cayley Networks , 2011, IEEE Journal of Selected Topics in Signal Processing.

[11]  Alessandro Giua,et al.  Consensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms , 2009 .

[12]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[13]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[14]  Kai Cai,et al.  Average consensus on general strongly connected digraphs , 2012, Autom..

[15]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[16]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[17]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[18]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

[19]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[20]  M Franceschelli,et al.  Distributed Averaging in Sensor Networks Based on Broadcast Gossip Algorithms , 2011, IEEE Sensors Journal.

[21]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

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

[23]  Abraham Berman,et al.  Lower bounds for the eigenvalues of Laplacian matrices , 2000 .

[24]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .