This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.

1. International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 06 Issue: 02 | Feb 2019 www.irjet.net p-ISSN: 2395-0072
© 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 322
SURVEY ON ENHANCEMENT OF MANET ROUTING PROTOCOL
Anil Kumar1, Ashish Xavier Das2
1M. Tech Research Scholar, Department of Electronic and Communication, SHUATS, Prayagraj, U.P, India
2Assistant Professor, Department of Electronic and Communication, SHUATS, Prayagraj, U.P, India
-----------------------------------------------------------------***----------------------------------------------------------------
Abstract - The mobile Ad-hoc network (MANET) is
basically consist of mobile nodes having the ability to
communicate to each other without any infrastructure
routing issue have been the most important in MANET. We
have considered few routing procedure such as AODV, DSDV,
DSR and DYMO in this article. We have also compared the
performance of the considered protocol in environment.
Keywords: MANET, AODV, DSDV and DYMO.
1. INTRODUCTION
The Mobile Ad-hoc Network (MANET) consists of self-
designing mobile node with no infrastructure. The mobile
nodes with wireless radio interface are associated by
remote connections where every method in a MANET is
allowed to move self-sufficiently and randomly with
capacity of changing its connectivity to different device
much of the time. It is a multi-hop process in view of the
restricted transmission scope of vitality compelled mobile
nodes and therefore every device in system topology goes
about as a router.
With dynamic nature of network topology the courses
changes very fast and frequent thus the effective steering
conventions assumes critical jobs in dealing with it. They
ought to be capable to guarantee the conveyance of packet
securely to their Destination. MANETs are additionally
equipped for trade with topology changes and
malfunctions in nodes through system reconfigurations.
The mobile ad-hoc network is completely adaptable and
reasonable for a few sorts of utilizations, as they permit
the foundation of brief communication with no pre-
installed infrastructure.
Beside to the debacle and military application space the
sending of mobile ad-hoc network for media applications
is another interesting region. With recently rising radio
technology, e.g. IEEE 802.11 and Bluetooth, the
acknowledgment of sight and sound applications over
mobile ad-hoc network turns out to be increasingly
practical. To discover a course between the end-focuses is
a noteworthy issue in mobile multi hop ad-hoc powerful
network. The issue is additionally irritated as a result of
the nodes portability. Various methodologies are
accounted for to deal with this issue lately, yet it is
exceptionally hard to choose which one is best steering
calculation. Mobile Ad-hoc Networks (MANETs) are in fact
unique in relation to the customary wireless network (e.g.
remote LANs, cell, computerized trunked radio or satellite
systems). In Traditional wireless network, the fixed
network infrastructure, for access, point, base stations or
satellites are essentially required to work as the repeaters
to hand-off re-transmit the Signal from one node to the
others. however, none of these Network infrastructure is
required in ad-hoc network that are the reason ad-hoc
network are in some cases called as infrastructure less
Wireless network .
They should to be able to ensure the delivery of packet
securely to their destination. MANETs are additionally
equipped for taking care of topology changes and
malfunction in node through Network reconfigurations.
Different protocol have been created for ad-hoc network,
such as TORA (Temporally Ordered Routing Algorithm),
DSDV (Destination-Sequenced Distance Vector), DSR
(Dynamic Source Routing), AODV (Ad-Hoc On Demand
Routing), AOMDV (Ad-hoc On demand multi path Distance
Vector Routing).
These protocols offer varying degrees of efficiency. This
paper plans to discover an energy effective routing
protocol. It additionally intends to constrain control
utilization of mobile nodes in the system so as to draw out
the network lifetime. The main object of this paper is to
analyze AOMDV protocol for ways it could be moved
forward. This should be possible by estimating vitality as
for network size and thinking about the rest of the battery
control. It likewise proposes further investigation into
increasingly effective protocol or variations of existing
protocol, for example, AOMDV. This paper additionally
proposes another steering calculation dependent on nodes
leftover vitality and it is connected on AOMDV with the
goal that the new algorithm provides better performance
than DSR, AODV, AOMDV, TORA and DSDV.
2. ROUTING PROTOCOL MANET
A routing protocol is a component by which the system
traffic is harmonized and conveyed through the network

