The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals
Abstract
Distributed algorithms are developed for optimal estimation of stationary random signals and smoothing of (even nonstationary) dynamical processes based on generally correlated observations collected by ad hoc wireless sensor networks (WSNs). Maximum a posteriori (MAP) and linear minimum mean-square error (LMMSE) schemes, well appreciated for centralized estimation, are shown possible to reformulate for distributed operation through the iterative (alternating-direction) method of multipliers. Sensors communicate with single-hop neighbors their individual estimates as well as multipliers measuring how far local estimates are from consensus. When iterations reach consensus, the resultant distributed (D) MAP and LMMSE estimators converge to their centralized counterparts when inter-sensor communication links are ideal. The D-MAP estimators do not require the desired estimator to be expressible in closed form, the D-LMMSE ones are provably robust to communication or quantization noise and both are particularly simple to implement when the data model is linear-Gaussian. For decentralized tracking applications, distributed Kalman filtering and smoothing algorithms are derived for any-time MMSE optimal consensus-based state estimation using WSNs. Analysis and corroborating numerical examples demonstrate the merits of the novel distributed estimators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
Diffusion Strategies for Distributed Kalman Filtering and Smoothing
Cattivelli, F. S., & Sayed, A. H. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2042987 · Cited by 842
Distributed Optimal Power Flow Using ADMM
Erseghe, T. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2306495 · Cited by 531
Metadata
- Authors
- Schizas, I. D., Giannakis, G. B., Roumeliotis, S. I., & Ribeiro, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-04
- Volume
- 56
- Issue
- 4
- Pages
- 1650-1666
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2140206057
- Cited by
- 192
- References
- 2
- FWCI
- 23.85
- 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: Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals. https://app.cochat.ai/papers/10.1109/tsp.2007.908943
- The paper
- Schizas, I. D., Giannakis, G. B., Roumeliotis, S. I., & Ribeiro, A. (2008). Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2007.908943
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.