Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Experiences in a 3G network: interplay between the wireless channel and applications
Proceedings of the 14th ACM international conference on Mobile computing and networking
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
Information and Computation
Resource allocation in OFDMA wireless communications systems supporting multimedia services
IEEE/ACM Transactions on Networking (TON)
Scheduling in IEEE 802.16e Mobile WiMAX networks: key issues and a survey
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power-aware opportunistic downlink scheduling in IEEE 802.16 wireless networks
Computer Communications
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Management Science
Journal of Network and Computer Applications
Journal of Network and Computer Applications
Efficient resource allocation for emerging OFDMA wireless networks
Computer Communications
Hi-index | 0.00 |
The IEEE 802.16 standard uses Orthogonal Frequency Division Multiple Access (OFDMA) for mobility support. Therefore, the medium access control frame extends in two dimensions, i.e., time and frequency. At the beginning of each frame, i.e., every 5 ms, the base station is responsible both for scheduling packets, based on the negotiated quality of service requirements, and for allocating them into the frame, according to the restrictions imposed by 802.16 OFDMA. To break down the complexity, a split approach has been proposed in the literature, where the two tasks are solved in separate and subsequent stages. In this paper we focus on the allocation task alone, which is addressed in its full complexity, i.e., by considering that data within the frame must be allocated as bursts with rectangular shape, each consisting of a set of indivisible sub-bursts, and that a variable portion of the frame is reserved for in-band signaling. After proving that the resulting allocation problem is NP-hard, we develop an efficient heuristic algorithm, called Recursive Tiles and Stripes (RTS), to solve it. RTS, in addition to handle a more general problem, is shown to perform better than state-of-the-art solutions via numerical analysis with realistic system parametrization.