Enhancing diversity and multiplexing gains in multi-user wireless relay systems

The demand for higher transmission rates and better quality of service in modern wireless communications is endless. The use of multiple transmit or /and receive antennas has been considered as one of the most powerful approaches to facilitate high -speed and high -quality communications. However, in practical cellular systems, mobile terminals may not be able to support a multiple- antenna setup. Thus an emerging technique called cooperative diversity is under consideration to utilize the multi -hop relay concept to realize the advantages of multiple - antenna systems in multi -user single- antenna networks. Cooperative diversity has attracted much interest in recent years as a very promising direction for future wireless communication evolution.Due to the fact that in practice terminals cannot transmit and receive simultaneously (i.e. the half -duplex limitation), the diversity improvement brought by the standard cooperative diversity transmission protocols is in general accompanied by a multiplexing loss (equivalent to a reduction in transmission data rate in high signal -to -nose ratio (SNR)). The purpose of this thesis is to use advanced transmission protocols to provide both good diversity and multiplexing performance when using the practical repetition -coded decode - and -forward (DF) relaying strategy in uplink mobile -to -base station transmission of cellular systems.The task is fulfilled by relaxing the orthogonal channel allocation requirement of the standard protocols and by using two relays to take turns forwarding source information to destination. We start our analysis from an M- source two -relay one -destination network. Through diversity -multiplexing tradeoff (DMT) analysis, we prove that for an isolated -relay scenario and a strong -interference scenario, the considered approach effectively recovers the multiplexing loss induced by the standard protocols while still obtaining diversity improvement over direct source -destination transmission without considering relaying.In addition, since the optimal multiplexing gain of the considered system can be achieved by the above approach, we study further improving diversity performance for a two -source network. We analyze taking full advantage of the multiple- source structure, multiple -relay structure, and the capability of affording complex signal processing at the destination (base station). For all three cases, we prove that the diversity performance of the above approach can be enhanced without a significant loss of multiplexing performance or using complex coding strategies at relays. Since the good DMT performance is not affected by source -relay channel conditions, the protocols discussed in this thesis make relaying more beneficial

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

Application of advanced on-board processing concepts to future satellite communications systems: Bibliography

Abstracts are presented of a literature survey of reports concerning the application of signal processing concepts. Approximately 300 references are included

Beamforming optimization for two-way relay channel

