面向无线网络容量和覆盖优化的分组调度算法

A Packet Scheduling Algorithm for Wireless Service Capacity and Coverage Optimization

为了实现无线网络资源的高效利用,该文基于增强边缘用户调度公平性的目标提出一种通过b参数来调节覆盖和容量目标的比例公平(b-CCPF)分组调度算法,其可用于网络覆盖和容量优化(CCO)。该文首先证明该算法的收敛性,之后基于业务量分布、功率调整及该分组调度算法提出CCO机制,并在长期演进(LTE)网络下的一个试验的规则场景和一个基于实际网络数据的非规则场景中进行了仿真,验证了该机制能够在覆盖-容量优化机制下,实现更合理的资源利用率(RO),并同a比例公平(a-PF)算法相比在理论场景和实际场景下平均用户吞吐量分别提升了19%和33%。

In order to get the efficient resource utilization in wireless network this paper introduces a novel β- Coverage and Capacity Proportional Fairness （β -CCPF） scheduling algorithm for network Coverage and Capacity Optimization （CCO） on the basis of enhancing the fairness of edger users schedule priority. It firstly proves the theoretical convergence of this algorithm and then proposes a coverage-capacity optimization scheme on the basis of this algorithm, traffic distribution and power adjustment. This scheme is simulated in an experimental regular scenario and a real non-regular scenario respectively. The results Show that in the use case of CCO, the novel algorithm can ensure the reasonable Resource Occupation （RO） ratio and make the mean user throughput increased by 19% and 33% compared with the α-Proportional Fairness （α -PF） algorithm in the experimental and real scenario respectively.