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

Radio resource allocation in relay based OFDMA cellular networks

PhDAdding relay stations (RS) between the base station (BS) and the mobile stations (MS) in a cellular system can extend network coverage, overcome multi-path fading and increase the capacity of the system. This thesis considers the radio resource allocation scheme in relay based cellular networks to ensure high-speed and reliable communication. The goal of this research is to investigate user fairness, system throughput and power consumption in wireless relay networks through considering how best to manage the radio resource. This thesis proposes a two-hop proportional fairness (THPF) scheduling scheme fair allocation, which is considered both in the first time subslot between direct link users and relay stations, and the second time subslot among relay link users. A load based relay selection algorithm is also proposed for a fair resource allocation. The transmission mode (direct transmission mode or relay transmission mode) of each user will be adjusted based on the load of the transmission node. Power allocation is very important for resource efficiency and system performance improvement and this thesis proposes a two-hop power allocation algorithm for energy efficiency, which adjusts the transmission power of the BS and RSs to make the data rate on the two hop links of one RS match each other. The power allocation problem of multiple cells with inter-cell interference is studied. A new multi-cell power allocation scheme is proposed from non-cooperative game theory; this coordinates the inter-cell interference and operates in a distributed manner. The utility function can be designed for throughput improvement and user fairness respectively. Finally, the proposed algorithms in this thesis are combined, and the system performance is evaluated. The joint radio resource allocation algorithm can achieve a very good tradeoff between throughput and user fairness, and also can significantly improve energy efficiency

On the spectral-energy efficiency and rate fairness tradeoff in relay-aided cooperative OFDMA systems

In resource constrained wireless systems, achieving higher spectral efficiency (SE) and energy efficiency (EE), and greater rate fairness are conflicting objectives. Here a general framework is presented to analyze the tradeoff among these three performance metrics in cooperative OFDMA systems with decode-and-forward (DF) relaying, where subcarrier pairing and allocation, relay selection, choice of transmission strategy, and power allocation are jointly considered. In our analytical framework, rate fairness is represented utilizing -fairness model and the resource allocation problem is formulated as a multiobjective optimization (MOO) problem. We then propose a cross-layer resource allocation algorithm across application and physical layers, and further devise a heuristic algorithm to tackle the computational complexity issue. The SE-EE tradeoff is characterized as a Pareto optimal set, and the efficiency and fairness tradeoff is investigated through the price of fairness (PoF). Simulations indicate that higher fairness results in a worse SE-EE tradeoff. It is also shown imposing fairness helps to reduce the outage probability. For a fixed number of relays, by increasing circuit power, the performance of SE-EE tradeoff is degraded. Interestingly, by increasing the number of relays, although the total circuit power is increased, the SE-EE tradeoff is not necessarily degraded. This is thanks to the extra degree of freedom provided in relay selection

Low Complexity Joint Sub-Carrier Pairing, Allocation and Relay Selection in Cooperative Wireless Networks

Multi-carrier cooperative relay-based wireless communication is of particular interest in future wireless networks. In this paper we present resource allocation algorithm in which sub-carrier pairing is of particular interest along with fairness constraint in multi-user networks. An optimization of sub-carrier pair selection is formulated through capacity maximization problem. Sub-carrier pairing is applied in both two-hop Amplify & Forward (AF) and Decode & Forward (DF) cooperative multi-user networks. We develop a less complex centralized scheme for joint Sub-carrier pairing and allocation along with relay selection. The computational complexity of the proposed algorithms has been analyzed and performance is compared with Exhaustive Search Algorithm

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

An Efficient Resource Allocation Algorithm for OFDMA Cooperative Relay Networks with Fairness and Qos Guaranteed

This paper proposes a new resource allocation algorithm for uplink OFDMA-based cooperative relay networks assuming multiple source nodes, multiple relay nodes and a single destination. The aim is to maximize the total sum of the sources data rates while guaranteeing fairness among them with different QoS requirements. Assuming perfect channel state information (CSI) at the resource allocation controller. The optimization problem is formulated such that each source is assigned a weight factor based on its QoS requirements, then the ones with high weights are given more priority to select their resources (relay stations and subcarriers) first. Once the required QoS is achieved for all sources, the weight factor for all sources will be unity. The remaining resources are allocated to the sources with maximum instantaneous rate. The results show that the proposed algorithm outperforms the greedy and static algorithms in terms of outage probability and fairness