1. RELIABLE MULTISOURCE MULTICAST ROUTING PROTOCOL OVER MANET Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei

2. Outline 2 1. Introduction 2. Efficient Expanding Ring Search (ERS) 3. Mobility Prediction (MP) 4. Virtual Mesh (VM) 5. Bidirectional multicast data delivery (BMD) 6. Numerical Results 7. Future works & Conclusions

3. 1. Introduction 3  My Research – Reliable Multisource Multicast Routing Protocol (RMMRP)  Motivation  Improve the efficiency of Multisource multicast over MANET  Objective  Reduce control overhead  More stable topology  Fast recovery

4. MAODV Review 4  Data Delivery Process  Unicast  Multicast  Group Managements  Join  Leave  Repair  Merge

5. Unicast Delivery 5 Source Destination RREQ Source Destination RREP Source Destination Data

6. Multicast Delivery 6 LeaderSourceLeaderSource Source broadcast RREQs to find the group leader

7. Multicast Delivery 7 LeaderSourceLeaderSource The data passed to Leader and flooded to the tree Leader respond a RREP

8. Join 8 Group Leader member router join node Broadcast Join RREQ across network

9. Join 9 Group Leader member router join node Members respond with RREPs

10. Join 10 Group Leader member router join node Send a MACT back

11. Join 11 Group Leader member router join node Become a member

12. Leave 12 Group Leader member router leaving node Send a MACT to Parent

13. Leave 13 Group Leader member router leaving node Leave the group

14. Repair Link breakage 14

15. Merge Partition 15

16. Proposed RMMRP 16  Methodology  Apply ERS to reduce RREQ overhead  Modify MP to reduce recovery frequency  Propose VM to speed up topology recovery  Propose BMD to support fast multicast data delivery Join Repair RREQ Reply Permission RREP Establish Prune MACT

17. 2. Efficient Expanding Ring Search (ERS) – 1  Expanding Ring Search [8]  Motivation  Reduce RREQ overhead  Objective  Power-saving  Avoid channel contentions as possible  TTL concept applied 17 S D S D

18. ERS – 2 18  Efficient Expanding Ring Search [11]  Collect local topology information  Reduce the overhead of pure flooding E B A C D E B A C D Relay: false PredAddr: A Relay: false PredAddr: Relay: false PredAddr: A Relay: false PredAddr: A Relay: false PredAddr: Relay: false PredAddr: A Relay: true PredAddr: Relay: false PredAddr: A Relay: false PredAddr: A Relay: false PredAddr: B

19. ERS – 3 19 E B A C D E B A C D Relay: false PredAddr: A Relay: true PredAddr: Relay: true PredAddr: A Relay: false PredAddr: A Relay: false PredAddr: B Relay: false PredAddr: A Relay: true PredAddr: Relay: true PredAddr: A Relay: false PredAddr: B Relay: false PredAddr: B

20. ERS – 4 20  A → B → D E B A C D Relay: false PredAddr: A Relay: true PredAddr: Relay: true PredAddr: A Relay: false PredAddr: B Relay: false PredAddr: B

21. 3. Mobility Prediction (MP) 21  Motivation  Establish a stable routing path  Objective  Cluster concept  Reduce possibility of repairing  GPS supported

22. Link Expiration Time 22 A (Xa, Ya)B (Xb, Yb) TaTb Va Vb

23. Mobility Prediction Example 23  LET: Link Expiration Time  The amount of time that a certain link will remain connected  RET: Route Expiry Time  The minimum of the LET values of all links on a path  Two paths  A-B-C-D RET=8  A-E-D RET=1  Select path with larger RET A D C E B 9 8 9 2 1

24. Join Procedure (modified for stable)  MAODV  RREP:  Mgroup_Hop indicates the distance of the tree  Lifetime is a constant  RMMRP  RREP:  Lifetime means the expiration time of the path from tree 24

25. Join Procedure (modified for topology stability) 25 Group Leader Members respond with RREPs including the LET Group Leader member router join node Join node send a MACT along the longest RET path 5 75 2 5 3

26. Root Recovery 26

27. Root Recovery  rte_discovery_timeout = 1 sec  rreq_retries = 2 times  MAODV’s root recovery takes at least 3 sec on waiting  Merging several partitions takes lots of time as well 27

28. 4. Virtual Mesh (VM) 28

29. VM Example 1 29 1 2 3 1 2 3 1 2 3 Group Leader Candidate Leader New partition leader

30. VM Example 2 – 1 30 A B C Group Hello: Candidate=A Current Leader Candidate A D E B C F

31. VM Example 2 – 2 31 A D E B C F MACT_GL A D E B C F

32. 5. Bidirectional multicast data delivery  Multicast Reverse Path Forwarding Degree ↑ Delay ↓ 32

33. Bidirectional multicast data delivery 33 LeaderSourceLeaderSource Members respond RREPs back to Source Source broadcast RREQs to find the group member

34. Bidirectional multicast data delivery 34 LeaderSource Source first send the data to that member, and the member deliver data by RPF

35. Benefits 35  More stable tree topology  Reduce the control overhead  Fast root recovery ERS MP VM

36. 6. Numerical Results 36 ParameterValue Simulation time300s Play ground1000*1000m 2 Nodes (network size)10, 20, 30, 40, 50 MAC802.11 Bit-rate2 Mbps Tx power100mW Join intervalPoisson(10s) Leave intervalPoisson(20s) Unicast data intervalPoisson(5s) Multicast data intervalPoisson(10s) Leader die intervalPoisson(30s) Mobility modelRandom way point Move speedUniform[0, 5mps] Simulation Environments

37. Repair Frequency (RMMRP vs. MMAODV) 37

38. Control Overhead (RMMRP vs. MMAODV) 38

39. Control Overhead (RMMRP vs. MMAODV+ERS) 39

40. Control Overhead 40

41. Delivery Ratio (RMMRP vs. MMAODV) 41

42. Delivery Ratio (RMMRP vs. MMAODV+ERS) 42

43. Pure Multicast 43

44. Pure Multicast (RMMRP vs. MMAODV) 44

45. Speed (RMMRP vs. MMAODV) 45

46. Mobility model (RMMRP vs. MMAODV) 46

47. 7. Conclusions and future works 47  Modified core-based tree structure by  Virtual mesh  Bidirectional multicast data delivery  Proposed a reliable multisource multicast with  Fast recovery  Low control overhead  Higher delivery ratio  Verified the performance through intensive simulations Conclusions

48. Future Works 48  Improve delivery ratio  Cross-layered design (e.g. Network layer with MAC)  Other wireless medium  More performance metric  End-to-end delay  QoS

49. Q & A Thanks for your attention

50. Reference  Royer, E.M. and Perkins, “Multicast operation of the ad- hoc on-demand distance vector routing protocol,” Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking ACM, 1999, pp. 207-218  Pham, N.D. and Choo, H., “Energy ERS for Route Discovery in MANETs,” Communications, 2008. ICC '08. IEEE International Conference on 2008, pp. 3002-3006  William Su, Sung-Ju L., and Mario Gerla, “Mobility Prediction In Wireless Networks,” MILCOM 2000. 21st Century Military Communications Conference Proceedings, 22-25 Oct. 2000, pp. 491-495, vol.1