Full-duplex wireless communications: challenges, solutions and future research directions

The family of conventional half-duplex (HD) wireless systems relied on transmitting and receiving in different time-slots or frequency sub-bands. Hence the wireless research community aspires to conceive full-duplex (FD) operation for supporting concurrent transmission and reception in a single time/frequency channel, which would improve the attainable spectral efficiency by a factor of two. The main challenge encountered in implementing an FD wireless device is the large power difference between the self-interference (SI) imposed by the device’s own transmissions and the signal of interest received from a remote source. In this survey, we present a comprehensive list of the potential FD techniques and highlight their pros and cons. We classify the SI cancellation techniques into three categories, namely passive suppression, analog cancellation and digital cancellation, with the advantages and disadvantages of each technique compared. Specifically, we analyse the main impairments (e.g. phase noise, power amplifier nonlinearity as well as in-phase and quadrature-phase (I/Q) imbalance, etc.) that degrading the SI cancellation. We then discuss the FD based Media Access Control (MAC)-layer protocol design for the sake of addressing some of the critical issues, such as the problem of hidden terminals, the resultant end-to-end delay and the high packet loss ratio (PLR) due to network congestion. After elaborating on a variety of physical/MAC-layer techniques, we discuss potential solutions conceived for meeting the challenges imposed by the aforementioned techniques. Furthermore, we also discuss a range of critical issues related to the implementation, performance enhancement and optimization of FD systems, including important topics such as hybrid FD/HD scheme, optimal relay selection and optimal power allocation, etc. Finally, a variety of new directions and open problems associated with FD technology are pointed out. Our hope is that this treatise will stimulate future research efforts in the emerging field of FD communication

Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks

Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay. In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime. Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol. Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices. Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems. In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory

Achievable Rates of Buffer-Aided Full-Duplex Gaussian Relay Channels

We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the application of self-interference mitigation techniques. We investigate both cases of a slow-RSI channel where the RSI is fixed over the entire codeword, and a fast-RSI channel where the RSI changes from one symbol duration to another within the codeword. We show that the RSI can be completely eliminated in the slow-RSI case when the FD relay is equipped with a buffer while the fast RSI cannot be eliminated. For the fixed-rate data transmission scenario, we derive the optimal transmission strategy that should be adopted by the source node and relay node to maximize the system throughput. We verify our analytical findings through simulations. 1 2017 IEEE.The work of N. Al-Dhahir was supported by NPRP from the Qatar National Research Fund (a member of Qatar Foundation) under Grant 8-627-2-260. The statements made herein are solely the responsibility of the authors. The work of I. Krikidis was supported by the Research Promotion Foundation, Cyprus, through the Project COM-MED under Project KOINA/ERANETMED/1114/03.Scopu

D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies

This document provides the most recent updates on the technical contributions and research challenges focused in WP3. Each Technology Component (TeC) has been evaluated under possible uniform assessment framework of WP3 which is based on the simulation guidelines of WP6. The performance assessment is supported by the simulation results which are in their mature and stable state. An update on the Most Promising Technology Approaches (MPTAs) and their associated TeCs is the main focus of this document. Based on the input of all the TeCs in WP3, a consolidated view of WP3 on the role of multinode/multi-antenna transmission technologies in 5G systems has also been provided. This consolidated view is further supported in this document by the presentation of the impact of MPTAs on METIS scenarios and the addressed METIS goals.Aziz, D.; Baracca, P.; De Carvalho, E.; Fantini, R.; Rajatheva, N.; Popovski, P.; Sørensen, JH.... (2015). D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies. http://hdl.handle.net/10251/7675

Energy and computationally efficient resource allocation methods for cellular relay-aided networks with system stability consideration

The increasing demand for coverage extension and power gain, along with the need for decreasing implementation costs, raised the idea of relaying cellular systems. Developing relay stations as a coverage extension and low cost mechanism has also brought up the challenge of utilizing the available network resources cooperatively between base stations and relays. The topic of resource allocation in the downlink of a relaying cellular system is studied in the current dissertation with the objective of maximizing transmission rate, encompassing system stability and managing the interference as it has not been investigated as a comprehensive allocation problem in the previous literature. We begin our study by modeling a single cell downlink transmission system with the objective to enhance the throughput of cell-edge users by employing decode-and-forward relay stations. We study the queue length evolution at each hop and propose a rate control mechanism to stabilize the considered queues. Accordingly, we propose a novel allocation model which maximizes user throughput with respect to the channel condition and the stability requirements. To solve the proposed allocation problem, we introduced optimization algorithm as well as heuristic approaches which offer low computation complexity. Next, we enhance the initial allocation method by considering a multi-cell system that accounts for more general and practical cellular networks. The multi-cell model embodies extra constraints for controlling the interference to the users of neighboring cells. We propose a different set of stability constraints which do not enquire a priori knowledge of the statistics of the arriving traffic. In an approach to improve the energy efficiency while respecting the stability and interference criteria, we also suggest an energy-conservative allocation scheme. We solve the defined allocation problems in a central controlling system. As our final contribution, we enhance the proposed multi-cell allocation model with a low overhead and distributed approach. The proposed method is based on the idea of dividing the resource allocation task between each base station and its connected relay stations. In addition, the messaging overhead for controlling inter-cell interference is minimized using the reference-station method. This distributed approach offers high degree of energy efficiency as well as more scalability in comparison to centralized schemes, when the system consists of larger number of cells and users. Since the defined problems embody multiple variables and constraints, we develop a framework to cast the joint design in the optimization form which gives rise to nonlinear and nonconvex problems. In this regard, we employ time-sharing technique to tackle the combinatorial format of the allocation problem. In addition, it is important to consider the situation that the time-shared approach is not beneficial when subcarriers are not allowed to be shared during one time-slot. To overcome this obstacle, we apply heuristic algorithms as well as convex optimization techniques to obtain exclusive subcarrier allocation schemes. To evaluate the performance of the proposed solutions, we compare them in terms of the achieved throughput, transmitted power, queue stability, feedback overhead, and computation complexity. By the means of extensive simulation scenarios as well as numerical analysis, we demonstrate the remarkable advantages of the suggested approaches. The results of the present dissertation are appealing for designing of future HetNet systems specifically when the communication latency and the energy consumption are required to be minimized

Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems

