Locating a black hole in an un-oriented ring using tokens: The case of scattered agents

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Dobrev, S., Santoro, N., & Shi, W. (2007). Locating a black hole in an un-oriented ring using tokens: The case of scattered agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4641 LNCS, pp. 608–617). Springer Verlag. https://doi.org/10.1007/978-3-540-74466-5_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free