Online QoS-based dynamic scheduling in multi-channel wireless networks

Khoa T. Phan, Tho Le-Ngoc

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)


This work studies the power optimal dynamic scheduling problem in multi-channel multi-user wireless access networks. Users have quality-of-service (QoS) requirements on the minimum rates with statistical delay guarantees. Only one user is allowed to transmit over a channel in a given time slot. This work considers two scenarios: homogeneous and heterogeneous users. For the former scenario, the optimal scheduling policy can be derived, and an online scheduling algorithm for the optimal policy is proposed using online time-averaging without requiring a-priori known fading statistics. For the latter scenario, the optimal scheduling problem is combinatorially hard; hence, even when the fading statistics are available, computing the optimal policy is intractable. Consequently, this work develops a sub-optimal online scheduling algorithm with linear complexity which does not require a-priori known fading statistics. Moreover, the scheduling algorithm satisfies the QoS constraints for the users. Illustrative results demonstrate the performance of the proposed scheduling algorithms in various settings.

Original languageEnglish
Title of host publication2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages5
ISBN (Print)9781467359399
Publication statusPublished - 2013
Externally publishedYes
EventIEEE Wireless Communications and Networking Conference 2013 - Shanghai International Convention Center, Shanghai, China
Duration: 7 Apr 201310 Apr 2013


ConferenceIEEE Wireless Communications and Networking Conference 2013
Abbreviated titleWCNC 2013
Internet address


  • effective capacity
  • Power optimal
  • quality of service (QoS)
  • scheduling
  • stochastic approximation

Cite this