On scheduling of deception attacks for discrete-time networked systems equipped with attack detectors

详细信息    查看全文

• 作者：Derui Ding^a ; ^{deruiding2010@usst.edu.cn}Author Vitae ; Guoliang Wei^aAuthor Vitae ; Sunjie Zhang^aAuthor Vitae ; Yurong Liu^b ; ^cAuthor Vitae ; Fuad E. Alsaadi^cAuthor Vitae
• 关键词：Deception attack design ; Consecutive attacks ; Randomly launched deception attacks ; The maximum number ; Attack probability
• 刊名：Neurocomputing
• 出版年：2017
• 出版时间：5 January 2017
• 年：2017
• 卷：219
• 期：Complete
• 页码：99-106
• 全文大小：771 K
• 卷排序：219

文摘

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 χ2 detectors, 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 χ2 distribution, 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.