1 / 44

Enhanced MAODV

Enhanced MAODV. Speaker: Wu, Chun-Ting Advisor : Ke , Kai-Wei. Outline. Protocol Overview Enhanced Ring Search Flow-Oriented Routing Virtual Mesh Simulation results Work to be done Reference. My Research – Enhanced Multisource MAODV for MANET. Motivation

beck
Download Presentation

Enhanced MAODV

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. Enhanced MAODV Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei

  2. Outline • 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 • Motivation • Improve the efficiency of Multisource multicast over MANET • Objective • Reduce control overhead • More stable topology • Fast recovery

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

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

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

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

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

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

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

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

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

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

  14. Repair Link breakage

  15. Merge Partition

  16. Enhancing MAODV for MMR • 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

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

  18. Enhanced Ring Search (ERS) – 1 • Collect local topology information • Reduce the overhead of pure flooding Relay: false PredAddr: A Relay: false PredAddr: A Relay: false PredAddr: A B Relay: false PredAddr: Relay: false PredAddr: A B Relay: false PredAddr: B D E A D E A Relay: false PredAddr: Relay: true PredAddr: Relay: false PredAddr: A C Relay: false PredAddr: A C

  19. Enhanced Ring Search (ERS) – 2 Relay: true PredAddr: A B Relay: false PredAddr: A Relay: false PredAddr: B D E A Relay: true PredAddr: C Relay: false PredAddr: A Relay: true PredAddr: A B Relay: false PredAddr: A Relay: false PredAddr: B D E A Relay: true PredAddr: C Relay: false PredAddr: B

  20. Enhanced Ring Search (ERS) – 3 • A → B → D Relay: true PredAddr: A B Relay: false PredAddr: A Relay: false PredAddr: B D E A Relay: true PredAddr: C Relay: false PredAddr: B

  21. Flow-Oriented Routing Protocol • Motivation • Establish a stable routing path • Objective • Cluster concept • Reduce possibility of repairing • GPS supported

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

  23. Flow-Oriented Example 15 • 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 14 5 13 12 11 9 7 9 10 8 9 9 8 4 7 6 5 8 3 2 1 Flow-REQ Flow-SETUP

  24. Join Procedure (modified for stable) • MAODV • RREP<R_Flag, U_Flag, Dest_Addr, Dest_Seq, Hop_Cnt, Lifetime, Mgroup_Hop, Group_Leader_Addr> • Mgroup_Hop indicates the distance of the tree • M-MAODV • RREP<R_Flag, U_Flag, Dest_Addr, Dest_Seq, Hop_Cnt, Lifetime, Group_Leader_Addr> • Lifetime means the expiration time of the path from tree

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

  26. Root Recovery

  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

  28. Virtual Mesh (VM)

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

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

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

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

  33. Benefits • More stable tree topology • Reduce the control overhead • Fast root recovery

  34. Simulation Environment

  35. Delivery Ratio (Proposed vs. MAODV)

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

  37. Delivery Ratio (Proposed vs. MAODV)

  38. Control Overhead (Proposed vs. MAODV)

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

  40. Repair Frequency

  41. Speed (Proposed vs. Original)

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

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

  44. 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 • Ngoc DuyPham, HyunseungChoo, “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

More Related