A Survey on Cross Layer Routing Protocol with Quality of Service

IJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 10, 2015 | ISSN (online): 2321-0613
All rights reserved by www.ijsrd.com 481
A Survey on Cross Layer Routing Protocol with Quality of Service
Sejal Patel1 Falguni Patel2
1,2
Department of Computer Engineering (System and Network Security)
1,2
SVIT Gujarat Technological University
Abstract— Wireless is playing the wide role in today’s
industrial application. Central idea of this paper is to enhance
quality of service (QoS) for multimedia transmission over ad-
hoc network. This paper describes the operational of different
QoS routing protocols, their properties and various
parameters advantages and disadvantages. Also describes the
use of QoS in Cross layer routing protocol. Finally, it
concludes by study of all these cross layer QoS routing
protocols.
Key words: Qos, Ad-hoc Network, MAC, Multimedia.
I. INTRODUCTION
The development of technology, devices have shrunk in size
and they at the present incorporate more advanced functions.
Allowing a node to act as a wireless terminal as well as a
repeater and still be compressed enough to be mobile [1]. A
self organizing and adaptive collection of such devices
connected with wireless links is now referred to as an Ad Hoc
Network. The provision of quality of service (QoS)
guarantees is to a great extent challengeable and difficult in
ad-hoc networks than traditional wired networks. It is mainly
due to node’s movement, hop-to-hop communications,
channel access contention, and a lack of central coordination.
For most multimedia and other time sensitive applications,
the QoS guarantees are very much needed. The QoS routing
protocol is an integral part of any QoS solution since its
function is to discover which nodes, if any, are able to serve
applications’ requirements (e.g. bandwidth/delay). So in this
paper author presents a study of various QoS based routing
protocols in Ad-hoc network. Depending on the application
involved, the QoS constraints could be available bandwidth,
end-to-end delay, delay variation (jitter), probability of
packet loss, and so on. This kind of demand put additional
pressure on the network and the routing protocols which are
used to support the communications.
II. IMPORTANT PARAMETERS OF THE QUALITY OF SERVICE
- Throughput of Network: Represent the total number of
bits (in bits/sec) is forwarded from wireless LAN layers
to higher layers in all nodes of the network.
- Retransmission Attempts: Total number of
retransmission attempts by all WLAN MACs in the
network until either packet is successfully transmitted or
it is useless as a result of reaching short or long retry
limit.
- Latency: This parameter is measured in units of time
and refers to the total passed time, since the package is
transmitted by the source until it comes to its destiny.
- Loss of packages: This is happen for the
blocking/congestion of channels of transmission and
because of this the packages do not reach their final
destination.
- Data Dropped: Data dropped caused by unavailability of
access to medium.
- Medium Access Delay: It is include the total of queuing
and conflict delays of the data.
III. LAYERED ARCHITECTURE
OSI architecture is allowing each layer to be extracted
independently. However, the firmly layered architecture
might not be the best model, because often times it is not
possible to optimize the network performance according to
different situations without interaction along with the
different layers.
Application Layer
(This layer generate multimedia packets and assign priority)
Transport layer
(Implement Slow start & AIMD mechanism)
Network layer
(Implement AODV and DSR algorithms)
MAC layer
(Implement EDCF&DCF algorithm)
Fig. 1: Layered structure
A cross-layer design is used to alter the transmission
rate in transport layer and offer channel information to the
MAC layer from the physical layer. The receiving data rate
register is used to calculate the receiver’s actual receiving
packet rate,
Receive Packet Rate
=
(NewAckpackets – OldAckpackets)
(NewAckTime – OldAckTime)
IV. SOME APPROACHES BASED ROUTING PROTOCOLS
A. AODV (Ad Hoc On-Demand Distance Vector)
AODV is an ad-hoc on demand distance vector routing
protocol which is an on demand reactive protocol. It is mean
that whenever a node has some information to send then
firstly it checks for a path. If the path exists then it sends the
packets from side to side, but if not then a route discovery
process is initiated. For this the route request packets (RREQ)
are generated by the source nodes. RREQ packet contains the
IP addresses of source and destination node and sequence
number. Sequence numbers are used for loop prevention and
as route freshness criteria. These RREQ packets (P) are
broadcasted to all the nodes via flooding. Source node is
broadcast the RREQ packets to all its neighbors. Each node,
receiving P is forward to its neighbors. In this way it is reach
to its certain node. As the RREQ packet is received by any
node it is set up a reverse route entry for the source. Using
the reverse route entry a node can send a route reply packet
(RREP) to the source. These packets are sending by
unicasting and not by flooding. Whenever an transitional
node receives the RREP it sets up forward path entry to the
destination and therefore a path is established for
communication. In case of AODV a node gets information
about its neighbor by exchanging hello packets. If no reply of
hello packet is received then it is mean that node is out of

