Constructing self-stabilizing oscillators in population protocols

DOI10.1016/j.ic.2016.12.002zbMath1371.68027OpenAlexW2560396680MaRDI QIDQ2013587

Colin Cooper, Yukiko Yamauchi, Giovanni Viglietta, Masafumi Yamashita, Anissa Lamani

Publication date: 8 August 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.12.002

zbMATH Keywords

autonomous systemsself-organizationself-stabilizationleader electionpopulation protocolsself-oscillation

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (1)

Fault tolerant network constructors

Cites Work

• Unnamed Item
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks
• Space-optimal counting in population protocols
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers

This page was built for publication: Constructing self-stabilizing oscillators in population protocols