Space complexity of self-stabilizing leader election in passively-mobile anonymous agents

DOI10.1007/978-3-642-11476-2_10MaRDI QIDQ3408164zbMATH OpenOpenAlexFDO

Authors Shukai Cai, Taisuke Izumi, Koichi Wada

Publication date 24 February 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11476-2_10

Mathematics Subject Classification ID

Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Recommendations

• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Loosely-stabilizing leader election in population protocol model
• On space complexity of self-stabilizing leader election in mediated population protocol
• Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols
• Self-stabilizing leader election in optimal space under an arbitrary scheduler

Cites work

• A Simple Population Protocol for Fast Robust Approximate Majority
• Computation in networks of passively mobile finite-state sensors
• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Stably computable predicates are semilinear
• The computational power of population protocols

Cited in

(7)

• On space complexity of self-stabilizing leader election in mediated population protocol
• On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols
• Loosely-stabilizing leader election in population protocol model
• Loosely-stabilizing leader election in a population protocol model
• The Power of Global Knowledge on Self-stabilizing Population Protocols
• Space-optimal naming in population protocols
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model

This page was built for publication: Space complexity of self-stabilizing leader election in passively-mobile anonymous agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408164)