Herein, design of false data injection attack on a distributed cyber-physical system is considered. A stochastic process with linear dynamics and Gaussian noise is measured by multiple agent nodes, each equipped with multiple sensors. The agent nodes form a multi-hop network among themselves. Each agent node computes an estimate of the process by using its sensor observation and messages obtained from neighboring nodes, via Kalman-consensus filtering. An external attacker, capable of arbitrarily manipulating the sensor observations of some or all agent nodes, injects errors into those sensor observations. The goal of the attacker is to steer the estimates at the agent nodes as close as possible to a pre-specified value, while respecting a constraint on the attack detection probability. To this end, a constrained optimization problem is formulated to find the optimal parameter values of a certain class of linear attacks. The parameters of linear attack are learnt on-line via a combination of stochastic approximation based update of a Lagrange multiplier, and an optimization technique involving either the Karush-Kuhn-Tucker (KKT) conditions or online stochastic gradient descent. The problem turns out to be convex for some special cases. Desired convergence of the proposed algorithms are proved by exploiting the convexity and properties of stochastic approximation algorithms. Finally, numerical results demonstrate the efficacy of the attack.
翻译:此处考虑对分布式网络物理系统进行虚假数据注入攻击。 一个具有线性动态和高斯噪声的随机过程, 由多个带有多个传感器的代理节点来测量。 代理节点形成一个多跳网络。 每个代理节点通过 Kalman- consensus 过滤, 使用传感器观测和从相邻节点获得的信息来计算该过程的估计。 一个外部攻击者, 能够任意操纵某些或所有代理节点的传感器观测, 将错误注入这些传感器观测中。 攻击者的目标是将代理节点的估计数尽可能靠近预定值, 同时尊重攻击探测概率的制约。 为此, 设定一个有限的优化问题, 以找到某类线性攻击的最佳参数。 线性攻击的参数是通过基于静电近近近的更新组合在网上学习的, 以及一种优化技术, 涉及Karush- Kuhn-Tuck( KKT) 的某些特殊条件或在线直截面值排序结果, 被证明, 将最小的直角值的直观性演算结果转化为最后的直观度。