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 …

This paper considers the fundamental problem of self-stabilizing leader election (SSLE) in
the model of population protocols. In this model, an unknown number of asynchronous …

We consider the standard population protocol model, where (a priori) indistinguishable and
anonymous agents interact in pairs according to uniformly random scheduling. The self …

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 …

The computational model of population protocols is a formalism that allows the analysis of
properties emerging from simple and pairwise interactions among a very large number of …

We consider the leader election problem in the population protocol model, which Angluin et
al. proposed in 2004. A self-stabilizing leader election is impossible for complete graphs …

A novel concept of the same speed timer is presented, and is applied in the population
protocol (PP) model to improve the convergence time of existing loosely-stabilizing leader …

In the population protocol model Angluin et al. proposed in 2004, there exists no self-
stabilizing protocol that solves leader election on complete graphs without knowing the …

Population protocols provide a distributed computing model in which a set of finite-state
identical agents cooperate through random interactions, between neighbors in the …

We investigate leader election problem via ranking within self-stabilising population
protocols. In this scenario, the agent's state space comprises $ n $ rank states and $ x …