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

Juan José Jaramillo, R. Srikant, Lei Ying

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

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
Volume29
Issue number5
DOIs
StatePublished - May 2011
Externally publishedYes

Fingerprint

Ad hoc networks
Scheduling
Circuit theory
Scheduling algorithms
Wireless networks
Quality of service

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints. / Jaramillo, Juan José; Srikant, R.; Ying, Lei.

In: IEEE Journal on Selected Areas in Communications, Vol. 29, No. 5, 5753562, 05.2011, p. 979-987.

Research output: Contribution to journalArticle

@article{84019cbb091f46cda14c761bd9bf649f,
title = "Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints",
abstract = "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.",
keywords = "Ad hoc networks, Quality of service, Real-time traffic, Scheduling, Wireless networks",
author = "Jaramillo, {Juan Jos{\'e}} and R. Srikant and Lei Ying",
year = "2011",
month = "5",
doi = "10.1109/JSAC.2011.110508",
language = "English (US)",
volume = "29",
pages = "979--987",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

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

AU - Jaramillo, Juan José

AU - Srikant, R.

AU - Ying, Lei

PY - 2011/5

Y1 - 2011/5

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - Quality of service

KW - Real-time traffic

KW - Scheduling

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=84055176710&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055176710&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2011.110508

DO - 10.1109/JSAC.2011.110508

M3 - Article

AN - SCOPUS:84055176710

VL - 29

SP - 979

EP - 987

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 5

M1 - 5753562

ER -