Abstract
This chapter examines the role of structural controllability (s-controllability) in the design of secure linear-time-invariant networked systems. We reason about secure network design in the face of two attack vectors: a “Disrupt” attack where the infiltrator’s objective is to perturb the network to render it unusable, and a “Highjack and eavesdrop” attack to actively control and probe the network. For the former attack, strong s-controllable input sets are chosen to control the network to provide robustness to these attacks. Weak s-controllable input sets are selected by infiltrators for the “Highjack and eavesdrop” attack so as to generically guarantee a successful attack.
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
References
S. Sundaram and C. N. Hadjicostis, “Distributed function calculation via linear iterations in the presence of malicious agents - part I: attacking the network,” in Proc. American Control Conference, 2008, pp. 1350–1355.
R. Olfati-Saber, “Flocking for multi-agent dynamic systems: algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.
A. Fagiolini, G. Valenti, L. Pallottino, G. Dini, and A. Bicchi, “Decentralized intrusion detection for secure cooperative multi-agent systems,” in Proc. 46th IEEE Conference on Decision and Control, 2007, pp. 1553–1558.
F. Pasqualetti, A. Bicchi, and F. Bullo, “Distributed intrusion detection for secure consensus computations,” in Proc. 46th IEEE Conference on Decision and Control, 2007, pp. 5594–5599.
F. Pasqualetti, A. Bicchi, and F. Bullo, “On the security of linear consensus networks,” in Proc. 48th IEEE Conference on Decision and Control, 2009, pp. 4894–4901.
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, “Complex networks: structure and dynamics,” Physics Reports, vol. 424, no. 4–5, pp. 175–308, 2006.
N. Ganguly, A. Deutsch, and A. Mukherjee, Dynamics on and of Complex Networks: Applications to Biology, Computer Science, and the Social Sciences. Boston: Birkhauser, 2009.
L. Kocarev and G. Vattay, Complex Dynamics in Communication Networks. Berlin: Springer, 2005.
Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási, “Controllability of complex networks,” Nature, vol. 473, no. 7346, pp. 167–73, May 2011.
K. J. Reinschke, F. Svaricek, and H.-D. Wend, “On strong structural controllability of linear systems,” in Proc. 31st IEEE Conference on Decision and Control, no. 1, 1992, pp. 203–206.
M. Golumbic, T. Hirst, and M. Lewenstein, “Uniquely restricted matchings,” Algorithmica, vol. 31, no. 2, pp. 139–154, 2001.
S. Micali and V. V. Vazirani, “An \(O(\sqrt{\vert V \vert }\vert E\vert )\) algorithm for finding maximum matching in general graphs,” in 21st Annual Symposium on Foundations of Computer Science, Oct. 1980, pp. 17–27.
A. Gueye and J. C. Walrand, “Security in networks: A game-theoretic approach,” in Proc. 47th IEEE Conference on Decision and Control, 2008, pp. 829–834.
M. Bloem, T. Alpcan, and T. Basar, “Optimal and robust epidemic response for multiple networks,” in Proc. 46th IEEE Conference on Decision and Control, 2007, pp. 5074–5079.
Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos, “Epidemic spreading in real networks: an eigenvalue viewpoint,” in Proc. 22nd International Symposium on Reliable Distributed Systems, 2003, pp. 25–34.
M. Mucha and P. Sankowski, “Maximum matching via Gaussian elimination,” in 45th IEEE Symp. Foundations of Computer Science, 2004, pp. 248–255.
S. Even, Graph Algorithms. New York: Cambridge University Press, 2011.
K. Wang and A. Michel, “Necessary and sufficient conditions for the controllability and observability of a class of linear, time-invariant systems with interval plants,” IEEE Transactions on Automatic Control, vol. 39, no. 7, pp. 1443–1447, 1994.
A. Chapman and M. Mesbahi, “Strong structural controllability of networked dynamics,” in Proc. American Control Conference, 2013, pp. 6141–6146.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chapman, A. (2015). Security and Infiltration of Networks: A Structural Controllability and Observability Perspective. In: Semi-Autonomous Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-15010-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-15010-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15009-3
Online ISBN: 978-3-319-15010-9
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)