Maurizio A. Bonuccelli
ABSTRACT
In this paper, we investigate a scheduling problem in systems adopting OFDMA transmission technique at the physical layer, like WiMAX (IEEE 802.16) systems. In such systems, carriers with different rates must be assigned to users, each carrier being assigned to one user at most, each user can be scheduled on multiple carriers. The objective of our problem is to produce a legal schedule (i.e. one meeting all the system constraints) with minimum length. We first show that the above problem is NP-complete, and thus computationally intractable, even in an extremely simple case. Then, we propose several very simple and fast suboptimal heuristics, and evaluate their average performance by means of simulation experiments. Some of the proposed heuristics perform very well, being in most cases within 10% of the optimal (minimal) schedule length.
- IEEE 802.16 Working Group on Broadband Wireless Access - Part 16, amendment 2 Technical Report, IEEE Computer and Microwave Theory and Techniques Societies, available at http://standards.ieee.org/getieee802/802.16.html, 2006.Google Scholar
- M. Andrews and L. Zhang. Scheduling Algorithms for Multi-Carrier Wireless Data Systems. In Proc. of ACM Thirteenth MOBICOM, Montreal, Canada, Sept. 2007. Google ScholarDigital Library
- M.R. Garey and D.S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979. Google ScholarDigital Library
- L. Nuaymi. WiMAX: Technology for Broadband Wireless Access, John Wiley&Sons, 2007. Google ScholarDigital Library
- M. Chlebik and J. Chlebikova. Inapproximability results for bounded variants of optimization problems.In 14th FCT 2003, Malmoe, Sweden, August 13-15 August, published in LNCS n. 2751, pp. 27--38.Google Scholar
- W. Rhee and J.M. Cioffi. Increase in capacity of multiuser OFDM system using dynamic subchannel allocation. In Proc. VTC2000, Tokyo, Japan, May 15-18 2000, pp. 1085--1089.Google ScholarCross Ref
- M.J. Neely, E. Modiano and Y.S. Cheng. Logarithmic delay for NxN packet switches under the crossbar constraint. IEEE/ACM Transactions on Networking, vol. 15, n.3, pp. 657--668, June 2007. Google ScholarDigital Library
- K. Kim, Y. Han and S.L. Kim. Joint subcarrier and power allocation in uplink OFDMA systems. IEEE Communications Letters, vol. 9, n.6, pp. 526--528, June 2005.Google ScholarCross Ref
- R. Iyengar, K. Kar and B. Sikdar. Scheduling algorithms for point-to-multipoint operation in IEEE 802.16 networks. In Second IEEE Workshop on Resource Allocation in Wireless Networks, Boston, MA, April 3 2006, pp. 1347--1351.Google ScholarCross Ref
- T. Girici, C. Zhu, J.R. Agre and A. Ephremides. Practical resource allocation algorithms for QoS in OFDMA-based wireless systems. In 5th IEEE CCNC 2008, Las vegas, Nevada, January 10-12 2008, pp. 897--901.Google ScholarCross Ref
- R. Cohen and L. Katzir. Computational analysis and efficient algorithms for micro and macro OFDMA scheduling. In IEEE INFOCOM 2008, Phoenix, Arizona, April 14-17 2008, pp. 1184--1192.Google ScholarCross Ref
- M. Einhaus, O. Klein and B. Walke. Comparison of OFDMA resource scheduling strategies with fair allocation of capacity. In 5th IEEE CCNC 2008, Las vegas, Nevada, January 10-12 2008, pp. 407--411.Google ScholarCross Ref
- L.M.C. Hoo, J. Tellado and J.M. Cioffi. Dual QoS loading algorithms for multicarrier systems offering different CBR services. In 9th IEEE PIMRC 1998, Boston, Mass., September 8-11 1998, pp. 278--282.Google ScholarCross Ref
- P. Du, W. Jia, L. Huang and W. Lu. Centralized scheduling and channel assignment in multi-channel single-transceiver WiMAX mesh network. In IEEE WCNC 2007, Hong Kong, China, March 11-15 2007.Google ScholarDigital Library
- A. Mohammadi, S.G. Akl and F. Behnamfar. Optimal linear-time algorithm for uplink scheduling of packets with hard or soft deadlines in WiMAX. In 68th IEEE VTC'08, Calgary, Canada, September 21-24 2008.Google ScholarCross Ref
Index Terms
- Traffic scheduling for frame length minimization in OFDMA based systems
Recommendations
Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems
PM2HW2N '10: Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networksThis paper considers the problem of scheduling realtime traffic in OFDMA systems. We present two heuristics with the objective of meeting as much deadlines as possible, or equivalently, minimizing the number of missed deadlines. The proposed heuristics ...
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties
This paper considers an unrelated parallel machine scheduling problem with the objective of minimizing the total earliness and tardiness penalties. Machine and job-sequence dependent setup times and idle times are considered. Since the studied problem ...
WiMAX/OFDMA Burst Scheduling Algorithm to Maximize Scheduled Data
OFDMA resource allocation algorithms manage the distribution and assignment of shared OFDMA resources among the users serviced by the basestation. The OFDMA resource allocation algorithms determine which users to schedule, how to allocate subcarriers to ...
Comments