NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Predictive Handover Mechanism based on Required Time Estimation in Heterogeneous Wireless Networks
Published
Author(s)
Sang J. Yoo, David E. Cypher, Nada T. Golmie
Abstract
In most conventional layer 2 triggering approaches, a pre-defined threshold for a specific perspective such as the received signal strength is used. This may cause too late or too early handover executions. In this paper we propose a new predictive handover framework that uses the neighbor network information to generate timely the link triggers so that the required handover procedures can appropriately finish before the current link goes down. First we estimate a required handover time for the given neighbor network conditions, then using a predictive link triggering mechanism the handover start time is dynamically determined to minimize handover costs. The handover costs are analyzed in terms of the total required handover time and the service disruption time. The numerical analysis and simulation results show that the proposed method significantly enhances the handover performance.
Yoo, S.
, Cypher, D.
and Golmie, N.
(2008),
Predictive Handover Mechanism based on Required Time Estimation in Heterogeneous Wireless Networks, Military Communications Conference 2008, San Diego, CA, US, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51262
(Accessed October 14, 2025)