Simulation of Throughput in UMTS Networks with Different Spreading Factors

PDF Version Also Available for Download.

Description

In this paper, the authors design and implement a local session admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for different spreading factors and various mobility scenarios.

Physical Description

5 p.

Creation Information

Akl, Robert G. & Arepally, Anurag September 2006.

Context

This paper 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 302 times . More information about this paper can be viewed below.

Who

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

Authors

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 paper. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

In this paper, the authors design and implement a local session admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for different spreading factors and various mobility scenarios.

Physical Description

5 p.

Notes

Abstract: We design and implement a local session admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for different spreading factors and various mobility scenarios. The design of the SAC algorithm uses global information; it incorporates the session arrival rates and the user mobilities across the network and guarantees the users' quality of service as well as pre-specified blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of sessions currently active in that cell. A global SAC algorithm is also implemented and used as a benchmark since it is inherently optimized and uses global information in making every session admission decision; it yields the best possible performance but has an intensive computational complexity. Using simulation, we determine the network throughput, and show that our optimized local SAC algorithm achieves almost the same performance as our global SAC algorithm at a fraction of the computational cost for pre-specified blocking probabilities and quality of service requirements and spreading factor values of 256, 64, 16, and 4.

Source

  • Sixty-Fourth Institute of Electrical and Electronics Engineers (IEEE) Vehicular Technology Conference, 2006, Montreal, Canada

Language

Item Type

Collections

This paper 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 paper?

When

Dates and time periods associated with this paper.

Creation Date

  • September 2006

Added to The UNT Digital Library

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

Description Last Updated

  • March 27, 2014, 1:17 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 3
Total Uses: 302

Interact With This Paper

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Akl, Robert G. & Arepally, Anurag. Simulation of Throughput in UMTS Networks with Different Spreading Factors, paper, September 2006; (digital.library.unt.edu/ark:/67531/metadc30832/: accessed February 28, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.