By Topic

Generic Scheduling Framework and Algorithm for Time-Varying Wireless Networks

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

5 Author(s)
Gengfa Fang ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing ; Yi Sun ; Jihua Zhou ; Jinglin Shi
more authors

In this paper, the problem of scheduling multiple users sharing a time varying wireless channel is studied, in networks such as in 3G CDMA and IEEE 802.16. We propose a new generic wireless packet scheduling framework (WPSF), which takes into account not only the quality of service (QoS) requirements but also the wireless resource consumed. The framework is generic in the sense that it can be used with different resource constraints and QoS requirements depending on the traffic flow types. Subsequently, based on this framework a minimum rate and channel aware (MRCA) scheduling algorithm is presented. MRCA attempts to greedily enhance wireless channel efficiency by making use of multi-user channel quality diversity, while providing acceptable QoS in term of users' minimum rate constraints. Simulation results show the desirable properties identified in the algorithm.

Published in:

Vehicular Technology Conference, 2006. VTC-2006 Fall. 2006 IEEE 64th

Date of Conference:

25-28 Sept. 2006