arXiv · 1701.03616
Improved Leader Election for Self-Organizing Programmable Matter
Abstract
We consider programmable matter that consists of computationally limited devices (called particles) that are able to self-organize in order to achieve some collective goal without the need for central control or external intervention. We use the geometric amoebot model to describe such self-organizing particle systems, which defines how particles can actively move and communicate with one another. In this paper, we present an efficient local-control algorithm which solves the leader election problem in O(n) asynchronous rounds with high probability, where n is the number of particles in the system. Our algorithm relies only on local information --- particles do not have unique identifiers, any knowledge of n, or any sort of global coordinate system --- and requires only constant memory per particle.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Joshua J. Daymude, Robert Gmyr, Andrea W. Richa, Christian Scheideler, Thim Strothmann. 2017-01-13. Improved Leader Election for Self-Organizing Programmable Matter. https://doi.org/10.1007/978-3-319-72751-6_10
Cite the original work for its findings. Save a collection to share your selection of sources.