Reverse link scheduling and data rate allocation scheme for CDMA2000 1xEV-DV: An alternative approach

CDMA2000 1xEV-DV is designed to meet the increasing demand for high-speed packet data transmission. The previous works on 1xEV-DV reverse link scheduling were based on trying to improve reverse link throughput, thereby mainly considering the users' interests. In this thesis, we consider the system from both the service providers' and subscribers' points of view and propose an alternative reverse link resource allocation procedure for non-time sensitive data traffic based on CDMA2000 Revision D. The goal is to maximize obtained revenue for service providers and minimize loss for subscribers subject to rise-over-thermal constraint. The method is quite flexible and offers service providers the choices of either maximizing obtained revenue or minimizing loss, or balancing both of them.; The system model is formulated into a Knapsack problem which can be solved by binary integer linear programming. Branch-and-Bound as a solution is discussed, but observed to be inefficient for this problem and instead two heuristic algorithms are proposed. All the three solutions are analyzed through illustrative experiments. The results of the analysis present a trade-off between the computational time for scheduling and maximum obtained revenue. The heuristic algorithms consume much shorter computational times and are therefore more appropriate for our time constrained scheduling and resource allocation scheme. Using the heuristic algorithms we are able to make recommendations to service providers on how to schedule the transmission selecting the objective balancing parameter according to their needs.