Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols

09/23/2020
by   Daisuke Yokota, et al.
0

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 protocol elects a unique leader within O(nN) expected steps starting from any configuration and uses O(N) states. This convergence time is optimal if a given upper bound N is asymptotically tight, i.e., N=O(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2018

Fast Approximate Counting and Leader Election in Populations

We study the problems of leader election and population size counting fo...
research
05/25/2022

Near-Optimal Leader Election in Population Protocols on Graphs

In the stochastic population protocol model, we are given a connected gr...
research
07/13/2019

Efficient self-stabilizing leader election in population protocols

We consider the standard population protocol model, where (a priori) ind...
research
09/18/2022

Probabilistic Population Protocol Models

Population protocols are a relatively novel computational model in which...
research
03/17/2020

The Power of Global Knowledge on Self-stabilizing Population Protocols

In the population protocol model, many problems cannot be solved in a se...
research
11/21/2021

New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive)

We consider the model of population protocols permitting presence of dyn...
research
05/20/2020

Time-optimal Loosely-stabilizing Leader Election in Population Protocols

We consider the leader election problem in population protocol models. I...

Please sign up or login with your details

Forgot password? Click here to reset