(IJSRD/Vol. 3/Issue 10/2015/099)
order. If there is a break in the path then RERR i.e. route error
packet is generated. It is propagated to all the affected
destinations. When a source node receives RERR then it is
reinitiate the route discovery.
B. DSR (Dynamic Source Routing)
DSR is dynamic source routing which is a reactive protocol
or on demand protocol. Its routing mechanism is similar to
AODV except it uses caches to store routes and it does not
contain any interrupted activity of transmitting hello
messages. It utilizes source routing means entire route is a
part of the header. When a node wants to send a packet but it
does not know a route to the destination, it initiates a route
discovery by flooding route request packet (RREQ). RREQ
packet consist sender’s and destination’s address. Each node
appends its own identifier when forwarding RREQ packet.
When the intended node receives RREQ packet then it
acknowledges by sending route reply packet by reversing the
route in header of RREQ and unicast it to the sender. On
receiving RREP the source node reserve the route included in
the RREP. When a source node sends a data packet to
destination the entire route is included in the packet header
therefore the name source routing. Whenever any link of
route is broken then the corresponding node generates RERR
i.e. route error packet. If the node receives RERR packet then
it searches its own reserve to find an alternate route.
C. IEEE802.11 MAC Protocol
The IEEE 802.11 MAC uses a distributed coordination
function (DCF), which is based on Carrier Sense Multiple
Access with Collision Avoidance (CSMA/CA), as the
fundamental mechanism for channel access. In the DCF
model, the medium have to be sensed free for a time interval
greater than the Distributed Inter Frame Space (DIFS) before
a node is allowed to transmit. If the medium is not sensed free
for DIFS time, the transmission is delayed a random time
interval between 0 and Contention Window (CW) times the
timeslot. IEEE 802.11 exponentially doubles its contention
window when a collision occurs, and it returns to the
minimum contention window upon a successful transmission.
After the contention window is backed off to a maximum
value, the MAC layer is report a transmission failure to the
higher layer protocols and drops the packet. DCF uses a four
way handshake, known as request-to-send (RTS)/clear-to-
send (CTS)/Data/ACK. Before transmitting a packet, the
source node sends an RTS message, and the destination sends
CTS back to the source node. The nodes that can hear either
the RTS or CTS set in their network allocation vector (NAV)
according to the amount of time that will be used for
exchanging the remaining data, as indicated in the RTS and
CTS packets. This is intended to solve the “hidden terminal”
problem. Providing support for real-time data transmission is
an important yet challenging goal for MANETs and
implements IEEE 802.11e to improve QoS at the MAC layer.
D. IEEE 802.11e MAC Enhanced DCF (EDCF)
IEEE 802.11e [2] is a standard based on IEEE 802.11 for
support of QoS in MANETs. QoS is provided by setting up
different Traffic categories (TCs). Each TC has different
contention parameters such as Arbitration Inter frame Space
(AIFS) values, maximum and minimum back off window
size, and multiplication factors. Using these different
contention parameters, virtual competition among traffic
categories is created for accessing the channel. The DCF is
supposed to provide a channel access with equal probabilities
to all stations challenging for the channel access in a
distributed manner. However, equal access probabilities are
not advantageous among stations with different priority
frames. The rising EDCF is designed to provide
differentiated, distributed channel accesses for frames with 8
different priorities (from 0 to 7). The EDCF adopts eight
different priorities that are advance mapped into four access
categories (ACs). ACs are achieved by differentiating the
arbitration inter frame space (AIFS), the initial window size
and the maximum window size.
E. Multichannel MAC Protocol Supporting Qos
Here, a multi-channel MAC protocol that having the quality
of the service (QoS). QoS is being categorizes as two kinds
of traffic, real-time traffic and data traffic. Here, each stage
represented as beacon interval. Beacon interval is generally
divided into two phases, control phase and data phase.
Fig. 3: Proposed Multi-Channel MAC Protocol
1) Control Phase:
In this phase, the nodes compete with back off algorithm by
exchanging control message containing information on
packet duration, channel list and traffic characteristics.
This phase is divided into two regions, C1 and C2. C1 for the
real time traffic users (Ur) compete each other prior to
contention of the data traffic users (Ud), and C2 for every
user contends together with the same priority.
2) Data Phase:
In this phase, Ur transmits the packet before the transmission
of Ud. Ur has reserved transmission in C1 goes into data
phase and hops to the agreed channel at the end of C1, and
other users who have agreed in C2 go into data phase and
move to the established channel at the end of C2. On the
established channel, all nodes transmit packets in order of
agreements in control phase, but data users cannot start
transmission until the sending of Ur ends. Since all nodes
know data channel information about how many Ur or Ud
exists and how long the packet will be transmitted, they can
start transmission in the right order.
F. 4.6 X-EDCA
A cross-layer using MAC is used known as X-EDCA. EDCA
is Enhanced distributed channel access. For static resource
allocation in IEEE 802.11e dynamically adding MAC
parameters provide efficiency. The route alteration takes
place by monitoring the multimedia traffic characteristics. X-
EDCA deals with high load situations in wireless networks
and selectively gives priority and protection to sensitive
multimedia frames. For the situation where blockage occurs
which are mostly present in wireless infrastructure due to the
downlink and uplink problem and characteristics of audio and
video.

