Sciweavers

Share
JSAC
2011

Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints

8 years 6 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—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.
Juan José Jaramillo, R. Srikant, Lei Ying
Added 16 Sep 2011
Updated 16 Sep 2011
Type Journal
Year 2011
Where JSAC
Authors Juan José Jaramillo, R. Srikant, Lei Ying
Comments (0)
books