Abstract
Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.
| Original language | English (US) |
|---|---|
| Article number | 5545370 |
| Pages (from-to) | 1847-1864 |
| Number of pages | 18 |
| Journal | Proceedings of the IEEE |
| Volume | 98 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2010 |
| Externally published | Yes |
Keywords
- Consensus protocols
- distributed algorithms
- distributed processing
- gossip protocols
- graph theory
- information networks distributed averaging
- network topology
- peer to peer computing
- protocols
- random topologies
- topology design
- wireless sensor networks
ASJC Scopus subject areas
- Electrical and Electronic Engineering