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.
منابع مشابه
2FACE: Bi-Directional Face Traversal for Efficient Geometric Routing
We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...
متن کاملEfficient Geometric Routing
We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...
متن کاملMemory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that it is executed by an agent moving along a network and using at each node only information about the current node (incl. its position) and a finite number of others (independent of graph size). Local geometric traversal algorit...
متن کاملVoid traversal for efficient non-planar geometric routing
Geometric routing provides a scalable and efficient way to route messages in ad hoc networks if extensive routing information is unavailable. Such algorithms require a planar graph to guarantee message delivery. The routing techniques for such guarantee usually center around the traversal of planar faces of the graph. However, in realistic wireless networks existing planarization methods, if at...
متن کاملRouting on Overlay Graphs in Mobile Ad Hoc Networks
Geometric routing using source-destination locations has been widely suggested as a scalable alternative to conventional routing approaches in mobile ad hoc networks. Recently, there has been considerable attention on face routing in planar graphs constructed from overlay graphs in wireless networks. Given a plane tiled into an infinite mesh of polygons, an overlay graph is defined as one in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008