Year: 2010
Type: article
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.
Source: Proceedings of the IEEE
Authors: Alexandros G. Dimakis, Soummya Kar, José M. F. Moura, Michael G. Rabbat, Anna Scaglione
Language: English
Subfield: Control and Systems Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Awards: Inference and characterization of biological signaling networks, G2901579315, Integrated Sensing: Virtual Sensor-Actuator Arrays, ITR - \(ASE+NHS\) -\ (dmc+int\): Toward a Multi-Layered Architecture for Reliable and Secure Large-Scale Networks: The Case of an Electric Power Grid, G6515413431, Collaborative Research: New Communication Infrastructures For Networked Coordinated Control
OpenAlex ID: W2120286056