Secure Filtering against Spatio-Temporal False Data Attacks under Asynchronous Sampling
Zishuo Li, Anh Tung Nguyen, André M. H. Teixeira, Yilin Mo, Karl H. Johansson
TL;DR
This work tackles secure state estimation for continuous-time LTI systems with asynchronous, non-periodic sampling under spatio-temporal false data attacks. It develops a decentralized estimation framework by decomposing the Kalman filter into local estimators, fusing them through a least-squares problem to recover the optimal attack-free state, and augmenting the fusion with an $\ell_1$-regularized term to achieve resilience against attacks. Theoretical results show exact recovery of the Kalman estimate in the absence of attacks and a uniform error bound under $p$-sparse spatio-temporal attacks under observability redundancy; these findings are validated on the IEEE 14-bus benchmark. The work offers a scalable, robust approach for secure state estimation in large-scale cyber-physical systems with asynchronous communications, with practical implications for power grids and similar networks.
Abstract
This paper addresses the secure state estimation problem for continuous linear time-invariant systems with non-periodic and asynchronous sampled measurements, where the sensors need to transmit not only measurements but also sampling time-stamps to the fusion center. This measurement and communication setup is well-suited for operating large-scale control systems and, at the same time, introduces new vulnerabilities that can be exploited by adversaries through (i) manipulation of measurements, (ii) manipulation of time-stamps, (iii) elimination of measurements, (iv) generation of completely new false measurements, or a combination of these attacks. To mitigate these attacks, we propose a decentralized estimation algorithm in which each sensor maintains its local state estimate asynchronously based on its measurements. The local states are synchronized through time prediction and fused after time-stamp alignment. In the absence of attacks, state estimates are proven to recover the optimal Kalman estimates by solving a weighted least square problem. In the presence of attacks, solving this weighted least square problem with the aid of $\ell_1$ regularization provides secure state estimates with uniformly bounded error under an observability redundancy assumption. The effectiveness of the proposed algorithm is demonstrated using a benchmark example of the IEEE 14-bus system.
