Adaptive Resource Allocation with Strict Delay Constraints in OFDMA System

Orthogonal Frequency-Division Multiple Access (OFDMA) systems have attracted considerable attention through technologies such as 3GPP Long Term Evolution (LTE) and Worldwide Interoperability for Microwave Access (WiMAX). OFDMA is a flexible multiple-access technique that can accommodate many users with widely varying applications, data rates, and Quality of Service (QoS) requirements. OFDMA has the advantages of handling lower data rates and bursty traffic at a reduced power compared to single-user OFDM or its Time Division Multiple Access (TDMA) or Carrier Sense Multiple Access (CSMA) counterparts. In our work, we propose a Particle Swarm Optimization based resource allocation and scheduling scheme (PSORAS) with improved quality of service for OFDMA Systems. Simulation results indicate a clear reduction in delay compared to the Frequency Division Multiple Access (FDMA) scheme for resource allocation, at almost the same throughput and fairness. This makes our scheme absolutely suitable for handling real time traffic such real time video-on demand.

In orthogonal frequency division multiple access (OFDMA) systems, efficient resource allocation is very important to improve the performance of the OFDMA system. The general principle of resource allocation in an OFDMA system is to assign each subcarrier to the user with the best channel condition for that subcarrier. However, in delay tolerant traffic, current work did not consider that packets on retransmissions may have different allocation criteria from those on their first transmissions. In this paper, the resource allocation scheme is investigated by considering different criterions to packets on first transmissions and on retransmissions. Under a bit error rate (BER) constraint, the objective is to maximize the throughput of packets on first transmissions, meanwhile decreasing the longest packet delay caused by retransmitted packets and guaranteeing all packets on retransmissions to be sent out. A low-complexity suboptimal algorithm that separates allocation for packets on retransmissions and on first transmissions is proposed. Adaptive modulation scheme is adopted to guarantee the BER constraint, except the modulation for each retransmitted packet remains the same. In order to improve retransmission liability, the retransmitted packets are combined with its failed packets in previous transmission.

Deployment of relay nodes (RNs) in cellular orthogonal frequency division multiple access (OFDMA) systems provides an effective solution to increase high data rate coverage and improve cell throughput. However, a challenging issue is that additional interferences caused by RNs may substantially compromise the performance gain if no measure is taken. In this study, the authors address the problem of interference coordination in relay-aided cellular OFDMA systems, aiming at exploiting the benefits of RNs while minimising the negative effects of interferences introduced. The authors first analyse the possible interference scenarios in multi-cell systems. Based on the insights into their analysis, the authors propose resource allocation with interference coordination (RAIC) scheme for cellular OFDMA systems. RAIC selectively perform one of three resource allocation algorithms according to the offered traffic load in the system, to mitigate interferences and thus enhance system throughput. The authors conduct intensive simulation experiments based on the model with realistic broadband channel propagation conditions. Numerical results demonstrate that their proposed RAIC can effectively improve system throughput compared with the resource allocation schemes without appropriate interference coordination.

This letter presents a novel opportunistic cooperative positioning approach for orthogonal frequency-division multiple access (OFDMA) systems. The basic idea is to allow idle mobile terminals (MTs) opportunistically estimating the arrival timing of the training sequences for uplink synchronization from active MTs. The major advantage of the proposed approach over state-of-the-arts is that the positioning-related measurements among MTs are performed without the paid of training overhead. Moreover, Cramer-Rao lower bound (CRLB) is utilized to derive the positioning accuracy limit of the proposed approach, and the numerical results show that the proposed approach can improve the accuracy of non-cooperative approaches with the a-priori stochastic knowledge of clock bias among idle MTs.

In this paper, we mathematically derive a matrix-form solution named resource allocation matrix (RAM) for sub-band allocation in an orthogonal frequency division multiple access (OFDMA) system. The proposed scheme is designed to enhance throughput under a strict user fairness condition such that every user has an equal number of sub-bands per frame. The RAM designates the most preferable sub-band for every user. The proposed scheme is evaluated in terms of throughput and user fairness by comparison with the proportional fairness (PF) scheme and greedy scheme. Numerical results show that the proposed scheme has overwhelming superiority to other schemes in terms of fairness and tight competitive in terms of throughput.

