Interference Graph Construction for Cellular D2D Communications

This paper studies the interference graph construction for device-to-device (D2D) communications in cellular networks and proposes an interference graph construction protocol. The proposed interference graph construction protocol consists of two stages, i.e., announcement and collision resolution, which are performed in an iterative manner. The announcement announces the existence of each D2D link to its neighbor area by broadcasting
announce
messages. The collision-resolution stage resolves the collisions that could occur during the announce stage by broadcasting
response
messages. The theoretical analysis of the proposed construction protocol is presented, and the convergence of the protocol to an actual interference graph is studied. The theoretical analysis is validated by simulation results, and the performance of the proposed protocol is analyzed. It is shown that, for a number of D2D links up to as large as 1000 links, only two to seven iterations are needed to complete the interference graph construction procedure.