Abstract
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. 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
