Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

Zohir Bouzid 1 Maria Gradinariu Potop-Butucaru 2 Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f+1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimensional space.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01295184
Contributor : Lip6 Publications <>
Submitted on : Wednesday, March 30, 2016 - 3:04:13 PM
Last modification on : Thursday, March 21, 2019 - 1:06:45 PM

Links full text

Identifiers

Citation

Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks. SSS 2009., Nov 2009, Lyon, France. pp.165-179, ⟨10.1007/978-3-642-05118-0_12⟩. ⟨hal-01295184⟩

Share

Metrics

Record views

136