Optimality of greedy power control and variable spreading gain in multi-class CDMA mobile networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
Simulation and Software Radio for Mobile Communications
Simulation and Software Radio for Mobile Communications
Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Downlink resource allocation for data traffic in heterogenous cellular CDMA networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Joint resource allocation and base-station assignment for the downlink in CDMA networks
IEEE/ACM Transactions on Networking (TON)
Pricing and power control in a multicell wireless data network
IEEE Journal on Selected Areas in Communications
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
EURASIP Journal on Wireless Communications and Networking
Hi-index | 0.00 |
A novel framework is proposed to model downlink resource allocation problem in multiservice direct-sequence code division multiple-access (DS-CDMA) cellular networks. This framework is based on a defined utility function, which leads to utilizing the network resources in a more efficient way. This utility function quantifies the degree of utilization of resources. As a matter of fact, using the defined utility function, users' channel fluctuations and their delay constraints along with the load conditions of all BSs are all taken into consideration. Unlike previous works, we solve the problem with the general objective of maximizing the total network utility instead of maximizing the achieved utility of each base station (BS). It is shown that this problem is equivalent to finding the optimum BS assignment throughout the network, which is mapped to a multidimensional multiple-choice knapsack problem (MMKP). Since MMKP is NP-hard, a polynomial-time suboptimal algorithm is then proposed to develop an efficient base-station assignment. Simulation results indicate a significant performance improvement in terms of achieved utility and packet drop ratio.