Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

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.

Dates and versions

hal-01295184 , version 1 (30-03-2016)

Identifiers

Cite

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⟩
69 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More