دانلود رایگان مقاله بهبود بهره وری از طریق مسیریابی هدف میانی بر اساس مسیریابی جغرافیایی

Abstract

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

5. Conclusion

In this paper, we presented a new geographic routing approach called ITGR in order to avoid the long detour path. It detects the destination areas that might be shaded by the holes from previous routing experience. Then it selects the landmarks as tentative targets to construct greedy sub-paths. The approach can be used to avoid local minimum nodes. We design the scheme in such a way that a single detour path to a given destination can be used to avoid the detour path to many destinations in the future. We demonstrated a simple representation used for determining whether a node is in the shaded area. We also developed a method to reduce the overhead at nodes by combining multiple entries into one. The simulations demonstrate that our approach can result in significant shorter routing path and fewer hops than an existing geographic routing algorithm.