Study on an efficient and fair scheduling Strategy for multi-user MIMO systems

Abstract

Multiple Input Multiple Output (MIMO) is one of the most promising techniques in communication network that uses multiple antennas at the transmitter and receiver to improve transmission reliability and to provide high data rates. Nowadays, extended MIMO systems, called like multi-user MIMO, are more preferable research areas than single user MIMO systems. The objective of the MIMO systems can be divided into two categories: throughput maximization and fair resource assignment. Greedy scheduling is one of the most popular scheduling techniques that provide maximum system throughput by use of multi-user diversity. This scheduling technique makes user in the best channel conditions takes all resources that could improve system throughput but cause the unfairness problem. On the contrast, round robin scheduling is a representative method of strictly fair scheduling that allocates the resources to users with cyclic fashion regardless of the channel conditions. In this paper, we propose an efficient and fair scheduling strategy for multi-user MIMO systems that find advantageous trade off solution between throughput maximization and user’s fairness. Specifically, we suggest P-SPS (Pseudo-SNR Penalty Scheduling) algorithm that could find a solution to satisfy the system requirement by flexibly controlling fairness adjust factor α.