Deterministic Geoleader Election in Disoriented Anonymous Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2013

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.

Dates and versions

hal-00933915 , version 1 (21-01-2014)

Identifiers

Cite

Yoann Dieudonné, Florence Levé, Franck Petit, Vincent Villain. Deterministic Geoleader Election in Disoriented Anonymous Systems. Theoretical Computer Science, 2013, 506, pp.43-54. ⟨10.1016/j.tcs.2013.07.033⟩. ⟨hal-00933915⟩
154 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More