By Topic

Impact of multiple access on uplink scheduling

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
$31 $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

3 Author(s)
Rajan, D. ; Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA ; Sabharwal, A. ; Aazhang, B.

We consider uplink scheduling for bursty traffic. We characterize the achievable rate region for Gaussian multiple access in terms of minimum required powers, with a constraint on average transmission delay for all users. We show that delay and rate constrained, power minimizing schemes perform scheduling accompanied with power control. Further, for the class of randomized stationary schedulers, it is shown that the achievable region is a convex polytope. We highlight that power requirements of a user can be reduced by either allowing additional delay (time scheduling gain) or increasing the power of another user (multiuser power exchange). Results are presented for two user additive white Gaussian noise channel and can be extended to finite state fading channels

Published in:

Information Theory Workshop, 2001. Proceedings. 2001 IEEE

Date of Conference: