Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

Details Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

2009-06-03

arxiv.org/abs/0906.0651v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193627