Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

DOI10.1016/J.TCS.2021.07.008OpenAlexW3183798905MaRDI QIDQ820545FDOQ820545

Authors Anisur Rahaman Molla, Kaushik Mondal, William K. jun. Moses 

Publication date 27 September 2021

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

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

zbMATH Keywords

dispersiondistributed algorithmringsmobile robotsByzantine faultsfaulty robots

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Collaborative dispersion by silent robots
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Optimal deterministic ring exploration with oblivious asynchronous robots
• Uniform dispersal of asynchronous finite-state mobile robots in presence of holes

Cites Work

• Byzantine gathering in polynomial time
• Computation in networks of passively mobile finite-state sensors
• Deterministic network exploration by a single agent with Byzantine tokens
• Dispersion of mobile robots on grids
• Dispersion of mobile robots: the power of randomness
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed computing by mobile robots: gathering
• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Euler Tour Lock-In Problem in the Rotor-Router Model
• Exploration of Faulty Hamiltonian Graphs
• Fast collaborative graph exploration
• Gathering despite mischief
• Gathering of robots in a ring with mobile faults
• Graph exploration by a finite automaton
• Impossibility of gathering by a set of autonomous mobile robots
• Label-guided graph exploration by a finite automaton
• Mobile agents in distributed computing: network exploration
• Rendezvous in networks in spite of delay faults
• Search on a line by Byzantine robots
• Structural Information and Communication Complexity
• Time and space optimality of rotor-router graph exploration
• Uniform Deployment of Mobile Agents in Asynchronous Rings
• Uniform multi-agent deployment on a ring

Cited In (4)

• Collaborative dispersion by silent robots
• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
• Distance-2-dispersion with termination by a strong team

This page was built for publication: Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

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