Multicasting in Ad Hoc Networks Dewan Tanvir Ahmed

Multicasting in Ad Hoc Networks Dewan Tanvir Ahmed University of Ottawa Email: dahmed@discover. uottawa. ca 25 November, 2005

Recap n Multicasting Group communication ¨ One-to-many ¨ n ¨ Many-to-many n n In Battle field Rescue team communication Why not using existing multicast protocol Resource constraints ¨ Frequent tree reorganization ¨ n n ¨ signaling overhead loss of datagram Protocol design n Dewan Tanvir Ahmed 25 November, 2005 robustness vs. efficiency CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 2

Multicasting in MANET n Structure ¨ Tree-based n n ¨ Mesh-based n n n Shared multicast tree Vulnerable to high mobility, load and large group Quick reconfigurable Excessive message overhead Focusing on Position Based ¨ Energy ¨ n n Life time improvement Minimizing TEC Reliability ¨ Qo. S, etc. ¨ Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 3

Multicast Routing Protocols MAODV AMRoute WARM CAMP MZR S-REMi. T NSMP PUMA DCMP PBM Dewan Tanvir Ahmed 25 November, 2005 OLAM AMRIS ? MCEDAR STMP PAST-DM ADMR MANSI L-REMi. T ODMRP G-REMi. T DDR CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic FGMP 4

MAODV n (Royer and Perkins, 1999) Each multicast group has a group leader 1 st node joining a group becomes Group Leader ¨ Responsible for maintaining group SN (sequence number) ¨ SN ensures freshness of routing information ¨ n A node on becoming a group leader ¨ Broadcasts a Group Hello message Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 5

MAODV (Royer and Perkins, 1999) Group member Group Join Process Multicast Tree member Multicast Broadcast Activation - RREQ Broadcast Group Hello Ordinary node Only GM Responds Potential Group member L Multicast link Communication link Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 6

MAODV (Royer and Perkins, 1999) Group member Leaving a Multicast Group Multicast Tree member Non leaf Node Must remain as a Tree member Ordinary node Departing Multicast group Multicast link Communication link L Leaf Node Send a Prune Again Leaf Node Remove himself from MT Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 7

MAODV n (Royer and Perkins, 1999) Observation Similar to unicast AODV ¨ Leader helps in tree maintenance ¨ No alternate path as it forms a tree ¨ Excessive use of RREQ ¨ n Dewan Tanvir Ahmed 25 November, 2005 lead to multicast tree instability CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 8

ODMRP (Bae, Lee, Su, Gerla, 2000) Join. Request Reply Forwarding Broadcast Group Multicast RT s Y, Z b s b, c Z X c s X s s a, W Y s d, e Sender a e W d Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 9

ODMRP (Bae, Lee, Su, Gerla, 2000) Robustness Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 10

ODMRP n (Bae, Lee, Su, Gerla, 2000) Observation Sender Forms and Maintains the multicast group ¨ Don’t need to be built on top of a unicast routing protocol ¨ Richer connectivity ¨ ¨ q May have multiple routes for one particular destination q Helps in case of topology changes and node failures soft state n n Member nodes are refreshed as needed by source Do not send explicit leave message Periodic Broadcast of Join Request ¨ Control overhead of route refreshes => Scalability issue. ¨ Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 11

PAST-DM n n n (Chao & Prasant, 2004) Progressively Adapted Sub-Tree in Dynamic Mesh Build virtual mesh spanning all members Use unicast tunneling Concept Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 12

PAST-DM (Chao & Prasant, 2004) D Initial. Adapt Virtual & Physical Topology D Same Initial Topology BC BA A C Physical Topology Changed D D D C B B B A A A C C Look at Redundancy Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 13

PAST-DM Dynamic Mesh Creation (Chao & Prasant, 2004) One Group of the Group Join Request member- ERS Respond Send Virtual Not Blind Link. Flooding State Packet Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 14

PAST-DM (Chao & Prasant, 2004) Data Delivery Tree 002 A A C A B C D E B D E 122 C 263 122 s E 003 242 B D 122 Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 15

PAST-DM n Pros ¨ n (Chao & Prasant, 2004) Easy to join to a group Cons Link State Table exchange with neighbors (no flooding) ¨ Mandatory GROUP_LEAVE message ¨ Hard to prevent ¨ n ¨ different unicast tunnels from sharing same physical links To Construct Data Delivery tree n n Dewan Tanvir Ahmed 25 November, 2005 Whole topology information is required i. e. Decision is local but information is global CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 16

PBM (Martin et al. , 2003) conflicting minimization n. Two Position Based Multicast goals n n q Length of path to individual destination Forwarding Decision q Total hops to forward to all destination ¨ Based on Geographical Position Neighbor Forwarding node Communication link Sender has the knowledge (assumptions) Position of destination(s) ¨ Position of neighbor(s) ¨ It’s own position ¨ n + No Maintenance of distribution structure (Tree/Mesh) ¨ Resorts flooding ¨ Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 17

PBM (Martin et al. , 2003) Neighbor Forwarding node Communication link Current Forwarding Node K Find a set of neighbors Forward the packet next Two conflicting Minimization goal Potential Forwarding Node Total hops to forward to all destination Dewan Tanvir Ahmed 25 November, 2005 Length of path to individual destination CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 18

PBM (Martin et al. , 2003) Greedy Multicast Forwarding Neighbor Forwarding node K: Forwarding node N: Set of all neighbors of K W: Set of all subsets of W Z: Set of all destinations d(x, y): distance between x and y Communication link Minimize the expression K No. of neighbors that Remaining packet is transmitted to distance to all destinations Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 19

