A utility-based power-control scheme in wireless cellular systems
IEEE/ACM Transactions on Networking (TON)
A survey of QoS enhancements for IEEE 802.11 wireless LAN: Research Articles
Wireless Communications & Mobile Computing
Proceedings of the tenth 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
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
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
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
Queueing Systems: Theory and Applications
Convergence rate control for distributed multi-hop wireless mesh networks
Computers and Electrical Engineering
Hi-index | 0.00 |
This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that characterizes the QoS requirements of clients by their delay constraints, channel reliabilities, and timely throughput requirements. In this work, we assume that the utility of a client is a function of the timely throughput it obtains. We treat the timely throughput for a client as a tunable parameter by the access point (AP), instead of a given value as in the previous work. We then study how the AP should assign timely throughputs to clients so that the total utility of all clients is maximized. We apply the techniques introduced in two previous papers to decompose the utility maximization problem into two simpler problems, a CLIENT problem and an ACCESS-POINT problem. We show that this decomposition actually describes a bidding game, where clients bid for the service time from the AP. We prove that although all clients behave selfishly in this game, the resulting equilibrium point of the game maximizes the total utility. In addition, we also establish an efficient scheduling policy for the AP to reach the optimal point of the ACCESS-POINT problem. We prove that the policy not only approaches the optimal point but also achieves some forms of fairness among clients. Finally, simulation results show that our proposed policy does achieve higher utility than all other compared policies.