The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Broadcast Gossip Algorithms for Consensus
Abstract
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and computing in an arbitrarily connected network of nodes. Specifically, we study a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. We show that thebroadcastgossipalgorithmconverges almost surely to a consensus. We prove that the random consensus value is, in expectation, the average of initial node measurements and that it can be made arbitrarily close to this value in mean squared error sense, under a balanced connectivity model and by trading off convergence speed with accuracy of the computation. We provide theoretical and numerical results on the mean square error performance, on the convergence rate and study the effect of the ldquomixing parameterrdquo on the convergence rate of the broadcast gossip algorithm. The results indicate that the mean squared error strictly decreases through iterations until the consensus is achieved. Finally, we assess and compare the communication cost of the broadcast gossip algorithm to achieve a given distance to consensus through theoretical and numerical results.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
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×
“Distributed agreement is a fundamental problem in ad hoc network applications, including distributed consensus and synchronization problems [6]–[8], [10], distributed coordination of mobile autonomous agents [4], [5], and distributed data fusion in sensor networks [3], [9], [11].”
BackgroundCoordination 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
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Cited by
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2052531 · Cited by 741
Self-citationGossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M., & Scaglione, A. (2018) · doi:10.1184/r1/6468842.v1 · Cited by 692
Self-citationDiffusion 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
Chen, C. L. P., Wen, G.-X., Liu, Y.-J., & Wang, F.-Y. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2302477 · Cited by 634
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
A tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
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
Tu, S.-Y., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2217338 · Cited by 467
Hierarchical Control for Multiple DC-Microgrids Clusters
Shafiee, Q., Dragicevic, T., Vasquez, J. C., & Guerrero, J. M. (2014) · IEEE Transactions on Energy Conversion · doi:10.1109/tec.2014.2362191 · Cited by 442
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Lian, X., Zhang, C., Zhang, H., Hsieh, C., Zhang, W., & Liu, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09056 · Cited by 395
Consensus of Hybrid Multi-Agent Systems
Zheng, Y., Ma, J., & Wang, L. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2651402 · Cited by 391
Decentralized Federated Averaging
Sun, T., Li, D., & Wang, B. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3196503 · Cited by 388
Distributed Asynchronous Constrained Stochastic Optimization
Srivastava, K., & Nedic, A. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2118740 · Cited by 350
Asynchronous Broadcast-Based Convex Optimization Over a Network
Nedic, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2079650 · Cited by 310
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
“Moreover, with a time-varying consensus protocol P (t), we may not even be able to specify the stationary distribution beyond its expectation and variance [9] or may only be able to achieve average consensus in expectation [10].”
BackgroundA 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
Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
Zhang, K., Yang, Z., Liu, H., Zhang, T., & Başar, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08757 · Cited by 293
Decentralized Federated Learning: A Survey and Perspective
Yuan, L., Wang, Z., Sun, L., Yu, P. S., & Brinton, C. G. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3407584 · Cited by 290
Robust Networked Control Scheme for Distributed Secondary Control of Islanded Microgrids
Shafiee, Q., Stefanovic, C., Dragicevic, T., Popovski, P., Vasquez, J. C., & Guerrero, J. M. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2013.2293711 · Cited by 264
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
Hu, B., Guan, Z.-H., Xiong, N., & Chao, H.-C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2808966 · Cited by 54
“A random broadcast gossip algorithm was then used for consensus design, relaxing the need of complex routing and uncertain mutual exchange operations [31].”
BackgroundMethodDigest: Fast and communication efficient decentralized learning with local updates
Gholami, P., & Seferoglu, H. (2024) · IEEE Transactions on Machine Learning in Communications and Networking · doi:10.1109/tmlcn.2024.3354236 · Cited by 14
Metadata
- Authors
- Aysal, T. C., Yildiz, M. E., Sarwate, A. D., & Scaglione, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-07
- Volume
- 57
- Issue
- 7
- Pages
- 2748-2761
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2161305486
- Cited by
- 480
- References
- 34
- FWCI
- 53.14
- Type
- journal article
- Language
- en
- Open access
- closed
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.