Abstract
We consider the leader election problem in the geometric Amoebot model in which nodes have no unique identifiers and only share a common local sense of direction. Unlike other works, we consider the deterministic leader election problem for general connected systems. We propose a new deterministic leader election protocol that always succeeds in finding 1, 2, 3, or 6 leaders. We show that if the protocol does not elect a unique leader, deterministic leader election impossible for the system.
Cite
CITATION STYLE
Bazzi, R. A., & Briones, J. L. (2018). Brief announcement: Deterministic leader election in self-organizing particle systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11201 LNCS, pp. 381–386). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
