Black hole search with finite automata scattered in a synchronous torus

  • Authors:

  • Jérémie Chalopin;Shantanu Das;Arnaud Labourel;Euripides Markou

  • Affiliations:

  • LIF, Aix-Marseille University, Marseille, France;LIF, Aix-Marseille University, Marseille, France;LIF, Aix-Marseille University, Marseille, France;Department of Computer Science and Biomedical Informatics, University of Central Greece, Lamia, Greece

  • Venue:
  • DISC'11 Proceedings of the 25th international conference on Distributed computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any trace. The objective is to locate the black hole without destroying too many agents. This is difficult to achieve when the agents are initially scattered in the network and are unaware of the location of each other. In contrast to previous results, we solve the problem using a small team of finite-state agents each carrying a constant number of identical tokens that could be placed on the nodes of the network. Thus, all resources used in our algorithms are independent of the network size. We restrict our attention to oriented torus networks and first show that no finite team of finite state agents can solve the problem in such networks, when the tokens are not movable, i.e., they cannot be moved by the agents once they have been released on a node. In case the agents are equipped with movable tokens, we determine lower bounds on the number of agents and tokens required for solving the problem in torus networks of arbitrary size. Further, we present a deterministic solution to the black hole search problem for oriented torus networks, using the minimum number of agents and tokens, thus providing matching upper bounds for the problem.