Computing with mobile agents in distributed networks

Handbook of Parallel Computing: Models, Algorithms and Applications

Volumn , Issue , 2007, Pages 8-1-8-20

  Kranakis, Evangelos ^a   Krizanc, Danny ^b   Rajsbaum, Sergio ^c  

^a CARLETON UNIVERSITY   (Canada)

^b WESLEYAN UNIVERSITY   (United States)

^c UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976628048     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420011296     Document Type: Chapter

References (57)

1. Awerbuch, B., Betke, M., Rivest, R., and Singh, M. Piecemeal graph learning by a mobile robot. In Proceedings of the 8th Conference on Computting Learning Theory, pp. 321–328, 1995.
2. Alpern, S. and Gal, S. The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Norwell, MA, 2003.
3. Albers, S. and Henzinger, M. R. Exploring unknown environments. SIAM Journal on Computing, 29: 1164–1188, 2000.
4. Alpern, S. The rendezvous search problem. SIAM Journal of Control and Optimization, 33:673–683, 1995.
5. Alpern, S. The rendezvous search problem. SIAM Journal of Control and Optimization, 33:673–683, 1995. Earlier version: LSE CDAM Research Report, 53, 1993.
6. Alpern, S. Rendezvous search: A personal perspective. Operations Research, 50:772–795, 2002.
7. Anderson, E. J. and Weber, R. R. The rendezvous problem on discrete locations. Journal of Applied Probability, 28:839–851, 1990.
8. Barriere, L., Flocchini, P., Fraigniaud, P., and Santoro, N. Election and rendezvous of anonymous mobile agents in anonymous networkswith sense of direction. In Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 17–32, 2003.
9. Bender, M. A., Fernandez, A., Ron, D., Sahai, A., and Vadhan, S. The power of a pebble: Exploring and mapping directed graphs. In Proc. 30th Ann. Symp. on Theory of Computing, pp. 269–278, 1998.
10. Baston, V. and Gal, S. Rendezvous search when marks are left at the starting points. Naval Research Logistics, 47:722–731, 2001.
11. Bradshaw, J. Software Agents. MIT Press, Cambridge, MA, 1997.
12. Betke, M., Rivest, R., and Singh, M. Piecemeal learning of an unknown environment. Machine Learning, 18:231–254, 1995.
13. Bender, M. A. and Slonim, D. The power of team exploration: Two robots can learn unlabeled directed graphs. In Proc. 35th Ann. Symp. on Foundations of Computer Science, pp. 75–85, 1994.
14. Diks, K., Fraigniaud, P., Kranakis, E., and Pelc, A. Tree exploration with little memory. Journal of Algorithms, 51:38–63, 2004.
15. Dessmark, A., Fraigniaud, P., and Pelc, A. Deterministic rendezvous in graphs. In 11th Annual European Symposium on Algorithms (ESA), pp. 184–195, 2003.
16. Dobrev, S., Flocchini, P., Prencipe, G., and Santoro, N. Mobile search for a black hole in an anonymous ring. In DISC: International Symposium on Distributed Computing. Springer- Verlag Lecture Notes in Computer Science, 2001.
17. Dobrev, Flocchini, Prencipe, and Santoro. Searching for a black hole in arbitrary networks: Optimal mobile agent protocols. In PODC: 21th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2002.
18. Dobrev, S., Flocchini, P., Prencipe, G., and Santoro, N. Multiple agents rendezvous in a ring in spite of a black hole. In Symposium on Principles of Distributed Systems (OPODIS ’03), pp. 34–46, 2004. Springer-Verlag Lecture Notes in Computer Science.
19. Duncan, C. A., Kobourov, S. G., and Kumar, V. S. A. Optimal constrained graph exploration. In Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 807–814, 2001.
20. Deng, X. and Papadimitriou, C. H. Exploring an unknown graph. Journal of Graph Theory, 32:265–297, 1999.
21. Dyer, D. 2005. PhD Thesis, Simon Fraser University, Burnaby B. C., Canada.
22. Fomin, F. V., Fraigniaud, P., and Thilikos, D. M. The price of connectedness in expansions. Technical Report LSI-04-28-R, Departament de Llenguatges i Sistemes Informaticas, Universitat Politecnica de Catalunya, Barcelona, Spain, 2004.
23. Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F., Santoro, N., and Sawchuk, C. Mobile agent rendezvous when tokens fail. In Proceedings of 11th Sirocco, 2004. Springer-Verlag Lecture Notes in Computer Science.
24. Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., and Sawchuk, C. Multiple mobile agent rendezvous in the ring. In LATIN, pp. 599–608, 2004. Springer-Verlag Lecture Notes in Computer Science.
25. Flocchini, P., Mans, B., and Santoro, N. Sense of direction: definition, properties and classes. Networks, 32:29–53, 1998.
26. Gasieniec, L., Kranakis, E., Krizanc, D., and Zhang, X. Optimal memory rendezvous of anonymous mobile agents in a uni-directional ring. In Proceedings of SOFSEM 2006, 32nd International Conference on Current Trends in Theory and Practice of Computer Science, 2006. January 21–27, 2006 Merin, Czech Republic, to appear.
27. Hanusse, N., Kavvadias, D., Kranakis, E., and Krizanc, D. Memoryless search algorithms in a network with faulty advice. In IFIP International Conference on Theoretical Computer Science, pp. 206–216, 2002.
28. Kranakis, E. and Krizanc, D. Searching with uncertainty. In Proceedings of SIROCCO’99, pages 194–203, 1999. Gavoille, C., Bermond, J. -C., and Raspaud, A. eds., Carleton Scientific.
29. Kaporis, A., Kirousis, L. M., Kranakis, E., Krizanc, D., Stamatiou, Y., and Stavropulos, E. Locating information with uncertainty in fully interconnected networks with applications to world wide web retrieval. Computer Journal, 44:221–229, 2001.
30. Kirousis, L. M., Kranakis, E., Krizanc, D., and Stamatiou, Y. Locating information with uncertainty in fully interconnected networks: The case of non-distributed memory. Networks, 42:169–180, 2003.
31. Kranakis, E., Krizanc, D., and Markou, E. Mobile agent rendezvous in a synchronous torus. In Proceedings of LATIN 2006, March 20–24, Valdivia, Chile, 2006. Springer-Verlag Lecture Notes in Computer Science.
32. Kranakis, E., Krizanc, D., Santoro, N., and Sawchuk, C. Mobile agent rendezvous search problem in the ring. In InternationalConference onDistributedComputing Systems (ICDCS), pp. 592–599, 2003.
33. Kowalski, D. and Malinowski, A. How to meet in an anonymous network. In Proceedings of the 13th Sirocco, 2006. Springer-Verlag Lecture Notes in Computer Science.
34. Kowalski, D. and Pelc, A. Polynomial deterministic rendezvous in arbitrary graphs. In Proceedings of the 15th ISAAC, 2004. Springer-Verlag Lecture Notes in Computer Science.
35. Lapaugh, A. Recontamination does not help to search a graph. Journal of the ACM, 40:224–245, 1993.
36. DeMarco, G., L Gargano, Kranakis, E., Krizanc, D., Pelc, A., and Vacaro, U. Asynchronous deterministic rendezvous in graphs. In Proceedings of the 30th MFCS, pp. 271–282, 2005. Springer-Verlag Lecture Notes in Computer Science.
37. Megiddo, N., Hakimi, S., Garey, M., Johnson, D., and Papadimitriou, C. The complexity of searching a graph. Journal of the ACM, 35:18–44, 1988.
38. Morin, P. Personal Communication, 2006.
39. Motwani, R. and Raghavan, P. Randomized Algorithms. Cambridge University Press, New York, 1995.
40. Nwana, H. S. and Ndumu, D. T. An introduction to agent technology. In Software Agents and Soft Computing, pp. 3–26, 1997.
41. Osborne, M. J. and Rubinstein, A. A Course in Game Theory. MIT Press, Cambridge, MA, 1994.
42. Peleg, D. Distributed Computing: A Locality Sensitive Approach. SIAM Monographs in Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, 2000.
43. Panaite, P. and Pelc, A. Exploring unknown undirected graphs. Journal of Algorithms, 33:281–295, 1999.
44. Roy, N. and Dudek, G. Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations. Autonomous Robots, 11:117–136, 2001.
45. Rao, N. S. V., Hareti, S., Shi, W., and Iyengar, S. S. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical report, Oak Ridge National Laboratory, 1993. Tech. Report ORNL/TM-12410.
46. Sandholm, T. W. Distributed rational decision making. In Weiss, G. ed., Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pp. 201–258. MIT Press, Cambridge, MA, 1999.
47. Sawchuk, C. Mobile Agent Rendezvous in the Ring. PhD thesis, Carleton University, School of Computer Science, Ottawa, Canada, 2004.
48. Yoav Shoham. An overview of agent-oriented programming. In Bradshaw, J. M. ed., Software Agents, chapter 13, pp. 271–290. AAAI Press/The MIT Press, 1997.
49. Schelderup, K. and J. Ølnes, Mobile agent security—issues and directions. In 6th International Conference on Intelligence and Services in Networks, volume 1597, pp. 155–167, 1999. Springer-Verlag Lecture Notes in Computer Science.
50. Sander, T. and Tschudin, C. F. Protecting mobile agents against malicious hosts. In Mobile Agents and Security, pp. 44–60, 1998.
51. Tel, G. Distributed control algorithms for ai. In Weiss, G., ed., Multiagent Systems: AModern Approach toDistributedArtificial Intelligence, p. 539–580. MIT Press, Cambridge, MA, 1999.
52. von Neumann, J. and Morgenstern, G. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ, 1953.
53. Watson, J. Strategy: An Introduction to Game Theory. W. W. Norton and Company, New York, NY, 2002.
54. Wooldridge, M. Intelligent agents. In Weiss, G. ed., Multiagent Systems: AModern Approach to Distributed Artificial Intelligence, pp. 27–77. MIT Press, Cambridge, MA, 1999.
55. Wooldridge, M. An Introduction to MultiAgent Systems. Wiley, Hoboken, NJ, 2002.
56. JXTA web site. http://www.jxta.org/. Accessed Jan 22, 2006.
57. Yu, X. and Yung, M. Agent rendezvous: A dynamic symmetry-breaking problem. In Proceedings of ICALP ’96, pp. 610–621, 1996.