Fig. 4: X-EDCA architecture
First step for categorizing frames by two modules,
first Mapping Algorithm (MAL) and second the MAC-layer
Strategy Selection Algorithm (SSAL).As both audio and
video multimedia files can be sent therefore initially they are
categorized into the respective categories. I and P can be
considered as the video frames. B-frames are lowest
significance frames MAC categorize it low for receiving
lower priority. Selecting the appropriate strategy for each of
the multimedia AC by Strategy Selection Algorithm. TXOP
limit adaptation algorithm limit value for the AC_IP traffic
class is calculated every Service Interval (SI) which is distinct
as the time between the start of two subsequent TXOPs.
TXOP limit is computed as the time needed to successfully
transmit the en-queued frames:
TXOPlimit= ΣTframe + (n−1)Tsifsni=1 (1)
Tframe+TDATA+ TSIFS+TACK (2)
The term (n-1) 𝑇𝑠𝑖𝑓𝑠 in Eq. 1 accounts for all the
SIFS periods in between successive frame transmissions
during the TXOP. Eq. 2 does not contain any contention
waiting periods since at the start of the SI the contention is
already won by the AC_IP. The terms 𝑇𝐷𝐴𝑇𝐴 and 𝑇𝐴𝐶𝐾 are
the transmission times of the data and acknowledgment
frames correspondingly.
X-EDCA exploits the multimedia packet semantics
to selectively prioritize and protect important multimedia
frames as well as animatedly assign network resources. By
combining application level information and MAC layer
strategies, X-EDCA has proven to be extremely beneficial in
terms of QoS assessment metrics.
G. Ad hoc QoS on-demand routing protocol
This protocol basically deals with the reservation of the
resources based routing and signaling algorithm, Ad hoc QoS
on-demand routing (AQOR), that provides end-to-end quality
of service (QoS) support.
Neighborhood preservation, this is the initial step
where traffic, local topology and mobility information is the
output. Every node here needs to provide the “HELLO”
packet giving its survival within time to live period which is
set to 1 the nodes in network maintains the neighbor list N(I)
by which it sends and receives the Hello packets.
Route discovery, Route in next step is discovered
source demands route by Sending request for route and reply
packets to the destination with limited flooding. To begin a
route between source and the destination where destination is
not in the source’s neighborhood list, route request packet is
broadcasted containing Bmin and end-to-end delay Tmax.
For bandwidth admission if accepted an entry is made in
routing table with status of 2Tmax if no reply comes at entry
for the route is deleted and the packets coming late will be
ignored.
Admission control, the requested minimum flow
bandwidth Bmin should be selected and the maximum point
to point delay T should be guaranteed.
Bandwidth control, available link capacity should be
known to determine is there enough bandwidth available for
a new flow, a node can use the channel only when all its
neighbors do not transmit and receive packets at the same
time known as aggregation effect.
Bandwidth reservation, on receiving the first time
reply packet, the source S sends data packet of flow along the
reply route .so the available best route in perspective of
smallest end-to-end delay and bandwidth guarantee is chosen.
Reservations are done for availability of the resources to the
requesting flow when the real data flow comes at the
registered node. Reserved flows are subject deals with QoS
violations due to the channel behavior, mobility. So resource
freeways are Implied to free the reserved resources when not
used it is done automatically by the use of temporary
reservation, If the node does not receive successive data
packet of a reserved flow during the time period T interval By
default. Tinterval is function of minimum bandwidth
requirement Bmin of the flow, the need for explicit resource
release is eliminated.
Adaptive route recovery, Mobility and the shared
unreliable physical medium. QoS violation detection, end-to-
end QoS violations are caused either by end-to-end delay
violation because of channel decline or congestion along the
existing route or by route breaks due to node mobility or
power failure.
H. QAODV
Quality of service Ad-Hoc on Demand Distance Vector
Routing Protocol (QAODV) is an extension of AODV
protocol. In QAODV the message field can be extended by
adding fields like data rate, delay etc in order to improve the
parameter metrics. In this paper the simulations are
performed by adding data rate constraint as an additional field
in the RREQ packet. Every node after receiving the RREQ
packet, verifies if it can satisfy the condition, if not then it
discards the RREQ packet or else writing the RREQ entry
into its table flood the packet again into the network.
I. Power and Delay aware Multi-path Routing Protocol
(PDMRP)
The goal of this protocol is to select multi-paths having the
longest lifetime in the network without performance
degradation in terms of delay time. First step is to compute
the Cost of each route by using the following equation:
𝐶 =
𝑀𝐿
𝑁𝐻
This protocol provides the highest throughput
because, when there is a problem in the primary route, the
source continues sending packets to the destination by
quickly switching to a secondary route.

