Abstract
The problem of controllability of networks arises in a number of different domains, including in critical infrastructure systems where control must be maintained continuously. Recent work by Liu et al.has renewed interest in the seminal work by Lin on structural controllability, providing a graph-theoretical interpretation. This allows the identification of driver nodes capable of forcing the system into a desired state, which implies an obvious target for attackers wishing to disrupt the network control. Several methods for identifying driver nodes exist, but require undesirable computational complexity. In this paper, we therefore investigate the ability to regain or maintain controllability in the presence of adversaries able to remove vertices and implicit edges of the controllability graph. For this we rely on the Power Dominating Set (PDS) formulation for identifying the control structure and study different attack strategies for multiple network models. As the construction of a PDS for a given graph is not unique, we further investigate different strategies for PDS construction, and provide a simulative evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kalman, R.E.: Mathematical description of linear dynamical systems. Journal of the Society of Industrial and Applied Mathematics Control Series A 1, 152–192 (1963)
Lin, C.-T.: Structual Controllability. IEEE Transactions on Automatic Control 19(3), 201–208 (1974)
Liu, Y.-Y., Slotine, J.-J., Barabási, A.-L.: Controllability of Complex Networks. Nature 473, 167–173 (2011)
Wang, W.-X., Ni, X., Lai, Y.-C., Grebogi, C.: Optimizing controllability of complex networks by minimum structural perturbations. Physical Review E 85(2), 026115 (2012)
Pu, C.-L., Pei, W.-J., Michaelson, A.: Robustness analysis of network controllability. Physica A: Statistical Mechanics and its Applications 391(18), 4420–4425 (2012)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)
Micali, S., Vazirani, V.V.: An \(O(\sqrt{|V|}|E|)\) Algorithm for Finding Maximum Matching in General Graphs. In: Book, R.V. (ed.) Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS 1980), Syracuse, NY, USA, pp. 17–27. IEEE Press (October 1980)
Lovász, L., Plummer, M.D.: Matching Theory. American Mathematical Society, Providence (2009)
Pósfai, M., Liu, Y.-Y., Slotine, J.-J., Barabási, A.-L.: Effect of Correlations on Network Controllability. Nature Scientific Reports 3(1067), 1–7 (2013)
Bollobás, B., Riordan, O.: Robustness and Vulnerability of Scale-Free Random Graphs. Internet Mathematics 1(1), 1–35 (2003)
Sudakov, B., Vu, V.H.: Local Resilience of Graphs. Random Structures & Algorithms 33(4), 409–433 (2008)
Haynes, T.W., Mitchell Hedetniemi, S., Hedetniemi, S.T., Henning, M.A.: Domination in Graphs Applied to Electric Power Networks. SIAM Journal on Discrete Mathematics 15(4), 519–529 (2002)
Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM 45(4), 634–652 (1998)
Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized Power Domination Complexity. Information Processing Letters 98(4), 145–149 (2006)
Aazami, A., Stilp, K.: Approximation Algorithms and Hardness for Domination with Propagation. SIAM Journal on Discrete Mathematics 23(3), 1382–1399 (2009)
Guo, J., Niedermeier, R., Raible, D.: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2), 177–202 (2008)
Binkele-Raible, D., Fernau, H.: An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63(1-2), 323–346 (2012)
Pai, K.-J., Chang, J.-M., Wang, Y.-L.: Restricted Power Domination and Fault-Tolerant Power Domination on Grids. Discrete Applied Mathematics 158(10), 1079–1089 (2010)
Atkins, D., Haynes, T.W., Henning, M.A.: Placing Monitoring Devices in Electric Power Networks Modelled by Block Graphs. Ars Combinatorica 79(1) (April 2006)
Bollobás, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge (2001)
Watts, D.J., Strogatz, S.H.: Collective Dynamics of ‘Small-World’ Networks. Nature 393, 440–442 (1998)
Albert, R., Barabási, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2002)
Cohen, R., Havlin, S., Ben Avraham, D.: Structural Properties of Scale-Free Networks. In: Bornholdt, S., Schuster, H.-G. (eds.) Handbook of Graphs and Networks: From the Genome to the Internet, Wiley-VCH, Weinheim (2005)
Palmer, C.R., Steffan, J.G.: Generating Network Topologies That Obey Power Laws. In: Proceedings of the 2000 IEEE Global Telecommunications Conference (GLOBECOM 2000), vol. 1, pp. 434–438. IEEE Press, San Francisco (2000)
Pagani, G.A., Aiello, M.: The Power Grid as a Complex Network: A Survey. Physica A: Statistical Mechanics and its Applications 392(11), 2688–2700 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Alcaraz, C., Miciolino, E.E., Wolthusen, S. (2013). Structural Controllability of Networks for Non-interactive Adversarial Vertex Removal. In: Luiijf, E., Hartel, P. (eds) Critical Information Infrastructures Security. CRITIS 2013. Lecture Notes in Computer Science, vol 8328. Springer, Cham. https://doi.org/10.1007/978-3-319-03964-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-03964-0_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03963-3
Online ISBN: 978-3-319-03964-0
eBook Packages: Computer ScienceComputer Science (R0)