Design and Analysis of Handoff Schemes for Cellular Networks

Abstract

"In the cellular network, when a user having multiple calls (one ongoing call and one or more on-hold calls) is moving and is about to leave its serving cell, the network should automatically switch the coverage responsibility from the serving cell to a new cell. This process is known as handoff (also handover), if the user leaves its cell before succeeding the handoff, the user calls are all terminated. Multiple handoff requests arrive at a short period of time at a cell, where they are queued according to a rst come rst serve (FCFS) discipline whose problem is that it does not take into consideration the number of calls and the remaining time in the cell of the leaving user which may lead to high rate of terminated calls. In this thesis, two schemes are proposed, the Shortest Job First-Like Handoff Scheme (SJFLHS) and the Minimum Remaining Time with Largest Number of Calls (MRTLNC) to minimze the number of terminated calls. SJFLHS has a similar behavior to the shortest job rst (SJF) discipline, it queues the users requiring handoff, however, it gives the highest priority to the user that has the least remaining time in the cell instead of the user with minimum call holding time. MRTLNC adds to SJFLHS a feature that when multiple users have close values of remaining time, the user with the largest number of on-hold calls will be handed-off rst. The overhead of selecting the corresponding user is insigni cant in comparison to the improvements of these schemes. The results are shown here through extensive simulations."

Student(s)

Bilal Nabil Owaidat

Supervisor(s)

Dr. Hamza Issa, Dr. Rola Kassem