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.

Keywords: Base-Station Assignment, Cellular Networks, Heuristic Algorithms, Packet Scheduling.

Full-Text [PDF 170 kb]   (3305 Downloads)