Comparative Study of AODV, SAODV, DSDV and AOMDV Routing Protocols in MANET Using NS2

International Conference on Computing and Intelligence Systems
Pages: 1174 1180
Volume: 04, Special Issue: March 2015

ISSN: 2278-2397
Comparative Study of AODV, SAODV,

DSDV and AOMDV Routing Protocols in
MANET Using NS2
M.Manjunath1, D.H. Manjaiah2
1
Research Scholar, Dept. of Computer Science, Mangalore University, Mangalore, India

Professor, Dept. of Computer Science, Mangalore University, Mangalore, India
Email: manjunath_bnglore@yahoo.co.in, drmdh2014@gmail.com
AbstractMobile ad hoc network is a collection

of dynamic node which temporary connect and
leave the network at any time. In Manet, there is
no centralized or router, each mobile node must
act as router and host at the same time. Due to
node high mobility, the topology between two end
nodes changes frequently. This paper analysis the
performance of routing protocols (AODV,
SAODV, DSDV and AOMDV) for different
scenarios using Network Simulator 2 and
provides the comparisons with different network
parameter (Packet Delivery Fraction, End to End
Delay, Throughput, Overhead and Energy)
between them.
situations, thus Manet is considered as one of the

emerging research area.
The remaining part of this research article is
organized as follows. Section 2 describes the brief
introduction of AODV, SAODV, DSDV and
AOMDV routing protocols. Section 3 the Simulation
results and comparison. Finally conclusion and
acknowledgement of report is described at the end of
the report
KeywordsMANET; AODV; SAODV; DSDV;

AOMDV; routing
Ad hoc On Demand Distance Vector (AODV) [5]

is a reactive routing protocol enables dynamic, selfstarting, multi hop mobile nodes routing wishing to
establish and maintain ad hoc network. AODV allows
mobile nodes to obtain routes quickly and respond to
link breakages and changes in the network topology.
AODV uses destination sequence number for each
routes entry and contains four different packets
HELLO, Route Request (RREQ), Route Reply
(RREP), and Route Error (RERR). These control
messages (packets) are received via UDP and normal
IP header processing.
I. INTRODUCTION
Mobile ad hoc network (MANET) [1] is a self

configuring, infrastructure less, multi-hop wireless ad
hoc network. Each device is dynamic in nature and
moves independently in any direction and therefore
changes its link to other device frequently [2]. When
source wants a communication channel to transfer
data for destination, source does not have direct path.
Source need to rely on multiple intermediate nodes
for traversing data packets to reach destination. Thus,
searching for and quickly establishing a route from a
source to a destination node is an important issue for
MANETs [3]. Due to dynamic nature of the mobile,
routing for such situation is a challenging task [4] [5]
[6]. There are verities of routing protocols for
MANETs such as AODV [7], SAODV [8], DSR [9],
AOMDV [10], Flow state in the dynamic source
routing
[11],
Power-Aware
DSR-Based[12],
DSDV[13], SDSDV [14], HOPNET [15], SARA [16]
etc, but none of them suites for all the scenarios.
Since In recent days, the MANET have experienced a
boom growth in popularity because it can provide
instant wireless networking solution where no predeployed infrastructure exists [17]. A significant
number of research efforts have been devoted to
investigate Mobile Ad Hoc Networks (MANETs)
over the past few years [18] [19] [20]. Since, there is
no single routing protocol that situates for all
International Journal of Computing Algorithm (IJCOA)
II. ROTING PROTOCOLS FOR MOBILE AD HOC

NETWORK
A.Ad hoc On Demand Distance Vector (AODV)
Fig. 1 RREQ propagation of AODV routing protocol.
1174

Pages: 1174 1180
When a source nodes wish to determine a route to a
destination node. It broadcasts a route request
(RREQ) packet to all its neighboring nodes with
packet id and the destination sequence number. The
RREQ packet is flooded through the network through
the neighboring nodes until it reaches the destination
nodes. Once the destination receives the RREQ, the
destination node reply with RREP packet back
through the source node through the neighboring
nodes as updated in the routing table by each mobile
node. The Fig 1 and Fig 2 systematically depict the
RREQ and RREP packets propagation mechanism of
AODV routing protocols. Upon the reception of
RREP packet, the source node starts transmitting data
to the destination node with minimal hop count.

ISSN: 2278-2397
a. Identification of Activity area

b. Identification of Representative nodes and
c. Routing process.
Fig. 4 RREP propagation of SAODV routing protocol
Fig. 2 RREP propagation of AODV routing protocol
SAODV uses of route request (RREQ), route

reply (RREP) packets for identifying routes between
end nodes and uses HELLO message to detect the
broken link between the neighboring nodes. In
SAODV, when source needs a communication
channel for transmitting data or require a path to
destination, it identifies the activity area and
representative node and non representative node in
the network and eliminates the redundant node
during the routing process. The Fig 3 and Fig 4
systematically depict the RREQ and RREP packets
propagation mechanism of SAODV routing
protocols. Once the source node receive the RREP
packet, data communication between source node
and destination begins with minimal hop count as
described in AODV routing protocol.
C.Destination-Sequenced Distance Vector (DSDV)
Fig. 3 RREP propagation of SAODV routing protocol

B. Spatial Ad hoc On demand Distance Vector
(SAODV)
Spatial Ad hoc On demand Distance Vector
(SAODV) [5] is a reactive and improved version of
Ad hoc On Demand Distance Vector routing
protocol. Spatial AODV (SAODV) routing protocol
allows the source node to identify the route quickly
to destination by eliminating redundant node that
participated during the route discovery process.
Spatial AODV routing protocol consist of 3 phases
Destination Sequenced Distance Vector (DSDV)

[11] is a proactive routing protocol design for
mobile ad hoc network (MANET). Since DSDV is
proactive routing protocol, every node maintain list
of all destination and number of hops to each
destination. DSDV uses bellman ford routing
technique for solving routing loops and to find
shortest, optimal path between two source and
destination node. In DSDV, each node maintains
routing table (all possible destinations within
network, and number of routing hops to each
destination) and uses sequence number to
distinguish the stale route from new one in the
network. Each entry in the routing table contains a
sequence number, the sequence numbers are
generally even if a link is present else an odd
number is used. These routing tables are advertises
route update periodically which consists of two
types.
a. Full Dump
b. Incremental Packets
1175

Pages: 1174 1180
Since node advertises route update packet
periodically, DSDV maintains route which are never
used and increases the traffic overhead even for no
change in the network topology, but make immediate
route advertisement on significant changes in routing
table. Fig 5 shows the network diagram and Table 1
presents the routing table for node S to all possible
destinations in the network.

ISSN: 2278-2397
Since RREQ is flooded network-wide, a node may

receive multiple copies of the same RREQ packets.
The multiple copies of RREQ are used to form
alternate reverse path for establishing route to
destination.
Fig. 6 Routing table entry structure of AOMDV

protocol
Fig. 5 Network Diagram

Table 1 Routing Table for Node S
Destination
Next
Hop
Metric
S
1
2
3
4
5
6
7
8
D
0
1
2
2
1
4
4
5
7
6
0
1
1
2
2
3
3
4
5
4
Destination
Sequence
number
106
206
268
168
204
96
384
26
562
364
D. Ad Hoc On Demand Multipath Distance Vector

(AOMDV)
Ad hoc On Demand Multipath Distance Vector
(AOMDV) [8] is a multipath routing protocol for
mobile ad hoc networks. AOMDV is an extension of
AODV routing protocol which grantees LOOP
freedom and disjointness of alternate paths. AOMDV
is based on distance vector concept and share several
same characteristics with AODV. The Main
difference of AOMDV with AODV is, the route
request (RREQ) propagation form source toward the
destination for establishes multiple reverse paths for
both at intermediate node and for destination node.
The AOMDV routing protocol consist of route
discovery phase and route maintenance phases. As in
AODV, when a source need a path to destination
node, the source initiate route discovery process by
flooding RREQ in the network.
The node which receives RREQ update the routing

table, set reverse path and rebroadcast the RREQ
packet to next neighboring node in the network. The
Fig. 6 shows the routing table entries of AOMDV
routing protocol respectivly. Once the RREQ reaches
destination, the destination node reply with RREP
packet through minimal hop count and source start
transmiiting data to destination node through the
intermediate nodes as updated in routing table.
Table 2 Simulation Parameters
Channel
Channel/wireless
Mobility Model
Random way point
Network interface
wireless
NS2 version
NS2.35
Interface queue
Drop Tail
No. of nodes
15, 30, 50, 75, 100, 150
Simulation area size
1000 x 1000 m
Transmission Range
250 m
Simulation Time
160s
Data packet size
512 bytes
Initial node energy
100 J
VI. SIMULATION SETUP AND ANALYSIS

