50120140506004

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 6, June (2014), pp. 28-36 IAEME
28

DEVELOPMENT AND EVALUATION OF ENHANCED AODV PROTOCOL
FOR ROUTE DISCOVERY IN MOBILE AD-HOC NETWORK

Hirkani Padwad
#1
, S. V. Sonekar
*2

#1
Research Scholar, Department of CSE, JDCOEM,
Nagpur, Maharashtra, India

*2
Professor, Head of the Department, Department of CSE, JDCOEM,
Nagpur, Maharashtra, India

ABSTRACT

Ad-hoc On-demand Distance Vector (AODV) routing protocol is the one of the most popular
routing protocol for mobile ad-hoc networks. This work optimizes AODV protocol by minimizing
the sum of load and delay. Enhancements include developing an improved version of AODV
protocol which uses load and delay parameters to select a path with minimum weight. This is a
weight based algorithm where weight is calculated in terms of load (i.e. Number of packets received
at a node) and delay (End-to-End delay). Recently, we have proposed this multipath based routing
scheme on MANETs. It is an appealing scheme which outperforms AODV [1] and TAODV [2] in
terms of End-to-end delay, packet delivery ratio in different simulation scenarios. In this paper we
evaluate performance of the proposed scheme based on different performance metrics like Load
balancing efficiency, jitter, End-to-end delay, packet delivery ratio, etc. and compare it with some of
the recent techniques proposed in [3], [4], [5], [6] and [7] considering more parameters like jitter and
load balancing efficiency in the network. The simulation is done using NS3.13 simulator. The results
show that the proposed enhancement outperforms many of the existing algorithms and it is expected
to achieve efficient resource utilization.

Keywords: Mobile Ad-Hoc Networks, AODV, Route Discovery, Weight, Load, Delay.

I. INTRODUCTION

An ad-hoc wireless network consists of a set of wireless nodes that communicate with each
other without any fixed infrastructure. Mobile Ad-Hoc networks have benefits and versatility for
many applications in commercial, educational and military where setting up of a fixed network is
difficult.
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING &
TECHNOLOGY (IJCET)

ISSN 0976 6367(Print)
ISSN 0976 6375(Online)
Volume 5, Issue 6, June (2014), pp. 28-36
IAEME: www.iaeme.com/ijcet.asp
Journal Impact Factor (2014): 8.5328 (Calculated by GISI)
www.jifactor.com

IJCET

I A E M E

29

Generally Mobile Ad-hoc networks work with reactive routing protocols that initiate route
discovery only on demand, for routing of packets. In reactive routing protocols, routes from source to
destination are maintained all the time. Therefore, when packets are to be sent the route is already
available unlike reactive protocols. Hence reactive routing protocols incur more route discovery
delay. Mobile Ad-hoc networks involve hosts with limited resources. Therefore, there is a need of
protocols which consume minimum resources. Since, in reactive protocols, routes are not maintained
on permanent basis, maintenance cost and control overhead is less and hence is more suitable for
Mobile Ad-hoc networks.
This type of network does not depend on any fixed infrastructure or base stations. The mobile
devices are expected to work as routers and thus perform route discovery and maintenance. Fig. 1
illustrates a typical Mobile Ad-Hoc Network. The topology in MANET is dynamic and it changes
unpredictably. As a result, routing is a challenging issue in Ad-Hoc network. A few other important
issues of Mobile Ad-Hoc network are Security, limited resources like power and bandwidth, absence
of centralized control.
This paper proposes an enhancement of AODV routing protocol considering load balancing
and minimization of delay.
Rest of the paper is organized as follows. Section II explains the literature relevant to
proposed work. Section III explains proposed idea and algorithm implementation. Section IV focuses
on simulation and its results. Also, it explains comparison of proposed work with some already
existing schemes. Finally, Section V puts forth the conclusion of work performed and future
enhancements possible.

II. LITERATURE SURVEY

In the wired networks, the routing protocols Routing Information Protocol (RIP, distance
vector routing) and Open Shortest Path First (OSPF, link state routing) are suitable. The dynamic
nature of MANET causes random and unpredictable changes in the routes of the network owing to
which above protocols cannot be used here as they require more CPU memory, Battery, etc.[8].

Fig. 1: Example of MANET

