Loading...

Capturing an intruder in product networks

Imani, N ; Sharif University of Technology | 2007

303 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.jpdc.2007.04.013
  3. Publisher: 2007
  4. Abstract:
  5. In this paper, we propose a solution to the problem of capturing an intruder in a product network. This solution is derived based on the assumption of existing algorithms for basic member graphs of a graph product. In this problem, a team of cleaner agents are responsible for capturing a hostile intruder in the network. While the agents can move in the network one hop at a time, the intruder is assumed to be arbitrarily fast in a way that it can traverse any number of nodes contiguously as far as no agents reside in those nodes. Here, we consider a version of the problem where each agent can replicate new agents. Thus, the algorithm starts with a single agent and new agents are created on demand. We propose a novel method for deriving intrusion capturing algorithms based on the abstract idea of spanning search trees. Later, we utilize this method for deriving capturing algorithms for Cartesian product graphs. © 2007 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Algorithms ; Distributed computer systems ; Graph theory ; Problem solving ; Telecommunication links ; Cartesian product networks ; Graph search ; Intruder capturing ; Intrusion detection
  8. Source: Journal of Parallel and Distributed Computing ; Volume 67, Issue 9 , 2007 , Pages 1018-1028 ; 07437315 (ISSN)
  9. URL: https://www.sciencedirect.com.com/science/article/pii/S0743731507000627