Mobility-based CAC algorithm for arbitrary call-arrival rates in CDMA cellular systems

• Published in: IEEE transactions on vehicular technology Vol. 54; no. 2; pp. 639 - 651
• Main Authors: Akl, R.G., Hegde, M.V., Naraghi-Pour, M.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.03.2005; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Access methods and protocols, osi model; Algorithm design and analysis; Algorithms; Applied sciences; Call-admission control (CAC) algorithm; Capacity planning; Cellular; Cellular networks; Code division multiple access; code-division multiple-access (CDMA); Control systems; Design engineering; Equipments and installations; Exact sciences and technology; implied costs; Intelligent networks; Interference; Mathematical analysis; Mobile radiocommunication systems; mobility; Multiaccess communication; Network topology; Networks; Quality of service; Radiocommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Throughput; Topology; Access control; Mobile radiocommunication; Wireless telecommunication; Mobility; Teletraffic; Modeling; Implied costs; Call-admission control (CAC) algorithm; code-division multiple-access (CDMA); Code division multiple access; Performance analysis; Cell system; Service quality
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2004.841559

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.