An Efficient Adaptive Grouping for Single Code Assignment in WCDMA Mobile Networks

Abstract

For achieving high utilization and efficient code management of the OVSF code tree in 3G WCDMA networks, several researches have extensively studied. Based on combining both the code assignment and the reassignment mechanisms, it increases obviously high utilization and reduces completely the code blocking. Nevertheless, the required rate of traffic should be powers of two of the basic rate, i.e. 1R, 2R, 4R, ?, etc., which is impractical and results in wasting the system bandwidth while the required rate is not powers of two of the basic rate. Several multi-code assignment mechanisms have proposed to reduce the waste rate. Nevertheless, these methods bring two inevitable drawbacks including, high complexity of handling multiple codes, and increasing the cost of using more rake combiners at both the base stations and mobile nodes. Therefore, we propose an adaptive grouping code assignment herein to provide a single channelization code for any possible rate of traffic, even though the required rate is not powers of two of the basic rate. Based on the dynamic programming algorithm, the adaptive grouping approach forms several calls into a group. Then it allocates a subtree to the group and adaptively shares the subtree codes for these calls in the concept of time-sharing of slots during a group cycle time. Therefore, the waste rate and code blocking are thus reduced obviously while using a single rake combiner. Since the delay problem may be occurred in such a time-sharing approach, we propose two schemes of cycle interleaving methods to reduce delay. Numerical results indicate that the proposed adaptive grouping approach reduces significantly the waste rate and thus increases the system utilization. Moreover, the proposed cycle interleaving scheme reduces data delay significantly.