IPASJ International Journal of Computer Science (IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

Email: editoriijcs@ipasj.org
ISSN 2321-5992

A Publisher for Research Motivation ........

Volume 3, Issue 8, August 2015

Case study of routing protocol in MANET

Mrs. Poonam Sagar
Homi Bhabha National Institute, Mumbai

ABSTRACT
An ad hoc network could be a dynamic assortment of mobile nodes forming a network. It works in infrastructure less environment.
As mobile circumstantial network applications square measure deployed, several problems become important like routing stability,
finish to finish delay, security and power. This paper analyses the performance of AODV and DSR routing protocols varied
completely different parameters exploitation random waypoint model. The analyses are dole out exploitation NS2 as machine and
results square measure shown diagrammatically for analysis. the target is to create the protocol sturdy and standardizing the
protocol normally for applications.

I. INTRODUCTION
The history of wireless networks started within the Seventies and therefore the interest has been growing ever since. At
present, this sharing of knowledge is tough, because the users got to perform body tasks and set up static, bi-directional
links between the computers [1]. This motivates the development of temporary networks with no wires, no communication
infrastructure and no body intervention required. Such interconnection between mobile computers is termed a billboard hoc
Network. Ad hoc networks square measure rising because the next generation of networks and outlined as a group of mobile
nodes forming a short lived (spontaneous) network while not the help of any centralized administration or standard support
services. In Latin, circumstantial virtually means that for this, any which means for this purpose only and so typically
temporary [1]. A billboard hoc network is sometimes thought of as a network with nodes that square measure
comparatively mobile compared to a wired network. thence the topology of the network is far more dynamic and therefore
the changes square measure typically unpredictable oppose to the net that could be a wired network. This truth creates
several difficult analysis problems, since the objectives of however routing should happen is commonly unclear owing to the
various resources like information measure, battery power and demands like latency.
MANETs have many salient characteristics:
1) Dynamic topologies
2) Information measure strained, variable capability links
3) Energy-constrained operation
4) Restricted physical security.
So the routing protocols employed in normal wired networks don't seem to be similar temperament for this type of dynamic
environment. Recently a lot of attention has been paid to use specific network parameters once specifying routing metrics.
Examples would possibly embrace delay of the network, link capability, link stability or identifying low quality nodes.
These schemes square measure typically supported previous work, that is then enhanced with the new metrics.

II. ROUTING PROTOCOLS

Routing protocols for Mobile circumstantial networks is loosely classified into 2 main categories: Proactive or table-driven
routing protocols Reactive or on-demand routing protocols. A. Table Driven Routing Protocols (Proactive) In proactive or
table-driven routing protocols, every node unceasingly maintains up-to-date routes to every alternative node within the
network. Routing data is sporadically transmitted throughout the network so as to take care of routing table consistency.
Thus, if a route has already existed before traffic arrives, transmission happens at once. Otherwise, traffic packets ought to
wait in queue till the node receives routing data similar to its destination.
However, for extremely dynamic network topology, the proactive schemes need a big quantity of resources to stay routing
information up-to-date and reliable. bound proactive routing protocols square measure Destination- Sequenced Distance
Vector (DSDV), Wireless Routing Protocol (WRP), world State Routing (GSR) and Clusterhead entryway Switch Routing
(CGSR). B. On-Demand Routing Protocols (Reactive) In distinction to proactive approach, in reactive or on demand
protocols, a node initiates a route discovery throughout the network, only if it desires to send packets to its destination. For
this purpose, a node initiates a route discovery method through the network. This method is completed once a route is
determined or all attainable permutations are examined.

Volume 3 Issue 8 August 2015

Page 16

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 3, Issue 8, August 2015

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

Email: editoriijcs@ipasj.org
ISSN 2321-5992

Once a route has been established, it is maintained by a route maintenance method till either the destination becomes
inaccessible on every path from the supply or till the route isn't any longer desired. In reactive schemes, nodes maintain the
routes to active destinations. A route search is required for each unknown destination. Therefore, on paper the
communication overhead is reduced at expense of delay attributable to route research. Some reactive protocols square
measure Cluster primarily based Routing Protocol (CBRP), circumstantial On-Demand Distance Vector (AODV), Dynamic
supply Routing (DSR), Temporally Ordered Routing algorithmic rule (TORA), Associatively-Based Routing (ABR), Signal
Stability Routing (SSR) and placement assisted Routing (LAR).

