Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
The vertex separation number of a graph equals its path-width
Information Processing Letters
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Recontamination does not help to search a graph
Journal of the ACM (JACM)
A pursuit-evasion problem on a grid
Information Processing Letters
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Formalization of Graph Search Algorithms and Its Applications
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Mobile Agent Security - Issues and Directions
IS&N '99 Proceedings of the 6th International Conference on Intelligence and Services in Networks: Paving the Way for an Open Service Market
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Research note: Security issues related to mobile code and agent-based systems
Computer Communications
IEEE Communications Magazine
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.03 |
We consider the problem of decontaminating a network infected by a mobile virus. The goal is to perform the task using as small a team of antiviral agents, avoiding any recontamination of disinfected areas, and minimizing the amount of agents' movements across the network. In all the existing literature, it is assumed that the immunity level of a disinfected site is nil. In this paper we consider the network decontamination problem under a new model of immunity to recontamination: we consider the case when a disinfected vertex, after the cleaning agent has gone, will become recontaminated only if a weak majority of its neighbours are infected. We study the effects of this level of immunity on the number of antiviral agents necessary to decontaminate the entire network. We focus on tori and on trees, and establish lower-bounds on the team size; we also establish lower bounds on the number of moves performed by an optimal-size time of cleaners. We design and present strategies for disinfecting tori and trees; we prove that these strategies are optimal in terms of both team size and number of moves. In particular, the upper and lower bounds are are tight for tree networks and for synchronous tori; the bounds are within a constant factor of each other in the case of asynchronous tori.