Name
Abstract | ||
|---|---|---|
We consider the problem of robust state estimation in the presence of integrity attacks. There are $m$ sensors monitoring a dynamical process. Subject to the integrity attacks, $p$ out of $m$ measurements can be arbitrarily manipulated. The classical approach such as the MMSE estimation in the literature may not provide a reliable estimate under this so-called $(p,m)$-sparse attack. In this work, we propose a robust estimation framework where distributed local measurements are computed first and fused at the estimator based on a convex optimization problem. We show the sufficient and necessary conditions for robustness of the proposed estimator. The sufficient and necessary conditions are shown to be tight, with a trivial gap. We also present an upper bound on the damage an attacker can cause when the sufficient condition is satisfied. Simulation results are also given to illustrate the effectiveness of the estimator. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Information Theory | Mathematical optimization,Upper and lower bounds,Robustness (computer science),Convex optimization,Mathematics,Estimator |
DocType | Volume | Citations |
Journal | abs/1601.04180 | 1 |
PageRank | References | Authors |
0.36 | 6 | 3 |