Citation
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.
Download File
Official URL or Download Paper: http://thescipub.com/html/10.3844/jcssp.2008.172.1...
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Computer Science and Information Technology Faculty of Engineering |
DOI Number: | https://doi.org/10.3844/jcssp.2008.172.180 |
Publisher: | Science Publications |
Keywords: | Dynamic source routing protocols; Mobile ad hoc network; Route maintenance; Routing protocol |
Depositing User: | Nabilah Mustapa |
Date Deposited: | 26 Jan 2016 00:25 |
Last Modified: | 26 Jan 2016 00:25 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3844/jcssp.2008.172.180 |
URI: | http://psasir.upm.edu.my/id/eprint/12744 |
Statistic Details: | View Download Statistic |
Actions (login required)
View Item |