In this protocol, the source selects multipath and when there
is any problem in the primary path it switches to the
secondary path. So, the value of the loss rate is the lowest.
This protocol does not consider only the battery power as a
major challenge, but it also satisfies QoS requirements like
bandwidth and delay. Moreover, our routing protocol keeps
backup paths in order to rapidly switching to operational
routes when problems occur. PDMRP provides the shortest
end-to-end delay because it considers the number of hops
when selecting the primary path. Further, this protocol
performs better in terms of throughput and packet loss as it
takes into account the battery life of nodes and therefore
chooses a steady path.
Sr.
No.
Method &
Protocol
Drawbacks/Future Directions
1
Multichannel
MAC
protocol
In this protocol, Number of
channels is high and the packets
are long, and the divide phase
part is very sensitive to the
durations of the control and data
phases.
2 X-EDCA
In this algorithm dynamically
assign network resources, protect
important multimedia frames.
3 AQOR
AQOR’s route firm is quick and
reliable. It is Provide QoS
support in terms of bandwidth
and end-to-end delay. AQOR’s
traffic measurements and
admission decisions are accurate
and provide high
Channel utilization.
4 QAODV
In this protocol, End-to-End
delay is high. Therefore in future
scope, focus can be on improving
end to end delay.
5 PDMRP
This protocol is satisfying QoS
requirements (delay and
bandwidth). And also, Protocol
keeps backup paths, end-to-end
delay and loss rate better in terms
of throughput and packet loss.
FIG. 5:
V. CONCLUSION
In this survey paper, evaluate the performance of QoS
parameters of different protocols and different cross layer
mechanisms in ad hoc network. To improve the performance
of QoS we require to design of distributed medium access
control scheme like IEEE802.11e and proper packet
transmission mechanism like slow start with suitable routing
algorithm AODV and DSR. Then we get achievable
throughput, Packet Delivery Ratio, Bandwidth Delay Product
and packet loss in ad hoc networks.
REFERENCES
[1] Kumar, Sunil, Vineet S. Raghavan, and Jing
Deng."Medium access control protocols for ad hoc
wireless networks: A survey." Ad Hoc Networks 4.3
(2006): 326-358.
[2] J.Premalatha and P.Balasubramanie, “Enhancing
Quality of Service in MANETS by Effective Routing”,
ICWCSC, IEEE 2010
[3] Bhatt, Uma Rathore, et al. "Performance Analysis of
AODV and DSR Routing Protocols for MANET."
Communication Systems and Network Technologies
(CSNT), 2014 Fourth International Conference on.
IEEE, 2014.
[4] Bagwari, Ashish, et al. "Performance of AODV Routing
Protocol with increasing the MANET Nodes and its
effects on QoS of Mobile Ad hoc Networks.
"Communication Systems and Network Technologies
(CSNT), 2012 International Conference on. IEEE, 2012.
[5] Keming DU , Yilin CHANG and Bin Li ,“DSR- Based
Cross-Layer QoS Design in Ad hoc Networks ”
International Conference on Communications and
Intelligence Information Security, IEEE 2010.
[6] Kyung-Seop Shin, Se-Young Yun and Dong-Ho Cho,
“Multi-channel MAC Protocol for QoS Support in Ad-
hoc Network .“ IEEE 2011.
[7] Politis, Anastasios, et al. "X-EDCA: A cross-layer
MAC-centric mechanism for efficient multimedia
transmission in congested IEEE 802.11 e infrastructure
networks. " Wireless Communications and Mobile
Computing Conference (IWCMC), 2011 7th
International. IEEE, 2011.
[8] Xue, Qi, and Aura Ganz. "Ad hoc QoS on-demand
routing (AQOR) in mobile ad hoc networks." Journal of
parallel and distributed computing 63.2 (2003): 154-
165.
[9] Sarma, Nityananda, Sukumar Nandi, and Rakesh
Tripathi ."Enhancing Route Recovery for QAODV
Routing in Mobile Ad Hoc Networks." Parallel
Architectures, Algorithm, and Networks, 2008. I-SPAN
2008. International Symposium on. IEEE, 2008.
[10]Salwa Othmen, Aymen Belghith, Faouzi Zarai,
Mohammad S. Obaidat, Fellow of IEEE and Fellow of
SCS and Lotfi Kamoun, “Power and Delay-aware
Multi-path Routing Protocol for Ad Hoc Networks”
IEEE 2014.

A Survey on Cross Layer Routing Protocol with Quality of Service

More Related Content

What's hot (19)

Viewers also liked (16)

Similar to A Survey on Cross Layer Routing Protocol with Quality of Service (20)

More from IJSRD (20)

Recently uploaded (20)

A Survey on Cross Layer Routing Protocol with Quality of Service