Enhanced Reliable On-demand Routing Protocol

Mobile ad hoc networks are self organizing multi-hop wireless networks with no fixed infrastructure. All the users in these networks are mobile. The mobiles communicate either directly or via other nodes of the network by establishing routes. The mobility of nodes causes the existing links to be break frequently. So if we can predict future movement, the resources reservation can be made before be asked, which enables the network to provide a better QoS. One protocol which uses mobility prediction is Reliable On-demand Routing Protocol (RORP). The protocol estimates the duration of each links and calculates a request region for sending packets. In This protocol a route which has a longest duration of time is considered as a stable route for sending data packets. In this paper, we want to improve the RORP´s algorithm and decrease the extra overhead which is existed in this protocol. There are some routes in the network which have very small expiration time. These routes produce ineffective overhead in the networks. In our proposed algorithm, we consider a threshold for route expiration time. During routing process if the link expiration time is smaller than threshold, the packet will be dropped. To show the performance of our algorithm we compare this algorithm with RORP. Simulation result shows the proposed scheme performs better than RORP.