Device-to-Device Resource Allocation for QoS Support Using a Graphic Theory

This paper presents a new resource allocation scheme for orthogonal frequency division multiple access (OFDMA) Device-to-Device (D2D) networks. A two-phase scheme is proposed to maximize the throughput of D2D networks as well as guaranteeing the reliability of D2D communication. In the first phase, an interference management scheme is proposed based on clustering to guarantee the outage probability of D2D communications is less than a target value. The problem of interference management is mapped to the MAX k-CUT problem in graph theory and is solved by a cluster-based heuristic algorithm. In particular, the maximum cluster size is derived on the basic of the outage probability by using the Poisson Point Process (PPP) to model the distribution of D2D pairs. In the second phase, a fine-scale channel assignment is accomplished to maximize the throughput of D2D networks. Heuristic algorithm is proposed to efficiently solve the above problem. Simulations demonstrate the superior performance of the proposed solution compared with those of the existing schemes.