In this paper, we present a leader election protocol in the population protocol model that
stabilizes within O (log n) parallel time in expectation with O (log n) states per agent, where n …

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 this article, we present the first leader election protocol in the population protocol model
that stabilizes within O (logn) parallel time in expectation with O (logn) states per agent …

Abstract At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new and
simple randomized signature-free binary consensus algorithm (denoted here as MMR) that …

This paper shows that every leader election protocol requires logarithmic stabilization time
both in expectation and with high probability in the population protocol model. This lower …

We consider the leader election problem in population protocol models. In pragmatic
settings of population protocols, self-stabilization is a highly desired feature owing to its fault …

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 …

Numerous distributed applications, such as cloud computing and distributed ledgers,
necessitate the system to invoke asynchronous consensus objects for an unbounded …

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 …

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 …