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

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.

[1]  Nicola Santoro,et al.  Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens , 2008, DISC.

[2]  Nicola Santoro,et al.  Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles , 2011, Algorithmica.

[3]  Euripides Markou,et al.  Searching for a Black Hole in Synchronous Tree Networks , 2007, Comb. Probab. Comput..

[4]  Rastislav Kralovic,et al.  Periodic Data Retrieval Problem in Rings Containing a Malicious Host , 2010, SIROCCO.

[5]  Euripides Markou,et al.  Approximation Bounds for Black Hole Search Problems , 2005, OPODIS.

[6]  Wei Shi,et al.  Black Hole Search in Asynchronous Rings Using Tokens , 2006, CIAC.

[7]  Peter Glaus.  Locating a Black Hole without the Knowledge of Incoming Link , 2009, ALGOSENSORS.

[8]  Nicola Santoro,et al.  Improving the Optimal Bounds for Black Hole Search in Rings , 2011, SIROCCO.

[9]  Euripides Markou,et al.  Hardness and approximation results for Black Hole Search in arbitrary networks , 2007, Theor. Comput. Sci..

[10]  Nicola Santoro,et al.  Time Optimal Algorithms for Black Hole Search in Rings , 2010, Discret. Math. Algorithms Appl..

[11]  Peter C. Mason,et al.  Map construction and exploration by mobile agents scattered in a dangerous network , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[12]  Nicola Santoro,et al.  Improved Bounds for Optimal Black Hole Search with a Network Map , 2004, SIROCCO.

[13]  Jurek Czyzowicz,et al.  Black Hole Search in Directed Graphs , 2009, SIROCCO.

[14]  Euripides Markou,et al.  Tight Bounds for Scattered Black Hole Search in a Ring , 2011, SIROCCO.

[15]  Nicola Santoro,et al.  Searching for a black hole in arbitrary networks: optimal mobile agents protocols , 2006, Distributed Computing.

[16]  Colin Cooper,et al.  Searching for Black-Hole Faults in a Network Using Multiple Agents , 2006, OPODIS.

[17]  Colin Cooper,et al.  Locating and Repairing Faults in a Network with Mobile Agents , 2008, SIROCCO.

[18]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Alfredo Navarra,et al.  Synchronization Helps Robots to Detect Black Holes in Directed Graphs , 2009, OPODIS.

[20]  Wei Shi,et al.  Scattered Black Hole Search in an Oriented Ring using Tokens , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[21]  Euripides Markou,et al.  Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs , 2005, SIROCCO.

[22]  Wei Shi.  Black Hole Search with Tokens in Interconnected Networks , 2009, SSS.

[23]  Nicola Santoro,et al.  Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links , 2007, DISC.

[24]  Andrzej Pelc,et al.  Collective tree exploration , 2004, Networks.

[25]  Euripides Markou,et al.  Complexity of Searching for a Black Hole , 2006, Fundam. Informaticae.

[26]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[27]  Nicola Santoro,et al.  Exploring an Unknown Graph to Locate a Black Hole Using Tokens , 2006, IFIP TCS.

[28]  Nicola Santoro,et al.  Mobile Search for a Black Hole in an Anonymous Ring , 2007, Algorithmica.

[29]  Wei Shi,et al.  Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens , 2008, Int. J. Found. Comput. Sci..

[30]  Nicola Santoro,et al.  Black hole search in common interconnection networks , 2006 .