Connectivity in a random interval graph with access points
Information Processing Letters
Automatic Generation of Persistent Formations for Multi-agent Networks Under Range Constraints
Mobile Networks and Applications
Finite-time stability analysis of fractional order time-delay systems: Gronwall's approach
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Consensus protocols are distributed algorithms in networked multi-agent systems. An important measure of the protocols is the convergence speed. In this paper, we consider the convergence behaviour of a discrete-time consensus protocol over large-scale sensor networks with uniformly random deployment in an area. We locate specific nodes in the network and add shortcuts among them so that the number of iterations to reach average consensus drops dramatically. Numerical simulations are provided to demonstrate the effect of different amount of shortcuts.