Title
Resource allocation for device-to-device communications based on graph-coloring
Abstract
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.
Year
DOI
Venue
2015
10.1109/ISPACS.2015.7432814
2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)
Keywords
Field
DocType
device-to-device communication system,D2D communication system,spatial reuse gain,graph-coloring theory,resource allocation algorithm,interference avoidance,computational complexity reduction,outage probability,link quality improvement,cellular radio
Radio resource management,Bottleneck,Device to device,Reuse,Computer science,Resource allocation,Interference (wave propagation),Distributed computing,Graph coloring,Computational complexity theory
Conference
Citations 
PageRank 
References 
0
0.34
10
Authors
3
Name
Order
Citations
PageRank
Changhee Lee1152.97
Oh Sung-min26411.46
JaeSheung Shin3257.53