Extension simulations were conducted using NS 2.35
[21] while the implementation of AODV, AOMDV,
DSDV routing is provided by [21]. However,
SAODV is implementation is provided by [8]. A
network is loaded with moving nodes and consists of
15, 30, 50, 75, 100 and 150 mobile nodes placed
randomly in 1000 X 1000 area. The simulation is
carried for 160 seconds and nodes move with a speed
1176

Pages: 1174 1180
f 0 m/s to 10 m/s. the exact values and some different
parameter used for simulation is described at Table 2.
All the simulations show the required results. Under
each simulation, we check the behavior of AODV,
SAODV, DSDV and AOMDV. The Table 3, Table 4,
Table 5 and Table 6 presents the simulation results of
AODV, SAODV, DSDV and AOMDV respectively.
We get multiple graphs from simulations like first we
get for the avg. of packet generated by source, second
is for the avg. of packet received by destination, third
one is for the avg. packet delivery fraction (PDF),
Fourth for the avg. of end to end delay, fifth for the
avg. throughput, sixth for the avg. overhead occurred
in the network and seventh for avg. energy consumed
by the nodes. Hence, the main goal of our simulation
was to model the behavior of the routing protocols.
The Fig. 7 and Fig. 8 represent the average number of
packet sent and received by AODV, SAODV, DSDV
and AOMDV. In the above experiment we found that,
as the network size increases the number of packet
received by destination decreases. This is because,
packets has to traverse multiple nodes and multiple
links during data transmission to reach destination.
From the experiment, the avg. packet received was
higher for AOMDV protocol.

ISSN: 2278-2397
Fig. 9 The average PDF
Fig. 10 The Avg. Delay
Fig. 7 The Average Packet generated by Source
Fig. 11 The Average Overhead
Fig. 12 The Average Consumed Energy

Fig. 8 The Average Packet Received by Destination
1177

Pages: 1174 1180

ISSN: 2278-2397
The Fig. 12 represents the average energy consumed by node during data communication. We can clearly say
that, as the network increases, the average energy consumed decreases. From the graph of Fig. 11 AODV
consumes less amount of energy with comparison of SAODV, DSDV and AOMDV but SAODV consumes
lesser than DSDV but higher than AODV and AOMDV.
The Fig 13 provides the throughput statistics of AODV, SAODV, DSDV and AOMDV. It was clear from that
SAODV provide more throughput when compare to AODV, DSDV and AOMDV routing algorithm.
S AODV provide more throughput when compare to AODV, DSDV and AOMDV routing algorithm.
Networ
k size
Packet Sent
Packet
received
15
5017
4578
Table 3 Simulation Results of AODV

Throughp
Delay
PDF
ut
(ms)
(kbps)
0.9125
163.21
121.72
30
4519
4041
0.8942
158.572
110.84
50
4540
4066
0.8956
150.093
75
4003
3589
0.8966
161.423
100
150
TOTA
L
3893
3403
3467
3019
0.8906
0.8872
25375
22760
4229.1666
67
3793.3333
33
AVG
Overhead
Energy
Consumed
Average
Energy
1.557
429
28.6
3.936
278
9.266
108.68
5.342
292
5.84
96.80
8.399
279
3.72
199.449
174.196
97.91
82.32
11.092
17.403
123
287
1.23
1.1913
5.3767
1006.943
618.27
47.729
1688
49.8473
0.8961166
67
167.82383
33
103.045
7.9548333
33
281.33333
33
8.3078833
33
Table 4 Simulation Results of SAODV

