Background and Objective:
The present issues which are faced by the transport systems include enormous
traffic jams and congestion, unexpected road accidents, unwanted time delays, pedestrians' crossings on main roads,
wastage of fuel and many more. ITS, along with some other technologies, work together to overcome such factors
contributing to a much more desirable transport system. This paper aims to identify the security measures that could
increase the security of the routing protocol and improve the performance of DSR routing protocol. If the number of
establishing links is frequently broken, then the performance of DSR routing protocol is not very good. A new modified
DSR algorithm has been designed that would help in reducing the network overhead and increase the network quality. A
comparison between the performances of both algorithms has also been studied, and the results show that improved DSR
routing protocol has better efficiency in parameters like end-to-end network load delays and packet delivery ratio.
Methods & Materials:
The paper mainly focuses on securing Dynamic Source routing algorithm by designing its
modified version and simulating it. We have Proposed Modified DSR and discussed so far that the basic functionality of
the DSR algorithm, its advantages and disadvantages. The main drawbacks include the end-to-end Delay, network
overhead and packet delivery ratio. Following is a modified version of the dynamic source routing algorithm which tries
to overcome all the limitations of the basic algorithm at a certain level. In Dynamic Source Routing algorithm, the Route
Maintenance phase is used for the successful propagation of the packet within the network. The nodes that are involved in
the transmission acknowledge the receiving of the packet to the preceding node.
Results and Discussion:
The present study aims at modifying the existing algorithm and designing a new modified
algorithm which has less routing overhead, less Delay in packet transmission and high network quality. Modified DSR
routing algorithm is examined on the parameters like E-2-E delay, Normalize Routing Overhead, PDR. When we compare
the performance the proposed method with Existing protocol AODV, and DSR at a number of nodes equal to 50 then we
get the Proposed DSR which has least end-to-end Delay among all the three protocols.
Conclusion:
In this paper, Comparison of Exiting DSR and Modified DSR in terms of end-to-end Delay, routing load
and packet delivery ratio is done. After studying the readings, the conclusion drawn was that there are less network
overhead and high delivery ratio in modified DSR as compared to the existing DSR algorithm. The corrupted and
destroyed packets are detected by the receiver, and in DSR, the mobility of mobile nodes are moderate. Under certain
conditions, bidirectional and unidirectional links can be accepted. DSR routing protocols are highly dependent on the
parameters such as area size, packet size, packet type, and others.
