Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling

Orthogonal frequency-division multiple access (OFDMA) is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an algorithm that determines which of the pending packets will be transmitted, what modulation should be used for each of them, and how to construct the complex OFDMA frame matrix as a collection of rectangles that fit into a single matrix with fixed dimensions. We propose efficient algorithms, with performance guarantee, that solve this intricate OFDMA scheduling problem by breaking it down into two subproblems, referred to as macro and micro scheduling. We analyze the computational complexity of these subproblems and develop efficient algorithms for solving them.

[1]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[2]  Reuven Cohen,et al.  A generic quantitative approach to the scheduling of synchronous packets in a shared uplink wireless channel , 2007, TNET.

[3]  Didem Kivanc-Tureli,et al.  Computationally efficient bandwidth allocation and power control for OFDMA , 2003, IEEE Trans. Wirel. Commun..

[4]  Aytac Azgin,et al.  Scheduling in wireless cellular networks under probabilistic channel information , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[5]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[6]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[7]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[8]  Dror Rawitz,et al.  On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems , 2008, Inf. Comput..

[9]  Sanjiv Nanda,et al.  Adaptation techniques in wireless packet data services , 2000, IEEE Commun. Mag..

[10]  Geoffrey Ye Li,et al.  Cross-layer optimization for OFDM wireless networks-part I: theoretical framework , 2005, IEEE Trans. Wirel. Commun..

[11]  A. Goldsmith,et al.  Variable-rate variable-power MQAM for fading channels , 1996, Proceedings of Vehicular Technology Conference - VTC.

[12]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[13]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[14]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[15]  Reuven Cohen,et al.  The Generalized Maximum Coverage Problem , 2008, Inf. Process. Lett..

[16]  Yefim Dinitz,et al.  Two-dimensional mapping for wireless OFDMA systems , 2006, IEEE Transactions on Broadcasting.

[17]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[18]  B.L. Evans,et al.  A low complexity algorithm for proportional resource allocation in OFDMA systems , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Reuven Cohen,et al.  Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Scheduling , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.