Loosely-stabilizing leader election in a population protocol model
DOI10.1016/J.TCS.2012.01.007zbMATH Open1250.68080OpenAlexW2174615208MaRDI QIDQ442276FDOQ442276
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
Recommendations
- Loosely-stabilizing leader election in population protocol model
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers
- On space and time complexity of loosely-stabilizing leader election
- Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Probability and Computing
- A simple population protocol for fast robust approximate majority
- Fast Computation by Population Protocols with a Leader
- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
- Title not available (Why is that?)
Cited In (18)
- On Space and Time Complexity of Loosely-Stabilizing Leader Election
- The Power of Global Knowledge on Self-stabilizing Population Protocols
- Population protocols with faulty interactions: the impact of a leader
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Loosely-stabilizing leader election in population protocol model
- Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
- Constant-Space Population Protocols for Uniform Bipartition
- Title not available (Why is that?)
- Stable leader election in population protocols requires linear time
- A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
- Title not available (Why is that?)
- A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory
- Logarithmic expected-time leader election in population protocol model
- Loosely-stabilizing maximal independent set algorithms with unreliable communications
- Stabilizing leader election in partial synchronous systems with crash failures
- Leader Election Requires Logarithmic Time in Population Protocols
- Logarithmic Expected-Time Leader Election in Population Protocol Model
This page was built for publication: Loosely-stabilizing leader election in a population protocol model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442276)
