Joint Throughput Maximization and Fair Uplink Transmission Scheduling in CDMA Systems

<p/> <p>We study the fundamental problem of optimal transmission scheduling in a code-division multiple-access wireless system in order to maximize the uplink system throughput, while satisfying the users quality-of-service (QoS) requirements and maintaining fairness among them. The corr...

Full description

Bibliographic Details
Main Authors: Li Chengzhou, Papavassiliou Symeon
Format: Article
Language:English
Published: SpringerOpen 2009-01-01
Series:EURASIP Journal on Wireless Communications and Networking
Online Access:http://jwcn.eurasipjournals.com/content/2009/564692
Description
Summary:<p/> <p>We study the fundamental problem of optimal transmission scheduling in a code-division multiple-access wireless system in order to maximize the uplink system throughput, while satisfying the users quality-of-service (QoS) requirements and maintaining fairness among them. The corresponding problem is expressed as a weighted throughput maximization problem, under certain power and QoS constraints, where the weights are the control parameters reflecting the fairness constraints. With the introduction of the power index capacity, it is shown that this optimization problem can be converted into a binary knapsack problem, where all the corresponding constraints are replaced by the power index capacities at some certain system power index. A two-step approach is followed to obtain the optimal solution. First, a simple method is proposed to find the optimal set of users to receive service for a given fixed target system load, and then the optimal solution is obtained as a global search within a certain range. Furthermore, a stochastic approximation method is presented to effectively identify the required control parameters. The performance evaluation reveals the advantages of our proposed policy over other existing ones and confirms that it achieves very high throughput while maintains fairness among the users, under different channel conditions and requirements.</p>
ISSN:1687-1472
1687-1499