NS2 Report - Analysis of AODV & DSDV Routing Protocol: Muhammad Sami
NS2 Report - Analysis of AODV & DSDV Routing Protocol: Muhammad Sami
NS2 Report - Analysis of AODV & DSDV Routing Protocol: Muhammad Sami
Routing Protocol
Muhammad Sami
Advanced Network - CSC 4202
Computer Science Department
IIUM
Abstract
In present day era where high mobility is considered a future of
computing and technology, quality and efficiency for the
dynamic networks and mobile technology is imperative. A
Mobile Ad-hoc Network (MANET) is formed by a group of
autonomous mobile nodes connected by wireless link without
centralized control or established infrastructure. Routing
protocols for ad-hoc networks are typically evaluated using
simulation, since the deployment of ad-hoc network is relatively
rare. In this paper, using a simulation tool ns-2 we make a
comparison between AODV and DSDV protocols for CBR
traffic in mobile ad hoc networks. We analyze the performance
of the routing protocol after extracting data from trace file. To
analyze the data, Perl language is chosen because of its
simplicity and its fast execution for a big data trace-file
contains. The performance metrics that is going to be extracted
and analyzed are the packet delivery ratio, average delay, and
packet loss.
Keywords: network simulation, ns2, AODV, DSDV, perl
1.
INTRODUCTION
2.
Limitations of DSDV
Wastage of bandwidth due to unnecessary
advertising of routing information even if there is
no change in the network topology [3].
DSDV doesnt support Multi path Routing.
It is difficult to determine a time delay for the
advertisement of routes [5].
It is difficult to maintain the routing tables
advertisement for larger network. Each and every
host in the network should maintain a routing
table for advertising. But for larger network this
would lead to overhead, which consumes more
bandwidth.
2.2. AODV
AODV adopts a very different mechanism to maintain
routing information. It uses traditional routing tables, one
entry per destination. This is in contrast to DSR, which can
maintain multiple route cache entries for each destination.
AODV uses sequence numbers maintained at each
destination to determine freshness of routing information and
to prevent routing loops. All routing packets carry these
sequence numbers. An important feature of AODV is the
maintenance of timer-based states in each node, regarding
utilization of individual routing table entries. A routing table
entry is expired if not used recently. AODV allows nodes to
respond to link breakages and changes in network topology
in a timely manner. A set of predecessor nodes is maintained
for each routing table entry, indicating the set of neighboring
nodes which use that entry to route data packets. These
nodes are notified with RERR packets when the next-hop
link breaks. In contrast to DSR, RERR packets in AODV are
intended to inform all sources using a link when a failure
b) Limitations of AODV
Requirement on broadcast medium: The
algorithm expects/requires that the nodes in the
broadcast medium can detect each others
broadcasts.
Overhead on the bandwidth: Overhead on
bandwidth will be occurred compared to DSR,
when an RREQ travels from node to node in the
process of discovering the route info on demand,
it sets up the reverse path in itself with the
addresses of all the nodes through which it is
passing and it carries all this info all its way.
No reuse of routing info: AODV lacks an
efficient route maintenance technique.
The routing info is always obtained on demand,
including for common cause traffic [7].
3.
SIMULATION METHODOLOGY
3.1
Performance Metrics
Throughput:
a) Simulation Parameters:
CONCLUSION
Routing Protocols
DSDV, AODV
Transport Protocols
TCP, UDP
Simulation Area
1000x600
Simulation Time
50
Number of Nodes
18
Maximum Speed
310km/h
Type of Traffic
CBR, FTP
[2] Ning.P. and Sun.K. How to misuse aodv: a case study of insider attacks
against mobile ad-hoc routing protocols.Technical report, Comput. Sci.
Dept., North CarolinaState Univ., Raleigh, NC, USA, 2003
Packet Size
512 bytes(CBR)
REFERENCES
[1] David B. Johnson and David A. Maltz. Dynamic sourcerouting in ad
hoc wireless networks. Technical report,Carnegie Mellon University,
1996
3.2
Analysis of Results
a) Packet Delivery Ratio
It tells us about the performance of a protocol that
how successfully the packets have been delivered.
Higher the value means better results. Based on the
analysis from the trace-file of the simulation, the
PDR shows that AODV outperforms DSDV in all
scenarios with DSDV on TCP perform worst.
b) Average end-to-end Delay
It is an average delay of data packets. Buffering and
queuing during route discovery latency, interface
queue, and retransmission delays at the MAC and
transfer times, may cause this delay. Lower delay
means better results and performance. The DSDV in
this scenario also beaten by the AODV routing
protocol, which may be caused by the vehicle
moving at different speeds, and DSDV has to
update its routing table with each movement.
c) Packet Loss
Packet loss or drop packets, is the difference
between the number of packets sent by the source
and received by the target node. The routing
protocol forwards the packet to destination if a valid
route is known; otherwise it is buffered until a route
is available. From the NAM, it can be seen that the
DSDV has lots of drop packets and queue time or
buffered longer compared to the AODV, and seems
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: