Complexity of Searching for a Black Hole
Fundamenta Informaticae
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Map construction and exploration by mobile agents scattered in a dangerous network
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Black Hole Search with Tokens in Interconnected Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Synchronization Helps Robots to Detect Black Holes in Directed Graphs
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
Asynchronous exploration of an unknown anonymous dangerous graph with o(1) pebbles
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Fault-Tolerant exploration of an unknown dangerous graph by scattered agents
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Searching for a black hole in interconnected networks using mobile agents and tokens
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole destroys all mobile agents visiting that node without leaving any trace. Unlike most previous research on the black hole search problem which employed a colocated team of agents, we consider the more challenging scenario when the agents are identical and initially scattered within the network. Moreover, we solve the problem with agents that have constant-sized memory and carry a constant number of identical tokens, which can be placed at nodes of the network. In contrast, the only known solutions for the case of scattered agents searching for a black hole, use stronger models where the agents have non-constant memory, can write messages in whiteboards located at nodes or are allowed to mark both the edges and nodes of the network with tokens. We are interested in the minimum resources (number of agents and tokens) necessary for locating all links incident to the black hole. In fact, we provide matching lower and upper bounds for the number of agents and the number of tokens required for deterministic solutions to the black hole search problem, in oriented or unoriented rings, using movable or unmovable tokens.