International Journal of Engineering and Technical Research (IJETR)

ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

An Enhanced Route Discovery algorithm to maximize

network life time in MANET
Anurag Tripathi, Kamal kumar

ABSTRACT- A MANET is a type of ad hoc network are actually self organizing and adaptive networks that
that can change places and configure itself on the fly. can be deformed and formed on-the-fly without the
Because MANETS are mobile, they use wireless requirement of any centralized administration. Routing
connections to connect to different networks. This in MANET is challenging due to the restrictions
can be a standard Wi-Fi connection, or another existing on the transmission bandwidth battery power
medium, like as a cellular or satellite and CPU time and the requirement to cope with the
communication. Some MANETs are restricted to a repeated topological changes resulting from the
local area of wireless devices (such as a group of mobility of the nodes. A different approach in the
laptop computers), while others may be linked to the design of the routing protocol is to evaluate a path only
Internet. A different approach in the design of the when it is necessary for data transmission [2]. These
routing protocol is to compute a path only when it is types of protocols are named as the reactive protocols
necessary for data transmission. These types of or on-demand routing protocols. A reactive protocol is
protocols are named as the on-demand or reactive characterized by a path discovery method and a
protocols routing protocols. A reactive protocol is maintenance procedure.
characterized by a path discovery procedure and a
maintenance procedure. Main objective of this 1.2 MANET v/s WLAN
paper is to analyze Minimum Battery Cost Routing
(MBCR) to expand Energy Efficient Power Aware MANETs are dynamically created and maintained by
Multipath Dynamic Source Routing based on DSR. the individual nodes comprising the network. MANET
The cost function in MBCR is defined such that the comprises a special subset of wireless networks since
lesser the remaining battery capacity By using they do not need the existence of a centralized message-
residual power as a cost metric, MBCR prevents passing tool. Simple wireless networks require the
nodes from being overused, and attempts to evenly existence of access points or static base stations, which
distribute battery capacity over the network to are accountable for routing messages to and from
increase network lifetime. mobile nodes within the specified transmission area [3].
A MANET may both work as a self-configured stand-
alone network or may be connected to the Internet,
General Terms through gateway nodes we define protocol which
Dynamic Source Routing (DSR), multihop, , loop free support unipath traffic from the source node to the
paths, Routing, Route Request (RREQ) and Route destination node, where the stress is on Dynamic
Replay (RREP). Source Routing (DSR) protocol[4].

Keywords
Vehicular Ad-hoc Networks (VANETs), (Imanet)
Internet Based Mobile Ad-hoc Networks, Multi-
hopping, Dynamic source routing.

I. INTRODUCTION
(MANET) A mobile ad hoc network is a collection
of wireless mobile nodes which have the ability to
interface with each other without having fixed
network infrastructure or any central base station. A
MANET is a type of ad hoc network that can change Figure 1.1 MANET
positions and configure itself on the fly. Because
MANETS are mobile, they imply wireless connections WLAN has been widely deployed in a range of network
to connect to different networks. This can be a standard situation such as enterprise and home networks.
Wi-Fi connection, or another medium, like as a cellular
or satellite transmission. The term MANET (Mobile 1.3 Types of MANET
Adhoc Network) mention to a multihop packet based
wireless network group of a set of mobile nodes that 1.3.1 Vehicular Ad-hoc Networks (VANETs)
can communicate and move at the same time , without
using any type of fixed wired infrastructure[1]. MNET

197 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

Vehicular Ad-hoc Networks (VANETs) are used for Optimization of either of two routing
communication among vehicles and between vehicles technique s[6]
and roadside equipment

1.3.2. (InVANETs) Intelligent vehicular ad-hoc

networks

(InVANETs) Intelligent vehicular ad-hoc networks are

a kind of artificial intelligence that helps vehicles to
function in an intelligent manner during vehicle-to-
vehicle collisions, accidents, drunken driving etc.

1.3.3. (iMANET) Internet Based Mobile Ad-hoc

Networks

Internet Based Mobile Ad-hoc Networks are ad-hoc

networks that connect mobile nodes and fixed Internet-
gateway nodes. In such type of networks normal adhoc
routing algorithms don't apply straightly.

1.4 Protocol requirements in MANET

1. Self starting and self organizing

2. Loop free paths, Multi-hop

3. Dynamic topology maintenance

4. Low memory-bandwidth consumption Figure 1.2 Hierarchy of MANET routing

protocols
5. Scalable to large networks
1.6 Power Aware
6. Minimal overhead for data transmission[5]
Ad hoc networks are the autonomous systems consist of
1.5 Different types of proposed protocols in MANET mobile nodes that interface with each other using
wireless transmission. Here a node can be a laptop, a
1) Proactive approach mobile phone , a PDA or another communication
device with some properties that are limited storage
2) Reactive approach capacity, restricted bandwidth and ,limited battery
power. An ad hoc network commonly refers to any set
3) Hybrid approach of networks where all devices have equal status on a
network and are free to link with any other ad hoc
1) Proactive protocols network devices in link range[7].
Adaptive system of routing based on the
exchange of control packets.

