Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
A utility-based power-control scheme in wireless cellular systems
IEEE/ACM Transactions on Networking (TON)
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
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
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
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
Call admission control in wireless networks: a comprehensive survey
IEEE Communications Surveys & Tutorials
An overview of scheduling algorithms in wireless multimedia networks
IEEE Wireless Communications
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
Evaluation of distributed admission control for the IEEE 802.11e EDCA
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Admission control in IEEE 802.11e wireless LANs
IEEE Network: The Magazine of Global Internetworking
Call admission control for QoS provisioning in 4G wireless networks: issues and approaches
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We provide an account of recent work that formulates and addresses problems that arise when employing wireless networks to serve clients that generate real-time flows. From a queueing systems perspective, these problems can be described as single-server problems where there are several customer classes. Customers balk when their delay exceeds a threshold. There are a range of issues that are of interest. One of the first such issues is to determine what throughput rate vectors are feasible, and to determine the server's schedule. Another is to maximize a utility function of the departure rates of the customer classes.Real-time flows have a delay bound for each of their packets. It is particularly challenging to provide delay guarantees for real-time flows in wireless networks since wireless transmissions are unreliable. We propose a model that jointly considers the delay bounds of packets, the unreliable wireless channels, and the throughput requirements of clients. We then determine the necessary and sufficient condition for feasibility of the client requirements. The analysis and condition are interesting since this problem gives rise to some new features concerning unavoidable idle times in a system. We further derive an efficient, nearly linear time algorithm for admission control, which precisely determines whether it is feasible to fulfill the requirements of all clients in the system. We also propose two on-line scheduling policies and prove that they can fulfill the requirements of all clients whenever that is feasible.We next turn to the scenario where the throughput requirements of clients are elastic, but with hard delay bounds. We formulate this as a utility maximization problem, where client utilities are based on their throughputs. We decompose this problem into two subproblems, and show that this decomposition can be naturally implemented as a bidding game among all clients and the access point, which plays the role of a centralized scheduler. In the bidding game, the strategy of each client is to carry out a simple selfish optimization. We show that the strategy of the access point can be implemented by a simple on-line scheduling policy. A surprising result is that the channel reliabilities need not be known a priori.