DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results

  • Andrzej Pelc
Conference paper

DOI: 10.1007/978-3-642-24100-0_1

Volume 6950 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Pelc A. (2011) DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg

Abstract

Two or more mobile entities, called agents or robots, starting at distinct initial positions in some environment, have to meet. This task is known in the literature as rendezvous. Among many alternative assumptions that have been used to study the rendezvous problem, two most significantly influence the methodology appropriate for its solution. The first of these assumptions concerns the environment in which the mobile entities navigate: it can be either a terrain in the plane, or a network modeled as an undirected graph. In the case of networks, methods and results further depend on whether the agents have the ability to mark nodes in some way. The second assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this paper we survey models and results concerning deterministic rendezvous in networks, where agents cannot mark nodes.

Keywords

mobile agent rendezvous deterministic network graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andrzej Pelc
    • 1
  1. 1.Département d’informatiqueUniversité du Québec en OutaouaisGatineauCanada