论文部分内容阅读
提出了随机化竞争调度算法.该算法属于协作调度算法的范畴,适用于对相邻中继蜂窝小区边缘的用户进行联合调度.以此算法为基础,提出了基于随机化竞争的中继蜂窝小区边缘协作调度策略.该策略通过在相邻小区边缘可能产生资源冲突的区域形成协作中继簇,并在协作中继簇覆盖的区域内应用随机化竞争调度算法,能够尽量避免相邻小区之间产生同频干扰,从而提升小区边缘的传输性能.仿真结果表明,所提出的协作调度策略有效地降低了相邻小区中继站对边缘用户的干扰,提升了小区边缘的吞吐量,并在一定程度上增强了小区中心和边缘区域之间的调度公平性.
A randomized competition scheduling algorithm is proposed.The algorithm belongs to the category of cooperative scheduling algorithm and is suitable for the joint scheduling of users in the edge of adjacent trunking cells.According to this algorithm, a trunking cell based on randomized competition Edge cooperation scheduling strategy.This strategy forms a cooperative relay cluster in the area where resource conflicts may occur on the edge of the adjacent cell and applies a randomized competition scheduling algorithm in the area covered by the cooperative relay cluster to avoid inter-cell interference Which leads to the increase of cell-to-cell transmission performance.The simulation results show that the proposed cooperative scheduling strategy can effectively reduce the interference of the adjacent cell relay station to the edge users and improve the cell edge throughput to a certain extent Increased scheduling fairness between cell centers and edge areas.