Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling

Authors:
Reuven Cohen;Liran Katzir
Affiliations:
Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 16
Cited 1

Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
The budgeted maximum coverage problem

Information Processing Letters
Scheduling real-time traffic with deadlines over a wireless channel

Wireless Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
An efficient approximation for the generalized assignment problem

Information Processing Letters
A generic quantitative approach to the scheduling of synchronous packets in a shared uplink wireless channel

IEEE/ACM Transactions on Networking (TON)
The Generalized Maximum Coverage Problem

Information Processing Letters
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Computationally efficient bandwidth allocation and power control for OFDMA

IEEE Transactions on Wireless Communications
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework

IEEE Transactions on Wireless Communications
Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Adaptation techniques in wireless packet data services

IEEE Communications Magazine

A self-adapting connection admission control solution for mobile WiMAX: Enabling dynamic switching of admission control algorithms based on predominant network usage profiles

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.