The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
Open accessAbstract
The paper studies the problem of distributed average consensus in sensor networks with quantized data and random link failures. To achieve consensus, dither (small noise) is added to the sensor states before quantization. When the quantizer range is unbounded (countable number of quantizer levels), stochastic approximation shows that consensus is asymptotically achieved with probability one and in mean square to a finite random variable. We show that the mean-squared error (mse) can be made arbitrarily small by tuning the link weight sequence, at a cost of the convergence rate of the algorithm. To study dithered consensus with random links when the range of the quantizer is bounded, we establish uniform boundedness of the sample paths of the unbounded quantizer. This requires characterization of the statistical properties of the supremum taken over the sample paths of the state of the quantizer. This is accomplished by splitting the state vector of the quantizer in two components: one along the consensus subspace and the other along the subspace orthogonal to the consensus subspace. The proofs use maximal inequalities for submartingale and supermartingale sequences. From these, we derive probability bounds on the excursions of the two subsequences, from which probability bounds on the excursions of the quantizer state vector follow. The paper shows how to use these probability bounds to design the quantizer parameters and to explore tradeoffs among the number of quantizer levels, the size of the quantization steps, the desired probability of saturation, and the desired level of accuracy ¿ away from consensus. Finally, the paper illustrates the quantizer design with a numerical study.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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 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×
“We refer the reader to the recent overviews on consensus, which include [10] and [11].”
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
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
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
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Stochastic Approximation and Recursive Algorithms and Applications
(2003) · Stochastic Modelling and Applied Probability · doi:10.1007/b97441 · Cited by 1,838
Williams, D. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813658 · Cited by 1,691
(1992) · Choice Reviews Online · doi:10.5860/choice.30-1565 · Cited by 1,415
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
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
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Dynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
Kar, S., & Moura, J. M. F. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007111 · Cited by 691
Self-citationBorkar, V. S. (2008) · Texts and Readings in Mathematics · doi:10.1007/978-93-86279-38-5 · Cited by 561
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
Stochastic Approximation and Recursive Estimation
Nevel′son, M., & Has′minskiĭ, R. (1976) · Translations of Mathematical Monographs · doi:10.1090/mmono/047 · Cited by 525
Graph theory, combinatorics, and applications
Alavi, Y., Chartrand, G., & Oellermann, O. R. (2017) · Cited by 520
Kar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Self-citationGray, R. M., & Stockham, T. G. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256489 · Cited by 409
Dither Signals and Their Effect on Quantization Noise
Schuchman, L. (1964) · IEEE Transactions on Communications · doi:10.1109/tcom.1964.1088973 · Cited by 408
Ultrafast consensus in small-world networks
Olfati-Saber, R. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470321 · Cited by 384
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
Quantization and Dither: A Theoretical Survey
Lipshitz, S. P., Wannamaker, R. A., & Vanderkooy, J. (1992) · Journal of the Audio Engineering Society · Cited by 286
Collective Motion of Self-Propelled Particles: Kinetic Phase Transition in One Dimension
Czirók, A., Barabási, A.-L., & Vicsek, T. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.209 · Cited by 267
Average consensus on networks with quantized communication
Frasca, P., Carli, R., Fagnani, F., & Zampieri, S. (2009) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1396 · Cited by 256
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
Graph Effective Resistance and Distributed Control: Spectral Properties and Applications
Barooah, P., & Hespanha, J. P. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377619 · Cited by 181
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
Topology for Distributed Inference on Graphs
Kar, S., Aldosari, S. A., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.923536 · Cited by 107
Self-citationAgreement in presence of noise: pseudogradients on random geometric networks
Hatano, Y., Das, A. K., & Mesbahi, M. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1583185 · Cited by 77
Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel NoisePreprint
Kar, S., & Moura, J. M. F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.3915 · Cited by 63
Self-citationOn 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
Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks
Aldosari, S. A., & Moura, J. M. F. (2006) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2005.1599738 · Cited by 40
Self-citationKar, S., Moura, J. M. F., & Ramanan, K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.0009 · Cited by 32
Self-citationBinary consensus with soft information processing in cooperative networks
Ruan, Y., & Mostofi, Y. (2008) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2008.4738899 · Cited by 31
Efficient quantized techniques for consensus algorithms
Carli, R., Fagnani, F., Frasca, P., et al. (2007) · Cited by 23
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
Liu, J., Yadav, V. K., Sehgal, H., Olson, J. M., Liu, H., & Elia, N. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929382 · Cited by 16
Binary Consensus over Fading Channels: A Best Affine Estimation Approach
Malmirchegini, M., Ruan, Y., & Mostofi, Y. (2008) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2008.ecp.939 · Cited by 10
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
Liu, J., Yadav, V. K., Sehgal, H., Olson, J., Liu, H., & Elia, N. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1582244 · Cited by 8
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-citationSayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Distributed 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
Kar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Self-citation
Metadata
- Authors
- Kar, S., & Moura, J. M. F.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-03
- Volume
- 58
- Issue
- 3
- Pages
- 1383-1400
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2111857756
- Cited by
- 435
- References
- 46
- FWCI
- 34.41
- 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.