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

Authors:
S. Vanka;V. Gupta;M. Haenggi
Affiliations:
Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA.;Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA.;Department of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana 46556, USA
Venue:
International Journal of Systems, Control and Communications
Year:
2010

Citing 5
Cited 2

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Throughput analysis of fading sensor networks with regular and random topologies

EURASIP Journal on Wireless Communications and Networking
A scheme for robust distributed sensor fusion based on average consensus

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Communication constraints in the average consensus problem

Automatica (Journal of IFAC)

On consensus over stochastically switching directed topologies

ACC'09 Proceedings of the 2009 conference on American Control Conference
Consensus in networked multi-agent systems with adversaries

Proceedings of the 14th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

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.