Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-03-27
Computer Science
Distributed, Parallel, and Cluster Computing
Submitted to Proceedings of the IEEE, 29 pages
Scientific paper
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 article 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.
Dimakis Alexandros G.
Kar Soummya
Moura Jose M. F.
Rabbat Michael G.
Scaglione Anna
No associations
LandOfFree
Gossip Algorithms for Distributed Signal Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Gossip Algorithms for Distributed Signal Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gossip Algorithms for Distributed Signal Processing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-275708