Volume 5, Issue 5, May – 2020 International Journal of Innovative Science and Research Technology

ISSN No:-2456-2165

Enhancing the Performance of Dynamic Source

Routing Protocol by Modifying the Algorithm in
Mobile ad-hoc Network
Temesgen Mengistu Helana Alazar Merdekios Keba
Department of Computer Science Computer Science department
School of Informatics School of Informatics
Wolaita Sodo University, WSU Wolaita Sodo University, WSU
Wolaita Sodo, Ethiopia Wolaita Sodo, Ethiopia

Abstract:- In our day-to-day life, wireless technology observing pre and post characteristics of the nodes done for
plays a great role, because users move from place to partitioning the approach into the proactive and reactive
place across the globe, it’s important to think about the approach. For load balancing, easy to manage and control
type of network we can deploy quickly. Collection of two the greedy node as studied in [5]. MANET use different
or more node forms A mobile ad-hoc network (MANET) protocols for routing mechanism. Protocols in MANET are
without the aid of any centralized infrastructure. There classified into Proactive (Table driven) and Reactive (on
are independent nodes that communicate without a wire Demand) [2]. In Proactive (Table driven) type of MANET
in a mobile ad hoc network. Due to the behavior of nodes protocol, the routing information is usually kept in their
in MANET the time when node joining/leaving the routing tables and updates their information at a fixed time
network is unknown. This study focuses on improve interval; such as Destination Sequenced Distance Vectored
performance of DSR protocol affected due to selfish (DSDV), Cluster-head Gateway Switch Routing (CGSR),
nodes. So, identify path without any selfish node is the Optimized Link State Routing (OLSR) [1,2]. On the other
main issue for delivering a packet by selecting a reserved hand, the Reactive (on Demand) one is designed for
path. The algorithm counts the number of failed route maintaining the information for active routes only; such as
request messages to aware the selfish node that causes Ad-hoc on-demand routing protocol (AODV) and Dynamic
failure on NS-2 simulator tools. The node is assigned to Source Routing Protocol (DSR) [2].
indicating the selfishness status of the node during route
discovery. In this study the researcher conducts A. Routing Protocols In MANET
performance evaluation of existing DSR and modified From Mobile ad hoc network area routing protocol
one is assessed by using packet delivery ratio, and end- improvement and add new protocol take attention.it is
to-end delay metrics and achieved very good result. limited to communicate with a single node with neighbor
node without routing protocol. MANET uses Routing
Keywords: - Dynamic Source Routing (DSR), Mobile Ad- Protocols to discover and maintain a route between the
Hoc Network (MANET), Network Simulator (NS-2), Selfish source node to the destination node and the data packets
Node process in the discovered path. In general, Routing protocols
in MANET can be classified into the following categories
I. INTRODUCTION [4]:

A mobile ad-hoc network (MANET) is a type network Ad-hoc routing protocol

in which mobile devices connected by wireless links [1].
Since the mid-1990s Mobile ad hoc networks (MANETs)
has become popular areas of research because of the growth
of personal computers, mobile devices, and 802.11/Wi-Fi
wireless networking [3]. We are going to work on routing,
and how node communication is going on with multiple
nodes. Mobile nature of those nodes, node behavior, and Proactive Reactive Hybrid
another factor can change the link quality within a minor.

The major contribution of this thesis is to reduce

performance problems due to misbehaved node by DSDV AOD
OLSR V ZRP
identifying the selfish node during route discovery before
selecting path in Dynamic source routing. Therefore, node CGSR DSR LAR
behavior based routing protocols is important to choose the TORA
stable route for passing through the available links. This
approach deals with understanding the existed nodes in the Fig 1:- End to end packet delay
network, modeling out node behavior of the network by

IJISRT20MAY880 www.ijisrt.com 1960

 Volume 5, Issue 5, May – 2020 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
II. OBJECTIVE OF THE STUDY Then All valid path is checked, node_id is discarded
from route information
A. General Objective
The general objective of this study is to improve Else All valid paths are saved
performance in DSR routing protocol to overcome data loss,
stability of a link/network for providing efficient services In pseudo-code, S is the source node calculating its
and initializing the reserved path to deliver the packet. routing table, the source node gets RERR to form the
predecessor and counts the number of dropped RREQ
B. Specific Objectives message, because routing table is updated continuously and
Specifically, the proposed work meets the following each node knows their neighbors, then route from source to
objectives. destination can be searched by another intermediate node.
 To modified DSR by adding a selfish node identifying
