Visible to the public Scheduling Intrusion Detection Systems in Resource-Bounded Cyber-Physical SystemsConflict Detection Enabled

TitleScheduling Intrusion Detection Systems in Resource-Bounded Cyber-Physical Systems
Publication TypeConference Paper
Year of Publication2015
AuthorsAbbas, Waseem, Laszka, Aron, Vorobeychik, Yevgeniy, Koutsoukos, Xenofon
Conference NameProceedings of the First ACM Workshop on Cyber-Physical Systems-Security and/or PrivaCy
Conference LocationDenver, Colorado, USA
ISBN Number978-1-4503-3827-1
KeywordsCyber-physical systems, dominating sets, Foundations, intruder detection systems, Resilient Systems, scheduling, science of security, Sensor networks, SURE Project

In order to be resilient to attacks, a cyber-physical system (CPS) must be able to detect attacks before they can cause significant damage. To achieve this, \emphintrusion detection systems (IDS) may be deployed, which can detect attacks and alert human operators, who can then intervene. However, the resource-constrained nature of many CPS poses a challenge, since reliable IDS can be computationally expensive. Consequently, computational nodes may not be able to perform intrusion detection continuously, which means that we have to devise a schedule for performing intrusion detection. While a uniformly random schedule may be optimal in a purely cyber system, an optimal schedule for protecting CPS must also take into account the physical properties of the system, since the set of adversarial actions and their consequences depend on the physical systems. Here, in the context of water distribution networks, we study IDS scheduling problems in two settings and under the constraints on the available battery supplies. In the first problem, the objective is to design, for a given duration of time $T$, scheduling schemes for IDS so that the probability of detecting an attack is maximized within that duration. We propose efficient heuristic algorithms for this general problem and evaluate them on various networks. In the second problem, our objective is to design scheduling schemes for IDS so that the overall lifetime of the network is maximized while ensuring that an intruder attack is always detected. Various strategies to deal with this problem are presented and evaluated for various networks.

Citation KeyAbbas:2015:SID:2808705.2808711