Generic scheduling framework and algorithm for time-varying wireless networks

Authors

Gengfa Fang, Chinese Academy of SciencesFollow
Yi Sun, Chinese Academy of SciencesFollow
Jihua Zhou, Chinese Academy of SciencesFollow
Jinglin Shi, Chinese Academy of Sciences
Eryk Dutkiewicz, University of WollongongFollow

RIS ID

17975

Publication Details

Fang, G., Sun, Y., Zhou, J., Shi, J. & Dutkiewicz, E. (2006). Generic scheduling framework and algorithm for time-varying wireless networks. IEEE Vehicular Technology Conference (pp. 1-5). USA: IEEE.

Abstract

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.