III. SUMMARY OF AODV AND DSR

Every routing protocol has its own deserves and demerits, none of them is claimed as completely better than others. we've
got selected the 2 reactive routing protocols AODV, DSR for analysis [11,18].
A. Circumstantial On-demand Distance Vector Routing (AODV)
Ad-hoc On-demand distance vector (AODV) [4,16] is another variant of classical distance vector routing algorithmic rule, a
confluence of each DSDV [5] and DSR [6].
It shares DSRs on-demand characteristics thence discovers routes whenever it's required via an analogous route discovery
method. However, AODV adopts ancient routing tables; one entry per destination that is in distinction to DSR that
maintains multiple route cache entries for every destination. The initial style of AODV is undertaken when the expertise
with DSDV routing algorithmic rule. Like DSDV, AODV provides loop free routes whereas repairing link breakages
however not like DSDV, it doesnt need world periodic routing advertisements. AODV additionally has alternative vital
options. Whenever a route is accessible from supply to destination, it doesn't add any overhead to the packets. However,
route discovery method is just initiated once routes don't seem to be used and/or they invalid and consequently discarded.
This strategy reduces the consequences of stale routes likewise because the would like for route maintenance for unused
routes. Another characteristic feature of AODV is that the ability to produce unicast, multicast and broadcast
communication. AODV uses a broadcast route discovery algorithmic rule then the unicast route reply massage.
B. Dynamic supply Routing (DSR)
The Dynamic supply Routing (DSR) [6] is one in every of the purest samples of associate on-demand routing protocol that's
supported the construct of supply routing. it's designed specially to be used in multihop ad hoc networks of mobile nodes. It
permits the network to be fully self organizing and selfconfiguring and doesn't would like any existing network
infrastructure or administration. DSR uses no periodic routing messages like AODV, thereby reduces network information
measure overhead, conserves battery power and avoids giant routing updates. Instead DSR wants support from the
waterproof layer to identify link failure. DSR consists of the 2 mechanisms of Route Discovery and Route Maintenance, that
work along to permit nodes to get and maintain supply routes to absolute destinations within the network. DSR features a
distinctive advantage by virtue of supply routing. because the route is part of the packet itself, routing loops, either short
lived or long lived, can't be shaped as they can be forthwith detected and eliminated. This property release the protocol to
a range of helpful optimizations. Neither AODV nor DSR guarantees shortest path. If the destination alone will respond to
route requests and therefore the supply node is often the leader of the route request, the initial route could the shortest.

IV. CONCLUSION
The study has been dole out exploitation a similar sceanario for each schemes to create it biasfree. Same metrics are used
and results square measure compared. it's been determined that AODV within the simulation experiment shows overall best
performance. it's associate improvement of DSR and DSDV and has advantages of each of them. Future work can think
about exploitation a lot of metrics and additionally exploitation different networks for creating the study more practical and
conclusive. Efforts square measure on to check the network for a lot of denser and thin medium likewise.

REFERENCES
[1] Anuj K. Gupta, Member, IACSIT, Dr. Harsh Sadawarti, Dr. Anil K. Verma. Performance analysis of AODV, DSR &
TORA Routing Protocols IACSIT International Journal of Engineering and Technology, Vol.2, No.2, April 2010 ISSN:
1793-8236
[2] NS-2 Network simulator http://www.isi.edu/nsnam/ns.
[3] Vincent D. Park and M.Scott Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In
Proceedings of INFOCOM 1997, 1997.
[4] C. E. Perkins and E. M. Royer, Ad Hoc On-demand Distance Vector Routing, In Proceedings of the 2nd IEEE
Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
[5] C. E. Perkins and P. Bhagwat, Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile
Computers, SIGCOMM, London, UK, August 1994, pp. 234-244.

Volume 3 Issue 8 August 2015

Page 17

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 3, Issue 8, August 2015

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

Email: editoriijcs@ipasj.org
ISSN 2321-5992

[6] D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad-Hoc Ad hoc Networks," Mobile Computing, ed. T.
Imielinski and H. Korth, Kluwer Academic Publishers, 1996, pp. 153-181.

Volume 3 Issue 8 August 2015

Page 18