Optimal linear-time uplink scheduling algorithms for WiMAX

Authors:
Arezou Mohammadi;Selim G. Akl;Firouz Behnamfar
Affiliations:
Queen's University, Kingston, Ontario, Canada;Queen's University, Kingston, Ontario, Canada;Queen's University, Kingston, Ontario, Canada
Venue:
WOC '08 Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications
Year:
2008

Citing 8
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Cross-Layer Scheduler Design with QoS Support forWireless Access Networks

Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Performance evaluation for unsolicited grant service flows in 802.16 networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
A Queuing-Theoretic and Optimization-Based Model for Radio Resource Management in IEEE 802.16 Broadband Wireless Networks

IEEE Transactions on Computers
Performance Evaluation of the IEEE 802.16 MAC for QoS Support

IEEE Transactions on Mobile Computing
A QoS Guaranteed Cross-Layer Scheduling Algorithm in Wireless Networks

ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
IEEE 802.16 based last mile broadband wireless military networks with quality of service support

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on a recent application of realtime scheduling in wireless communications industry; namely, uplink scheduling for WiMAX systems. More specifically, we address the problem of maximizing the number of data packets to be sent in uplink such that the expectations from the system are guaranteed. We argue that this problem is NP-Complete. Thus far, only a number of heuristic algorithms have been developed for special cases of the problem and the problem has not been modeled formally. In this work, we present two formal models for the system. We take advantage of the properties of the application and derive an algorithm for uplink scheduling which has two highly favourable features: it finds the optimal solution in linear time.