On the performance and complexity of a position-based scheduling algorithm for WCDMA networks

We proposed a method to control the downlink packet flow at the base stations of CDMA wireless networks where we maximize data throughput while ensuring fairness among users. In this work, we investigate important issues for realistic implementations. Firstly, we evaluate the network performance when cell subdivision is utilized for the purpose of complexity reduction. We obtain up to 50% reduction for a minimal loss in total throughput. Secondly, a modified algorithm is proposed to support multi-class users. The results show that priority for distant users requesting high data rates can be maintained with no significant decrease in throughput. The compromise between short-term fairness ensured by our algorithm and long-term fairness taking benefit of mobility is also studied and compared. Moreover, to be able to support high priority users even when they undergo bad channel conditions, we implement two transmit diversity schemes, an open-loop method and a closed-loop method. Simulations show that the closed-loop technique provides up to 29% gain in throughput.