Resource allocation for multi-cell OFDMA based cooperative relay network

University of Technology, Sydney. Faculty of Engineering and Information Technology.Cooperative communications is emerging as an important area within the field of wireless communication systems. The fundamental idea is that intermediary nodes, called relay stations (RSs), who are neither the data source nor destination, are used to assist in communication between sender and receiver. In order to maximise their performance, networks which employ RSs require a new resource allocation and optimisation technique, which takes the RSs into account as a new resource. Several proposals have been presented for the purpose of optimising the distribution of available resources between users. These proposals were developed based on various network scenarios and assumptions. In most cases, impractical assumptions such as; inter-cell interference (ICI) free and full availability of channel state information (CSI) were considered. However, the need for more robust, fair and practical resource allocation algorithms motivated us to study the resource allocation algorithm for OFDMA based cooperative relay networks with more realistic assumptions. This thesis focuses on the resource allocation for the uplink OFDMA based cooperative relay networks. Multiple cells were considered, each composed of a single base station (destination), multiple amplify and forward (AF) relay stations and multiple subscriber stations (sources). The effects of inter-cell interference (ICI) have been considered to optimise the subcarrier allocation with low complexity. The optimisation problem aims to maximise the sum rate of all sources while maintaining a satisfactory degree of fairness amongst them. Furthermore, a utility based resource allocation algorithm has been developed assuming full and partial channel state information for the interference limited OFDMA-based cooperative relay network. In the proposed algorithm, relay selection is initially performed based on the level of ICI. Then, subcarrier allocation is performed on the basis of maximum achieved utility under the assumption of equal power allocation. Finally, based on the amount of ICI, a modified waterfilling power distribution algorithm is proposed and used to optimise the subcarrier power allocation across the allocated set of subcarriers. This thesis also investigates the impact of the relay-to-destination channel gain on subcarrier allocation for uplink OFDMA based cooperative relay networks using multiple amplify-and- forward (AF) relaying protocols. The closed form outage probability is derived for the system under partial channel state information (PCSI) and considering the presence of inter-cell interference (ICI). The proposed resource allocation algorithms as well as the mathematical analysis were validated through computer simulations and the results were presented for each chapter. The results show that, compared to conventional algorithms, the proposed algorithms significantly improve system performance in terms of total sum data rate, outage probability, complexity and fairness

Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying

We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation, to maximize the weighted sum-rate, in a single-relay cooperative system with multiple channels and multiple users. Common relaying strategies are considered, and transmission power constraints are imposed on both individual transmitters and the aggregate over all transmitters. The joint optimization problem naturally leads to a mixed-integer program. Despite the general expectation that such problems are intractable, we construct an efficient algorithm to find an optimal solution, which incurs computational complexity that is polynomial in the number of channels and the number of users. We further demonstrate through numerical experiments that the jointly optimal solution can significantly improve system performance over its suboptimal alternatives.Comment: This is the full version of a paper to appear in the IEEE Journal on Selected Areas in Communications, Special Issue on Cooperative Networking - Challenges and Applications (Part II), October 201

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

Resource allocation and optimization techniques in wireless relay networks

Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks