2010 IEEE Wireless Communication and Networking Conference 2010
DOI: 10.1109/wcnc.2010.5506415
|View full text |Cite
|
Sign up to set email alerts
|

Fairness-Aware Resource Allocation for the SISO Downlink over Frequency-Selective Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
34
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 15 publications
(34 citation statements)
references
References 22 publications
0
34
0
Order By: Relevance
“…For each topology, multicast groups are assigned a set of proportional constants {γg}gMathClass-rel=1G. It is assumed that these constants follow the probability mass function pγg MathClass-rel= {falsefalsearrayarraycenter 1 with probability 0.5 arraycenter 2 with probability 0.3 arraycenter 4 with probability 0.2 MathClass-punc. …”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…For each topology, multicast groups are assigned a set of proportional constants {γg}gMathClass-rel=1G. It is assumed that these constants follow the probability mass function pγg MathClass-rel= {falsefalsearrayarraycenter 1 with probability 0.5 arraycenter 2 with probability 0.3 arraycenter 4 with probability 0.2 MathClass-punc. …”
Section: Simulation Resultsmentioning
confidence: 99%
“…In addition, it has a similar complexity to and smaller than . Notice that if each chunk consists of one subcarrier, as in conventional OFDMA systems , complexity becomes larger because in the aforementioned complexities, L is replaced by N > L . Also, complexity becomes larger when the systems are unicast as in that case when G is replaced by K > G .…”
Section: Complexity Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…In , a proportional fairness constraint, which is determined by the system QoS guarantees, is employed. In , a joint subcarrier and power allocation algorithm is proposed with proportional fairness.…”
Section: Introductionmentioning
confidence: 99%
“…Because the resource allocation problem is an NP‐hard (Non deterministic Polynomial) optimization problem with nonlinear constraints , the optimal resource allocation is computationally complex for practical applications Hence, a lot of suboptimal methods are presented to reduce computational complexity . It is shown that the problem can be solved suboptimally by separating subcarrier allocation and power allocation which can obtain close to the capacity as the optimal algorithm does but with a lower computational complexity .…”
Section: Introductionmentioning
confidence: 99%