Professional Documents
Culture Documents
SH We Project
SH We Project
Introduction
Figure 4 Network Throughput Graph of AODV at 500 bits / sec and 25 packets
Wireless Scenario
To implement AODV, a wireless scenario was
configured with a similar set of 9 nodes. The
nodes move about within an area whose boundary
is defined in this example as 800mX800m. A
mobile node consists of network components like
Link Layer (LL), Interface Queue (IfQ), MAC
layer, the wireless channel nodes transmit and
receive signals.
At the beginning of a wireless simulation, the
types for each of these network components have
to be defined. The type of antenna, the radiopropagation model, sand the type of routing
protocol used by mobile nodes is some of the
other parameters that are defined. Random traffic
connections of UDP and CBR are setup between
mobile nodes using a traffic-scenario generator
script. We create CBR and UDP traffics
connections between wireless mobile nodes.
-macType Mac/802_11 \
-ifqType Queue/DropTail/PriQueue \
-ifqLen 50 \
-antType Antenna/OmniAntenna \
-propType Propagation/TwoRayGround\
-phyType Phy/WirelessPhy \
-topologyInstance $topo \
-channel Channel/WirelessChannel \
-agentTrace ON \
-routerTrace ON \
-macTrace OFF \
-movementTrace OFF
The default values for all the above options are
NULL except addressing type whose default
value is flat.
AODV routing process
The header files present in the standard ns2
directory has certain files which define various
parameters as follows:
aodv.h
aodv_packet.h
aodv_packet.h
aodv_rtable.h
aodv_rtable.cc
aodv_rqueue.cc
aodv_rqueue.h
aodv_rqueue.o
FUTURE WORK
The authors in [11] have suggested that
AODV is a promising candidate for
WMNs, which needs to service a large
number of mobile clients with low
latency
and
high
bandwidth
requirements. However, the authors in
[7] have suggested that to improve the
performance of AODV, they have
modified AODV to include the source
route accumulation feature of DSR. This
is
known
AODV
with
path
accumulation.
REFERENCES
[1] Ian F. Akyildiz, A Survey on Wireless
Mesh
Networks,
IEEE
Radio
Communications, Sept.2005
A Survey on wireless mesh networks
http://ieeexplore.ieee.org/Xplore/logi
n.jsp?
url=/iel5/35/32334/01509968.pdf?
temp=x
[2] Luke
Klein-Berndt
Wireless
Communications Technology group - A
Quick Guide To AODV Routing,
http://w3.antd.nist.gov/wctg/aodv_ke
rnel/aodv_guide.pdf
[3] The Network Simulator manual
[4] The Network Simulator (NS2) website,
http://www.isi.edu/nsnam/ns/nsbuild.html
[5] J.Kong, X.Hong, Y.Yi, J.-S.Park, J.Liu,
M.Gerla, A Secure Ad-hoc Routing
Approach using Localized Self-healing
Communities, Proc. Of ACM MobiHoc,
2005.
[6] Charles E. Perkins Mobile Ad Hoc
Networking Working Group - Nokia
Research Center, Ad hoc On-Demand
Distance Vector (AODV) Routing.
D.Maltz,
(DSR)
Dynamic
Protocol,
ftp://ftp.rfc-editor.org/innotes/rfc4728.txt, Feb.2007
[10] C.E.Perkins, P.Bhagwat, Highly dynamic
Destination Sequenced Distance Vector
Routing (DSDV) for mobile computers, in
Proc. Of ACM SIGCOMM, p.g. 234-244,
1994
[11] Asad Amir Pirzada, Marius Portmann,
Jadwiga Indulska, Performance analysis of
multi-radio AODV in hybrid wireless mesh
networks, Volume 31 , Issue (March
2008),
Pages
885-895
http://portal.acm.org/citation.cfm?
id=1349996
[12] C Gomez, P Salvetella, O.Olonso, J
Paradells, Adapting AODV for IEEE
802.15.4
Mesh
Sensor
Networks: Theoretical
Discussion
and
Performance Evaluation in a Real
Environment International Workshop on
Wireless Mobile Multimedia,Proceedings
of the 2006 International Symposium on
on World of Wireless, Mobile and
Multimedia Networks
[13] C.E.Perkins, E.Belding-Royer, S.R.Das, AdHoc On Demand Distance Vector (AODV)
routing IETF RFC 3561, July 2003.
http://moment.cs.ucsb.edu/pub/wwan
_chakeres_i.pdf
ACKNOWLEDEMENT
The author would like to thank Dr Bruce
Millard, Professor of Practice, Division of
Computing Studies, ASU Polytechnic, for his
support and guidance throughout this project
work. The author also would like to thank Dr
Tim Lindquist and Dr Alan Skousen, both
Professors of Practice in the Division of
Computing Studies for having agreed to be in the
graduation committee.