Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features

ISSN: 2321–7529(Online) | ISSN:2321–7510 (Print) International Journal of Research & Technology, Volume 3, Issue 4_November_2015
www.ijrt.org 41
Efficient and stable route selection by using cross layer concept for highly mobile network
with predictive features
Rupali Singh, Gajendra Singh Dhakad
Dept. of CSE, NITM (M.P)
Email: Rupalis327@gmail.com , gajendranitm@gmail.com
ABSTRACT:- Link failure and power failure (due to high
power losses) are common issues in MANET which causes
due to movements of nodes in their network. Due to
movements of nodes, their neighbor positions vary with
their movements and change in routing topology may take
place which causes more links will break down which causes
more power dissipation and due to breakage in network
packet loss will take place. So for efficient and stable route
selection we are using a new concept i.e. cross layer concept.
In this concept we focus on the cross-layer design between
two major layers of the mobile end-system, the routing layer
and the middleware layer. They work together to facilitate
multimedia data accessibility for various applications at the
end-systems. In this technique each node calculate signal
strength of neighbour and also calculate mobility if mobility
is greater than threshold it will Receive the RREQ from
neighbour node on the basis of signal strength otherwise it
select on the basis of traditional AODV parameter
minimum hop count with default transmission range for
packet receiving, this procedure is followed up to
destination node, at destination, node reply all RREQ which
is received by destination and send it to sender node. After
that sender sends data through this route which have
minimum hop count, with the help of this method we can
select most stable path among all route. Thus this algorithm
helps us in finding stable and efficient route in our MANET.
I. INTRODUCTION
Networks are classified into two main types based on
connectivity, wired and wireless networks. A wireless network
provides flexibility over standard wired networks. Only with
the help of wireless networks, the users can retrieve information
and get services even when they travel from place to place. The
single-hop and multi-hop Mobile Ad-hoc Networks (MANET)
are the two major classifications of wireless networks. Base
stations are used in single-hop networks to accomplish
communication between nodes. MANETs [1] are infra-
structure-less, self-organizing networks of mobile nodes
without any centralized administration like base stations. The
communication between nodes is accomplished via other nodes
which are called intermediate or forwarding nodes. So there is
a need of a routing procedure between nodes. And hence the
routing protocol plays a major role in MANET.
A mobile ad hoc network (MANET) is an autonomous
system comprising a set of mobile nodes that can move around
freely. Because MANETs do not need any fixed infrastructure
and can be easily and quickly deployed they have been
attracting high interest in both military and civil applications. A
MANET is generally formed as a multihop wireless network
due to limited transmission range of wireless transceivers.
Routing plays an important role in the operation of such a
network. Each node acts as both a router and a host.
An ad hoc network consists of mobile nodes which
communicate with each other through multi-hop routes. To date,
numerous routing protocols [10] have been proposed. Many of