The most popular protocol used in Mobile Ad-Hoc network is the Ad-hoc on-demand
distance vector (AODV) [1] which is a reactive routing protocol. It discovers a shortest and updated
route when required using broadcast message. It uses sequence number to maintain updated routes as
in DSDV. It operates with the help of four control messages explained as follows.
Route Request (RREQ): When a source node wants to send packet for which route is not
available, it floods a RREQ message to all its neighbours. This message contains information viz.
Source IP, request ID, source sequence number, Destination IP, Destination sequence number and
hop count.
Route Reply (RREP): If a node receiving RREQ is itself a destination or has a valid route to
destination it sends a RREP to source node which contains information viz. Source IP, Destination
IP, Destination sequence number, lifetime and hop count.
30

Route Error (RRER): When a node in active route is lost, a RRER message is sent to notify
others of link breakage on both the sides.

A node initiates a RERR message if

1. If it detects a link break for the next hop of an active route in its routing table, or
2. If it gets a data packet destined to a node for which it does not have an active route, or
3. If it receives a RERR from a neighbour for one or more active routes

HELLO Messages: Each node sends a HELLO message to its neighbours to inform them that the
link is active. Nodes do not forward these messages. The receiving neighbours update the lifetime of
sending node link in routing table.

Route discovery process: When a source node wants to send packet to a node it forwards a RREQ to
all its. Receiving node checks freshness of request using source IP, sequence number, request ID. If
it has latest route to destination or is the destination then it replies with a RREP. If it does not have
route then it forwards the RREQ to its neighbours and sets a reverse path to source node. If request is
duplicate, it is discarded.

Route maintenance: A periodic HELLO message is sent by an active node to its neighbours. If a
node does not receive HELLO from neighbour it forwards a RRER to the source and route is
invalidated. Source node may again initiate route discovery if needed.
The scheme in [6] proposes an improvement over AODV by considering a mixed metric of
delay and number of hops. The route selection decision is taken using fuzzy logic. Each node embeds
a fuzzy system to calculate fuzzy cost when it receives a request message. The number of hops and
delay are fuzzy input parameters.
The scheme in [14] Proposes a load-balancing scheme which performs load balancing based
on three metrics i.e. residual battery capacity, average interface queue length and hop count along
with the its weight values. It achieves load balancing and extended battery life. It selects load
balanced path based on weight calculated for each path.
Reference number [20] proposes a load balancing routing protocol which tries to minimize
the routing overhead and increase network performance. It divides nodes into 3 categories i.e. trunk,
normal and terminal nodes. Every node handles congestion problem by keeping itself congestion
free. Congestion threshold depends on queue length which is set to a specific value. In this scheme,
however, each node needs to maintain the congestion level information.
The scheme in reference number [21] focuses on improving broadcasting efficiency. It
narrows the RREQ flooding based on mobility of nodes. It prefers fast moving nodes for forwarding
RREQ based on the assumption that fast moving nodes have better idea of recent routes as compared
to slow moving nodes which are not aware of fast changes in topology.

III. PROPOSED WORK

The proposed technique uses AODV routing scheme as the base on which optimization is
applied. For a given pair of source node and destination node, multiple paths are generated
prioritized according to their weight. Amongst them a path is selected with minimum weight. Weight
of path is sum of average load of path and average delay of path. Average load of a path is average of
load of all the nodes in the path (including source, destination and all intermediate nodes). Same is
the calculation for delay of a path.
31

This scheme considers queuing delay as the delay parameter and number of packets received
at a node as load parameter.

Using above two parameters, weight of a path is given as:

Weight of a path = pl * Load + pd * delay (I)

Where pl and pd are constants such that their sum is equal to 1. These constants help in giving
varying weight age to load and delay.
In the networks with heavy traffic, some nodes may be heavily loaded than others resulting
into congestion. This may cause loss of packets. In such type of scenario, load is an important factor
over delay. Routes which have less load may be preferred irrespective of delay on that route. This
helps in load balancing and avoiding congested paths. Therefore here, pl value is set significantly
greater than pd (Ex. pl=1 and pd=0).
In the networks with high mobility rate and long distances, a node may not be loaded due to
frequent change in its position. In such a scenario, delay plays an important role than load. Here, pd
is set much greater than pl according to the requirement (Ex. Pl=0 and pd=1).

A. Algorithm

The scheme is realized by performing following two processes.

