Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Critical Information Infrastructures Security (CRITIS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9578))

Abstract

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 at least part of the control network by compromising a subset of nodes. We investigate Structural Controllability properties of the control graph in Linear Time-Invariant systems (LTI), 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ős-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-edge. This results in faster re-construction of Power Dominating Set (PDS) structure, and ultimately the re-gaining of control for operators of control systems by applying three phases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Lin, C.T.: Structural Controllability. IEEE Trans. Autom. Control 19(3), 201–208 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  2. Liu, Y.Y., Slotine, J.J., Barabási, A.L.: Controllability of Complex Networks. Nature 473, 167–173 (2011)

    Article  Google Scholar 

  3. Wang, W.X., Ni, X., Lai, Y.C., Grebogi, C.: Optimizing controllability of complex networks by minimum structural perturbations. Phys. Rev. E 85(2), 026–115 (2012)

    Article  Google Scholar 

  4. Pu, C.L., Pei, W.J., Michaelson, A.: Robustness analysis of network controllability. Phys. A 391(18), 4420–4425 (2012)

    Article  Google Scholar 

  5. Pósfai, M., Liu, Y.Y., Slotine, J.J., Barabási, A.L.: Effect of correlations on network controllability. Nature Sci. Rep. 3(1067), 1–7 (2013)

    Google Scholar 

  6. Nacher, J.C., Akutsu, T.: Structural controllability of unidirectional bipartite networks. Nature Sci. Rep. 3(1647), 1–7 (2013)

    Google Scholar 

  7. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. discrete Math. 15(4), 519–529 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Xu, G., Kang, L., Shan, E., Zhao, M.: Power domination in block graphs. Theoret. Comput. Sci. 1–3, 299–305 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized power domination complexity. Inf. Process. Lett. 98(4), 145–149 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Guo, J., Niedermeier, R., Raible, D.: Improved algorithms and complexity results for power domination in graphs. Algorithmica 52(2), 177–202 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Alwasel, B., Wolthusen, S.: Structural controllability analysis via embedding power dominating set approximation in Erdős-Rényi Graphs. In: the proceedings of the 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015), Gwangju, Korea, IEEE Press (2015)

    Google Scholar 

  12. Alwasel, B., Wolthusen, S.: Reconstruction of structural controllability over Erdős-Rényi graphs via power dominating sets. In: Proceedings of the 9th Cyber and Information Security Research Conference (CSIRC 2014), Oak Ridge, TN, USA, ACM Press, April 2014

    Google Scholar 

  13. Feige, U.: A threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Aazami, A., Stilp, K.: Approximation algorithms and hardness for domination with propagation. SIAM J. Discrete Math. 23(3), 1382–1399 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Alwasel, Bader, Wolthusen, Stephen D.: Recovering structural controllability on Erdos-Rènyi graphs via partial control structure re-use. In: Panayiotou, Christos G., et al. (eds.) CRITIS 2014. LNCS, vol. 8985, pp. 293–307. Springer, Heidelberg (2016). doi:10.1007/978-3-319-31664-2_30

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Information Security, Royal Holloway, University of London, TW20 0EX, Egham, UK

    Bader Alwasel & Stephen D. Wolthusen

  2. Norwegian Information Security Laboratory, Faculty of Computer Science, Gjøvik University College, Gjøvik, Norway

    Stephen D. Wolthusen

  3. Community College of Unaizah, Qassim University, Buraydah, Kingdom of Saudi Arabia

    Bader Alwasel

Authors
  1. Bader Alwasel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen D. Wolthusen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stephen D. Wolthusen .

Editor information

Editors and Affiliations

  1. Autonomus Intelligent Systems, Fraunhofer Institute, Sankt Augustin, Nordrhein-Westfalen, Germany

    Erich Rome

  2. Inst. Protec. & Security Citizen, Ispra, Italy

    Marianthi Theocharidou

  3. University of London, London, United Kingdom

    Stephen Wolthusen

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Alwasel, B., Wolthusen, S.D. (2016). Recovering Structural Controllability on Erdős-Rényi Graphs in the Presence of Compromised Nodes. In: Rome, E., Theocharidou, M., Wolthusen, S. (eds) Critical Information Infrastructures Security. CRITIS 2015. Lecture Notes in Computer Science(), vol 9578. Springer, Cham. https://doi.org/10.1007/978-3-319-33331-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33331-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33330-4

  • Online ISBN: 978-3-319-33331-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation