Geographic Routing on Improved Coordinates

We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coordinates using a barycentric embedding. Combined with simple geometric routing rules, this greatly reduces the lengths of routes and outperforms algorithms running on the original coordinates. We thoroughly investigate capabilities and incapabilities of these ideas. Along with experimental results we show guaranteed message delivery and give time bounds for the precomputation. Finally, a method with a less consuming precomputation is introduced. Our methods apply to networks where short routes are of great importance, and the one-time-precomputation is affordable