1) Implementation of AODV in NS3
1. Start simulation using AODV routing protocol
2. Flood RREQ for every node
3. Fetch flow statistics such as number of packets received, number of bytes received, delay, etc.
4. Collect the statistics into an XML file

2) Detection of optimal path and simulation in Java
1. Read XML file using DOM parser
2. Fetch average load and delay for every node
3. Calculate the weight for every path by summing the average load and average delay for each node
in the path.
4. Select a path which gives minimum weight
5. Display all nodes at their respective x and y co-ordinates along with the optimal path between
given source and destination node.

IV. SIMULATION AND RESULTS

A. Introduction
NS 3.13 simulator was used to implement AODV protocol. In this work, we compare the
performance of our scheme with AODV, RTLB, MRFR, FAODV, Packet scheduling Algorithm,
AODV-LINE and AODV-LAR based on performance metrics like metrics such as Packet delivery
ratio, End-to-end delay, traffic load, average jitter, etc.

B. Simulation Model
The simulation parameters are given in Table-1. The boundary area fixed for simulation is
400 X 400 m.

32

TABLE I
SIMULATION PARAMETERS
Simulation Parameter Value
Routing protocol AODV
Nodes 18 to 100
Simulation time 100 seconds
Packet size 1000 bytes
Mobility Model Random Way Point Model
Traffic Model Constant Bit Rate
Node speed 1 to 20 m/s
Pause Time 5 seconds

C. Simulation Results
Simulation of AODV generates an Xml file which is fed to JAVA simulation program that
computes all the paths possible between given source and destination prioritized according to the
weight using the simulation statistics contained in Xml file. Finally, it also generates a graphical
representation of the optimal path that is with minimum weight.

D. Performance metrics
We conducted at least 40 experiments to plot data graphs in all the charts below.
We vary the traffic load, the degree of mobility and network size in the simulations. We vary
traffic load by changing the packet sending rate. We control the degree of mobility through the pause
time. We use pause times of 0 (i.e. constant movement), 20, 40, 60, 80 and 100 seconds. This
scenario arranges the movement and the position of the nodes according to the random waypoint
model.

Packet Delivery Ratio vs. Traffic Load
Fig.2 shows the plot of Packet Delivery Ratio as a function of packet sending rate for
proposed scheme, AODV, RTLB and MRFR. The Packet delivery decreases with increase in traffic
load. For packet sending rate 3 and above
the Packet delivery ratio of proposed algorithm is significantly greater than AODV and MRFR.

End-to-End Delay vs. Traffic Load
Fig.3 shows comparison of proposed algorithm with AODV, FAODV and RTLB based on
End-to-End Delay. There is a gradual increase in delay but the delay of proposed algorithm is lesser
than AODV for all traffic scenarios, nevertheless it is dominated by RTLB. For increased traffic i.e.
3, 4, 5, we give more weight to load parameter (pl) in comparison to delay parameter (pd). Hence
during calculation of optimal path, a path with lesser load is preferred giving very minimal emphasis
to delay value for that path. If delay parameter (pd) is given more emphasis in this case, the end-to-
end delay is reduced to a greater extent an average of 0.05 for all traffic scenarios.
33

Fig. 2: Comparison of Proposed Algorithm with RTLB, MRFR and AODV based on Packet
Delivery Ratio vs. CBR Traffic

Fig. 3: Comparison of Proposed Algorithm with RTLB, FAODV and AODV based on End-to-End
Delay vs. CBR Traffic

Fig. 4: Comparison of Proposed Algorithm with RTLB, MRFR and AODV based on Average Jitter
vs. CBR Traffic

Average Jitter vs. CBR
In Fig. 4 we show the comparison of proposed scheme with AODV, MRFR and RTLB. There
is a significant decrease in Average Jitter achieved by proposed scheme as compared with AODV. It
is comparable with that of RTLB and MRFR.

Packet Delivery Ratio vs. Pause Time
We compared proposed algorithm with AODV and Packet scheduling algorithm based on
their Packet Delivery ratio as a function of Pause time. The rate of increase in PDR for proposed
scheme is greater than that of AODV and packet scheduling algorithm as shown in Fig. 5. It is
34

expected to converge with others if pause time is increased further by 40 seconds. We obtained best
results for a 20 node network with inter packet interval of 5 seconds.

