Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle

In this work, we address the problem of (n, f)-evacuation on a circle, which involves evacuating n robots, with f of them being faulty, from a hidden exit located on the perimeter of a unit radius circle. The robots commence at the center of the circle and possess a speed of 1. We introduce an algorithm for the Wireless communication model under any number of Byzantine faults. We analyze the time requirements of our proposed algorithm and we establish an upper bound on its performance.