CaltechAUTHORS
  A Caltech Library Service

Differentiated rate scheduling for the down-link of cellular systems

Dana, Amir F. and Sharif, Masoud and Vakili, Ali and Hassibi, Babak (2008) Differentiated rate scheduling for the down-link of cellular systems. IEEE Transactions on Communications, 56 (10). pp. 1683-1693. ISSN 0090-6778. doi:10.1109/TCOMM.2008.4641899. https://resolver.caltech.edu/CaltechAUTHORS:DANieeetc08

[img]
Preview
PDF - Published Version
See Usage Policy.

517kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:DANieeetc08

Abstract

We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must satisfy certain constraints on their ratios. When full channel state information (CSI) is available at the transmitter and receivers, the problem can be readily solved using dirty paper coding (DPC) and the application of convex optimization techniques on the dual problem which is the multiple access channel (MAC). Since in many practical application full CSI may not be feasible and computational complexity prohibitive when the number of users is large, we focus on other simple schemes that require very little CSI: time-division opportunistic (TO) beamforming where in different time slots (of different lengths) the transmitter performs opportunistic beamforming to the users requiring the same rate, and weighted opportunistic (WO) beamforming where the random beams are assigned to those users having the largest weighted SINR. For single antenna systems we also look at the capacity-achieving superposition coding (SC) scheme. In all cases, we determine explicit schedules to guarantee the rate constraints and show that, in the limit of large number of users, the throughput loss compared to the unconstrained throughput (sum-rate capacity) tends to zero. We further provide bounds on the rate of convergence of the sum-rates of these schemes to the sum-rate capacity. Finally, we provide simulation results of the performance of different scheduling schemes considered in the paper.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TCOMM.2008.4641899DOIArticle
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4641899PublisherArticle
Additional Information:© Copyright 2008 IEEE. Reprinted with permission. Paper approved by S.A. Jafar, the Editor for Wireless Communication Theory and CDMA of the IEEE Communications Society. Manuscript received September 12, 2006; revised May 15, 2007. This work was supported in part by the National Science Foundation under grant no. CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking. An early version of these results appeared in IEEE International Symposium on Information Theory, Adelaide, Australia, 2005.
Funders:
Funding AgencyGrant Number
NSFCCR-0133818
NSFCCR-0326554
David and Lucile Packard FoundationUNSPECIFIED
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Subject Keywords:access protocols; broadcast channels; cellular radio; channel capacity; scheduling; transmitters
Issue or Number:10
DOI:10.1109/TCOMM.2008.4641899
Record Number:CaltechAUTHORS:DANieeetc08
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:DANieeetc08
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:12423
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:25 Nov 2008 18:50
Last Modified:08 Nov 2021 22:28

Repository Staff Only: item control page