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

Distributed transmission schemes for wireless communication networks

In this thesis new techniques are presented to achieve performance enhancement in wireless cooperative networks. In particular, techniques to improve transmission rate and maximise end-to-end signal-to-noise ratio are described. An offset transmission scheme with full interference cancellation for a wireless cooperative network with frequency flat links and four relays is introduced. This method can asymptotically, as the size of the symbol block 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 for which the destination node only requires a single antenna. Two- and four-relay selection schemes for wireless 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 relay to destination node links. Outage probability analysis for a four-relay selection scheme without interference is undertaken. Outage probability analysis of a full rate distributed transmission scheme with inter-relay interference is also studied for best single- and two-relay selection networks. The advantage of multi-relay selection when no interference occurs and when adjacent cell interference is present at the relay nodes is then shown theoretically. Simulation results for outage probability analysis 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 best single-, two- and four-relay selection is presented. The cognitive amplify and forward relays are assumed to exploit an underlay approach, which requires adherence to an interference constraint on the primary user. The relay selection scheme is performed either with a max−min strategy or one based on maximising exact end-to-end signal-to-noise ratio. The outage probability analyses are again confirmed by numerical evaluations

Esquemas distribuídos para seleção de múltiplas antenas em redes com retransmissores do tipo amplifica-e-encaminha

Orientador: José Cândido Silveira Santos FilhoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: A seleção de antena na transmissão tem sido apresentada como uma estratégia promissora para explorar os benefícios do uso de múltiplas antenas em sistemas de comunicações com retransmissores. No entanto, essa abordagem pode exigir um montante considerável de estimações de canal, transmissões de realimentação e atraso, dado que a sua implementação ótima e centralizada requer o monitoramento do estado do canal de todos os enlaces. Para aliviar essas deficiências, este trabalho propõe e analisa um conjunto de esquemas subótimos de seleção de antena na transmissão para sistemas com retransmissores do tipo amplifica-e-encaminha, os quais podem ser implementados de uma forma distribuída. Nos esquemas propostos, a antena é selecionada com base na informação local do estado de canal que está disponível na fonte, requerendo, portanto, um atraso e uma carga de realimentação pequenos e constantes. Tal abordagem é considerada em uso conjunto com diferentes técnicas, incluindo métodos de combinação de diversidade (combinação por máxima razão e combinação por seleção) no destino, protocolos de ganho fixo ou variável no relay, e transceptores com múltiplas antenas no relay. Além disso, para o caso particular em que o retransmissor tem ganho fixo e uma única antena, considera-se também o uso de um mecanismo de seleção de enlace na fonte. Para cada caso, o desempenho do sistema é avaliado em termos de probabilidade de outage, eficiência espectral e/ou vazão. O foco principal é direcionado à probabilidade de outage, para a qual são deduzidas expressões exatas e limitantes de desempenho. Uma análise assintótica é também efetuada para enriquecer a compreensão do comportamento do sistema quando operando sob alta relação sinal-ruído. Finalmente, como contribuição isolada, uma estratégia subótima e simples de alocação de potência é elaborada para um sistema com múltiplos retransmissores do tipo decodifica-e-encaminha, considerando-se enlaces com erros e codificação de fonte distribuídaAbstract: Transmit-antenna selection has been presented as a promising strategy for exploiting the benefits of multiple antennas in relaying communication systems. However, this approach may demand a considerable amount of channel estimations, feedback transmissions, and delay, since its optimal centralized implementation requires monitoring the channel state of all links. To alleviate those impairments, this work proposes and analyzes a set of suboptimal transmit-antenna selection schemes for amplify-and-forward relaying systems, which can be implemented in a distributed manner. In the proposed schemes, the antenna is selected based on the local channel-state information that is available at the source, thus requiring a low and constant delay/feedback overhead. Such an approach is considered along with different techniques, including diversity combining methods (maximal-ratio combining and selection combining) at the destination, fixed- and variable-gain protocols at the relay, and multi-antenna transceivers at the relay. A link-selection mechanism at the source is also considered for the special case of a single-antenna fixed-gain relay. For each case, the system performance is assessed in terms of outage probability, spectral efficiency, and/or throughput. The main focus is placed on the outage probability, for which exact or bound expressions are derived. An asymptotic analysis is also performed to provide further insights into the system behavior at high signal-to-noise ratio. Finally, as an isolated contribution, a simple suboptimal power allocation strategy is designed for a decode-and-forward multi-relay system with lossy intra-links and distributed source codingDoutoradoTelecomunicações e TelemáticaDoutora em Engenharia ElétricaCAPE

Multiterminal Source-Channel Coding

