A NEW POLICY FOR PATH SELECTION IN DYNAMIC SOURCE ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

Autor: M. Nordin A. Rahman, Ragb O. M. Saleh, Yazid Mohd Saman
Rok vydání: 2013
Předmět:
Zdroj: Journal of Computer Science. 9:551-557
ISSN: 1549-3636
DOI: 10.3844/jcssp.2013.551.557
Popis: In standard DSR protocol, nodes automatically discover and maintain the routes in the network by storing source routes, discovered dynamically on-demand. They maintain route caches that contain the source routes which the node is aware of. Entries are cont inually updated when new routes are learned and reo rder the cached routes according to the traditional shor test path policy. The problem with this approach is that, while the source is still using the primary shortes t route, the primary route might fail and the sourc e would remain unaware of that its cache contains a recent/ fresh route, which has the same number of hop count and to the same destination. Thus, we proposed a method to improve the performance of DSR protocol by increasing packet delivery ratio and reducing routi ng overhead by adopting a path selection mechanism. In this study, we present a new strategy for route sel ection in DSR protocol that uses the recent-short p ath as routing metric. It calls RSRS. Basically, RSRS depe nds on the construction time and the hop-count of t he cached route for route selection. Since, it utilize s the recent -short path in the route cache as rout ing metric. The proposed method has been implemented in GloMoSim simulator and its performance compared to the conventional DSR protocol and we have reached more important and comparable simulation results. The simulation results confirmed that the SRSR method i mproved packet delivery ratio, reduction of routing overhead, number of dropped packets and number of failure links.
Databáze: OpenAIRE