Tight bounds for black hole search with scattered agents in synchronous rings

Abstract : We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the network and destroying all mobile agents visiting that node without leaving any trace. Unlike most previous research on the black hole search problem which employed a co-located team of agents, we consider the more challenging scenario when the agents are identical and initially scattered within the network. Moreover, we solve the problem with agents that have constant-sized memory and carry a constant number of identical tokens, which can be placed at nodes of the network. In contrast, the only known solutions for the case of scattered agents searching for a black hole, use stronger models where the agents have non-constant memory, can write messages in whiteboards located at nodes or are allowed to mark both the edges and nodes of the network with tokens. This paper solves the problem for ring networks containing a single black hole. We are interested in the minimum resources (number of agents and tokens) necessary for locating all links incident to the black hole. We present deterministic algorithms for ring topologies and provide matching lower and upper bounds for the number of agents and the number of tokens required for deterministic solutions to the black hole search problem, in oriented or unoriented rings, using movable or unmovable tokens.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01195901
Contributor : Arnaud Labourel <>
Submitted on : Tuesday, September 8, 2015 - 4:15:37 PM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM

Links full text

Identifiers

Collections

Citation

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou. Tight bounds for black hole search with scattered agents in synchronous rings. Theoretical Computer Science, Elsevier, 2013, Structural Information and Communication Complexity, 509, pp.70-85. ⟨10.1016/j.tcs.2013.02.010⟩. ⟨hal-01195901⟩

Share

Metrics

Record views

110