no code implementations • 29 Oct 2020 • Akanshu Gupta, Abhinava Sikdar, Arpan Chattopadhyay
The quickest attack detection problem for a known {\em linear} attack scheme in the Bayesian setting with a Geometric prior on the attack initiation instant is posed as a constrained Markov decision process (MDP), in order to minimize the expected detection delay subject to a false alarm constraint, with the state involving the probability belief at the estimator that the system is under attack.
