International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
317 - 321

________________________________________________________________________________________________________

Efficient Local Route Repair Mechanism for AODV protocol in MANETS

1

Rama Rao.A

Professor
Dept. of Computer Science and Engineering
Lendi Institute of Engineering and Technology
Vizianagram, India
ramarao_adimalla@yahoo.co.in

Pushpa Devi.B, 3Babitha.K, 4Bhargav.G,5Sai Hemanth.J

B.Tech Scholar
Dept. of Computer Science and Engineering
Lendi Institute of Engineering and Technology
Vizianagaram, India
revathi.budharaju@gmail.com

Abstract A Mobile Ad-hoc Network (MANET) is a continuously self-configuring, infrastructure-less network of mobile devices
connected without wires. A mobile ad hoc network is an autonomous system of mobile nodes connected by a wireless link. A MANET does not
have any access point or does not depend on any central administrator. In a large scale ad hoc networks, there is a continuous node mobility may
cause radio links to be broken frequently. When there is a substantial increase in the degree of mobility of the wireless network more link errors
are likely to occur. When this happens, route repair is typically performed to establish a new route. Such route repair mechanisms suffers with
the problems like high control overhead and long packet delay making them inefficient due to frequent failures of intermediate connections in an
end-to-end communication. When there is a breakage in the intermediate link, it is better to discover a new route locally without resorting to an
end-to-end route discovery. Therefore to overcome from these consequence propose a new idea on local route repair (LRR) mechanism that the
repair is confined to the surrounding area of the broken link is proposed to reduce the reaction time of recovery and the routing overhead. The
route repair idea is implemented by improving repair mechanism in the widely accepted Ad hoc On-demand Distance Vector (AODV) protocol.
The proposed version of AODV routing protocol with route repair scheme overcomes the disadvantages of its antecedent. Where as in the
proposed version of AODV, nodes in the active path between source and destination act as a virtual source when link breakage occurs and there
by the search process is continued till the link is formed to reach the original destination is reached. The improved local route repair mechanism
is contributed with the anticipation of link breakage. This mechanism achieves better performance when compared to existing local repair
mechanism.
Keywords- Mobile Ad-hoc Network, AODV, Local Route Repair

__________________________________________________*****_________________________________________________
I.

INTRODUCTION

Wireless network is a rising technology that will allow users to

access services and information electronically, irrespective of
their geographic position. Wireless communication network is
a collection of independent devices connected to each other.
Some of the advantages of wireless network are it is easily
deployable and flexible in nature as compared to wired
networks. There are two approaches for wireless
communication that is centralized cellular network and
decentralized approach. In centralized cellular network each
mobile unit is connected to one or more fixed base stations, so
that a communication between two mobile stations requires
involving one or more base stations. In decentralized approach
there may be situations where radio network units or nodes,
move in terrain where line-of-sight communication rarely is
possible between all nodes and where pre-deployed
infrastructure cannot be guaranteed. A mobile ad hoc network
each device (nodes) is dynamically self-organized in network
without using any pre-existing infrastructure.
The primary challenge in building a MANET is equipping
each device to continuously maintain the information required
to properly route traffic. Such networks may be operated by
themselves or may be connected to the larger Internet.
MANETs are a kind of wireless ad hoc wireless networks that
usually have a routable networking environment on top of a
link layer ad hoc network. The mobility of nodes in Mobile Ad
Hoc networks (MANETs) causes frequent changes of network
topologies making routing in MANETs a challenging task.
Mobile ad hoc network (MANET) [8] is one of the
challenging areas of wireless networks. MANET is an ad hoc
network and comprised of mobile node that communicates

using wireless link. In MANET, each mobile node is equipped

with wireless transmitters and receivers using antennas. Nodes
in MANET communicate with each other by using these
transmitters and receivers. In MANET, as nodes are free to
move, nodes may not remain in coverage area of each other.
For the nodes which are not in the transmission range,
communication is done by using multi-hop mechanism. Nodes
in MANET have characteristic like dynamic topology,
bandwidth and energy constraint and limited physical security.
Due to these differences, routing in MANET is more difficult
than the wired networks. In MANET, an active route can have
a link break due to mobility of nodes or empty battery of node
as in that case a node cannot perform its intended function of
forwarding packets. At that time, source can decide to
reconstruct the path for further data transfer
II.

LITERATURE SURVEY

Vibhor Kumar Goal, Rishabh Shrivastava and Vivek Malik [1]

