Distributed leader election and computation of local identifiers for programmable matter

Abstract : 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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01848911
Contributeur : Nicolas Gastineau <>
Soumis le : mercredi 25 juillet 2018 - 12:42:05
Dernière modification le : samedi 28 juillet 2018 - 01:12:20

Fichiers

halpm.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01848911, version 1
  • ARXIV : 1807.10461

Citation

Nicolas Gastineau, Wahabou Abdou, Nader Mbarek, Olivier Togni. Distributed leader election and computation of local identifiers for programmable matter. 2018. 〈hal-01848911〉

Partager

Métriques

Consultations de la notice

25

Téléchargements de fichiers

6