Decentralized Quantized Kalman Filtering With Scalable Communication Cost
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireless sensor networks (WSNs) offer decentralized Kalman filtering (KF) based algorithms with documented merits over centralized alternatives. Adhering to the limited power and bandwidth resources WSNs must operate with, this paper introduces two novel decentralized KF estimators based on quantized measurement innovations. In the first quantization approach, the region of an observation is partitioned into N contiguous, nonoverlapping intervals where each partition is binary encoded using a block of m bits. Analysis and Monte Carlo simulations reveal that with minimal communication overhead, the mean-square error (MSE) of a novel decentralized KF tracker based on 2-3 bits comes stunningly close to that of the clairvoyant KF. In the second quantization approach, if intersensor communications can afford m bits at time n, then the ith bit is iteratively formed using the sign of the difference between the nth observation and its estimate based on past observations (up to time n-1) along with previous bits (up to i-1) of the current observation. Analysis and simulations show that KF-like tracking based on m bits of iteratively quantized innovations communicated among sensors exhibits MSE performance identical to a KF based on analog-amplitude observations applied to an observation model with noise variance increased by a factor of [1-(1-2/pi)m]-1.
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
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
Cited by
Detection Against Linear Deception Attacks on Multi-Sensor Remote State Estimation
Li, Y., Shi, L., & Chen, T. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2648508 · Cited by 261
Metadata
- Authors
- Msechu, E. J., Roumeliotis, S. I., Ribeiro, A., & Giannakis, G. B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-08
- Volume
- 56
- Issue
- 8
- Pages
- 3727-3741
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2149083914
- Cited by
- 166
- References
- 2
- FWCI
- 18.55
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decentralized Quantized Kalman Filtering With Scalable Communication Cost. https://app.cochat.ai/papers/10.1109/tsp.2008.925931
- The paper
- Msechu, E. J., Roumeliotis, S. I., Ribeiro, A., & Giannakis, G. B. (2008). Decentralized Quantized Kalman Filtering With Scalable Communication Cost. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2008.925931
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.