Interference-Aware and Spectral-Efficient Resource Allocation Using Complete Graphs for the D2D Communication

Abstract

This paper proposes a heuristic resource block allocation using complete graphs (abbreviated to RACG) mechanism for device-to-device (D2D) communication. RACG not only can reduce the cochannel interference but also can improve the overall system capacity. For RACG, we define two pieces of user equipment in the D2D communication as one D2D pair and use the interference between each D2D pair to establish an interference graph model, which is then used to identify all complete graphs with different numbers of vertices. The innovation of RACG is right that it begins with resource block (RB) allocation for the D2D pairs in the complete graph with the largest number of vertices and considers three additional parameters to determine the allocation sequence for the D2D pairs. The three additional parameters are the frequency at which D2D pairs appear in complete graphs, the interference level of a D2D pair to other D2D pairs, and the number of RBs required. Furthermore, RACG prioritizes the reuse of allocated RB chunks during RB allocation. When a D2D pair and other D2D pairs with allocated RBs do not have mutual interference, the allocated RB chunk that has the closest number of RBs to the number of RBs required is selected and reused. We conduct performance analysis and compare the proposed RACG with a resource allocation of degree-based greedy (RADG) approach. The performance measures include the RB usage rate and occupied rate in a frame.