Multiuser Orthogonal Frequency Division Multiple Access (OFDMA) networks, such as Long Term Evolution networks, use the frequency reuse-1 model to face the tremendous increase of mobile traffic demands, and to increase network capacity. However, inter-cell interference problems are generated, and they have a negative impact on cell-edge users performance. Resource and power allocation should be managed in a manner that alleviates the negative impact of inter-cell interference on system performance. In this paper, we formulate a novel centralized multi-cell resource and power allocation problem for multiuser OFDMA networks. The objective is to maximize system throughput while guaranteeing a proportional fair rate for all the users. We decompose the joint problem into two independent problems: a resource allocation problem and a power allocation problem. We prove that each of these problems is a convex optimization problem, and that their optimal solution is also an optimal solution to the original joint problem. Lagrange duality theory and subgradient projection method are used to solve the centralized power allocation problem. We study the convergence of our centralized approach, and we find out that it reduces inter-cell interference, and increases system throughput and spectral efficiency in comparison with the frequency reuse-1 model, reuse-3 model, fractional frequency reuse, and soft frequency reuse techniques.

Orthogonal frequency division multiple access (OFDMA) systems exploit multiuser diversity and frequency-selectivity to achieve high spectral efficiencies. However, they require considerable feedback for scheduling and rate adaptation, and are sensitive to feedback delays. We develop a comprehensive analysis of the OFDMA system throughput as a function of the feedback scheme, frequency-domain scheduler, and discrete rate adaptation rule in the presence of feedback delays. We analyze the popular best-n and threshold-based feedback schemes. We show that for both the greedy and round-robin schedulers, the throughput degradation, given a feedback delay, depends primarily on the fraction of feedback reduced by the feedback scheme and not the feedback scheme itself. Even small feedback delays at low vehicular speeds are shown to significantly degrade the throughput. We also show that optimizing the link adaptation thresholds as a function of the feedback delay can effectively counteract the detrimental effect of delays.

In this paper, channel adaptive resource allocation and user scheduling problem for cognitive radio multiple-inputmultiple-output orthogonal frequency-division multiple access systems is investigated. Furthermore, stochastic approximation is employed to develop an on-line algorithm which is capable of adaptively learning the underlying channel distribution. The NP-hard combinatorial resource allocation and user scheduling problem is then solved through via the Lagrangian relaxation approach. Numerical results demonstrate the effectiveness of our proposed scheme.

A new family of low density parity-check (LDPC) codes, called as invertible subset LDPC (IS-LDPC) codes, was proposed for peak-to-average power ratio (PAPR) reduction in OFDM systems recently. In this paper, we propose a PAPR reduction scheme for orthogonal frequency-division multiple access (OFDMA) systems based on IS-LDPC codes. The proposed scheme maps the invertible subsets of IS-LDPC codewords onto subcarriers to construct invertible symbol subsets. Then, the invertible symbol subsets are inverted independently for reducing the PAPR of downlink OFDMA systems. There is no need to transmit the side information by extra channels, which significantly reduces the system overhead and eases the system design. Simulation results show that the PAPR reduction scheme based on IS-LDPC codes produces remarkable PAPR reduction performance and good error correction performance in downlink OFDMA systems. Therefore, the proposed PAPR reduction scheme could be an efficient solution to reduce the PAPR of downlink OFDMA systems.

Orthogonal Frequency Division Multiple Access (OFDMA) is a promising technique which can provide high capacity in the wireless environments. Also cooperative communications are effectively used to achieve cooperative diversity for high reliability. In this paper, we propose the pair-based OFDMA frame structure in which cooperative users transmit their blocks in turns for achieving cooperative diversity in OFDMA systems. In order to guarantee the fairness of users we also propose a dynamic resource allocation scheme based on cooperative communications. Through the proposed scheme, user fairness can be achieved by sharing the remained capacity of users near the base station (BS) with users who are farther from the base station. For this purpose, the center-located users select their partner whose channel suffers the lowest SNR to BS among their neighbor set. Based on the partner selection results, subchannels are assigned to cooperative and non-cooperative users. Through simulations in the IEEE 802.16e system environments, it is shown that the proposed scheme outperforms the non-cooperation based scheme in terms of user fairness.

