A throughput‐efficient and channel‐adaptive scheduling scheme in voice/data DS‐CDMA networks with transmission power constraints

Abstract

AbstractIn a practical voice/data CDMA network, the constraint of transmission powers makes it necessary to transmit multiple data users in parallel in order to fully utilize system resource (power). How to choose those data users that should be transmitted simultaneously and allocate appropriate powers among them remains an open issue. In this paper, we prove that it is optimal in the sense of maximum data throughput to select data users and allocate powers according to the descending order of their indexes of received power capability (IRPC). Here, IRPC is defined as the product of the transmission power upper bound and the channel gain. based on this principle, a channel‐adaptive scheduling scheme, partially descending IRPC (PDI) scheduling, is proposed to achieve efficient throughput performance for data traffic while maintaining certain fairness among different users. The efficiency and fairness of the PDI scheduling are verified by comparing with the conventional fair‐sharing scheme and round‐robin scheme through computer simulations. Numerical results also reveal the robustness of the new scheme to the channel estimation errors. Copyright © 2003 John Wiley & Sons, Ltd.