Adaptive schemes for packet data in a ds-cdma environment

This paper presents a novel adaptive DS-CDMA slotted-ALOHA packet random access scheme for improving the throughput of the conventional DS-CDMA slotted-ALOHA system. For this purpose a mobile-assisted algorithm is envisaged to control the change of the transmission rate according to the traffic load. This algorithm revealed that the optimum behavior may be almost reached at a low complexity cost. Moreover, the proposed algorithm was found to be robust to intercell interferencePeer ReviewedPostprint (published version

On generalized optimal scheduling of high data-rate bursts in CDMA systems

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.published_or_final_versio