CDF-Based Scheduling Algorithm for Proportional Throughput Fairness

Title
CDF-Based Scheduling Algorithm for Proportional Throughput Fairness
Author
Hu Jin
Keywords
CDF-based scheduling; multiuser diversity; proportional fairness; throughput fairness
Issue Date
2016-05
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE COMMUNICATIONS LETTERS, v. 20, No. 5, Page. 1034-1037
Abstract
Cumulative distribution function (CDF)-based scheduling (CS) with resource-based fairness is well-known as an efficient algorithm that satisfies fair resource sharing among users while accommodating exploitation of multiuser diversity. In this letter, we extend CS to satisfy proportional throughput fairness. In particular, the proposed CS with proportional throughput fairness (CSPT) exploits the properties of CS to intelligently calculate the channel access ratio (CAR) for each user that satisfies proportional throughput fairness. Then, user selection is performed under CS with the obtained CARs. Moreover, the throughput upper-bound of schedulers satisfying proportional throughput fairness is analyzed and, through asymptotic analysis and simulations for various scenarios, we show that the performance of our proposed CSPT is close to this upper-bound.
URI
http://ieeexplore.ieee.org/abstract/document/7438783/http://hdl.handle.net/20.500.11754/54044
ISSN
1089-7798; 1558-2558
DOI
10.1109/LCOMM.2016.2544750
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > ELECTRICAL ENGINEERING(전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE