Random consensus protocol in large-scale networks

One of the main performance issues for consensus protocols is the convergence speed. In this paper, we focus on the convergence behavior of discrete-time consensus protocols over large-scale sensor networks with uniformly random deployment, which are modelled as Poisson random graphs. Instead of using the random rewiring procedure, we introduce a deterministic principle to locate certain "chosen nodes" in the network and add "virtual" shortcuts among them so that the number of iterations to achieve average consensus drops dramatically. Simulation results are presented to verify the efficiency of this approach. Moreover, a random consensus protocol is proposed, in which virtual shortcuts are implemented by random routes.

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

[2]  M. Cao,et al.  Reaching an Agreement Using Delayed Information , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[3]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.

[4]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

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

[6]  P. Barooah,et al.  Graph Effective Resistance and Distributed Control: Spectral Properties and Applications , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[7]  R.M. Murray,et al.  Distributed Averaging on Asynchronous Communication Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[9]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[10]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[11]  Peng Yang,et al.  Distributed estimation and control of swarm formation statistics , 2006, 2006 American Control Conference.

[12]  R. Olfati-Saber.  Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..

[13]  R. Olfati-Saber,et al.  Distributed Kalman Filter with Embedded Consensus Filters , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[14]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

[15]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[16]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[17]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[18]  A. Jadbabaie,et al.  On the stability of the Kuramoto model of coupled nonlinear oscillators , 2005, Proceedings of the 2004 American Control Conference.

[19]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[20]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[21]  R. Olfati-Saber,et al.  Algebraic Connectivity Ratio of Ramanujan Graphs , 2007, 2007 American Control Conference.

[22]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[23]  R. Monasson.  Diffusion, localization and dispersion relations on “small-world” lattices , 1999 .

[24]  R.M. Murray,et al.  Multi-Hop Relay Protocols for Fast Consensus Seeking , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[25]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[26]  A. Rapoport,et al.  Connectivity of random nets , 1951 .

[27]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[28]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..