Dynamic scheduling with statistical delay guarantees and traffic dropping

Khoa T. Phan, Tho Le-Ngoc

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


This work studies the dynamic scheduling problems in wireless networks with delay-sensitive loss-tolerant users. The users' traffic satisfies some statistical delay constraints. Moreover, the traffic can be dropped but the dropping rates do not exceed some thresholds. We consider two scheduling scenarios. First, we study the problem to minimize the total transmission power while maintaining the minimum rates for the users. Then, we study the problem to maximize the minimum rate(s) of the users while constraining the maximum total power. We derive the optimal solutions for both scheduling problems. When the fading statistics are available, using the dual-gradient method, the optimal policies can be computed. When the fading statistics are unknown, this work proposes online scheduling algorithms using online time-averaging. The convergence and optimality of the proposed algorithm are guaranteed by the results in stochastic approximation theory.

Original languageEnglish
Title of host publication2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013 - Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages5
ISBN (Print)9781467363372
Publication statusPublished - 2013
Externally publishedYes
EventIEEE Vehicular Technology Conference 2013 (Spring) - Dresden, Germany
Duration: 2 Jun 20135 Jun 2013
Conference number: 77th
https://ieeexplore.ieee.org/xpl/conhome/6689711/proceeding (Proceedings)


ConferenceIEEE Vehicular Technology Conference 2013 (Spring)
Abbreviated titleVTC Spring 2013
Internet address


  • Dropping rate
  • Dynamic scheduling
  • Effective capacity
  • Quality of service (QoS)
  • Stochastic approximation

Cite this