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 language | English (US) |
|---|---|
| Article number | 5753562 |
| Pages (from-to) | 979-987 |
| Number of pages | 9 |
| Journal | IEEE Journal on Selected Areas in Communications |
| Volume | 29 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2011 |
| Externally published | Yes |
Fingerprint
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 journal › Article
}
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 -