Guarding Networks through Mobile Heterogeneous Guards
Waseem Abbas

Citation
Waseem Abbas. "Guarding Networks through Mobile Heterogeneous Guards". Talk or presentation, 28, May, 2015.

Abstract
We discuss issue of guarding networked systems against a sequence of intruder attacks through mobile heterogeneous guards (guards with different ranges). The article makes use of graph theoretic abstractions of such systems in which agents are the nodes of a graph and edges represent interconnections between agents. Guards represent specialized mobile agents on specific nodes with capabilities to successfully detect and respond to an attack within their guarding range. Using this abstraction, the article addresses the problem in the context of eternal security problem in graphs. Eternal security refers to securing all the nodes in a graph against an infinite sequence of intruder attacks by a certain minimum number of guards. This paper makes use of heterogeneous guards and addresses all the components of the eternal security problem including the number of guards, their deployment and movement strategies. In the proposed solution, a graph is decomposed into clusters and a guard with appropriate range is then assigned to each cluster. These guards ensure that all nodes within their corresponding cluster are being protected at all times, thus achieving the eternal security in the graph.

Electronic downloads

Internal. This publication has been marked by the author for FORCES-only distribution, so electronic downloads are not available without logging in.

Citation formats

• HTML

  Waseem Abbas. <a
  href="http://www.cps-forces.org/pubs/67.html"
  ><i>Guarding Networks through Mobile Heterogeneous
  Guards</i></a>, Talk or presentation,  28, May,
  2015.

• Plain text

  Waseem Abbas. "Guarding Networks through Mobile
  Heterogeneous Guards". Talk or presentation,  28, May,
  2015.

• BibTeX

  @presentation{Abbas15_GuardingNetworksThroughMobileHeterogeneousGuards,
      author = {Waseem Abbas},
      title = {Guarding Networks through Mobile Heterogeneous
                Guards},
      day = {28},
      month = {May},
      year = {2015},
      abstract = {We discuss issue of guarding networked systems
                against a sequence of intruder attacks through
                mobile heterogeneous guards (guards with different
                ranges). The article makes use of graph theoretic
                abstractions of such systems in which agents are
                the nodes of a graph and edges represent
                interconnections between agents. Guards represent
                specialized mobile agents on specific nodes with
                capabilities to successfully detect and respond to
                an attack within their guarding range. Using this
                abstraction, the article addresses the problem in
                the context of eternal security problem in graphs.
                Eternal security refers to securing all the nodes
                in a graph against an infinite sequence of
                intruder attacks by a certain minimum number of
                guards. This paper makes use of heterogeneous
                guards and addresses all the components of the
                eternal security problem including the number of
                guards, their deployment and movement strategies.
                In the proposed solution, a graph is decomposed
                into clusters and a guard with appropriate range
                is then assigned to each cluster. These guards
                ensure that all nodes within their corresponding
                cluster are being protected at all times, thus
                achieving the eternal security in the graph.},
      URL = {http://cps-forces.org/pubs/67.html}
  }
  

Posted by Carolyn Winter on 10 Jun 2015.
Groups: forces
For additional information, see the Publications FAQ or contact webmaster at cps-forces org.