Improved Bounds for Optimal Black Hole Search with a Network Map

A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine the location of the black hole. A team of agents, provided with a network map and executing the same protocol, solves the problem if at least one agent survives and, within finite time, knows the location of the black hole.

[1]  Krzysztof Diks,et al.  Tree exploration with little memory , 2002, SODA.

[2]  S. Alpern.  The Rendezvous Search Problem , 1995 .

[3]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, ESA.

[4]  Mona Singh,et al.  Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..

[5]  Rolf Oppliger.  Security issues related to mobile code and agent-based systems , 1999, Comput. Commun..

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

[7]  Nicola Santoro,et al.  Searching for a black hole in arbitrary networks: optimal mobile agent protocols , 2002, PODC '02.

[8]  Jan Vitek,et al.  Mobile Computations and Hostile Hosts , 1999 .

[9]  Lali Barrière,et al.  Election and Rendezvous in Fully Anonymous Systems with Sense of Direction , 2003, Colloquium on Structural Information & Communication Complexity.

[10]  Nicola Santoro,et al.  Mobile agent rendezvous in a ring , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[11]  Fritz Hohl.  A Model of Attacks of Malicious Hosts Against Mobile Agents , 1998, ECOOP Workshops.

[12]  Christian F. Tschudin,et al.  Protecting Mobile Agents Against Malicious Hosts , 1998, Mobile Agents and Security.

[13]  Nicola Santoro,et al.  Mobile Search for a Black Hole in an Anonymous Ring , 2001, DISC.

[14]  J. C. Byington,et al.  Mobile agents and security , 1998, IEEE Commun. Mag..

[15]  Esther M. Arkin,et al.  The Freeze-Tag Problem: How to Wake Up a Swarm of Robots , 2002, SODA '02.

[16]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.