Distributed secure state estimation for cyber–physical systems under sensor attacks
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Cyber–physical systems (CPSs) usually employ distributed sensor networks to gather, process and exchange information as a team. In contrast to the previous centralized secure state estimation (SSE) for CPSs, this paper proposes a distributed SSE algorithm via consensus-based distributed non-convex optimization protocols. The algorithm is implemented over a multi-agent network where each agent privately processes own sensing measurements while communicating with its neighbors via a graph topology. The combinatorial problem caused by the sparse sensor attacks is solved well via a transformation technique and a distributed vote location approach. Based on min-switching and check mechanisms, it is proved that the algorithm achieves consensus at the true system state with probability one under the condition of the graph being regular with a certain prescribed connectivity. Simulation results demonstrate the accuracy of the developed algorithm under the condition of attacks.
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
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
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
Cited by
Secure Adaptive-Event-Triggered Filter Design With Input Constraint and Hybrid Cyber Attack
Liu, J., Wang, Y., Cao, J., Yue, D., & Xie, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3003752 · Cited by 231
“According to the different attack targets, there are sensor attack [31], actuator attack [32], network attack [33], and so on.”
Background
Metadata
- Authors
- An, L., & Yang, G.-H.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2019-09
- Volume
- 107
- Pages
- 526-538
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2954637328
- Cited by
- 191
- References
- 3
- FWCI
- 10.60
- 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.