On space complexity of self-stabilizing leader election in mediated population protocol

DOI10.1007/s00446-012-0173-9zbMath1257.68038OpenAlexW2071135260MaRDI QIDQ1938386

Masafumi Yamashita, Shuji Kijima, Ryu Mizoguchi, Hirotaka Ono

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0173-9

zbMATH Keywords

self-stabilizationleader electionpopulation protocolsspace complexitymediated population protocols

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (5)

Simple and fast approximate counting and leader election in populations ⋮ Fault tolerant network constructors ⋮ Mediated Population Protocols: Leader Election and Applications ⋮ Unnamed Item ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time

Cites Work

• Unnamed Item
• Unnamed Item
• Mediated population protocols
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Recent Advances in Population Protocols
• Self-stabilizing systems in spite of distributed control
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Self-stabilizing counting in mobile sensor networks

This page was built for publication: On space complexity of self-stabilizing leader election in mediated population protocol