Authors: Yilun Shang
Addresses: Institute for Cyber Security, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249, USA
Abstract: 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.
Keywords: consensus protocols; convergence speed; multi-agent systems; MAS; agent-based systems; small world; distributed consensus seeking; large-scale sensor networks; shortcuts; numerical simulation.
International Journal of Computational Science and Engineering, 2012 Vol.7 No.2, pp.121 - 124
Received: 12 Aug 2011
Accepted: 26 Oct 2011
Published online: 22 Sep 2014 *