Title :
Mobility-based CAC algorithm for arbitrary call-arrival rates in CDMA cellular systems
Author :
Akl, Robert G. ; Hegde, Manju V. ; Naraghi-Pour, Mort
Author_Institution :
Dept. of Comput. Sci. & Eng., North Texas Univ., Denton, TX, USA
fDate :
3/1/2005 12:00:00 AM
Abstract :
This paper presents a novel approach for designing a call-admission control (CAC) algorithm for code-division multiple-access (CDMA) networks with arbitrary call-arrival rates. The design of the CAC algorithm uses global information; it incorporates the call-arrival rates and the user mobilities across the network and guarantees the users´ quality of service (QoS) as well as prespecified blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of calls currently active in that cell. We present several cases for a nontrivial network topology where our CAC algorithm guarantees QoS and blocking probabilities while achieving significantly higher throughput than that achieved by traditional techniques. We also calculate the network capacity, i.e., the maximum throughput for the entire network, for prespecified blocking probabilities and QoS requirements.
Keywords :
cellular radio; code division multiple access; probability; quality of service; telecommunication congestion control; telecommunication network topology; CDMA cellular system; QoS; blocking probability; call-admission control algorithm; call-arrival rate; code-division multiple-access; mobility-based CAC algorithm; network topology; quality of service; Algorithm design and analysis; Capacity planning; Cellular networks; Control systems; Intelligent networks; Interference; Multiaccess communication; Network topology; Quality of service; Throughput; Call-admission control (CAC) algorithm; code-division multiple-access (CDMA); implied costs; mobility;
Journal_Title :
Vehicular Technology, IEEE Transactions on
DOI :
10.1109/TVT.2004.841559