Bibliographic Details
| Title: |
Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems. |
| Authors: |
Akl, Robert G.1 rakl@cse.unt.edu, Hegde, Manju V.2, Naraghi-Pour, Mort3 |
| Source: |
IEEE Transactions on Vehicular Technology. Mar2005, Vol. 54 Issue 2, p639-651. 13p. |
| Subjects: |
Algorithms, Code division multiple access, Mobile communication systems, Quality control, Cell phone systems, Probability theory |
| 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 e call-arrival rates and the user mobilities across the network and guarantees the users' quality of service (QoS) as well as prespecific blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number f 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 so calculate the network capacity, i.e., the maximum throughput f r the entire network, for prespecified blocking probabilities and QoS requirements. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Vehicular Technology is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |