Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Locating and Repairing Faults in a Network with Mobile Agents
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Graph Decomposition for Improving Memoryless Periodic Exploration
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Locating a Black Hole without the Knowledge of Incoming Link
Algorithmic Aspects of Wireless Sensor Networks
Searching for a black hole in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Synchronous black hole search in directed graphs
Theoretical Computer Science
Tight bounds for scattered black hole search in a ring
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Improving the optimal bounds for black hole search in rings
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.00 |
The paper considers a team of robots which has to explore a graph G where some nodes can be harmful. Robots are initially located at the so called home base node. The dangerous nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that the minimum number of robots is wasted. The exploration ends if there is at least one surviving robot which knows all the edges leading to the black holes. As many variations of the problem have been considered so far, the solution and its measure heavily depend on the initial knowledge and the capabilities of the robots. In this paper, we assume that G is a directed graph, the robots are associated with unique identifiers, they know the number of nodes n of G (or at least an upper bound on n ), and they know the number of edges Δ leading to the black holes. Each node is associated with a white board where robots can read and write information in a mutual exclusive way. A recently posed question [Czyzowicz et al., Proc. SIROCCO'09 ] is whether some number of robots, expressed as a function of parameter Δ only, is sufficient to detect black holes in directed graphs of arbitrarily large order n . We give a positive answer to this question for the synchronous case, i.e., when the robots share a common clock, showing that O (Δ·2Δ) robots are sufficient to solve the problem. This bound is nearly tight, since it is known that at least 2Δ robots are required for some instances. Quite surprisingly, we also show that unlike in the case of undirected graphs, for the directed version of the problem, synchronization can sometimes make a difference: for Δ= 1, 2 robots are always sufficient and sometimes required to explore the graph regardless of whether synchronization is present; however, for Δ= 2, in the synchronous case 4 robots are always sufficient, whereas in the asynchronous case at least 5 robots are sometimes required.