Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro  Home/Search
Context Related
| lri.fr/~pierre/POSTSCRIPTS/SPAA02.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~pierre/...biblio_par_date (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider a team of mobile software agents deployed to capture a (possibly hostile) intruder in a network. All agents, including the intruder move along the network links; the intruder could be arbitrarily fast, and aware of the positions of all the agents. The problem is to design the agents' strategy for capturing the intruder. The main eciency parameter is the size of the team. This is an instance of the well known graph-searching problem whose many variants have been extensively studied in... (Update)
Context of citations to this paper: More
.... 11, 13, 22] It is also related to network security for its relation with the capture of an intruder by software agents (see, e.g. [1, 17, 35]) and protection from mobile eavesdroppers [16] Moreover, the problem and its variants, i.e. node search, mixed search, inert...
Cited by: More
Network Awareness for Mobile Agents on Ad Hoc Networks - Peysakhov, Artz, Sultanik.. (2004) (Correct)
The Price of Connectedness in Expansions - Fomin, Fraigniaud, Thilikos (Correct)
Robotic Cops: The Intruder Problem - Vincenzo Gervasi Dipartimento (Correct)
Active bibliography (related documents): More All
3.3: Contiguous and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (2002) (Correct)
3.2: Connected and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (Correct)
0.5: A Multiple Graph Layers Model with - Application To Rna (Correct)
Similar documents based on text: More All
0.6: Electing a Leader Among Anonymous Mobile Agents in .. - Barrière.. (2002) (Correct)
0.6: Can We Elect If We Cannot Compare? - Barrière, Flocchini.. (Correct)
0.6: Distributed Mobile Computing with Incomparable Labels - Barrière.. (Correct)
Related documents from co-citation: More All
3: Eavesdropping games: A graph-theoretic approach to privacy in distributed system.. - Franklin, Galil et al. - 1993
3: Monotonicity in graph searching (context) - Bienstock, Seymour - 1991
3: On Minimizing Width in Linear Layouts (context) - Makedon, Sudborough - 1989
BibTeX entry: (Update)
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. To appear in 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA '02), Winnipeg, August 10-13, 2002. http://citeseer.ist.psu.edu/barri02capture.html More
@inproceedings{ barriere02capture,
author = "L. Barri\`ere and P. Flocchini and P. Fraigniaud and N. Santoro",
title = "Capture of an intruder by mobile agents",
booktitle = "14th ACM Symp. on Parallel Algorithms and Architectures (SPAA '02),
Winnipeg, August 10-13, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/barri02capture.html" }
Citations (may not include all citations):62 The complexity of searching a graph (context) - Megiddo, Hakimi et al. - 1988
51 The vertex separation and search number of a graph - Ellis, Sudborough et al. - 1994
50 Searching for a mobile intruder in a polygonal region (context) - Suzuki, Yamashita - 1992
50 NetSTAT: A network based intrusion detection system - Vigna, Kemmerer - 1999
47 Recontamination does not help to search a graph (context) - Lapaugh - 1993
45 Monotonicity in graph searching (context) - Bienstock, Seymour - 1991
39 Minimizing width in linear layout (context) - Makedon, Sudborough - 1983
37 The vertex separation number of a graph equals its path-widt.. (context) - Kinnersley - 1992
32 Interval graphs and searching (context) - Kirousis, Papadimitriou - 1985
28 Intelligent agents for intrusion detection - Helmer, Wong et al. - 1998
27 Fugitive-search games on graphs and related parameters (context) - Dendris, Kirousis et al. - 1997
22 Black-white pebbles and graph separation (context) - Lengauer - 1981
22 Intrusion detection using autonomous agents (context) - Spa, Zamboni - 2000
20 Mixed searching and proper-path-width (context) - Takahashi, Ueno et al. - 1995
19 Algorithms and obstructions for linear-width and related sea.. - Thilikos - 2000
12 Mobile agents in intrusion detection and response - Jansen, Mell et al. - 2000
11 Computing optimal linear layouts of trees in linear time - Skodinis - 2000
8 Theoretical Computer Science (context) - Kirousis, Papadimitriou et al. - 1986
7 A method of tracing intruders by use of mobile agents - Asaka, Okazawa et al. - 1999
6 Graph searching and interval completion - Fomin, Golovach - 2000
6 decision and the eciency of polynomial time algorithm (context) - Fellows, Langton - 1989
5 Formalization of graph search algorithms and its application.. - Yamamoto, Takahashi et al. - 1998
5 An intuitive approach to speleotopology (context) - Breisch - 1967
5 and a min-max theorem for treewidth (context) - Seymour, Thomas
5 Algorithmic implications of the graph minor theorem (context) - Bienstock, Langston - 1995
4 Monotonicity and inert fugitive search games - Stamatiou, Thilikos - 1999
4 Bushiness and a tight worst-case upper bound on the search n.. (context) - Suzuki, Yamashita et al. - 1998
4 Mutual search - Buhrman, Franklin et al. - 1999
3 Information Processing Letters (context) - Neufeld, problem et al. - 1996
3 Intruder isolation and monitoring (context) - Hansen, Eldredge - 1988
3 DIMACS Series in Disc (context) - Bienstock, path-width et al. - 1991
3 Minimal trees of given search number (context) - Smith - 1987
2 Intrusion Detection with Mobile Agents (context) - Foukia, Hulaas et al. - 2001
2 Hierarchical graph search for mobile robot path planning (context) - Fernandez, Gonzalez - 1998
2 Distributed algorithms for nding centers and medians in netw.. (context) - Korach, Rotem et al. - 1984
1 Complexity of searching an immobile hider in a graph (context) - von Stengel, Werchner - 1996
1 Single step graph search problem (context) - Chang - 1991
1 The search number of a connected graph (context) - Parson - 1978
1 Lecture Notes in Mathematics (context) - Parson, graph et al. - 1976
Documents on the same site (http://www.lri.fr/~pierre/ma_biblio_par_date.html): More
A General Theory for Deadlock Avoidance in Wormhole-Routed.. - Fraigniaud (1998) (Correct)
Strategies for Path-Based Multicasting in Wormhole-Routed.. - Fleury, Fraigniaud (1997) (Correct)
Hierarchical Broadcast Networks - Fraigniaud (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC