On utilizing speed in networks of mobile agents
From MaRDI portal
Publication:5176207
DOI10.1145/1835698.1835775zbMath1315.68010OpenAlexW1999156420MaRDI QIDQ5176207
Julien Clément, Shay Kutten, Janna Burman, Joffroy Beauquier
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835775
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Related Items (12)
Data Collection in Population Protocols with Non-uniformly Random Scheduler ⋮ On Space and Time Complexity of Loosely-Stabilizing Leader Election ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Tight complexity analysis of population protocols with cover times -- the ZebraNet example ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ A self-stabilizing transformer for population protocols with covering ⋮ Simple and efficient local codes for distributed stable network construction ⋮ Beachcombing on strips and islands ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Space-efficient self-stabilizing counting population protocols on mobile sensor networks ⋮ Group search of the plane with faulty robots
Uses Software
Cites Work
This page was built for publication: On utilizing speed in networks of mobile agents
