Abstract

Current efforts for providing an efficient dynamic source routing protocol (DSR) for use in multi-hop ad-hoc wireless are promising. This is since DSR has a unique characteristic in that it uses source routing, instead of relying on the routing table at each intermediate device. This study addresses the current challenges facing DSR protocol in terms of the dynamic changes of the route and how to update such changes into the route cache of the DSR. The challenges typically persist when a sudden route break occurs resulting in a delay in updating the new node location into the cache of the DSR protocol. For that, this study proposes a novel algorithm to improve the cache updating of DSR protocol in the ad-hoc network using dominating set-based routing (DBR). In DBR, the dominating nodes establish node update cache in accordance with the characteristics of the new route. Network Simulator version 2 (NS2) was used to implement and evaluate the proposed algorithm. A comparison of certain performance metrics was carried among the proposed DSR-DBR, DSR-route-cache, and DSR-original in the transmission control protocol and user datagram protocol. The DSR-DBR performance result showed a significant improvement in the average throughput, average end-to-end delay, average discovery time and routing overhead.

Highlights

  • Due of its relevance in essential applications such as battlefield communication and disaster assistance without requiring a fixed or static setup, the rising interest in Mobile Ad-hoc Networks (MANETs) has had an influence on academic research [1,2,3]

  • This section explains the results from running the Network Simulator version 2 (NS2) on metrics such as throughput, end-to-end latency, routing overhead, and route discovery time

  • These results were found to be better than the throughput results of DSRROUTE-CACHE and dynamic source routing protocol (DSR)-ORIGINAL respectively

Read more

Summary

Introduction

Due of its relevance in essential applications such as battlefield communication and disaster assistance without requiring a fixed or static setup, the rising interest in Mobile Ad-hoc Networks (MANETs) has had an influence on academic research [1,2,3]. DSR is a simple, efficient wireless protocol for the multi-loop setting of MANET’s nodes [7,8]. DSR protocol features low overhead, and the caches of the route reduce the cost of route discovery. Because nodes are transmitting randomly, there will be changes in the network topology over time. The last contributing factor was the changes in network topology, which caused inadequate routing protocol performance. The design of protocols like DSR is used as a medium for transmitting node till its discovered route expires or is broken. One source that causes cache staleness is linked breakage for DSR protocol [12,13].

Background and Related Work
DSR Route Caching Algorithm
Implementation of DBR in DSR Protocol
Routing Overhead
Average End-to-End Delay
Throughput
Results and Discussions
Conclusion and Future Research
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call