Networ
k size
15
30
50
75
100
150
TOTA
L
AVG
Network
size
15
30
50
75
100
150
TOTAL
AVG
Packet Sent
Packet
received
PDF
Delay
(ms)
Throughput
(kbps)
Overhead
Energy
Consumed
Average
Energy
5397
3916
5492
3586
5485
3870
4978
3504
4971
3226
4758
3435
0.9224
0.8948
0.9051
0.8996
0.8675
0.8876
158.565
154.868
144.701
161.252
157.61
158.026
131.70
95.86
133.48
109.20
132.55
94.88
1.074
3.116
2.790
4.819
5.002
9.664
432
267
288
285
296
238
28.8
8.9
5.76
3.8
2.96
1.586
27746
24872
5.377
935.022
697.67
26.465
1806
51.806
4624.33333
3
4145.33333
3
4.41083333
3
301
8.63433
3333
Packet Sent
3517
2774
2177
2963
998
1702
14131
2355.16666
7
Packet
received
3303
2619
2025
2751
914
1531
13143
2190.5
0.89616666
116.278333
155.837
7
3
Table 5 Simulation Results of DSDV
PDF
0.9392
0.9441
0.9302
0.9285
0.915
0.8995
5.5565
0.92608333
3
Delay
(ms)
Throughput
(kbps)
167.616
183.816
146.701
160.842
210.655
272.476
1142.106
125.33
123.74
127.91
117.27
48.90
100.28
643.43
107.238333
3
190.351
0.168
0490
1.187
1.394
6.835
7.053
17.127
Energ
y
Consu
med
447
281
247
265
288
161
1689
2.8545
281.5
Overhead
Average
Energy
29.8
9.366
4.94
3.5
2.88
1.073
51.559
8.59316666
7
1178

Pages: 1174 1180

ISSN: 2278-2397
Table 6 Simulation Results of AOMDV

Network
size
Packet Sent
Packet
received
PDF
Delay
(ms)
Throughput
(kbps)
Overhea
d
Energy
Consumed
Average
Energy
15
30
50
75
100
150
TOTAL
5516
4768
4522
4583
4173
4205
27767
5195
4438
4249
4296
3877
3855
25910
0.9418
0.9308
0.9396
0.9374
0.9291
0.9168
5.5955
159.574
172.063
224.969
182.994
188.665
210.547
1138.812
136.95
118.88
112.16
114.23
103.02
104.87
690.11
1.009
2.152
3.797
5.793
8.393
12.150
33.294
437
282
288
288
247
251
1793
AVG
4627.833333
4318.333333
0.932583333
189.802
115.0183333
5.549
298.8333333
29.133
9.4
5.76
3.84
2.47
1.673
52.276
8.712666
667
Fig. 13 The Average Throughput

V. CONCLUSION
This research article describes the comparative
study of AODV, SAODV, DSDV and AOMDV
routing protocol for different network scenarios
based on packet delivery fraction, end to end delay,
throughput and overheads. The simulation is carried
for different network size and only the average
value is considered for each simulation test. From
the simulation results it is observed that, AODV
provides the better performance by consuming
fewer amount of energy but provide higher
overhead when compare to SAODV, DSDV and
AOMDV. SAODV offers lower delay and also
provide higher throughput when compare to
AODV, DSDV and AOMDV. DSDV routing
protocol offer lower overhead with respect to
AODV, SAODV and AOMDV. We have also seen
that AOMDV is best in terms of packet delivery
fraction but consumes higher energy when compare
to AODV, SAODV and AOMDV.
ACKNOWLEDGMENT
The authors wishes thanks to UGC, Indian
government, for providing funding support under
Rajiv Gandhi National Fellowship (RGNF) scheme
Ref.No.
F1-17.1/2012-13/RGNF-2012-13-SCKAR-17563/ (SAIII/Website) dated February 28,
2013. Thanks also go to the dedicated research
group in the area of Computer Networking at the
Dept of Computer Science, Mangalore University,
Mangalore, India. Lastly but not least the author

would like to thank everyone, including the
anonymous reviewers.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
Giordano, Silvia. "Mobile ad hoc networks." Handbook of

