2015
DOI: 10.1109/twc.2014.2368151
|View full text |Cite
|
Sign up to set email alerts
|

Pricing-Based Interference Coordination for D2D Communications in Cellular Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
84
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 129 publications
(84 citation statements)
references
References 23 publications
0
84
0
Order By: Relevance
“…Resource allocation in D2D communication is such an application. Here, we describe at first some classical approaches [7][8][9][10][11][12][13][14][15][16] followed by existing RL-based resource allocation algorithms [17,18].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Resource allocation in D2D communication is such an application. Here, we describe at first some classical approaches [7][8][9][10][11][12][13][14][15][16] followed by existing RL-based resource allocation algorithms [17,18].…”
Section: Related Workmentioning
confidence: 99%
“…Here, the channel assigned to the cellular users is reused by only one D2D pair and the cotier interference is not considered. In [16], Yin et al propose a distributed resource allocation method where minimum rates of cellular users and D2D pairs are maintained. A Game theoretic algorithm (GTA) is proposed for minimizing the interferences among D2D pairs.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, the proposed algorithms in the above can be adopted: At the first, the optimization framework in the dedicated mode can be used to allocate the reserved resource for the D2D pairs, then the micro-adjustment like one D2D pair sharing the same resource of a RCU can be solved by the optimization framework in the reusing mode. Note that in case of multiple D2D pairs sharing the same resource [31], the proposed algorithm in the reusing mode can also be adopted as the problem is still the D. C. form, and finally the optimal user matching can be obtained by the Hungarian algorithm as in [27].…”
Section: E Mode Switching For Multiple D2d Pairs and Rcusmentioning
confidence: 99%
“…Both the works of Yu et al and Jung et al [10,11] consider the joint mode selection and resource allocation problem that aims to improve the sum-rate and the power efficiency. While guaranteeing the quality of service (QoS) of both CUs and D2D pairs, a centralized spectrum allocation scheme has been designed to maximize the system throughput in [12]. In [13], a coalitional game approach is employed to solve the joint mode selection and D2D resource allocation.…”
Section: Introductionmentioning
confidence: 99%