.png){kind=icon}
.png){kind=icon}
Return
Optimal DoS attack scheduling for multi-sensor remote state estimation over interference channels
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2021.04.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we investigate the optimal denial-of-service attack scheduling problems in a multisensor case over interference channels. Multiple attackers aim to degrade the performance of remote state estimation under attackers' energy constraints. The attack decision of one attacker may be affected by the others while all attackers find their own optimal strategies to degrade estimation performance. Consequently, the Markov decision process and Markov cooperative game in two different information scenarios are formulated to study the optimal attack strategies for multiple attackers. Because of the complex computations of the high-dimensional Markov decision process (Markov cooperative game) as well as the limited information for attackers, we propose a value iteration adaptive dynamic programming method to approximate the optimal solution. Moreover, the structural properties of the optimal solution are analyzed. In the Markov cooperative game, the optimal joint attack strategy which admits a Nash equilibrium is studied. Several numerical simulations are provided to illustrate the feasibility and effectiveness of the main results. (c) 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keywords:
CYBER-PHYSICAL SYSTEMS
INTEGRITY ATTACKS
COMMUNICATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W