Resource allocation in mobile cellular networks with QoS constraints

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.