www.ijrt.org 42
them well address the problem of establishing and maintaining
the routes in a dynamically changing network topology.
However, most routing protocols are designed with less emphasis
on the issues at the lower layers. These include the variable link
capacity at the physical layer and the fluctuating contention level
at the MAC layer. In this paper, we attempt to bridge this gap by
introducing a cross layer design concept. By exploiting the lower
layer channel information, such as the variable link capacity
through spectrally efficient rate adaptation and contention level
estimation at the MAC layer, we will show that significant
performance enhancement in both the network throughput and
delay are achievable. Thus, we take an ”active” approach in
designing an ad hoc networking protocol with more realistic and
detailed wireless channel model. It is worthwhile to mention that
in this paper we are taking a channel-adaptive approach– rather
than a quality-of-service driven approach–of cross layer
networking such that the channel-adaptive information is flowing
from the lower layer to the higher one, with the objective of
maximizing the network throughput; the resource allocation
message and decisions made at the higher layer with a more
global view of the network are flowing downward. Adaptive
modulation transmission techniques [3] were first proposed for
cellular mobile systems as a means to increase the spectral
efficiency in a point to point link. When the channel estimate is
available at the transmitter, a transmission scheme can be
adaptively selected in accordance with the learned channel
parameters. It is shown in [3] that spectral efficiency is optimized
by joint rate and power adaptation when the channel side
information is used at the transmitter. Practical rate and power
adaptation modulation techniques [2] have also been investigated
and shown to achieve near optimal spectral efficiency. Rate
adaptation techniques has also been applied to mobile ad hoc
networks. The request to send (RTS) packet and the clear to send
(CTS) packet defined in the IEEE 802.11 standard could be
exploited to perform channel estimation and to feed receiver’s
estimate of the channel back to the transmitter. In [9], a rate
adaptation mechanism is introduced for frequency hopping
systems. Transmission rate is adjusted based on the number of
erasures and errors in the received packets. In [5], a rate adaptive
MAC algorithm, similar to ours but developed independently, is
proposed. Explicit channel parameter estimation is mandatory in
most advanced transceiver systems for robust and spectrum
efficient performance [8]. With a simple cross layer
communications between the MAC and Physical layers, we could
achieve a large performance improvement without incurring any
significant overhead. Wireless technologies have become
popular. Since portable devices like mobile phones, computers,
laptop and personal digital assistance require fixed infrastructure
such as base stations or access point, so they need an access to a
static network to support their mobile device services. To provide
a solution to this problem Mobile Ad hoc Networks (MANETs)
have evolved.
MANETs are autonomous systems consisting of mobile
hosts that are connected by multi-hop wireless links. MANETs
are decentralized networks that develop through self-
organization. MANETs is formed by a group of nodes that can
transmit, receive and relay data among themselves. In a mobile
ad hoc network there is no fixed infrastructure therefore the
mobile hosts communicate over multihop wireless links. These
are often called infrastructure-less networking since the mobile
nodes in the network dynamically establish routing paths
between them.
In MANETs the nodes communicate over a reliable
wireless links within the transmission range of each other. In
large MANETs, if two hosts are not within the communication
range of each other they communicate if other hosts lying in
between are willing to forward packets for them. Therefore,
every node participates in multi-hop routing to reach all nodes in

www.ijrt.org 43
the network. Flooding is a cause of routing in MANETs which
leads to degradation of the efficient use
of bandwidth and depletes battery-power of nodes [4, 5].
It searches for route when required by source node i.e. on
demand. It possesses the characteristic of maintaining the routes
in the case of dynamic network where each node is moving. It
incurs low processing and memory overhead which in turn
minimizes the overall network utilization makes it appropriate
for the MANET. Furthermore, this protocol makes use of
sequence number for loop freedom mechanism in each route. The
steps to send a packet from sender to destination through AODV
are as follows: Firstly, the source node starts route discovery
through broadcasting Route Request (RREQ) packet then
adjacent nodes will forward RREQ until the packet is reached at
the destination or RREQ arrives at the node that has a new fresh
route to the destination. Secondly, a Route Reply (RREP) is sent
by receiver to the source (originated route). Once the sender-node
receives a RREP, it can initialize using this path for data packet
transmission. In the case of link failure, Route Error (RERR) is
sent back to the source node. It is generated by the node at which
link failure is occurred.
II. RELATED WORK
In Holmer [1] the authors proposed a new network metric the
medium Time Metric (MTM), which is derived from a general
theoretical model of the reachable throughput in multi-rate ad hoc
wireless networks. The MTM avoids using the long range link
favored by shortest path routing in favor of shorter, higher
throughput, more reliable links.
Kathor [15] proposed a mechanism based on signal strength and
energy for routing in MANET, this protocol is used for reducing
the cases of link breakage and power failure.
Patil [16] states an another technique for low link failure i.e. a
system which eliminates the noisy signals received at the
physical layer by comparing the signal to interference noise
ratio with the signal to noise threshold value.
In Gomez [8] the authors propose a new power-aware routing
technique for wireless ad hoc networks (PARO) where all nodes
are located within the maximum transmission range of each
other. PARO uses a packet forwarding technique where
immediate nodes can elect to be redirector on behalf of source
destination pairs with the goal of reducing the overall
transmission power needed to deliver packet in the network, thus,
increasing the operational lifetime of network devices.
In De Couto [4] the authors show that the minimum hop path
generally contains Cross-Layer Simulation and Optimization for
Mobile ad hoc Networks 15 links which exhibit low reliability.
In Dube [5] and Nordstrom [10] the authors present routing
protocols which are based on signal stability rather than on only
a shortest path in order to provide increased path reliability.
Based on the IEEE 802.11 protocol,
The Receiver Based Auto Rate (RBAR) protocol was
presented in Vaidya [9]. RBAR allows the receiving node to
select the rate. This is accomplished by using the SNR or the RTS
packet to choose the most appropriate rate and to communicate
that rate to the sender using the CTS packets. This allows much
faster adaptation to the changing channel conditions than ARF,
but requires some modifications to the 802.11 standard.
The Opportunistic Auto Rate (OAR) protocol which is presented
in Sabharwal [3], operates using the same receiver based
approach, but allows high-rate multipacket burst to take
advantage of the coherence time of good channel conditions. The
bursts also dramatically reduce the overhead at high rates by
smoothing the cost of contention period and RTS CTS frames
over several packets.
CROSS LAYER DESIGN OF SYSTEM FRAMEWORK
In this paper, we focus on the cross-layer design between two
major layers of the mobile end-system, the routing layer and the

