Computer Science
Poster: Fault-tolerant Consensus for Connected Vehicles: A Case Study
Abstract
Connected vehicles are already being deployed for increased safety and convenience, more fuel-efficient routing and real-time navigation. One major technical challenge is achieving coordination among vehicles in the presence of failures in communication, sensor, object detection, etc. This poster focuses on using distributed fault-tolerant consensus algorithms to achieve coordination among nearby vehicles. Vehicles are in a one-hop network using vehicle-to-vehicle communication. We discuss fundamental limitations and present a practical solution that tolerates both Byzantine fault and lossy communication. Simulation results demonstrate that our algorithm can reach consensus efficiently.
This paper has been withdrawn.
