Efficient and low-complexity scheduling algorithm in a multi-user heterogeneous traffic scenario

In this paper, we propose a utility-based scheduling framework to maximize and improve the users' quality-of-service (QoS) satisfaction in broadband wireless access system. The scheduling framework comprises of three novel radio resource allocation (RRA) techniques; delay-based scheduling policy for real-time (RT) services using a sigmoid-like utility function, minimum-rate-based scheduling policy for non-real-time (NRT) services which obeys the law of diminishing marginal utility and a throughput-based scheduling policy for best-effort (BE), also based on the law of diminishing marginal utility but without a minimum rate requirement. The proposed algorithm, called maximum QoS satisfaction (MQS), is efficient and of low complexity as it specifies only a single parameter for different class of services. To prove its efficiency, we compare it with the delay-based satisfaction maximization and throughput-based satisfaction maximization (DSM/TSM), which exhibits similar characteristics in terms of resource allocation objectives. System-level simulation results demonstrate that the MQS achieves superior user call satisfaction performances in a multi-user heterogeneous traffic scenario.