1 / 36

Student : kwin-yee Lin Advisor: Chun-Chuan Yang

Distributed Mobile Tracking A Novel Location Management Scheme for Routing Improvement in Cellular IP Networks. Student : kwin-yee Lin Advisor: Chun-Chuan Yang

denali
Download Presentation

Student : kwin-yee Lin Advisor: Chun-Chuan Yang

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. Distributed Mobile TrackingA Novel Location Management Scheme forRouting Improvement in Cellular IP Networks Student : kwin-yee Lin Advisor: Chun-Chuan Yang Ref: “Distributed Mobile Tracking: A Novel Location Management Scheme for Routing Improvement in Cellular IP Networks,” Journal of Computer Networks, vol. 43, issue 2, October 2003, pp. 147-161. http://www.csie.ncnu.edu.tw/~ccyang/Publication/COMNET2003.pdf

  2. Outline • Introduction • Distributed Mobile Tracking • Improvement of DMT • Routing protocols • Performance Evaluation • Conclusion

  3. Introduction • Wired→Wireless • personal communications technologies • Wireless IP protocol • Mobile IP • Cellular IP

  4. Cellular IP network

  5. Distributed Mobile Tracking • Distributed location management • Trace of the mobile host • Hybrid with original cellular IP protocol

  6. Mobile Tracking Tree (MT-Tree)

  7. Maintain Tree Structure

  8. Improvement of DMT • Tree-pruning • Branches of MT-Tree are never longer than the path of original gateway routing • Tree-growing • Increase the coverage area of MT-Tree

  9. Tree-pruning (I)

  10. Tree-pruning (II)

  11. Tree-growing (I)

  12. Tree-growing (II)

  13. Unicast protocol • A hybrid routing scheme • A base station has received a data packet： • Destination found in MT-Cache • Destination not found in MT-Cache

  14. Gateway-based multicast protocol (GBMP)

  15. Gateway-based multicast protocol with route option (GBMP-RO)

  16. Mobile tracking-based multicast protocol (MTMP)

  17. Discussion • Overhead introduced by DMT： • Base Station • MT-Cache maintenance • Pruning process and Growing process • Mobile Host • MT-Cache Update during handoff • Multicast • GBRouteOption and MTRouteOption

  18. Simulation environment • Network topology：8 × 8 mesh • 5000 mobile hosts • 2000 sets in each time slot • 600 time slots in each round • MoveProb parameter

  19. Performance criteria • Average hop count • Average cost of multicasting • Load of each wired link in the cellular IP network

  20. Average hop count

  21. Hit ratio of unicast

  22. Link load (unicast)

  23. Average transmission cost (multicast)

  24. Link load（group size = 2）

  25. Link load（group size = 4）

  26. Link load（group size = 8）

  27. Hit ratio of MTMP

  28. Conclusion • DMT is proposed • Improvement of DMT： • Tree-pruning • Tree-growing

  29. Conclusion • Proposed Multicast Protocols： • GBMP，GBMP-RO • MTMP • Adv. of DMT-based protocol： • Shorter path • Load balance • Future work

  30. Extended Research Ref: “A Multicast Routing Protocol for Group Communications in Cellular IP Networks,” Proceedings, IEEE ICC, 2005. http://www.csie.ncnu.edu.tw/~ccyang/Publication/ICC2005.pdf • Motivation • Large group size  low hit ratio of MT-Tree routing in MTMP, and MTMP is more like GBMP-RO • Reason: MT-Trees of group members are built independently • Idea of distributed group tracking

  31. DGT-Cache Structure: Group ID Branch information Radio user count (RC) Branch information: a list of base station ID (a) Structure of DGT-Cache G1 B1, B3, B5 RC=0 G1 B3 RC=1 G1 B2 RC=1 B1 B2 B3 B4 m1 m2 m3 G1 B2, B4 RC=1 G1: m1, m2, m3, m4 B5 G1 B2 RC=1 m4 (b) Example of DGT-Tree Distributed Group Tracking (DGT) Figure 1. Using DGT-Cache for representing DGT-Tree

  32. m2 wants to join group G1 • m2 sends an IGMP-Join message to G • G asks m1 to report location to m2 • m1 informs m2 its current location (B1) • m2 invokes DGT-Tree-Grow toward B1 G1: m1 G Gateway 2. 3. 1. B1 B2 B3 B4 4. m2 m1 Branch-Extend (G1, B4, B3) Branch-Extend (G1, B3, B2) Branch-Extend (G1, B2, B1) Figure 2. E.g. DGT-Tree-Grow process DGT-Tree: join operation

  33. DGT-Tree: leave operation B3 m2 Branch-Cut (G1, B4, B2) B2 B4 B5 m3 m3 leaves group G1 2. 1. B1 Branch-Cut (G1, B5, B4) m1 Figure 3. E.g. DGT-Tree-Trim process

  34. DGT-Tree: handoff scheme DGT-Tree DGT-Tree DGT-Tree-Grow DGT-Tree-Trim RC-- B1 B2 RC-- B1 B2 RC++ m1 m1 Handoff Handoff (a) New base station is not on DGT-Tree (b) New base station is on DGT-Tree Figure 4. DGT handoff scheme

  35. Figure 5. Average transmission cost (MoveProb = 0.5) Simulation result: transmission cost

  36. Figure 6. Relative link load at 600th time slot (Group size = 10, MoveProb = 0.5) Simulation result: related link load

More Related