Wireless ad hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called geographic landmark routing (GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.
Also related is GLR, a geographic routing scheme for large wireless ad hoc networks REF .
GLR: A Novel Geographic Routing Scheme for Large Wireless Ad Hoc Networks
Computer Networks
Computer Science