Better face routing protocols

Abstract

Existing face routing protocols guarantee message delivery on static connected plane graphs. To apply them to real networks, one must maintain a spanning plane subgraph and assume that the network changes only when routing is not being performed. To improve efficiency, they are often used only when greedy approaches fail. We present protocols for connected quasi unit disk graphs, where nodes which are close to one another (distance at most ε ≥ 1/√2) are always neighbors, and nodes which are far apart (distance > 1) are never neighbors. Our protocols do not extract a subgraph of the network, do not store routing information at nodes, and guarantee message delivery under more general conditions that allow unstable edges to repeatedly change between being active and inactive during routing. © 2009 Springer-Verlag.