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
Name | Size | Download all |
---|---|---|
md5:c8cee5404441ecf10007f9f5d0ec0e33
|
238.0 kB | Preview Download |
Additional details
- Eprint ID
- 75334
- Resolver ID
- CaltechAUTHORS:20170322-171827949
- Microsoft Research
- Created
-
2017-03-23Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field