says An ad hoc network is a mobile wireless network that has
no centralized infrastructure and not have fixed access point.
Each node in the network also functions as a mobile router of
data packets for other nodes. However, due to node mobility,
link failures in such networks are very frequent and render
certain standard protocols inefficient resulting in wastage of
power and loss in throughput. As a result, routing in such
networks experiences link failure more often. Hence, it is
essential that a routing protocol for an ad hoc network
considers the reasons for link failure to improve the routing
performance. This routing protocol improves the link failure
by using stability concept. It is an efficient routing algorithm
that improves the efficiency of link failure in terms of power
317

IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
317 - 321

________________________________________________________________________________________________________
as well as bandwidth which improves the quality of services.
III. NETWORK MODEL AND PROBLEM DESCRIPTION
However, since mobile hosts have limited battery resources,
A. Problem Statement
ad hoc mobile networks should consume battery power more
carefully and efficiently to prolong network operation
MANETs dynamic topology makes link breakages a
lifetime.
frequent habit. This habit causes many problems such as data
loss, delay, and others which degrade the performance of the
S. Priyadsrini, T. M. Navamani, and Venkatesh
MANET protocols. To deal with the dynamic changing
Mahadevan [2] says that Mobile Ad hoc Networks consist of
topology of a MANET, many routing protocols have been
mobile nodes with limited battery power. The critical issue for
proposed, however, none of them could completely overcome
routing in mobile ad hoc network is how to select a stable path
the challenges faced in MANET. In order to reduce the
with longer lifetime since mobility and power drain of a node
damage size of this phenomenon, the idea of local route repair
causes frequent path failure. This path failure causes frequent
mechanism has appeared.
route discovery which affects the performance of the routing
B. Existing System
protocol. The path failure also increases computational
The Ad hoc On Demand Distance Vector routing protocol is
overhead of the nodes. Hence, it propose a three algorithms to
topology based routing protocol which uses shared link for
estimate the stability of the route by considering the energy
transferring packet from source to destination in specific
drain of the nodes and the rate of mobility. It reduces the
manner. This protocol is totally based on shortest path. This
number of route discovery process and also the computation
protocol is to keep the information of neighbor nodes in form
overhead of every node involved in route discovery process
of table. Here, every node has to maintain its route table for
which affects the overall performance of routing protocol.
effective communication. When any changes occur in network
each node has to update its routing table with requiring
Jyoti Jain, Roopam Gupta and T.K. Bandhopadhyay
periodic flooding. In this protocol flooding require only when
[4] says that MANET (Mobile Ad hoc Network) is a wireless
it is demanded. When a node want to send the data it
self-organized distributed network. This paper gives a general
automatically establish a route from source to destination. This
survey of research on local repair of link, if it is broken during
protocol works with both unicast and multicast routing. When
communication for MANET and proposes a new local repair
source wants to send the data to destination through AODV it
scheme in order to make up the deficiency of the existing local
first find the destination sequence number (DesSeqNum) for
repair schemes. The improved local repair scheme concerns
transmission which makes it different from other routing
about the over head requirement and end to end delay in
protocols.
transmission. Nodes are required to keep the next two-hop
1) Disadvantages:
node address for each route entry in routing table. During local
repair, the repairing node use Ant algorithm for finding new
The problems like high control overhead and
route for next to next node in the link considering that other
long packet delay making them inefficient
part of the link is already in existence. Reduced size of F-ANT
due to frequent failures of intermediate
and B-ANT will give significant reduction in overhead. In this
connections
in
an
end-to-end
case repairing node not only tries to discover the route to the
communication.
destination node of data packet, but also attempts to establish
Inconsistency and redundancy if nodes
the route to its downstream node (i.e. the next hop node).
contain old entries in their routing table.
Shikha Patle and Purushottam Kumar [5] says that
MANET is a dynamic environment of mobile nodes and
suffers link failure problem i.e. due to node mobility, loss of
energy, node failure etc. To overcome the broken link
problem, initiated route repair mechanism. The suggested two
route repair techniques are used to repair the broken link of the
network. Either the routes can be repaired by re-establishing a
new route starting from the source node or the routes can be
repaired by the node that detects the link break along the path.
The mechanism is proposed to prefer route repair techniques
on the basis of decision. According to this approach, the
different route repair values are defined on the basis of the
active path of network and calculate the link break value of the
network for finding in which location the link break is
occurring to initiate route repair mechanism. For
implementation, apply the proposed approach on an AODV
routing protocol and check which route repair techniques are
used. Simulate the results on the basis of different parameter
i.e. sent data packets, received data packets, dropped data
packets and energy consumption.

