Mobile Ad Hoc Networks for Video Multicast Seminar Presentation Advanced Topics in Distributed Systems: Modern Group Communication Mechanisms Marleine Mounir Daoud 9th of February, 2009
Download ReportTranscript Mobile Ad Hoc Networks for Video Multicast Seminar Presentation Advanced Topics in Distributed Systems: Modern Group Communication Mechanisms Marleine Mounir Daoud 9th of February, 2009
Mobile Ad Hoc Networks for Video Multicast Seminar Presentation Advanced Topics in Distributed Systems: Modern Group Communication Mechanisms Marleine Mounir Daoud 9th of February, 2009 Outline Introduction Mobile Ad Hoc Networks Multicast Overview Video Multicast Multicast Tree and Mesh Approaches ODMRP and MAODV MT-MAODV Reason for MAODV and MDC MT-MAODV Algorithm with an Example Evaluation Conclusion References Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 2 Introduction Mobile Ad Hoc Networks (MANETs) Are by Definition: Multi-hop wireless networks Dynamically reconfigurable No fixed infrastructure No central administration Widely Used Important in Future Wireless Communication Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 3 Introduction Mobile Ad Hoc Networks (MANETs) ctd. Applications Monday, February 09, 2009 Crowd Control Battlefields Search and Rescue Marleine Mounir Daoud Seminar Presentation 4 Introduction Mobile Ad Hoc Networks (MANETs) ctd. Problems and Constraints Monday, February 09, 2009 Mobility, No fixed topology Route discovery required frequently Limited Battery Power, Limited Bandwidth Wireless Transmitter Range Marleine Mounir Daoud Seminar Presentation 5 Introduction Mobile Ad Hoc Networks (MANETs) ctd. Problems and Constraints A Links formed and broken due to mobility A B B Multicast in Ad Hoc Monday, February 09, 2009 Tasks in Groups for better Quality Groups solve some MANETs problems thus Multicast important in MANETs Marleine Mounir Daoud Seminar Presentation 6 Multicast Overview Video Multicast Definition Delivering video to multiple receivers Receivers have same multicast address Applications Monday, February 09, 2009 Group Video Conferencing Video-On-Demand Distance Learning Marleine Mounir Daoud Seminar Presentation 7 Multicast Overview Video Multicast ctd. Requirements or Constraints Lost Bandwidth Jitter Delay Problems Monday, February 09, 2009 Available routing protocols are designed more efficiently for data applications rather than video applications, thus video transmission constraints might not be fulfilled Marleine Mounir Daoud Seminar Presentation 8 Multicast Overview Multicast Tree and Mesh Approaches Multicast General Tree vs. Wireless Wireless Nodes have Broadcasting Nature Tree Monday, February 09, 2009 Tree Definition: Only 1 Route between tree and receiver Protocols using Tree Approach: MAODV Marleine Mounir Daoud Seminar Presentation 9 Multicast Overview Multicast Tree and Mesh Approaches ctd. Mesh Monday, February 09, 2009 Mesh Definition: Multiple Routes between source and receiver Protocols using Mesh Approach: ODMRP Marleine Mounir Daoud Seminar Presentation 10 Multicast Overview Multicast Tree and Mesh Approaches ctd. Advantages and Disadvantages Tree Mesh Monday, February 09, 2009 + High forwarding (single path property) - High possibility of dropping (no backup path exists) - Vulnerable to high mobility - Vulnerable to load or large groups + Multiple paths (more efficient if a path broke) + Quickly reconfigurable - High number of forwarding nodes - Excessive message overhead (low efficiency) Marleine Mounir Daoud Seminar Presentation 11 Multicast Overview Multicast Routing Protocols MAODV AMRoute WARM CAMP MZR S-REMiT NSMP PUMA DCMP PBM Monday, February 09, 2009 OLAM AMRIS MT-MAODV MCEDAR STMP PAST-DM ADMR MANSI L-REMiT ODMRP G-REMiT DDR Marleine Mounir Daoud Seminar Presentation FGMP 12 Multicast Overview On-Demand Multicast Routing Protocol (ODMRP) Receiver-initiated protocol (On-Demand) Mesh Based Approach (multiple routes) Soft-State (join/leave group) Uses concept of Forwarding Group Monday, February 09, 2009 Subset of nodes forwards multicast packets using scoped flooding Shortest path between any pair of nodes Marleine Mounir Daoud Seminar Presentation 13 Multicast Overview ODMRP Example Join JoinRequest Reply Forwarding Broadcast Group s Y, Z s b, c Multicast RT s X s a, W s d, e Sender Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 14 Multicast Overview ODMRP Example Robustness Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 15 Multicast Overview On-Demand Multicast Routing Protocol (ODMRP) Advantages and Disadvantages Monday, February 09, 2009 + No explicit leave message (member nodes refreshed when needed by source) + Multiple path to one destination (mesh approach) + Backup path if link is broken (Robust) - High Overhead (because broadcast the reply to many nodes) - Complex Topology Marleine Mounir Daoud Seminar Presentation 16 Multicast Overview Multicast Ad Hoc On-Demand Distance Vector (MAODV) Extension of the unicast protocol, Ad Hoc OnDemand Distance Vector (AODV) Receiver-initiated protocol Tree Based Approach Consists of 2 main parts: Monday, February 09, 2009 Tree Construction Tree Maintenance Marleine Mounir Daoud Seminar Presentation 17 Multicast Overview Multicast Ad Hoc On-Demand Distance Vector (MAODV) ctd. Each Multicast Group has: Monday, February 09, 2009 Group Leader (First group member) Responsible in maintaining sequence number that ensures updated routing information GL broadcasts Hello messages to keep track of tree connectivity Marleine Mounir Daoud Seminar Presentation 18 Multicast Overview Tree Construction C Node broadcast Join Flag j k l Any node sends back reply Shortest path selected New node joins Same procedure Monday, February 09, 2009 g d A Marleine Mounir Daoud Seminar Presentation h i e f B 19 Multicast Overview Tree Maintenance C Link breaks GL sends hello messages j Link known to be down g New routes are discovered Monday, February 09, 2009 d A Marleine Mounir Daoud Seminar Presentation k l h i e f B 20 Multicast Overview MAODV Example Group member Group Join Process Multicast Tree member Multicast Broadcast Activation - RREQ Broadcast Group Hello Ordinary node Only GM Responds Potential Group member Multicast link Communication link Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 21 Multicast Overview MAODV Example Group member Leaving a Multicast Group Multicast Tree member Non leaf Node Must remain as a Tree member Ordinary node Potential Group member Multicast link Communication link Leaf Node Can remove itself from Again Leaf Node MT Remove himself from MT Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 22 Multicast Overview Multicast Ad Hoc On-Demand Distance Vector (MAODV) Advantages and Disadvantages Monday, February 09, 2009 + Low Overhead (because unicast the reply) + Shortest path always chosen (tree approach) - No backup path if link is broken - High percentage of bad frames in video transmission due to packet loss (link broken) - Multiple interruptions seen in video watched Marleine Mounir Daoud Seminar Presentation 23 MT-MAODV Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) Goal: Provide Improved Video Quality By: Discovering a new routing protocol Using: Monday, February 09, 2009 Multiple Disjoint Trees MAODV Multiple Description Coding (MDC) Marleine Mounir Daoud Seminar Presentation 24 MT-MAODV Reason for Multicast Ad Hoc On-Demand Distance Vector (MAODV) and Multiple Description Coding (MDC) MAODV: Have: Mobility, Solution: Fault-Tolerant Framework Use Many Disjoint Trees (transform MAODV) MDC: Monday, February 09, 2009 Have: Many Trees, Solution: Dividing the video into many equally and independent video description possible with MDC Marleine Mounir Daoud Seminar Presentation 25 MT-MAODV MT-MAODV Algorithm Goal: Construction of 2 disjoint trees 5 Statuses for nodes available: Monday, February 09, 2009 ON_GROUP: multicast group member ON_TREE_0 forwarding node of the 2 trees ON_TREE_1 forwarding node of tree 1 ON_TREE_2 forwarding node of tree 2 NOT_ON_TREE not tree member Marleine Mounir Daoud Seminar Presentation 26 MT-MAODV MT-MAODV Algorithm ctd. 6 Steps Algorithm: Monday, February 09, 2009 Send RREQ_J by node wanting to join multicast group Forward RREQ_J by NOT_ON_TREE nodes Reply RREQ_J by group members Forward RREP_J to the requesting node Store RREP_J given shortest path Trees Activation sent by requesting node Marleine Mounir Daoud Seminar Presentation 27 MT-MAODV MT-MAODV Algorithm Example Multiple trees construction with multicast table for topology Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 28 MT-MAODV MT-MAODV Algorithm Example Multiple trees construction for node A Considering GL is Group Leader Node A sends Join Request Monday, February 09, 2009 GL replies with 2 upstream nodes available: y and z Node A receives replies with both Tree fields as Zero so can select any of them for tree-1: node y and the other for tree-2: node z Marleine Mounir Daoud Seminar Presentation 29 MT-MAODV MT-MAODV Algorithm Example Multiple trees construction for node B Monday, February 09, 2009 Node B sends Join Request Node A replies with Tree field as Zero and Node z replies with Tree field as 2 Node B receives replies and chooses node A for tree-1 and node z for upstream of tree-2 Marleine Mounir Daoud Seminar Presentation 30 MT-MAODV MT-MAODV Algorithm Example Multiple trees construction for node C Monday, February 09, 2009 Node C sends Join Request Three replies are returned: Node A replies with Tree field as Zero from node x and node w, Node B replies with Tree field as Zero from node v Node C receives replies and can chooses node x or w for tree-1 and node v for upstream of tree-2 because connecting to different Tree Members has higher priority Marleine Mounir Daoud Seminar Presentation 31 MT-MAODV MT-MAODV Algorithm Example Multiple trees construction for node D Monday, February 09, 2009 Node D sends Join Request As it has only 1 node connected to it, Node u will reply with Tree field as Zero from Node B Node D receives reply and chooses Node u for upstream of tree-1 and tree-2 because priority is given to tree connectivity rather than disjoint trees Marleine Mounir Daoud Seminar Presentation 32 MT-MAODV MT-MAODV Algorithm Example After multiple trees construction completed, can fill in the table for topology Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 33 MT-MAODV Evaluation Video Quality Received Percentage of Bad Frames: - with MAODV and MDC: 2% improvement - with MT-MAODV: addition of 2% improvement A bad frame occurs when the 2 video descriptions sent on the 2 trees are not decodable at the same time Number of Interruptions: - with MAODV: more than 50 times - with MT-MAODV: less than 20 times Great improvement in this point! Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 34 MT-MAODV Evaluation ctd. Network View Monday, February 09, 2009 Number of Hops Traversed: - MT-MAODV has higher number than MAODV MAODV always chooses shortest path while MT-MAODV chooses 2 paths so increase by less than 1 hop Number Routing Control Packets: - MT-MAODV has higher number than MAODV Necessary in constructing and maintaining 2 trees Forwarding Efficiency: - MT-MAODV worse than MAODV Larger hops to be traversed in MT-MAODV Marleine Mounir Daoud Seminar Presentation 35 Conclusion MT-MAODV Fault-tolerant video transmission due to MDC Improvement in the field of video multicast on ad hoc networks from the point of the video quality received From the network view, can be considered as having open issues and future challenges so that the presented algorithm can be improved Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 36 Thank You for Listening Any Questions? Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 37 References Chee Onn Chow and Hiroshi Ishii. Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) Routing Protocol for Video Multicast over Mobile Ad Hoc Networks. IEICE Transactions, 91-B(2):428-436, 2008 B. Xu, S. Hischke, and B. Walke. The role of ad hoc networking in future wireless communications. In Proceedings of International Conference on Communication Technology, ICCT 2003, volume 2, pages 1353-1358, Beijing, China, Apr 2003. Sung ju Lee, William Su, Julian Hsu, Mario Gerla, and Rajive Bagrodia. A performance comparison study of ad hoc wireless multicast protocols. Pages 565-574, 2000. Katia Obraczka and Gene Tsudik. Multicast routing issues in ad hoc networks. In In IEEE ICUPC, 1998. Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 38 References ctd. Sung ju Lee, William Su, and Mario Gerla. On-demand multicast routing protocol. Pages 1298-1302, 1999. C. Siva Ram Murthy and B.S. Manoj. Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2004. E. Royer and C. Perkins. Multicast Ad hoc On- Demand Distance Vector (MAODV) Routing, 2000. C. Perkins, E. Belding-Royer, and S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing, 2003. V. K. Goyal. Multiple description coding: compression meets the network. Signal Processing Magazine, IEEE, 18(5):74-93, September 2001. Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 39 References ctd. Fred Baker, “Mobile Ad Hoc Networks”, Cisco Presentation. Dewan Tanvir Ahmed, “Multicasting in Ad Hoc Networks”, University of Ottawa. “On Demand Multicast Routing Protocol”, COSC 6590, 2007. S.-J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks”, IEEE Networks, vol. 13, no. 4, Jul. 1999, pp. 48-54. Monday, February 09, 2009 Marleine Mounir Daoud Seminar Presentation 40