Securing Multiagent Systems Against a Sequence of Intruder Attacks

Files
Sec-ACC12.pdf (170.99 KB)
Author(s)
Abbas, Waseem
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Collections
Research Publications
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/44600
Abstract
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.
Sponsor
Date
2012-06
Extent
Resource Type
Text
Resource Subtype
Proceedings
Post-print
Rights Statement
Rights URI