Population protocol
A population protocol is a distributed computing model formed by resource-limited mobile agents which meet in a random way according to an interaction graph. Functions are computed by updating the state of agents whenever they meet based on the previous value of the states, and the result of the computation can be read in the states of the agents once the computation has converged.
Population protocols were introduced by Dana Angluin et al.[1] as one of the first models of computation to be fully decentralized and to involve agents with highly limited resources, e.g., those found in sensor networks. Since then, this abstract computation model found applications in robotics[2] and chemistry.[3]
See also
References
- ^ Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 2006. [1]
- ^ Gregory Dudek, Michael Jenkin. Computational Principles of Mobile Robotics, Chapter 10.
- ^ Ho-Lin Chen, David Doty, David Soloveichik. Deterministic function computation with chemical reaction networks. Natural Computing, 2014. [2]
| General | |
|---|---|
| Levels | |
| Multithreading | |
| Theory | |
| Elements | |
| Coordination | |
| Programming | |
| Hardware | |
| APIs | |
| Problems | |
 | This computing article is a stub. You can help Wikipedia by expanding it. |