Cooperative diversity techniques for future wireless communications systems.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2013.Multiple-input multiple-output (MIMO) systems have been extensively studied in the past decade. The attractiveness of MIMO systems is due to the fact that they drastically reduce the deleterious e ects of multipath fading leading to high system capacity and low error rates. In situations where wireless devices are restrained by their size and hardware complexity, such as mobile phones, transmit diversity is not achievable. A new paradigm called cooperative communication is a viable solution. In a cooperative scenario, a single-antenna device is assisted by another single-antenna device to relay its message to the destination or base station. This creates a virtual multiple-input multiple-output (MIMO) system. There exist two cooperative strategies: amplify-and-forward (AF) and decode-and-forward (DF). In the former, the relay ampli es the noisy signal received from the source before forwarding it to the destination. No form of demodulation is required. In the latter, the relay rst decodes the source signal before transmitting an estimate to the destination. In this work, focus is on the DF method. A drawback of an uncoded DF cooperative strategy is error propagation at the relay. To avoid error propagation in DF, various relay selection schemes can be used. Coded cooperation can also be used to avoid error propagation at the relay. Various error correcting codes such as convolutional codes or turbo codes can be used in a cooperative scenario. The rst part of this work studies a variation of the turbo codes in cooperative diversity, that further reduces error propagation at the relay, hence lowering the end-to-end error rate. The union bounds on the bit-error rate (BER) of the proposed scheme are derived using the pairwise error probability via the transfer bounds and limit-before-average techniques. In addition, the outage analysis of the proposed scheme is presented. Simulation results of the bit error and outage probabilities are presented to corroborate the analytical work. In the case of outage probability, the computer simulation results are in good agreement with the the analytical framework presented in this chapter. Recently, most studies have focused on cross-layer design of cooperative diversity at the physical layer and truncated automatic-repeat request (ARQ) at the data-link layer using the system throughput as the performance metric. Various throughput optimization strategies have been investigated. In this work, a cross-relay selection approach that maximizes the system throughput is presented. The cooperative network is comprised of a set of relays and the reliable relay(s) that maximize the throughput at the data-link layer are selected to assist the source. It can be shown through simulation that this novel scheme outperforms from a throughput point of view, a system throughput where the all the reliable relays always participate in forwarding the source packet. A power optimization of the best relay uncoded DF cooperative diversity is investigated. This optimization aims at maximizing the system throughput. Because of the non-concavity and non-convexity of the throughput expression, it is intractable to derive a closed-form expression of the optimal power through the system throughput. However, this can be done via the symbol-error rate (SER) optimization, since it is shown that minimizing the SER of the cooperative system is equivalent to maximizing the system throughput. The SER of the retransmission scheme at high signal-to-noise ratio (SNR) was obtained and it was noted that the derived SER is in perfect agreement with the simulated SER at high SNR. Moreover, the optimal power allocation obtained under a general optimization problem, yields a throughput performance that is superior to non-optimized power values from moderate to high SNRs. The last part of the work considers the throughput maximization of the multi-relay adaptive DF over independent and non-identically distributed (i.n.i.d.) Rayleigh fading channels, that integrates ARQ at the link layer. The aim of this chapter is to maximize the system throughput via power optimization and it is shown that this can be done by minimizing the SER of the retransmission. Firstly, the closed-form expressions for the exact SER of the multi-relay adaptive DF are derived as well as their corresponding asymptotic bounds. Results showed that the optimal power distribution yields maximum throughput. Furthermore, the power allocated at a relay is greatly dependent of its location relative to the source and destination

Distributed Space-Time Message Relaying for Uncoded/Coded Wireless Cooperative Communications

