Ieee Infocom 2009 2009
DOI: 10.1109/infcom.2009.5062197
|View full text |Cite
|
Sign up to set email alerts
|

Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink

Abstract: Abstract-With the power consumption issue of mobile handset taken into account, Single-carrier FDMA (SC-FDMA) has been selected for 3GPP Long-Term Evolution (LTE) uplink multiple access scheme. Like in OFDMA downlink, it enables multiple users to be served simultaneously in uplink as well. However, its single carrier property requires that all the subcarriers allocated to a single user must be contiguous in frequency within each time slot. This contiguous allocation constraint limits the scheduling flexibility… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
153
0
9

Year Published

2010
2010
2016
2016

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 249 publications
(162 citation statements)
references
References 6 publications
0
153
0
9
Order By: Relevance
“…This has been done by maintaining the longterm user fairness and spectral efficiency of the network. In [32], the authors have studied PF frequency domain packet scheduling (FDPS) with contagious resource allocation constraint in SC-FDMA. A set of algorithms have been proposed to solve the adjacency constraint in SC-FDMA and to find the near-to-optimal scheme which best emulates the time domain PF criteria.…”
Section: Resource Allocationmentioning
confidence: 99%
“…This has been done by maintaining the longterm user fairness and spectral efficiency of the network. In [32], the authors have studied PF frequency domain packet scheduling (FDPS) with contagious resource allocation constraint in SC-FDMA. A set of algorithms have been proposed to solve the adjacency constraint in SC-FDMA and to find the near-to-optimal scheme which best emulates the time domain PF criteria.…”
Section: Resource Allocationmentioning
confidence: 99%
“…PROBLEM COMPLEXITY For SC-FDMA resource allocation, it is widely accepted that global optimality is not computationally tractable. Yet few investigations [18] have dealt with this aspect with formal proofs. Note that ILP formulations do not qualify as evidence of hardness, because most tractable combinatorial optimization problems (e.g., matching) can be modeled by ILP.…”
Section: System Model and Problem Definitionsmentioning
confidence: 99%
“…Proof: In [18], Lee et al provided an NP-hardness proof based on a polynomial-time reduction from Hamiltonian path to the problem of maximizing SC-FDMA utility, assuming that the rate of every user on each channel is given as an input parameter. Consider the special case of Max-Utility where…”
Section: System Model and Problem Definitionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Several scheduling strategies have been proposed in the literature [23][24][25][26][27][28][29][30][31][32][33][34][35]. In Round Robin scheduling algorithm, the UEs are assigned the resources in round-robin fashion, without taking into account channel conditions.…”
Section: Introductionmentioning
confidence: 99%