By Topic

Adaptive opportunistic fair scheduling in power-controlled code division multiple access systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. Li ; Marvell Semicond., Inc., Santa Clara, CA ; X. Wang

The authors treat the multiuser scheduling problem for practical power-controlled code division multiple access (CDMA) systems under the opportunistic fair scheduling (OFS) framework. OFS is an important technique in wireless networks to achieve fair and efficient resource allocation. Power control is an effective resource management technique in CDMA systems. Given a certain user subset, the optimal power control scheme can be derived. Then the multiuser scheduling problem refers to the optimal user subset selection at each scheduling interval to maximise certain metric subject to some specific physical-layer constraints. The authors propose discrete stochastic approximation algorithms to adaptively select the user subset to maximise the instantaneous total throughput or a general utility. Both uplink and downlink scenarios are considered. They also consider the time-varying channels where the algorithm can track the time-varying optimal user subset. Simulation results to show the performance of the proposed algorithms in terms of the throughput/ utility maximisation, the fairness, the fast convergence and the tracking capability in time-varying environments are presented.

Published in:

IET Communications  (Volume:2 ,  Issue: 4 )