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

DOI10.1016/J.TCS.2014.07.028zbMATH Open1360.68202OpenAlexW2001008526MaRDI QIDQ740980FDOQ740980

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

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

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)

Cites Work

• Computation in networks of passively mobile finite-state sensors
• The computational power of population protocols
• Title not available (Why is that?)
• Mediated population protocols
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Tight complexity analysis of population protocols with cover times -- the ZebraNet example
• On utilizing speed in networks of mobile agents
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• A self-stabilizing transformer for population protocols with covering
• Loosely-stabilizing leader election in a population protocol model
• Title not available (Why is that?)
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model

Cited In (9)

• A survey of size counting in population protocols
• Constructing self-stabilizing oscillators in population protocols
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• 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
• Constant-Space Population Protocols for Uniform Bipartition
• Stable leader election in population protocols requires linear time
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station

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)