Optimal Denial-of-Service Attack Strategy on State Estimation Over Infinite-Time Horizon

Security issues of cyber-physical systems have become a timely and hot topic in recent years. In this brief, we investigate the power-constrained optimal denial-of-service (DoS) attack strategy with multiple power levels on state estimation over infinite-time horizon. We start from the two-level case and explicitly derive out the basic form of optimal attack strategy. In order to handle the intractability brought about by the larger number of levels, we develop an equivalent property for general multi-level cases that the multi-level scheduling can be viewed as a feasible combination of several sub-schedules with a designed stochastic-triggered manner, which provides a necessary condition of optimal solution. Moreover, based on the practical communication model, we give the condition under which the optimal schedule can be uniquely and explicitly determined for the two-pick strategy. Numerical simulations are accomplished to verify the effectiveness of our proposed methods.