Fine-Grained Landmark Based Greedy Geographic Routing with Guaranteed Delivery Under Uncertain Locations

This poster presents a hierarchical greedy geographic routing scheme in wireless networks, which performs greedy geographic routing with guaranteed delivery under uncertain locations on a landmark graph by leveraging a fine-grained connectivity-based planarization algorithm. This design neither depends on exact node locations, nor needs to store any global state information in each node. The algorithm works in a completely localized fashion, and the additional storage and computation complexity is extremely low. Our simulations demonstrate that the routing scheme is able to produce route paths with lower stretch factors and more load-balancing property than the state-of-the-art methods.