Byzantine Fireflies

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 $n > 2f$ ($n$ is the number of processes and $f$ 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.


Presented at:
Distributed computing (DISC), Tokyo, Japan, October 7-9, 2015
Year:
2015
ISBN:
978-3-662-48653-5
Laboratories:




 Record created 2017-06-29, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)