ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 30, Issue 1, 15 December 2006, Pages 41-51
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (294 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2006.07.007    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Dynamic radio resource allocation for 3G and beyond mobile wireless networks

Salman A. AlQahtaniCorresponding Author Contact Information, a, E-mail The Corresponding Author and Ashraf S. Mahmouda, E-mail The Corresponding Author

aComputer Engineering Department, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia

Received 17 April 2006; 
revised 13 July 2006; 
accepted 14 July 2006. 
Available online 10 August 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). Resource allocation and call admission control (CAC) are key management functions in future 3G and 4G cellular networks, in order to provide multimedia applications to mobile users with QoS guarantees and efficient resource utilization. There are two main strategies for radio resource allocations in cellular wireless networks known as complete partitioning (CP) and complete sharing (CS). In this paper, theses strategies are extended for operation in 3G and beyond network. First, two CS-based call admission controls, referred to herein as queuing priority call admission control (QP-CAC) and hybrid priority call admission control (HP-CAC), and one CP-based call admission control referred to as complete partitioning call admission control (CP-CAC) are presented. Then, this study proposes a novel dynamic procedure, referred to as the dynamic prioritized uplink call admission control (DP-CAC) designed to overcome the shortcomings of CS and CP-based CACs. Results indicate the superiority of DP-CAC as it is able to achieve a better balance between system utilization, revenue, and quality of service provisioning. CS-based algorithms achieve the best system utilization and revenue at the expense of serious unfairness for the traffic classes with diverse QoS requirements. DP-CAC manages to attain equal system utilization and revenue to CS-based algorithms without the drawbacks in terms of fairness and service differentiation.

Keywords: Wireless networks; Dynamic resource allocation; QoS; Queueing

Article Outline

1. Introduction
2. System model
3. CAC schemes
3.1. HP-CAC and QP-CAC schemes
3.2. CP-CAC scheme
3.3. DP-CAC scheme
4. Traffic model and performance measures
4.1. Traffic model
4.2. System performance measures
5. Simulation results
5.1. Simulation description and parameters
5.2. Results and discussions
6. Conclusion
Acknowledgements
References
Vitae











Computer Communications
Volume 30, Issue 1, 15 December 2006, Pages 41-51
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.