Space-efficient self-stabilizing counting population protocols on mobile sensor networks

DOI10.1016/J.TCS.2014.07.028MaRDI QIDQ740980zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

counting problemmobile sensor networksself-stabilizing algorithmsymmetric population protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Self-stabilizing counting in mobile sensor networks
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Space-optimal counting in population protocols
• A survey of size counting in population protocols
• Time and space optimal counting in population protocols

Cites work

• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• scientific article; zbMATH DE number 2036573 (Why is no real title available?)
• A self-stabilizing transformer for population protocols with covering
• Computation in networks of passively mobile finite-state sensors
• 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 a population protocol model
• Mediated population protocols
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• On utilizing speed in networks of mobile agents
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• The computational power of population protocols
• Tight complexity analysis of population protocols with cover times -- the ZebraNet example

Cited in

(11)

• A survey of size counting in population protocols
• Constructing self-stabilizing oscillators in population protocols
• Constant-space population protocols for uniform bipartition
• Uniform bipartition in the population protocol model with arbitrary graphs
• A combinatorial characterization of self-stabilizing population protocols
• Simple and fast approximate counting and leader election in populations
• Space-optimal counting in population protocols
• Time and space optimal counting in population protocols
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• On space and time complexity of loosely-stabilizing leader election
• Self-stabilizing counting in mobile sensor networks

This page was built for publication: Space-efficient self-stabilizing counting population protocols on mobile sensor networks

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