By Topic

Multiuser Scheduling in the 3GPP LTE Cellular Uplink

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Narayan Prasad ; NEC Labs. America, Princeton, NJ, USA ; Honghai Zhang ; Hao Zhu ; Sampath Rangarajan

In this paper, we consider resource allocation in the 3GPP Long Term Evolution (LTE) cellular uplink (UL), which will be the most widely deployed next generation cellular uplink. The key features of the 3GPP LTE uplink are that it is based on a modified form of the orthogonal frequency division multiplexing-based multiple access (OFDMA), which enables channel dependent frequency selective scheduling, and that it allows for multiuser (MU) scheduling wherein multiple users can be assigned the same time-frequency resource. In addition to the considerable spectral efficiency improvements that are possible by exploiting these two features, the LTE UL allows for transmit antenna selection together with the possibility to employ advanced receivers at the base-station, which promise further gains. However, several practical constraints that seek to maintain a low signaling overhead are also imposed. In this paper, we show that the resulting resource allocation problem is APX-hard and then propose a local ratio test (LRT)-based constant-factor polynomial-time approximation algorithm. We then propose two enhancements to this algorithm as well as a sequential LRT-based MU scheduling algorithm that offers a constant-factor approximation and is another useful choice in the complexity versus performance tradeoff. Further, user preselection, wherein a smaller pool of good users is preselected and a sophisticated scheduling algorithm is then employed on the selected pool, is also examined. We suggest several such user preselection algorithms, some of which are shown to offer constant-factor approximations to the preselection problem. Detailed evaluations reveal that the proposed algorithms and their enhancements offer significant gains.

Published in:

IEEE Transactions on Mobile Computing  (Volume:13 ,  Issue: 1 )