Nach einer Einleitung behandelt Teil 2 Mehrbenutzer-Scheduling für die Abwärtsstrecke von drahtlosen MIMO Systemen mit einer Sendestation und kanaladaptivem precoding: In jeder Zeit- oder Frequenzressource kann eine andere Nutzergruppe gleichzeitig bedient werden, räumlich getrennt durch unterschiedliche Antennengewichte. Nutzer mit korrelierten Kanälen sollten nicht gleichzeitig bedient werden, da dies die räumliche Trennbarkeit erschwert. Die Summenrate einer Nutzermenge hängt von den Antennengewichten ab, die wiederum von der Nutzerauswahl abhängen. Zur Entkopplung des Problems schlägt diese Arbeit Metriken vor basierend auf einer geschätzten Rate mit ZF precoding. Diese lässt sich mit Hilfe von wiederholten orthogonalen Projektionen abschätzen, wodurch die Berechnung von Antennengewichten beim Scheduling entfällt. Die Ratenschätzung kann basierend auf momentanen Kanalmessungen oder auf gemittelter Kanalkenntnis berechnet werden und es können Datenraten- und Fairness-Kriterien berücksichtig werden. Effiziente Suchalgorithmen werden vorgestellt, die die gesamte Systembandbreite auf einmal bearbeiten können und zur Komplexitätsreduktion die Lösung in Zeit- und Frequenz nachführen können. Teil 3 zeigt wie mehrere Sendestationen koordiniertes Scheduling und kooperative Signalverarbeitung einsetzen können. Mittels orthogonalen Projektionen ist es möglich, Inter-Site Interferenz zu schätzen, ohne Antennengewichte berechnen zu müssen. Durch ein Konzept virtueller Nutzer kann der obige Scheduling-Ansatz auf mehrere Sendestationen und sogar Relays mit SDMA erweitert werden. Auf den benötigten Signalisierungsaufwand wird kurz eingegangen und eine Methode zur Schätzung der Summenrate eines Systems ohne Koordination besprochen. Teil4 entwickelt Optimierungen für Turbo Entzerrer. Diese Nutzen Signalkorrelation als Quelle von Redundanz. Trotzdem kann eine Kombination mit MIMO precoding sinnvoll sein, da bei Annahme realistischer Fehler in der Kanalkenntnis am Sender keine optimale Interferenzunterdrückung möglich ist. Mit Hilfe von EXIT Charts wird eine neuartige Methode zur adaptiven Nutzung von a-priori-Information zwischen Iterationen entwickelt, die die Konvergenz verbessert. Dabei wird gezeigt, wie man semi-blinde Kanalschätzung im EXIT chart berücksichtigen kann. In Computersimulationen werden alle Verfahren basierend auf 4G-Systemparametern überprüft.After an introduction, part 2 of this thesis deals with downlink multi-user scheduling for wireless MIMO systems with one transmitting station performing channel adaptive precoding:Different user subsets can be served in each time or frequency resource by separating them in space with different antenna weight vectors. Users with correlated channel matrices should not be served jointly since correlation impairs the spatial separability.The resulting sum rate for each user subset depends on the precoding weights, which in turn depend on the user subset. This thesis manages to decouple this problem by proposing a scheduling metric based on the rate with ZF precoding such as BD, written with the help of orthogonal projection matrices. It allows estimating rates without computing any antenna weights by using a repeated projection approximation.This rate estimate allows considering user rate requirements and fairness criteria and can work with either instantaneous or long term averaged channel knowledge.Search algorithms are presented to efficiently solve user grouping or selection problems jointly for the entire system bandwidth while being able to track the solution in time and frequency for complexity reduction. Part 3 shows how multiple transmitting stations can benefit from cooperative scheduling or joint signal processing. An orthogonal projection based estimate of the inter-site interference power, again without computing any antenna weights, and a virtual user concept extends the scheduling approach to cooperative base stations and finally included SDMA half-duplex relays in the scheduling.Signalling overhead is discussed and a method to estimate the sum rate without coordination. Part 4 presents optimizations for Turbo Equalizers. There, correlation between user signals can be exploited as a source of redundancy. Nevertheless a combination with transmit precoding which aims at reducing correlation can be beneficial when the channel knowledge at the transmitter contains a realistic error, leading to increased correlation. A novel method for adaptive re-use of a-priori information between is developed to increase convergence by tracking the iterations online with EXIT charts.A method is proposed to model semi-blind channel estimation updates in an EXIT chart. Computer simulations with 4G system parameters illustrate the methods using realistic channel models.Im Buchhandel erhältlich: Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems / Fuchs-Lautensack,Martin Ilmenau: ISLE, 2009,116 S. ISBN 978-3-938843-43-

