Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Research note: Security issues related to mobile code and agent-based systems
Computer Communications
IEEE Communications Magazine
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Tight bounds for scattered black hole search in a ring
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Improving the optimal bounds for black hole search in rings
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Asynchronous exploration of an unknown anonymous dangerous graph with o(1) pebbles
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Fault-Tolerant exploration of an unknown dangerous graph by scattered agents
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Searching for a black hole in interconnected networks using mobile agents and tokens
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We study the Black Hole search problem using mobile agents in three interconnected network topologies: hypercube, torus and complete network. We do so without relying on local storage. Instead we use a less-demanding and less-expensive token mechanism. We demonstrate that the Black Hole can be located with a minimum of two (2) co-located agents performing ***(n ) moves with O (1) tokens, in each of these three topologies. Then we study the Black Hole search problem with scattered agents. We show that the optimal number of moves can be achieved with the optimal number of mobile agents using O (1) tokens.