Dynamic subchannel and slot allocation for OFDMA networks supporting mixed traffic: upper bound and a heuristic algorithm

Authors:
Antonis Gotsis;Dimitris Komnakos;Philip Constantinou
Affiliations:
Mobile Radio-Communications Laboratory, ECE School, National Technical University of Athens, Attica, Greece;Mobile Radio-Communications Laboratory, ECE School, National Technical University of Athens, Attica, Greece;Mobile Radio-Communications Laboratory, ECE School, National Technical University of Athens, Attica, Greece
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 1

Orthogonal Frequency Division Multiplexing for Wireless Communications (Signals and Communication Technology)

Orthogonal Frequency Division Multiplexing for Wireless Communications (Signals and Communication Technology)
Adaptive subcarrier and bit allocation in OFDMA systems supporting heterogeneous services

Wireless Personal Communications: An International Journal
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband

3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

IEEE Transactions on Wireless Communications
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation

IEEE Transactions on Wireless Communications

Subcarrier allocation in multi-hop orthogonal frequency division multiple access wireless networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing resource allocation over only the frequency dimension in a single-cell OFDMA network is strictly suboptimal when heterogeneous non-real-time data users coexist. In this work we examine how to jointly exploit multi-user diversity on frequency and time domains towards maximizing cell throughput performance and satisfying individual rate and fairness QoS constraints. We develop a performance upper bound as well as an efficient heuristic algorithm for subcarrier and slot allocation which outperforms existing algorithms under polynomial complexity.