Time optimal algorithms for black hole search in rings

  • Authors:

  • Balasingham Balamohan;Paola Flocchini;Ali Miri;Nicola Santoro

  • Affiliations:

  • University of Ottawa, Ottawa, Canada;University of Ottawa, Ottawa, Canada;Ryerson University, Toronto, Canada;Carleton University, Ottawa, Canada

  • Venue:
  • COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. The black-hole search problem is the task of a team of k 1 mobile entities, starting from the same safe location and executing the same algorithm, to determine within finite time the location of the black hole. In this paper we consider the black hole search problem in asynchronous ring networks of n nodes, and focus on the time complexity. It is known that any algorithm for black-hole search in a ring requires at least 2(n-2) time in the worst case. The best algorithm achieves this bound with a team of n - 1 agents with an average time cost 2(n - 2), equal to the worst case. In this paper we first show how the same number of agents using 2 extra time units from optimal in the worst case, can solve the problem in only 7/4n- O(1) time on the average. We then prove that the optimal average case complexity 3/2n - O(1) can be achieved without increasing the worst case using 2(n- 1) agents Finally we design an algorithm that achieves asymptotically optimal both worst case and average case time complexity employing an optimal team of k = 2 agents, thus improving on the earlier results that required O(n) agents.