Continuously modify the possible information

in the nodes routing tables.

2) Reactive protocols

Do not take responsibility for finding a route.

Try to find out route only on demand by

flooding its Query.

3) Hybrid protocols

A composition of proactive and reactive Figure 1.3 Ad hoc net with four nodes[7]
schemes or a derivative of one.

198 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

1.6.1 Multi-hopping:

Multi-hopping is a method which allows virtual

extension of the communication range for each node.
This means to say that a node can remit a packet to
another node not in its range.

Figure 1.5 Energy Aware routing protocols[8]

II. RELATED WORK

The research work performed in this field by different
researchers is presented as follows:
Palak et al.(2014) mobile ad hoc network is a self
organizing temporary network. It contains mobile nodes
roaming here and there. Routing in these networks is a
Figure 1.4 Multi Hoping in Ad hoc network challenging job. Various routing protocols have been
proposed since the origin of MANETS. DSR is the most
1.6.2 DYNAMIC SOURCE ROUTING popular routing protocol build on source routing. This
paper is an study of DSR taking various performance
Mobile networks have attracted significant attention in parameters. Effect of these parameters on energy
recent years because of their improved flexibility and utilization is studied in this paper. Efficient DSR is one
reduced costs. In contrast to wired networks, mobile which gives best route with minimum energy
networks have unique characteristics like frequent consumption and maximizes network lifetime.
network topology changes, different link capacity Kavita Sharma et al.(2014) This paper proposed an
because of the impacts from transmission power, Energy effective power aware multipath dynamic
receiver sensitivity, noise, fading, and interference. source routing protocol by modifying one of the most
Furthermore, wireless mobile networks have a high popular routing protocols that is (DSR) Dynamic
error rate, power restrictions, and bandwidth limitations Source Routing protocol which is not at all concerned
[1]. Routing is the method of selecting paths in a about power consumption. The proposed Dynamic
network along which network traffic can be sent. [2]. source routing-Power Aware routing DSR-PSR uses the
The routing protocols that come under this category do initial concept of traditional DSR and implements
not maintain the network topology information. They energy efficient routing through which it not only
obtain the necessary path when required. Hence they do increases the life time of the network but also increases
not periodically interchange any routing information. the overall performance of the networks.
[6]. A. Route discovery Route discovery consists of two
sub-procedures: (RREQ) Route Request and Route NANDINI PRASAD K S (2013) This paper presents a
Replay (RREP). Route discovery is the mechanism by power aware routing protocol designed for wireless
which a node willing to send a packet to a destination sensor networks. The suggested routing protocol is an
node finds a route. Route discovery is used only when a extended and enhanced version of Dynamic Source
node attempts to send a packet to another node and does Routing protocol. It sums energy awareness to the
not before know a route to that node. [7] existing implementation of DSR protocol. Energy
metric is considered during route selection process to
1.6.2.1 Route maintenance: Route maintenance is the select an optimal path in terms of overall energy of the
methodology by which node S is able to detect, if the nodes along the path, and low energy notification
network topology has changed such that it can no more method is used during route maintenance process to
use its path to D because a link along the route no increase the lifetime of the 'bridge' nodes to avoid
longer works [8]. network subdividing. The performance of DSR protocol
and (EADSR) Energy Aware DSR protocol are
compared through NS2 simulation under various
scenarios. In all the cases, it is viewed that EADSR
protocol out-performs DSR protocol by energy saving
in efficient manner.

Figure 1.6.4 Route maintenance: node C is unable to Md Shahid Akhter et al.(2013) In this paper, there are
forward a packet from S to D two enhancements proposed in DSR protocol to

199 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

