1. A Seamless Handoff Approach of Mobile IP Protocol for Mobile Wireless Data Network. 資研一 黃明祥

2. Overview Abstract Introduction Overview of Mobile IP A Seamless Handoff Approach Simulation and Results Conclusion

3. Abstract Today, mobile high-bandwidth data communications are becoming the next candidate of new targeting business. In what kind of approach we could make the communication more comfortable and more correct ？

4. Introduction Mobile IP technique is the most common solution for offering seamless roaming to mobile devices. There are many problems associated with Mobile IP. Such as : Triangular routing, about tunneling management, etc.

5. Triangular routing problem

6. How to solve that problems? Route optimization is proposed by using binding update. In this paper, it proposes a seamless handoff mechanism to modify Mobile IP protocol.

7. Approach Propose an efficient handoff scheme in a routing table. (named Mobile Routing Table. MRT) Propose a packet retransmission scheme to reduce the packet loss.

8. Overview of Mobile IP Main Components of MIP. Basic Operations of MIP. Problems in MIP.

9. Main Components of MIP Home Network ： the network provide to which MN is registered. (the address is Home Address.) Foreign Network ： every other a MN can connect. Care-of Address (CoA) IP that MN registers with its home agent.

10. Main Components of MIP

11. Basic Operation of MIP Agent Advertisement messages. Mobile Agent Discovery. Registration. Tunneling. Binding Update. Foreign Agent Smooth Handoffs.

12. Problems in MIP MIP has a triangular routing problem with a MN roaming from HA to FA. It causes two problems ： 。 Longer packet transmission time. 。 The handoff process results in packet loss.

13. A Seamless Handoff Approach

14. Difference Standard Mobile IP ： implement a binding cache. Our Approach ： construct an MRT in each mobile agent. (including HA, FA, and router)

15. Mobile Routing Table (MRT)

16. Example of MRT

17. The State Transition

18. MRT Registration/Update (1/2)

19. MRT Registration/Update (2/2)

20. The Proposed Handoff Scheme Packet transmission CN→MN. Packet transmission MN→CN. Inter-network handoff.

21. CN→MN (1/2)

22. CN→MN(2/2)

23. MN→CN

24. MN Inter-Network Handoff

25. Packet Retransmission Mechanism

26. Comparison (1/2) Δ1 ： From MN to HA or FA. Δ2 ： From FA to MN. Δ3 ： From HA to FA or from previous FA to new FA.

27. Comparison (2/2) T ： Traffic between MN and CN. N ： The numbers of MNs that move from HA to FA.

28. Simulation and Results (1/4)

29. Simulations and Results (2/4)

30. Simulations and Results (3/4)

31. Simulations and Results (4/4)

32. Conclusion Based on MRT scheme, it can ： 。 avoid the triangular routing problem. 。 a packet retransmission scheme to reduce packet loss during handoff.