Location-Based Routing Algorithms for Mobile Ad Hoc Networks with Holes
Jipeng Zhou, LU Jian-zhu, Shuqiang Huang, Zuzhi Fan · 2010
Geographic forwarding has been widely studied as a routing strategy for mobile ad hoc networks, mainly due to the low complexity, scalability of the routing algorithm. However, in a network with routing holes, existing geographic routing schemes such as GPSR, GOAFR could cause the throughput capacity to drop significantly due to concentration of traffic on the face of the holes. The slope-based stateless routing algorithm SBRA for mobile ad hoc networks with holes is proposed firstly in the paper, which does not need to maintain global network topology and can solve the local minimum problem and enhance the network throughput. In order to improve the performance of routing algorithm further, we propose a routing path discovery algorithm SBRDA, which can discover two routing paths to detour a hole, then it selects a shorter one. We also propose a slope based landmark discovery algorithm SBLDA, the greedy routing is combined with our landmark discovery scheme to build routes, which can solve triangle problem and achieve good routing performance. The performance of the proposed algorithms is evaluated by means of simulation.