Fig. 5: Comparison of Proposed Algorithm with Packet scheduling based AODV and basic AODV
based on Packet Delivery Ratio vs. Pause time

Fig.6: Comparison of Proposed Algorithm with AODV, AODV-LINE and AODV-LAR based on
Packet Delivery Ratio vs. No. Of nodes

Fig. 7: Load balancing efficiency of Proposed Algorithm vs. CBR Traffic

Packet Delivery Ratio vs. Number of Nodes
We compared Packet Delivery Ratio of proposed scheme with AODV, AODV-LAR and
AODV-LINE as a function of number of nodes. The PDR decreases by approximately 1% to 2% for
each increase in network size. But delivery ratio achieved by proposed scheme is greater than all
other schemes compared in Fig. 6. Hence, we can infer that proposed scheme is more scalable than
AODV, AODV-LINE and AODV-LAR in terms of Packet delivery ratio. Here we set inter packet
interval to 1 second.
35

Load Balancing Efficiency vs. CBR Traffic Load
Fig.7 shows the load balancing efficiency of proposed scheme as a function of traffic load.
The load is considered in terms of data packets sent per second. Efficiency varies from 61% to 90%.
It increases gradually from lightly loaded network to heavy loaded network. It can be inferred that
the load handling capability of proposed scheme is magnified for heavy loaded network. This is
achieved by giving more weight age to load parameter (pd) while calculating weight of a path by
using equation I. For heavy traffic scenarios we set pl=1 and pd=0 thus giving complete preference
to load over delay.
We calculate load balancing efficiency as the percentage difference in load of selected path
and average load of alternative paths available.

V. CONCLUSIONS

Our work focuses on maintaining Quality of Service by optimizing AODV on the basis of
load and delay. Also, we maintain multiple routes between given source and destination prioritized
according to their weight. This helps in quick recovery after failure. In this work we evaluated the
performance of proposed algorithm and compared the results with RTLB, MRFR, AODV-LINE and
AODV-LAR, FAODV and packet scheduling algorithm. We found that it outperforms said schemes
in terms of Packet delivery ratio, average jitter and End-to-End delay for different network scenarios.
Also the weight based formulation of path increases load balancing efficiency in heavily loaded
network conditions.
The technique may be extended to reduce routing overhead by using localization technique.
The location information of nodes can be used to narrow down blind flooding of RREQ. This is
expected to reduce the route discovery delay significantly.

REFERENCES

[1] C. Perkins and E. Royer, Ad-hoc on-demand distance vector routing, Second IEEE
Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90 100, Feb
1999.
[2] Mueen Uddin et al , Improving performance of Mobile Ad hoc Networks using efficient
tactical on demand distance vector (taodv) routing algorithm, International Journal of
Innovative Computing, Information and Control Vol 8 No 6, pp. 43754389, June 2012,
ISSN 1349-4198.
[3] Anh Tai Tran, Myung Kyun Kim, A real-time communication protocol considering load
balancing in Adhoc Network , 978-1-4673-1773-3/12 IEEE, 2013.
[4] Dhirendra Kumar Sharma, Chiranjeev Kumar, Sandeep Jain, Neeraj Tyagi, An
Enhancement of AODV Routing Protocol for Wireless Ad Hoc Networks , 1st Intl Conf.
on Recent Advances in Information Technology RAIT-2012, IEEE 978-1-4577-0697-4/12
2012.
[5] Mohannad Ayash , Mohammad Mikki , Improved AODV Routing Protocol to Cope With
High Overhead in High Mobility MANETs, IEEE, 978-0-7695-4684-1/12, 2012.
[6] Taqwa Odey Fahad, Abduladhim A. Ali, Improvement of AODV Routing on MANETs
using Fuzzy Systems, Iraq J. Electrical and Electronic Engineering, Volume 7, No. 2, 2011.
[7] Phong Ngo Hoai, Myung Kyun Kim, Multipath-based Reliable Routing Protocol with Fast-
Recovery of Failures on MANETs, in Proc. of the 7th FTRA international conference on
Future Information Technology(FutureTech), June.2012.
[8] T. H. Clausen, A MANET Architecture Model, http://www.thomasclausen.org/Thomas Heide
Clausens Website/Research Reports _les/RR-6145.pdf, 2007.
36

