The document presents the QoS-Oriented Distributed (QOD) routing protocol for hybrid wireless networks. QOD incorporates five algorithms: 1) a QoS-guaranteed neighbour selection algorithm, 2) a distributed packet scheduling algorithm, 3) a mobility-based segment resizing algorithm, 4) a soft-deadline based forwarding scheduling algorithm, and 5) a data redundancy elimination based transmission algorithm. The goal of QOD is to enhance QoS support in hybrid networks by leveraging both infrastructure networks and mobile ad hoc networks to meet stringent end-to-end QoS requirements. The document outlines the key components and objectives of the QOD protocol.

1. Presented by :
G.Vaishnavi. Mentor:
(11BK1A0516) Mr. David Raju Sir

2.  Abstract
 Introduction of QoS
 Literature survey
 Existing system
 Proposed system
 Algorithm
 Advantages
 Conclusion
 References
2

3.  As wireless communication gains popularity,
significant research has been devoted to supporting
real-time transmission with stringent Quality of
Service (QoS) requirements for wireless
applications. At the same time, a wireless hybrid
network that integrates a mobile wireless ad hoc
network (MANET) and a wireless infrastructure
network has been proven to be a better alternative
for the next generation wireless networks.
3

4.  QOD incorporates five algorithms: 1) a QoS-
guaranteed neighbour selection algorithm to meet
the transmission delay requirement,
 2) a distributed packet scheduling algorithm to
further reduce transmission delay,
 3) a mobility-based segment resizing algorithm
that adaptively adjusts segment size according to
node mobility in order to reduce transmission time,
4

5.  To find a QoS path between source and destination,
Which satisfies
The QoS requirements for each admitted connection
and
Optimizes the use of network resources
 Quality encompasses the data loss, latency, jitter,
efficient use of network resources,..
 QoS mechanisms for unfairness: managing
queuing behavior, shaping traffic, control
admission, routing, …
5

6.  Mobility
 Dynamic changing topology
 Bandwidth constrains
 Energy constrains
 Scalability
6

7.  Himansha Sharma, Yogendra Kumar Jain, Geetika S.
Pandey “QoS oriented reservation based routing
mechanism for wireless”
 Vida Lashkari B. O., Mehdi Dehghan “QoS-aware
Multicast Ad hoc On-Demand Distance Vector
Routing”
7

8.  Hybrid wireless networks (i.e., multi-hop cellular
networks) have been proven to be a better network
structure for the next generation wireless networks
and can help to tackle the stringent end-to-end
QoS requirements of different applications.
 Hybrid networks synergistically combine
infrastructure networks and MANETs to leverage
each other. Specifically, infrastructure networks
improve the scalability of MANETs, while
MANETs automatically establish self-organizing
networks, extending the coverage of the
infrastructure networks.
8

9.  In order to enhance the QoS support capability of
hybrid networks, in this paper, we propose a QoS-
Oriented Distributed routing protocol (QOD).
 Usually, a hybrid network has widespread base
stations. The data transmission in hybrid networks
has two features..
 First, an AP can be a source or a destination to any
mobile node.
 Second, the number of transmission hops between
a mobile node and an AP is small.
9

10.  Available bandwidth
 It can be defined as the maximum throughput with which
we can transmit (between two nodes) without interrupt
flows transmitted on the Ad Hoc network
 It is required for admission control; QoS based routing, flow
management and resources reservation
10

11.  The maximum available bandwidth quantity on a node
can be defined by this function :
 MAB(i) = BW(i) – x(i) – SUM(j) € Ni x(j)
 x (i) = Used Bandwidth on the node i
 x (j) = Used Bandwidth by the node j, neighbour of the node i
 Node j = neighbour of node i
 Ni = set of node i
11

12.  The available bandwidth is expressed by the following expression:
 AB (i,j) = MIN { MAB(i), MAB(j)}
 For a path p= (S, i, j…k, D)
 S: Source
 D: Destination
 i, j…k the intermediate nodes
