html5-img
1 / 50

Reliable Multisource multicast routing protocol over manet

Reliable Multisource multicast routing protocol over manet. Speaker: Wu, Chun-Ting Advisor : Ke , Kai-Wei. Outline. Introduction Efficient Expanding Ring Search (ERS) Mobility Prediction (MP) Virtual Mesh (VM) Bidirectional multicast data delivery (BMD) Numerical Results

archer
Download Presentation

Reliable Multisource multicast routing protocol over manet

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. Reliable Multisource multicast routing protocol over manet Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei

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

  3. 1. Introduction • 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 • 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. Proposed RMMRP • 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

  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 D S D S

  18. ERS – 2 • Efficient Expanding Ring Search [11] • 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. ERS – 3 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. ERS – 4 • 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. 3. Mobility Prediction (MP) • 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. Mobility Prediction Example • 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 9 2 B E 8 1 C 9 D

  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 • Lifetime is a constant • RMMRP • 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 topology stability) 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. 4. Virtual Mesh (VM)

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

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

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

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

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

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

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

  36. 6. Numerical Results Simulation Environments

  37. Repair Frequency (RMMRP vs. MMAODV)

  38. Control Overhead (RMMRP vs. MMAODV)

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

  40. Control Overhead

  41. Delivery Ratio (RMMRP vs. MMAODV)

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

  43. Pure Multicast

  44. Pure Multicast (RMMRP vs. MMAODV)

  45. Speed (RMMRP vs. MMAODV)

  46. Mobility model (RMMRP vs. MMAODV)

  47. 7. Conclusions and future works Conclusions • 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

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

  49. Thanks for your attention Q & A

  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

More Related