Identification and Infiltration in Consensus-type Networks* *This work has been supported by AFOSR FA9550-09-1-0091.

Abstract This paper examines the system dynamics of a controlled networked multi-agent system, operating with a consensus-type algorithm, that is under the influence of attached node(s). We introduce an identification scheme, involving excitation and observation of the network by the attached node(s), that identifies the spectrum of the underlying system matrix - in this case the influenced network's modified graph Laplacian. Following this identification, infiltration node(s) are then attached to a set of nodes in the network with the objective of sabotaging the network by delivering a constant mean control signal. The spectrum of the modified graph Laplacian provides bounds on the convergence of the system states due to infiltration, quantifying the network's security. We also derive bounds on the effectiveness of the network infiltration in a more general setting by examining the controllability gramian of the infiltrated consensus-type coordination algorithm.

[1]  Jean C. Walrand,et al.  Security in networks: A game-theoretic approach , 2008, 2008 47th IEEE Conference on Decision and Control.

[2]  Ivan Gutman,et al.  THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUE , 2002 .

[3]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[4]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[5]  Josef Leydold,et al.  Algebraic Connectivity and Degree Sequences of Trees , 2008, 0810.0966.

[6]  Wen-Chyuan Yueh.  EIGENVALUES OF SEVERAL TRIDIAGONAL MATRICES , 2005 .

[7]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[8]  T. Başar,et al.  Optimal and robust epidemic response for multiple networks , 2009 .

[9]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[10]  M. T. Qureshi,et al.  Lyapunov Matrix Equation in System Stability and Control , 2008 .

[11]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[12]  Petre Stoica,et al.  Decentralized Control , 2018, The Control Systems Handbook.

[13]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[14]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[15]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[16]  Vijay Kumar,et al.  Leader-to-formation stability , 2004, IEEE Transactions on Robotics and Automation.

[17]  Antonio Bicchi,et al.  Decentralized intrusion detection for secure cooperative multi-agent systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  Gene H. Golub,et al.  Some modified matrix eigenvalue problems , 1973, Milestones in Matrix Computation.

[19]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.