Alcaraz, Cristina

Etchevés Miciolino, Estefania

Wolthusen, Stephen D.

The notion of controllability, informally the ability to force a systeminto a desired state in a finite time or number of steps, is most closely associatedwith control systems such as those used to maintain power networks andother critical infrastructures, but has wider relevance in distributed systems. Itis clearly highly desirable to understand under which conditions attackers maybe able to disrupt legitimate control, or to force overriding controllability themselves.Following recent results by Liu et al., there has been considerable interestalso in graph-theoretical interpretation of Kalman controllability originally introducedby Lin, structural controllability. This permits the identification of sets ofdriver nodes with the desired state-forcing property, but determining such nodesis a W[2]-hard problem. To extract these nodes and represent the control relation,here we apply the POWER DOMINATING SET problem and investigate the effectsof targeted iterative multiple-vertex removal. We report the impact that differentattack strategies with multiple edge and vertex removal will have, based on underlyingnon-complete graphs, with an emphasis on power-law random graphswith different degree sequences

Multi-Round Attacks on Structural Controllability Properties for Non-Complete Random Graphs

Abstract

Similar works

Full text

Available Versions

Royal Holloway - Pure