Modeling and efficient handling of handoffs in integrated wireless mobile networks

In this paper, we propose and analyze two handoff schemes without and with preemptive priority procedures for integrated wireless mobile networks. We categorize the service calls,into four different types, namely, originating voice calls, originating data calls, voice handoff request calls, and data handoff request calls and we assume two separate queues,for two handoff services. A number of channels in each cell are reserved exclusively for handoff request calls. Out of these channels, few are reserved exclusively for voice handoff request calls. The remaining channels are shared by-both originating and handoff request calls. In preemptive Priority scheme, higher priority is given to voice handoff request calls over data handoff request calls and can preempt data service to the queue if, upon arrival, a voice handoff request finds no free channels. We model the system by a three-dimensional Markov chain and compute the system performance in terms of blocking probability,of originating calls, forced termination probability of voice handoff request calls, and average transmission delay of data calls. It is observed that forced termination probability of voice handoff request calls can be decreased by increasing the number of reserved channels. On the other hand, as a,data handoff request can be transferred from a queue of one base station to another, there is no packet loss of data handoff except for a negligibly small blocking probability.