Deterministic Geoleader Election in Disoriented Anonymous Systems

Abstract : Consider a network made of n nodes scattered in the 2-dimensional space. Nodes are anonymous and disoriented devices being unable to communicate. Anonymous refers to systems made of {\em a priori} undistinguishable nodes. By disoriented, we mean that the nodes share no kind of coordinate system nor common sense of direction. Such systems are typically wireless sensor networks or swarms of robots endowed with localization capabilities, for instance visibility sensors or pattern formation maps. We address the Geoleader Election (GE) problem which is to ensure that, solely based on their positions, the nodes deterministically agree on the position of a single node, called the leader. We provide a complete characterization on the node positions, both for systems with common handedness (or chirality) and for systems devoid of a common handedness. The characterization is based on a particular object from combinatorics on words, namely the Lyndon Words.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2013, pp.43-54
Liste complète des métadonnées

https://hal.inria.fr/hal-00933915
Contributeur : Franck Petit <>
Soumis le : mardi 21 janvier 2014 - 12:13:08
Dernière modification le : mardi 17 avril 2018 - 11:48:04

Identifiants

  • HAL Id : hal-00933915, version 1

Collections

Citation

Yoann Dieudonné, Florence Levé, Franck Petit, Vincent Villain. Deterministic Geoleader Election in Disoriented Anonymous Systems. Theoretical Computer Science, Elsevier, 2013, pp.43-54. 〈hal-00933915〉

Partager

Métriques

Consultations de la notice

354