Power-delay analysis of consensus algorithms on wireless networks with interference
by S. Vanka, V. Gupta, M. Haenggi
International Journal of Systems, Control and Communications (IJSCC), Vol. 2, No. 1/2/3, 2010

Abstract: We study the convergence of the average consensus algorithm in wireless networks in the presence of interference. For regular lattices with periodic boundary conditions, we characterise the convergence properties of an optimal Time Division Multiple Access (TDMA) protocol that maximises the speed of convergence on these networks. We provide analytical upper and lower bounds for the convergence rate for these networks. Our results show that in an interference-limited scenario, the fastest converging interconnection topology for the consensus algorithm crucially depends on the geometry of node placement. In particular, we prove that asymptotically in the number of nodes, increasing the transmit power to allow long-range interconnections improves the convergence rate in one-dimensional tori, while it has the opposite effect in higher dimensions.

Online publication date: Sat, 23-Jan-2010

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 Systems, Control and Communications (IJSCC):
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