Energy-efficiency for MISO-OFDMA based user-relay assisted cellular networks

The concept of improving energy-efficiency (EE) without sacrificing the service quality has become important nowadays. The combination of orthogonal frequency-division multiple-access (OFDMA) multi-antenna transmission technology and relaying is one of the key technologies to deliver the promise of reliable and high-data-rate coverage in the most cost-effective manner. In this paper, EE is studied for the downlink multiple-input single-output (MISO)-OFDMA based user-relay assisted cellular networks. EE maximization is formulated for decode and forward (DF) relaying scheme with the consideration of both transmit and circuit power consumption as well as the data rate requirements for the mobile users. The quality of-service (QoS)-constrained EE maximization, which is defined for multi-carrier, multi-user, multi-relay and multi-antenna networks, is a non-convex and combinatorial problem so it is hard to tackle. To solve this difficult problem, a radio resource management (RRM) algorithm that solves the subcarrier allocation, mode selection and power allocation separately is proposed. The efficiency of the proposed algorithm is demonstrated by numerical results for different system parameter

Resource Allocation Algorithm for OFDMA System based on Bidirectional Multi-Relay

A novel approach to optimize power allocation and subcarrier pairing in a high signal-to-noise ratio (SNR) scenario within a two-way multi-relay orthogonal frequency division multiple access (OFDMA) system has been introduced. Unlike conventional methods where relays operate on individual subcarriers, our scheme allows all relays to transmit signals across each subcarrier pair, thereby leveraging significant space diversity. Operating under a constraint of total system power, our proposed scheme initially assigns power to each relay using Cauchy inequality under the assumption of fixed total relay power. Subsequently, employing a dichotomous approach, we determine the power allocation between the source node and the relay node by maximizing the equivalent channel gain across various subcarrier pairs. Finally, we employ convex programming to allocate power to different subcarrier pairs, while utilizing the Hungarian algorithm to pair subcarriers effectively, thereby maximizing system capacity. Given the inherent complexity of power allocation algorithms in two-way multi-relay networks, conventional methods lack optimal solutions with low complexity. However, our algorithm significantly mitigates the complexity associated with power allocation, particularly within a system comprising 40 subcarriers. Simulation results underscore the superiority of our proposed scheme over conventional relay selection approaches, particularly those wherein relays operate on individual subcarriers

RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS

In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and subchannel assignment for orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. Sharing the two best ordered relays with equal power between the two users over Rayleigh flat fading channels is proposed to establish full diversity order for both users. Closed form expressions for the outage probability, and bit error probability (BEP) performance measures for both amplify and forward (AF) and decode and forward (DF) cooperative communication schemes are developed for different scenarios. To utilize the full potentials of relay-assisted transmission in multi user systems, we propose a mixed strategy of AF relaying and direct transmission, where the user transmits part of the data using the relay, and the other part is transmitted using the direct link. The resource allocation problem is formulated to maximize the sum rate. A recursive algorithm alternating between power allocation and bandwidth allocation steps is proposed to solve the formulated resource allocation problem. Due to the conflict between limited wireless resources and the fast growing wireless demands, Stackelberg game is proposed to allocate the relay resources (power and bandwidth) between competing users, aiming to maximize the relay benefits from selling its resources. We prove the uniqueness of Stackelberg Nash Equilibrium (SNE) for the proposed game. We develop a distributed algorithm to reach SNE, and investigate the conditions for the stability of the proposed algorithm. We propose low complexity algorithms for AF-OFDMA and DF-OFDMA systems to assign the subcarriers to the users based on high SNR approximation aiming to maximize the weighted sum rate. Auction framework is proposed to devise competition based solutions for the resource allocation of AF-OFDMA aiming tomaximize either vi the sum rate or the fairness index. Two auction algorithms are proposed; sequential and one-shot auctions. In sequential auction, the users evaluate the subcarrier based on the rate marginal contribution. In the one-shot auction, the users evaluate the subcarriers based on an estimate of the Shapley value and bids on all subcarriers at once

Adaptive relay techniques for OFDM-based cooperative communication systems

Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes