2024/03/18 by Brown Zaz, Zaz, Brown, Mikhail Nesterenko +3
Computer Science · Engineering · #3D Shape Modeling and Analysis #Distributed #FOS: Computer and information sciences #Graph Theory and Algorithms #Image Processing and 3D Reconstruction #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2403.12256
openalex publication_date 2024/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication graph is a planar embedding that remains three-connected if all edges intersecting the source-target line segment are removed. We prove the algorithm correct and estimate its message complexity.