Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
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
Hardness and approximation results for black hole search in arbitrary graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.00 |
Black hole search in a ring network has been studied in a token model. It is known that locating the black hole in an anonymous ring using tokens is feasible, if the team of agents is initially co-located. When dealing with the scattered agents, the problem was so far solved only when the orientation of the ring is known. In this paper, we prove that a black hole can be located in a ring using tokens with scattered agents, even if the ring is un-oriented. More precisely, first we prove that the black hole search problem can be solved using only three scattered agents. We then show that, with k (k ≥ 4) scattered agents, the black hole can be located fewer moves. Moreover, when k (k ≥ 4 ) is a constant number, the move cost can be made optimal. These results hold even if both agents and nodes are anonymous.