A Review Paper on Performance Comparison of Routing Protocols Renu Singla, Priyanka

advertisement
International Journal of Engineering Trends and Technology (IJETT) – Volume22 Number 5- April2015
A Review Paper on Performance Comparison
of Routing Protocols
1
Renu Singla, 2Priyanka
1
Asst. Prof (CSE), Sri Ram College of Engg., Palwal(India)
2
M.Tech(CSE), Sri Ram College of Engg., Palwal(India)
Abstract: This paper presents a review on the work of
MANET routing protocols. The routing protocols used for the
study are AODV, DSR and DSDV. The paper is a survey of
research on routing protocols for MANET. There are various
performance metrics to compare Ad hoc routing protocols. In
this paper, a step by step procedure is stated to compare 3
popular routing protocols, DSR, AODV and DSDV based on
performance metrics Packet Delivery Fraction, End to end
delay and Normalized Routing load while varying the number
of nodes, speed and Pause time. The comparison in the work
has been done by using NS2 Simulator, and final output graph
results are generated in excel sheets using trace output files.
protocols. The network links are determined long before
routing process in proactive protocols.
Keywords: MANET, AODV, DSR, DSDV, NS-2 Simulator.
I.
Figure 1: MANET’s Routing Protocol
INTRODUCTION
Mobile Ad Hoc Network (MANET) is a vast mobile
node collection sharing wireless communication. These
devices has no fixed infrastructure even when moving.
Nodes can serve as both hosts and routers where
communication between nodes beyond their coverage
can be achieved.
In MANET, nodes are autonomous and free to move
randomly. Hence, the network topology is very dynamic
and communication link between source and destination
can vary with time. Traditional routing protocol used in
wired network cannot be applied directly to wireless
network. Nodes must be capable to maintain the routes
so that they move to allow applications to operate
without interruptions.
Characteristics of MANET
MANETs are capable of multi-hop routing, i.e,
when a destination node is out of coverage of soure
node, packets can be transmitted using an
intermediate node.
In MANET, each node is autonomous in behavior.
The network topology is dynamic in nature..
It forms a completely symmetric environment.
1. MANET’s Routing Protocols
There are many routing protocols have been proposed.
Topology-based routing protocols route packets based on
information about the network links. Topology-based
protocols can be further divided into proactive routing
protocols, reactive routing protocols and hybrid routing
ISSN: 2231-5381
In proactive routing protocol perform consistent and upto-date routing information to all the nodes is maintained
at each node. In Reactive (On-Demand) routing protocol,
protocols find route on demand by flooding the network
with Route Request packets. In the given work, we are
using AODV, DSDV and DSR reactive protocols for
comparison.
1) AODV Routing Protocol
Ad Hoc On Demand Distance Vector(AODV) routing
protocol is a reactive routing protocol . AODV is a
combination of both DSR and DSDV. It inherits the
basic on-demand mechanism of route discovery and
route maintenance from DSR plus the use of hop-by-hop
routing sequence numbers and periodic beacons from
DSDV. This protocol also uses some of the
characteristics of proactive routing protocol. Route
Requests (RREQs), Route Replies (RREPs), and Route
Errors (RERRs) are the message types defined by
AODV. These message types are received via UDP, and
normal IP header processing applies. In AODV when the
routes are needed, they are established on demand and
the established route is maintained as long as it is
needed. When a network node needs a connection, it
broadcasts a Request for connection. Other AODV nodes
forward this message and record the node that they heard
it from, creats temporary routes back to needy node.
When node receives message and has a route to required
node, it sends a message back through a temporary route
to requesting node. The needy node then begins using
http://www.ijettjournal.org
Page 218
International Journal of Engineering Trends and Technology (IJETT) – Volume22 Number 5- April2015
the route. Unused entries are recycled in the routing table
II. EXISTING WORK
after time.
Lot of work is already done by different researchers in
the field of MANET and mobile computing.
2) DSR Routing Protocol
DSR(Dynamic Source Routing) routing protocol is a
purely on demand routing protocol. It is designed for use
in multihop ad hoc networks. The two major phases of
the protocol are: route discovery and route maintenance.
Route Discovery is the mechanism by which source
node wishing to send a packet o a destination node
obtains a source route to destination node. Route
Discovery is used only when source node atempts to
send a packet to destination node and does not
already know a route to destination.
Route Maintenance is the mechanism by which node
source is able to detect, while using a source route to
Destination.
It uses no periodic routing messages like AODV, thus
reduces bandwidth overhead and conserved battery
power and also large routing updates. When the source
node wants to send a packet to a destination, it looks up
its route cache to determine if it already contains a route
to the destination[2,5]. If it finds that an unexpired route
to the destination exists, then it uses this route to send
the packet.
3)
DSDV Routing Protocol
Destination Sequenced Distance Vector(DSDV) routing
protocol is an enhanced version of the distributed
Bellman-Ford algorithm. It is a table-driven routing
protocol and the table updates are periodically
transmitted. There are two types of next-hop table
exchanges:
periodic full-table broadcast and event-driven
incremental updating. The relative frequency of the fulltable broadcast and the incremental updating is
determined by the node mobility. In each data packet
sent during a next-hop table broadcast or incremental
updating, the source node appends a sequence number.
Each entry in the table is marked by a sequence number
which helps to distinguish routes from new ones and
hence avoid the loops. To minimize the routing updates ,
variable sized update packets are used depending on the
number of topological changes. When a route update
with higher sequence is received, the old route is
replaced and when there are two different routes exist
with same sequence number the route with better matrix
is used.
ISSN: 2231-5381
David B. Johnson proposed a work on the Dynamic
source routing protocol for multi-hop Ad Hoc Networks.
The basic introduction and capabilities of DSR protocol
is defined. In the work , the evaluation of the operation
of DSR through detailed simulation on a variety of
movement and communication patterns, and through
implementation and significant experimentation in a
physical outdoor ad hoc networking testbed constructed
and the excellent performance of the protocol had been
demonstrated.[1]
Samba Sesay et al compared the four manet routing
protocols namely DSDV, TORA, DSR and AODV
through simulation. They created a virtual environment
consisting of 1200*300 mts for 600 sec of simulation
time. They used the random waypoint model, varied the
maximum speed of the mobile nodes with different
pause time. Also continuous bit rate sources were used.
It concluded that for small network where topology
changes are limited DSDV is most suitable, while TORA
is best for network with high mobility and large
population of nodes. TORA has the additional benefit in
the sense that it supports multiple routes and
multicasting. On the other hand DSR is preferred for
network with nodes moving at moderate speed. it had
lowest control overhead and is therefore suitable for
bandwidth and power constrained networks. AODV
gave the best performance in every way and is thus an
improvement, containing advantages of both DSDV and
DSR.[2]
Park, V.D. presented a new distributed routing protocol
for mobile, multihop, wireless networks. The protocol's
reaction is structured as a temporally-ordered sequence
of diffusing computations; each computation consisting
of a sequence of directed link reversals. The desirable
behavior is achieved through the novel use of a “physical
or logical clock” to establish the “temporal order” of
topological change events which is used to structure (or
order) the algorithm's reaction to topological changes.[3]
Mesut Gunes, proposed a work on the ant- colony based
routing algorithm for MANET. In the paper, a new ondemand routing algorithm for mobile, multi-hop ad-hoc
networks is presented. The protocol is based on swarm
intelligence and especially on the ant colony based meta
heuristic. The main goal in the design of the protocol
was to reduce the overhead for routing.[4]
Zygmunt J. Haas , proposed a work on Zone Routing
Protocol(ZRP) framework, a hybrid routing protocol.In
http://www.ijettjournal.org
Page 219
International Journal of Engineering Trends and Technology (IJETT) – Volume22 Number 5- April2015
the work, Knowledge of the routing zone topology is
Hongbo Zhou proposed a work that if two mobile nodes
leveraged by the ZRP to improve the efficiency of a
arewithin each other’s transmission range, they can
globally reactive route query/reply mechanism. The
communicate with each other directly;otherwise, the
proactive maintenance of routing zones also helps
nodes in between have to forward the packets for them.
improve the quality of discovered routes, by making
In such a case,every mobile node has to function as a
them more robust to changes in network topology.[5]
router to forward the packets for others. Thus,routing is a
Charles E. Perkins performed a Performance comparison
basic operation for the MANET. Because traditional
of two routing protocols for Ad Hoc Networks. The
routing protocols cannot be directly applied in the
comparison of performance for two prominent onMANET, a lot of routing protocols for unicast, multicast,
demand routing protocols – DSR and AODV is done in
and broadcast transmission have been proposed since the
the work. It is analyzed that even though DSR and
advent of the MANET. This surveygives a thorough
AODV share a similar on-demand behavior, the
study of routing protocols in the MANET[9]
differences in the protocol mechanics can lead to
Zhijun Wang, proposed a work on multicast in mobile
significant performance differenctials. The performance
Ad Hoc Networks. The paper reviews the state of art
differenctials are analyzed using varying network load,
multicast protocols and classifies them into two
mobility and network size.[6]
categories: tree-based and mesh-based. One classic
BRICS proposed a building-block approach for
protocol is reviewed closely for each category and
analyzing routing protocols in ad hoc networks-a case
briefly describe others. As a result some open problems
study of reactive routing protocols. Through this
such as scalability and reliability were discussed.[10]
approach we hope to explain how performance varies
with mobility by decomposing the protocol into
parameterized mechanistic building blocks based on
their functionalities. Then, we apply this approach to
reactive MANET routing protocols like AODV and
DSR, which enables us to build a common building
block architecture that encompasses these reactive
protocols. The effect of mobility on each building block
is evaluated. We are specifically interested in
understanding the contribution of each building block to
the overall protocol performance. Through simulations,
several lessons on protocol design are learnt. For
example, in both AODV and DSR, flooding and caching
seem to have a great effect on performance, while
salvaging in DSR barely seems to have an effect on the
protocol performance[7]
Atsushi Iwata, Proposed a work on scalable routing
strategies for Ad Hoc Wireless Networks. In the work,
the investigation for routing strategies that scale well to
large populations and can handle mobility is done.
Additionally, the need to support multimedia
communications, with low latency requirements for
interactive traffic and quality-of-service support for realtime streams. The work introduced two new schemes--fisheye state routing(FSR) and hierarchical state
routing(HSR)--- which offer some competitive
advantages over the existing schemes. The performance
comparison is done via simulation.[8]
ISSN: 2231-5381
Padmini Mishra presented a paper Routing protocols for
ad-hoc mobile wireless networks. This paper discusses
the routing protocols for Manets under two classesTables driven and on demand. Here, several table driven
protocols were discussed. Examples are DSDV, GSR
that use destination sequence numbers to keep routes
loop free and up-to-date. Also, various other on-demand
protocols were discussed example are AODV which is
an on-demand version of DSDV.[11]
Rahman, M.A proposed A simulation based performance
comparison of routing protocol on Mobile Ad-hoc
Network (proactive, reactive and hybrid). In the work , ,
a detailed simulation based performance study and
analysis is performed on these types of routing protocols
over MANET. Ad Hoc On-Demand Distance Vector
(AODV), and Dynamic MANET On-demand (DYMO)
routing protocol (reactive), Optimized Link State
Routing protocol (OLSR) (proactive) and Zone Routing
Protocol (ZRP) is (hybrid) have been considered in this
paper for the investigation and their relative performance
is reported.[12]
III. SIMULATION AND ANALYSIS
The simulations
Simulator(NS-2)
were
conducted
using
Network
Network Simulator-2 (NS-2): The version of network
simulator used for simulation is NS-2.34.
http://www.ijettjournal.org
Page 220
International Journal of Engineering Trends and Technology (IJETT) – Volume22 Number 5- April2015
Mobility Model: Random Waypoint Model
show that amongst all the protocols, AODV has a stable
End to End Delay despite mobility as it has the feature of
Metrices considered for performance evaluation are:
On-Demand Routing protocol and also maintains a
Routing table.DSDV has a higher Pdf than the other two
routing protocols in mobility as it is a Table Driven
Packet Delivery Fraction (PDF): The ratio of Data
protocol and is more reliable.DSR has the highest End to
packets delivered to those generated by the sources.
End Delay and Routing load increases the bandwidth and
consuming the battery life. Based on the above
Routing Load: This is the routing packets sent per
simulation scenario, parameter, assumption and results
delivered packet at the destination
AODV could be considered as an efficient faster routing
protocol than DSR and DSDV but has a higher Routing
End to End delay: the delay in delivering a packet
load comparatively than DSDV.
to the destination which is inclusive of all kinds of
delay.
REFERENCES
MAJOR ASSUMPTION:
[1]
In Random waypoint mobility scenario, we have to use
same mobility scenario for each variation in order to
compare a protocol with itself as with executions, this
scenario creates random mobility scene everytime. It is
not possible using a Random Waypoint Model. Thus, in
order to minimize the randomness for each variation, 50
such mobility scenario is generated and the average of it
is taken. This process is undertaken for eachvariation
making it less random. In other words, for each
simulation, the results are averaged over 50 randomly
generated mobile scenarios with the same pause time
interval or same speed.
The Parameters for simulation taken in the work are
shown below
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
Figure 2: MANET’s Routing Protocol
IV. CONCLUSION
Johnson, D.B., D.A. Maltz and J. Broch, 1999. DSR: The
Dynamic Source Routing Protocol for Multihop Wireless
Ad Hoc Networks. In: In Ad Hoc Networking, Perkins,
C.E. (Ed.). Addison- Wesley, USA., pp: 139-172.
Samba Sesay et al "Simulation comparison of four
wireless ad hoc routing protocols" Information technology
journal 3(3): pp 219-226,2004.
Park, V.D. and M.S. Corson, 1997a. A highly adaptive
distributed routing algorithm for mobile wireless
networks. Proceedings of the 16th Annual Joint
Conference of the IEEE Computer and Communications
Societies, Apr. 9-11, IEEE Computer Society, Washington
DC., USA., pp: 1-9.
M. Guunes, U. Sorges, I. Bouazizi, Ara––the ant-colony €
based routing algorithm for manets, in: ICPP workshop on
Ad Hoc Networks (IWAHN 2002), August 2002, pp. 79–
85.
Z.J. Hass, R. Pearlman, Zone routing protocol for ad-hoc
networks, Internet Draft, draft-ietf-manet-zrp-02.txt, work
in progress, 1999.
Perkins, Royer, Das, Marina "Performance comparison of
two on demand routing protocols for ad hoc networks"
IEEE Infocom 2000 conference.
Fan Bai, Narayanan Sadagopan, Ahmed Helmy “BRICS:
A Building-block approach for analyzing routing
protocols in ad hoc networks-a case study of reactive
routing protocols.”
A. Iwata, C. Chiang, G. Pei, M. Gerla, T. Chen, “Scalable
routing strategies for multi-hop ad hoc wireless
networks”, IEEE Journal on Selected Areas in
Communcations 17 (8) (1999) 1369–1379.
Hongbo Zhou "A Survey on routing protocols in manets”:
Technical report: MSU-CSE-03-08 mar 28, 2003.
Zhijun W., Yong L., and Lu W., “Multicast in Mobile ad
hoc Networks”, CCTA, 2007, pp. 151-164.
Padmini Mishra "Routing protocols for ad hoc mobile
wireless network" misra@cis.ohio-staLte.edu
Rahman, M.A. et al , “A simulation based performance
comparison of routing protocol on Mobile Ad-hoc
Network (proactive, reactive and hybrid)”, Computer and
Communication Engineering (ICCCE), International
Conference, IEEE, pp 1-5, May 2010
This paper compared the 3 popular ad hoc routing
protocols AODV, DSR and DSDV. Simulation results
ISSN: 2231-5381
http://www.ijettjournal.org
Page 221
Download