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

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

Bandwidth allocation in cooperative wireless networks: Buffer load analysis and fairness evaluation.

In modern cooperative wireless networks, the resource allocation is an issue of major significance. The cooperation of source and relay nodes in wireless networks towards improved performance and robustness requires the application of an efficient bandwidth sharing policy. Moreover, user requirements for multimedia content over wireless links necessitate the support of advanced Quality of Service (QoS) features. In this paper, a novel bandwidth allocation technique for cooperative wireless networks is proposed, which is able to satisfy the increased QoS requirements of network users taking into account both traffic priority and packet buffer load. The performance of the proposed scheme is examined by analyzing the impact of buffer load on bandwidth allocation. Moreover, fairness performance in resource sharing is also studied. The results obtained for the cooperative network scenario employed, are validated by simulations. Evidently, the improved performance achieved by the proposed technique indicates that it can be employed for efficient traffic differentiation. The flexible design architecture of the proposed technique indicates its capability to be integrated into Medium Access Control (MAC) protocols for cooperative wireless networks

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

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

Adaptive frame structure and OFDMA resource allocation in mobile multi-hop relay networks

The objective of this thesis research is to optimize network throughput and fairness, and enhance bandwidth utilization in wireless mobile multi-hop relay (MMR) networks. To enhance bandwidth utilization, we propose an adaptive OFDMA frame structure which is used by the base station and the non-transparent relay stations. To optimize throughput and fairness, we develop an adaptive OFDMA allocation algorithm by using the proposed adaptive OFDMA frame. The effectiveness of the proposed schemes has been verified by numeric simulations. Providing ubiquitous coverage with wireless metropolitan area networks (WMANs) can be costly, especially in sparsely populated areas. In this scenario, cheaper relay stations (RSs) can be used to provide coverage instead of expensive base stations (BSs). The RS extends the coverage area of traditional BSs. This sort of network is known as a wireless MMR network. This thesis focuses on MMR networks that use orthogonal frequency division multiple access (OFDMA) and time division duplex (TDD) as a multiple access scheme and a duplex communication technique (e.g., WiMAX). The use of OFDMA resources (e.g., OFDMA symbols and subcarriers) and how they are shared in current schemes can reduce system capacity and network throughput in certain scenarios. To increase the capacity of the MMR network, we propose a new protocol that uses an adaptive OFDMA frame structure for BSs and RSs. We also propose adaptive OFDMA resource allocation for subscriber stations (SSs) within a BS or RS. We derive the maximum OFDMA resources that RSs can be assigned and synchronize access zones and relay zones between a superior station and its subordinate RSs. This is bounded by three properties defined in this thesis: a data relay property, a maximum balance property, and a relay zone limitation property. Finally, we propose max-min and proportional fairness schemes that use the proposed adaptive frame structure. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. We evaluate our scheme using simulations and numerical analysis. Results show that our technique improves resource allocation in wireless MMR networks. Further, in asymmetric distributions of SSs between access zones and relay zones, the proposed OFDMA allocation scheme performs two times better than the non-adaptive allocation scheme in terms of average max-min fairness and 70% better in terms of average throughput.Ph.D.Committee Chair: Dr. John A. Copeland; Committee Member: Dr. George F. Riley; Committee Member: Dr. Henry L. Owen; Committee Member: Dr. Mary Ann Ingram; Committee Member: Dr. Patrick Trayno

Spectrum- and Energy-Efficient Radio Resource Allocation for Wireless Communications

Wireless communications has been evolved significantly over the last decade. During this period, higher quality of service (QoS) requirements have been proposed to support various services. In addition, due to the increasing number of wireless devices and transmission, the energy consumption of the wireless networks becomes a burden. Therefore, the energy efficiency is considered as important as spectrum efficiency for future wireless communications networks, and spectrum and energy efficiency have become essential research topics in wireless communications. Moreover, due to the exploding of number mobile devices, the limited radio resources have become more and more scarce. With large numbers of users and various QoS requirements, a lot of wireless communications networks and techniques have emerged and how to effectively manage the limited radio resources become much more important. In this dissertation, we focus our research on spectrum- and energy-efficient resource allocation schemes in wireless communication networks. Recently, heterogeneous networks (HetNets) have been proposed and studied to improve the spectrum efficiency. In a two-tier heterogeneous network, small base stations reuse the same spectrum with macro base stations in order to support more transmission over the limited frequency bands. We design a cascaded precoding scheme considering both interference cancellation and power allocation for the two-tier heterogeneous network. Besides heterogeneous networks, as the fast development of intelligent transportation, we study the spectrum- and energy-efficient resource allocation in vehicular communication networks. The intelligent transportation and vehicular communications both have drawn much attention and are faced special wireless environment, which includes Doppler effects and severe uncertainties in channel estimation. A novel designed spectrum efficiency scheme is studied and verified. With consideration of energy efficiency, the device-to-device (D2D) enabled wireless network is an effective network structure to increase the usage of spectrum. From a device\u27s perspective, we design an energy-efficient resource allocation scheme in D2D communication networks. To improve the energy efficiency of wireless communication networks, energy harvesting technique is a powerful way. Recently, the simultaneous wireless information and power transfer (SWIPT) has been proposed as a promising energy harvesting method for wireless communication networks, based on which we derive an energy-efficient resource allocation scheme for SWIPT cooperative networks, which considers both the power and relay allocation. In addition to the schemes derivation for spectrum- and energy-efficient resource allocation, simulation results and the proofs of the proposed propositions are provided for the completeness of this dissertation