A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
In this paper we consider a dangerous process located at a node of a network (called Black Hole ) and a team of mobile agents deployed to locate that node. The nature of the danger is such that when an agent enters the dangerous node, it is trapped there leaving no trace of its destruction. The goal is to deploy as few agents as possible and to locate the black hole in as few moves as possible. We present a simple algorithm that works on any topology (a-priori known by the agents). Our
doi:10.1109/icdcs.2006.25
dblp:conf/icdcs/DobrevFS06
fatcat:on7m6jvthfh3zcjmro5jshpise