Multi-round Attacks on Structural Controllability Properties for Non-complete Random Graphs

Policy enforcement system for secure interoperable control in distributed Smart Grid systems

“…Both rules have been extensively analysed in recent papers (Alcaraz et al, , 2015Alcaraz and Wolthusen, 2014) to explore behaviours when the structural controllability is being perturbed (Alcaraz et al, , 2015, and to evaluate its resilience against threats to the availability of resources (nodes and links) (Alcaraz and Wolthusen, 2014). Regarding the complexity of PDS, Haynes et al showed the NP-hardness of the PDS problem, also evaluated by Downey and Fellows (1999) who concluded that it is only Θðlog nÞ-approximable for general graphs.…”

“…The approaches proposed in and Alcaraz et al (2015) have been extended here not only to consider threats to the availability of nodes and links (isolation of control nodes (removing of all edges) and the arbitrary removal of a few edges), but also to exploit other types of threats related to the deliberate injection of control links (i.e., insert new links). Note that many of these disturbances do not necessarily come from faults occasioned within communication networks.…”

Recovery of Structural Controllability for Control Systems

“…This paper concentrates on power-law networks, most pertinent to a number of large-scale infrastructure networks. To identify the minimum driver node subsets N D , we follow the approach based on the power dominating set (PDS) problem, which is described in more detail in [1,2]. This interest is primarily because PDS-based networks have similar logical structures as real-world monitoring systems, where driver nodes can represent, for example, remote terminal units that control industrial sensors and actuators.…”

“…Building on previous work [1,2], this paper proposes several restoration strategies for controlling a network after N D has been perturbed. Different attack patterns that compromise nodes and the effects of the attacks have been considered extensively in [1,2], in particular, the analysis and evaluation of interactive and non-interactive attacks, including multiple rounds between attackers and defenders, respectively.…”

“…Building on previous work [1,2], this paper proposes several restoration strategies for controlling a network after N D has been perturbed. Different attack patterns that compromise nodes and the effects of the attacks have been considered extensively in [1,2], in particular, the analysis and evaluation of interactive and non-interactive attacks, including multiple rounds between attackers and defenders, respectively. However, it is clearly undesirable to restore overall controllability through complete re-computation if the PDS properties are only partially violated -where this is possible given the constraints imposed by compromised nodes -because the PDS problem is known to be N P-complete for general graphs as well as for bipartite and chordal graphs as shown by Haynes, et al [12].…”