This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
Modified AODV Energy Aware Routing for
Optimized Performance in Mobile Ad-hoc Networks
Nilam Ket
Dept. of Electronics & Telecommunication
Sinhagad Institute of Technology
Solapur, India
nilamket@gmail.com
Abstract - Mobile Ad hoc Network (MANET) is a temporary
infrastructure less network formed by collection of wireless
mobile nodes. Every node is mobile to communicate with each
other without relying on any centralized system. As the power of
mobile node is limited it is during communication nodes will keep
on losing its energy and finally drain off when the energy
becomes zero. Thus, it is very essential to consider the nodal
energy of each individual node before forwarding a Route
Request packet. There are many protocols defined in order to
discover route between a pair of nodes out of which the
performance of Ad hoc On-Demand Distance Vector protocol
(AODV) Routing Protocol proves to be better. However AODV
and none of the existing protocols have considered node energy
threshold to make a forwarding decision and considered routing
based on node residual energy.
This paper proposes an Energy Aware Routing Protocol
(AODVEA) based on AODV which incorporates local forwarding
decision with node energy threshold for intermediate nodes and
routing based on max min energy algorithm to increase the
lifetime of the network. Also project proposes Modified AODV
(AODVM) which incorporates same local forwarding decision for
intermediate nodes but routing is based on combination of max
min energy algorithm and shortest distance. By using NS2
(Version 2.35) simulator simulation of new protocols and AODV
protocol for the performance parameters network lifetime,
average throughput and average delay are performed for various
scenarios. Results show that AODV modified gives optimized
performance.
Index Terms—MANET, Energy aware, AODV, max min
energy algorithm, threshold.
I. INTRODUCTION
A typical ad hoc network is formed by mobile nodes which
are usually battery operated devices. Energy conservation of
nodes is a critical issue as the lifespan of these nodes affects
the connectivity of the network. An ad hoc network consists of
large number of mobile nodes which operates with limited
power. These nodes have self-organizing capability in the
multi-hop environment. Node becomes dead if its battery
power drains completely. A dead node cannot participate in the
network. Each node in the network acts as terminal node as
well as routing node. Due to increase in number of dead nodes,
network partitions are formed and hence, normal
communication will get affected. Thus, development of an
978-1-4673-9338-6/16/$31.00 2016
c IEEE
Shashikant Hippargi
Dept. of Electronics & Telecommunication
Sinhagad Institute of Technology
Solapur, India
shashikant.hippargi@gmail.com
efficient energy aware routing is an important research issue to
increase the robustness of mobile ad hoc network.
This paper proposes an Energy Aware Routing Protocol
(AODVEA) based on AODV which incorporates local
forwarding decision with node energy threshold for
intermediate nodes and routing based on max min energy
algorithm to increase the lifetime of the network. Also project
proposes Modified AODV (AODVM) which incorporates
same local forwarding decision for intermediate nodes but
routing is based on combination of max min energy algorithm
and shortest distance.
A. Energy Conservation in ad hoc networks
Nodes in an ad hoc network are battery operated and so
operate with limited energy. A typical battery utilized in
wireless nodes incorporates a lifespan of limited hours. Nodes
in a MANET share a dependent relationship in which every
node acts as host node as well as routing node. Thus, every
node performs its individual process as well as acts as a
forwarding node, so spends energy in process and forwarding
of packets. This reduces the lifespan of the nodes in an ad hoc
network. So energy conservation is very important in ad hoc
networks. This section focuses on the problem of energy
conservation in an ad hoc network having such limited energy
devices.
Research has been done to conserve energy at different
levels in an ad hoc networks based on the remaining energy
level of the node. Energy conservation is often achieved by
forcing systems to an idle or stand-by mode. Energy is
preserved by reducing the clock speed and voltage level of the
electronic equipment. Energy savings at the MAC level is
achieved by power down the cards which are not in use. At the
routing layer, energy is conserved by developing cross layered
protocols and designing low power routing algorithms that use
energy levels of nodes in the route as a metric for routing
packets.
II. RELATED RESEARCH WORK
Ad hoc On-Demand Distance Vector (AODV) [5] routing
protocol is specially designed for use by mobile nodes in an ad
hoc network. It offers many advantages such as quick
adaptation to dynamic link conditions, less utilization of
network, and determines unicast routes to destinations for the
1030
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
ad hoc network. AODV has low processing and memory
overhead.
It is essential to take into account the nodal energy [1] of
each node before forwarding a Route Request packet. An
enhanced version of traditional AODV can be proposed by
considering remaining node battery power as one of the
parameter for making a forwarding decision. Nodes having
minimum residual power are avoided from transmission by
applying threshold. Energy efficient algorithms [2] considering
remaining energy can enhance the performance of routing.
Energy aware [8] in mobile ad hoc network is very important.
By applying energy aware routing, network lifetime can be
improved.
[6] Discussed Energy-aware routing algorithms considering
minimum maximum battery cost routing (MMBCR). Proposed
two energy-aware routing algorithms: an energy aware ad hoc
on-demand distance vector (e-AODV) and an energy-aware
dynamic source routing (e-DSR). [7] Proposed an energy
aware routing technique that selects the nodes having MAX
energy and calculates the average of nodes energy. The path
having maximum average energy is selected for data
transmission.
Energy aware routing [4] can be implemented with low
overhead considering nodes residual energy. The max min
algorithm [6,7] based on residual energy of node can be used
for routing which increases the network lifetime.
III. AODV
The AODV protocol is an on-demand routing protocol.
AODV performs the route discovery process only when inter -
nodal communication is required. A route discovery process is
initiated when a node requires a route to destination node.
In AODV a route is discovered by route discovery. The
routes are maintained in a routing table till the route expires.
Every node within the AODV protocol contains a sequence
number which is used to find the recent route at the routing
discovery. The sequence number is used to find recent route
and eliminate loop generation. The AODV protocol has same
routing discovery method as the dynamic source routing (DSR)
protocol. But AODV protocol uses different process to
maintain and manage a routing table. The routing table of
nodes in DSV protocol maintains all the route information
from sender to destination however the routing table of nodes
in AODV protocol have less information, that stores the
destination address, next hop node address and destination
sequence number. Every entry of a routing table contains a
lifetime i.e. time to live (TTL) field which gets modified when
its routing information is modified. A row in the routing table
is removed when the TTL period expires. In AODV protocol,
nodes periodically exchanges HELLO routing messages to
maintain updated information about neighboring nodes. When
source nodes needs to send packet to destination node, it
checks its routing table. If routing table in source node has
active entry to destination it sends the packet to destination
using active route else it broadcasts RREQ (Route Request)
packet. On receiving RREQ packets, the intermediate neighbor
nodes increments the hop count by one and broadcasts the
1031
packet till it reaches the destination node. The intermediate
neighbor nodes also send a RREP (Route Reply) packet to
source node in receiving RREQ packet. The destination node
receives many RREQ packets from different routes. The
destination node chooses the route with least hop count and
sends a RREP packet to the source node. An intermediate node
on receiving RREQ packet, updates the information of node
sending RREQ packet so as to determine forward path for
sending packet. The routing table updating continues till RREQ
reaches destination or route to destination is found. When the
RREQ reaches destination it sends RREP packets to the source.
In order to extend the lifespan of the network, equal
balanced power consumption among sensor nodes is to be
made. AODV routing protocol does not take into account the
remaining energy of nodes in the routing. As AODV
determines route by considering hop count, node energy
consumptions among nodes is not balanced. Efficient routing
protocols are proposed, which consider node hop-count and
node residual energy in next section.
IV. AODVEA (AODV ENERGY AWARE)
AODVEA Energy Aware Routing Protocol is based on
AODV which incorporates local forwarding decision and
routing based on max min energy algorithm to increase the
lifetime of the network. The node participates in routing only if
its energy is greater than threshold. The node with minimum
remaining energy in the route is selected and the route having
maximum minimum remaining energy is selected. A new M
in-RE (minimum remaining energy) field is added to RREQ
and RREP packets.
The algorithm explained above is as follows,
x Send a ROUTE REQUEST to neighbors.
x Get various routes available to destination.
x In each route, node having minimum remaining energy
is selected.
x Then the route having maximum value of minimum
remaining energy is selected.
V. AODVM (AODV MODIFIED)
The proposed protocol AODVM route discovery process is
similar to the AODVEA protocol. The difference is AODVM
determines an optimum route by considering the combination
of residual energy of nodes on the path and hop count.
The proposed protocol selects routes by combining both of
minimum residual energy of nodes and hop-count, and then
determines a proper route among them.
The algorithm explained above is as follows,
x Send a ROUTE REQUEST to neighbors.
x Get various routes available to destination.
x In each route, node having minimum remaining energy
is selected. The value is divided by hop count. Let this
value be α.
x Then the route having maximum value of α is selected.
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.

