Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2013

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs

Abstract

This paper considers the fundamental problem of \emph{self-stabilizing leader election} ($\mathcal{SSLE}$) in the model of \emph{population protocols}. In this model, an unknown number of asynchronous, anonymous and finite state mobile agents interact in pairs over a given communication graph. $\mathcal{SSLE}$ has been shown to be impossible in the original model. This impossibility can been circumvented by a modular technique augmenting the system with an \emph{oracle} - an external module abstracting the added assumption about the system. Fischer and Jiang have proposed solutions to $\mathcal{SSLE}$, for complete communication graphs and rings, using an oracle $\Omega?$, called the \emph{eventual leader detector}. In this work, we present a solution for arbitrary graphs, using a \emph{composition} of two copies of $\Omega?$. We also prove that the difficulty comes from the requirement of self-stabilization, by giving a solution without oracle for arbitrary graphs, when an uniform initialization is allowed. Finally, we prove that there is no self-stabilizing \emph{implementation} of $\Omega?$ using $\mathcal{SSLE}$, in a sense we define precisely.
Fichier principal
Vignette du fichier
leader_election.pdf (401.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00867287 , version 1 (28-09-2013)
hal-00867287 , version 2 (30-09-2013)

Identifiers

  • HAL Id : hal-00867287 , version 2

Cite

Joffroy Beauquier, Peva Blanchard, Janna Burman. Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. 2013. ⟨hal-00867287v2⟩
488 View
451 Download

Share

Gmail Facebook X LinkedIn More