algorithm during routing path discovery. V. DEVELOPMENT ENVIRONMENT
 To simulate the proposed algorithm by adding it to
existing one A. Developing Ns2 Based Simulation
 Performance evaluation and, compare the proposed Implementation purpose we used different tools such
solution with recent modified DSR. as NS-2 (Network simulator version 2) TCL, and C++
programing language is used and others are described table 1
III. MODIFYING DYNAMIC SOURCE ROUTING and table 2.
PROTOCOL (DSR) DESCRIPTION
S. no. Name tools Purpose
The existed protocol does not hear/catch when a link 1. NS2.35 The main network simulation
failure occurs due to the misbehavior node, which drops a environment
packet. This study designs an algorithm that detects link
2. NSG2.1 Designing nodes and
failure on DSR protocol through direct observation of the
Generating .tcl code
behavior of a mobile node to each other. The new proposed
algorithm is patched in ns-2.35 within the existed DSR 3. Sublime text For OTCL and C++
protocol. The study presents the Implementation of the new 2.0.2 programming (.tcl, .cc, .h)
developed algorithm by modifying dsragent.cc, dsragent.h editor
files for route reply and route request function in NS2-35. 4. Nam.exe Simulation [network animation
)
IV. PSEUDO CODE OF PROPOSED ALGORISM 5. Cygwin To execute trace file (.tcl)
6. GNUPLOT Generating graphs
The proposed algorism that were implemented in the 5.2
modified dynamic source routing (DSR) protocol was 7. NetBeans To manipulate .tr file to
illustrated in the following pseudo code. (Java) 8.02 evaluate performance metrics
Table 1
Input: Total Number of Nodes Val (nn), node (i)
intermediate node B. Simulation Setup And Settings

Output: Routing handover procedure to simulate link status: Parameter Value

Set Source Node: S // Source Nodes
Simulator tool Network simulator 2
Set Destination Node: D // Destination Node (NS-2)
For i 0 to Val (nn) Simulation Area 800 X 800
# Discover the routing table
If val (nn) sends Hello message Number of Nodes 20
Then val (nn) stores network information. Packet size 512byte
If S sends RREQ message to D
If D is next to S Traffic type CBR(Constant Bit Rate)
Then S directly connected to D
Mobility RWP
Else if node (i) rebroadcast on behalf of S //intermediate
node Simulation time 150 sec
Then path is discovered
If S RERR Interference range 500
Then the path is not discovered
If RERR<=2 Antenna Omni antenna
Then S sends RREQ to val (nn) Table 2
Else node (i) node identifies as packet drop node #
RERR==3 node (i)

IJISRT20MAY880 www.ijisrt.com 1961

Volume 5, Issue 5, May – 2020 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
VI. RESULT AND DISCUSSION A. The Packet Delivery Ratio For Both New And Existing
Dsr
The result captured from the experimental activity in The following result were generated after executing the
case both parameters such as packet delivery ration and end- same tcl file in after and before modifying the DSR protocol
to-end packet delay. in NS2.35 within the files dsragent.cc and dsragent.h. The
researcher used the .tr file for evaluating the performance
metrics such as packet delivery ratio and packet delay.

Fig 5:- Before DSR algorism modification

Fig 2:- Number of nodes used for simulation designed on

NSG2.1

The screenshot image of tcl code is the sample code

written in sublime code editor.
Fig 6:- Final modified DSR packet delivery ration

Fig 3:- Sample tcl code screenshot

Fig 7:- Packet throughput in before and after the DSR

algorism modification

Fig 4:- Simulation of mobile node and their

IJISRT20MAY880 www.ijisrt.com 1962

Volume 5, Issue 5, May – 2020 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig 11:- The graph illustrates End to end packet delay in

comparative view of DSR protocols in before and after
Fig 8:- The graph illustrates the difference between the algorism modification
existing and new DSR protocol related with packet delivery
ration. VII. CONCLUSION

B. End To End Delay Of New And Existing Dsr Protocol In this research work, we planned to enhance the
End-to-end Delay: the average time taken by a data performance of DSR protocol by modifying the algorism by
packet to arrive in the destination. It also includes the delay using the simulation tool (NS2.35) to test the metrics in
caused by route discovery process and the queue in data order to check how far the difference recognized. We
packet transmission. Only the data packets that successfully implemented and tested the algorism with simple MANET
delivered to destinations that counted. network simulation with 20 nodes within 150sec; the
parameters such as packet delivery ratio and end-to-end
∑ ( arrive time – send time ) / ∑ Number of connections packet delay were evaluated and achieved promising output.
The lower value of end to end delay means the better Finally this research will be recommended to be used by
performance of the protocol. future research work which may based from this outputs.

The researcher considered the second performance REFERENCES

evaluation parameter which is end to end packet delay and
the result were illustrated the graph below. [1] S. Z. B. Sadiya Mirza1, "INTRODUCTION TO
MANET," pp. 17-20, 2018.
[2] R. Chau, "MANET’s routing with prediction," 2012.
[3] G. Nair and N. J. R. Muniraj, "Prediction based Link
Stability Scheme for Mobile Adhoc Networks,," IJCSI
International Journal of Computer Science Issues,
Vols. , vol. 9, no. 6, pp. pp. 401–408,, 2012.
[4] J. J. J. a. Shivashankar, " Energy Efficient Routing
Protocol Based On DSR,” S," ri Venkateshwara
College of Engineering, VTU, Bangalore, India,, Vols.
vol.7, no.5, , 2016.
[5] S. I. M. J. H. S. H. Mohammed Humayun Kabir,
Fig 9:- New DSR end-to-end packet delay "Detail Comparison of Network Simulators," pp. 1-16,
2014.
[6] L. Q. a. T. Kunz, "Increasing Packet Delivery Ratio in
DSR by link prediction," IEE proceeding of 36th
hawaii International conference on system science, pp.
5-6, 2002.
[7] M. Y. a. X. Z. Haojun Yang, "Link Available Time
Prediction Based GPSR for Vehicular Ad Hoc
Networks," 2017.
[8] Y. e. al, "Improving Routun performance in AODV
witk link prediction in mobile adhoc network," 2015.
Fig 10:- Existing DSR end-to-end packet delay
[9] K. G. P. a. A. Unnikrishnan, "Fuzzy Decision-Based
Reliable Link Prediction Routing in MANET Using
Belief Propagation," 2018.

IJISRT20MAY880 www.ijisrt.com 1963

Volume 5, Issue 5, May – 2020 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
[10] M. T. a. M. T. C.Priyadharshini, "Predicting Route
Lifetime for Maximizing Network Lifetime in
MANET," ACS-International Journal in Computational
Intelligence, Vols. Vol-3,Issue-1, Mar 2012. .
[11] P. S. a. D. K. Lobiyal, "DSR with link prediction using
Pareto distribution," Prashant Singh and D. K. Lobiyal,
“DSR with link pre IEEE International Conference on
Networking and Information Technology , vol. pp.
29−33 , 2010. .
[12] M. R. Geetanjali Sharma1, "Advancement in Dynamic
Source Routing Protocol for MANETs," , International
Journal of Computer Science and Mobile Computing,,
vol. Vol.3 Issue.5, pp. pg. 428-433 , 2014.
[13] Buchegger and J. L. Boudec, "“Performance analysis of
the confidant protocol: (cooperative of nodes - fairness
in dynamic ad hoc networks),” in Proc.,," IEEE/ACM
Workshop on (MobiHoc’02), vol. pp. 226–336. , 2002, .
[14] S. J. G. Golsum Najafia, "A Stable Routing Protocol
based on DSR Protocol for Mobile Ad Hoc Networks,"
Wireless and Microwave Technologies, vol. 3, pp. 14-
22, 2018.
[15] P. a. A.Unnikrishma, "Enhancing the performance of
Routing protocol in MANET by predicting the link
availablity through belief propagation," 2017.
[16] K. Z. a. A. S. Ismail, ", “Route Maintenance Approach
for Link Breakage Predicttion in Mobile Ad-hoc
Networks," ,” International Journal of Advanced
Computer Science and Applications, , Vols. vol. 2, no.
10, , pp. pp. 23–30,, 2011. .

IJISRT20MAY880 www.ijisrt.com 1964