VI. SIMULATION RESULTS

A. Simulation parameters used

Table 1 shows the simulation parameter settings.

Simulator Used NS-2.35

Number of Nodes 50
Dimension of simulated area 700x700 m
Routing Protocols AODV, AODVEA, AODVM
Traffic type CBR
Speed 5 m/s
Receive Power 300 mW
Transmit Power 600 mW
Pause time 2.00 sec
Send rate 2 packets/sec
Table 1. Simulation parameters

B. Performance Evaluation Fig. 2. Network lifetime versus time for Threshold percentage 12 and
Initial Energy 0.5 J
Following performance metrics are considered for
comparing various routing protocols.
x Network Lifetime: It gives the count of the alive nodes at
particular time instant. Node is alive if its energy is greater
than 0.0.
x Average Delay: This metric represents average end-to-end
delay and indicates the time required for packet to reach
the destination.
x Average Throughput: This metric represents average rate
at which bits are transferred between sender/receiver.
C. Simulation Results
Simulations are performed for different threshold values
and different initial energies.

Fig. 3. Network lifetime versus time for Threshold percentage 15 and

Initial Energy 0.7 J

Fig. 1. Network lifetime versus time for Threshold percentage 15 and

Initial Energy 0.5 J

Fig. 4. Network lifetime versus time for Threshold percentage 15 and

