1 / 14

Exploiting the Unicast Functionality of the On-Demand Multicast Routing Protocol

Exploiting the Unicast Functionality of the On-Demand Multicast Routing Protocol Sung-Ju Lee, William Su, and Mario Gerla http://www.cs.ucla.edu/NRL/wireless Wireless Adaptive Mobility Laboratory Computer Science Department University of California Los Angeles, CA.

gwyn
Download Presentation

Exploiting the Unicast Functionality of the On-Demand Multicast Routing Protocol

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. Exploiting the Unicast Functionality of the On-Demand Multicast Routing Protocol Sung-Ju Lee, William Su, and Mario Gerla http://www.cs.ucla.edu/NRL/wireless Wireless Adaptive Mobility Laboratory Computer Science Department University of California Los Angeles, CA

  2. Unicasting using the Multicast protocol? • Generally not possible, or very inefficient • Most of the existing m-cast protocols (eg, AMRoute (Ad-hoc Multicast Routing), CAMP (Core Assisted Mesh Protocol), LAM (Lightweight Adaptive Multicast), etc) run on top of a SEPARATE unicast routing protocol • CAMP and LAM in particular, only work with certain underlying unicast protocol EXCEPTIONS: • Multicast AODV (Ad-hoc On-demand Distance Vector) uses routes obtained from unicast AODV • ODMRP (On-Demand Multicast Routing Protocol) can transparently function as both multicast and unicast

  3. ODMRP Overview • Mesh topology • Forwarding group concept • On-demand route construction • Soft state multicast group maintenance • Unicast capability • Mobility prediction

  4. Forwarding Group FG FG FG FG FG On Demand Multicast Routing Protocol • Forwarding Group: All the nodes inside the “bubble” forward the M-cast packets via “restricted” flooding • Multicast Tree replaced by Multicast “Mesh” Topology • Flooding redundancy helps overcome displacements and fading • FG nodes selected by tracing shortest paths between M-cast members

  5. Route construction in ODMRP • Similar to other on-demand routing protocols • Consists of a query and a reply phase • A source periodically transmits Join Query packets when it has data to send • Join Query packets can carry data payload to eliminate route acquisition latency • Intermediate nodes forward the packet and set up path back to the source (backward learning) • The destination sends a Join Reply in response to a Join Query

  6. Key Differences from Other On-Demand Protocols (e.g., DSR, AODV) • Intermediate nodes can not reply from cache • Data payload piggybacked on Join Queries must reach destinations • Routes replied by destination are more up to date • Query packets are periodically sent as long as there are data packets to send • Fresh routes are continually built and used • Route refresh interval should be carefully selected

  7. Unicast enhancement: Mobility Prediction • Mobility prediction can help determine longevity of routes and schedule refresh requests • Mobility can be predicted, e.g., in an outdoor environment by means of GPS location information; received power based prediction also possible • Join Queries are flooded only before predicted route disconnection time • The scheme adapts refresh interval to mobility patterns and speeds

  8. Route Selection Criteria at Destination • Route 1 is selected if the delay is the criterion • Route 2 is selected if the longevity is the criterion

  9. Performance Evaluation • Simulated in GloMoSim written in PARSEC • Compared the performance of the following schemes: • ODMRP • ODMRP-MP: ODMRP with mobility prediction • WRP (Wireless Routing Protocol): an ad hoc distance vector routing protocol • LAR (Location Aided Routing): an on-demand protocol that uses GPS location information • 50 nodes in 1000 meter X 1000 meter area • Free space propagation model, IEEE 802.11 DCF • Random mobility model • Constant bit rate sources

  10. Packet Delivery Ratio

  11. ODMRP Packet Delivery Ratio as a function of refresh interval

  12. Conclusions • ODMRP is capable of routing both unicast and multicast data effectively • Mobility prediction enhances ODMRP Unicast • Testbed implementation: presented at IEEE ICCCN 2000 • Multicast work: ACM/Baltzer MONET special issue on multipoint communications • http://www.cs.ucla.edu/NRL/wireless

  13. The Number of Total Packets Transmitted per Data Packet Delivered

  14. The Number of Control Bytes Transmitted per Data Byte Delivered by ODMRP with and without Mobility Prediction

More Related