TY - JOUR
T1 - On generalized optimal scheduling of high data-rate bursts in CDMA systems
AU - Lau, Vincent K.N.
AU - Kwok, Yu Kwong
N1 - Funding Information:
Paper approved by L. Wei, the Editor for Wireless CDMA Systems of the IEEE Communications Society. Manuscript received January 25, 2001; revised September 24, 2001; December 13, 2001; and June 25, 2002. This work was supported in part by Committee on Research Conference Grants (CRCG) research initiation grants from the University of Hong Kong under Contract 10203010 and Contract 10203413, and in part by a grant from the Hong Kong Research Grants Council under Contract HKU 7024/00E. This paper was presented in part at the 2001 IEEE Vehicular Technology Conference, Atlantic City, NJ, October 2001.
PY - 2003/2
Y1 - 2003/2
N2 - In a code-division multiple access (CDMA)-based wireless communication system, forward link is power limited and reverse link is interference limited. With power control and statistical multiplexing, voice services can be supported reasonably well. However, for high data-rate services, a more comprehensive scheduling mechanism is needed in order to achieve a high capacity while satisfying the forward and reverse link constraints. In this paper, we formulate the high data-burst scheduling as a integer programming problem using a generic CDMA system model. We also suggest an optimal algorithm for generating scheduling solutions. With cdma2000 system details plugged in the proposed algorithm, it is found that our algorithm considerably outperforms several fast heuristics, including equal sharing, first-come-first-served, longest delay first, and shortest burst first.
AB - In a code-division multiple access (CDMA)-based wireless communication system, forward link is power limited and reverse link is interference limited. With power control and statistical multiplexing, voice services can be supported reasonably well. However, for high data-rate services, a more comprehensive scheduling mechanism is needed in order to achieve a high capacity while satisfying the forward and reverse link constraints. In this paper, we formulate the high data-burst scheduling as a integer programming problem using a generic CDMA system model. We also suggest an optimal algorithm for generating scheduling solutions. With cdma2000 system details plugged in the proposed algorithm, it is found that our algorithm considerably outperforms several fast heuristics, including equal sharing, first-come-first-served, longest delay first, and shortest burst first.
KW - Burst scheduling
KW - Code-division multiple access (CDMA)
KW - High data rate (HDR)
KW - Optimal algorithm
UR - http://www.scopus.com/inward/record.url?scp=0037308520&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2003.809258
DO - 10.1109/TCOMM.2003.809258
M3 - Article
AN - SCOPUS:0037308520
SN - 0090-6778
VL - 51
SP - 261
EP - 266
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 2
ER -