The DOI matches its Crossref record; 83 of the 83 references it cites were found in a registry or an index.
Gossip Algorithms for Distributed Signal Processing
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“rly work includes that of Tsitsiklis et al. [17], [18]. Consensus problems have arisen in numerous applications including: load balancing [19]; alignment, flocking, and multi-agent collaboration [20], [21]; vehicle formation [22], tracking and data fusion [23], and distributed inference [24]. The canonical example of a…”
BackgroundConsensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“cus on characterizing conditions for convergence and stability of synchronous gossiping, as well as optimization of the algorithm parameters Pi;j; see the excellent surveys by Olfati-Saber and Murray [28], and Ren et al. [29], and references therein. B. Paper Outline Our overview of gossip algorithms begins on the the…”
MethodCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820
Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
Chen, J., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2198470 · Cited by 680
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Self-citationPrivacy Preserving Average Consensus
Mo, Y., & Murray, R. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564339 · Cited by 521
Sayed, A. H., Tu, S.-Y., Chen, J., Zhao, X., & Towfic, Z. J. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2231991 · Cited by 494
Tu, S.-Y., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2217338 · Cited by 467
Diffusion Adaptation Over Networks
Sayed, A. H. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-411597-2.00009-6 · Cited by 465
Base-Station Assisted Device-to-Device Communications for High-Throughput Wireless Video Networks
Golrezaei, N., Mansourifard, P., Molisch, A. F., & Dimakis, A. G. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2316817 · Cited by 448
Self-citationConsensus + Innovations Approach for Distributed Multiagent Coordination in a Microgrid
Hug, G., Kar, S., & Wu, C. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2409053 · Cited by 352
Self-citationPrimary and secondary control in DC microgrids: a review
GAO, F., KANG, R., CAO, J., & YANG, T. (2019) · Journal of Modern Power Systems and Clean Energy · doi:10.1007/s40565-018-0466-5 · Cited by 314
Push-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304
“ca Consensus algorithms have been analyzed mostly in wireless network settings [5] and provide an elegant distributed solution for coordinating the nodes.”
BackgroundSelf-citationKargarian, A., Mohammadi, J., Guo, J., Chakrabarti, S., Barati, M., Hug, G., Kar, S., & Baldick, R. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2614904 · Cited by 302
Self-citationDistributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings
Tang, Y., Gao, H., Zou, W., & Kurths, J. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2207718 · Cited by 296
A tutorial on modeling and analysis of dynamic social networks. Part II
Proskurnikov, A. V., & Tempo, R. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.03.005 · Cited by 294
Distributed particle filtering in agent networks: A survey, classification, and comparison
Hlinka, O., Hlawatsch, F., & Djuric, P. M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219652 · Cited by 259
Diffusion LMS Over Multitask Networks
Chen, J., Richard, C., & Sayed, A. H. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2412918 · Cited by 253
Distributed consensus and optimization under communication delays
Tsianos, K. I., & Rabbat, M. G. (2011) · 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2011.6120272 · Cited by 92
Self-citation
Metadata
- Authors
- Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A.
- Venue
- Proceedings of the IEEE
- Published
- 2010-11
- Volume
- 98
- Issue
- 11
- Pages
- 1847-1864
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2120286056
- Cited by
- 741
- References
- 83
- FWCI
- 67.62
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.