C. NETWORK MODEL FOR 50 NODES

Fig 1: Network Model for 50 Nodes

IV.

PROPOSED PROTOCOL

A. Ad hoc On-demand Distance Vector (AODV) Routing

Protocol
.
Ad Hoc on-demand distance vector routing (AODV) is a
reactive routing protocol of mobile Ad Hoc networks. When a
new route is needed, the source node broadcasts a Route
318

IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
317 - 321

________________________________________________________________________________________________________
Request (RREQ) message. Any node without a route to the
1) Improved Local Route Repair Mechanism (ILRR) in
destination rebroadcasts the RREQ. Otherwise, if the node has
AODV:
a route to the requested destination, it sends a Route Reply
The existing local route repair mechanism
(RREP) message to the source node. When the source node
works after link failure, so it increases the packet loss and
receives a RREP, the route is established and the source can
delay. To overcome the problem the improved local route
start using it. If data is flowing and a link break is detected by
repair mechanism is contributed in which local route repair
the intermediate node, a Route Error (RERR) message is sent
mechanism is applied before the occurrence of link failure.
to the source of the data in a hop-by-hop manner. As the RERR
After anticipation link breakage it finds the route to send data
propagates towards the source of the network, each transitional
via new route. It starts the new route discovery process by
node invalidates routes to the destinations that have now
initiating the RREQ with sender ID as its own ID to
become unreachable. When the source of the data receives the
destination. The link failure node buffers the data packet to
RERR it disprove the route and reinitiates route discovery if
reduce the packet loss and delay if the route is not identified
necessary [9].
till link breakage occurs. It transmits the buffered packet and
B. Local Route Repair Mechanism (LRR)
continues the data transmission via new route after its
identification.
As intermediate nodes are usually nearer to the
destination than the source node, the intermediate nodes on the
route are comparatively more suitable in comparison to the
Link failure
Anticipating
source node to broadcast the RREQ message in order to repair
Alternative
anticipating
Link
or find an alternate route to the destination. Based on this idea
route
node buffer
Breakage
adopted the intermediate nodes that were en-route to repair the
selection
the data
broken route to the destination. The standard version AODV
packets
protocol uses three types of packets for communication viz.
RREQ (Route Request), RREP (Route Reply) and RERR
Source node send
(Route Reply). In addition to these three communication
data to destination
packets have introduced three more packets viz. R_R (Route
through new route
Repairing), RR_OK (Route Repair OK), RR_F (Route Repair
failure).
If data is flowing from source to destination via nodes
intermediate routers and a link break is detected by the any
intermediate node, intermediate node does not send a RERR to
the source of the data source node. Instead, it sends a Route
Repairing (R_R) message back to the pre-hop node. After
sending R_R to pre_hop node, intermediate node tends to
broadcast RREQ to repair the break route. If intermediate node
cannot repair the route in certain amount of time, it sends back
a Route Repair Fail (RR_F) message to pre_hop node. And at
same time intermediate node sends the data packages, which
store in the cache, back to pre_hop node. Otherwise, once
intermediate node repairs the route in time, it sends back a
Route Repair OK (RR_OK) message to pre_hop which has
received a R_R message. Once pre_hop node receives a R_R
message, it caches the data packages sent to the destination. If
pre_hop node, which is not the source node of the data has
received a RR_F message from the break node, pre_hop node
sends a R_R message back to the pre-hop node of itself and
continues the same procedure. On the contrary, if node
pre_hop node received a RR_OK message which means the
break link is repaired by intermediate node, it sends all waiting
data packages stored in the cache.
In the worst situation, each intermediate node cannot
repair the break link and cannot find a new route to the
destination. Then, the source node will consequently receive a
R_R message. In this scenario the proposed scheme will have
the same operations as the standard AODV. The source node
broadcasts a RREQ message to find a new route to the
destination node [9].

Fig 2: Anticipating Link Breakage

V.

SIMULATION AND RESULT

A. Simulation Model
SIMULATOR

Network Simulator 2

NUMBER OF NODES

Random

INTERFACE TYPE

Phy/ WirelessPhy

MAC TYPE

802.11

QUEUE TYPE

DropTail / PriQueue

QUEUE LENGTH

50 Packets

