Exploring unknown undirected graphs
Journal of Algorithms
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
One Pebble Does Not Suffice to Search Plane Labyrinths
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Mobile Agent Security - Issues and Directions
IS&N '99 Proceedings of the 6th International Conference on Intelligence and Services in Networks: Paving the Way for an Open Service Market
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Mobile Agents and Security
Security Issues in Mobile Code Systems
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)
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Networks
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Label-guided graph exploration by a finite automaton
ACM Transactions on Algorithms (TALG)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Information and Computation
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Research note: Security issues related to mobile code and agent-based systems
Computer Communications
IEEE Communications Magazine
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
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
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
Hi-index | 0.00 |
In the problems of exploration of faulty graphs, a team of cooperating agents is considered moving in a network containing one or more nodes that can harm the agents. A most notable among these problems is the problem of black hole location, where the network contains one node that destroys any incoming agent, and the task of the agents is to determine the location of this node. The main complexity measure is the number of agents needed to solve the problem. In this paper we begin with a study of malicious hosts with more varied behavior. We study the problem of periodic data retrieval which is equivalent to periodic exploration in fault-free networks, and to black hole location in networks with one black hole. The main result of the paper states that, in case of rings, it is sufficient to protect the internal state of the agent (i.e. the malicious host cannot change or create the content of agent's memory), and the periodic data retrieval problem is solvable by a constant number of agents.