Space-efficient self-stabilizing counting population protocols on mobile sensor networks
From MaRDI portal
Publication:740980
DOI10.1016/j.tcs.2014.07.028zbMath1360.68202OpenAlexW2001008526MaRDI QIDQ740980
Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada
Publication date: 10 September 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.028
Related Items (8)
Simple and fast approximate counting and leader election in populations ⋮ On Space and Time Complexity of Loosely-Stabilizing Leader Election ⋮ Constant-Space Population Protocols for Uniform Bipartition ⋮ A combinatorial characterization of self-stabilizing population protocols ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ A survey of size counting in population protocols ⋮ Constructing self-stabilizing oscillators in population protocols ⋮ Stable leader election in population protocols requires linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example
- Loosely-stabilizing leader election in a population protocol model
- Mediated population protocols
- A self-stabilizing transformer for population protocols with covering
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
- On utilizing speed in networks of mobile agents
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
This page was built for publication: Space-efficient self-stabilizing counting population protocols on mobile sensor networks
