期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：4
页码：498-503
出版社：Shri Pannalal Research Institute of Technolgy
摘要：The major challenges in MANETs are finding the destination, routing and robust communication dealing with constant topology change. When there is no end to end path at any given time between source and destination via intermediate peers then it forms partitions in the network. It is said to be intermittently connected network. LAROD is the geographical routing protocol designed for such type of networks. Basically greedy approach is followed in any of the routing protocol to forward the packets. LAROD-LoDiS is also based on greedy packet forwarding along with store carry forward principle. But it works until greedy forwarding is possible. When greedy forwarding fails then the protocol has to follow some other recovery strategy to move the packets from void areas. The areas where nodes do not travel are void areas. In this paper, we propose a Timer Based DFS recovery technique to handle void in LAROD-LoDiS protocol (TBD-LAROD)1. Our main aim is to improve it in terms of delivery ratio. We also calculate the timer function to find the next optimal node considering forwarding area, void flag and load balancing. Simulation is done in ns2. Results show that new routing protocol outperforms existing one by improving delivery ratio.
关键词：Geographic Routing; LAROD-LoDiS; TBD- LAROD; VOID HANDLING;Depth First Search
