Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 54, NO. 2, MARCH 2005 639 Mobility-Based CAC Algorithm for Arbitrary
 

Summary: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 54, NO. 2, MARCH 2005 639
Mobility-Based CAC Algorithm for Arbitrary
Call-Arrival Rates in CDMA Cellular Systems
Robert G. Akl, Member, IEEE, Manju V. Hegde, Member, IEEE, and Mort Naraghi-Pour, Member, IEEE
Abstract--This paper presents a novel approach for designing
a call-admission control (CAC) algorithm for code-division mul-
tiple-access (CDMA) networks with arbitrary call-arrival rates.
The design of the CAC algorithm uses global information; it in-
corporates 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 im-
plementation 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 signif-
icantly higher throughput than that achieved by traditional tech-
niques. We also calculate the network capacity, i.e., the maximum
throughput for the entire network, for prespecified blocking prob-
abilities and QoS requirements.
Index Terms--Call-admission control (CAC) algorithm, code-di-

  

Source: Akl, Robert - Department of Computer Science and Engineering, University of North Texas

 

Collections: Computer Technologies and Information Sciences