ANTENNA TYPE

Omni Antenna

PROPAGATION TYPE

TwoRayGround

ROUTING PROTOCOL

AODV, ILRR-AODV

TRANSPORT AGENT

UDP

APPLICATION AGENT

CBR

SIMULATION TIME

50 seconds

PACKET SIZE

512 bytes

AREA SIZE

600*600

TABLE I. Simulation Model

319
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
317 - 321

________________________________________________________________________________________________________
B. Performance Evaluation
1) Throughput:
The throughput calculates the average throughput of the
Application traffic between source node and destination node.
Throughput = Total Received Bytes / Elapsed Time.
2) Packet Delivery Ratio:
The packet delivery ratio is defined as the ratio of the
number of packets received at the destination and the number
of packets sent by the source
Packet Delivery Ratio = Received Packets/
Generated Packets
3) Latency or Delay:
Delay is the time taken for a packet to reach the
destination from the source node.
Delay = (Delay of each entities data packet)/
Total number of delivered data packets
C. Comparative Graph
. AODV and ILRR-AODV protocols are compared for the scenarios of

varying the transmission range. Scenario is kept same for both

protocols with same topology, source and destination. Totally
4 simulation runs are made by varying the transmission range
as 150, 200, 250, and 300. Parameters such as packet delivery
ratio, throughput and delay are computed and plotted as X
GRAPH
Fig 4: Packet Delivery Ratio Comparison between AODV and
ILRR_AODV

Fig 3: Throughput Comparison between AODV and

ILRR_AODV

Fig 5: Delay Comparison between AODV and ILRR_AODV

320
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
317 - 321

________________________________________________________________________________________________________
[4] Jyoti Jain, Roopam Gupta and T.K. Bandhopadhyay, On
CONCLUSION
The proposed technique presents the local route repair
mechanism to improve the local repair in reactive routing
protocol. This system is incorporated into standard AODV for
improved performance. The performance of proposed
technique is better when compared to standard AODV. The
improved local route repair mechanism is contributed in which
anticipating link failure based local repair mechanism
improves performance. The improved local repair mechanism
is better when compared to existing local repair mechanism

[5]

[6]

REFERENCES
[1] Vibhor Kumar Goal, Rishabh Shrivastava and Vivek Malik,
An Algorithm for Improvement of Link Failure in Mobile
Ad-Hoc Network International Journal for Science and
Emerging Technologies with Latest Trends, Vol. 10, No. 1,
pp. 15-18, 2013.
[2] S. Priyadsrini, T. M. Navamani, and Venkatesh Mahadevan,
An Efficient Route Discovery in MANETS with Improved
Route Lifetime International Journal of Information and
Electronics Engineering, Vol. 2, No. 4, 2012.
[3] Renu Kachhoria and Sanjeev Sharma, An Implementation
in AODV based on Active Route Timeout between Sensor
Nodes in Wireless Sensor Networks International Journal
on Computer Science and Engineering (IJCSE), Vol. 3, No.
3, 2011.

[7]

[8]

[9]

Demand Local Link Repair Algorithm for AODV Protocol

International Journal of Computer Applications, Vol. 3, No.
5, 2011.
Shikha Patle and Purushottam Kumar, Decision Making
Approach to Prefer Route Repair Technique in AODV
Routing Protocol of MANET International Journal of
Research in Engineering and Technology (IJRET), Vol. 4,
No. 2, 2015.
Raju Sujane, Dr. Vikash Kumar Singh and Devendra Singh
Kushwaha, TTL Variance Prophecy based Enhancement
of AODV Routing Protocol in MANET International
Journal of Innovative Research in Computer and
Communication Engineering, Vol. 3, No. 9, 2015.
P. Priya Naidu and Meenu Chawla, Extended Ad Hoc on
Demand Distance Vector Local Repair Trial for MANET
International Journal of Wireless & Mobile Networks
(IJWMN), Vol. 4, No. 2, 2012.
Meenakshi Devi and Dr. Pardeep Kumar Mittal Local
Route Repair in MANET for on Demand Routing Protocol:
A ReviewInternational Journal of Advanced Research in
Computer Science and Software Engineering, Volume 4,
Issue 5, May 2014
Arpit Dhingra, Anil Kumar Local Route Repair
Mechanism for AODV International Journal Of
Engineering And Computer Science ISSN:2319-7242
Volume 3 Issue 4 April, 2014 Page No. 5384-5386

321
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________