2011 IEEE Vehicular Technology Conference (VTC Fall) 2011
DOI: 10.1109/vetecf.2011.6092837
|View full text |Cite
|
Sign up to set email alerts
|

Joint Scheduling and Power Control in Coordinated Multi-Point Clusters

Abstract: Abstract-In this paper, we address the problem of designing a joint scheduling and power control algorithm in a downlink coordinated multi-point (CoMP) cluster supporting CoMP joint transmission. The objective is to maximize the cell-edge throughput under per-point power constraints. By an analytical derivation, binary power control is proved to be the optimal solution for any given selected user group. Utilizing this analytical result, a centralized and a semi-distributed version of joint user selection and p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
35
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 25 publications
(35 citation statements)
references
References 11 publications
0
35
0
Order By: Relevance
“…The problem of this approach is the difficulty of grouping users sharing the same subcluster, which results in a small penetration rate, as it has been pointed out in [49]. This effect is avoided by using the definition of the cooperation area as proposed in this paper, which, in contrast to [46], also takes into account the randomness of the channel. Note that when more than one cluster are considered, advanced solutions such as the proposed in [1] will be needed to deal with the intercluster interference.…”
Section: Definition Of the Cooperation Area Based On The Maximum Delamentioning
confidence: 99%
See 1 more Smart Citation
“…The problem of this approach is the difficulty of grouping users sharing the same subcluster, which results in a small penetration rate, as it has been pointed out in [49]. This effect is avoided by using the definition of the cooperation area as proposed in this paper, which, in contrast to [46], also takes into account the randomness of the channel. Note that when more than one cluster are considered, advanced solutions such as the proposed in [1] will be needed to deal with the intercluster interference.…”
Section: Definition Of the Cooperation Area Based On The Maximum Delamentioning
confidence: 99%
“…Other cooperation area definitions can be found for example in [46], where a pathloss-based cooperation area is proposed. Opposite to network-centric, we find the user-centric clustering or subclustering techniques, as for example in [38,47,48].…”
Section: Definition Of the Cooperation Area Based On The Maximum Delamentioning
confidence: 99%
“…Thus, a utility-based centralized joint resource allocation algorithm is proposed in this section for the OFDMA CoMP system. In order to further reduce the computational complexity, inspired by the GUS [12,13] based scheme, a low-complexity distributed algorithm is also proposed for practical implementation.…”
Section: Algorithm Descriptionmentioning
confidence: 99%
“…A centralized joint resource allocation algorithm is proposed by decoupling the optimization problem into per-subchannel sum utility maximizing problems. For practical implementation, a low-complexity distributed algorithm is also proposed based on the idea of greedy user selection (GUS) [12,13].…”
Section: Introductionmentioning
confidence: 99%
“…Previous studies about resource allocation in network MIMO OFDMA systems have mainly focused on the global network MIMO case [18][19][20], or on the single cluster case without considering inter-cluster interference [21][22][23]. Recently, research has shifted towards the limited coordination case with different cluster formation models, that is, resource allocation with dynamic clustering [24,25] or resource allocation with static clustering [14].…”
Section: Introductionmentioning
confidence: 99%