Performance Analysis of Dynamic Source Routing Protocol
Amer O. Abu Salem, Ghassan Samara, Tareq Alhmiedat

TL;DR
This paper evaluates the performance of the Dynamic Source Routing protocol in mobile ad-hoc networks, focusing on metrics like delivery ratio, delay, and throughput, influenced by cache size and node speed.
Contribution
It provides a comprehensive analysis of DSR's performance under various conditions and proposes developing a new caching strategy as future work.
Findings
Performance varies with cache size and node speed.
Higher cache sizes improve route discovery efficiency.
End-to-end delay and throughput are affected by mobility patterns.
Abstract
Dynamic Source Routing (DSR) is an efficient on-demand routing protocol for mobile ad-hoc networks (MANET). It depends on two main procedures: Route Discovery and Route Maintenance. Route discovery is the procedure used at the source of the packets to discover a route to the destination. Route Maintenance is the procedure that discovers link failures and repairs them. Route caching is the sub procedure serviceable to avoid the demand for discovering a route or to reduce route discovery delay before every data packet is sent. The goal of this paper is to evaluate the performance of DSR. Different performance expressions are investigated including, delivery ratio, end to-end delay, and throughput, depending on different cache sizes and different speeds. All of that as a study to develop a new caching strategy as a future work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
