Capturing an intruder in product networks |
| |
Authors: | N Imani H Sarbazi-Azad AY Zomaya |
| |
Affiliation: | 1. School of Computer Science, IPM, Tehran, Iran;2. Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;3. School of Information Technologies, The University of Sydney, Sydney, Australia |
| |
Abstract: | 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. |
| |
Keywords: | Graph search Intruder capturing Cartesian product networks |
本文献已被 ScienceDirect 等数据库收录! |
|