A Seamless Handoff Approach of
Mobile IP Protocol for Mobile
Wireless Data Network.
資研一 黃明祥
Overview
Abstract
Introduction
Overview of Mobile IP
A Seamless Handoff Approach
Simulation and Results
Conclusion
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？
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.
Triangular routing problem
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.
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.
Overview of Mobile IP
Main Components of MIP.
Basic Operations of MIP.
Problems in MIP.
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.
Main Components of MIP
Basic Operation of MIP
Agent Advertisement messages.
Mobile Agent Discovery.
Registration.
Tunneling.
Binding Update.
Foreign Agent Smooth Handoffs.
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.
A Seamless Handoff Approach
Difference
Standard Mobile IP：
implement a binding cache.
Our Approach：
construct an MRT in each mobile agent.
(including HA, FA, and router)
Mobile Routing Table (MRT)
Example of MRT
The State Transition
MRT Registration/Update
(1/2)
MRT Registration/Update
(2/2)
The Proposed Handoff Scheme
Packet transmission CN→MN.
Packet transmission MN→CN.
Inter-network handoff.
CN→MN
(1/2)
CN→MN (2/2)
MN→CN
MN Inter-Network Handoff
Packet Retransmission Mechanism
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.
Comparison
(2/2)
 T：Traffic between MN and CN.
 N：The numbers of MNs that move from HA to
FA.
Simulation and Results
(1/4)
Simulations and Results
(2/4)
Simulations and Results
(3/4)
Simulations and Results
(4/4)
Conclusion
Based on MRT scheme, it can：
。avoid the triangular routing problem.
。a packet retransmission scheme to
reduce packet loss during handoff.