Distributed averaging in dense wireless networks

Authors:
S. Vanka;M. Haenggi;V. Gupta
Affiliations:
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 0

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
Average Consensus with Packet Drop Communication

SIAM Journal on Control and Optimization
Location-aided fast distributed consensus in wireless networks

IEEE Transactions on Information Theory
The capacity of wireless networks

IEEE Transactions on Information Theory
Randomized gossip algorithms

IEEE Transactions on Information Theory
Consensus Propagation

IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the effect of network throughput on the convergence of a specific class of distributed averaging algorithms, called consensus algorithms. These algorithms rely on iterative computation of the desired average by message passing among the nodes. It is thus assumed that the rate of convergence should benefit from greater network connectivity. However, one must also account for the additional network resources that establishing such a connectivity would entail. In this paper, we study this problem in the context of randomly-placed consensus-seeking nodes that are connected through a dense wireless network, i.e., whose capacity is interference-limited. By analyzing the outage of each communication link along with results from mixing times of Markov chains, we obtain scaling laws for the mixing times of fastest-converging consensus topologies over such networks.