Convergence Rate of Consensus in a Network of Networks

We study the convergence rate of consensus algorithms in a Network of Networks model. In this model, there is a collection of networks, and these individual networks are connected to one another using a small number of links to form a composite graph. We consider a setting where the links between networks are costly to use, and therefore, are used less frequently than links within each network. We model this setting using a stochastic system where, in each iteration, the inter-network links are active with some small probability. U sing spectral perturbation theory, we analyze the convergence rate of this system, up to first order in this activation probability. Our analysis shows that the convergence rate is independent of the topologies of the individual graphs; the rate depends only on the number of nodes in each graph and the topology of the connecting edges. We further highlight these theoretical results through numerical examples.

[1]  Amr El Abbadi,et al.  Convergence Rates of Distributed Average Consensus With Stochastic Link Failures , 2010, IEEE Transactions on Automatic Control.

[2]  H. Baumgärtel.  Analytic perturbation theory for matrices and operators , 1985 .

[3]  Sandro Zampieri,et al.  Average consensus with packet drop communication , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[4]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[5]  Yu Wang,et al.  Routing in vehicular ad hoc networks: A survey , 2007, IEEE Vehicular Technology Magazine.

[6]  Bassam Bamieh,et al.  Convergence rates of consensus algorithms in stochastic networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[7]  Soummya Kar,et al.  Sensor Networks With Random Links: Topology Design for Distributed Consensus , 2007, IEEE Transactions on Signal Processing.

[8]  Stacy Patterson,et al.  Optimizing the coherence of composite networks , 2017, 2017 American Control Conference (ACC).

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

[10]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[11]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

[12]  Stefan Bornholdt,et al.  Evolution of robust network topologies: Emergence of central backbones , 2012, Physical review letters.

[13]  G. Hug,et al.  Distributed robust economic dispatch in power systems: A consensus + innovations approach , 2012, 2012 IEEE Power and Energy Society General Meeting.

[14]  Tiberiu Rotaru,et al.  Dynamic load balancing by diffusion in heterogeneous systems , 2004, J. Parallel Distributed Comput..

[15]  Andrea Gasparri,et al.  Network composition for optimal disturbance rejection , 2016, 2016 American Control Conference (ACC).