A New Distance Based Route Maintenance Strategy for Dynamic Source Routing Protocol
Muhammad F. Sjaugi, Mohamed Othman & Mohd. Fadlee A. Rasid
Journal of Computer Science, Volume 4, Issue 3, pp. 172–180 · doi.org/10.3844/jcssp.2008.172.180
Abstract
Although DSR can respond a route quickly, it yields a long delay when a route is rebuilt. This is because when source node receives RERR packet, it will try to find alternative routes from the route cache. If alternative routes are not available, the source node, then, will enter route discovery phase to find new routes. We introduced a new route maintenance strategy by utilizing location information, called the DISTANCE (DIstance baSed rouTe maintenANCE) algorithm. The DISTANCE algorithm works by adding another node (called bridge node) into the source list to prevent the link from failure. From the simulation result, the DISTANCE algorithm improved the performance of DSR in terms of packet sending ratio, delay and routing overhead.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Sjaugi, M. F., Othman, M. & Rasid, M. F. A. (2008). A New Distance Based Route Maintenance Strategy for Dynamic Source Routing Protocol . Journal of Computer Science, 4(3), 172–180. https://doi.org/10.3844/jcssp.2008.172.180
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 3
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