Cooperative communication is seen as a key concept to achieve ultra-reliable communication in upcoming fifth-generation mobile networks (5G). A promising cooperative communication concept is multiterminal source-channel coding, which attracted recent attention in the research community. This thesis lays theoretical foundations for understanding the performance of multiterminal source-channel codes in a vast variety of cooperative communication networks. To this end, we decouple the multiterminal source-channel code into a multiterminal source code and multiple point-to-point channel codes. This way, we are able to adjust the multiterminal source code to any cooperative communication network without modification of the channel codes. We analyse the performance in terms of the outage probability in two steps: at first, we evaluate the instantaneous performance of the multiterminal source-channel codes for fixed channel realizations; and secondly, we average the instantaneous performance over the fading process. Based on the performance analysis, we evaluate the performance of multiterminal source-channel codes in three cooperative communication networks, namely relay, wireless sensor, and multi-connectivity networks. For all three networks, we identify the corresponding multiterminal source code and analyse its performance by the rate region for binary memoryless sources. Based on the rate region, we derive the outage probability for additive white Gaussian noise channels with quasi-static Rayleigh fading. We find results for the exact outage probability in integral form and closed-form solutions for the asymptotic outage probability at high signal-to-noise ratio. The importance of our results is fourfold: (i) we give the ultimate performance limits of the cooperative communication networks under investigation; (ii) the optimality of practical schemes can be evaluated with respect to our results, (iii) our results are suitable for link-level abstraction which reduces complexity in network-level simulation; and (iv) our results demonstrate that all three cooperative communication networks are key technologies to enable 5G applications, such as device to device and machine to machine communications, internet of things, and internet of vehicles. In addition, we evaluate the performance improvement of multiterminal source-channel codes over other (non-)cooperative communications concepts in terms of the transmit power reduction given a certain outage probability level. Moreover, we compare our theoretical results to simulated frame-error-rates of practical coding schemes. Our results manifest the superiority of multiterminal source-channel codes over other (non-)cooperative communications concepts

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

Exploiting Diversity in Broadband Wireless Relay Networks

Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds

Performance Analysis, Resource Allocation and Optimization of Cooperative Communication Systems under Generalized Fading Channels

The increasing demands for high-speed data transmission, efficient wireless access, high quality of service (QoS) and reliable network coverage with reduced power consumption impose demanding intensive research efforts on the design of novel wireless communication system architectures. A notable development in the area of communication theory is the introduction of cooperative communication systems. These technologies become promising solution for the next-generation wireless transmission systems due to their applicability in size, power, hardware and price constrained devices, such as cellular mobile devices, wireless sensors, ad-hoc networks and military communications, being able to provide, e.g., diversity gain against fading channels without the need for installing multiple antennas in a single terminal. The performance of the cooperative systems can in general be significantly increased by allocating the limited power efficiently. In this thesis, we address in detail the performance analysis, resource allocation and optimization of such cooperative communication systems under generalized fading channels. We focus first on energy-efficiency (EE) optimization and optimal power allocation (OPA) of regenerative cooperative network with spatial correlation effects under given power constraint and QoS requirement. The thesis also investigates the end-to-end performance and power allocation of a regenerative multi-relay cooperative network over non-homogeneous scattering environment, which is realistic case in practical wireless communication scenarios. Furthermore, the study investigates the end-to-end performance, OPA and energy optimization analysis under total power constraint and performance requirement of full-duplex (FD) relaying transmission scheme over asymmetric generalized fading models with relay self-interference (SI) effects.The study first focuses on exact error analysis and EE optimization of regenerative relay systems under spatial correlation effects. It first derives novel exact and asymptotic expressions for the symbol-error-rates (SERs) of M -ary quadrature amplitude and M -ary phase-shift keying (M -QAM) and (M -PSK) modulations, respectively, assuming a dual-hop decode-and-forward relay system, spatial correlation, path-loss effects and maximum-ratio-combing (MRC) at the destination. Based on this, EEoptimization and OPA are carried out under certain QoS requirement and transmit power constraints.Furthermore, the second part of the study investigates the end-to-end performance and power allocation of MRC based regenerative multi-relay cooperative system over non-homogeneous scattering environment. Novel exact and asymptotic expressions are derived for the end-to-end average SER for M -QAM and M -PSK modulations.The offered results are employed in performance investigations and power allocation formulations under total transmit power constraints.Finally, the thesis investigates outage performance, OPA and energy optimization analysis under certain system constraints for the FD and half-duplex (HD) relaying systems. Unlike the previous studies that considered the scenario of information transmission over symmetric fading conditions, in this study we considered the scenario of information transmission over the most generalized asymmetric fading environments.The obtained results indicate that depending on the severity of multipath fading, the spatial correlation between the direct and relayed paths and the relay location, the direct transmission is more energy-efficient only for rather short transmission distances and until a certain threshold. Beyond this, the system benefits substantially from the cooperative transmission approach where the cooperation gain increases as the transmission distance increases. Furthermore, the investigations on the power allocation for the multi-relay system over the generalized small-scale fading model show that substantial performance gain can be achieved by the proposed power allocation scheme over the conventional equal power allocation (EPA) scheme when the source-relay and relay-destination paths are highly unbalanced. Extensive studies on the FD relay system also show that OPA provides significant performance gain over the EPA scheme when the relay SI level is relatively strong. In addition, it is shown that the FD relaying scheme is more energy-efficient than the reference HD relaying scheme at long transmission distances and for moderate relay SI levels.In general, the investigations in this thesis provide tools, results and useful insights for implementing space-efficient, low-cost and energy-efficient cooperative networks, specifically, towards the future green communication era where the optimization of the scarce resources is critical

