1. Multicasting in Ad Hoc Networks Dewan Tanvir Ahmed University of Ottawa Email: dahmed@discover.uottawa.ca dahmed@discover.uottawa.ca

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

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

4. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic4 Dewan Tanvir Ahmed 25 November, 2005 Multicast Routing Protocols MAODVAMRoute CAMP WARM OLAML-REMiT DDR AMRIS NSMPPUMA PBM DCMP PAST-DMODMRP ? G-REMiT S-REMiT MZR STMP MCEDAR ADMR FGMP MANSI

5. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic5 Dewan Tanvir Ahmed 25 November, 2005 MAODV (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 A node on becoming a group leader  Broadcasts a Group Hello message

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

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

8. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic8 Dewan Tanvir Ahmed 25 November, 2005 MAODV (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 lead to multicast tree instability

9. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic9 Dewan Tanvir Ahmed 25 November, 2005 Multicast RT Forwarding Group X ODMRP (Bae, Lee, Su, Gerla, 2000) s b a e XZ Y W d c Sender s Y, Zsb, cs a, Ws d, es Broadcast Join ReplyJoin Request

10. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic10 Dewan Tanvir Ahmed 25 November, 2005 ODMRP (Bae, Lee, Su, Gerla, 2000) Robustness

11. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic11 Dewan Tanvir Ahmed 25 November, 2005 ODMRP (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  May have multiple routes for one particular destination  Helps in case of topology changes and node failures  soft state 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.

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

13. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic13 Dewan Tanvir Ahmed 25 November, 2005 PAST-DM (Chao & Prasant, 2004) Initial Virtual & Physical Topology B D C A B D C AB D C A Same Initial Topology Physical Topology Changed Adapt Virtual Topology B D C A B D CA Look at Redundancy

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

15. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic15 Dewan Tanvir Ahmed 25 November, 2005 B PAST-DM (Chao & Prasant, 2004) Data Delivery Tree C s A BD E 02 12 03 12 12 22 230 2 0 2 2 4 6 ABCDE A DE C

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

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

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

19. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic19 Dewan Tanvir Ahmed 25 November, 2005 PBM (Martin et al., 2003) K Neighbor Forwarding node Communication link 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 Greedy Multicast Forwarding Minimize the expression No. of neighbors that packet is transmitted to Remaining distance to all destinations

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

21. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic21 Dewan Tanvir Ahmed 25 November, 2005 PBM (Martin et al., 2003) Observation  Static Environment Performs well  Dynamic Environment Create routing loops Packet loss

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

23. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic23 Dewan Tanvir Ahmed 25 November, 2005 L-REMiT (Bin and Gupta, 2003) { Energy Cost of a node Life Time of a node Life Time of MT Bottleneck Node

24. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic24 Dewan Tanvir Ahmed 25 November, 2005 gain = LT(T new ) – LT(T old ) L-REMiT (Bin and Gupta, 2003) Change : changing i’s parent x to y x, y i Lifetime - Refining Energy efficiency of Multicast Tree gain > 0, due to Change x, y i

25. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic25 Dewan Tanvir Ahmed 25 November, 2005 Save 9 L-REMiT (Bin and Gupta, 2003) 3 9 7 5 1 4 2 8 6 10 2.5 2.25 2.4 1 2.75 1.5 2.3 4.3 3.3 4.75 Bottleneck Node

26. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic26 Dewan Tanvir Ahmed 25 November, 2005 Conclusion State of the Art  MAODV Low overhead Low latency  ODPRP Backup paths Scalability issues Holes at Energy Saving

27. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic27 Dewan Tanvir Ahmed 25 November, 2005 References S. Corson and J. Macker, “Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations”, RFC 2501, January 1999. E. Royer, and C. E. Perkins, “Multicast operation of the ad hoc on-demand distance vector routing protocol”, MobiCom, Aug. 1999, pages 207-218. 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. C. E. Perkins and E. M. Royer. Ad-hoc On-Demand Distance Vector Routing. In Proceedings of 2nd IEEE Wksp. Mobile Comp. Sys. and Apps., pages 90--100, Feb. 1999. C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks,” Proc. IEEE WCNC’03, New Orleans, LA, Mar., 2003. 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: MobiHoc 2003. Hrsg. B. Wang and S. K. S. Gupta. S-REMiT: “S-REMiT: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks ”, In Proceedings of IEEE GlobleCOM, San Francisco, CA, Dec. 2003, pp. 3519-3524

28. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic28 Dewan Tanvir Ahmed 25 November, 2005 References B. Wang and S. K. S. Gupta, "G-REMiT: 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. 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. 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. 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. C. Gui and P. Mohapatra, "Efficient Overlay Multicast for Mobile Ad Hoc Networks," Proc. IEEE WCNC'03, New Orleans, LA, Mar., 2003.

29. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic29 Dewan Tanvir Ahmed 25 November, 2005 Thank You!

30. CSI5140F: Wireless Ad Hoc Networking Ivan Stojmenovic30 Dewan Tanvir Ahmed 25 November, 2005 Questions and Answers 1. Mention two differences between MAODV and ODMRP? a. AODV uses a shared bi-directional multicast tree while ODMRP maintains a mesh topology rooted from each source. b. ODMRP broadcasts the reply back to the source while MAODV unicast the reply. c. MAODV does not activate a multicast route immediately while ODMRP does. 2. What algorithms are used in Position Based Multicasting (PBM)? When it switches one to other? a. 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. 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.