Home > Research > Publications & Outputs > Joint pilot power adjustment and base station a...
View graph of relations

Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks. / Shabany, Mahdi; Navaie, Keivan.
Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on. New York: IEEE, 2004. p. 179-183.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Shabany, M & Navaie, K 2004, Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks. in Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on. IEEE, New York, pp. 179-183, IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication, United Kingdom, 26/04/04. https://doi.org/10.1109/SARNOF.2004.1302870

APA

Shabany, M., & Navaie, K. (2004). Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks. In Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on (pp. 179-183). IEEE. https://doi.org/10.1109/SARNOF.2004.1302870

Vancouver

Shabany M, Navaie K. Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks. In Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on. New York: IEEE. 2004. p. 179-183 doi: 10.1109/SARNOF.2004.1302870

Author

Shabany, Mahdi ; Navaie, Keivan. / Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks. Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on. New York : IEEE, 2004. pp. 179-183

Bibtex

@inproceedings{26a82c6105e04b568c7b65bd99033575,
title = "Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks",
abstract = "A novel framework to model the problem of downlink resource allocation in heterogeneous CDMA cellular networks is presented which leads to utilizing the network resources in more efficient way. First, to manage fundamental coverage-capacity tradeoff for the downlink, we propose the notion of effective area to develop a Base Station (BS) Pilot Power Adjustment (PPA) scheme. Using effective area, PPA periodically adjusts BS pilot power based on both traffic load and coverage area. After adjusting the pilot powers, we use the dynamic pricing platform to formulate downlink resource allocation based on a novel defined utility function. This utility function quantifies the degree of utilization of resources. As a matter of fact, using the defined utility function, we track users' channel fluctuations and their delay constraints along with the load conditions of all BSs. Unlike previous work, we solve the problem with the general objective of maximizing the total network utility instead of achieved utility of each BS. It is shown that this problem is equivalent to finding the optimum BS assignment throughout the network which is mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP). Since MMKP is NP-Hard, a polynomial-time suboptimal algorithm is then modified to develop an efficient base station assignment.",
keywords = "utility function, knapsack problem",
author = "Mahdi Shabany and Keivan Navaie",
year = "2004",
doi = "10.1109/SARNOF.2004.1302870",
language = "English",
isbn = "0780382196",
pages = "179--183",
booktitle = "Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on",
publisher = "IEEE",
note = "IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication ; Conference date: 26-04-2004 Through 27-04-2004",

}

RIS

TY - GEN

T1 - Joint pilot power adjustment and base station assignment for data traffic in cellular CDMA networks

AU - Shabany, Mahdi

AU - Navaie, Keivan

PY - 2004

Y1 - 2004

N2 - A novel framework to model the problem of downlink resource allocation in heterogeneous CDMA cellular networks is presented which leads to utilizing the network resources in more efficient way. First, to manage fundamental coverage-capacity tradeoff for the downlink, we propose the notion of effective area to develop a Base Station (BS) Pilot Power Adjustment (PPA) scheme. Using effective area, PPA periodically adjusts BS pilot power based on both traffic load and coverage area. After adjusting the pilot powers, we use the dynamic pricing platform to formulate downlink resource allocation based on a novel defined utility function. This utility function quantifies the degree of utilization of resources. As a matter of fact, using the defined utility function, we track users' channel fluctuations and their delay constraints along with the load conditions of all BSs. Unlike previous work, we solve the problem with the general objective of maximizing the total network utility instead of achieved utility of each BS. It is shown that this problem is equivalent to finding the optimum BS assignment throughout the network which is mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP). Since MMKP is NP-Hard, a polynomial-time suboptimal algorithm is then modified to develop an efficient base station assignment.

AB - A novel framework to model the problem of downlink resource allocation in heterogeneous CDMA cellular networks is presented which leads to utilizing the network resources in more efficient way. First, to manage fundamental coverage-capacity tradeoff for the downlink, we propose the notion of effective area to develop a Base Station (BS) Pilot Power Adjustment (PPA) scheme. Using effective area, PPA periodically adjusts BS pilot power based on both traffic load and coverage area. After adjusting the pilot powers, we use the dynamic pricing platform to formulate downlink resource allocation based on a novel defined utility function. This utility function quantifies the degree of utilization of resources. As a matter of fact, using the defined utility function, we track users' channel fluctuations and their delay constraints along with the load conditions of all BSs. Unlike previous work, we solve the problem with the general objective of maximizing the total network utility instead of achieved utility of each BS. It is shown that this problem is equivalent to finding the optimum BS assignment throughout the network which is mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP). Since MMKP is NP-Hard, a polynomial-time suboptimal algorithm is then modified to develop an efficient base station assignment.

KW - utility function

KW - knapsack problem

U2 - 10.1109/SARNOF.2004.1302870

DO - 10.1109/SARNOF.2004.1302870

M3 - Conference contribution/Paper

SN - 0780382196

SP - 179

EP - 183

BT - Advances in Wired and Wireless Communication, 2004 IEEE/Sarnoff Symposium on

PB - IEEE

CY - New York

T2 - IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

Y2 - 26 April 2004 through 27 April 2004

ER -