Research On The Interference Control And Resource Allocation Technologies Of The Device-to-device Communication Underlying Cellular Networks

Device-to-device(D2D) communication, one of the most promising technique of the next generation of cellular networks, has been recently proposed to further mitigate the burden of base stations and also attracted much attention. One of the challenges in the implementation of D2 D communication is the interference between cellular and D2 D communication resulted by sharing the same spectrum resources. To well control the interference, a suitable spectrum resource allocation scheme is necessary and also becomes the research focus. There exists a limitation in traditional works which focus on the interference management and resource allocation for the inband underlay D2 D communication, they all assume that each subchannel can only be exlusively occupied by one cellular/D2 D link, or shared by at most one cellular link and one D2 D link. Those assumption has greatly restricted the D2 D access rate and also resulted in the underutilization of spectrum resources. Aiming at breaking the limitation mentioned above, this paper focus on proposing an efficient solution for the interference management and resource sharing for the inband underlay D2 D communication to make better use of the spectrum resources and achieve higher throughput and D2 D user access rate.This paper proposed a full resource sharing based resource allocation scheme FRESH to achieve better spectrum utilization by allowing each subchannel to be shared by a cellular link and an arbitrary number of D2 D links. In particular, FRESH first divides the communication links into resource sharing sets, such that, within each set communication links can fully share resources with each other. Then, the resource allocation problem which is based on FRESH and aiming at maximizing the system throughput, is formulated and further devided into two subproblems: the reuse set partitioning problem and the resource allocation problem. It is showed that both this two subproblems are NP-Hard and the first problem cannot be approximated in polynomial time. Next, for the reuse set partitioning problem, the concept of weak interference and the judging criteria for different modes are presented. And based on those theoretical foundations, an interference-awared reuse set partitioning algorithm with O(n3) time complexity is proposed. In the following, for the resource allocation based on the obtained set partitioning results, two efficient algorithms which are based on dynamic programming and with the time complexity O(n) are proposed according to the consideration of improving system throughput and D2 D access rate respectively.Extensive simulations validate that, as compared with state-of-the-art schemes(the user-oriented scheme [44] and the resource-oriented scheme [45]) and the baseline scheme, FRESH provides a finergrained resource allocation, resulting in significant improvements of throughput and D2 D access rate while without increasing the computation complexity.