Power-delay analysis of consensus algorithms on wireless networks with interference

Author

Vanka, S. ; Gupta, V. ; Haenggi, M.

Author_Institution

Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN

fYear

2008

fDate

23-26 Sept. 2008

Firstpage

1457

Lastpage

1464

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 characterize the convergence properties of optimal MAC protocol that maximizes the speed of convergence on these networks. We provide analytical upper and lower bounds for the convergence rate. Our results show that the fastest converging interconnection topology for the consensus algorithm crucially depends on the geometry of node placement in an interference-limited scenario.

Keywords

access protocols; interference (signal); radio networks; telecommunication network topology; consensus algorithms; interconnection topology; interference; optimal MAC protocol; periodic boundary conditions; power-delay analysis; wireless networks; Additive noise; Algorithm design and analysis; Boundary conditions; Broadcasting; Convergence; Interference; Media Access Protocol; Network topology; Wireless application protocol; Wireless networks; Consensus algorithms; MAC protocol; interference; wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication, Control, and Computing, 2008 46th Annual Allerton Conference on

Conference_Location

Urbana-Champaign, IL

Print_ISBN

978-1-4244-2925-7

Electronic_ISBN

978-1-4244-2926-4

Type

conf

DOI

10.1109/ALLERTON.2008.4797734

Filename

4797734