Research Article Open Access

A New Distance Based Route Maintenance Strategy for Dynamic Source Routing Protocol

Muhammad F. Sjaugi, Mohamed Othman and Mohd. Fadlee A. Rasid

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.

Journal of Computer Science
Volume 4 No. 3, 2008, 172-180

DOI: https://doi.org/10.3844/jcssp.2008.172.180

Submitted On: 17 July 2009 Published On: 31 March 2008

How to Cite: 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

  • 4,400 Views
  • 2,698 Downloads
  • 7 Citations

Download

Keywords

  • Route maintenance
  • routing protocol
  • mobile ad hoc network
  • dynamic source routing protocols