Constructing conflict graph for D2D communications in cellular systems

This paper presents a new method for constructing a conflict graph for D2D communications in cellular systems, which is useful for efficient radio resource allocation for D2D links. The construction is an iterative process which includes a broadcast-and-acknowledgment protocol. The convergence and delay performance of the proposed constructing process is theoretically analyzed. Simulation results demonstrate that our method have good performance in constructing the conflict graph and the result of theoretical analysis matches well with the simulation results.