Skip to main content
SpringerLink
Log in

Recovering Structural Controllability on Erdős-Rényi Graphs via Partial Control Structure Re-Use

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

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

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 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ős-Rényi Graphs with directed control edges and seek to provide an approximation of an efficient reconstructed control graph by minimising control graph diameter. As the underlying Power Dominating Set problem does not permit efficient re-computation, we propose to reduce the average-case complexity of the recovery algorithm by re-using remaining fragments of the original, efficient control graph where possible and identifying previously un-used edges to re-join these fragments to a complete control graph, validating that all constraints are satisfied in the process. Whilst the worst-case complexity is not improved, we obtain an enhanced average-case complexity that offers a substantial improvement where sufficiently many fragments of the original control graph remain, as would be the case where an adversary can only take over regions of the network and thereby control graph.

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

Access this chapter

Log in via an institution
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

References

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

    Article  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. Nat. Sci. Rep. 3(1067), 1–7 (2013)

    Google Scholar 

  6. Nacher, J.C., Akutsu, T.: Structural controllability of unidirectional bipartite networks. Nat. 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. 359(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. Feige, U.: A threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Binkele-Raible, D., Fernau, H.: An exact exponential time algorithm for power dominating set. Algorithmica 63(1–2), 323–346 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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 

  14. 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, pp. 57–60. ACM Press, April 2014

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Information Security, Royal Holloway, University of London, Egham, TW20 0EX, 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

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. University of Cyprus , Nicosia, Cyprus

    Christos G. Panayiotou

  2. University of Cyprus , Nicosia, Cyprus

    Georgios Ellinas

  3. University of Cyprus , Nicosia, Cyprus

    Elias Kyriakides

  4. University of Cyprus , Nicosia, Cyprus

    Marios M. Polycarpou

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 via Partial Control Structure Re-Use. In: Panayiotou, C., Ellinas, G., Kyriakides, E., Polycarpou, M. (eds) Critical Information Infrastructures Security. CRITIS 2014. Lecture Notes in Computer Science(), vol 8985. Springer, Cham. https://doi.org/10.1007/978-3-319-31664-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31664-2_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31663-5

  • Online ISBN: 978-3-319-31664-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation