Fast distributed consensus seeking in large-scale sensor networks via shortcuts
by Yilun Shang
International Journal of Computational Science and Engineering (IJCSE), Vol. 7, No. 2, 2012

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.

Online publication date: Mon, 22-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com