Saltar al contenido principal
A QoS-Oriented Distributed Routing 
Protocol for Hybrid Wireless Networks 
Guide : 
Mr.K.Muralisankar 
Assistant professor/IT 
Presented by : 
S.Aakasham 
13MCSE01 
PG Scholar
Outline 
 Introduction 
 Objective 
 Issues 
 Literature survey 
 Existing system 
 Proposed system 
 Algorithm 
 Advantages 
2 SVS COLLEGE OF ENGINEERING 7-Oct-14
Introduction 
 To supporting real time transmission with stringent 
Quality of Service (QoS) requirement for wireless 
application 
 Alternative for next generation Wireless hybrid 
network that integrates a mobile wireless ad-hoc 
network and a wireless infrastructure network 
3 SVS COLLEGE OF ENGINEERING 7-Oct-14
Objective 
 To reduce transmission delay and transmission time 
 To increase the transmission throughput and network 
capacity 
 To eliminate the redundant data 
4 SVS COLLEGE OF ENGINEERING 7-Oct-14
Issues 
 Inherit invalid reservation and race condition problems 
in MANETs 
 QOD transforms the packet routing problem to a 
resource scheduling problem 
5 SVS COLLEGE OF ENGINEERING 7-Oct-14
Literature survey 
 Y.-S. Chen and Y.-W. Ko, "A Lantern-Tree Based 
QoS on Demand Multicast Protocol for A wireless 
Ad hoc Networks,“ IEICE Transaction on 
Communications , vol. E87-B, pp. 717-726, 2004. 
 D. Promkotwong and O. Sornil, " QoS Aware 
Multicast Routing Protocol,“ Springer – Verlag 
Berlin / Heidelberg, vol. 4658/, pp. 466-475, 2007. 
6 SVS COLLEGE OF ENGINEERING 7-Oct-14
1. A Lantern-Tree Based QoS on Demand Multicast 
Protocol for A wireless Ad hoc Networks 
 In this paper introduce for bandwidth routing protocol for 
QoS support in a multi-hop mobile network 
 The QoS on demand multicast protocol determines the end 
to end bandwidth calculation and bandwidth allocation 
from source to a group of destination 
 In this paper identify a lantern tree for developing the QoS 
multicast protocol to satisfy certain bandwidth requirement 
7 SVS COLLEGE OF ENGINEERING 7-Oct-14
LTM: Lantern-Tree based QoS 
Multicasting protocol 
 The LTM protocol is achieved by the tree phases 
 Lantern identification 
 Lantern-tree construction 
 Lantern-tree maintaence 
8 SVS COLLEGE OF ENGINEERING 7-Oct-14
Phase-1: Lantern Identification 
 To identify the lantern, local link state information 
collected fro each node in the MANET 
 The link state information includes all one-hop 
and two hop high boring nodes and 
corresponding free time slot list of these nodes 
 The lantern identification is dependent on the 
bandwidth is sufficient 
 a, b - nodes 
 Sn- shared time slot between 
nodes a and b 
n1(sn1) 
a : 
b 
nk(snk) 
9 SVS COLLEGE OF ENGINEERING 7-Oct-14
Phase-2: Lantern-Tree construction 
 The lantern-tree construction phase in divided into two 
operation 
 The lantern-path search operation 
 Based on the identified lantern many lantern paths from a source 
to a given set of destinations are constructed 
 The lantern-path with a reliable mechanism 
 Based on the multiple lantern path a lantern-tree is constructed 
with a reliable mechanism is provided 
ni,1(sni,1) 
ai : bi 
ni,ki(sni,ki) 
10 SVS COLLEGE OF ENGINEERING 7-Oct-14
Phase-3: Lantern-Tree maintaence 
 Lantern-path and sub-path fails then we try to search 
fro a backup sub-path to replace the failed sub-path 
 When the QoS requirement could not be satisfied even 
using the proposed LTM for they dynamical topology 
change, the lantern-tree maintaence phase will start its 
maintaence operation to maintain a lantern-tree 
structure 
 If it can maintain a lantern-tree structure, the real time 
data transmission will be continued and it cannot 
maintain transmission will be stopped 
11 SVS COLLEGE OF ENGINEERING 7-Oct-14
Advantages 
 Using multiple paths provide high aggregate of the 
