Name
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 (mathcal {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. |
Year | Venue | Field |
|---|---|---|
2017 | ALGOSENSORS | Leader election,Asynchronous communication,Particle number,Particle system,Computer science,sort,Computer network,Programmable matter,Unique identifier,Particle,Distributed computing |
DocType | Citations | PageRank |
Conference | 6 | 0.62 |
References | Authors | |
13 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joshua J. Daymude | 1 | 21 | 4.52 |
| Robert Gmyr | 2 | 79 | 9.70 |
| Andréa W. Richa | 3 | 968 | 164.82 |
| Christian Scheideler | 4 | 1729 | 152.71 |
| Thim Strothmann | 5 | 80 | 9.78 |