By Topic

Packet Scheduling Algorithms with Fairness Control for CDMA Reverse Link

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 $13
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

3 Author(s)
Jaehwi Shin ; Network Technol. Lab., Daejeon ; Youngnam Han ; Seokhun Kim

A larger amount of works has been reported for forward link CDMA scheduling compared to its reverse link case. In this paper, we propose generalized proportional fair (GPF) scheduling algorithms for uplink CDMA packet services, which have the ability to control the degree of fairness (DoF). We first establish a framework for GPF scheduling in wireless networks which render a GPF scheduling as a well-established optimization problem. For uplink CDMA, it is known that the rate sum maximization is achieved when the best K users in terms of channel condition transmit simultaneously. Based on this principle and the proposed GPF framework, we propose two GPF packet scheduling algorithms for uplink CDMA. Performance of our algorithms is verified through simulations.

Published in:

Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th

Date of Conference:

21-24 Sept. 2008