By Topic

Resource allocation in mobile cellular networks with QoS constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wong, T.C. ; Centre for Wireless Commun., Nat. Univ. of Singapore, Singapore ; Mark, J.W. ; Chua, K.C.

An approximate analytical formulation of the resource allocation problem for handling multiclass services in a cellular system is presented. Complete partitioning (CP) and complete sharing (CS) schemes with guard channels are used for the resource sharing policies at the call level. The CP model is solved explicitly using a one-dimensional Markov chain while the CS model is solved using a K-dimensional Markov chain. Call and packet level qualities of service (QoS) are considered. The performance of fast and slow mobile users and the effect of cell size are evaluated. The agreements between the analytical and simulation results for the CP and CS cases are good for low blocking probabilities. Numerical results illustrate that higher gain in system utilization is achieved through the joint optimization of call/packet levels.

Published in:

Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 IEEE  (Volume:2 )

Date of Conference:

Mar 2002