Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

Zohir Bouzid 1 Maria Potop-Butucaru 1, 2 Sébastien Tixeuil 1, 3
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
3 GRAND-LARGE - Global parallel and distributed computing
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LIFL - Laboratoire d'Informatique Fondamentale de Lille, LRI - Laboratoire de Recherche en Informatique
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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00390870
Contributor : Maria Potop-Butucaru <>
Submitted on : Tuesday, June 2, 2009 - 10:54:22 PM
Last modification on : Thursday, March 21, 2019 - 1:07:50 PM
Long-term archiving on : Friday, June 11, 2010 - 12:14:29 AM

Files

convergence.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00390870, version 1
  • ARXIV : 0906.0651

Citation

Zohir Bouzid, Maria Potop-Butucaru, Sébastien Tixeuil. Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks. [Research Report] 2009, pp.15. ⟨inria-00390870⟩

Share

Metrics

Record views

512

Files downloads

155