Distributed Chasing of Network Intruders by Mobile Agents

This paper addresses the graph searching problem in a distributed setting.We describe a distributed protocol that enables searchers with logarithmic size memory to clear any network, in a fully decentralized manner. The search strategy for the network in which the searchers are launched is computed online by the searchers themselves without knowing the topology of the network in advance. It performs in an asynchronous environment, i.e., it implements the necessary synchronization mechanism in a decentralized manner. In every network, our protocol performs a connected strategy using at most k + 1 searchers, where k is the minimum number of searchers required to clear the network in a monotone connected way, computed in the centralized and synchronous setting.

[1]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[2]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[3]  Konstantin Skodinis.  Computing Optimal Linear Layouts of Trees in Linear Time , 2000, ESA.

[4]  Fillia Makedon,et al.  On minimizing width in linear layouts , 1989, Discret. Appl. Math..

[5]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[6]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[7]  Nicolas Nisse,et al.  Nondeterministic Graph Searching: From Pathwidth to Treewidth , 2005, Algorithmica.

[8]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[9]  Daniel Bienstock,et al.  Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey) , 1989, Reliability Of Computer And Communication Networks.

[10]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[11]  Lali Barrière,et al.  Searching Is Not Jumping , 2003, WG.

[12]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[13]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[14]  Lali Barrière,et al.  Capture of an intruder by mobile agents , 2002, SPAA '02.

[15]  Fedor V. Fomin,et al.  Exact algorithms for treewidth and minimum fill-in ∗ † , 2006 .

[16]  Boting Yang,et al.  Sweeping Graphs with Large Clique Number , 2004, ISAAC.