Capture Intruder by
Abstract: Harmful software agents, called intruders, can penetrate networked environments. Considering a team of mobile agents deployed to capture an intruder in a network, all agents, including the intruder move along the network links and the intruder could be arbitrarily fast. The problem is to design the agents’ strategy for capturing the intruder.
We are interested the contiguous search problem where at any time of the search strategy, the set of clean nodes forms a connected sub-network and a clean node cannot be re-contaminated. The main efficiency parameter of the strategy is measured in terms of the number of agents to be involved, number of moves the agents have to perform and steps. This problem is a NP-complete in general. We study for some topologies such as Mesh and Tree to find the optimal strategy for these specific graphs.