A Data Mapping Algorithm for Two-Level Requests in WiMAX Systems

Abstract

The IEEE 802.16e standard known as Mobile WiMAX has recently been introduced. It is considered as one of the most promising wireless access technologies supporting high data throughput with low cost of deployment. Mobile WiMAX makes use of Orthogonal Frequency-Division Multiple Access (OFDMA) digital modulation scheme as the transmission method. With the constraint requires that all requests have to be mapped as a rectangle, it is shown that finding an optimum mapping solution is an NP-complete problem. Many burst mapping algorithms have been proposed, but none considered the case with prioritized requests. This paper presents an efficient packing algorithm for two-level requests with two targets: (1) map high (MUST part) priority data as much as possible; and (2) achieve high efficiency, reduces the number of unused slots, and minimizes the mapping information overhead. Simulation results show that the proposed algorithm achieves high efficiency.

A Downlink Mapping algorithm for two-level requests in IEEE 802.16e systems under AMC mode

“…The algorithms in [2]- [4] deals with the mapping problem under the PUSC permutation where the MCS of a user is the same among all subchannels. To explore the multiuser gain under frequency selective channels, the AMC mode, where a subchannel consists of contiguous subcarriers, is often used to improve spectrum efficiency.…”

“…Several heuristic algorithms [2] - [7] have been proposed to allocate resource in IEEE 802.16 networks. The algorithms in [2]- [4] consider the PUSC permutation where the MCS of all subchannels are the same for a MS. Though the algorithms in [5]- [7] deal with the AMC permutation, traffic differentiation is not considered.…”

RLAM: A Dynamic and Efficient Reinforcement Learning-Based Adaptive Mapping Scheme in Mobile WiMAX Networks

“…Additionally, bandwidth assignment should follow certain rules and comply with constraints imposed by the OFDMA technique [4]. Specifically, the available bandwidth is structured as a two-dimensional rectangular shaped allocation bin, having one dimension associated with frequency (height) and the other with time (width) [5]. Moreover, each downlink request (or a set of requests that share common PHY characteristics, referred to as burst [6]) must comply with the rectangular shape.…”