Research On Resource Allocation And Interference Suppression Scheme For D2D Communication In H-CRAN Networks

Recently,heterogeneous cloud radio access network(H-CRAN)and Device to Device(D2D)have drawn much attention.H-CRAN,as a integration of heterogeneous network and cloud wireless access network,not only inherits their advantages,but also overcomes their shortcomings,to a certain degree.D2D communication technology allows neighboring user equipments to communicate directly without having to go through the base station's forwarding.With the distance gain,hop gain,and multiplexing gain,D2D communication greatly increases the energy efficiency and spectral efficiency.However,when D2D communication reuses spectrum resources of the H-CRAN network,there will be serious interferences between D2D users and existing users in the H-CRAN.If these interferences are not effectively suppressed,the system performance will be seriously affected.The current researches on D2D communication resource allocation and interference suppression mainly focus on cellular networks without heterogeneous access point deployment.Therefore,the current resource allocation and interference suppression schemes do not work well for heterogeneous networks such as H-CRAN networks.In order to solve the above problems,this paper focuses on the resource allocation and interference suppression in H-CRAN networks that integrate D2D communication.This paper is supported by the National Natural Science Foundation of China "Research on Contract Theory Based Coordinated Resource Allocation for Heterogeneous Cloud Radio Access Networks" under grant 61501041.In this paper,the system model of D2D communication multiplexing H-CRAN uplink spectrum resources is established firstly.Based on the interference analysis,the sub-channels are initially screened and the resource allocation problem is modeled as a mixed integer non-linear programming problem.In order to solve this NP-Hard problem and obtain the association between D2D users and sub-channels,in this paper,we propose the throughput aware maximum association algorithm and the channel condition aware maximum association algorithm,respectively.In the scenario of D2D communication reusing H-CRAN downlink resources,this paper decomposes the entire resource allocation problem into two cascaded sub-problems based on the matching theory and the coalition game theory,that is,the external user and sub-channel matching problem and the coalition formation problem with user transfer.In order to solve these two problems,this paper presents a constrained delay acceptance algorithm and a coalition formation algorithm.The stability and the convergence of algorithm are proved,respectively.Through a large number of simulation experiments,we confirm that the proposed resource allocation algorithm can significantly improve system performance.