A Packet Scheduling Algorithm for Wireless Service Capacity and Coverage Optimization

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.