Sagar S.
Mahajan et al, IJRCCT, Vol 5, Issue- 4, April- 2016 ISSN (Online) 2278- 5841
Delay Analysis of AODV Routing Protocol
Sagar S. Mahajan, Nikhil S. Rane, Prasad R. Sonawane, Manisha R. Rajput
Savitribai Phule Pune University
Abstract: MANET is a mobile ad-hoc network. It is an
infrastructure less communication network through
which we can send the information from source to
destination in the form of packets using different
routing protocols. There are different type of protocols
like AODV (Ad-hoc on demand distance vector), DSR
(Dynamic Source Routing) and DSDV (Destination
Sequenced Distance Vector).While sending the
information from source to destination there are
different parameters which have to be considered like
delay, packet loss, throughput etc. Out of the three
protocols named above AODV is the best routing
protocol. In this paper we have discussed about
MANET, AODV protocol and improvement in AODV
protocol to reduce the delay and packet loss.
Keywords: MANET, AODV, DSR, DSDV, NS2.
I. INTRODOUCTION
MANET is a wireless network in which information is
send using multi-hoping, packets are send from one to
another node till the information reaches to the
destination node. Information is divided into packets
and each packet contains a sequence number and
destination address. There are some major issues faced
by the Ad-hoc network as follows:
 Routing
 Medium access scheme
 Energy Management
 Security
 Multicasting
 Scalability
