TY - JOUR
T1 - Gossip algorithms for distributed signal processing
AU - Dimakis, Alexandros G.
AU - Kar, Soummya
AU - Moura, José M.F.
AU - Rabbat, Michael G.
AU - Scaglione, Anna
N1 - Funding Information:
Manuscript received November 16, 2009; revised March 26, 2010; accepted May 21, 2010. Date of publication August 9, 2010; date of current version October 20, 2010. The work of S. Kar and J. M. F. Moura was supported in part by the National Science Foundation (NSF) under Grant CCF1011903, by the Air Force Office of Sponsored Research (AFOSR) under Grant FA95501010291, and by the U.S. Office of Naval Research (ONR) under MURI N000140710747. The work of M. G. Rabbat was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC) under Grant RGPIN 341596-2007, by Mathematics of Information Technology and Complex Systems (MITACS), and by Fonds Québécois de la Recherche sur la Nature et les Technologies (FQRNT) under Grant 2009-NC-126057. The work of A. Scaglione was supported by the NSF under Grant CCF-0729074. A. G. Dimakis is with the Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA 90089 USA (e-mail: dimakis@usc.edu). S. Kar was with the Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213 USA. He is now with Princeton University, Princeton, NJ 08544 USA (e-mail: soummyak@andrew.cmu.edu). J. M. F. Moura is with the Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213 USA (e-mail: moura@ece.cmu.edu). M. G. Rabbat is with the Department of Electrical and Computer Engineering, McGill University, Montréal, QC H3A 2A7 Canada (e-mail: michael.rabbat@mcgill.ca). A. Scaglione is with the Department of Electrical and Computer Engineering, University of California at Davis, Davis, CA 95616 USA (e-mail: ascaglione@ucdavis.edu).
PY - 2010/11
Y1 - 2010/11
N2 - 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.
AB - 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.
KW - Consensus protocols
KW - distributed algorithms
KW - distributed processing
KW - gossip protocols
KW - graph theory
KW - information networks distributed averaging
KW - network topology
KW - peer to peer computing
KW - protocols
KW - random topologies
KW - topology design
KW - wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=77958154089&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77958154089&partnerID=8YFLogxK
U2 - 10.1109/JPROC.2010.2052531
DO - 10.1109/JPROC.2010.2052531
M3 - Article
AN - SCOPUS:77958154089
VL - 98
SP - 1847
EP - 1864
JO - Proceedings of the Institute of Radio Engineers
JF - Proceedings of the Institute of Radio Engineers
SN - 0018-9219
IS - 11
M1 - 5545370
ER -