Cooperative Wireless Systems

This Ph.D. dissertation reports on the work performed at the Wireless Communication Laboratory - University of Bologna and National Research Council - as well as, for six months, at the Fraunhofer Institute for Integrated Circuit (IIS) in Nürnberg. The work of this thesis is in the area of wireless communications, especially with regards to cooperative communications aspects in narrow-band and ultra-wideband systems, cooperative links characterization, network geometry, power allocation techniques,and synchronization between nodes. The underpinning of this work is devoted to developing a general framework for design and analysis of wireless cooperative communication systems, which depends on propagation environment, transmission technique, diversity method, power allocation for various scenarios and relay positions. The optimal power allocation for minimizing the bit error probability at the destination is derived. In addition, a syncronization algorithm for master-slave communications is proposed with the aim of jointly compensate the clock drift and offset of wireless nodes composing the network

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

Characterisation and performance analysis of random linear network coding for reliable and secure communication

In this thesis, we develop theoretical frameworks to characterize the performance of Random Linear Network Coding (RLNC), and propose novel communication schemes for the achievement of both reliability and security in wireless networks. In particular, (i) we present an analytical model to evaluate the performance of practical RLNC schemes suitable for low-complexity receivers, prioritized (i.e., layered) coding and multi-hop communications, (ii) investigate the performance of RLNC in relay assisted networks and propose a new cross-layer RLNC-aided cooperative scheme for reliable communication, (iii) characterize the secrecy feature of RLNC and propose a new physical-application layer security technique for the purpose of achieving security and reliability in multi-hope communications. At first, we investigate random block matrices and derive mathematical expressions for the enumeration of full-rank matrices that contain blocks of random entries arranged in a diagonal, lower-triangular or tri-diagonal structure. The derived expressions are then used to model the probability that a receiver will successfully decode a source message or layers of a service, when RLNC based on non-overlapping, expanding or sliding generations is employed. Moreover, the design parameters of these schemes allow to adjust the desired decoding performance. Next, we evaluate the performance of Random Linear Network Coded Cooperation (RLNCC) in relay assisted networks, and propose a cross-layer cooperative scheme which combines the emerging Non-Orthogonal Multiple Access (NOMA) technique and RLNCC. In this regard, we first consider the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node. Secondly, we consider a multi-source multi-relay network, in which relay nodes employ RLNC on source packets and generate coded packets. For each network, we build our analysis on fundamental probability expressions for random matrices over finite fields and we derive theoretical expressions of the probability that the destination node will successfully decode the source packets. Finally, we consider a multi-relay network comprising of two groups of source nodes, where each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using RLNC. An analytical framework that characterizes the performance of the proposed scheme is developed, and benchmarked against a counterpart scheme that is based on orthogonal multiple access. Finally, we quantify and characterize the intrinsic security feature of RLNC and design a joint physical-application layer security technique. For this purpose, we first consider a network comprising a transmitter, which employs RLNC to encode a message, a legitimate receiver, and a passive eavesdropper. Closed-form analytical expressions are derived to evaluate the intercept probability of RLNC, and a resource allocation model is presented to further minimize the intercept probability. Afterward, we propose a joint RLNC and opportunistic relaying scheme in a multi relay network to transmit confi- dential data to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper’s channel state information or the possibility to pair the selected relay with a jammer node that intentionally generates interference. For each case, expressions of the probability that a coded packet will not be decoded by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully decoding the confidential data. We observe that the field size over which RLNC is performed at the application layer as well as the adopted modulation and coding scheme at the physical layer can be modified to fine-tune the trade-off between security and reliability