Neighborhood gossip: Concurrent averaging through local interference

Authors:
Bobak Nazer;Alexandros G. Dimakis;Michael Gastpar
Affiliations:
University of California, Berkeley, USA;California Institute of Technology, USA;University of California, Berkeley, USA
Venue:
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Year:
2009

Citing 0
Cited 2

Reaching consensus in wireless networks with probabilistic broadcast

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Location-aided fast distributed consensus in wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

In this paper, we study a gossip algorithm for distributed averaging over a wireless sensor network. The usual assumption is that, through properly chosen codes, the physical layer is reduced to a set of reliable bit pipes for the distributed averaging algorithm. However, with a new channel coding technique, computation coding, we can exploit the interference property of the wireless medium for efficient averaging. This then provides a new abstraction for the physical layer: reliable linear equations instead of reliable bit pipes. The “neighborhood gossip” algorithm operates modularly on top of this abstraction. We will show that for certain regimes, such an approach can lead to energy savings that are exponential in the network size and time savings that are polynomial.