2. International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 06 Issue: 02 | Feb 2019 www.irjet.net p-ISSN: 2395-0072
© 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 323
from source to destination. The broadcast is inevitable and
a typical task in ad-hoc network. It comprises of diffusing a
message from a source nodes to every one of the nodes in
the network. Broadcast can be utilized to information to
the whole network. It is likewise utilized for course
disclosure protocol ad-hoc network. The routing protocol
is classified as follow on the based on the manner in which
the network information is obtain in these routing
protocol.
2.1 Pro-active /Table driven routing protocols
The protocol are referred to as table driven protocol in
which, the route to every one of the nodes is kept up in
routing table. Packet is exchanged over the predefined
route determined in the routing table. In this plan, the
packet sending is done faster anyway the routing overhead
is additional in light of the fact that every one of the route
should be characterized sooner than moving the packets.
Proactive protocol has decrease latency since the majority
of the routes are maintained up at all the time. Example
protocol DSDV, OLSR (Optimized Link State Routing),
Destination-Sequenced Distance-Vector (DSDV) protocol.
2.2 Reactive/On-demand protocols
These kind of protocol are also called on demand routing
protocol in which the route are not predefined for routing
a source nodes requires the route discovery segment to
decide another route each time a transmission is needed.
This route revelation instrument is principally founded on
flooding algorithm which employed on the methodology
that a nodes essentially declares the packet to the majority
of its neighbors and middle of the road nodes just forward
that packets to their neighbors. This is a repetitive
methodology until the point that it achieves the
Destination. Reactive techniques have smaller routing
overheads anyway higher latency. Example protocol:
AODV (Ad hoc On-request Distance Vector routing) DSR.
2.3 Hybrid Routing Protocols
Since proactive and reactive routing protocol each work
best in oppositely different situations, there is valid
justification to create hybrid routing protocol, which
utilize a mix of both proactive and reactive routing
protocol. This hybrid protocol can be utilized to discover a
balance between the proactive and reactive protocol. The
fundamental thought behind hybrid routing protocol is to
utilize proactive routing network in a few territories of the
system at specific occasions and responsive routing for
whatever remains of the network. The proactive tasks are
limited to a little space so as to diminish the control
overheads and delays. The reactive routing protocol are
utilized for finding nodes outside this area, as this is more
transfer speed productive in an always showing signs of
change organize. Instances of cross hybrid routing
protocol includes and Zone Based Hierarchical Link State
Routing Protocol (ZHLS) Core Extraction Distributed Ad
Hoc Routing Protocol (CEDAR), Zone Routing Protocol
(ZRP).
3. OVERVIEW ROUTING PROTOCOL
3.1 Ad Hoc on-Demand Distance Vector Routing
(AODV)
Perkins and Royer (1999) depicted the Ad Hoc On-Demand
Distance Vector (AODV) routing protocol expand on the
DSDV algorithm. They found that AODV is an enhancement
for DSDV on the grounds that it regularly limits the
quantity of required communicates by making route on an
interest premise, rather than keeping up a total rundown
of route as in the DSDV algorithm. The author arrange it as
an unadulterated on-request route procurement
framework, since nodes that are not on a chosen way don't
keep up directing data or take part in routing table
exchange during the way toward sending the RREQ,
moderate nodes record in their route tables the location of
the neighbor from which the principal duplicate of the
communicate packet is received, there by building up an
invert way. On the off chance that extra duplicates of the
equivalent RREQ are later received, these packets are
disposed of. When the RREQ achieves the destination or a
transitional nodes with a crisp enough route, the
destination/middle of the road nodes reacts by uncasing a
route reply (RREP) packet back to the neighbor from
which it previously got the RREQ. As the RREP is steered
back along the invert way, nodes along this way set up
forward route sections in their route tables which point to
the node from which the RREP came. These forward route
passages demonstrate the dynamic forward route. Related
with each route section is a route time which will cause the
cancellation of the passage on the off chance that it isn't
utilized inside the predefined lifetime. Since the RREP is
sent along the way settled by the RREQ, AODV just
backings the utilization of symmetric link.
3.2 Dynamic Source Routing (DSR)
D. B. Johnson and Maltz (1996) structure a Dynamic
Source Routing (DSR) protocol which is an on-request
routing protocol that depends on the idea of source route.
Mobile nodes are required to keep up route stores that
contain the source route of which the versatile knows.
Passages in the route reserve are persistently refreshed as

