Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
Modelling an Adaptive-Rate Video-Streaming Service Using Markov-Rewards Models
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An overview of scheduling algorithms in wireless multimedia networks
IEEE Wireless Communications
A scheduling algorithm for QoS support in IEEE802.11 networks
IEEE Wireless Communications
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Utility-optimal scheduling in time-varying wireless networks with delay constraints
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
Broadcasting delay-constrained traffic over unreliable wireless links with network coding
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Adaptive network coding for scheduling real-time traffic with hard deadlines
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
Queueing Systems: Theory and Applications
Generalized two-hop relay for flexible delay control in MANETs
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Scheduling of access points for multiple live video streams
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traffic pattern, delay bound, timely-throughput requirement, and channel reliability, to allow time-varying channels, allow clients to have different deadlines, and allow for the optional employment of rate adaptation. Thus, our model allow the treatment of more realistic fading channels as well as scenarios with mobile nodes, and the usage of more general transmission strategies. We derive a sufficient condition for a scheduling policy to be feasibility optimal, and thereby establish a class of feasibility optimal policies. We demonstrate the utility of the identified class by deriving a feasibility optimal policy for the scenario with rate adaptation, time-varying channels, and heterogeneous delay bounds. When rate adaptation is not available, we also derive a feasibility optimal policy for timevarying channels. For the scenario where rate adaptation is not available but clients have different delay bounds, we describe a heuristic. Simulation results are also presented which indicate the usefulness of the scheduling policies for more realistic and complex scenarios.