1 / 27

Multicast Routing In Ad Hoc wireless networks

Multicast Routing In Ad Hoc wireless networks. By Liu Kebin. Outline. Introduction Issues Classifications Tree-Based Protocols BEMRP [1] MZRP [2] MCEDAR [4] References. Introduction. Multicast routing Communication among a given set of nodes Better than multiple unicast

talia
Télécharger la présentation

Multicast Routing In Ad Hoc wireless networks

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. Multicast RoutingIn Ad Hoc wireless networks By Liu Kebin

  2. Outline • Introduction • Issues • Classifications • Tree-Based Protocols • BEMRP [1] • MZRP [2] • MCEDAR [4] • References

  3. Introduction • Multicast routing • Communication among a given set of nodes • Better than multiple unicast • Multicast routing in wired network • DVMRP, MOSPF, CBT, PIM • Establish a routing tree for a multicast session • Packets are sent to all nodes in the tree • Not appropriate for ad hoc, why?

  4. Constraints in Ad Hoc • Dynamically changing topology • Low bandwidth • Less reliable links

  5. Issues • Challenges • Limited bandwidth • Error-prone shared broadcast channel • Mobility of nodes • Limited energy • Hidden terminal problem • Limited security • Targets • Robustness • Efficiency • QoS

  6. Classification of Multicast routing protocols

  7. Tree-Based Protocols • Source-Tree-Based • Multicast tree is maintained per source • BEMRP • MZRP • MCEDAR • Shared-Tree-Based • Multicast tree is shared by all sources in the multicast group

  8. Bandwidth-efficient multicastrouting protocol (BEMRP) • Abstract • Three phases • Choose the nearest forwarding nodes in the tree • Prune useless nodes in tree • Bandwidth efficient

  9. Tree initialization Phase

  10. R3 floods Join control packet

  11. S,I1,R2 sends back reply

  12. R3 join the Group through the nearest forwarding node (I1)

  13. Tree Maintenance Phase • Broadcast-multicast scheme • Upstream node floods broadcast-multicast packet • Isolated node receives this packet and rejoin the group • Local rejoin scheme • Isolated node floods Join control packet • Upstream nodes send back reply packet • Isolated node receives this reply and rejoin the group

  14. Broadcast-multicast scheme

  15. Broadcast-multicast scheme

  16. Rout Optimization phase • Prune unwanted tree nodes • By Quit message

  17. Advantages and Disadvantages • Advantages • Bandwidth efficient • Disadvantages • Long distance between source and receiver • High probability of path breaks • High delay

  18. Multicast Zone Routing Protocol(MZRP) • Abstract • Each node is associated with a routing zone • Attempt to combine on-demand and table-driven routing • Two phases

  19. Tree Initialization Phase • Create a multicast delivery tree • Two-stage process • Multicast tree creation inside a zone • Tree-Create message • Tree-Create-ACK message • Multicast tree extension • Tree-Propagate

  20. Multicast tree creation inside a zone

  21. Multicast tree extension

  22. Tree Maintenance Phase • Source node send the Tree-Refresh packet periodically • If tree node does not receive this packet for a special period, it is isolated • Downstream nodes are responsible for rejoining the group (similar to local rejoin scheme) • Join packet • JoinAck packet

  23. Advantages and Disadvantages • Advantages • Reduce control overhead because it runs over Zone routing protocol • Disadvantages • Long wait for the far node because of the Tree-Propagate message

  24. Multicast Core-Extraction DistributedAd Hoc Routing (MCEDAR) • Abstract • Use the underlying infrastructure “mgraph” fro forwarding packets • Form the minimum dominating set (MDS) with “core nodes” • Node who wants to join a group sends a JoinReq packet • Node join the group by receiving JoinAck packet • While isolated, node issues a JoinReq again

  25. The Join Protocol

  26. Advantages and Disadvantages • Advantages • Robust • As efficient as other Tree-Based protocols • Disadvantages • Complex • Increasing control overhead

  27. References • [1] T.Ozaki, J.B.Kin, and T.Suda, “Bandwidth-Efficient Multicast Routing Protocol for Ad Hoc Networks” • [2] V.Devarapalli, A.A.Selcuk, etc, “MZR: A Multicast Protocol for Mobile Ad Hoc Networks” • [3] Z.J.Haas, M.R.Pearlman, and P.Samar, “Zone Rounting Protocol (ZRP)” • [4] P. Sinha, R.Sivakumar, and V.Bharghavan, “MCEDAR: Multicast Core Extraction Distributed Ad Hoc Routing”

More Related