Optimal DoS attack scheduling for multi-sensor remote state estimation over interference channels

In this paper, we investigate the optimal denial-of-service attack scheduling problems in a multi-sensor 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.