A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the
population protocol model is presented in this paper. In the population protocol model …

In the population protocol model Angluin et al. 2006, it is impossible to design a self-
stabilizing leader election protocol without any knowledge of the exact number of nodes in …

We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the
population protocol model. Given a rough knowledge ψ=⌈ log n⌉+ O (1) on the population …

In the population protocol model, many problems cannot be solved in a self-stabilizing
manner. However, global knowledge, such as the number of nodes in a network, sometimes …

In the stochastic population protocol model, we are given a connected graph with n nodes,
and in every time step, a scheduler samples an edge of the graph uniformly at random and …

We propose a self-stabilizing leader election protocol on directed rings in the model of
population protocols. Given an upper bound N on the population size n, the proposed …

In this paper, we consider a uniform bipartition problem in a population protocol model. The
goal of the uniform bipartition problem is to divide a population into two groups of the same …

This paper addresses the collision detection problem in population protocols. The network
consists of state machines called agents. At each time step, exactly one pair of agents is …

In this paper, we consider a uniform k-partition problem in a population protocol model. The
uniform k-partition problem divides a population into k groups of the same size. For this …

The distributed naming problem, assigning unique names to the nodes in a distributed
system, is a fundamental task. This problem is nontrivial, especially when the amount of …