Home > Research > Publications & Outputs > A utility-based downlink radio resource allocat...
View graph of relations

A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article)

Research output: Contribution to journalJournal article

Published

Standard

A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article). / Shabany, Mahdi; Navaie, Keivan; Sousa, Elvino S.

In: EURASIP Journal on Wireless Communications and Networking, 2007.

Research output: Contribution to journalJournal article

Harvard

APA

Shabany, M., Navaie, K., & Sousa, E. S. (2007). A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article). EURASIP Journal on Wireless Communications and Networking, [76193]. https://doi.org/10.1155/2007/76193

Vancouver

Author

Shabany, Mahdi ; Navaie, Keivan ; Sousa, Elvino S. / A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article). In: EURASIP Journal on Wireless Communications and Networking. 2007.

Bibtex

@article{fcc1576e905f4e0cb84f33cf5820c2b5,
title = "A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article)",
abstract = "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 e. cient base-station assignment. Simulation results indicate a significant performance improvement in terms of achieved utility and packet drop ratio.Copyright (c) 2007.",
keywords = "POWER-CONTROL, KNAPSACK-PROBLEM, ALGORITHM",
author = "Mahdi Shabany and Keivan Navaie and Sousa, {Elvino S.}",
note = "{\textcopyright} 2007 Shabany et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Date of acceptance: 08/01/2007; 9th IEEE International Symposium on Computers Communications (ISCC 04) ; Conference date: 28-06-2004 Through 01-07-2004",
year = "2007",
doi = "10.1155/2007/76193",
language = "English",
journal = "EURASIP Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer International Publishing AG",

}

RIS

TY - JOUR

T1 - A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks (Research article)

AU - Shabany, Mahdi

AU - Navaie, Keivan

AU - Sousa, Elvino S.

N1 - © 2007 Shabany et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Date of acceptance: 08/01/2007

PY - 2007

Y1 - 2007

N2 - 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 e. cient base-station assignment. Simulation results indicate a significant performance improvement in terms of achieved utility and packet drop ratio.Copyright (c) 2007.

AB - 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 e. cient base-station assignment. Simulation results indicate a significant performance improvement in terms of achieved utility and packet drop ratio.Copyright (c) 2007.

KW - POWER-CONTROL

KW - KNAPSACK-PROBLEM

KW - ALGORITHM

U2 - 10.1155/2007/76193

DO - 10.1155/2007/76193

M3 - Journal article

JO - EURASIP Journal on Wireless Communications and Networking

JF - EURASIP Journal on Wireless Communications and Networking

SN - 1687-1472

M1 - 76193

T2 - 9th IEEE International Symposium on Computers Communications (ISCC 04)

Y2 - 28 June 2004 through 1 July 2004

ER -