Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems

PDF Version Also Available for Download.

Description

Article on a mobility-based CAC algorithm for arbitrary call-arrival rates in CDMA cellular systems.

Physical Description

13 p.

Creation Information

Akl, Robert G.; Hegde, Manju V. & Naraghi-Pour, Mort March 2005.

Context

This article is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 146 times . More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

Publisher

Rights Holders

For guidance see Citations, Rights, Re-Use.

  • Unknown

Provided By

UNT College of Engineering

The UNT College of Engineering promotes intellectual and scholarly pursuits in the areas of computer science and engineering, preparing innovative leaders in a variety of disciplines. The UNT College of Engineering encourages faculty and students to pursue interdisciplinary research among numerous subjects of study including databases, numerical analysis, game programming, and computer systems architecture.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

Article on a mobility-based CAC algorithm for arbitrary call-arrival rates in CDMA cellular systems.

Physical Description

13 p.

Notes

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 prescribed 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 their 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.

Source

  • IEEE Transactions on Vehicular Technology, 2005. New York: Institute of Electrical and Electronics Engineers, pp.639-651

Language

Item Type

Publication Information

  • Publication Title: Institute of Electrical and Electronics Engineers (IEEE) Transactions on Vehicular Technology
  • Volume: 54
  • Issue: 2
  • Page Start: 639
  • Page End: 651
  • Pages: 13
  • Peer Reviewed: Yes

Collections

This article is part of the following collection of related materials.

UNT Scholarly Works

The Scholarly Works Collection is home to materials from the University of North Texas community's research, creative, and scholarly activities and serves as UNT's Open Access Repository. It brings together articles, papers, artwork, music, research data, reports, presentations, and other scholarly and creative products representing the expertise in our university community.** Access to some items in this collection may be restricted.**

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • March 2005

Added to The UNT Digital Library

  • Jan. 24, 2011, 2:10 p.m.

Description Last Updated

  • May 16, 2014, 10:55 a.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 146

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Akl, Robert G.; Hegde, Manju V. & Naraghi-Pour, Mort. Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems, article, March 2005; [New York, New York]. (digital.library.unt.edu/ark:/67531/metadc30821/: accessed February 22, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.