Performance analysis of a dynamic handoff scheme in wireless networks with heterogeneous call arrival processes |
| |
Authors: | Lan Wang Geyong Min Demetres Kouvatsos |
| |
Affiliation: | 1.Department of Computing, School of Informatics,University of Bradford,Bradford,UK |
| |
Abstract: | The Guard Channel Scheme (GCS) and Handoff Queueing Scheme (HQS) are the popular and practical strategies to prioritize handoff
calls in wireless cellular networks. A key issue of giving handoff calls the higher priority is how to achieve a tradeoff
among the handoff call blocking probability, new call blocking probability and handoff delay. This paper extends GCS and HQS
and presents an efficient handoff scheme that dynamically manages the channels reserved for handoff calls depending on the
current status of the handoff queue. A three-dimensional Markov model is developed to analyze the performance of this scheme
and investigate the desirable performance tradeoff. The Poisson process and Markov-Modulated-Poisson-Process (MMPP) are used
to model the arrival processes of new and handoff calls, respectively. The accuracy of this model is evaluated through the
extensive comparison of the analytical results to those obtained from discrete-event simulation experiments. Performance measures
in terms of the mean number of calls in the system, aggregate response time, aggregate call blocking probability, handoff
call blocking probability, new call blocking probability and handoff delay are evaluated. The analytical model is used to
investigate the effects of the number of channels originally reserved for handoff calls, the number of dynamic channels, and
the ratio of the rate of handover calls to the aggregate arrival rate on the system performance. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|