Tight complexity analysis of population protocols with cover times -- the ZebraNet example

DOI10.1016/J.TCS.2012.10.032zbMath1358.68033OpenAlexW2005119638MaRDI QIDQ391993

Peva Blanchard, Sylvie Delaët, Joffroy Beauquier, Janna Burman

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.032

zbMATH Keywords

population protocolscover timesmobile agent networksworst-case time complexity analysisZebraNet

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network protocols (68M12)

Related Items (1)

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

Cites Work

• Mediated population protocols
• A self-stabilizing transformer for population protocols with covering
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• On utilizing speed in networks of mobile agents

This page was built for publication: Tight complexity analysis of population protocols with cover times -- the ZebraNet example