Simulation in AODV and DSR
492516207
邱朝螢
1
Outline





Review DSR and AODV
Simulation Environment
Simulation Graph
Simulation Result
Conclusion
2
DSR Route Discovery
[A,G,ID,ABE]
[A,G,ID,AB]
[A,G,ID,A]
B
E
G
Source A forward
data to destination G
[A,G,ID,AC]
A
C
F
H
Node E drop the
packet because it has
forward the same ID
packet
D
3
DSR Route Reply
[A,B,E]
[A,B,E]
A
B
[A,B,E]
E
G
[A,B,E]
Node A stores the route
from A to G in its route
cache
C
F
H
D
4
AODV Route Discovery
Source A forward
data to destination G
B
A
E
G
A broadcast RREQ
sets up a reverse
path
C
F
H
D
5
AODV Route Discovery
B
A
E
G
F
H
C
D
6
AODV Route Discovery
B
A
E
G
F
H
C
D
7
AODV Route RREP
<source_addr , broadcast_id>

B
A
E
G
F
H
C
D
8
DSR vs AODV

Difference



Cache and Table
DSR forward greater packets than AODV
AODV periodically forward Hello Message to
neighbors , DSR not.
9
Simulation Environment

Software



OS


Linux-Red hat 7.3
CPU


NS2
Version:2.1b9a
P3 900
Memory

128MB
10
Simulation Environment

Simulation Range


Number of node in the range


1500*300 meters
Random creating 50 nodes
Number of source node in the range


Random 20 sources
Random 40 sources
11
Simulation Environment

Node radio range


Traffic source


250 meters
CBR (Content Bit-Rate)
Node radio bandwidth

2Mb/sec
12
Simulation Environment

Packet Length


Node Buffer


512 byte
100
Node speed

0~20 meter/sec
13
Simulation Environment



Random create 50 nodes in 1500*300
meters
Random select 20(40) nodes to deliver
packets
Each node starts its journey from a
random location to a random location
with a randomly chosen speed 0~20
m/s
14
Simulation Environment


Each node move in 50 seconds, then
move again after pause 20(40 or 60 or
80) seconds
Total Run Time: 300 seconds
15
Simulation of AODV
16
Simulation of AODV
17
Simulation of AODV
18
19
20
Performance Matrics

Throughput


The ratio of the data packets delivered to the
destinations to those generated by the CBR
sources.
received packets / sent packets
21
Throughput(20sources)
20 sources
Throughput
1
0.8
0.6
AODV
0.4
DSR
0.2
0
20
40
60
80
Pause Time (sec)
22
Throughput(40sources)
Throughput
40 sources
1.2
1
0.8
0.6
0.4
0.2
0
AODV
DSR
20
40
60
80
Pause Time (sec)
23
Performance Matrics

Average Delay

For each packet with id of trace level (AGT)
and type (CBR), calculate the send(s) time(s)
and the receive(r) time(t) and average it
24
Average Delay (20 sources)
Average Delay (sec)
20 sources
0.03
0.025
0.02
0.015
0.01
0.005
0
AODV
DSR
20
40
60
Pause Time (sec)
80
25
Average Delay (40 sources)
Average Delay (sec)
40 sources
0.03
0.025
0.02
0.015
0.01
0.005
0
AODV
DSR
20
40
60
80
Pause Time (sec)
26
Performance Matrics

Normalized Routing Overhead

Normalized routing load = (routing packets sent)
/ receives
27
Normalized Routing Overhead
(20 sources)
Routing Overhead
20 sources
0.5
0.4
0.3
AODV
0.2
DSR
0.1
0
20
40
60
Pause Time (sec)
80
28
Normalized Routing Overhead
(40 sources)
Routing Overhead
40 sources
0.6
0.5
0.4
0.3
0.2
0.1
0
AODV
DSR
20
40
60
80
Pause Time (sec)
29
Source Code
30
Trace File
31
32
Conclusion




DSR have triple numbers of control
messages than AODV
AODV has difficult when the nodes are
moving fast
AODV has the shortest end-to-end
delay
DSR has higher routing overhead than
AODV
33