Traditional handover algorithms are based on received signal strength indicator (RSSI) and traffic load intensity in orthogonal frequency division multiple access (OFDMA) systems, in order to guarantee all UEs' Quality of Service (QoS) and handover success ratio, a transceiver is activated even if there is only one low date rate activated user in its coverage area. In this paper, we propose an energy efficient handover algorithm combined coordinated multiple-points (CoMP) with OFDMA in a cellular systems, energy efficiency is introduced into the handover algorithm as an important parameter. The idea of the design is to enable adjacent cells to shutdown partial transceivers in some timeslots in low traffic conditions by concentrating the activated edge UEs to less cells. All activated UEs are classified into edge users and center users according to their distance to base stations, the analysis indicates that there exist an optimal edge distance corresponding to the maximum energy efficiency under different load for the proposed algorithm. Furthermore, a practical and low-complexity scheme that only considers the edge users is put forward. The edge users are identified by the reference signal received power (RSRP). Simulation results show that it can obtain up to 60% energy reduction at low traffic scenario.

One of the major drawbacks of the orthogonal frequency division multiple access (OFDMA) system is the multi-user interference (MUI) induced by the carrier frequency offsets (CFOs). In sub-band based OFDMA systems, users occupy consecutive and non-overlapping frequency sub-bands. The pilots are usually placed on the edges of a sub-band for channel estimation. However, the channel estimation performance is seriously degraded by the MUI. Traditionally, the MUI is alleviated by inserting a guard sub-carrier between adjacent users. In this paper, a novel pilot architecture is proposed, where three pilots are placed on each edge of a sub-band and pilots of adjacent users are overlapped. The proposed architecture has the same bandwidth efficiency as that of the conventional guard sub-carrier insertion scheme and provides better channel estimation performance and MUI reduction.

The resource allocation of Orthogonal Frequency Division Multiple Access (OFDMA) is one of the core issues in the next generation mobile systems. The improvement in the performance and quality of service (QoS) of communication systems is relying upon the efficient utilization of the available communication resources. The resource allocation of the OFDMA systems is mainly depends on both power and subcarrier allocations of each user for different operation scenarios and channel conditions. This paper proposes and applies Firefly Pack Algorithm (FPA) to find the optimal or near optimal power and subcarrier allocations for OFDMA systems. It takes into consideration the power and subcarrier allocations constrains, channel and noise distributions, distance between users equipments and base station, user priority weight to approximate the most of the variables, constrains, and parameters that encounter in the OFDMA systems. Four important cases for the number of subcarriers and users are addressed, simulated, and analyzed with employing the FPA algorithm under specific operation scenarios to meet the standard specifications. The results demonstrate that FPA is an effective algorithm in finding the optimal or near optimal for both subcarrier and power allocation.

Cooperative communication and orthogonal frequency-division multiplexing (OFDM) technology are both promising candidates for next-generation wireless communication systems. In this paper, we investigate cooperation strategies and resource-allocation algorithms for multiuser cooperative orthogonal frequency-division multiple-access (OFDMA) systems. There are two major contributions of this paper. First, we propose a novel cooperation strategy for the OFDMA system. When there are two users in the system, the strategy achieves the capacity region upper bound for decode-and-forward (DF) cooperation. When there are multiple users in the system, the strategy can achieve near upper-bound performance in certain network topologies. Moreover, the strategy always outperforms those that are previously proposed for cooperative OFDMA systems. The second contribution is that we develop novel centralized resource-allocation algorithms for cooperative OFDMA systems. The advantages of the algorithms are that they not only simultaneously solve relay, power, and subcarrier allocation but also have complexity that increases only linearly with the number of subcarriers in the systems.

In response to the increasing demand for marine data transmission, underwater acoustic (UWA) communication is widely recognized as a key technology to support various applications of the Internet of Underwater Things (IoUT). However, due to the narrow bandwidth shared by multiple acoustic systems and the constrained energy of the underwater nodes, it is an urgent problem to design an energy-efficient resource allocation scheme which can avoid interference simultaneously. In this article, we establish a cognitive orthogonal frequency-division multiple access (OFDMA) UWA communication system, where dynamic resource allocation relies on the feedback channel state information (CSI) and spectrum usage of interference. In order to detect interference, a spectrum sensing scheme applicable to the underwater environment is proposed and experimentally verified. Subsequently, the resource allocation problem is mathematically modeled with energy efficiency (EE) as the reasonable optimization objective in UWA communication systems. In order to reduce the computational complexity, the original problem is decomposed into two subproblems and a low-complexity algorithm named acrlong BOSC- acrlong TLI is developed for feasible solutions. Simulation and sea experiment results show that the proposed algorithm outperforms the existing underwater resource allocation schemes.