Research On Network Planning And Deployment For Heterogeneous Network (HetNet) Based On Coordinated Multiple-Point Communications

With the rapid development of mobile Internet and intelligent terminals, wireless data traffic has soared, then presenting features of areal and uneven distribution. Coupled with the complexity of the urban environment, the radio access network faces the challenge of capacity pressure and depth of coverage holes. Traditional cellular mobile communication system has used the deployment of macro base stations, which occupy large areas, have a long deployment cycle and with high acquisition cost. Thus we can not soly rely on methods of planning and optimizing macro base stations which often ignores the coverage quality of the hot zone and the edge region. Therefore, a new multi-dimensional network architecture, i.e a heterogeneous cellular network (HetNet) is proposed as the major solution to meet the growing demand of future data traffic and capacity of hot-spots and cell-edge zones.The lastest Coordinated Multi Point transmission (i.e. CoMP) technology can effectively improve the performance of cell-edge users and enhance spectral efficiency in the cell edge. This thesis focuses on the research Infrastructure Deployment and Planning (HIDP) problem by integrating CoMP technology into HetNet network infrastructure, The HIDP is considered as the most important issues of the HetNet architecture from the theoretical models to deployment in practice. The main contributions of this thesis include:first, an HIDP mathematical problem formulation is proposed and a linear optimization solver Gurobi is adopted to validate and solve the HIDP formulation; second, facing the chanllenge of "curse of dimensionality" encountered in solving HIDP problems, we propose a new fast heuristic algorithm to solve the problem of HIDP and can obtain a near optimal solution much more efficiently, especially for the large-scale network deployments.In the simulations, we deploy and plan different network sizes and then validate the network models, by this, we show that both Gurobi and the new heuristic algorithm can solve the HIDP problem. After that, by comparing the two methods we can draw the conclusion that even though it can get the best results by deploying Gurobi, however, with the network size expanding, the solving time with Gurobi has an exponential growth. Whereas, the new heuristic algorithm can abtain a near optimal solution results more efficiently, especially for large-scale network deployment scenarios. Furthermore, simulation results show the benefits of the HetNet network deployment by considering the CoMP technology are the significant deployment cost reduction without changing the network architecture but achieving the same network coverage quality, compared to traditional without consideration of CoMP.