Initial Energy 0.3 J

1032
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
Fig. 5. Average Delay for different initial energies with threshold
percentage 15
Fig. 6. Average Delay for different threshold Percentages with initial
energy 0.5
Fig. 7. Average Throughput for different initial energies with threshold
percentage 15
Fig. 8. Average Throughput for different threshold Percentages with initial
energy 0.5
VII. CONCLUSION
From the simulation performed for various scenarios, the
following conclusions can be made.
x Network Lifetime: Modified AODV has less lifetime
compared to Energy aware but more than normal AODV.
x Average Delay: Modified AODV has average delay less
than energy aware AODV but it is more than normal
AODV.
x Average Throughput: Modified AODV has highest
Throughput than other two protocols.
Thus, AODV modified has highest throughput giving better
network lifetime than AODV and less average delay as
compared to AODVEA.
VIII. FUTURE SCOPE
In future, simulation for other parameters such as packet
delivery ratio, energy consumption and many more can be
carried out. This approach of routing using the combination of
Hop count and remaining energy will give much more better
performance in a long simulation time. Simulations are
required to be done for it also.
Also various parameters such as link capacity can also be
combined in the route selection logic.
REFERENCES
[1] Saurabh Jain, Sneha Trivedi, Vidhi Shah “Energy Efficient Ad
hoc on-demand Distance Vector Routing Protocol (EE-AODV)
for Mobile Ad-hoc Network”, International Journal of
Innovative Research & Development, April 2014 Vol 3 Issue 4
[2] Sushma D. Ghode , K. K. Bhoyar “A Survey on Energy
Efficient Routing Algorithms for Ad-Hoc Network”
International Journal of Computer Applications (0975 – 8887)
Volume 67– No.20, April 2013
[3] Neha Kalwar, Sanjay Sharma “Max-Energy Node Selection and
Average Energy Path Selection based Routing in MANET”
International Journal of Engineering and Advanced Technology
(IJEAT) ISSN: 2249 – 8958, Volume-2, Issue-6, August 2013
[4] R.Rajeshkanna, Dr.A.Saradha “Energy Efficient Enhanced
AODV Routing Protocol for maximize the lifetime of Mobile
1033
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.

Ad hoc Networks” Networks International Journal of Computer

Technology & Application, Sept-Oct 2013
[5] C. Perkins, E. Belding-Royer, S. Das “Ad hoc On-Demand
Distance Vector (AODV) Routing” , Proceedings of the Second
IEEE Workshop on Mobile Computer Systems and
Applications. Washington, DC, USA: IEEE ( 2003)
[6] Shivashankar, Hosahalli Narayanagowda Suresh, Golla
Varaprasad, Guruswam Jayanthi, “Designing Energy Routing
Protocol With Power Consumption Optimization in MANET”
Volume 2, No. 2, 2168-6750 IEEE TRANSACTIONS ON
EMERGING TOPICS IN COMPUTING (2013)
[7] C.-K. Toh,“ Maximum Battery Life Routing to Support
Ubiquitous Mobile Computing in Wireless Ad Hoc Networks”
IEEE Communications Magazine (2001)
[8] Jin-Man Kim, Jong-Wook Jang, “AODV based Energy
Efficient Routing Protocol for Maximum Lifetime in MANET”
IEEE Computer Society(2006)
[9] Ms.S.Suganya,Dr.S.Palaniammal “An Optimized Energy
Consumption Algorithm For MANET” 2012 Published by
Elsevier Ltd., SciVerse ScienceDirect Procedia Engineering
38(2012) 903-990
[10] http://www.isi.edu/nsnam/ns/

1034