Abstract | ||
---|---|---|
This paper develops an uplink transmission scheduling scheme, referred to as Ranking CDMA, which selects a subset of users for transmission at each time slot. We introduce long- and short-term metrics that characterize its performance, and devise analytical methods for evaluating these performance measures. It turns out that, although Ranking CDMA has excellent long-term power efficiency compared to traditional CDMA, it suffers from a lack of short-term fairness, which is quantified in our calculations. To alleviate this deficiency, we propose Adaptive Ranking CDMA and analytically show that it yields moderate power-efficiency improvement over traditional CDMA, while maintaining short-term fairness. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1109/TNET.2005.850210 | Networking, IEEE/ACM Transactions |
Keywords | Field | DocType |
code division multiple access,radio links,scheduling,CMDA,adaptive ranking,code division multiple access,power-efficiency improvement,uplink transmission scheduling scheme,CDMA,power allocation,transmission scheduling | Electrical efficiency,Ranking,Computer science,Scheduling (computing),Near-far problem,Computer network,CDMA spectral efficiency,Code division multiple access,Uplink transmission,Transmission scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
13 | 3 | 1063-6692 |
Citations | PageRank | References |
1 | 0.37 | 18 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pierre T. Kabamba | 1 | 90 | 62.98 |
Semyon M. Meerkov | 2 | 43 | 7.19 |
Choon Yik Tang | 3 | 85 | 12.90 |