By Topic

Optimal linear-time algorithm for uplink scheduling of packets with hard deadlines in WiMAX

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mohammadi, A. ; Sch. of Comput., Queen''s Univ., Kingston, ON ; Akl, S.G. ; Behnamfar, F.

This paper focuses on a recent application of real-time scheduling in wireless communications industry; i.e., uplink scheduling for WiMAX systems. We address the problem of maximizing the number of packets to be sent in uplink such that the expectations from the system are guaranteed. In this work, we present, for the first time, a formal model for the general problem. Then, we use the properties of the application and derive an algorithm which has two highly favorable features: it finds the optimal solution in linear time. Finally, we present a method to fine-tune our general model in order to make sure that the model represents the actual system. This approach guarantees that the optimal algorithm for the model is indeed the optimal scheduler for the system.

Published in:

Communications, 2008 24th Biennial Symposium on

Date of Conference:

24-26 June 2008