  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.