12

13.  It is simple and very effective way of using the
transmission rate
13

14.  A reservation mechanism to free the existing
reservation, when link is broken and set of connection
loose
14

15.  QoS-MAODV protocol uses six different message
types for creation of QoS multicast tree
1. Route request (Rreq)
2. Route reply (Rrep)
3. Multicast activation (Mact)
4. Group hello (Grph)
5. Hello
6. QoS-lost
15

16.  MAODV keeps a routing table
1. Bandwidth reservation table
 It includes multicast group address, Amount of reserved
bandwidth, state of the reservation, time stamp, hop count
from the source node, and IP address of the source node
2. Neighbors table
 It includes neighbor address, amount of reserved bandwidth
in neighbor node, state of the reservation, amount of
consumed bandwidth in neighbor, state of neighbor and time
stamp
16

17. 17

18.  In this paper introduce the QoS-Oriented Distributed
routing protocol(QOD)
 This QOD protocol makes five contributions:
 QoS-guaranteed neighbor selection algorithm
 Distributed packet scheduling algorithm
 Mobility-based segment resizing algorithm
 Soft-deadline based forwarding scheduling
algorithm
 Data redundancy elimination based transmission
18

19.  1.QoS-guaranteed neighbor selection algorithm
 The algorithm selects qualified neighbors and deadline-driven
scheduling mechanism to guarantee QoS routing
 Get an allocation set A :
 Uas(i)* Wi : available workload rate source node needs to
distribute its packets to the Nq
 Ai : workload rate allocation from source node to immediate
node
 Wg : the packet generating rate of the source node
19

20.  2.Distributed packet scheduling algorithm
 After qualified neighbors are identified, this algorithm
schedules packet routing. It assigns earlier generated packets to
forwarders with higher queuing delays, while assigns more
recently generated packets to forwarders with lower queuing
delays to reduce total transmission delay
 Distributed queuing mechanism (e.g.: 3 packets
distributed)
20

21.  3.Mobility-based segment resizing algorithm
 The source node adaptively resizes each packet in its packet
stream for each neighbor node according to the neighbor’s
mobility
 The mobility of a node increases, the size of a packet Sp sent
from a node to its neighbor nodes i decreases as following :
 γ : Scaling parameter
 υi : The relative mobility speed of the source node and
intermediate node
21

22.  4.Soft-deadline based forwarding scheduling
algorithm
 An intermediate node first forwards the packet with
the least time allowed to wait before being packet
forwarding
 A forwarding node can use the least slack first (LSF)
scheduling algorithm
 The slack time of a packet p is defined as :
 Dp : Deadline of packet p
 t : The current time
 c’ : The remaining packet transmission time of the packet
22

23.  5.Data redundancy elimination based transmission
 The APs and mobile nodes can overhead and cache packets
 Use an end-to-end traffic redundancy elimination (TRE)
algorithm eliminates the redundant data to improve the QoS of
the packet transmission
23

24.  Hybrid wireless networks that integrate MANETs
and infrastructure wireless networks have proven
to be a better
 network structure for the next generation
networks. However,little effort has been devoted
to supporting QoS routing in hybrid networks.
 Direct adoption of the QoS routing techniques in
MANETs into hybrid networks inherits their
drawbacks.
24

25. I plan to evaluate the performance of
QOD based on the real testbed.
And also offer limitless bandwidth levels
and bounded delay.
25

26.  Himansha Sharma, Yogendra Kumar Jain, Geetika
S. Pandey “QoS oriented reservation based
routing mechanism for wireless” Journal of Global
Research in Computer Science ad-hoc networks”
Volume 2, No. 12, December 2011
 Vida Lashkari B. O., Mehdi Dehghan “QoS-aware
Multicast Ad hoc On-Demand Distance Vector
Routing” Proceedings of the World Congress on
Engineering Vol 2 WCE 2007
26

27. 27

28. 28