In this thesis, we focus on the optimization of the two-way relay channel (TWRC), which can double the data rate of communications comparing to the traditional one-way relay channel (OWRC). Because of the broadcasting nature of wireless transmissions, secure transmission is an appealing research topic. We take secrecy rate consideration into the optimization of the TWRC. Overall we provide near-optimal solutions for the secrecy rate maximization problems of the TWRC with imperfect channel state information (ICSI). A much lower complexity optimal SOCP solution is provided for SNR balancing of the TWRC without secrecy consideration. We first look at a flat fading TWRC network model with a multiple-input multiple-output (MIMO) relay where perfect channel state information (CSI) is assumed available. We then formulate an optimization problem, with the objective to minimize the relay’s power usage under the constraints that the signal-to-noise ratio (SNR) of the two transceivers should exceed a preset threshold. A low-complexity optimal beamforming solution is provided to this optimization problem by reformulating it in the form of second-order cone programming (SOCP). Later in the thesis, we consider the presence of an eavesdropper and address the beamforming optimization for minimizing the relay’s power with the constraints of the secrecy rates of the two transceivers. A semi-definite programming (SDP) based searching algorithm is proposed to find a near-optimal solution. For each search of the proposed approach, the previous non-convex optimization problem is transferred into an SDP problem, which can guarantee the optimality of the beamforming matrix. Afterwards, more realistic imperfect CSI (ICSI) situations are considered for the TWRC network models. As ICSI completely changes the structure and the property of the optimization problems, we reformulate the optimization problems into two scenarios. For the first case, we consider that the relay is an untrusted eavesdropper and in this case an SDP solution is provided to maximize the joint-decoding sum-secrecy rate. For the second case, we investigate the robust beamforming problems where the relay is trusted but there is an external eavesdropper, another SDP solution is provided to maximize the sum-secrecy rate

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 Survey on Quantum Channel Capacities

Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication systems. For quantum communication channels, many new capacity definitions were developed in comparison to classical counterparts. A quantum channel can be used to realize classical information transmission or to deliver quantum information, such as quantum entanglement. Here we review the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.Comment: 58 pages, Journal-ref: IEEE Communications Surveys and Tutorials (2018) (updated & improved version of arXiv:1208.1270

Capacity Results for Wireless Cooperative Communications with Relay Conferencing

In this dissertation we consider cooperative communication systems with relay conferencing, where the relays own the capabilities to talk to their counterparts via either wired or wireless out-of-band links. In particular, we focus on the design of conferencing protocols incorporating the half-duplex relaying operations, and study the corresponding capacity upper and lower bounds for some typical channels and networks models, including the diamond relay channels (one source-destination pairs and two relays), large relay networks (one source-destination pairs and N relays), and interference relay channels (two source-destination pairs and two relays). First, for the diamond relay channels, we consider two different relaying schemes, i.e., simultaneous relaying (for which the two relays transmit and receive in the same time slot) and alternative relaying (for which the two relays exchange their transmit and receive modes alternatively over time), for which we obtain the respective achievable rates by using the decode-and-forward (DF), compress-and-forward (CF), and amplify-and-forward (AF) relaying schemes with DF and AF adopted the conferencing schemes. Moreover, we prove some capacity results under some special conditions. Second, we consider the large relay networks, and propose a "p-portion" conferencing scheme, where each relay can talk to the other "p-portion" of the relays. We obtain the DF and AF achievable rates by using the AF conferencing scheme. It is proved that relay conferencing increases the throughput scaling order of the DF relaying scheme from O(log(log(N ))) for the case without conferencing to O(log(N )); for the AF relaying scheme, it achieves the capacity upper bound under some conditions. Finally, we consider the two-hop interference relay channels, and obtain the AF achievable rates by adopting the AF conferencing scheme and two different decoding schemes at the destination, i.e., single-user decoding and joint decoding. For the derived joint source power allocation and relay combining problem, we develop some efficient iterative algorithms to compute the AF achievable rate regions. Moreover, we compare the achievable degree-of-freedom (DoF) performance of these two decoding schemes, and show that single-user decoding with interference cancellation at the relays is optimal

CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory

While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding schemes for multi-user communication networks with structured codes. The first part of the thesis investigates the usefulness of lattice codes in Gaussian networks with a generalized compute-and-forward scheme. As an application, we introduce a novel multiple access technique --- Compute-Forward Multiple Access (CFMA), and show that it achieves the capacity region of the Gaussian multiple access channel (MAC) with low receiver complexities. Similar coding schemes are also devised for other multi-user networks, including the Gaussian MAC with states, the two-way relay channel, the many-to-one interference channel, etc., demonstrating improvements of system performance because of the good interference mitigation property of lattice codes. As a common theme in the thesis, computing the sum of codewords over a Gaussian MAC is of particular theoretical importance. We study this problem with nested linear codes, and improve upon the currently best known results obtained by nested lattice codes. Inspired by the advantages of linear and lattice codes in Gaussian networks, we make a further step towards understanding intrinsic properties of the sum of linear codes. The final part of the thesis introduces the notion of typical sumset and presents asymptotic results on the typical sumset size of linear codes. The results offer new insight to coding schemes with structured codes

Energy Efficient and Cooperative Solutions for Next-Generation Wireless Networks

Energy efficiency is increasingly important for next-generation wireless systems due to the limited battery resources of mobile clients. While fourth generation cellular standards emphasize low client battery consumption, existing techniques do not explicitly focus on reducing power that is consumed when a client is actively communicating with the network. Based on high data rate demands of modern multimedia applications, active mode power consumption is expected to become a critical consideration for the development and deployment of future wireless technologies. Another reason for focusing more attention on energy efficient studies is given by the relatively slow progress in battery technology and the growing quality of service requirements of multimedia applications. The disproportion between demanded and available battery capacity is becoming especially significant for small-scale mobile client devices, where wireless power consumption dominates within the total device power budget. To compensate for this growing gap, aggressive improvements in all aspects of wireless system design are necessary. Recent work in this area indicates that joint link adaptation and resource allocation techniques optimizing energy efficient metrics can provide a considerable gain in client power consumption. Consequently, it is crucial to adapt state-of-the-art energy efficient approaches for practical use, as well as to illustrate the pros and cons associated with applying power-bandwidth optimization to improve client energy efficiency and develop insights for future research in this area. This constitutes the first objective of the present research. Together with energy efficiency, next-generation cellular technologies are emphasizing stronger support for heterogeneous multimedia applications. Since the integration of diverse services within a single radio platform is expected to result in higher operator profits and, at the same time, reduce network management expenses, intensive research efforts have been invested into design principles of such networks. However, as wireless resources are limited and shared by clients, service integration may become challenging. A key element in such systems is the packet scheduler, which typically helps ensure that the individual quality of service requirements of wireless clients are satisfied. In contrastingly different distributed wireless environments, random multiple access protocols are beginning to provide mechanisms for statistical quality of service assurance. However, there is currently a lack of comprehensive analytical frameworks which allow reliable control of the quality of service parameters for both cellular and local area networks. Providing such frameworks is therefore the second objective of this thesis. Additionally, the study addresses the simultaneous operation of a cellular and a local area network in spectrally intense metropolitan deployments and solves some related problems. Further improving the performance of battery-driven mobile clients, cooperative communications are sought as a promising and practical concept. In particular, they are capable of mitigating the negative effects of fading in a wireless channel and are thus expected to enhance next-generation cellular networks in terms of client spectral and energy efficiencies. At the cell edges or in areas missing any supportive relaying infrastructure, client-based cooperative techniques are becoming even more important. As such, a mobile client with poor channel quality may take advantage of neighboring clients which would relay data on its behalf. The key idea behind the concept of client relay is to provide flexible and distributed control over cooperative communications by the wireless clients themselves. By contrast to fully centralized control, this is expected to minimize overhead protocol signaling and hence ensure simpler implementation. Compared to infrastructure relay, client relay will also be cheaper to deploy. Developing the novel concept of client relay, proposing simple and feasible cooperation protocols, and analyzing the basic trade-offs behind client relay functionality become the third objective of this research. Envisioning the evolution of cellular technologies beyond their fourth generation, it appears important to study a wireless network capable of supporting machine-to-machine applications. Recent standardization documents cover a plethora of machine-to-machine use cases, as they also outline the respective technical requirements and features according to the application or network environment. As follows from this activity, a smart grid is one of the primary machine-to-machine use cases that involves meters autonomously reporting usage and alarm information to the grid infrastructure to help reduce operational cost, as well as regulate a customer's utility usage. The preliminary analysis of the reference smart grid scenario indicates weak system architecture components. For instance, the large population of machine-to-machine devices may connect nearly simultaneously to the wireless infrastructure and, consequently, suffer from excessive network entry delays. Another concern is the performance of cell-edge machine-to-machine devices with weak wireless links. Therefore, mitigating the above architecture vulnerabilities and improving the performance of future smart grid deployments is the fourth objective of this thesis. Summarizing, this thesis is generally aimed at the improvement of energy efficient properties of mobile devices in next-generation wireless networks. The related research also embraces a novel cooperation technique where clients may assist each other to increase per-client and network-wide performance. Applying the proposed solutions, the operation time of mobile clients without recharging may be increased dramatically. Our approach incorporates both analytical and simulation components to evaluate complex interactions between the studied objectives. It brings important conclusions about energy efficient and cooperative client behaviors, which is crucial for further development of wireless communications technologies

Advanced Resource Management Techniques for Next Generation Wireless Networks

The increasing penetration of mobile devices in everyday life is posing a broad range of research challenges to meet such a massive data demand. Mobile users seek connectivity "anywhere, at anytime". In addition, killer applications with multimedia contents, like video transmissions, require larger amounts of resources to cope with tight quality constraints. Spectrum scarcity and interference issues represent the key aspects of next generation wireless networks. Consequently, designing proper resource management solutions is critical. To this aim, we first propose a model to better assess the performance of Orthogonal Frequency-Division Multiple Access (OFDMA)-based simulated cellular networks. A link abstraction of the downlink data transmission can provide an accurate performance metric at a low computational cost. Our model combines Mutual Information-based multi-carrier compression metrics with Link-Level performance profiles, thus expressing the dependency of the transmitted data Block Error Rate (BLER) on the SINR values and on the modulation and coding scheme (MCS) being assigned. In addition, we aim at evaluating the impact of Jumboframes transmission in LTE networks, which are packets breaking the 1500-byte legacy value. A comparative evaluation is performed based on diverse network configuration criteria, thus highlighting specific limitations. In particular, we observed rapid buffer saturation under certain circumstances, due to the transmission of oversized packets with scarce radio resources. A novel cross-layer approach is proposed to prevent saturation, and thus tune the transmitted packet size with the instantaneous channel conditions, fed back through standard CQI-based procedures. Recent advances in wireless networking introduce the concept of resource sharing as one promising way to enhance the performance of radio communications. As the wireless spectrum is a scarce resource, and its usage is often found to be inefficient, it may be meaningful to design solutions where multiple operators join their efforts, so that wireless access takes place on shared, rather than proprietary to a single operator, frequency bands. In spite of the conceptual simplicity of this idea, the resulting mathematical analysis may be very complex, since it involves analytical representation of multiple wireless channels. Thus, we propose an evaluative tool for spectrum sharing techniques in OFDMA-based wireless networks, where multiple sharing policies can be easily integrated and, consequently, evaluated. On the other hand, relatively to contention-based broadband wireless access, we target an important issue in mobile ad hoc networks: the intrinsic inefficiency of the standard transmission control protocol (TCP), which presents degraded performance mainly due to mechanisms such as congestion control and avoidance. In fact, TCP was originally designed for wired networks, where packet losses indicate congestion. Conversely, channels in wireless networks might vary rapidly, thus most loss events are due to channel errors or link layer contention. We aim at designing a light-weight cross-layer framework which, differently from many other works in the literature, is based on the cognitive network paradigm. It includes an observation phase, i.e., a training set in which the network parameters are collected; a learning phase, in which the information to be used is extracted from the data; a planning phase, in which we define the strategies to trigger; an acting phase, which corresponds to dynamically applying such strategies during network simulations. The next generation mobile infrastructure frontier relies on the concept of heterogeneous networks. However, the existence of multiple types of access nodes poses new challenges such as more stringent interference constraints due to node densification and self-deployed access. Here, we propose methods that aim at extending femto cells coverage range by enabling idle User Equipments (UE) to serve as relays. This way, UEs otherwise connected to macro cells can be offloaded to femto cells through UE relays. A joint resource allocation and user association scheme based on the solutions of a convex optimization problem is proposed. Another challenging issue to be addressed in such scenarios is admission control, which is in charge of ensuring that, when a new resource reservation is accepted, previously connected users continue having their QoS guarantees honored. Thus, we consider different approaches to compute the aggregate projected capacity in OFDMA-based networks, and propose the E-Diophantine solution, whose mathematical foundation is provided along with the performance improvements to be expected, both in accuracy and computational terms