Gossip Algorithms for Distributed Signal Processing

被引:631
|
作者
Dimakis, Alexandros G. [1 ]
Kar, Soummya [2 ]
Moura, Jose M. F. [2 ]
Rabbat, Michael G. [3 ]
Scaglione, Anna [4 ]
机构
[1] Univ So Calif, Dept Elect & Comp Engn, Los Angeles, CA 90089 USA
[2] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
[3] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 2A7, Canada
[4] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
基金
美国国家科学基金会; 加拿大自然科学与工程研究理事会;
关键词
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; SENSOR NETWORKS; CONSENSUS ALGORITHMS; SOURCE LOCALIZATION; AVERAGE CONSENSUS; SIDE INFORMATION; PART I; CONVERGENCE; TOPOLOGY; OPTIMIZATION; AGENTS;
D O I
10.1109/JPROC.2010.2052531
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1847 / 1864
页数:18
相关论文
共 50 条
  • [1] Distributed Algorithms for Array Signal Processing
    Chen, Po-Chih
    Vaidyanathan, P. P.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 4607 - 4622
  • [2] Gossip algorithms for distributed ranking
    Chiuso, Alessandro
    Fagnani, Fabio
    Schenato, Luca
    Zampieri, Sandro
    [J]. 2011 AMERICAN CONTROL CONFERENCE, 2011, : 5468 - 5473
  • [3] Gossip Algorithms for Simultaneous Distributed Estimation and Classification in Sensor Networks
    Chiuso, Alessandro
    Fagnani, Fabio
    Schenato, Luca
    Zampieri, Sandro
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (04) : 691 - 706
  • [4] Distributed Averaging in Sensor Networks Based on Broadcast Gossip Algorithms
    Franceschelli, Mauro
    Giua, Alessandro
    Seatzu, Carla
    [J]. IEEE SENSORS JOURNAL, 2011, 11 (03) : 808 - 817
  • [5] Load balancing on networks with gossip-based distributed algorithms
    Franceschelli, Mauro
    Giua, Alessandro
    Seatzu, Carla
    [J]. PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2007, : 5499 - 5504
  • [6] Distributed Averaging in Wireless Sensor Networks with Triplewise Gossip Algorithms
    Yang, Bo
    Wu, Weimin
    Zhu, Guangxi
    [J]. 2013 IEEE TENCON SPRING CONFERENCE, 2013, : 178 - 182
  • [7] Extending Gossip Algorithms to Distributed Estimation of U-Statistics
    Colin, Igor
    Salmon, Joseph
    Clemencon, Stephan
    Bellet, Aurelien
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [8] Distributed signal processing
    Lee, L
    Oppenheim, AV
    [J]. PROCEEDINGS OF THE 1998 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-6, 1998, : 1749 - 1752
  • [9] Gossip Algorithms that Preserve Privacy for Distributed Computation Part I: The Algorithms and Convergence Conditions
    Liu, Yang
    Wu, Junfeng
    Manchester, Ian R.
    Shi, Guodong
    [J]. 2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2018, : 4499 - 4504
  • [10] Gossip Algorithms
    Shah, Devavrat
    [J]. FOUNDATIONS AND TRENDS IN NETWORKING, 2008, 3 (01): : 1 - 125