wireless networks and mobile computing (2002): 325-346.
Frey, Michael, Friedrich Grose, and Mesut Gunes.
"Energy-aware ant routing in wireless multi-hop
networks." Communications (ICC), 2014 IEEE
International Conference on. IEEE, 2014.
Singh, Gurpreet, Neeraj Kumar, and Anil Kumar Verma.
"ANTALG: An Innovative ACO based Routing Algorithm
for MANETs." Journal of Network and Computer
Applications 45 (2014): 151-167.
Chatterjee, Shubhajeet, and Swagatam Das. "Ant colony
optimization based enhanced dynamic source routing
algorithm for mobile Ad-hoc network."Information
Sciences 295 (2015): 67-90.
Tarique, Mohammed, et al. "Survey of multipath routing
protocols for mobile ad hoc networks." Journal of Network
and Computer Applications 32.6 (2009): 1125-1143
Singh, Gurpreet, Neeraj Kumar, and Anil Kumar Verma.
"Ant colony algorithms in MANETs: A review." Journal
of Network and Computer Applications 35.6 (2012): 19641972.
C. Perkins, E. Belding-Royer, and S. Das, Ad hoc OnDemand Distance Vector (AODV) Routing, Internet
RFCs, vol. 285. pp. 138, 2003.
M.Manjunath, Manjaiah D H, Spatial AODV (S
AODV) Routing Algorithm for Mobile Ad Hoc
Network, August - 2014, Elsevier Publications, ISBN:
978935 1072638. pp. 799 -804.
1179

Pages: 1174 1180
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]

ISSN: 2278-2397
Johnson, D., Y. Hu, and D. Maltz. The dynamic source

routing protocol (DSR) for mobile ad hoc networks for
IPv4. RFC 4728, February, 2007.
Marina, Mahesh K., and Samir R. Das. "On-demand
multipath distance vector routing in ad hoc
networks." Network Protocols, 2001. Ninth International
Conference on. IEEE, 2001.
Yih-Chun Hu, David B. Johnson, David A. Maltz: Flow
State in the Dynamic Source Routing Protocol Internet
Draft, work in progress, June 2001.
D. Djenouri, N. Badache. On Eliminating Packet
Droppers in MANET: A Modular Solution, Ad hoc
Networks Journal, Vol 7, Issue 6, pp 12431258, Elsevier
Publisher, August 2009.
Perkins, Charles E., and Pravin Bhagwat. "Highly dynamic
destination-sequenced distance-vector routing (DSDV) for
mobile
computers." ACM
SIGCOMM
Computer
Communication Review. Vol. 24. No. 4. ACM, 1994.
M. Manjunath, Manjaiah D H, Spatial DSDV (S-DSDV)
Routing Algorithm for Mobile Ad Hoc Network
,International Conference on Contemporary Computing
and Informatics, [IC3I - 2014] IEEE , 27th - 29th
November. 2014, Sri S.J.College of Engg., [SJCE],
Mysore. ISBN: 978-4799-6629-5. pp. 625 - 629.
Wang, Jianping, et al. "HOPNET: A hybrid ant colony
optimization routing algorithm for mobile ad hoc
network." Ad Hoc Networks 7.4 (2009): 690-705.
Correia, Fernando, and Teresa Vazo. "Simple ant routing
algorithm strategies for a (Multipurpose) MANET
model." Ad Hoc Networks 8.8 (2010): 810-823.
Aissani, Mohamed, et al. "Ant-DSR: cache maintenance
based
routing
protocol
for
mobile
ad-hoc
networks." Telecommunications, 2007. AICT 2007. The
Third Advanced International Conference on. IEEE, 2007.
Mohseni, Shima, et al. "Comparative review study of
reactive
and
proactive
routing
protocols
in
MANETs." Digital Ecosystems and Technologies (DEST),
2010 4th IEEE International Conference on. IEEE, 2010.
Karthikeyan, D., and M. Dharmalingam. "Ant based
intelligent routing protocol for MANET." Pattern
Recognition, Informatics and Mobile Engineering
(PRIME), 2013 International Conference on. IEEE, 2013.
Moussaoui, Ali, and Abdallah Boukeream. "A survey of
routing protocols based on link-stability in mobile ad hoc
networks." Journal of Network and Computer Applications
47 (2015): 1-10.
Simulator, Network. "ns-2." (1989).
1180

Comparative Study of AODV, SAODV, DSDV and AOMDV Routing Protocols in MANET Using NS2

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Comparative Study of AODV, SAODV, DSDV and AOMDV Routing Protocols in MANET Using NS2

Hochgeladen von

Copyright:

Verfügbare Formate

International Conference on Computing and Intelligence Systems

Pages: 1174 1180

Volume: 04, Special Issue: March 2015