1. A QoS-Oriented Distributed RoutingProtocol for Hybrid Wireless NetworksGuide :Mr.K.MuralisankarAssistant professor/ITPresented by :S.Aakasham13MCSE01PG Scholar

2. Outline Introduction Objective Issues Literature survey Existing system Proposed system Algorithm Advantages2 SVS COLLEGE OF ENGINEERING 7-Oct-14 3. Introduction To supporting real time transmission with stringentQuality of Service (QoS) requirement for wirelessapplication Alternative for next generation Wireless hybridnetwork that integrates a mobile wireless ad-hocnetwork and a wireless infrastructure network3 SVS COLLEGE OF ENGINEERING 7-Oct-14 4. Objective To reduce transmission delay and transmission time To increase the transmission throughput and networkcapacity To eliminate the redundant data4 SVS COLLEGE OF ENGINEERING 7-Oct-14 5. Issues Inherit invalid reservation and race condition problemsin MANETs QOD transforms the packet routing problem to aresource scheduling problem5 SVS COLLEGE OF ENGINEERING 7-Oct-14 6. Literature survey Y.-S. Chen and Y.-W. Ko, "A Lantern-Tree BasedQoS on Demand Multicast Protocol for A wirelessAd hoc Networks, IEICE Transaction onCommunications , vol. E87-B, pp. 717-726, 2004. D. Promkotwong and O. Sornil, " QoS AwareMulticast Routing Protocol, Springer VerlagBerlin / Heidelberg, vol. 4658/, pp. 466-475, 2007.6 SVS COLLEGE OF ENGINEERING 7-Oct-14 7. 1. A Lantern-Tree Based QoS on Demand MulticastProtocol for A wireless Ad hoc Networks In this paper introduce for bandwidth routing protocol forQoS support in a multi-hop mobile network The QoS on demand multicast protocol determines the endto end bandwidth calculation and bandwidth allocationfrom source to a group of destination In this paper identify a lantern tree for developing the QoSmulticast protocol to satisfy certain bandwidth requirement7 SVS COLLEGE OF ENGINEERING 7-Oct-14 8. LTM: Lantern-Tree based QoSMulticasting protocol The LTM protocol is achieved by the tree phases Lantern identification Lantern-tree construction Lantern-tree maintaence8 SVS COLLEGE OF ENGINEERING 7-Oct-14 9. Phase-1: Lantern Identification To identify the lantern, local link state informationcollected fro each node in the MANET The link state information includes all one-hopand two hop high boring nodes andcorresponding free time slot list of these nodes The lantern identification is dependent on thebandwidth is sufficient a, b - nodes Sn- shared time slot betweennodes a and bn1(sn1)a :bnk(snk)9 SVS COLLEGE OF ENGINEERING 7-Oct-14 10. Phase-2: Lantern-Tree construction The lantern-tree construction phase in divided into twooperation The lantern-path search operation Based on the identified lantern many lantern paths from a sourceto a given set of destinations are constructed The lantern-path with a reliable mechanism Based on the multiple lantern path a lantern-tree is constructedwith a reliable mechanism is providedni,1(sni,1)ai : bini,ki(sni,ki)10 SVS COLLEGE OF ENGINEERING 7-Oct-14 11. Phase-3: Lantern-Tree maintaence Lantern-path and sub-path fails then we try to searchfro a backup sub-path to replace the failed sub-path When the QoS requirement could not be satisfied evenusing the proposed LTM for they dynamical topologychange, the lantern-tree maintaence phase will start itsmaintaence operation to maintain a lantern-treestructure If it can maintain a lantern-tree structure, the real timedata transmission will be continued and it cannotmaintain transmission will be stopped11 SVS COLLEGE OF ENGINEERING 7-Oct-14 12. Advantages Using multiple paths provide high aggregate of thenetwork bandwidth High access rate and high stability due to usingmultiple path lantern tree Efficient utilization of the network bandwidthespecially when the bandwidth is limited12 SVS COLLEGE OF ENGINEERING 7-Oct-14 13. Disadvantages Increasing the number of links increase the contentionat the MAC layer It takes a long time to find all the path and shares thetime slots between the neighboring nodes Node have to process and store more informationabout sub-path which wastes the resource13 SVS COLLEGE OF ENGINEERING 7-Oct-14 14. 2. A QoS-Aware Multicast Routing Protocol In this paper introduced for QoS multicast routingprotocols are pivotal in enabling new receivers to joina multicast group. QMRP achieves a scalability by significantly reducingthe communication overhead of constructing amulticast tree This is achieved by switching between single-pathrouting And multiple-path routing according to thecurrent network conditions.14 SVS COLLEGE OF ENGINEERING 7-Oct-14 15. QMPR: QoS-Aware MulticastRouting Protocol QMRP implements a five-state state machine atevery node ,such as Initial state Single path state Multiple path state Failure state Success state15 SVS COLLEGE OF ENGINEERING 7-Oct-14 16. QMRP parameters Maximum Branching Level(MBL) Maximum Branching Degree(MBD) The overhead can be controlled by these two parametersMDL=m, MBD=X, The maximum number of nodesallowed to enter the MP states is16 SVS COLLEGE OF ENGINEERING 7-Oct-14 17. Advantages Using on-demand maintenance reduces the controloverhead by starting from a node that the link failureoccurs The packet delivery ratio is high because of usingforwarding nodes as ODMRP The protocol is loop free Limiting periodic maintenance to mesh nodes andneighbor nodes reduce the control overhead17 SVS COLLEGE OF ENGINEERING 7-Oct-14 18. Disadvantages The network bandwidth is not efficiently utilizedbecause it use only routes that support the requirebandwidth Collecting the bandwidth information of the nodesperiodically introduce extra processing overhead andcontention on the wireless medium Flooding the network with control packets consumesthe limited network bandwidth especially for non-participatingnodes18 SVS COLLEGE OF ENGINEERING 7-Oct-14 19. Existing system Reference paper-1 Overhead Scalability Reference paper-2 Overhead Transmission delay19 SVS COLLEGE OF ENGINEERING 7-Oct-14 20. Proposed system This paper proposed to it can provide the high QoSperformance such as Overhead Transmission delay Mobility-resilience Scalability20 SVS COLLEGE OF ENGINEERING 7-Oct-14 21. Algorithms It incorporates the five algorithm 1. Neighbor Selection Algorithm : To meet thetransmission delay requirement 2. Distributed Packet Scheduling Algorithm: Reduce thetransmission delay 3. Mobility based Segment Resizing Algorithm: Adjustssegment size according to node mobility in order to reducethe transmission time.21 SVS COLLEGE OF ENGINEERING 7-Oct-14 22. Algorithms (cont..) 4. Traffic Redundant elimination Algorithm: Toincrease the transmission throughput. 5. Data redundancy elimination based transmissionAlgorithm: To Eliminate the redundant data toimprove the transmission QOS22 SVS COLLEGE OF ENGINEERING 7-Oct-14 23. Solution Methodology Single hop reduce the overhead, link failure By monitoring the Energy level, solve the energyharvesting problem. Improve the QOS level by modifying the multi hop assingle hop.23 SVS COLLEGE OF ENGINEERING 7-Oct-14 24. Advantages The QOD Protocol chooses qualified neighbors forforward the packet, Schedules the packet transmission,resizes the packet and increase the transmissionthroughput. By using the Single hop, the overhead, collisions,collusion, traffic , link failure will be reduced and alsothe QOS will be increased24 SVS COLLEGE OF ENGINEERING 7-Oct-14