Joint rate allocation and routing scheme in multihop cellular CDMA networks

In this paper, using the concept of capacity regions, an algorithm for joint rate allocation and routing scheme is proposed in order to maximize the total throughput of multihop cellular CDMA networks. The notion of infeasibility factor is defined and used to propose an adaptive scheme on top of the above algorithm to manage fundamental coverage-capacity tradeoff for the downlink. In fact, the output of our algorithm is the joint rate allocation, routing scheme and base station (relay) assignment which in conjunction with the proposed adaptive scheme leads to implementing the concept of cell breathing via allocating proper transmit powers to base stations and relays. We show that our optimization problem can be mapped to a multidimensional multichoice knapsack problem (MMKP). Since MMKP is NP-hard, a polynomial-time heuristic algorithm is then developed to solve our MMKP.