BeRGeR: Byzantine-Robust Geometric Routing
<|reference_start|>BeRGeR: Byzantine-Robust Geometric Routing: 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.<|reference_end|>
@article{zaz2024berger:,
    title={BeRGeR: Byzantine-Robust Geometric Routing},
    author={Brown Zaz and Mikhail Nesterenko and Gokarna Sharma},
    journal={arXiv preprint arXiv:2403.12256},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.12256},
    primaryClass={cs.DC}
}