Structural Information and Communication Complexity

Two or more mobile entities, called agents or robots, starting at distinct initial positions, have to meet. This task is known in the literature as rendezvous and has many applications, both in everyday life and in computer science. 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. The second assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this talk we survey recent results on deterministic rendezvous in networks. Adversarial Models for Wireless Communication (Abstract of Keynote Lecture)