Region-based Call Admission Algorithms For Wireless
Kamal K. Kasera Ramesh K. Sitaraman
Department of Computer Science
University of Massachusetts at Amherst
Amherst, MA 01003, USA
Corresponding Author: Kamal K. Kasera
July 16, 1997
Current advances in the area of wireless cellular networks, and the advent of real time services have mandated the need for an efficient network call admission controller. In this paper, we develop region-based call admission algorithms that can deal with multiple classes of prioritized real time traffic. We consider QoS metrics which arise due to mobility considerations, such as handoff and preemption call dropping probabilities. We show, using both analysis and simulations, that our call admission algorithm maintains all the QoS guarantees of the mobile users, while ensuring a high level of network utilization. Further, our call admission algorithm is computationally simple and can be efficiently implemented in modern wireless cellular architectures. The conceptual framework of characterizing call admission algorithms using admissibility sets is likely to be useful in a number of other contexts.
Keywords: wireless networks, personal communication services, admission control.
?The research was supported in part by NSF Grant CCR-94-10077 and in part by an NSF CAREER award CCR-9703017.