Byzantine Fireflies

Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01199818
Contributor : Matthieu Roy <>
Submitted on : Wednesday, September 16, 2015 - 11:23:54 AM
Last modification on : Monday, October 2, 2017 - 4:06:04 PM
Long-term archiving on: Tuesday, December 29, 2015 - 7:28:48 AM

File

93630047.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Rachid Guerraoui, Alexandre Maurer. Byzantine Fireflies. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_4⟩. ⟨hal-01199818⟩

Share

Metrics

Record views

43

Files downloads

99