www.ijrt.org 44
middleware layer. They work together to facilitate multimedia
data accessibility for various applications at the end-systems.
SYSTEM FRAMEWORK:- The architecture of our system
framework shown in Figure 1 includes: (1) an application layer
that produces and shares multimedia data with other users in the
network; (2) a middleware layer that runs the data accessibility
service to assist applications in locating, accessing, and
replicating data; and (3) a routing layer that computes feasible
routes and forwards packets to other mobile nodes in the
network. As part of the framework, the routing and the
middleware layers share information with each other, in the
form of system profiles, to achieve a higher quality in accessing
data. For instance, in a map viewing application, each mobile
user generates images showing events happening at some
geographic locations. Other users should be able to browse
through the description of available images, and retrieve those
that are needed. The system relies on data replication to avoid
the problem of missing data when network partitioning occurs.
III. PROPOSED PLAN
In Route discovery phase each node calculate signal strength of
neighbour and also calculate mobility if mobility is greater than
threshold it will Receive the RREQ from neighbour node on the
basis of signal strength otherwise it select on the basis of
traditional AODV parameter (min hop count with default
transmission range for packet receiving, this procedure is
followed up to destination node, at destination, node reply all
RREQ which is received by destination and send it to sender
node. After that sender sends data through this route which have
minimum hop count, with the help of this method we can select
most stable path among all route.
This method also enhanced the maintainance phase, in this
phase every node monitor’s own energy if it is less than
threshold then node send the alert message to sender node for
searching new path before link failure ,
This approach will reduce the link failure and also
select best stable path for communication which will enhance
the performance of AODV protocol.
Algorithm:
This method work in two phase
1. Route Discovery
2. Route maintanance
Route Discovery
Threshold values : STH1, STh2, mobility threshold, Energy
Threshold(which is 40% of initial energy) .
If S (source) wants to send data to D (destination) then
{
AODV protocol () // finds route between S &D{
For (each node between S and R)
{
Calculate signal strength and relative mobility between two
consecutive nodes in the path
If (node’s mobility > mobility threshold)
{
If (Signal Strength >= SIGNAL_THRESHOLD2)
{
Accept RREQ packet
Before sending packet to next hop node
checks
If (node energy >=
ENERGY_THRESHOLD) then
{
Process RREQ Packet/data packet.
}
Else (Send RERR message to Source node)
{

www.ijrt.org 45
Select alternative route for data
transmission.
}
}
Else
Discard RREQ packet
}
Else
{
If(1<node’s mobility < mobility threshold)
{
If (Signal Strength >=
SIGNAL_THRESHOLD1)
{
Accept RREQ packet
Before sending packet to next hop node
checks
If (node energy >=
ENERGY_THRESHOLD) then
{
Process RREQ Packet/data packet.
}
Else (Send RERR message to Source node)
{
Select alternative route for data
transmission.
}
}
Else
Discard RREQ packet
}
Else
{
Node select on the basis of default
transmission range
}
}
}
Destination Node Sends Route Reply to Source.
IV. SIMULATION RESULTS
[1] End to End delay:- The end-to-end delay of a packet is
defined as the time it takes to reach the destination after it is
locally generated at the source. The expected end-to-end
packet delay is obtained by averaging over all packets of the n
traffic flows in the long term, and without incurring any
ambiguity, it is called the packet delay for brevity.
Notice that the end-to-end packet delay includes not
only the packet delivery delay [5], but also the packet queuing
delay at the source. If we denote by Te the end-to-end packet
delay, then we have the following theorem.
From the above analysis we get its simulation result for End to
end delay is given as
mobility SEAODV CCPFAODV
10 133.67 77.58
12 23.25 14.2
16 31.4 22.99
18 33.1 13.38
20 30.62 18.14
26 25.2 16.33
And its graphical representation is given as

www.ijrt.org 46
Energy Consumption: - In general there are three components
to energy consumption in ad hoc networks. First, energy is
consumed during the transmission of individual packets.
Second, energy is consumed while forwarding those packets
through the network. And finally, energy is consumed by nodes
that are idle and not transmitting or forwarding packets. To
understand how and when energy is consumed in ad hoc
networks, it is necessary to consider these costs for data packets
forwarded through the network and for control packets used to
maintain the network. To lay the groundwork for discussing
energy efficient communication protocols in ad hoc networks.
6 5.69 5.64
8 5.67 5.65
14 5.8 5.73
16 5.78 5.67
22 5.73 5.63
24 5.72 5.62
26 5.77 5.64
Throughput:- It is defined as the total number of packets
delivered over the total simulation time. The throughput
comparison shows that the three algorithms performance
margins are very close under traffic load of 50 and 100 nodes
in MANET scenario and have large margins when number of
nodes increases to 200. Mathematically, it can be defined as:
Throughput= N/1000
Where N is the number of bits received successfully by all
destinations.
From the above analysis we get its simulation result for
Throughput is given as
2 57.53 58.35
12 56.81 58.07
20 57.76 58.63
26 57.63 58.08
28 57.69 57.89
30 58.38 58.51
And its graphical representation is as shown in figure
0
50
100
150
0 10 20 30
Chart Title
SEAODV CCPFAODV
98.6
98.8
99
99.2
99.4
99.6
99.8
100
0 10 20 30
PDR
SEAODV CCPFAODVMobility

www.ijrt.org 47
Normalized Routing Load:- Number of routing packets
“transmitted” per data packet “delivered” at destination. Each
hop-wise transmission of a routing is counted as one
transmission. It is the sum of all control packet sent by all node
in network to discover and maintain route.
NRL = Routing Packet/Received Packets
From the above analysis we get its simulation result for
Normalized routing load is given as
2 0.177 0.131
10 0.593 0.336
12 0.499 0.358
16 0.441 0.391
18 0.466 0.302
22 0.361 0.296
24 0.461 0.37
28 0.468 0.351
30 0.451 0.438
And its graphical representation is as shown in figure
V. CONCLUSION
Our idea helps us in finding a stable and efficient route having
maximum energy and signal strength so that it can participate
in active communication for long duration and life of nodes can
be increase. Simulation results shows that our proposed
algorithm is better than SEAODV on behalf of all parameters
i.e. NRL, Energy consumption, throughput and end to end
delay. In future work is to implement the proposed scheme on
multipath routing so that route discovery process is not initiated
in a mobile environment.
REFERENCES
[1] D. Holmer B. Awerbuch and H. Rubens. High throughput
route selection in multi-rate ad hoc wireless networks. In
proceedings of Wireless On-demand Network Systems WONS
2004, Madonna di Campiglio, Italy, 2004.
[2] M. Becker, AL. Beylot, and R. Dhaou. Aggregation methods
for performance evaluation of communication networks,
performance evaluation. n proceedings of International
Symposium of Performance evaluation - Stories and
Perspectives, Vienna, Austria, Eds: G. Kotsis, pp 215-230, 2003.
[3] A, Sabharwal B. Sadeghi, V. Kanodia and E. Knightly.
Opportunistic media access for multirate ad hoc networks. In
proceedings of ACM MOBICOM 2002, Atlanta, GA, 2002.
56.5
57
57.5
58
58.5
59
0 10 20 30 40
Through put
SEAODV CCPFAODV Mob
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0 10 20 30 40
NRL
SEAODV CCPFAODV Mobi

www.ijrt.org 48
[4] D. De Couto, D. Aguayo, B. Chambers, and R. Morris.
Performance of multihop wireless networks: Shortest path is not
enough. In The First Workshop on Hot Topics in Networks
(HotNets-I), Princeton, New Jersey, October 2002. In
proceedings of ACM SIGCOMM.
[5] R. Dube, C Rais, K. Wang, and S. Tripathi. Signal stability
based adaptive routing (ssa) for ad hoc mobile networks. IEEE
Personal Communication, 1997.
[6] M. Conti G Anastasi, E. Borgia and E. Gregori. IEEE 802.11
ad hoc networks: Performance measurements. In proceedings of
Distributed Computing Systems Workshops ICDCSW'03, Rhode
Island, USA, May 2003.
[7] Vincent Gauthier. Adov-uu with cross-layer, 2004. French
National Institute of Telecommuncation, http : //www-rst. int-
evry . f r/~gauthier/.
[8] J. Gomez, A .Campbell, M. Naghshineh, and C. Bisdikian.
Paro: Supporting dynamic power controlled routing in wireless
ad hoc networks. ACM/Kluwer Journal on Wireless Networks
(WINET), 9(5), 2003.
[9] N. H. Vaidya G. Holland and P. Bahl. A rate-adaptative mac
protocol for multihop wireless networks. In proceedings of
Mobile Computing and networking, 2001.
[10] E. Nordstrom H. Lundgren and C. Tschudin. Coping with
communication gray zone in IEEE based ad hoc networks. In
proceedings of WoWMoM, 2002.
[11] Bingyi Guo, F. Richard Yu, Shengming Jiang, Xin Ao, and
Victor C. M. Leung,” Energy-Efficient Topology Management
With Interference Cancellation in Cooperative Wireless Ad
Hoc Networks” in IEEE transactions on network and service
management, vol. 11, no. 3, september 2014
[12] Sajal Sarkar and Raja Datta,” A Secure and Energy-
Efficient Stochastic Routing Protocol for Wireless Mobile Ad-
hoc Networks” in IEEE transactions on network and service
management, vol. 11, no. 3, september 2014
[13] Wei Sun, Zheng Yang, Xinglin Zhang, and Yunhao Liu,”
Energy-Efficient Neighbor Discovery in Mobile AdHoc and
Wireless Sensor Networks: A Survey” in IEEE
communications surveys & tutorials, vol. 16, no. 3, third quarter
2014
[14] Javad Vazifehdan, R. Venkatesha Prasad, and Ignas
Niemegeers,” Energy-Efficient Reliable Routing Considering
Residual Energy in Wireless Ad Hoc Networks” in IEEE
transactions on mobile computing, vol. 13, no. 2, february 2014
[15] krittika khator & nitin manjhi,” optimize signal strength
and energy efficient mechanism for link failure in manet” in
International Journal of Computer Networking, Wireless and
Mobile Communications (IJCNWMC) Vol. 5, Issue 1, Feb
2015, 1-12
[16] Rekha Patil, Vijay K Kerji,”SINR Based Routing For
Mobile Ad-hoc Networks” in IEEE 2011

Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features

More Related Content

What's hot (16)

Viewers also liked (15)

Similar to Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features (20)

Recently uploaded (20)

Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features