Optimal Denial-of-Service Attacks Against Partially-Observable Real-Time Monitoring Systems
<|reference_start|>Optimal Denial-of-Service Attacks Against Partially-Observable Real-Time Monitoring Systems: In this paper, we investigate the impact of denial-of-service attacks on the status updating of a cyber-physical system with one or more sensors connected to a remote monitor via unreliable channels. We approach the problem from the perspective of an adversary that can strategically jam a subset of the channels. The sources are modeled as Markov chains, and the performance of status updating is measured based on the age of incorrect information at the monitor. Our objective is to derive jamming policies that strike a balance between the degradation of the system's performance and the conservation of the adversary's energy. For a single-source scenario, we formulate the problem as a partially-observable Markov decision process, and rigorously prove that the optimal jamming policy is of a threshold form. We then extend the problem to a multi-source scenario. We formulate this problem as a restless multi-armed bandit, and provide a jamming policy based on the Whittle's index. Our numerical results highlight the performance of our policies compared to baseline policies.<|reference_end|>
@article{kriouile2024optimal,
    title={Optimal Denial-of-Service Attacks Against Partially-Observable Real-Time
  Monitoring Systems},
    author={Saad Kriouile, Mohamad Assaad, Amira Alloum, and Touraj Soleymani},
    journal={arXiv preprint arXiv:2409.16794},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.16794},
    primaryClass={cs.IT math.IT math.OC}
}