Local Tree Based Geometric Routing
S. Liu, Ling Cheng · 2007
In this paper, we present a new geometric routing - local tree based greedy routing (LTGR) - for mobile ad-hoc networks. LTGR is stateless and overcomes shortcomings caused by planarization errors of previous geometric routing protocols. Local trees are constructed and their information is used to route packets bypassing void areas when the greedy geometric routing does not work. Simulation results show that LTGR outperforms GPSR (greedy parameter stateless routing) in terms of delivery ratio, routing overhead, and hop stretch. LTGR can reduce the routing overhead by 25 ~ 40% and hop stretch by 30 ~ 50% comparing to GPSR in our extensive simulation scenarios.