Map construction and exploration by mobile agents scattered in a dangerous network

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Flocchini, Paola ^a   Kelletty, Matthew ^b   Masony, Peter ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b DEFENCE RESEARCH AND DEVELOPMENT CANADA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPH; CONSTRUCTION PROBLEM; DETERMINISTIC ALGORITHMS; MOBILE COMPUTATIONS; NODES AND LINKS; SPANNING TREE; TOTAL COSTS;

DISTRIBUTED PARAMETER NETWORKS; MOBILE AGENTS; WIRELESS NETWORKS;

GRAPH THEORY;

EID: 70450091094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161080     Document Type: Conference Paper

References (26)

1. I. Averbakh and O. Berman, "A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree," Discrete Applied Mathematics, vol. 68, no. 1-2, pp. 17-32, June 1996.
2. M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. Vadhan, "The power of a pebble: Exploring and mapping directed graphs," in STOC '98: Proceedings of the 30th ACM symposium on Theory of computing. New York, NY, USA: ACM, 1998, pp. 269-278.
3. M. A. Bender and D. K. Slonim, "The power of team exploration: Two robots can learn unlabeled directed graphs," in FOCS 1994: Proceedings of the 35th Symposium on Foundations of Computer Science, November 1994, pp. 75-85.
4. M. Blum and D. Kozen, "On the power of the compass (or, Why mazes are easier to search than graphs)," in FOCS 1978: Proceedings of the 19th Annual Symposium on Foundations of Computer Science. IEEE, October 1978, pp. 132-142.
5. J. Chalopin, S. Das, and N. Santoro, "Rendezvous of mobile agents in unknown graphs with faulty links," in DISC 2007, ser. LNCS, vol. 4731. Springer, 2007, pp. 108-122.
6. C. Cooper, R. Klasing, and T. Radzik, "Searching for black-hole faults in a network using multiple agents," in OPODIS 2006, ser. LNCS, vol. 4305. Springer, 2006, pp. 320-332.
7. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc, "Complexity of searching for a black hole," Fundamenta Informaticae, vol. 71, no. 2,3, pp. 229-242, 2006.
8. -, "Searching for a black hole in synchronous tree networks," Combinatorics, Probability and Computing, vol. 16, no. 4, pp. 595-619, July 2007.
9. S. Das, P. Flocchini, A. Nayak, and N. Santoro, "Distributed exploration of an unknown graph," in SIROCCO 2005, ser. LNCS, vol. 3499. Springer, 2005, pp. 99-114.
10. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, "Tree exploration with little memory," Journal of Algorithms, vol. 51, no. 1, pp. 38-63, April 2004.
11. S. Dobrev, P. Flocchini, R. Kralovic, P. Ruzicka, G. Prencipe, and N. Santoro, "Black hole search in common interconnection networks," Networks, vol. 47, no. 2, pp. 61-71, March 2006.
12. S. Dobrev, P. Flocchini, R. Kralovic, and N. Santoro, "Exploring an unknown graph to locate a black hole using tokens," in TCS 2006, ser. IFIP International Federation for Information Processing, vol. 209. Springer, December 2006, pp. 131-150.
13. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, "Multiple agents rendezvous in a ring in spite of a black hole," in OPODIS 2003, ser. LNCS, vol. 3144. Springer, 2003, pp. 34-46.
14. -, "Searching for a black hole in arbitrary networks: Optimal mobile agents protocols," Distributed Computing, vol. 19, no. 1, pp. 1-19, September 2006.
15. -, "Mobile search for a black hole in an anonymous ring," Algorithmica, vol. 48, no. 1, pp. 67-90, June 2007.
16. S. Dobrev, P. Flocchini, and N. Santoro, "Improved bounds for optimal black hole search with a network map," in SIROCCO 2004, ser. LNCS, vol. 3104. Springer, 2004, pp. 111-122.
17. -, "Cycling through a dangerous network: A simple efficient strategy for black hole search," in ICDCS 2006. IEEE, 2006, pp. 1-8.
18. S. Dobrev, R. Kralovic, N. Santoro, and W. Shi, "Black hole search in asynchronous rings using tokens," in CIAC 2006, ser. LNCS, vol. 3998. Springer, 2006, pp. 139-150.
19. S. Dobrev, N. Santoro, and W. Shi, "Scattered Black Hole Search in an Ring using Tokens," Int. journal of foundations of computer science, 2007, to appear. Preliminary version in IPDPS 2007.
20. P. Fraigniaud, L. Gasieniec, D. R. Kowalski, and A. Pelc, "Collective tree exploration," Networks, vol. 48, no. 3, pp. 166-177, October 2006.
21. P. Fraigniaud and D. Ilcinkas, "Digraphs exploration with little memory," in STACS 2004, ser. LNCS, vol. 2996. Springer Berlin / Heidelberg, 2004, pp. 246-257.
22. G. N. Frederickson, M. S. Hecht, and C. E. Kim, "Approximation algorithms for some routing problems," SIAM Journal on Computing, vol. 7, no. 2, pp. 178-193, 1978. [Online]. Available: http://link.aip.org/link/ ?SMJ/7/178/1
23. R. Klasing, E. Markou, T. Radzik, and F. Sarracco, "Approximation bounds for black hole search problems," in OPODIS, ser. LNCS, vol. 3974. Springer, 2005, pp. 261-274.
24. -, "Hardness and approximation results for black hole search in arbitrary networks," Theoretical Computer Science, vol. 384, no. 2-3, pp. 201-221, October 2007.
25. D. Kozen, "Automata and planar graphs," in FCT 1979: Proceedings of the Conference on the Fundamentals of Computation Theory, 1979, pp. 243-254.
26. P. Panaite and A. Pelc, "Exploring unknown undirected graphs," Journal of Algorithms, vol. 33, no. 2, pp. 281-295, November 1999.