During wireless communications, nodes can overhear other transmissions through the wireless medium, suggested by the broadcast nature of plane wave propagation, and may help to provide extra observations of the source signals to the destination. Modern research in wireless communications pays more attention to these extra observations which were formerly neglected within networks. Cooperative communication processes this abundant information existing at the surrounding nodes and retransmits towards the destination in various forms to create spatial and/or coding diversity, thereby to obtain higher throughput and reliability. The aim of this work is to design cooperative communication systems with distributed space-time block codes (DSTBC) in different relaying protocols and theoretically derive the BER performance for each scenario. The amplify-and-forward (AF) protocol is one of the most commonly used protocols at the relays. It has a low implementation complexity but with a drawback of amplifying the noise as well. We establish the derivation of the exact one-integral expression of the average BER performance of this system, folloby a novel approximation method based on the series expansion. An emerging technology, soft decode-and-forward (SDF), has been presented to combine the desired features of AF and DF: soft signal representation in AF and channel coding gain in DF. In the SDF protocol, after decoding, relays transmit the soft-information, which represents the reliability of symbols passed by the decoder, to the destination. Instead of keeping the source node idling when the relays transmit as in the traditional SDF system, we let the source transmit hard information and cooperate with the relays using DSTBC. By theoretically deriving the detection performance at the destination by either using or not using the DSTBC, we make comparisons among three SDF systems. Interesting results have been shown, together with Monte-Carlo simulations, to illustrate that our proposed one-relay and two-relay SDF & DSTBC systems outperform traditional soft relaying for most of the cases. Finally, these analytic results also provide a way to implement the optimal power allocation between the source and the relay or between relays, which is illustrated in the line model

Performance of Relaying Protocols

In wireless systems, cooperative diversity and relaying can exploit the benefit of spatial diversity and combat heavy pathloss without requiring multiple antennas at the receivers and transmitters. For practical networks, the use of relays is motivated by the need for simple, inexpensive terminals with limited power and a single antenna. The motivation for this thesis is to study and propose practical relaying protocols that can reduce the power consumption and ameliorate the performance with minimum additional complexity. Based on a dual-hop communication model, we exploit two upper bounds for the end-to-end SNR. These bounds further inspire us to propose new relaying protocols for wireless communication systems. We examine the case of a single user and relay under Rayleigh and Nakagami-m fading conditions. Based on the general upper bound, a new protocol is introduced: Clipped gain. This protocol makes it possible to save the transmit power by stopping the transmission when the quality of the first hop leads to an outage. We consider also user selection and user scheduling for dual-hop communication with multiple users and relays over a Rayleigh fading channel. We introduce new scheduling protocols based on one-bit feedback information. To the best of our knowledge, most of the available literature uses full channel state information to perform user selection and user scheduling. Interestingly, our protocols based on one bit feedback greatly improve the system performance while adding less additional complexity. To carry out rigorous comparison, close-form expressions are derived and analytical results used to assess the outage probability performance

A Tutorial on Nonorthogonal Multiple Access for 5G and Beyond

Today's wireless networks allocate radio resources to users based on the orthogonal multiple access (OMA) principle. However, as the number of users increases, OMA based approaches may not meet the stringent emerging requirements including very high spectral efficiency, very low latency, and massive device connectivity. Nonorthogonal multiple access (NOMA) principle emerges as a solution to improve the spectral efficiency while allowing some degree of multiple access interference at receivers. In this tutorial style paper, we target providing a unified model for NOMA, including uplink and downlink transmissions, along with the extensions tomultiple inputmultiple output and cooperative communication scenarios. Through numerical examples, we compare the performances of OMA and NOMA networks. Implementation aspects and open issues are also detailed.Comment: 25 pages, 10 figure

Rate enhancement and multi-relay selection schemes for application in wireless cooperative networks

