Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2012-02-20
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. Leader Election is a fundamental symmetry breaking problem in distributed computing. Its goal is to assign value 1 (leader) to one of the entities and value 0 (non-leader) to all others. In this paper, assuming n > 1 disoriented anonymous sensors, we provide a complete charac- terization on the sensors positions to deterministically elect a leader, provided that all the sensors' positions are known by every sensor. More precisely, our contribution is twofold: First, assuming n anonymous sensors agreeing on a common handedness (chirality) of their own coordinate system, we provide a complete characterization on the sensors positions to deterministically elect a leader. Second, we also provide such a complete chararacterization for sensors devoided of a common handedness. Both characterizations rely on a particular object from combinatorics on words, namely the Lyndon Words.
Dieudonné Yoann
Levé Florence
Petit Franck
Villain Vincent
No associations
LandOfFree
Deterministic Leader Election Among Disoriented Anonymous Sensors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Deterministic Leader Election Among Disoriented Anonymous Sensors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Leader Election Among Disoriented Anonymous Sensors will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-422171