Securing multiagent systems against a sequence of intruder attacks

In this paper, we discuss the issue of security in multiagent systems in the context of their underlying graph structure that models the interconnections among agents. In particular, we investigate the minimum number of guards required to counter an infinite sequence of intruder attacks with a given sensing and response range of an individual guard. We relate this problem of eternal security in graphs to the domination theory in graphs, providing tight bounds on the number of guards required along with schemes for securing a multiagent system over a graph.

[1]  JH van Vuuren,et al.  Infinite Order Domination in Graphs , 2003 .

[2]  Michael P. Baldado.  Eternal 1-Security Number of the Corona and Cartesian Product of Graphs , 2011 .

[3]  Lynne E. Parker,et al.  Cooperative Robotics for Multi-Target Observation , 1999, Intell. Autom. Soft Comput..

[4]  Jason I. Brown,et al.  Independence polynomials of circulants with an application to music , 2009, Discret. Math..

[5]  Camillo J. Taylor,et al.  Dynamic Sensor Planning and Control for Optimally Tracking Targets , 2003, Int. J. Robotics Res..

[6]  Shreyas Sundaram,et al.  Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents , 2011, IEEE Transactions on Automatic Control.

[7]  David A. Anisi,et al.  Cooperative Minimum Time Surveillance With Multiple Ground Vehicles , 2010, IEEE Transactions on Automatic Control.

[8]  F. Bullo,et al.  Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.

[9]  Antonio Bicchi,et al.  Dynamic distributed intrusion detection for secure multi-robot systems , 2009, 2009 IEEE International Conference on Robotics and Automation.

[10]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[11]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[12]  Antonio Bicchi,et al.  Distributed intrusion detection for secure consensus computations , 2007, 2007 46th IEEE Conference on Decision and Control.

[13]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[14]  Joanna Raczek.  Distance paired domination numbers of graphs , 2008, Discret. Math..

[15]  H. Fleischner.  The square of every two-connected graph is Hamiltonian , 1974 .

[16]  Lynne E. Parker,et al.  Cooperative multi-robot observation of multiple moving targets , 1997, Proceedings of International Conference 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]  J. Gross,et al.  Graph Theory and Its Applications , 1998 .