1. ENHANCED MAODV Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei 1

2. Outline 2  Protocol Overview  Enhanced Ring Search  Flow-Oriented Routing  Virtual Mesh  Simulation results  Work to be done  Reference

3. My Research – Enhanced Multisource MAODV for MANET 3  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. Enhancing MAODV for MMR 16  Methodology  Apply ERS for reducing RREQ overhead  Modify FORP to apply the Join Procedure  Propose VM to fast recover topology broken  Propose RPF to support fast multicast delivery Join Repair RREQ Reply Permission RREP Establish Prune MACT

17. Ring Search  Motivation  Reduce RREQ overhead  Objective  Power-saving  Avoid channel contentions as possible  TTL concept applied 17 S D S D

18. Enhanced Ring Search (ERS) – 1 18  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. Enhanced Ring Search (ERS) – 2 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. Enhanced Ring Search (ERS) – 3 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. Flow-Oriented Routing Protocol 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. Flow-Oriented 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  1-5-10-12-13 RET=5  1-5-4-8-13 RET=7  Select path with larger RET 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 8 9 5 7 9 89 Flow-SETUP Flow-REQ

24. Join Procedure (modified for stable)  MAODV  RREP  Mgroup_Hop indicates the distance of the tree  M-MAODV  RREP  Lifetime means the expiration time of the path from tree 24

25. Join Procedure (modified for stable) 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. Virtual Mesh (VM) 28

29. Virtual Mesh (VM) 29 1 2 3 1 2 3 1 2 3 Group Leader Candidate Leader New partition leader

30. Multicast Delivery (modification)  Multicast RPF Degree ↑ Delay ↓ 30

31. Multicast Delivery (modification) 31 LeaderSourceLeaderSource Members respond RREPs back to Source Source broadcast RREQs to find the group member

32. Multicast Delivery (modification) 32 LeaderSource Source first send the data to that member, and the member deliver data by RPF

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

34. Simulation Environment 34 ParameterValue Simulation time300s Play ground1000*1000m 2 Nodes (network size)10, 20, 30, 40, 50 MAC802.11b Bit-rate1/2/5.5/11 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, (5/10/15/20)mps]

35. Delivery Ratio (Proposed vs. MAODV) 35

36. Delivery Ratio (Proposed vs. MAODV+ERS) 36

37. Delivery Ratio (Proposed vs. MAODV) 37

38. Control Overhead (Proposed vs. MAODV) 38

39. Control Overhead (Proposed vs. MAODV+ERS) 39

40. Repair Frequency 40

41. Speed (Proposed vs. Original) 41

42. Issue  Local vs. Global stable  TTL  Flow-Oriented  Reduce the possibility of out-of-range broken  Cannot optimize whole network 42

43. Work to be done 43  Summarize existed MMC algorithm and comparison  Effect of variable packet sizes and mobility

44. Reference 44  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  Ngoc Duy Pham, Hyunseung Choo, “Energy Efficient Expanding Ring Search for Route Discovery in MANETs,” Communications, 2008. ICC ‘08. IEEE International Conference on, vol., no., pp.3002-3006, 19-23 May 2008  William Su, Sung-Ju Lee, and Mario Gerla, “Mobility Prediction In Wireless Networks,” MILCOM 2000. 21st Century Military Communications Conference Proceedings, Volume: 1, 22-25 Oct. 2000 Pages:491 - 495 vol.1