An optimal graph-search method for secure state estimation
From MaRDI portal
Publication:2662283
Abstract: The growing complexity of modern Cyber-Physical Systems (CPS) and the frequent communication between their components make them vulnerable to malicious attacks. As a result, secure state estimation is a critical requirement for the control of these systems. Many existing secure state estimation methods suffer from combinatorial complexity which grows with the number of states and sensors in the system. This complexity can be mitigated using optimization-based methods that relax the original state estimation problem, although at the cost of optimality as these methods often identify attack-free sensors as attacked. In this paper, we propose a new optimal graph-search algorithm to correctly identify malicious attacks and to securely estimate the states even in large-scale CPS modeled as linear time-invariant systems. The graph consists of layers, each one containing two nodes capturing a truth assignment of any given sensor, and directed edges connecting adjacent layers only. Then, our algorithm searches the layers of this graph incrementally, favoring directions at higher layers with more attack-free assignments, while actively managing a repository of nodes to be expanded at later iterations. The proposed search bias and the ability to revisit nodes in the repository and self-correct, allow our graph-search algorithm to reach the optimal assignment faster and tackle larger problems. We show that our algorithm is complete and optimal provided that process and measurement noises do not dominate the attack signal. Moreover, we provide numerical simulations that demonstrate the ability of our algorithm to correctly identify attacked sensors and securely reconstruct the state. Our simulations show that our method outperforms existing algorithms both in terms of optimality and execution time.
Recommendations
- Distributed secure state estimation for cyber-physical systems under sensor attacks
- Distributed secure state estimation and control for CPSs under sensor attacks -- a finite time approach
- Finite time attack detection and supervised secure state estimation for CPSs with malicious adversaries
- Switched projected gradient descent algorithms for secure state estimation under sparse sensor attacks
- Secure state estimation for systems under mixed cyber-attacks: security and performance analysis
Cites work
- A secure control framework for resource-limited adversaries
- Attack Detection and Identification in Cyber-Physical Systems
- Attack-Resilient State Estimation for Noisy Dynamical Systems
- Diagnosis and Fault-Tolerant Control
- Efficient Computations of a Security Index for False Data Attacks in Power Networks
- Event-Triggered State Observers for Sparse Sensor Noise/Attacks
- Resilient Detection in the Presence of Integrity Attacks
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
- Secure State Estimation Against Sensor Attacks in the Presence of Noise
- Secure State Estimation for Cyber-Physical Systems Under Sensor Attacks: A Satisfiability Modulo Theory Approach
Cited in
(7)- Distributed secure state estimation for cyber-physical systems under sensor attacks
- Sparse attack reconstruction for cyber-physical systems via descriptor reduced-order observer
- Optimal resilient sensor placement problem for secure state estimation
- Distributed secure state estimation for linear systems against malicious agents through sorting and filtering
- Finite time secure state estimation for linear cyber‐physical systems with actuator and sensor attacks
- Secure state estimation for cyber-physical systems with unknown input sliding mode observer
- Identification of FIR systems with binary-valued observations under replay attacks
This page was built for publication: An optimal graph-search method for secure state estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662283)
