Resource allocation for device-to-device communications based on graph-coloring

In device-to-device (D2D) systems, neighboring D2D pairs provide unavoidable interference when a same resource is allocated to multiple D2D pairs. And, this interference acts as a major bottleneck which significantly deteriorates the link quality and prevents from achieving the spatial reuse gain. Hence, in this paper, we introduce the graph-coloring theory and propose a resource allocation algorithm for D2D systems in order to properly avoid dominant interference from neighboring D2D pairs. Throughout simulations results, we show that the proposed scheme provides fairly good performance compared to the optimal resource allocation, while drastically reducing the computational complexity, and performance gain over conventional schemes with respect to sum rate of D2D pairs. Moreover, the results on the outage probability illustrate that the proposed scheme improves the link quality compared to that of conventional schemes.