Evaluation Study of Qos-Enabled Aodv
Evaluation Study of Qos-Enabled Aodv
Evaluation Study of Qos-Enabled Aodv
1255
Therefore, apart from the simulation which employs
NS-2 link detection by underlying MAC layer, we also
(C++) Results Traces simulate QoS-AODV approach which makes use of
HELLO messages as well as our proposed
Numerical Data enhancement. Table 2 summarizes the notations used
Simulation Scenario PERL/AWK along with brief descriptions of our studied protocols.
(OTcl)
Traffic Mobility
A. Effect of Number of Nodes
Pattern Pattern Studying the impact of varying number of nodes is
essential in order to test the applicability of the
protocols in large as well as small populations.
Figure 1. NS-2 simulations execution structure
1.00
0.98
V. RESULTS 0.96
0.94
0.92
TABLE 2. OVERVIEW OF THE SIMULATED PROTOCOLS
0.90
PDR
0.88
Maintenance 0.84
AODV-B-HELLO
Method 0.82 AODV-B-LL
0.80 AODV-BD
AODV-B- Minimum Link-Layer 0.78
LL Bandwidth Feedback 10 20 30 40 50
Num ber of Nodes
Extension
AODV-B- Minimum HELLO
HELLO Bandwidth Messages
Figure 2. Effect of number of nodes on PDR
Extension
AODV-BD Minimum Link-Layer From Figure 2, we could see that AODV-BD
Bandwidth Feedback achieves slightly higher value than AODV-B-LL while
Extension outperforms AODV-B-HELLO notably. This is due to
Maximum Delay additional control in allowing traffic through the delay
Extension guarantee along with bandwidth guarantee. Moreover,
along with increase of potential routes, there will also
Our implementation particularly refers to QoS- be more routes which could satisfy both bandwidth and
AODV proposal in [12] where the main idea is to delay guarantees alike.
provide extensions to AODV messages namely: With more nodes, there are more alternate routes
maximum delay and minimum bandwidth. In the QoS- that can be selected in order to reach the desired
AODV implementation in [7] (also referred in [12]), destinations which causing more packets to be
only minimum bandwidth field extension has been delivered, explaining the increase in ratio of packet
considered while issues involving delay guarantee has delivery.
not been addressed. Our highlighted contribution in Meanwhile, Figure 3 shows the effect of number of
this study is the implementation of maximum delay nodes on average end-to-end delay. Average latency
extension in addition to the existing minimum undergoes drastic drop until the simulation reaches the
bandwidth extension. In short, there are two QoS amount of 25 nodes. The reason is that with the
metrics which have been considered in this paper increase of potential paths which simultaneously leads
namely bandwidth and delay. to more connectivity; the packets are not required to
A method called sequential filtering is adopted for stay in the buffer for a longer period of time at the
our route computation purpose. The metrics are source.
classified as primary and secondary metrics, whereas As can be observed from both Figure 2 and Figure
the primary metrics are computed first and the 3, when the number of nodes becomes higher; PDR
elimination of the subsets are based on the secondary and average latency achieves almost constant values.
metric until the required route or path is found [14]. Irrespective of number of nodes, the optimum paths
1256
that have been found will be maintained. Accordingly, Figure 5. As mobility increases, more routes will
there will be no need of routes reestablishment thus not become invalid and new requests are required. While
affecting the average latency and ratio of delivered the requests are propagating the network in search for
packets. a new route, buffers will get full at the originating
node and packets are dropped. As can be noticed from
0 .0 6
Figure 5, AODV-B-LL receives more packets
compared to the other two protocols.
Average End-to-End Delay (seconds)
0 .0 5
0 .0 4 0.93 AODV-B-HELLO
0.92 AODV-B-LL
0.91 AODV-BD
0 .0 3 A O D V -B -H E L L O 0.90
A O D V -B -L L 0.89
A O D V -B D 0.88
0 .0 2 0.87
0.86
0.85
0.84
PDR
0 .0 1
0.83
0.82
10 20 30 40 50 0.81
N um ber of N odes 0.80
0.79
0.78
0.77
0.76
0.75
Figure 3. Effect of number of nodes on delay
5 10 15 20 25
Maximum Node Speed (m/s)
1 .1
1 .0 A O D V -B -H E L L O
0 .9
A O D V -B -L L
A O D V -B D
Figure 5. Effect of mobility on PDR
0 .8
Normalized Overhead
0 .7
0 .6
0 .5 0 .0 9 5
0 .4 0 .0 9 0
Average End-to-End Delay (seconds)
0 .0 8 5
0 .3
0 .0 8 0
0 .2
0 .0 7 5
0 .1
0 .0 7 0
0 .0 0 .0 6 5
10 20 30 40 50
0 .0 6 0
N um ber of N odes
0 .0 5 5
0 .0 5 0
0 .0 4 5 A O D V -B -H E L L O
Figure 4. Effect of number of nodes on overhead 0 .0 4 0
A O D V -B -L L
A O D V -B D
0 .0 3 5
1257
subsequent path reestablishment leads to higher end- the buffer for a longer time in order to have a chance to
to-end delay. get through. This long period of time caused the
increase in latency as can be seen from Figure 9.
AO D V -B -H E L L O
AO D V -B -L L
AO D V -B D 0 .9 5
0 .3 0
0 .9 0
0 .2 5
Normalized Overhead
0 .8 5
0 .2 0
0 .8 0
0 .1 5
0 .7 5
PDR
0 .1 0
0 .7 0
0 .0 5 0 .6 5 A O D V -B -H E L L O
A O D V -B -L L
0 .0 0 0 .6 0 A O D V -B D
5 10 15 20 25
M axim u m N o d e S p eed (m /s) 0 .5 5
5 10 15 20 25
T r a ffic L o a d (p a c k e t/s e c o n d )
0 .1 4
down stream nodes. The upstream nodes are nodes that
0 .1 2
transmit the packets to the moving node under 0 .1 0
consideration and the downstream nodes are those that 0 .0 8
receive packets from the moving node under 0 .0 6
consideration. In order to alert source nodes that there 0 .0 4
1258
values. This is because, the AODV routing packets are possible contributing factors could be due to additional
only sent during the route searching and maintenance restriction in finding the suitable QoS route as well as
periods without exchanging HELLO messages. The the consideration of bandwidth alone has the capability
low normalized overhead for both AODV-BD and to reduce delay though indirectly.
AODV-B-LL is shown in Figure 10. However,
AODV-BD’s normalized overhead is slightly higher REFERENCES
than AODV-B-LL due to additional restriction which [1] C.S.R. Murthy and B.S. Manoj: Ad Hoc Wireless Networks:
requires more control packets while establishing the Architectures and Protocols, Prentice Hall, (2004)
suitable route. [2] I. Jawhar, and J. Wu: Quality of Service Routing in Mobile Ad
Hoc Networks, in M Cardei, I Cardei & DZ Du (eds), Resource
Management and Wireless Networking, Kluwer Academic
VI. CONCLUSIONS Publishers.
Our experiments study the effect of number of [3] P. Stüdi: Quality of Service for Mobile Ad Hoc Networks,
Diploma Thesis, (2003)
mobile nodes, maximum node speed and traffic load [4] I. Gerasimov, and R. Simon: Bandwidth-Reservation Mechanism
on QoS enabled AODV in order to test its capability to for On-demand Ad Hoc Path Finding, IEEE/SCS 35th Annual
perform in frequent changing topology as well as its Simulation Symposium, pp. 27-33 (2002)
scalability in congested network. Meanwhile, the [5] I. Gerasimov, and R. Simon: Communication Support for
Tightly-coupled Distributed Mobile Applications, International
selection of evaluation metrics helps determining the Journal of Simulation, Vol. 3, no. 2, pp. 23-40 (2002)
reliability and ability of this protocol to perform in [6] I. Gerasimov, and R. Simon: Performance Analysis for Ad Hoc
real-time application. QoS Routing Protocols, IEEE MASCOTS Mobility and
Though AODV is the basis of all our simulated Wireless Access Workshop (MobiWAC), pp. 87 – 94 (2002)
[7] R. de Renesse, M. Ghassemian, V. Friderikos and A. H.
protocols, the connectivity maintenance methods along Aghvami: Qos Enabled Routing in Mobile Ad Hoc Networks,
with admission control mechanism employed led to Fifth IEEE International Conference on 3G Mobile
performance distinctions between these three strategies Communication Technologies, pp. 678-682 (2004)
as demonstrated in the simulation results. [8] C.E. Perkins, E.M. Royer and S.R. Das: Quality of Service for
Ad hoc On-Demand Distance Vector Routing, IETF Internet
In conclusion, utilization of HELLO messages Draft: draft-perkins-manet-aodvqos-02.txt. (2003)
could result to performance degradation with respect to [9] S. Corson, and J. Macker: Mobile Ad hoc Networking (MANET):
the selected evaluation metrics due to the slower time Routing Protocol Performance Issues and Evaluation
it takes in detecting connectivity among the nodes. In Considerations, RFC 2501 (1999)
[10] Ns Notes and Documentation, http://www.isi.edu/nsnam/ns
contrast, link-layer feedback which makes use of [11] C.E. Perkins, E.M. Royer and S.R. Das: Ad hoc On-Demand
underlying MAC layer mechanism, any link break Distance Vector (AODV) Routing, IETF Internet Draft: draft-
could be detected much faster. ietf-manet-aodv-05.txt. (2000a)
The proposed enhancement that we made involves [12] C.E Perkins, E.M. Royer and S.R. Das: Quality of Service for Ad
hoc On-Demand Distance Vector Routing, IETF Internet Draft:
the addition of delay guarantee instead of bandwidth draft-ietf-manet-aodvqos-00.txt. (2000b)
consideration alone. From the results obtained, we [13] C.E Perkins and E.M. Royer: Quality of Service for Ad hoc On-
could see that the proposed enhancement of combining Demand Distance Vector Routing, IETF Internet Draft: draft-
delay and bandwidth metrics performs almost similar perkins-aodvqos-00.txt. (2001)
[14] G. Aggelou: Mobile Ad-Hoc Wireless Networks from Wireless
to the protocol which considers bandwidth only. The
LANs to 4G Networks, McGraw-Hill, Pages 151 – 226. (2005).
1259