Loosely-stabilizing leader election in a population protocol model
From MaRDI portal
Publication:442276
DOI10.1016/j.tcs.2012.01.007zbMath1250.68080OpenAlexW2174615208MaRDI QIDQ442276
Junya Nakamura, Toshimitsu Masuzawa, Yuichi Sudo, Hirotsugu Kakugawa, Yukiko Yamauchi, Fukuhito Ooshita
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.007
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (9)
On Space and Time Complexity of Loosely-Stabilizing Leader Election ⋮ Leader Election Requires Logarithmic Time in Population Protocols ⋮ Constant-Space Population Protocols for Uniform Bipartition ⋮ The Power of Global Knowledge on Self-stabilizing Population Protocols ⋮ A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States ⋮ Unnamed Item ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time ⋮ Space-efficient self-stabilizing counting population protocols on mobile sensor networks ⋮ Loosely-stabilizing maximal independent set algorithms with unreliable communications
Cites Work
- Unnamed Item
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Computation in networks of passively mobile finite-state sensors
- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
- Fast Computation by Population Protocols with a Leader
- Self-stabilizing systems in spite of distributed control
- Probability and Computing
This page was built for publication: Loosely-stabilizing leader election in a population protocol model