This paper is related to AODV routing protocol
and to calculate delay parameter of AODV routing
protocol. There are different routing protocols are used
and they are classified as follows:
A. Proactive Routing Protocol:
ISSN (Print) 2320- 5156
In proactive routing protocol each node in the
network maintains a routing table which contains the
information like all available destinations, no. of hopes
to reach to the destination, next hop etc.
B. Reactive Routing Protocol:
In reactive routing protocol route is discovered only
when the node wants to send information to another
node.
C. Hybrid Routing Protocol:
In hybrid routing protocol advantages of proactive
and reactive routing protocols are present [2].
End-to-end Delay: The average time taken by a data
packet to arrive in the destination. It also includes the
delay caused by route discovery process and the queue
in data packet transmission. Only the data packets that
successfully delivered to destinations are counted.
Packet Loss: Packet loss is nothing loss of packets
while sending the packets from source to destination
due to congestion or some other reason.
The routing protocols are implemented using NS2
(Network Simulator). NS2 is a simulator tool by which
we can simulate various network models and can
analyze their performance, along with NS2 another tool
NAM (Network Animator) is used to create node, to see
how the information is actually transferred, and to see
the node movements. NS2 is a free open source
available program.
II. AODV ROUTING PROTOCOL
AODV is ad-hoc on demand distance vector routing
protocol. It is reactive type of routing protocol in which
route is discovered only when a node wants to send
information to other node. AODV protocol is used to
©www.ijrcct.org | 200
send information from one node to another node which
are mobile i.e. they can move from their positions.
There are two major steps through which data can be
transferred and those steps are Route Discovery and
Route maintenance.
AODV uses three types of messages Route Error
(RERR), Route Reply (RREP), Route Request(RREQ).
Route request message is generated by the source node
and it broadcasts the RREQ message to all the
neighboring nodes and the neighboring nodes forward
this message to other nodes till it reaches to the
destination node. When any intermediate node receives
the packet from any of its neighboring nodes, it copies
the address of that node before forwarding the message
to other node thus creating a reverse path.
When a RREQ message reaches its destination then it
generates RREP message and unicast it to the source
node by the reverse path generated while forwarding the
RREQ message. If the intermediate nodes move from
their positions then they generate the RERR message
and forward it to the neighboring nodes, when the
message reaches to the source and destination node they
can either stop sending the information or can create a
new route. HELLO messages are also used by the nodes
to check if its neighbor nodes are present in its
transmission range or not, if the neighbor node do not
give any reply it means that it has moved to some
another position [1].
III. RELATED WORK
There are many parameters based on which
performance of AODV routing protocol can be judged.
Some of the parameters are end to end delay, packet
loss, throughput, bandwidth requirement etc. Many
researchers are trying to improve those parameters and
have proposed different routing protocols Ashutosh
Lanjewar and Neelesh Gupta [1] evaluated parameters
of AODV protocol such as cost, end to end delay,
network load, and packet loss.
They observed that as the number of nodes increases the
new advanced AODV performs better than AODV and
yields better throughput level with less delay and
consumes less energy. Patil V.P [2] implemented a new
protocol Enhanced-ADOV (EAODV) which is a
modified version of AODV with enhanced packet
delivery ratio and minimizes end to end delay.
J. Premalatha and P. Balasubramanie [4] enhance the
quality of service by effective routing. They improve
quality of service parameters like throughput by 15-
20%, 40-45% improvement in bandwidth-delay
product; 10-15% improvement in delivery ratio, packet
loss is reduced drastically to 40-50%. N Thanthry, S R
Kaki, and R Pendse [5] proposed metric based
enhancement to AODV routing protocol (EM-AODV).
They observed that with high transmission range the
average throughput or the packet delivery ratio
increased, percentage of packet loss is also decreased,
and also the end to end delay decreased compared to
small transmission range. The performance of EM-
AODV in terms of average energy consumption was
more or less identical to AODV even when the
transmission range was high.
IV. PROPOSED WORK
In this section a new improved AODV protocol is
proposed with less delay and packet loss compared to
AODV. In AODV packets are send through same route
also when the congestion occurs on intermediate nodes
which are part of the route i.e. it do not changes the
route when congestion occurs and hence the packet loss
and delay increases. Congestion is condition when a
network node carries more data that it can handle and
effects of it include loss of packets and increase in
delay.
The new improved AODV protocol changes its route
when congestion occurs on the intermediate nodes by
calculating Euclidean distance between the nodes and
then finding a new route to send the packets. As the new
improved AODV changes the route when congestion
occurs, the packet loss and delay to send the packet
reduces. 50 nodes are used to perform the simulation
with the help of network simulator 2 (NS-2) tool.
To calculate the delay and packet loss of a network
trace file can be used. In trace file all the events which
have happened in the network are recorded and it is
generated when we configure the nodes in tcl (tool
command language) file. A small line of code is used in
tcl file to generate the tcl file. The simulation of the
network is shown with the help of network animator
(NAM).
V. SIMULATIONS AND RESULT
A network of 50 nodes is created and is simulated using
both AODV and new improved AODV protocol. Delay
and packet loss for both the protocols is calculated.
Graph is plotted to compare the performance of both the
protocols with the help of xgraph.
The network parameters are as given below in the table
1:
©www.ijrcct.org | 201
Routing protocol AODV
Number of nodes 50
MAC type IEEE 802.11
Packet size 812
Area 1407 * 832
Simulation tool NS-2.35
Table 1 – Simulation Parameters
Simulation is carried in the area of 1407 * 832 with the
help of ns2. Packets of size 812 bytes are send from
source to and destination.
As shown in fig. 1 graph of delay vs. simulation time
for both the protocols is plotted. The red curve is for
AODV protocol and the green curve is for new
improved AODV protocol. The delay for different
simulation times is calculated and as shown new
improved AODV as less delay than AODV.
Fig .1 Graph of comparison between delay of AODV
and new improved AODV.
As shown in fig. 2 graph of packet loss vs. simulation
time is plotted. As shown the packet loss which occur in
new improved AODV is much lesser than AODV
protocol. The packet loss for AODV protocol increases
with increase in simulation time but for the new
improved AODV it decreases with increase in
simulation time.
Fig .2 Graph of comparison between delay of AODV
and new improved AODV.
VI. CONCLUSION
Information about MANET, AODV protocol and its
working is given. Performance of AODV and new
improved AODV protocol is evaluated with help
performance parameters like delay and packet loss.
Comparison of both the protocols is done using the
same parameters. Future improvement in AODV
protocol can be done by improving other parameters
like bandwidth, energy consumption etc.
VII. REFERENCES
[1] Ashutosh Lanjewar and Neelesh Gupta, “
Optimizing Cost, Delay, Packet Loss and Network Load
in AODV Routing Protocol” International Journal of
Computer Science and Information Security, No. 4, Vol.
11, April 2013, Page no. 66-71
[2] V.P.PATIL “Efficient AODV Routing Protocol for
MANET with enhanced packet delivery ratio and
minimized end to end delay” International Journal of
Scientific and Research Publications, Issue 8, Volume
2, August 2012, ISSN [2250-3153], Pages 1-6.
[3] Jia Liu, Min Sheng, “End-to-end Delay Modelling
in Buffer-Limited MANETs: A General Theoretical
Framework” IEEE Transactions on Wireless
Communications, 2015, Digital Object
Identifier:10.1109/TWC.2015.2475258, IEEE
Transactions on Wireless Communications, Pages 1-13.
©www.ijrcct.org | 202
[4] J. Premalatha and P. Balasubramanie
“Enhancing Quality of Service in MANETS by
Effective Routing” International Conference onWireless
Communication and Sensor Computing, 2010, Digital
Object Identifier: 10.1109/ICWCSC.2010.5415878, 2-4
Jan. 2010, Pages 1-13.

[5] N Thanthry, S R Kaki, and R Pendse “EM-AODV:

METRIC BASED ENHANCEMENT TO AODV
ROUTING PROTOCOL” Vehicular Technology
Conference, 2006. VTC-2006, Digital Object
Identifier: 10.1109/VTCF.2006.534, 25-28 Sept. 2006,
Pages 1-5.

[6] www.isi.edu/nsnam/ns/tutorial

©www.ijrcct.org | 203