Mobile Search for a Black Hole in an Anonymous Ring

In this paper we address the problem of mobile agents searching for a highly harmful item (called a black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon their arrival without leaving any observable trace of such a destruction. The task is to have at least one surviving agent able to unambiguously report the location of the black hole. We consider different scenarios and in each situation we answer some computational as well as complexity questions. We first consider agents that start from the same home base (co-located). We prove that two such agents are necessary and sufficient to locate the black hole; in our algorithm the agents perform O(n log n) moves (where n is the size of the ring) and we show that such a bound is optimal. We also consider time complexity and show how to achieve the optimal bound of 2n - 4 units of time using n - 1 agents. We generalize our technique to establish a trade-off between time and number of agents. We then consider the case of agents that start from different home bases (dispersed) and we show that if the ring is oriented, two dispersed agents are still necessary and sufficient. Also in this case our algorithm is optimal in terms of number of moves (Θ(n log n)). We finally show that if the ring is unoriented, three agents are necessary and sufficient; an optimal algorithm follows from the oriented case.

Authors and Affiliations

1. School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, K1N 6N5, Canada

   Stefan Dobrev & Paola Flocchini

2. Dipartimento di Informatica, Universita di Pisa, Pisa, 56100, Italy

   Giuseppe Prencipe

3. Department of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada

   Nicola Santoro

Corresponding authors

Correspondence to Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe or Nicola Santoro.

Reprints and permissions