The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Distributed Average Consensus With Dithered Quantization
Abstract
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed averaging algorithms fail to achieve consensus when deterministic uniform quantization is adopted. We propose a distributed algorithm in which the nodes utilize probabilistically quantized information, i.e., dithered quantization, to communicate with each other. The algorithm we develop is a dynamical system that generates sequences achieving a consensus at one of the quantization values almost surely. In addition, we show that the expected value of the consensus is equal to the average of the original sensor data. We derive an upper bound on the mean-square-error performance of the probabilistically quantized distributed averaging (PQDA). Moreover, we show that the convergence of the PQDA is monotonic by studying the evolution of the minimum-length interval containing the node values. We reveal that the length of this interval is a monotonically nonincreasing function with limit zero. We also demonstrate that all the node values, in the worst case, converge to the final two quantization bins at the same rate as standard unquantized consensus. Finally, we report the results of simulations conducted to evaluate the behavior and the effectiveness of the proposed algorithm in various scenarios.
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
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
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
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Foundations of Modern Probability
Kallenberg, O. (2021) · Probability Theory and Stochastic Modelling · doi:10.1007/978-3-030-61871-1 · Cited by 2,832
Foundations of Modern Probability
Kallenberg, O. (2002) · Probability and Its Applications · doi:10.1007/978-1-4757-4015-8 · Cited by 2,447
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
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
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
Dither Signals and Their Effect on Quantization Noise
Schuchman, L. (1964) · IEEE Transactions on Communications · doi:10.1109/tcom.1964.1088973 · Cited by 408
Computing aggregates for monitoring wireless sensor networks
Zhao, J., Govindan, R., & Estrin, D. L. (2003) · doi:10.1109/snpa.2003.1203364 · Cited by 339
A theory of nonsubtractive dither
Wannamaker, R. A., Lipshitz, S. P., Vanderkooy, J., & Wright, J. N. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.823976 · Cited by 237
Decentralized compression and predistribution via randomized gossiping
Rabbat, M., Haupt, J., Singh, A., & Nowak, R. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127789 · Cited by 165
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
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-citationGeneralized consensus computation in networked systems with erasure links
Rabbat, M., Nowak, R. D., & Bucklew, J. A. (2005) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2005.1506308 · Cited by 126
Self-citationLocally constructed algorithms for distributed computations in ad-hoc networks
Scherber, D. S., & Papadopoulos, H. (2004) · International Symposium on Information Processing in Sensor Networks (IPSN) · doi:10.1145/984622.984625 · Cited by 112
Robust Decentralized Source Localization via Averaging
Rabbat, M., Nowak, R. M., & Bucklew, J. A. (2006) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2005.1416489 · Cited by 80
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-citationDistributed Consensus With Limited Communication Data Rate
Li, T., Fu, M., Xie, L., & Zhang, J.-F. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2052384 · Cited by 565
Broadcast Gossip Algorithms for Consensus
Aysal, T. C., Yildiz, M. E., Sarwate, A. D., & Scaglione, A. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016247 · Cited by 480
Self-citationDistributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
Kar, S., & Moura, J. M. F. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2036046 · Cited by 435
Metadata
- Authors
- Aysal, T. C., Coates, M. J., & Rabbat, M. G.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-10
- Volume
- 56
- Issue
- 10
- Pages
- 4905-4918
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2040176268
- Cited by
- 315
- References
- 19
- FWCI
- 34.57
- 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.