Fast Geometric Routing with Concurrent Face Traversal

We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate that, on average, CFR significantly outperforms the best known geometric routing algorithms in the path stretch: the speed of message delivery. Its performance approaches the shortest possible path. CFR maintains its advantage over the other algorithms in pure form as well as in combination with greedy routing; on planar as well as on non-planar graphs. Key words: geometric routing, ad hoc wireless routing

• Type: Conference
• Year: 2008
• Where: OPODIS
• Authors: Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
• Keywords: Distributed And Parallel Computing, Face Routing Cfr, Geometric Routing Algorithms, OPODIS 2008, Routing