Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that ( is the number of processes and is the number of Byzantine processes) and that the initial state of the processes can be arbitrary (self-stabilization). We distinguish the cases where the beeping period is known, unknown or approximately known. We also consider the situation where the processes can produce light continuously.
Rachid Guerraoui, Nirupam Gupta, John Stephan, Sadegh Farhadkhani, Rafaël Benjamin Pinot
Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti
, ,