In this thesis new methods are presented to achieve performance enhancement in wireless cooperative networks. In particular, techniques to improve transmission rate, mitigate asynchronous transmission and maximise end-to-end signal-to-noise ratio are described. An offset transmission scheme with full interference cancellation for a two-hop synchronous network with frequency flat links and four relays is introduced. This approach can asymptotically, as the symbol block size increases, achieve maximum transmission rate together with full cooperative diversity provided the destination node has multiple antennas. A novel full inter-relay interference cancellation method that also achieves asymptotically maximum rate and full cooperative diversity is then designed which only requires a single antenna at the destination node. Extension to asynchronous networks is then considered through the use of orthogonal frequency division multiplexing (OFDM) type transmission with a cyclic prefix, and interference cancellation techniques are designed for situations when synchronization errors are present in only the second hop or both the first and second hop. End-to-end bit error rate evaluations, with and without outer coding, are used to assess the performance of the various offset transmission schemes. Multi-relay selection methods for cooperative amplify and forward type networks are then studied in order to overcome the degradation of end-to-end bit error rate performance in single-relay selection networks when there are feedback errors in the destination to relay node links. Outage probability analysis for two and four relay selection is performed to show the advantage of multi-relay selection when no interference occurs and when adjacent cell interference is present both at the relay nodes and the destination node. Simulation studies are included which support the theoretical expressions. Finally, outage probability analysis of a cognitive amplify and forward type relay network with cooperation between certain secondary users, chosen by single and multi-relay (two and four) selection is presented. The cognitive relays are assumed to exploit an underlay approach, which requires adherence to an interference constraint on the primary user. The relay selection is performed either with a max-min strategy or one based on maximising exact end-to-end signal-to-noise ratio. The analyses are again confirmed by numerical evaluations

Resource Allocation in Relay Networks

Demand for high data rates is increasing rapidly, due to the rapid rise of mobile data traffic volume. In order to meet the demands, the future generation of wireless communication systems has to support higher data rates and quality of service. The inherent unreliable and unpredictable nature of wireless medium provides a challenge for increasing the data rate. Cooperative communications, is a prominent technique to combat the detrimental fading effect in wireless communications. Adding relay nodes to the network, and creating s virtual multiple-input multiple-output (MIMO) antenna array is proven to be an efficient method to mitigate the multipath fading and expand the network coverage. Therefore, cooperative relaying is considered as a fundamental element in the Long Term Evolution (LTE)-Advanced standard. In this thesis, we address the problem of resource allocation in cooperative networks. We provide a detailed review on the resource allocation problem. We look at the joint subcarrier-relay assignment and power allocation. The objective of this optimization problem is to allocate the resources fairly, so even the cell-edge users with weakest communication links receive a fair share of resources. We propose a simple and practical algorithm to find the optimal solution. We assess the performance of the proposed algorithm by providing simulations. Furthermore, we investigate the optimality and complexity of the proposed algorithm. Due to the layered architecture of the wireless networks, to achieve the optimal performance it is necessary that the design of the algorithms be based on the underlying physical and link layers. For a cooperative network with correlated channels, we propose a cross-layer algorithm for relay selection, based on both the physical and link-layer characteristics, in order to maximize the linklayer throughput. The performance of the proposed algorithm is studied in different network models. Furthermore, we investigate the optimum number of relays required for cooperation in order to achieve maximum throughput. Buffering has proven to improve the performance of the cooperative network. In light of this, we study the performance of buffer-aided relay selection. In order to move one step closer to the practical applications, we consider a system with coded transmissions. We study three different coding schemes: convolutional code, Turbo code, and distributed Turbo code (DTC). For each scheme, the performance of the system is simulated and assessed analytically. We derive a closed form expression of the average throughput. Using the analysis results, we investigate the diversity gain of the system in asymptotic conditions. Further, we investigate the average transmission delay for different schemes

Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence

Cascade decode-and-forward : spatial diversity reuse in sensor networks

In this paper, we consider a wireless sensor network that involves sensory data hoping through multiple wireless relays to reach a central collection hub. In particular we improve the decode-and-forward cooperative relaying scheme. In this paper, we propose the Cascade-Decode-and-Forward, where the number of successful relays increases with each additional cooperation stage. The achieved effect is a cascade of relays that contribute towards achieving full spatial diversity at the destination. A novel relationship between the achievable bit error rate and delay is derived for the proposed scheme. The results show that a small delay constraint relaxation, the proposed scheme can achieve full diversity. As the delay constraint relaxes further, the protocol can achieve full diversity at signals levels 10–100 orders magnitude lower than the decode-and-forward protocol. The proposed protocol can dynamically trade-off transmission reliability with delay and the analysis has shown that a certain node connectivity density is required to achieve a cascading cooperation chain with an arbitrarily low data extinction probability