A fairness resource allocation algorithm for coverage and capacity optimization in wireless self-organized network

To achieve the higher resource efficiency, Coverage and Capacity Optimization (CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network (SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness (PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness (CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin (RR), proportional fairness (PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.