Sciweavers

Share
OPODIS
2008

Fast Geometric Routing with Concurrent Face Traversal

10 years 4 months ago
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
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where OPODIS
Authors Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
Comments (0)
books