network bandwidth 
 High access rate and high stability due to using 
multiple path lantern –tree 
 Efficient utilization of the network bandwidth 
especially when the bandwidth is limited 
12 SVS COLLEGE OF ENGINEERING 7-Oct-14
Disadvantages 
 Increasing the number of links increase the contention 
at the MAC layer 
 It takes a long time to find all the path and shares the 
time slots between the neighboring nodes 
 Node have to process and store more information 
about sub-path which wastes the resource 
13 SVS COLLEGE OF ENGINEERING 7-Oct-14
2. A QoS-Aware Multicast Routing Protocol 
 In this paper introduced for QoS multicast routing 
protocols are pivotal in enabling new receivers to join 
a multicast group. 
 QMRP achieves a scalability by significantly reducing 
the communication overhead of constructing a 
multicast tree 
 This is achieved by switching between single-path 
routing And multiple-path routing according to the 
current network conditions. 
14 SVS COLLEGE OF ENGINEERING 7-Oct-14
QMPR: QoS-Aware Multicast 
Routing Protocol 
 QMRP implements a five-state state machine at 
every node ,such as 
 Initial state 
 Single path state 
 Multiple path state 
 Failure state 
 Success state 
15 SVS COLLEGE OF ENGINEERING 7-Oct-14
QMRP parameters 
 Maximum Branching Level(MBL) 
 Maximum Branching Degree(MBD) 
 The overhead can be controlled by these two parameters 
MDL=m, MBD=X, The maximum number of nodes 
allowed to enter the MP states is 
16 SVS COLLEGE OF ENGINEERING 7-Oct-14
Advantages 
 Using on-demand maintenance reduces the control 
overhead by starting from a node that the link failure 
occurs 
 The packet delivery ratio is high because of using 
forwarding nodes as ODMRP 
 The protocol is loop free 
 Limiting periodic maintenance to mesh nodes and 
neighbor nodes reduce the control overhead 
17 SVS COLLEGE OF ENGINEERING 7-Oct-14
Disadvantages 
 The network bandwidth is not efficiently utilized 
because it use only routes that support the require 
bandwidth 
 Collecting the bandwidth information of the nodes 
periodically introduce extra processing overhead and 
contention on the wireless medium 
 Flooding the network with control packets consumes 
the limited network bandwidth especially for non-participating 
nodes 
18 SVS COLLEGE OF ENGINEERING 7-Oct-14
Existing system 
 Reference paper-1 
 Overhead 
 Scalability 
 Reference paper-2 
 Overhead 
 Transmission delay 
19 SVS COLLEGE OF ENGINEERING 7-Oct-14
Proposed system 
 This paper proposed to it can provide the high QoS 
performance such as 
 Overhead 
 Transmission delay 
 Mobility-resilience 
 Scalability 
20 SVS COLLEGE OF ENGINEERING 7-Oct-14
Algorithms 
 It incorporates the five algorithm 
 1. Neighbor Selection Algorithm : To meet the 
transmission delay requirement 
 2. Distributed Packet Scheduling Algorithm: Reduce the 
transmission delay 
 3. Mobility based Segment Resizing Algorithm: Adjusts 
segment size according to node mobility in order to reduce 
the transmission time. 
21 SVS COLLEGE OF ENGINEERING 7-Oct-14
Algorithms (cont..) 
 4. Traffic Redundant elimination Algorithm: To 
increase the transmission throughput. 
 5. Data redundancy elimination based transmission 
Algorithm: To Eliminate the redundant data to 
improve the transmission QOS 
22 SVS COLLEGE OF ENGINEERING 7-Oct-14
Solution Methodology 
 Single hop reduce the overhead, link failure 
 By monitoring the Energy level, solve the energy 
harvesting problem. 
 Improve the QOS level by modifying the multi hop as 
single hop. 
23 SVS COLLEGE OF ENGINEERING 7-Oct-14
Advantages 
 The QOD Protocol chooses qualified neighbors for 
forward the packet, Schedules the packet transmission, 
resizes the packet and increase the transmission 
throughput. 
 By using the Single hop, the overhead, collisions, 
collusion, traffic , link failure will be reduced and also 
the QOS will be increased 
24 SVS COLLEGE OF ENGINEERING 7-Oct-14