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 |
Fingerprint
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
Cite this
Gossip algorithms for distributed signal processing. / Dimakis, Alexandros G.; Kar, Soummya; Moura, José M F; Rabbat, Michael G.; Scaglione, Anna.
In: Proceedings of the IEEE, Vol. 98, No. 11, 5545370, 11.2010, p. 1847-1864.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Gossip algorithms for distributed signal processing
AU - Dimakis, Alexandros G.
AU - Kar, Soummya
AU - Moura, José M F
AU - Rabbat, Michael G.
AU - Scaglione, Anna
PY - 2010/11
Y1 - 2010/11
N2 - 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.
AB - 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.
KW - Consensus protocols
KW - distributed algorithms
KW - distributed processing
KW - gossip protocols
KW - graph theory
KW - information networks distributed averaging
KW - network topology
KW - peer to peer computing
KW - protocols
KW - random topologies
KW - topology design
KW - wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=77958154089&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77958154089&partnerID=8YFLogxK
U2 - 10.1109/JPROC.2010.2052531
DO - 10.1109/JPROC.2010.2052531
M3 - Article
AN - SCOPUS:77958154089
VL - 98
SP - 1847
EP - 1864
JO - Proceedings of the IEEE
JF - Proceedings of the IEEE
SN - 0018-9219
IS - 11
M1 - 5545370
ER -