BeRGeR: Byzantine-Robust Geometric Routing
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要