1 / 23

On Demand Multicast Routing Protocol (ODMRP )

On Demand Multicast Routing Protocol (ODMRP ). CSE 6590. Types of Multicast Routing in MANETs. Tree-based One path between a source-receiver pair AMRoute, AMRIS, MAODV Mesh-based Multiple paths between a source-receiver pair ODMRP, CAMP Hybrid Zone Routing Protocol (ZRP).

kcampos
Download Presentation

On Demand Multicast Routing Protocol (ODMRP )

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. On Demand Multicast Routing Protocol (ODMRP ) CSE 6590

  2. Types of Multicast Routing in MANETs • Tree-based • One path between a source-receiver pair • AMRoute, AMRIS, MAODV • Mesh-based • Multiple paths between a source-receiver pair • ODMRP, CAMP • Hybrid • Zone Routing Protocol (ZRP)

  3. Typical Multicast Routing Protocols • AMRIS: Ad Hoc Multicast Routing Protocol Utilizing Increasing ID Numbers • National University of Singapore • Georgia Institute of Technology • November 1998 [draft] • ODMRP: On-demand Multicasting Routing Protocol • University of California at Los Angeles • January 2000 [draft]

  4. Why compare them?

  5. ODMRP • Multicast Messages: • JOIN-QUERY (J-Q); • JOIN-REPLY (J-R); • Similar to Route Request and Route Reply in AODV and DSR

  6. R S Basic Operation of ODMRP On Demand Route and Mesh Creation Join Query Join Reply • S floods a Join Query to entire network to refresh membership. • Receiving node stores the backward learning into routing table and rebroadcasts the packet. • Finally when query reaches a receiver creates a Join Reply and broadcasts its to its neighbors. • Node receiving the Join Reply checks whether the next node id in Join Reply matches it own. If yes , it is a part of the forwarding group, sets its FG_FLAG and broadcasts its join reply built upon matched entries. • Join Reply is propagated by each forwarding group member until it reaches source via a shortest path. • Routes from sources to receivers builds a mesh of nodes called “forwarding group”. R R R R

  7. ODMRP: Join Reply • JOIN-REPLY message J-R of R1 J-R of I1

  8. FG FG Concept of Forwarding Group Why a mesh? Links Multicast Routes Initial Route from S1 to R2 is < S1 -A- B- R2> Redundant Route < S1- A- C- B- R2> FG FG FG FG R1 S1 A B S2 C R3 S3 R2

  9. ODMRP: Sender Actions Sender actions: • Downstream • Generate J-Q message; • Broadcast J-Q ; • Upstream • Receive J-R (include the path info);

  10. ODMRP: Intermediate Nodes (downstream) Intermediate node actions:(downstream) • Receive J-Q, omit duplicated ones (use cached sequence numbers); • Store upstream node info; • Re-broadcast J-Q;

  11. ODMRP: Intermediate Nodes (upstream) Intermediate node actions: (upstream) • Received J-R; • If node is on the path • Generate new J-R with node info and broadcast, route established!

  12. ODMRP: Receiver Actions Receiver actions: • Downstream • Received J-Q; • Generate J-R with path info; • Upstream • Broadcast J-R;

  13. ODMRP: Maintenance phase Soft state approach • Sender repeat J-R periodically to maintain mesh. • Node joins • Sending J-R as discusses before. • Node leaves • Sender: stops sending J-Q; • Receiver: stops sending J-R; • Links break • Receiver: receives new J-Q and replies with J-R;

  14. Algorithm Comparison (1)

  15. Algorithm Comparison (2)

  16. Performance Comparison (1) Packet Delivery Ratio as a function of mobile speed • # of data packets actually delivered to the destinations versus # of data packets supposed to be received • PDR of ARMIS is speed sensitive

  17. Performance Comparison (2) Packet Delivery Ratio as a function of # of senders • PDR of AMRIS is not sensitive to # of senders • ODRMP’s performance improves as number of senders increases

  18. Performance Comparison (3) Packet Delivery Ratio as a function of multicast group size • PDR of ODMRP is not sensitive to group size • AMRIS’s performance improves as group size grows

  19. Performance Comparison (4) Packet Delivery Ratio as a function of network traffic load • AMRIS has severe packet loss rates • ODMRP suffers less

  20. Overhead Comparison (1) Number of Control Bytes Transmitted Per Data Bytes Delivered as a function of mobility speed • Control bytes are control packets and data packet headers • Not speed sensitive • AMRIS has lower ratio

  21. Overhead Comparison (2) Number of Control Bytes Transmitted Per Data Bytes Delivered as a Function of # of Senders • AMRIS is not affected by number of senders • ODMRP may not be efficient in large networks

  22. Qualitative Comparison • Bandwidth Consumption • ODMRP tends transmit more control bytes than AMRIS • However, ODMRP has higher packet delivery ratio • Power Consumption • Depends on mobility speed, number of senders, network traffic load, etc. • Not a problem for vehicle-based mobile nodes

  23. References • “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols”, Sung-Ju Lee, William Su, Julian Hsu, Mario Gerla, and Rajive Bagrodia, Proceedings of IEEE INFOCOM 2000 • “Multicast over wireless mobile ad hoc networks: Present and future directions”, Carlos de Morais Cordeiro, Hrishikesh Gossain and Dharma P. Agrawal, IEEE Network, January 2003 • “Exploring Mesh- and Tree Based Multicast Routing Protocols for MANETs”, Kumar Viswanath, Katia Obraczka and Gene Tsudik • “Capacity of Wireless Mesh Networks Understanding Single Radio, Dual Radio and Multi-Radio Wireless Mesh Networks” • “On the 802.11 Turbulence of Nintendo DS and Sony PSP Handheld Network Games”, Mark Claypool • www.wikipedia.org

More Related