Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints

Juan José Jaramillo, R. Srikant, Lei Ying

Research output: Contribution to journalArticlepeer-review

65 Scopus citations


This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline. Using optimization and stochastic network theory we study the problem of scheduling to meet quality of service (QoS) requirements under heterogeneous delay constraints and timevarying channel conditions. Our analysis results in an optimal scheduling algorithm which fairly allocates data rates to all flows while meeting long-term delay demands. We also prove that under a simplified scenario our solution translates into a greedy strategy that makes optimal decisions with low complexity.

Original languageEnglish (US)
Article number5753562
Pages (from-to)979-987
Number of pages9
JournalIEEE Journal on Selected Areas in Communications
Issue number5
StatePublished - May 2011
Externally publishedYes


  • Ad hoc networks
  • Quality of service
  • Real-time traffic
  • Scheduling
  • Wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints'. Together they form a unique fingerprint.

Cite this