Modified quasi-orthogonal space-time block coding in distributed wireless networks

Cooperative networks have developed as a useful technique that can achieve the same advantage as multi-input and multi-output (MIMO) wireless systems such as spatial diversity, whilst resolving the difficulties of co-located multiple antennas at individual nodes and avoiding the effect of path-loss and shadowing. Spatial diversity in cooperative networks is known as cooperative diversity, and can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission and outage. In this thesis, therefore, firstly, a modified distributed quasi-orthogonal space-time block coding (M-D-QO-STBC) scheme with increased code gain distance (CGD) for one-way and two-way amplify-and-forward wireless relay networks is proposed. This modified code is designed from set partitioning a larger codebook formed from two quasi-orthogonal space time block codes with different signal rotations then the subcodes are combined and pruned to arrive at the modified codebook with the desired rate in order to increase the CGD. Moreover, for higher rate codes the code distance is maximized by using a genetic algorithm to search for the optimum rotation matrix. This scheme has very good performance and significant coding gain over existing codes such as the open-loop and closed-loop QO-STBC schemes. In addition, the topic of outage probability analysis in the context of multi-relay selection from $N$ available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the $N^{th}$ relay selection and best four relay selection in two-way amplify-and-forward cooperative relay networks. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. Furthermore, in this thesis, robust schemes for cooperative relays based on the M-D-QO-STBC scheme for both one-way and two-way asynchronous cooperative relay networks are considered to overcome the issue of a synchronism in wireless cooperative relay networks. In particular, an orthogonal frequency division multiplexing (OFDM) data structure is employed with cyclic prefix (CP) insertion at the source in the one-way cooperative relay network and at the two terminal nodes in the two-way cooperative network to combat the effects of time asynchronism. As such, this technique can effectively cope with the effects of timing errors. Finally, outage probability performance of a proposed amplify-and-forward cooperative cognitive relay network is evaluated and the cognitive relays are assumed to exploit an overlay approach. A closed form expression for the outage probability for multi-relay selection cooperation over Rayleigh frequency flat fading channels is derived for perfect and imperfect spectrum acquisitions. Furthermore, the M-QO-STBC scheme is also proposed for use in wireless cognitive relay networks. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods

Full duplex-transceivers : architectures and performance analysis

PhD ThesisThe revolution of the 5G communication systems will result in 10,000 times increase in the total mobile broadband traffic in the 2020s, which will increase the demand on the limited wireless spectrum. This has highlighted the need for an efficient frequency-reuse technique that can meet the ever-increasing demand on the available frequency resources. In-band full-duplex (FD) wireless technology that enables the transceiver nodes to transmit and receive simultaneously over the same frequency band, has gained tremendous attention as a promising technology to double the spectral efficiency of the traditional half-duplex (HD) systems. However, this technology faces a formidable challenge, that is the large power difference between the self-interference (SI) signal and the signal of interest from a remote transceiver node. In this thesis, we focus on the architecture of the FD transceivers and investigate their ability to approximately double the throughput and the spectral efficiency of the conventional HD systems. Moreover, this thesis is concerned with the design of efficient self-interference cancellation schemes that can be combined with the architecture of the FD transceiver nodes in order to effectively suppress the SI signal and enable the FD mode. In particular, an orthogonal frequency-division multiplexing (OFDM) based amplify-and-forward (AF) FD physical-layer network coding (PLNC) system is proposed. To enable the FD mode in the proposed system, a hybrid SIC scheme that is a combination of passive SIC mechanism and active SIC technique is exploited at each transceiver node of that system. Next, we propose an adaptive SIC scheme, which utilizes the normalized least-mean-square (NLMS) algorithm to effectively suppress the SI signal to the level of the noise floor. The proposed adaptive SIC is then utilized in a denoise-and-forward (DNF) FD-PLNC system to enable the FD mode. Finally, we introduce a novel overthe- air SIC scheme that can effectively mitigate the SI signal before it arrives the local analog-to-digital converter (ADC) of the FD transceiver nodes. Furthermore, the impact of the hardware impairments on the performance of the introduced SIC scheme is examined and characterized.Iraq, and the Ministry of Higher Education and Scientific Research (MOHSR