The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
Open accessAbstract
The paper studies distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and noisy intersensor communication. It introduces separably estimable observation models that generalize the observability condition in linear centralized estimation to nonlinear distributed estimation. It studies two distributed estimation algorithms in separably estimable models, theNU(with its linear counterpartLU) and theNLU. Their update rule combines a consensus step (where each sensor updates the state by weight averaging it with its neighbors' states) and an innovation step (where each sensor processes its local current observation). This makes the three algorithms of the consensus + innovations type, very different from traditional consensus. This paper proves consistency (all sensors reach consensus almost surely and converge to the true parameter value), efficiency, and asymptotic unbiasedness. ForLUandNU, it proves asymptotic normality and provides convergence rate guarantees. The three algorithms are characterized by appropriately chosen decaying weight sequences. AlgorithmsLUandNUare analyzed in the framework of stochastic approximation theory; algorithmNLUexhibits mixed time-scale behavior and biased perturbations, and its analysis requires a different approach that is developed in this paper.
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
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
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
System identification—Theory for the user
Sinha, N. K. (1989) · Automatica · doi:10.1016/0005-1098(89)90019-8 · Cited by 9,184
Coordination 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
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Foundations of Modern Probability
Kallenberg, O. (2021) · Probability Theory and Stochastic Modelling · doi:10.1007/978-3-030-61871-1 · Cited by 2,832
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
Cited by
Wireless sensor networks: a survey on recent developments and potential synergies
Rawat, P., Singh, K. D., Chaouchi, H., & Bonnin, J. M. (2014) · The Journal of Supercomputing · doi:10.1007/s11227-013-1021-9 · Cited by 1,054
Gossip 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-citationFast Distributed Gradient Methods
Jakovetic, D., Xavier, J., & Moura, J. M. F. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298712 · Cited by 624
Self-citationSayed, 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
Distributed Event-Triggered Estimation Over Sensor Networks: A Survey
Ge, X., Han, Q.-L., Zhang, X.-M., Ding, L., & Yang, F. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2917179 · Cited by 506
Distributed 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
Self-citationAdaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Consensus + 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-citationDistributed Online Optimization in Dynamic Environments Using Mirror Descent
Shahrampour, S., & Jadbabaie, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2743462 · Cited by 331
A Distributed Algorithm for Solving a Linear Algebraic Equation
Mou, S., Liu, J., & Morse, A. S. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2414771 · Cited by 284
Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
Jakovetic, D., Moura, J. M. F., & Xavier, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363299 · Cited by 123
Self-citation
Metadata
- Authors
- Kar, S., Moura, J. M. F., & Ramanan, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-06
- Volume
- 58
- Issue
- 6
- Pages
- 3575-3605
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2108306501
- Cited by
- 476
- References
- 53
- FWCI
- 49.38
- 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.