maximize the lifetime of MANET. It is simulated in ns2 T_B_S (Total Battery Status), WNs (number of weak
and the results are found useful. The algorithm of DSR nodes) and Node IDs.
protocol is remould on the basis of initial energies of a) Calculation of Total Battery Status (T_B_S)
nodes. Both improvements are done in DSR to save the b) Route Maintenance Phase
energy of nodes so that they can function effectively in
low power as well. There is remarkable improvement in 3.2 Proposed Work
the performance of DSR and finally the lifetime of Main objective of this paper is to analyze Minimum
MANET increases. Battery Cost Routing (MBCR) to develop Energy
Efficient Power Aware Multipath Dynamic Source
P.S. Patheja et al.(2012) Many routing protocols for Routing based on DSR.
Ad hoc networks have been proposed so far, the most
famous of which are the Dynamic Source Routing 1. To propose a new route discovery algorithm that
Protocols (DSR In the suggested work, the destination assumes the remaining energy for each node and uses a
will accept at most first three path request packets from cost function to choose the best power saving route.
the same source for the same communication (i.e. same 2. To suggest a new route maintenance algorithm that
ID). This gives the source, various paths from source to deals with the broken routes due to the nodal energy
destination for transmission. It then utilizes all the depletion and node mobility.
discovered routes for data transmission. These multiple
paths permit load balancing and faster delivery. IV. RESULTS AND ANALYSIS
4.1 Simulation Flow
Vinay Rishiwal et al.(2009) Much research efforts There are five states or steps of modeling the desired
have been dedicated to develop energy aware routing system represented by each rectangular box above. The
protocols. In this paper we propose an efficient horizontal arrows depict the actions to be taken in order
algorithm, which enhances the to move from a state to another, while the bent dashed
network lifetime by minimizing the power consumption arrows represent where the validation, verification and
during the source to destination route organization. As a credibility concepts are prominently established.
case study suggested algorithm has been incorporated
along with the path discovery procedure of AODV and
by simulation it is observed that suggested algorithms
performance is better as compare to AODV and DSR in
terms of different energy related parameters like Total
Energy utilization, Node Termination Rate , Average
Energy Left Per Alive Node, , and Network Lifetime
for different network scenarios.

III. PROPOSED WORK

3.1Problem Formulation
The complete lifetime of the entire ad hoc network can
be increased by improving the power consumption
balance among nodes and the connection of the
network. In most existing protocols, a mobile node may
Figure 4.1 - A valid, credible and appropriate
consume all its energy to participate in the operation
simulation model workflow
without assuming the remaining energy. Some of the
problems analyzed from the past study are:
4.2 Simulation Model
1. Route discovery - Route discovery compose of two
sub-procedures: Route Request (RREQ) and Route Our simulation model was carried out using the NS2
Replay (RREP). Route discovery is the procedure by network simulator. NS is an event driven network
which a node willing to send a packet to a destination simulator program, invented at the University of
node finds a route. . California Berkley, which includes many network
2. Route maintenance - Route maintenance is the objects like as protocols, applications and traffic source
procedure by which node S is able to identify, if the behavior. The NS is a part of software of the VINT
network topology has changed such that it can no project that is supported by DARPA since 1995.
longer use its path to D because a link besides the route
no longer works.
At the time of route discovery, (RREQ) a route request
packet broadcasted by the source. The header of the
RREQ packet includes <source-id, destination-id,

200 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

this metric. The network lifetime can be defined in

many ways:
1. It may be defined as the time taken for % of the
nodes in a network to die.
2. It might be the time taken for the first node to expire.

3. It can also be the time for all nodes in the network to

Figure 4.2 NS-2 Schemas
die.
For analysis the first & third definition is adopted.
At the simulation layer NS uses OTcl (Object oriented
Network lifetime of DSR and DSR-PSR are compared.
Tool Command Language) programming language to
explain user simulation scripts. As shown in Figure 5.2
an OTcl script written by a user is explained by NS.
While OTcl script is being interpreted, NS creates two
main analysis reports concurrently. One of them is
NAM (Network Animator) object that presents the
visual animation of the simulation. The other is the
trace object that contains the behavior of all objects in
the simulation. Both of them are created as a file by NS. Table 4.1 First dead nodes with simulation time

4.2.1 Tcl Language in NS In the table 4.1 there is a comparison between the
TCL is a powerful interpreted programming language. number of dead nodes in the simple DSR and the
NS-2 simulator is used for performance evaluation. The modified DSR. Table 4.1 depicts that at simulation time
network is a collection of 50 nodes deployed on square 50 the number of dead nodes in simple DSR is 3
area of 1500mx1500m. transmission range of each node whereas the number of dead nodes in modified DSR is
is 250 m. The medium access control (MAC) protocol only 1. Later on as the simulation time increases the
based on IEEE 802.11 with 2 Megabits per second raw number of dead nodes in simple DSR is more compared
capacity. For radio propagation model, a two-ray to the number of dead nodes in modified DSR
ground reflection pattern is used. In all simulations, we
will use the RWP (Random waypoint) mobility model .
25
Each node moves with a maximum speed randomly
selects from the interval [5 m/s, 15 m/s]. The duration 20
of every simulation is 0-1200 seconds, executed with Number of
different mobility scenarios characterised by different 15 dead nodes
pause times. in DSR
Communication between nodes is designed by CBR 10
Number of
(Constant Bit Rate) traffic over UDP. A source dead nodes
5
generates with a rate of five packets per second ,packets in DSR-PSR
of 512 bytes. A total of 8 connections were generated. 0
They start at a time randomly selects from the interval
100
150
200
250
300
350
0
50

[0s, 100s] and still active till the end of simulation.

As the remaining energy level of a node minimizes, the Figure 4.3 Graph for dead nodes with simulation
link cost of the node increases. This stresses new time
routing decisions in the network by invalidating its own
The figure 4.3 depicts the graphical view of comparing
cache entries to different destinations. However, if a
of number of dead nodes between the old i.e simple
path was recently added to the cache table, the node DSR and the modified DSR-PSR.
will not force (route finding step) a new decision unless
the nodes remaining energy is depleted by a certain
normalized amount due to messages passing through
that path.
The key parameter of study is the network lifetime. We
vary the various parameters and study their reaction on

201 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

topological changes resulting from the mobility of the

nodes.The overall lifetime of the complete ad hoc
network can be increased by improving the power
utilization balance among nodes and the connection of
the network. In most existing protocols, a mobile node
may utilize all its energy to take part in the operation
without considering the remaining energy. In the
proposed energy efficient DSR protocol each node will
only use part of energy to dispatch the data packets.
This is done through a route discovery procedure. The
new protocol uses a cost function to decide path
selection instead of using the traditional shortest hop
algorithm. The cause that DSR is used as our base
model is basically due to the fact that it is a typical on
Table 4.2 Comparison for all dead nodes with
simulation time demand protocol with less bandwidth and energy use.

The above table 4.2 shows that in the simple DSR at REFERENCES
[1]. Palak, Nasib Singh Gill,Study of Energy Consumption in DSR
simulation time of 1150 secs the 100% node dies i.e 50
using NS2, Vol. 3, Issue. 7, July 2014, pg.531 535.
node dies taken at the starting of simulation for testing
whereas in the modified DSR the 82% of nodes are still [2] Kavita Sharma,vivek Sharma, Energy Efficient Power Aware
alive i.e the number of dead nodes are only 9, the Multipath Dynamic Source Routing, Volume 77 No.4, September
remaining 41 nodes are still alive. There is a simulating 2013.
correlation across the numbers of all expired nodes for
the system taken for 50 nodes 4ith simulation time [3] NANDINI PRASAD K S, PUTTAMADAPPA C, Design and
varies from 0-1200secs in the table 4.2. Performance Analysis of Energy Aware Routing Protocol for Delay
Sensitive Applications for Wireless Sensor Networks, VOL. 1, NO.
2, JULY 2013, 4653.

120 [4] Md Shahid Akhter, Vijay Prakash Singh, MODIFIED POWER

SAVING DSR PROTOCOL FOR MANET, Vol. 2, Issue 6, June
100 100 2013.
9296
8286 [5] P.S. Patheja , Akhilesh A. Waoo , Lokesh Malviya, Multipath
80
7476 Dynanic Source Routing Protocol for Ad-Hoc Network, Volume 2,
6266 Perce Issue 3, March 2012.
60 56
52 ntage
48
40 384246 Of [6] Vinay Rishiwal , Mano Yadav , S. Verma, S. K. Bajapai, Power
34 Aware Routing in Ad Hoc Wireless Networks, Vol. 9 No. 2 October
20 2009.
16161618
6 6 8 8 8 101010101212
0 4 [7]. Breed. G, "Wireless ad hoc networks: Basic concepts. In High
Frequency Electronics", pages 4446, 2007.

[8] Valera. A. C, Seah. W. K. G, and Rao. S. V. "Cooperative packet

caching and shortest multipath routing in mobile ad hoc networks", In
INFOCOM IEEE Computer Society, 2003.
Figure 4.4 Graph for all dead nodes with simulation
time [9]. Ehsan Khosrowshahi Asl, Morteza Damanafshan, Maghsoud
Abbaspour Majid Noorhosseini, Kamran Shekoufandeh "EMPDSR:
The figure 4.4 depicts the graphical view of comparing An Enhanced Multipath Dynamic Source Routing Algorithm for
of number of all dead nodes between the old i.e simple MANETs Based on Ant Colony Optimization" 2009 Third Asia
DSR and the modified DSR taken for simulating 50 International Conference on Modelling & Simulation IEEE.
nodes for the system.
[10]. J. Broch, D. B. Johnaon, and D. A. Maltz, Dynamic Source
V. CONCLUSION AND FUTURE SCOPE Routing (DSR) Internet Draft, draft-itelf-manetdsr-03, txt, 1999.
A MANET is a kind of ad hoc network that can change
Anurag Tripathi M.Tech student MVVEC, JAGADHRI
locations and framing itself on the fly. Routing in ([email protected])
MANET is challenging due to the restrictions existing
on the transmission bandwidth battery power and CPU Kamal Kumar MVVEC, JAGADHRI Assistant Professor ECE
Department ([email protected])
time and the requirement to manage with the recurrent

202 www.erpublication.org
International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016

203 www.erpublication.org