Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Mobile Agents and Security
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
A Framework to Protect Mobile Agents by Using Reference States
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Searching for a black hole in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Hardness and approximation results for black hole search in arbitrary graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximation bounds for black hole search problems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Locating and Repairing Faults in a Network with Mobile Agents
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
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
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A probabilistic model for distributed merging of mobile agents
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Locating a black hole in an un-oriented ring using tokens: the case of scattered agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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 consider a fixed communication network where (software) agents can move freely from node to node along the edges. A black hole is a faulty or malicious node in the network such that if an agent enters this node, then it immediately “dies.” We are interested in designing an efficient communication algorithm for the agents to identify all black holes. We assume that we have k agents starting from the same node s and knowing the topology of the whole network. The agents move through the network in synchronous steps and can communicate only when they meet in a node. At the end of the exploration of the network, at least one agent must survive and must know the exact locations of the black holes. If the network has n nodes and b black holes, then any exploration algorithm needs Ω(n/k + Db) steps in the worst-case, where Db is the worst case diameter of the network with at most b nodes deleted. We give a general algorithm which completes exploration in O((n/k)logn/loglogn + bDb) steps for arbitrary networks, if b≤k/2. In the case when b≤k/2, and , we give a refined algorithm which completes exploration in asymptotically optimal O(n/k) steps.