Core Concepts
BeRGeR is an asynchronous geometric routing algorithm that ensures message delivery in the presence of Byzantine faults without relying on cryptography or randomization.
Abstract
BeRGeR introduces a novel approach to geometric routing, focusing on fault tolerance.
Geometric routing utilizes node locations for efficient message transmission.
The algorithm guarantees message delivery despite Byzantine faults by utilizing planar embeddings and face traversal techniques.
BeRGeR addresses the challenge of fortifying geometric routing against faults using geometric techniques themselves.
The Triconnectivity Assumption is crucial for the correct operation of BeRGeR in planar graphs.
The algorithm ensures validity, liveness, and termination properties for reliable message delivery.
Stats
通信グラフは3つの内部的にノードが分離されたパスで接続されている必要がある。
メッセージ複雑性はO(N^2)である。
Quotes
"BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization."
"We present BeRGeR, an asynchronous unicast concurrent geometric routing algorithm that handles a single Byzantine fault."