A Smooth Handoff Algorithm with Dynamic Scan Time Interval

Because of the virtue mobility, flexibility, and convenience, more and more wireless network are used in our everyday life. During the move between two scales of different AP (Access Point), the quality of the services heavily depends on the seamless handoff scheme which provide less packet lost. There are many people propose lots of strategies to reduce packet lost and do many contribution to it. In this paper, a dynamically adjusted buffer size algorithm and a predictable handoff tendency formula are used together. We use the two schemes to reduce packet lost. According to analysis the simulation result, we can conclude that the method we used in experiment reduce the packet lost when a MN (Mobile Node) move from one scale to another.