DMCA
Gossip algorithms for distributed signal processing (2010)
| Venue: | PROCEEDINGS OF THE IEEE |
| Citations: | 116 - 30 self |
BibTeX
@INPROCEEDINGS{Dimakis10gossipalgorithms,
author = {Alexandros G. Dimakis and Soummya Kar and Jose M. F. Moura and Michael G. Rabbat and Anna Scaglione},
title = {Gossip algorithms for distributed signal processing},
booktitle = {PROCEEDINGS OF THE IEEE},
year = {2010},
pages = {1847--1864},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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 transmittedmessages 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.
Keyphrases
gossip algorithm distributed signal processing distributed estimation signal processing robust gossip algorithm canonical signal processing task theoretical performance guarantee convergence rate result information theory community unreliable wireless network condition in-network processing source localization single point wireless link sensor network computer science recent work specialized routing abstract gossip algorithm
