Black Hole Search in Asynchronous Rings Using Tokens
A black hole is a highly harmful host that disposes of visiting agents upon their arrival. It is known that it is possible for a team of mobile agents to locate a black hole in an asynchronous ring network if each node is equipped with a whiteboard of at least O(log n) dedicated bits of storage. In this paper, we consider the less powerful token model: each agent has has available a bounded number of tokens that can be carried, placed on a node or removed from it. All tokens are identical (i.e., indistinguishable) and no other form of communication or coordination is available to the agents. We first of all prove that a team of two agents is sufficient to locate the black hole in finite time even in this weaker coordination model. Furthermore, we prove that this can be accomplished using only O(n log n) moves in total, which is optimal, the same as with whiteboards. Finally, we show that to achieve this result the agents need to use only O(1) tokens each.
KeywordsBlack Hole Mobile Agent Work Assignment Asynchronous System Unexplored Region
Unable to display preview. Download preview PDF.
- 1.Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and rendezvous in fully anonymous systems with sense of direction. Theory of Computing Systems (to appear, 2006); Preliminary version in Proc. of SIROCCO 2003Google Scholar
- 4.Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Optimal search for a black hole in common interconnection networks. Networks (to appear, 2006); Preliminary version in Proc. of OPODIS 2002Google Scholar
- 5.Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica (to appear, 2006); Preliminary version in Proc. of DISC 2001Google Scholar
- 6.Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in a arbitrary networks: optimal mobile agent protocols. Distributed Computing (to appear, 2006); Preliminary version in Proc. of PODC 2002Google Scholar
- 7.Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search in a network with a map. In: Proc. of 10th International Colloquium on Structural Information and Communication Complexity, pp. 111–122 (2004)Google Scholar
- 8.Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. In: 6th Latin American Theoretical Informatics Symp., pp. 141–151 (2004)Google Scholar
- 9.Fraigniaud, P., Ilcinkas, D.: Digraph exploration with little memory. In: 21st Symp. on Theoretical Aspects of Computer Science, pp. 246–257 (2004)Google Scholar
- 11.Hohl, F.: A model of attacks of malicious hosts against mobile agents. In: Proc. of the ECOOP Workshop on Distributed Object Security and 4th Workshop on Mobile Object Systems. LNCS, vol. 1603, pp. 105–120. Springer, Heidelberg (1998)Google Scholar