1 / 126

Multicasting in Mobile Ad Hoc Networks

Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Multicasting in Mobile Ad Hoc Networks. Dissertation Proposal. Advisor: Prof. J. J. Garcia-Luna-Aceves. Presentation Outline. Background and Design Challenges Previous Work

cyma
Download Presentation

Multicasting in Mobile Ad Hoc 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. Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Multicasting in Mobile Ad Hoc Networks Dissertation Proposal Advisor: Prof. J. J. Garcia-Luna-Aceves

  2. Presentation Outline Background and Design Challenges Previous Work Our Contribution

  3. Mobile Ad Hoc Networks Mobile Ad Hoc Networks • Formed on-demand without pre-existing infrastructure • Multiple Wireless Hops

  4. Mobile Ad Hoc Networks Mobile Ad Hoc Networks • Mobility results in topology and route changes • Applications: Disaster relief, Battlefield, Policing, Search and Rescue etc.

  5. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  6. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  7. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  8. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  9. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  10. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  11. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F I R1 G H R2 K L R3

  12. Multicasting • One to many communication : Multiple Unicasting A B S1 C D E J F Needs 8 Transmissions ! I R1 G H R2 K L R3

  13. Multicasting • One to many communication : Multicasting A B S1 C D E J F I R1 G H R2 K L R3

  14. Multicasting • One to many communication : Multicasting A B S1 C D E J F I R1 G H R2 K L R3

  15. Multicasting • One to many communication : Multicasting A B S1 C D E J F Needs just 3 Transmissions ! I R1 G H R2 K L R3

  16. Multicasting in Ad Hoc Networks • Ad Hoc Networks cannot afford multiple unicasting as bandwidth is limited • Most applications of ad hoc networks e.g. battlefield scenarios, search and rescue operations involve one to many communication • Compared to multicasting in wired networks need to handle low link reliability, mobility, low battery life • Can be classified as tree based or mesh based protocols

  17. Tree Based Multicasting R1 R2 A R3 B C D E F G S1 K L H I P R4 O R3 N T U S Q R5

  18. Tree Based Multicasting R1 R2 A R3 B C D E F G S1 K L H I P R4 O R3 N T U S Q R5

  19. Tree Based Multicasting R1 R2 A R3 B C D E F G S1 K L H I P R4 O R3 N T U S Q R5

  20. Tree Based Multicasting R1 R2 A R3 B • Packets flow from sender to receiver along a single path. • Exact shape of tree depends on protocol. E.g. shared vs source based C D E F G S1 K L H I P R4 O R3 N T U S Q R5

  21. Mesh Based Multicasting R1 R2 A R3 B • Packets flow from sender to receiver along multiple paths. • Due to multiple paths meshes are more tolerant of link breaks • Higher packet delivery ratio but also higher overhead. • Redundancy in mesh depends on protocol e.g. sender initiated vs receiver initiated. D E F G C S1 K L H I P R4 O R3 N T U S Q R5

  22. Design Challenges Protocol should handle mobility well Should have a low overhead because: Bandwidth is limited Overhead is related to battery power, also limited The above two objectives are often contradictory

  23. Previous Work ODMRP • Per sender control flood • Sender initiated mesh construction may lead to wasteful transmissions MAODV • Three step process for fixing links takes too long and adds to much overhead

  24. Mesh Based Routing Protocol On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  25. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  26. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  27. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers • Each sender floods JOIN Requests which set up a reverse path from each sender to each receiver. On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  28. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers • Each sender floods JOIN Requests which set up a reverse path from each sender to each receiver. • Receivers send out JOIN Tables along the reverse path to each sender. On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  29. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers • Each sender floods JOIN Requests which set up a reverse path from each sender to each receiver. • Receivers send out JOIN Tables along the reverse path to each sender. On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  30. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers • Each sender floods JOIN Requests which set up a reverse path from each sender to each receiver. • Receivers send out JOIN Tables along the reverse path to each sender. On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  31. Mesh Based Routing Protocol • Assume S1, S2, S3 are senders • Assume R1, R2, R3 are receivers • Each sender floods JOIN Requests which set up a reverse path from each sender to each receiver. • Receivers send out JOIN Tables along the reverse path to each sender. • Each node on a reverse path from sender to receiver defines the mesh On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  32. Drawbacks • Per-source flooding leads to significant overhead On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  33. Drawbacks • Per-source flooding leads to significant overhead • Sender-initiated mesh results in large number of wasted transmissions e.g. Nodes N4-N8 and N12 transmitting packets from S3wasteful (Only provide connectivity to S1 and S2) On Demand Multicast Routing Protocol (ODMRP) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  34. Tree Based Routing Protocol Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  35. Tree Based Routing Protocol • Assume S1, S2, S3 are senders Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  36. Tree Based Routing Protocol • Assume S1, S2, S3 are senders • First receiver joining the group becomes Group Leader, periodically broadcasting group-hello packets. Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Group Leader N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  37. Tree Based Routing Protocol • Assume S1, S2, S3 are senders • First receiver joining the group becomes Group Leader, periodically broadcasting group-hello packets. • Additional receivers Join the tree based on a three step process : 1) RREQ 2) RREP 3) MACT Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Group Leader N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  38. Tree Based Routing Protocol • Assume S1, S2, S3 are senders • First receiver joining the group becomes Group Leader, periodically broadcasting group-hello packets. • Additional receivers Join the tree based on a three step process : 1) RREQ 2) RREP 3) MACT • Senders also acquire routes to the tree using 1) RREQ 2) RREP 3) MACT • Data packets are forwarded over activated links. Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Group Leader N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  39. Drawbacks • Link Establishment / Link maintenance takes too long due to 3 steps, and has high overhead, leading to low PDR Multicast Ad hoc On demand Distance Vector (MAODV) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Group Leader N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  40. Our Contribution • ROMANT : First tree based protocol to give PDR comparable to mesh based protocols. • PUMA : Mesh based protocol with virtually fixed control overhead and high PDR • Adaptive Mesh Based Multicast : Best of both worlds • MODA : First protocol using DA’s increases transmission range for same energy consumption, reducing overhead. • CLAMMP : First protocol to reduce interference by distributed channel scheduling so that communicating nodes are on the same channel and non-communicating nodes are on different channels.

  41. Tree Based Routing Protocol RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  42. Tree Based Routing Protocol • Assume S1, S2, S3 are senders RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  43. Tree Based Routing Protocol • Assume S1, S2, S3 are senders • Like MAODV the first receiver joining the group is elected CORE of the group (highest ID wins if multiple join together) RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Core N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  44. Tree Based Routing Protocol • Assume S1, S2, S3 are senders • Like MAODV the first receiver joining the group is elected core of the group (highest ID wins if multiple join together) • Core periodically broadcasts a core announcement consisting of the following fields : • Core ID • Distance To Core = 0 • Group ID • Sequence Number RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 N6 N7 R2 N4 N5 R3 N10 N11 N8 N9 Core N14 N15 N16 N12 N13 R1 N17 N18 N19 S3

  45. 2,N5 2,N5 2,N6 2,N7 2,N7 • Intermediate nodes forward fresh core announcements (based on seq number) after incrementing distance to core by 1 • Core announcements allow each node to learn its distance to core and next hop towards core (Node reporting lowest distance to core) RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 1,R3 2,N7 2,N5 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

  46. 2,N5 2,N5 2,N6 2,N7 2,N7 • Intermediate nodes forward fresh core announcements (based on seq number) after incrementing distance to core by 1 • Core announcements allow each node to learn its distance to core and next hop towards core (Node reporting lowest distance to core) • Receivers send join announcements address of group and address of next-hop • Nodes receiving join announcements with their address as next-hop become tree members and also forward join announcements. RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 1,R3 2,N7 2,N5 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

  47. 2,N5 2,N5 2,N6 2,N7 2,N7 • Senders send data packets towards next-hops • Once data packets reach tree members they are flooded within the tree with a Packet ID cache used to drop duplicates. RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 1,R3 2,N7 2,N5 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

  48. 2,N5 2,N5 2,N6 2,N7 2,N7 • Senders send data packets towards next-hops • Once data packets reach tree members they are flooded within the tree with a Packet ID cache used to drop duplicates. • Does not require 3 step route discovery as nodes already have next-hop information RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 1,R3 2,N7 2,N5 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

  49. 2,N5 2,N5 2,N6 2,N7 2,N7 • Senders send data packets towards next-hops • Once data packets reach tree members they are flooded within the tree with a Packet ID cache used to drop duplicates. • Does not require 3 step route discovery as nodes already have next-hop information • Fixing link breaks is quick e.g. if S2-N7 is broken S2 can send to N6, without a 3 step route discovery. RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 2,N7 2,N5 1,R3 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

  50. 2,N5 2,N5 2,N6 2,N7 2,N7 • Senders send data packets towards next-hops • Once data packets reach tree members they are flooded within the tree with a Packet ID cache used to drop duplicates. • Does not require 3 step route discovery as nodes already have next-hop information • Fixing link breaks is quick e.g. if S2-N7 is broken S2 can send to N6, without a 3 step route discovery. RObust Multicasting in Ad hoc Networks using Trees (ROMANT) S1 N1 N2 S2 N3 1,R3 2,N7 2,N5 1,R3 1,R3 N6 N7 R2 N4 N5 1,R3 2,N10 2,N9 1,R3 R3 N10 N11 N8 N9 Core 1 1,R3 2,N15 2,N13 1,R3 N14 N15 N16 N12 N13 2,N13 2,N13 2,N14 2,N15 2,N15 R1 N17 N18 N19 S3

More Related