PBM (Martin et al. , 2003) Perimeter Multicast Forwarding Neighbor Forwarding node Communication link Greedy Multicast No progress for destination(s) K Perimeter Multicast Like FACE Traverse the boundaries of the gaps in the network until Greedy can be resumed Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 20

PBM n (Martin et al. , 2003) Observation ¨ Static Environment n ¨ Performs well Dynamic Environment n n Dewan Tanvir Ahmed 25 November, 2005 Create routing loops Packet loss CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 21

L-REMi. T n (Bin and Gupta, 2003) Total Energy Consumption (TEC) ¨ Network/System Lifetime (NL/SL) ¨ Minimum Energy Multicast Tree NL = 480/12 = 40 P 8 EU/P 12 B 10 C Maximum Lifetime Multicast Tree TEC = 8+10 = 18 EU/P A 12 8 B C Dewan Tanvir Ahmed 25 November, 2005 8 A TEC = 12 EU/P Initial Energy = 480 Unit A Energy Optimization NL = 480/10 = 48 P B CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 10 C 22

L-REMi. T Energy Cost of a node (Bin and Gupta, 2003) { Life Time of a node Life Time of MT Bottleneck Node Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 23

L-REMi. T (Bin and Gupta, 2003) Lifetime - Refining Energy efficiency of Multicast Tree Change x, y : changing i’s parent x to y i gain = LT(Tnew) – LT(Told) x, y gain > 0, due to Changei Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 24

L-REMi. T (Bin and Gupta, 2003) Bottleneck Node Save 9 2 8 4. 75 4 3. 3 2. 5 1 2. 25 1 9 2. 75 6 2. 4 10 1. 5 4. 3 2. 3 3 7 5 Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 25

Conclusion n State of the Art ¨ MAODV n n ¨ ODPRP n n n Low overhead Low latency Backup paths Scalability issues Holes at Energy Saving Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 26

References n S. Corson and J. Macker, “Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations”, RFC 2501, January 1999. n E. Royer, and C. E. Perkins, “Multicast operation of the ad hoc on-demand distance vector routing protocol”, Mobi. Com, Aug. 1999, pages 207 -218. n Sung-Ju Lee, William Su, and Mario Gerla, "On-demand multicast routing protocol (ODMRP) for ad hoc networks", Internet Draft, draft-ietfmanet-odmrp-02. txt, 2000, work in progress. n C. E. Perkins and E. M. Royer. Ad-hoc On-Demand Distance Vector Routing. In Proceedings of 2 nd IEEE Wksp. Mobile Comp. Sys. and Apps. , pages 90 --100, Feb. 1999. n C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks, ” Proc. IEEE WCNC’ 03, New Orleans, LA, Mar. , 2003. n Mauve, M. , Füßler, H. , Widmer, J. , Lang, T. , "Poster: Position-Based Multicast Routing for Mobile Ad-Hoc Networks", In Proceedings of Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing: Mobi. Hoc 2003. Hrsg. n B. Wang and S. K. S. Gupta. S-REMi. T: “S-REMi. T: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks ”, In Proceedings of IEEE Globle. COM, San Francisco, CA, Dec. 2003, pp. 3519 -3524 Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 27

References n B. Wang and S. K. S. Gupta, "G-REMi. T: An Algorithm for Building Energy Efficient of Multicast Trees in Wireless Ad Hoc Networks", In Proceedings of IEEE International Symposium on Network Computing and Applications (NCA), Cambridge, MA, April 2003, pp. 265 -272. n Bin Wang, Sandeep K. S. Gupta. "On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks, " International Conference on Parallel Processing (ICPP'03), 2003. n J. J. Garcia-Luna-Aceves, and E. L. Madruga, "The core-assisted mesh protocol, " IEEE Journal on Selected Area in Communications, Special Issue on Ad-Hoc Networks, Vol. 17, No. 8, Aug. 1999. n C. W. Wu, Y. C. Tay, and C-K. Toh, "Ad hoc multicast routing protocol utilizing increasing id-numbers (AMRIS) Functional Specification, " Internet draft, IETF, Nov. 1998. n C. Gui and P. Mohapatra, "Efficient Overlay Multicast for Mobile Ad Hoc Networks, " Proc. IEEE WCNC'03, New Orleans, LA, Mar. , 2003. Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 28

Thank You! Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 29

Questions and Answers 1. Mention two differences between MAODV and ODMRP? a. b. c. 2. AODV uses a shared bi-directional multicast tree while ODMRP maintains a mesh topology rooted from each source. ODMRP broadcasts the reply back to the source while MAODV unicast the reply. MAODV does not activate a multicast route immediately while ODMRP does. What algorithms are used in Position Based Multicasting (PBM)? When it switches one to other? Greedy multicast (GM) b. Perimeter multicast PM) When there is no progress for one or more destinations, it switches GM to PM for these destination(s) and continues PM until GM can be resumed. a. n What are the two conflicting goals in designing multicast tree in terms of energy? a. Minimum Energy Multicast Tree Optimizes (minimize) total energy consumption of the multicast tree b. Maximum Lifetime Multicast Tree Optimizes (maximizes) lifetime of the multicast tree. Dewan Tanvir Ahmed 25 November, 2005 CSI 5140 F: Wireless Ad Hoc Networking Ivan Stojmenovic 30