Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings
In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings. This problem requires that, for a given positive integer g, all the agents terminate in a configuration such that at least g agents or no agent exist at each node. While the previous work achieves move-optimal partial gathering using distinct IDs or knowledge of the number of agents, in this paper we aim to achieve this without such information. We consider deterministic and randomized cases. First, in the deterministic case, we show that unsolvable initial configurations exist. In addition, we propose an algorithm to solve the problem from any solvable initial configuration in O(gn) total number of moves, where n is the number of nodes. Next, in the randomized case, we propose an algorithm to solve the problem in O(gn) expected total number of moves from any initial configuration. Since agents require \(\varOmega (gn)\) total number of moves to solve the partial gathering problem, our algorithms can solve the problem in asymptotically optimal total number of moves without global knowledge.
KeywordsDistributed system Mobile agent Gathering problem Partial gathering
This work was partially supported by JSPS KAKENHI Grant Number 17K19977, 18K18000, 18K11167, 18K18031, and 19K11826, and Japan Science and Technology Agency (JST) SICORP.
- 3.Kranakis, E., Krozanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Synthesis Lectures on Distributed Computing Theory, vol. 1. Morgan & Claypool, San Rafael (2010)Google Scholar
- 4.Kranakis, E., Santoro, N., Sawchuk, C., Krizanc, D.: Mobile agent rendezvous in a ring. In: Proceedings of ICDCS, pp. 592–599 (2003)Google Scholar