Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings
The rendezvous problem of mobile agents is to make agents, which are initially distributed in a network, meet at a non-predefined location. The challenging issue is to design rendezvous algorithms which work in anonymous systems. Previous works such as [2,4,5] characterized its solvability with the symmetricity and periodicity of network topology and initial locations of agents. However, most existing works (except ) assume “static” networks, where its topology does not change during the execution.
Unable to display preview. Download preview PDF.