Distributed leader election and computation of local identifiers for programmable matter - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2019

Distributed leader election and computation of local identifiers for programmable matter

Résumé

The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(1)-memory space.
Fichier principal
Vignette du fichier
halpm.pdf (305.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01848911 , version 1 (25-07-2018)

Identifiants

Citer

Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni. Distributed leader election and computation of local identifiers for programmable matter. Algorithms for Sensor Systems, 11410, Springer Nature, pp.159-179, 2019, Lecture Notes in Computer Science, 978-3-030-14094-6. ⟨hal-01848911⟩
82 Consultations
148 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More