A Fair QoE-Aware MIMO Scheduling Scheme Based on Dynamic Latency Boundary for Non-Real-Time Service

Abstract

In Multiple-input Multiple-output (MIMO) system, the scheduling schemes for guaranteeing quality of service (QoS) set fixed delay boundaries for data packets of special service. However, the utility function of the quality of user experience (QoE) is usually a continuous function mapping service latency to Mean Opinion Score (MOS). Based on a QoS provisioning scheme, we propose a QoE-aware scheduling scheme with dynamic latency boundary. We also propose a weight function, which is a logarithmic function of the mean opinion score (MOS) level, to guarantee fairness. Numerical results indicate that the proposed scheme achieves higher performance from the view of user experience and fairness. This scheme can be deployed in commercial networks because of its low computational complexity.

Keywords

• Multiple-input/multiple-output (MIMO)
• quality-of-service (QoS)
• quality-of-experience (QoE)
• non-real-time service