Radio Resource Management For The Small Cell Heterogeneous Network

With the rapid development of mobile Internet and the rapid growth of the number of intelligent terminal devices,mobile data services are showing explosive growth momentum.In response to this demand,the concept of Small Cell Network(SCN)was formally proposed by 3GPP Generation Partnership Project(3GPP)in 2012.In future,SCN will be a heterogeneous hybrid network scenarios with the typical characteristics of high coverage,high density.By then,traditional macro cell will be mainly responsible for the basic network coverage and part of the data business,and small cell is mainly used to respond to higher network throughput requirements,and share the macro cell data business.With the characteristics of high density deployment of small cell heterogeneous network architecture architecture,there are some new challenge in inter-cell interference,load,energy efficiency.So the User Equipement(UE)experiences of large number of business are limited.In this thesis,the load balancing technology of the small cell heterogeneous network scenario is studied.First of all,this thesis presents a hybrid load balancing scheme in the scenario of heterogeneous small cell network based on improved Cournot game model theory.This thesis model the heterogeneous small cell network as an improved Cournot game model.The pricing function reflects the interference a cell suffer from other cells.Then,this thesis analyzes the existence and uniqueness of Nash equilibrium in the game model,and solve the Nash equilibrium solution.The proposed hybrid load balancing scheme combines the mobile load balancing and cell zooming,which makes the game model proposed in this thesis to achieve the theoretical optimal value.Simulation results show that the proposed hybrid load balancing algorithm can improve the system throughput,cell edge throughput and reduce the system blocking probability.Secondly,after achieving the hybrid load balancing scheme based on non-cooperative game,the load factor of each cell in the load balancing can be determined to improve the network throughput.However,the scheme does not analyze each user should handover to which cell.In view of the above situation,this thesis proposes a dynamic load balancing scheme based on the bipartite graph matching.This thesis will analyze and model the twice load balancing problem,and the objective is to maximize the system throughput.In the case of each cell load has been fixed,then allocate each user to one cell.In the end,the load balancing scheme is compared with the existing technical scheme.Simulation results show that the proposed load balancing scheme has better ferformance in improving the system throughput and reducing the blocking probability.Finally,the content of the research is summarized,and the future research direction is prospected.