The Impact of Multi-group Multi-layer Network Structure on the Performance of Distributed Consensus Building Strategies

We consider a structural approach to the consensus building problem in multi-group multi-layer (MGML) distributed sensor networks (DSNs) common in many natural and engineering applications. From among the possible network structures, we focus on bipartite graph structure as it represents a typical MGML structure and has a wide applicability in the real world. We establish exact conditions for consensus and derive a precise relationship between the consensus value and the degree distribution of nodes in a bipartite MGML DSN. We also demonstrate that for subclasses of connectivity patterns, convergence time and simple characteristics of network topology can be captured by explicit algebra. Direct inference of the convergence behavior of consensus strategies from MGML DSN structure is the main contribution of this paper. The insights gained from our analysis facilitate the design and development of large-scale DSNs that meet specific performance criteria. Copyright © 2012 John Wiley & Sons, Ltd.

[1]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[2]  T. Vicsek,et al.  Hierarchical group dynamics in pigeon flocks , 2010, Nature.

[3]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[4]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[5]  Frank R. Kschischang.  Codes defined on graphs , 2003, IEEE Commun. Mag..

[6]  Sandip Roy,et al.  On the structure of graph edge designs that optimize the algebraic connectivity , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Kamesh Namuduri,et al.  LDPC-like belief propagation algorithm for consensus building in wireless sensor networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[8]  N. Abreu.  Old and new results on algebraic connectivity of graphs , 2007 .

[9]  K. R. Venugopal,et al.  Dynamic hierarchical communication paradigm for Wireless Sensor Networks : A centralized, energy efficient approach , 2008, 2008 11th IEEE Singapore International Conference on Communication Systems.

[10]  Sandip Roy,et al.  Designing linear distributed algorithms with memory for fast convergence , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Wei Ren,et al.  Information consensus in multivehicle cooperative control , 2007, IEEE Control Systems.

[12]  Martin J. Wainwright,et al.  On the Optimality of Tree-reweighted Max-product Message-passing , 2005, UAI.

[13]  L. Chua,et al.  Application of Kronecker products to the analysis of systems with uniform linear coupling , 1995 .

[14]  Vicenç Quera,et al.  Flocking Behaviour: Agent-Based Simulation and Hierarchical Leadership , 2010, J. Artif. Soc. Soc. Simul..

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

[16]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[17]  van der Arjan Schaft,et al.  Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico , 2008, CDC.

[18]  Sandip Roy,et al.  Scaling: a canonical design problem for networks , 2006, 2006 American Control Conference.

[19]  Bu-Sung Lee,et al.  HDA: A hierarchical data aggregation scheme for sensor networks , 2006, Comput. Commun..

[20]  Li Ping,et al.  The Factor Graph Approach to Model-Based Signal Processing , 2007, Proceedings of the IEEE.

[21]  Z. Duan,et al.  Complex network synchronizability: analysis and control. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Z. Duan,et al.  Network synchronizability analysis: a graph-theoretic approach. , 2008, Chaos.

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

[24]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[25]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[26]  Sandip Roy,et al.  A new focus in the science of networks: towards methods for design , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.