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 |
Keywords
- Ad hoc networks
- Quality of service
- Real-time traffic
- Scheduling
- Wireless networks
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Fingerprint 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
Jaramillo, J. J., Srikant, R., & Ying, L. (2011). Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints. IEEE Journal on Selected Areas in Communications, 29(5), 979-987. [5753562]. https://doi.org/10.1109/JSAC.2011.110508