MIMO系统中自适应延时公平调度算法

Adaptive delay fairness scheduling algorithm in MIMO systems

为了提高MIMO系统的容量,提出了一种自适应公平调度算法,在每个调度时隙,根据用户的信道环境和分组数据长度选择具有最小延时的用户进行传输,并且动态更新用户的平均传输延时,根据更新的平均传输延时自适应选择被调度的用户,从而使得不同信道环境和不同数据长度具有不同延时的用户都能公平的获得传输机会.通过仿真,将轮询调度算法和最大信噪比调度算法与ADFS算法进行比较.仿真结果表明,三种算法中ADFS算法具有最小的系统平均延时,并且可以给每个用户提供公平的传输机会,并取得较大的系统容量.

In order to increase the system capacity of MIMO systems,adaptive delay fairness scheduling(ADFS) algorithm is proposed.In each scheduling time slot,the users who have minimum delay are selected according to channel conditions and the length of packet data of users while average transmission delay of each user is updated.In terms of updated average transmission delay the users are selected adaptively so that the users with different channel conditions and the length of packet data can obtain fair scheduling...