Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2009 | Published
Book Section - Chapter Open

Neighborhood gossip: Concurrent averaging through local interference

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.

Additional Information

© 2009 IEEE. [AGD] is supported by a Microsoft Research Graduate Fellowship.

Attached Files

Published - 04960419.pdf

Files

04960419.pdf
Files (238.0 kB)
Name Size Download all
md5:c8cee5404441ecf10007f9f5d0ec0e33
238.0 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 25, 2023