Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
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
An overview of scheduling algorithms in wireless multimedia networks
IEEE Wireless Communications
Streaming video over variable bit-rate wireless channels
IEEE Transactions on Multimedia
IEEE Transactions on Multimedia
INFOCOM'10 Proceedings of the 29th conference on Information communications
Utility maximization for delay constrained QoS in wireless
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling heterogeneous real-time traffic over fading wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Queueing Systems: Theory and Applications
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
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 |
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that has been proposed to describe the QoS requirements by four criteria: traffic pattern, channel reliability, delay bound, and throughput bound. We study this mathematical model and extend it to handle variable bit rate applications. We then obtain a sharp characterization of schedulability vis-a-vis latencies and timely throughput. Our results extend the results so that they are general enough to be applied on a wide range of wireless applications, including MPEG Variable-Bit-Rate (VBR) video streaming, VoIP with differentiated quality, and wireless sensor networks (WSN). Two major issues concerning QoS over wireless are admission control and scheduling. Based on the model incorporating the QoS criteria, we analytically derive a necessary and sufficient condition for a set of variable bit-rate clients to be feasible. Admission control is reduced to evaluating the necessary and sufficient condition. We further analyze two scheduling policies that have been proposed, and show that they are both optimal in the sense that they can fulfill every set of clients that is feasible by some scheduling algorithms. The policies are easily implemented on the IEEE 802.11 standard. Simulation results under various settings support the theoretical study.