Optimal dispersion of silent robots in a ring

Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, we consider the dispersion problem for silent robots, i.e., no direct, explicit communication between any two robots. The robots are deployed on the nodes of an oriented n-node ring network. They operate in synchronous rounds. The dispersion problem for silent mobile robots has been studied in arbitrary graphs where the robots start from a single source. In this paper, we focus on the dispersion problem for silent mobile robots where robots can start from multiple sources. The robots have unique labels from a range [0, L] for some positive integer L. Any two co-located robots do not have the information about the label of the other robot. The robots have weak multiplicity detection capability, which means they can determine whether they are alone on a node. The robots are assumed to identify an increase or decrease in the number of robots present on a node in a particular round. However, the robots can not get the exact number of increase or decrease in the number of robots. We have proposed a deterministic distributed algorithm that solves the dispersion of k robots with knowledge of k and L in an oriented ring in O(logL+k) synchronous rounds with O(log L) bits of memory for each robot. A lower bound Ω(logL+k) on the time for dispersion of k robots on a ring network is presented to establish the optimality of the proposed algorithm.