On scheduling of deception attacks for discrete-time networked systems equipped with attack detectors
On scheduling of deception attacks for discrete-time networked systems equipped with attack detectors
复制标题
配备攻击检测器的离散时间网络系统的欺骗攻击调度
DOI：
10.1016/j.neucom.2016.09.009
复制
发表时间：
2017
期刊：
影响因子：
6
通讯作者：
Alsaadi Fuad E.
中科院分区：
文献类型：
--
作者：
Ding Derui;Wei Guoliang;Zhang Sunjie;Liu Yurong;Alsaadi Fuad E.
研究了具有攻击检测的离散时间系统欺骗攻击的攻击调度问题。具体地说，对于一类具有χ 2检测器的卡尔曼滤波器，攻击者在执行给定的攻击任务时，需要决定在不同的攻击场景（即连续欺骗攻击或随机欺骗攻击）下，最大数目是多少或攻击概率是多少.首先，根据χ 2分布的性质，分别对这两种攻击场景，在均方意义下计算了攻击下的检测概率预测值.然后，根据预测概率，在卡尔曼滤波的框架下设计欺骗攻击方案。对于连续攻击的情况，最大攻击次数通过递归Riccati差分方程确定。对于随机发起的欺骗攻击，期望的攻击概率是通过求解一个Riccati方程得到的。最后，一个目标跟踪的数值例子来证明所提出的次优攻击方案的有效性。
This paper is concerned with the attack scheduling of deception attacks for discrete-time systems with attack detection. Specifically, for a class of Kalman filters withχ2detectors, an attacker with the given attack task needs to decide how many the maximum number is or how much the attack probability is for different kinds of attack scenarios (i.e. consecutive deception attacks or randomly launched deception attacks). Firstly, in light of the property ofχ2distribution, the predictions of detection probabilities under attacks are calculated in mean-square sense for these two attack scenarios. Then, in terms of predicted probabilities, the deception attack schemes are designed in the framework of Kalman filtering. For the case of consecutive attacks, the maximum number of attacks is determined via recursive Riccati-like difference equations. For the case of randomly launched deception attacks, the desired attack probability is obtained by solving a Riccati-like equation. Finally, a numerical example on target tracking is presented to demonstrate the effectiveness of the proposed suboptimal attack schemes.