3. International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 06 Issue: 02 | Feb 2019 www.irjet.net p-ISSN: 2395-0072
© 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 324
new route are found out. The protocol comprises of two
noteworthy stages: route revelation and upkeep. At the
point when a mobile node has a packet to send to some
destination, it initially counsels its route reserve to decide
if it as of now has a route to the destination. On the off
chance that it has an unexpired route to the destination; it
will utilize this route to send the packet. Then again, if the
nodes do not have such a route, it starts route revelation
by communicating a route asks for packet. This route ask
for contains the location of the destination, alongside the
source nodes’ location and an extraordinary distinguishing
proof number. Every nodes accepting the packet checks
whether it is aware of a route to the destination. On the off
chance that it doesn't, it adds its very own deliver to the
route record of the packet and after that advances the
parcel along its active connections. To confine the quantity
of route asks for engendered on the active connections of a
nodes, a versatile just advances the route ask for if the
demand has not yet been seen by the mobile and if the
mobile location does not as of now show up in the route
record.
3.3 Destination-Sequenced Distance-Vector
routing (DSDV)
Perkins and Bhagwat (1994) describe a Destination
Sequenced Distance-Vector Routing protocol (DSDV). It is
a table-driven algorithm dependent on the traditional
Bellman-Ford routing network. The enhancements made
to the Bellman-Ford algorithm include opportunity from
circles in routing tables. Each mobile node in the network
keeps up a routing table in which the majority of the
possible destination inside the net-work and the quantity
of jumps to every destination is recorded. Every section is
set apart with an arrangement number allotted by the
destination node. The succession numbers empower the
mobile node to recognize stale router from new ones,
consequently staying away from the development of
routing circles. Routing table updates are occasionally
transmitted all through the network so as to keep up table
consistency. To help reduce the conceivably expansive
measure of network traffic that such updates can create,
routing updates can utilize two possible type of packet
.The first is known as a full dump. This type of packet
conveys all accessible routing information and can require
various Network protocol data units (NPDUs). During
times of periodic development, these packets are
transmitted rarely. Little steady packet are utilized to
transfer just that data which has changed since the last full
dump. Every one of these broadcast should fit into a
standard-estimate NPDU, subsequently diminishing the
measure of traffic generated. The mobile node keep up an
extra table where they store the information sent in the
steady routing information packet.
3.4 Dynamic MANET on demand routing protocol
(DYMO)
Perkins and Chakeres (2009) DYMO routing protocol has
been proposed by as headway to the current AODV
protocol. It is additionally characterized to as successor of
AODV or ADOVv2 and continues Updating till date. DYMO
does not bolster superfluous HELLO messages and task is
absolutely founded on succession numbers appointed to
every one of the packet. It is a reactive routing protocol
that figures uncast router on interest or when required. It
utilizes arrangement numbers to guarantee circle
opportunity. It empowers on interest, multi-jump uncast
routing among the nodes in a mobile ad-hoc network.
Router revelation is performed at source node to a
destination for which it doesn't have a substantial way.
What's more, routing upkeep is performed to maintain a
strategic distance from the current destroyed courses from
the routing table and furthermore to decrease the packet
dropping if there should a rise an occurrence of any router
break or nodes failure.
4. CONCLUSION
In this article we have used MANET routing protocol, such
as AODV, DSDV, DSR, and DYMO. The routing protocol
performance analysis is done. The study concluded that
the performance of AODV and DYMO are much better than
DSR and DSDV because DYMO and AODV have the ability
to adapt the changes in the network very frequently.
REFERENCES
1) Perkins C. E. and. Royer E. M (1999), “Ad-hoc On-
Demand Distance Vector Routing,” Proc, 2nd IEEE
Wks, Mobile Comp. Sys. and Apps. 1 pp. 90-100.
2) Johnson D. B. and Maltz D. A. (1996), “Dynamic
Source Routing in Ad-Hoc Wireless Networks,”
Mobile Computing, T. Imielinskis and H. Korth,
Eds. Kluwer, pp. 153–81.
3) Broch,J. Johnson D. B., and Maltz D. A. (1998),“The
Dynamic Source Routing Protocol for Mobile Ad
Hoc Networks,” IETF Internet draft, draft-
ietfmanet-dsr-01.txt, (work in progress).

4. International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 06 Issue: 02 | Feb 2019 www.irjet.net p-ISSN: 2395-0072
© 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 325
4) Perkins C. E. and Bhagwat P. (1994), “Highly
Dynamic Destination-Sequenced Distance-Vector
Routing (DSDV) for Mobile Computers,” Comp.
Communication Rev., Oct. pp. 234–44.
5) Ford Jr. L. R. and Fulkerson, D. R. (1962), Flows in
Networks, Princeton University. Press.
6) Internet Engineering Task Force (2018)
Online.Available:http://tools.ietf.org/html/draft-
ietf-manet-dymo- Available.
7) JoaNg M. and Lu, I.T.,(1999),“A Peer-to-Peer Zone-
Based Two-Level Link State Routing for Mobile Ad
Hoc Networks,” IEEE Journal on Selected Areas in
Communications, vol. 17, no. 8, pp. 1415-1425.
8) Sinha, P., Siva Kumar R. and Bharghavan, V.
(1999), “CEDAR: A Core Extraction Distributed Ad
Hoc Routing Algorithm,” IEEE Journal on Selected
Areas in Communications, vol.17, Issue.8, pp.
1454-1466.
9) Haas Z.J. (1994), “The Routing Algorithm for the
Reconfigurable Wireless Networks,” Proceedings
of ICUPC, vol. 2, pp. 562-566.
10) Panaousis, E. A. and Politics, C. (2009),” Securing
ad hoc networks in extreme emergency cases”,
Proceedings of the World Wireless Research
Forum, Paris, France.