Conference Paper

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

Comput. Sci. Dept., UCLA, Los Angeles, CA
DOI: 10.1109/INFCOM.2009.5062197 Conference: INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil
Source: DBLP

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 sch eduling flexibility, and frequency-domain packet scheduling algor ithms in such system need to incorporate this constraint while trying to maximize their own scheduling objectives. In this paper we explore this fundamental problem of LTE SC-FDMA uplink scheduling by adopting the conventional time- domain Proportional Fair algorithm to maximize its objective (i.e. proportional fair criteria) in the frequency-domain setting. We show the NP-hardness of the frequency-domain scheduling problem under this contiguous allocation constraint and present a set of practical algorithms fine tuned to this problem. We demonstrate that competitive performance can be achieved in terms of system throughput as well as fairness perspective, which is evaluated using 3GPP LTE system model simulations.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the performance of three well-known algorithms namely Proportional Fairness, Exponential Proportional Fairness and Modified-Largest Weighted Delay First in LTE network. This study is based on their performance in three smart grid applications (Sub-Station Automation, Advance Metering Infrastructure and Wide Area Situational Awareness). In addition, a new mathematical model has been developed and proposed to target certain weakness of the above mentioned algorithms.
    Advanced Materials Research 01/2014; 666:340-345.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: he Long Term Evolution (LTE) standard plays an important role in the development of Machine-to-Machine (M2M) communication. However, the M2M communication has several different characteristics regarding to Human-to-Human (H2H) communication. Therefore, the shortage of radio resources, satisfaction of the Quality of Service (QoS) requirements and the reduction of the H2H traffic performance are important issues to be addressed when introducing the M2M communication in the network. In this article, we present a scheduler that may dynamically adjust to the level of congestion of the network based on the current traffic information of each device. The main goals of our approach are (i) satisfy the QoS requirements (ii) ensure fair allocation of resources and (iii) control the impact of H2H traffic performance. The simulation results demonstrated that the proposed scheduling has good performance according to the three objectives aforementioned.
    PIMRC 2014; 09/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the problem of resource allocation in SC-FDMA systems. A sum-utility maximization is considered where the utility of each user may be neither additive nor super additive. Unlike OFDMA, in addition to the restriction of allocating a subchannel to at most one user, the multiple subchannels allocated to a user in SC-FDMA must be consecutive. This makes the resource allocation problem prohibitively difficult and challenging. We provide a fundamental complexity analysis of the optimization problem for general non-additive utility functions and show that not only the problem is NP-hard but also approximating it within a factor better than $ {{2011}over {2012}}$ is not possible unless ${rm P}={rm NP}$. An efficient cutting plane algorithm is presented and five suboptimal heuristics are also presented that achieve near optimal solution in different scenarios. Computational results of the cutting plane and heuristic algorithms are reported and a comparison between these heuristics is provided as well.
    IEEE Transactions on Signal Processing 09/2014; 62(18):4896-4910. · 3.20 Impact Factor


Available from