Skip to Main content Skip to Navigation
Book sections

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.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01848911
Contributor : Nicolas Gastineau <>
Submitted on : Wednesday, July 25, 2018 - 12:42:05 PM
Last modification on : Monday, March 30, 2020 - 8:41:50 AM
Document(s) archivé(s) le : Friday, October 26, 2018 - 1:47:02 PM

Files

halpm.pdf
Files produced by the author(s)

Identifiers

  • 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. Algorithms for Sensor Systems, 11410, Springer Nature, pp.159-179, 2019, Lecture Notes in Computer Science, 978-3-030-14094-6. ⟨hal-01848911⟩

Share

Metrics

Record views

159

Files downloads

266