A public key cryptosystem based on Lyndon words
Information Processing Letters
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Distributed Algorithms
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Periodic musical sequences and Lyndon words
Soft Computing - A Fusion of Foundations, Methodologies and Applications
STAR: an algorithm to Search for Tandem Approximate Repeats
Bioinformatics
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Circle formation of weak robots and Lyndon words
Information Processing Letters
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Brief announcement: leader election vs pattern formation
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
| Hi-index | 0.00 |
We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. The contribution of this paper 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. Our result holds for any n 1, even if the n sensors have unlimited visibility and regardless of their capabilities, unbounded memory, mobility, and communication settings. Second, we show that this statement also holds assuming sensors without chirality provided that n is odd.