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

QoS-Aware Utility-Based Resource Allocation in Mixed-Traffic Multi-User OFDM Systems

This paper deals with the joint subcarrier and power allocation problem in a downlink multi-user orthogonal frequency division multiplexing system subject to user delay and minimum rate quality-of-service (QoS) requirements over a frequency-selective multi-carrier fading channel. We aim to maximize the utility-pricing function, formulated as the difference between the achieved spectral efficiency and the associated linear cost function of transmit power scaled by a system-dependent parameter. For a homogeneous system, we show that the joint resource allocation can be broken down into sequential problems while retaining the optimality. Specifically, the optimal solution is obtained by first assigning each subcarrier to the user with the best channel gain. Subsequently, the transmit power for each subcarrier is adapted according to water-filling policy if the global optimum is feasible, else it is given by a nonwater-filling power adaptation. For a heterogeneous system, an optimal solution needs exhaustive search and hence, we resort to two reduced-complexity sub-optimal algorithms. Algorithm-I is a simple extension of the aforementioned optimal algorithm developed for a homogeneous system, while Algorithm-II further takes into consideration the heterogeneity in user QoS requirements for performance enhancement. Simulation results reveal the impacts of user QoS requirements, number of subcarriers and number of users on the system transmit power

Recent advances in radio resource management for heterogeneous LTE/LTE-A networks

As heterogeneous networks (HetNets) emerge as one of the most promising developments toward realizing the target specifications of Long Term Evolution (LTE) and LTE-Advanced (LTE-A) networks, radio resource management (RRM) research for such networks has, in recent times, been intensively pursued. Clearly, recent research mainly concentrates on the aspect of interference mitigation. Other RRM aspects, such as radio resource utilization, fairness, complexity, and QoS, have not been given much attention. In this paper, we aim to provide an overview of the key challenges arising from HetNets and highlight their importance. Subsequently, we present a comprehensive survey of the RRM schemes that have been studied in recent years for LTE/LTE-A HetNets, with a particular focus on those for femtocells and relay nodes. Furthermore, we classify these RRM schemes according to their underlying approaches. In addition, these RRM schemes are qualitatively analyzed and compared to each other. We also identify a number of potential research directions for future RRM development. Finally, we discuss the lack of current RRM research and the importance of multi-objective RRM studies

Modeling and Performance Analysis of Relay-based Cooperative OFDMA Networks

Next generation wireless communication networks are expected to provide ubiquitous high data rate coverage and support heterogeneous wireless services with diverse quality-of-service (QoS) requirements. This translates into a heavy demand for the spectral resources. In order to meet these requirements, Orthogonal Frequency Division Multiple Access (OFDMA) has been regarded as a promising air-interface for the emerging fourth generation (4G) networks due to its capability to combat the channel impairments and support high data rate. In addition, OFDMA offers flexibility in radio resource allocation and provides multiuser diversity by allowing subcarriers to be shared among multiple users. One of the main challenges for the 4G networks is to achieve high throughput throughout the entire cell. Cooperative relaying is a very promising solution to tackle this problem as it provides throughput gains as well as coverage extension. The combination of OFDMA and cooperative relaying assures high throughput requirements, particularly for users at the cell edge. However, to fully exploit the benefits of relaying, efficient relay selection as well as resource allocation are critical in such kind of network when multiple users and multiple relays are considered. Moreover, the consideration of heterogeneous QoS requirements further complicate the optimal allocation of resources in a relay enhanced OFDMA network. Furthermore, the computational complexity and signalling overhead are also needed to be considered in the design of practical resource allocation schemes. In this dissertation, we conduct a comprehensive research study on the topic of radio resource management for relay-based cooperative OFDMA networks supporting heterogeneous QoS requirements. Specifically, this dissertation investigates how to effectively and efficiently allocate resources to satisfy QoS requirements of 4G users, improve spectrum utilization and reduce computational complexity at the base station. The problems and our research achievements are briefly outlined as follows. Firstly, a QoS aware optimal joint relay selection, power allocation and subcarrier assignment scheme for uplink OFDMA system considering heterogeneous services under a total power constraint is proposed. The relay selection, power allocation and subcarrier assignment problem is formulated as a joint optimization problem with the objective of maximizing the system throughput, which is solved by means of a two level dual decomposition and subgradient method. The computational complexity is finally reduced via the introduction of two suboptimal schemes. The performance of the proposed schemes is demonstrated through computer simulations based on OFDMA network. Numerical results show that our schemes support heterogeneous services while guaranteeing each user's QoS requirements with slight total system throughput degradation. Secondly, we investigate the resource allocation problem subject to the satisfaction of user QoS requirements and individual total power constraints of the users and relays. The throughput of each end-to-end link is modeled considering both the direct and relay links. Due to non-convex nature of the original resource allocation problem, the optimal solution is obtained by solving a relaxed problem via two level dual decomposition. Numerical results reveal that the proposed scheme is effective in provisioning QoS of each user's over the conventional resource allocation counterpart under individual total power constraints of the users and relays . Lastly, decentralized resource allocation schemes are proposed to reduce the computational complexity and CSI feedback overhead at the BS. A user centric distributed (UCD) scheme and a relay centric distributed (RCD) scheme are proposed, where the computation of the centralized scheme is distributed among the users and relays, respectively. We also proposed suboptimal schemes based on simplified relay selection. The suboptimal schemes can be combined with the distributed schemes to further reduce of signalling overhead and computational complexity. Numerical results show that our schemes guarantee user's satisfaction with low computational complexity and signalling overhead, leading to preferred candidates for practical implementation. The research results obtained in this dissertation can improve the resource utilization and QoS assurance of the emerging OFDMA networks.4 month

Resource allocation in networks via coalitional games

The main goal of this dissertation is to manage resource allocation in network engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces new approaches for resource allocation in Orthogonal Frequency Division Multiple Access (OFDMA) wireless networks and in smart power grids by casting the problems to the coalitional game framework and by providing a constructive iterative algorithm based on dynamic learning theory.  Software Engineering (Software)Algorithms and the Foundations of Software technolog

An Analytical Framework for Heterogeneous Partial Feedback Design in Heterogeneous Multicell OFDMA Networks

The inherent heterogeneous structure resulting from user densities and large scale channel effects motivates heterogeneous partial feedback design in heterogeneous networks. In such emerging networks, a distributed scheduling policy which enjoys multiuser diversity as well as maintains fairness among users is favored for individual user rate enhancement and guarantees. For a system employing the cumulative distribution function based scheduling, which satisfies the two above mentioned desired features, we develop an analytical framework to investigate heterogeneous partial feedback in a general OFDMA-based heterogeneous multicell employing the best-M partial feedback strategy. Exact sum rate analysis is first carried out and closed form expressions are obtained by a novel decomposition of the probability density function of the selected user's signal-to-interference-plus-noise ratio. To draw further insight, we perform asymptotic analysis using extreme value theory to examine the effect of partial feedback on the randomness of multiuser diversity, show the asymptotic optimality of best-1 feedback, and derive an asymptotic approximation for the sum rate in order to determine the minimum required partial feedback.Comment: To appear in IEEE Trans. on Signal Processin