Gossip Algorithms for Distributed Signal Processing

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 com...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the IEEE Ročník 98; číslo 11; s. 1847 - 1864
Hlavní autori: Dimakis, Alexandros G., Kar, Soummya, Moura, José M. F., Rabbat, Michael G., Scaglione, Anna
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Computer science
Consensus protocols
Consumption
Convergence
distributed algorithms
distributed processing
Failure
gossip protocols
graph theory
information networks distributed averaging
Information theory
network topology
Networks
peer to peer computing
Position (location)
Process control
protocols
random topologies
Robust control
Robustness
Routing
Signal processing
Signal processing algorithms
Surges
topology design
Wireless communication
Wireless sensor networks
ISSN:0018-9219, 1558-2256
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9219
1558-2256
DOI:10.1109/JPROC.2010.2052531