[9] Peter P. Pham and Sylvie Perreau, Performance analysis of reactive shortest path and
multipathrouting mechanism with load balance, in Proc. of the IEEE INFOCOM,p. 251259, 30
March-3 April, 2003.
[10] Y.Xutao, Z.Zaichen, B.Guangguo, An improvement for ad hoc on demand routing protocol, in
Proc. of the 14th IEEE International Symposium on Persona1,lndoor and Mobile Radio
Communication, 2003.
[11] C. Siva Ram Murthy and B.S. Manoj, Ad-hoc Wireless Networks, Architecture and Protocols,
Prentice Hall PTR, 2004.
[12] Douglas S.J., Daniel Aguyao, John Bickrt and Robbert Morris, A high Throughput path metric
for multihop wireless routing in Proc. Of 9th annual international conference on Mobile
computing and networking, ACM, pp 134-146, 2003.
[13] Amjad Ali, Wang Hiugiang Node Centric Load Balancing Routing Protocol for Mobile Ad Hoc
Networks , Proceeding of International MultiConference of Engineers abd computer Scientist
2012, Vol I, March 2012, Hong Kong.
[14] Amita Rani, Mayank, Dave, Load Balancing Routing Mechanism for Mobile Ad Hoc Networks
, Int. J. Communications Network and System Sciences, 2009, 7, 627-635.
[15] S. Buruhanudeen, M. Othman, B. M. Ali, Performance comparison of MANET associativity
based routing (ABR) and the improvisation done for more reliable and efficient routing, The
3rd Information and Communication Technology Seminar, 2011.
[16] Hossam Hassanein and Audrey Zhou, Routing with Load Balancing in Wireless Ad hoc
Networks ,ACM 2012, ISBN 1-58113-378-2/01/07.
[17] Yashar Ganjali, Abtin Keshavarzian,Load Balancing in Ad Hoc Networks: Single-path Routing
vs. Multi-path Routing, IEEE INFOCOM 2004, 0-7803-8356-7/04.
[18] The NS 3 website. [Online]. Available: http://www.nsnam.org /
[19] Introduction to Wireless Sensor Networks. [Online]. Available:
http://www.worldscibooks.com/etextbook/6288/6288 c hap1.pdf.
[20] B.C.Kim, J.Y.Lee, H.S.Lee, and J.S.Ma, An ad-hoc routing protocol with minimum contention
time and load balancing, IEEE GLOBECOM, 2003.
[21] Amjad Ali, Wang Huiqiang Node Centric Load Balancing Routing Protocol for Mobile Ad Hoc
Networks Proceedings of the international MultiConference of Engineers and Computer
Scientists 2012, Vol I, ISBN 978-988-19251-1-4, ISSN 2078-0958.
[22] K.R. Shobha, K. Rajanikanth, Enhanced AODV Routing Protocol for Mobile Ad-Hoc
Networks, CCSIT 2011, Part II, CCIS 132, pp 265-276, 2011, Springer-Verlag Berlin
Heidelberg 2011.
[23] Prerna Malhotra, A Survey of Energy Efficient AODV Routing Algorithms in Manet,
International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 2, 2013,
pp. 213 - 220, ISSN Print: 0976 6367, ISSN Online: 0976 6375.
[24] Sunita Kushwaha, Bhavna Narain, Deepti Verma and Sanjay kumar,, Effect of Scenario
Environment on the Performance of Manets Routing Protocol: AODV, International Journal of
Computer Engineering & Technology (IJCET), Volume 2, Issue 1, 2011, pp. 33 - 38, ISSN Print:
0976 6367, ISSN Online: 0976 6375.
[25] P.A. Kamble and Dr. M.M. Kshirsagar, Improvement Over AODV Routing Protocol in Vanet,
[26] Bhakti Thakre and S.V.Sonekar, Design and Development of an Algorithmic Approach for
Selfish and Malicious Node in Cluster Based Adhoc Wireless Networks, International Journal of
Computer Engineering & Technology (IJCET), Volume 5, Issue 1, 2014, pp. 28 - 37, ISSN Print:
0976 6367, ISSN Online: 0976 6375.
[27] Poonam Pahuja and Dr. Tarun Shrimali, Routing Management for Mobile Ad-Hoc Networks,

50120140506004

Încărcat de

Informații document

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

50120140506004

Încărcat de

Drepturi de autor:

Formate disponibile

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),

S-ar putea să vă placă și