Skipping Face Routing with Guaranteed Message Delivery for Wireless Ad Hoc and Sensor Networks

摘要

Location-based routing techniques, greedy routing and face routing, route data by using the location information of wireless nodes. Greedy routing efficiently routes data in dense networks by giving short hop paths, but it does not guarantee message delivery. Face routing has been designed and combined with greedy routing to achieve both transmission efficiency and guaranteed message delivery. The existing face routing algorithms mainly works on three types of planar graphs: Gabriel graph, relative neighborhood graph, and Delaunay triangulation. One major observation is that each transmission in face routing only can pass message over a short distance, resulting in that the existing face routing traverses long hop paths to destinations. In this paper, we present a Skip Face Routing (SFR) to reduce the face traversal cost incurred in the existing approaches. By using simulation studies, we show that SFR significantly increases routing performance.