IEEE 802.16 broadband wireless access standard specifies four types of services to satisfy the quality of service (QoS) requirements of multimedia applications. How to design a scheduling algorithm is an open issue. Manufacturers can implement their own efficient scheduling algorithm depending on their requirement. There are a lot of scheduling algorithms that have been proposed. No matter these scheduling algorithms propose a hierarchical structure with strict priority or one-level scheduling mechanism, which is based conceptually on the round-robin approach, they do not consider an important factor: fair. The authors introduce a fair strategy algorithm for IEEE 802.16 broadband wireless access standard. The proposed algorithm applies a fair strategy to utilise the system bandwidth, achieve the QoS requirements of high-priority service flows and reduce starvations of low-priority service flows. The simulation studies show that the proposed scheduling algorithm provides a flexible way to utilise the system bandwidth.

Efficient resource allocation for requests is an important issue in the radio resource management. In the third generation mobile communication systems, Orthogonal Variable Spreading Factor (OVSF) codes are used for spreading codes. In this paper, we consider the OVSF code allocation problem for supporting real-time services in which the service time of a request can be obtained a priori. The impact of the remaining time factor on the OVSF code allocation in W-CDMA systems is investigated. Two time-based allocation schemes are proposed for code assignment and reassignment. This paper represents the first attempt on addressing the remaining time impact on the OVSF code allocation. Simulation results show that the time-based allocation schemes have better performance on reducing the blocking probability and the reassignment cost.