Improved bounds for optimal black hole search with a network map

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3104, Issue , 2004, Pages 111-122

  Dobrev, Stefan ^a   Flocchini, Paola ^a   Santoro, Nicola ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Distributed Algorithms; Distributed Computing; Harmful Host; Mobile Agents; Size and Cost Optimal Protocols; Undetectable Failure

Indexed keywords

COMPLEX NETWORKS; COSTS; DISTRIBUTED COMPUTER SYSTEMS; GRAVITATION; OPTIMIZATION; PARALLEL ALGORITHMS; SOFTWARE AGENTS; STARS;

BLACK HOLE SEARCH; HARMFUL HOST; NETWORK MAPS; OPTIMAL COSTS; OPTIMAL PROTOCOLS; OPTIMAL SIZE; REGULAR NETWORKS; UNIVERSAL SOLUTIONS;

MOBILE AGENTS;

EID: 35048819550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27796-5_11     Document Type: Article

References (16)

1. S. Alpern. The Rendezvous search problem. SIAM J. of Control and Optimization 33, 673-683, 1995.
2. E. Arkin, M. Bender, S. Fekete, and J. Mitchell. The freeze-tag problem: how to wake up a swarm of robots. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pages 568-577, 2002.
3. B. Awerbuch, M. Betke, and M. Singh. Piecemeal graph learning by a mobile robot. Information and Computation 152, 155-172, 1999.
4. L. Barrière, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In 14th ACM-SIAM Symp. on Parallel Algorithms and Architectures (SPAA '02), 200-209, 2002.
5. L. Barrière, P. Flocchini, P. Fraigniaud, and N. Santoro. Election and rendezvous in fully anonymous systems with sense of direction. In 10th Colloquium on Structural Information and Communication complexity (SIROCCO '03), 17-32, 2003.
6. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. J. of Graph Theory, 32:265-297, 1999.
7. A. Dessmark, P. Fraigniaud and A. Pelc. Deterministic rendezvous in graphs. In 11th European Symposium on Algorithms (ESA '03) 2003.
8. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc. Tree exploration with little memory. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), 588-597, 2002.
9. S. Dobrev, P. Flocchini, R. Král'ovič, G. Prencipe, P. Ružička, and N. Santoro. Optimal search for a black hole in common interconnection networks. In Proc. of Symposium on Principles of Distributed Systems (OPODIS'02), 2002.
10. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile agents searching for a black hole in an anonymous ring. In Proc. of 15th Int. Symp. on Distributed Computing (DISC'01), 166-179, 2001.
11. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: Optimal mobile agent protocols. In Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC'02), 153-162, 2002.
12. F. Hohl. A Model of attacks of malicious hosts against mobile agents. In ECOOP Workshop on Distributed Object Security and 4th Workshop on Mobile Object Systems, LNCS 1603, 105-120, 1998.
13. E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk. Mobile agent rendezvous in a ring. In 23rd International Conference on Distributed Computing Systems (ICDCS'03), 2003.
14. R. Oppliger. Security issues related to mobile code and agent-based systems. Computer Communications 22, 12, 1165-1170, 1999.
15. T. Sander and C. F. Tschudin. Protecting mobile agents against malicious hosts. In Conf on Mobile Agent Security, LNCS 1419, 44-60, 1998.
16. J. Vitek and G. Castagna. Mobile computations and hostile hosts. In D. Tsichritzis, editor, Mobile Objects, 241-261. University of Geneva, 1999.