DOC PREVIEW
UCLA CS 215 - CS215-ODMRP-unicast

This preview shows page 1-2-3-4-5 out of 14 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1Unicasting using the Multicast protocol?ODMRP OverviewOn Demand Multicast Routing ProtocolRoute construction in ODMRPKey Differences from Other On-Demand Protocols (e.g., DSR, AODV)Unicast enhancement: Mobility PredictionRoute Selection Criteria at DestinationPerformance EvaluationPacket Delivery RatioODMRP Packet Delivery Ratio as a function of refresh intervalConclusionsThe Number of Total Packets Transmitted per Data Packet DeliveredThe Number of Control Bytes Transmitted per Data Byte Delivered by ODMRP with and without Mobility PredictionExploiting the Unicast Functionality of the On-Demand Multicast Routing ProtocolSung-Ju Lee, William Su, and Mario Gerlahttp://www.cs.ucla.edu/NRL/wirelessWireless Adaptive Mobility LaboratoryComputer Science DepartmentUniversity of CaliforniaLos Angeles, CAUnicasting 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 protocolEXCEPTIONS: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 unicastODMRP OverviewMesh topologyForwarding group conceptOn-demand route constructionSoft state multicast group maintenanceUnicast capabilityMobility predictionOn 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 membersFGFGFGFGFGForwarding GroupRoute 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 QueryKey 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 selectedUnicast 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 speedsRoute Selection Criteria at DestinationRoute 1 is selected if the delay is the criterionRoute 2 is selected if the longevity is the criterionPerformance 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 sourcesPacket Delivery RatioODMRP Packet Delivery Ratio as a function of refresh intervalConclusions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/wirelessThe Number of Total Packets Transmitted per Data Packet DeliveredThe Number of Control Bytes Transmitted per Data Byte Delivered by ODMRP with and without Mobility


View Full Document

UCLA CS 215 - CS215-ODMRP-unicast

Download CS215-ODMRP-unicast
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view CS215-ODMRP-unicast and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view CS215-ODMRP-unicast 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?