Recovering Structural Controllability on Erdös-Rényi Graphs in the Presence of Compromised Nodes

Bader Alwasel, Stephen Wolthusen

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Large-scale distributed control systems such as those encountered in electric power networks or industrial control systems must be assumed to be vulnerable to attacks in which adversaries can take over control over at least part of the control network by compromising a subset of nodes. In this paper we study Structural Controllability properties of the control graph in LTI systems, addressing the question of how to efficiently re-construct a control graph as far as possible in the presence of such compromised nodes. We study the case of sparse Erdöos-Rényi Graphs with directed control edges and seek to provide an approximation of an efficient reconstructed control graph while minimising control graph diameter. The approach is based on a BLOCK DECOMPOSITION of a directed graph, allowing to identify cut-vertices and cut-edges, that result in faster re-construction of PDS structure, and ultimately the regaining of control for operators of control systems by applying three phases.
Original languageEnglish
Title of host publicationProceedings of the 10th International Conference on Critical Information Infrastructures Security (CRITIS 2015)
Number of pages15
ISBN (Electronic)978-3-319-33331-1
Publication statusPublished - 18 May 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer International Publishing
ISSN (Print)0302-9743

Cite this