Name
Abstract | ||
|---|---|---|
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 [3]) assume "static" networks, where its topology does not change during the execution. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33536-5_10 | SSS |
Keywords | Field | DocType |
initial location,rendezvous algorithm,challenging issue,mobile agent rendezvous,brief announcement,existing work,network topology,anonymous system,previous work,mobile agent,non-predefined location,rendezvous problem | Computer science,Mobile agent,Network topology,Rendezvous,Rendezvous problem,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomoko Izumi | 1 | 141 | 21.33 |
| Yukiko Yamauchi | 2 | 196 | 23.91 |
| Sayaka Kamei | 3 | 186 | 21.28 |