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
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1430343 · Cited by 550
Graph theory, combinatorics, and applications
Alavi, Y., Chartrand, G., & Oellermann, O. R. (2017) · Cited by 520
Randomized consensus algorithms over large scale networks
Fagnani, F., & Zampieri, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080506 · Cited by 350
Distributed Average Consensus With Dithered Quantization
Aysal, T. C., Coates, M. J., & Rabbat, M. G. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.927071 · Cited by 315
Self-citationSensor Networks With Random Links: Topology Design for Distributed Consensus
Kar, S., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.920143 · Cited by 261
Toward a theory of in-network computation in wireless sensor networks
Giridhar, A., & Kumar, P. R. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.1632656 · Cited by 220
Convergence rate for consensus with delays
Nedić, A., & Ozdaglar, A. (2010) · Journal of Global Optimization · doi:10.1007/s10898-008-9370-2 · Cited by 198
Computing separable functions via gossip
Mosk-Aoyama, D., & Shah, D. (2006) · Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing · doi:10.1145/1146381.1146401 · Cited by 190
Geographic gossip: efficient aggregation for sensor networks
Dimakis, A. G., Sarwate, A. D., & Wainwright, M. J. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127791 · Cited by 185
Self-citationLocal divergence of Markov chains and the analysis of iterative load-balancing schemes
Rabani, Y., Sinclair, A., & Wanka, R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743520 · Cited by 147
Mathematical analysis: an introduction
(1996) · Choice Reviews Online · doi:10.5860/choice.33-5765 · Cited by 142
Distributed Average Consensus using Probabilistic Quantization
Aysal, T. C., Coates, M., & Rabbat, M. (2007) · IEEE/SP Workshop on Statistical Signal Processing (SSP) · doi:10.1109/ssp.2007.4301337 · Cited by 137
Self-citationOmidvar, R., & Bidgoli, B. M. (2020) · BENTHAM SCIENCE PUBLISHERS eBooks · doi:10.2174/9789811459597120010004 · Cited by 120
Consensus over random networks
Tahbaz-Salehi, A., & Jadbabaie, A. (2006) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 78
On distributed averaging algorithms and quantization effects
Nedić, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4738891 · Cited by 63
Gossip along the way: order-optimal consensus through randomized path averaging
Bénézit, F., Dimakis, A. G., Thiran, P., et al. (2007) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 57
Aysal, T. C., Yildiz, M. E., & Scaglione, A. (2008) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2008.4578682 · Cited by 35
Self-citationBroadcast gossip algorithms: Design and analysis for consensus
Aysal, T. C., Yildiz, M. E., Sarwate, A. D., & Scaglione, A. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4739315 · Cited by 33
Self-citation
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
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.