It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance improvement in comparison to existing heuristic algorithms for MMKP.
Navaie,K. (2008). Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm. The Modares Journal of Electrical Engineering, 8(1), 113-122.
MLA
Navaie,K. . "Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm", The Modares Journal of Electrical Engineering, 8, 1, 2008, 113-122.
HARVARD
Navaie,K. (2008). 'Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm', The Modares Journal of Electrical Engineering, 8(1), pp. 113-122.
CHICAGO
K. Navaie, "Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm," The Modares Journal of Electrical Engineering, 8 1 (2008): 113-122,
VANCOUVER
Navaie,K. Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm. The Modares Journal of Electrical Engineering, 2008; 8(1): 113-122.
The Modares Journal of Electrical Engineering