Multi-hop Relaying with Optimal Decode-and-Forward Transmission Rate and Self-Immunity to Mutual Interference among Wireless Nodes

Abstract-In this paper we show that multi-hop relaying with immunity to mutual interference among relays can be realized in multi-hop ad hoc wireless networks with full-duplex decodeand-forward relays that exploit appropriate packet encoding and successive interference cancellation. This resolves fundamentally the mutual interference challenge involved in multi-hop wireless network research. Based on this interference immune phenomenon, a relay selection algorithm is developed to find the optimal hop count and the optimal relays that maximize sourcedestination decode-and-forward transmission rate. The algorithm constructs the optimal multi-hop paths from a source node to all other network nodes simultaneously with a quadratic complexity O(N 2 ), where N is the network size. This algorithm is efficient for wireless networks with arbitrary size, including extremely large sizes, and can potentially play a fundamental role in exploring multi-hop wireless networks. Surprisingly, this wireless networking algorithm is similar to the well-known Djikstra's algorithm of wired networks. Simulations are conducted to demonstrate the efficiency and the superior performance of the new algorithm

Polar Coding Schemes for Cooperative Transmission Systems

: In this thesis, a serially-concatenated coding scheme with a polar code as the outer code and a low density generator matrix (LDGM) code as the inner code is firstly proposed. It is shown that that the proposed scheme provides a method to improve significantly the low convergence of polar codes and the high error floor of LDGM codes while keeping the advantages of both such as the low encoding and decoding complexity. The bit error rate results show that the proposed scheme by reasonable design have the potential to approach a performance close to the capacity limit and avoid error floor effectively. Secondly, a novel transmission protocol based on polar coding is proposed for the degraded half-duplex relay channel. In the proposed protocol, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. It is proved that the scheme can achieve the capacity of the half-duplex relay channel while enjoying low encoding/decoding complexity. By modeling the practical system, we verify that the proposed scheme outperforms the conventional scheme designed by low-density parity-check codes by simulations. Finally, a generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components (MRN-ORCs). In such a protocol, each relay node decodes the received source message with the help of partial information from previous nodes and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. For the design of polar codes, the nested structures are constructed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. It is proved that the proposed scheme achieves the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes

Energy E fficiency Oriented Full Duplex Wireless Communication Systems

Full-duplex (FD) transmission is a promising technique for fifth generation (5G) wireless communications, enabling significant spectral efficiency (SE) improvement over existing half-duplex (HD) systems. However, FD transmission consumes higher power than HD transmission, especially for millimetre wave band. Therefore, energy efficiency (EE) for FD systems is a critical yet inadequately addressed issue. This thesis addresses the critical EE challenges and demonstrates promising solutions for implementing FD systems, as detailed in the following contributions. In the first contribution, a comprehensive EE analysis of the FD and HD amplify-and-forward (AF) relay-assisted 60 GHz dual-hop indoor wireless systems is presented. An opportunistic relay mode selection scheme is developed, where FD relay with different self-interference (SIC) techniques or HD relay is opportunistically selected. Together with transmission power adaptation, EE is maximised with given channel gains. A counter-intuitive finding is shown that, with a relatively loose maximum transmission power constraint, FD relay with two-stage SIC is preferable to both FD relay with one-stage SIC and HD relay, resulting in a higher optimised EE. A full range of power consumption sources are considered to rationalise the analysis. The effects of imperfect SIC at relay, drain efficiency and static circuit power on EE are investigated. Simulation results verify the theoretical analysis. In the second contribution, EE oriented resource allocation for FD decode-of-forward (DF) relay-assisted 60 GHz multiuser systems is investigated. In contrast to the existing SE oriented designs, the proposed scheme maximises EE for FD relay systems under cross-layer constraints, addressing the typical problems at 60 GHz. A low-complexity EE-orientated resource allocation algorithm is proposed, by which the transmission power allocation, subcarrier allocation and throughput assignment are performed jointly across multiple users. Simulation results verify the analytical results and confirm that the FD relay systems with the proposed algorithm achieve a higher EE than the FD relay systems with SE oriented approaches, while offering a comparable SE. In addition, a much lower throughput outage probability is guaranteed by the proposed resource allocation algorithm, showing its robustness against channel estimation errors. In the third contribution, it is noticed that in wireless power transfer (WPT)-aided relay systems, the SE of the source-relay link plays a dominant role in the system SE due to limited transmission power at the WPT-aided relay. A novel asymmetric protocol for WPT-aided FD DF relay systems is proposed in multiuser scenario, where the time slot durations of the two hops are designed to be uneven, to enhance the degree of freedom and hence the system SE. A corresponding dynamic resource allocation algorithm is developed by jointly optimising the time slot durations, subcarriers and transmission power at the source and the relay. Simulation results con rm that, compared to the symmetric WPT-aided FD relay (Sym-WPT-FR) and the time-switching based WPT-aided FD relay (TS-WPT-FR) systems in the literature, the proposed asymmetric WPT-aided FD relay system achieves up to twice the SE and higher robustness against the relay's location and the number of users. In the final contribution, to strike the balance between high SE and low power consumption, a hybrid duplexing strategy is developed for distributed antennas (DAs) systems, where antennas are capable of working in hybrid FD, HD, and sleeping modes. To maximise the system EE with low complexity, activation/deactivation of transmit/receive chain is first performed, by a proposed channel-gain-based DA clustering algorithm, which highlights the characteristics of distributed deployment of antennas. Based on the DAs' con figuration, a novel distributed hybrid duplexing (D-HD)-based and EE oriented algorithm is proposed to further optimise the downlink beamformer and the uplink transmission power. To rationalise the system model, self-interference at DAs, co-channel interference from uplink users to downlink users, and multiuser interference in both uplink and downlink are taken into account. Simulation results confirm that the proposed system provides significant EE and SE enhancements over the colocated FD MIMO system, showing the advantages in alleviating high path loss as well as in cutting the carbon footprint. Compared to the sole-FD DA system, the proposed system shows much higher EE with marginal loss in SE. Also, the SIC operation in the proposed system is much more simplified compared to the two benchmarks

Wireless optical backhauling for optical attocell networks

The backhaul of tens and hundreds of light fidelity (LiFi)-enabled luminaires constitutes a major challenge. The problem of backhauling for optical attocell networks has been approached by a number of wired solutions such as in-building power line communication (PLC), Ethernet and optical fiber. In this work, an alternative solution is proposed based on wireless optical communication in visible light (VL) and infrared (IR) bands. The proposed solution is thoroughly elaborated using a system level methodology. For a multi-user optical attocell network based on direct current biased optical orthogonal frequency division multiplexing (DCO-OFDM) and decode-and-forward (DF) relaying, detailed modeling and analysis of signal-to-interference-plus- noise (SINR) and end-to-end sum rate are presented, taking into account the effects of inter-backhaul and backhaul-to-access interferences. Inspired by concepts developed for radio frequency (RF) cellular networks, full-reuse visible light (FR-VL) and in-band visible light (IB-VL) bandwidth allocation policies are proposed to realize backhauling in the VL band. The transmission power is opportunistically minimized to enhance the backhaul power efficiency. For a two-tier FR-VL network, there is a technological challenge due to the limited capacity of the bottleneck backhaul link. The IR band is employed to add an extra degree of freedom for the backhaul capacity. For the IR backhaul system, a power-bandwidth tradeoff formulation is presented and closed form analytical expressions are derived for the corresponding power control coefficients. The sum rate performance of the network is studied using extensive Monte Carlo simulations. In addition, the effect of imperfect alignment in backhaul links is studied by using Monte Carlo simulation techniques. The emission semi-angle of backhaul LEDs is identified as a determining factor for the network performance. With the assumption that the access and backhaul systems share the same propagation medium, a large semi-angle of backhaul LEDs results in a substantial degradation in performance especially under FR-VL backhauling. However, it is shown both theoretically and by simulations that by choosing a sufficiently small semi-angle value, the adverse effect of the backhaul interference is entirely eliminated. By employing a narrow light beam in the back-haul system, the application of wireless optical backhauling is extended to multi-tier optical attocell networks. As a result of multi-hop backhauling with a tree topology, new challenges arise concerning optimal scheduling of finite bandwidth and power resources of the bottleneck backhaul link, i.e., optimal bandwidth sharing and opportunistic power minimization. To tackle the former challenge, optimal user-based and cell-based scheduling algorithms are developed. The latter challenge is addressed by introducing novel adaptive power control (APC) and fixed power control (FPC) schemes. The proposed bandwidth scheduling policies and power control schemes are supported by an analysis of their corresponding power control coefficients. Furthermore, another possible application of wireless optical backhauling for indoor networks is in downlink base station (BS) cooperation. More specifically, novel cooperative transmission schemes of non-orthogonal DF (NDF) and joint transmission with DF (JDF) in conjunction with fractional frequency reuse (FFR) partitioning are proposed for an optical attocell downlink. Their performance gains over baseline scenarios are assessed using Monte Carlo simulations

Robust Beamforming for Cognitive and Cooperative Wireless Networks

Ph.DDOCTOR OF PHILOSOPH

Physical layer authentication for wireless communications

指導教員：姜　暁

Performance analysis of multi-antenna wireless systems

In this thesis we apply results from multivariate probability, random matrix theory (RMT) and free probability theory (FPT) to analyse the theoretical performance limits of future-generation wireless communication systems which implement multiple-antenna technologies. Motivated by the capacity targets for fifth generation wireless communications, our work focuses on quantifying the performance of these systems in terms of several relevant metrics, including ergodic rate and capacity, secrecy rate and capacity, asymptotic capacity, outage probability, secrecy outage probability and diversity order. Initially, we investigate the secrecy performance of a wirelessly powered, wiretap channel which incorporates a relatively small number of transmit antennas in a multiple-input single-output scenario. We consider two different transmission protocols which utilise physical layer security. Using traditional multivariate probability techniques we compute closed-form expressions for the outage probability and secrecy outage probability of the system under both protocols, based on the statistical properties of the channel. We use these expressions to compute approximations of the connection outage probability, secrecy outage probability and diversity orders in the high signal-to-noise ratio (SNR) regime which enables us to find candidates for the optimal time-switching ratio and power allocation coefficients. We show that it is possible to achieve a positive secrecy throughput, even in the case where the destination is further away from the source than the eavesdropper, for both protocols and compare their relative merits. We then progress to considering small-scale multiple-input multiple-output (MIMO) channels, which can be modelled as random matrices. We consider a relay system that enables communication between a remote source and destination in the presence of an eavesdropper and describe a decode-and-forward (DF) protocol which uses physical layer security techniques. A new result on the joint probability density function of the largest eigenvalues of the channel matrix is derived using results from RMT. The result enables us to compute the legitimate outage probability and diversity order of the proposed protocol and to quantify the effect of increasing the number of relays and antennas of the system. Next, we consider much larger-scale massive MIMO arrays, for which analysis using finite results becomes impractical. First we investigate the ergodic capacity of a massive MIMO, non-orthogonal multiple access system with unlimited numbers of antennas. Employing asymptotic results from RMT, we provide closed-form solutions for the asymptotic capacities of this scenario. This enables us to derive the optimal power allocation coefficients for the system. We demonstrate that our approach has low computational complexity and provides results much closer to optimality when compared with existing, suboptimal methods, particularly for the case where nodes are equipped with very large antenna arrays. Finally, we analyse the ergodic capacity of a single-hop, massive MIMO, multi-relay system having more complex properties, by applying results in FPT. Our method allows for an arbitrary number of relays, arbitrarily large antenna arrays and also asymmetric characteristics between channels, which is a situation that cannot typically be analysed using traditional RMT methods. We compute the asymptotic capacity across the system for the case when the relays employ a DF protocol and no direct link exists between the endpoints. We are able to calculate the overall capacity, to a high degree of accuracy, for systems incorporating channels greater than $128\times 128$ in dimension for which existing methods fail due to excessive computational demands. Finally, the comparative computational complexities of the methods are analysed and we see the advantages of applying the FPT method

Extension and practical evaluation of the spatial modulation concept

The spatial modulation (SM) concept combines, in a novel fashion, digital modulation and multiple antenna transmission for low complexity and spectrally efficient data transmission. The idea considers the transmit antenna array as a spatial constellation diagram with the transmit antennas as the constellation points. To this extent, SM maps a sequence of bits onto a signal constellation point and onto a spatial constellation point. The information is conveyed by detecting the transmitting antenna (the spatial constellation point) in addition to the signal constellation point. In this manner, inter-channel interference is avoided entirely since transmission is restricted to a single antenna at any transmission instance. However, encoding binary information in the spatial domain means that the number of transmit antennas must be a power of two. To address this constraint, fractional bit encoded spatial modulation (FBE—SM) is proposed. FBE–SMuses the theory of modulus conversion to facilitate fractional bit rates over time. In particular, it allows each transmitter to use an arbitrary number of transmit antennas. Furthermore, the application of SM in a multi-user, interference limited scenario has never been considered. To this extent, the average bit error rate (ABER) of SM is characterised in the interference limited scenario. The ABER performance is first analysed for the interference-unaware detector. An interference-aware detector is then proposed and compared with the cost and complexity equivalent detector for a single–input multiple–output (SIMO) system. The application of SM with an interference-aware detector results in coding gains for the system. Another area of interest involves using SM for relaying systems. The aptitude of SM to replace or supplement traditional relaying networks is analysed and its performance is compared with present solutions. The application of SM to a fixed relaying system, termed dual-hop spatial modulation (Dh-SM), is shown to have an advantage in terms of the source to destination ABER when compared to the classical decode and forward (DF) relaying scheme. In addition, the application of SM to a relaying system employing distributed relaying nodes is considered and its performance relative to Dh-SM is presented. While significant theoretical work has been done in analysing the performance of SM, the implementation of SM in a practical system has never been shown. In this thesis, the performance evaluation of SM in a practical testbed scenario is presented for the first time. To this extent, the empirical results validate the theoretical work presented in the literature

Spatial Modulation for Generalized MIMO:Challenges, Opportunities, and Implementation

A key challenge of future mobile communication research is to strike an attractive compromise between wireless network's area spectral efficiency and energy efficiency. This necessitates a clean-slate approach to wireless system design, embracing the rich body of existing knowledge, especially on multiple-input-multiple-output (MIMO) technologies. This motivates the proposal of an emerging wireless communications concept conceived for single-radio-frequency (RF) large-scale MIMO communications, which is termed as SM. The concept of SM has established itself as a beneficial transmission paradigm, subsuming numerous members of the MIMO system family. The research of SM has reached sufficient maturity to motivate its comparison to state-of-the-art MIMO communications, as well as to inspire its application to other emerging wireless systems such as relay-aided, cooperative, small-cell, optical wireless, and power-efficient communications. Furthermore, it has received sufficient research attention to be implemented in testbeds, and it holds the promise of stimulating further vigorous interdisciplinary research in the years to come. This tutorial paper is intended to offer a comprehensive state-of-the-art survey on SM-MIMO research, to provide a critical appraisal of its potential advantages, and to promote the discussion of its beneficial application areas and their research challenges leading to the analysis of the technological issues associated with the implementation of SM-MIMO. The paper is concluded with the description of the world's first experimental activities in this vibrant research field

Secure Neighbor Discovery and Ranging in Wireless Networks

This thesis addresses the security of two fundamental elements of wireless networking: neighbor discovery and ranging. Neighbor discovery consists in discovering devices available for direct communication or in physical proximity. Ranging, or distance bounding, consists in measuring the distance between devices, or providing an upper bound on this distance. Both elements serve as building blocks for a variety of services and applications, notably routing, physical access control, tracking and localization. However, the open nature of wireless networks makes it easy to abuse neighbor discovery and ranging, and thereby compromise overlying services and applications. To prevent this, numerous works proposed protocols that secure these building blocks. But two aspects crucial for the security of such protocols have received relatively little attention: formal verification and attacks on the physical-communication-layer. They are precisely the focus of this thesis. In the first part of the thesis, we contribute a formal analysis of secure communication neighbor discovery protocols. We build a formal model that captures salient characteristics of wireless systems such as node location, message propagation time and link variability, and we provide a specification of secure communication neighbor discovery. Then, we derive an impossibility result for a general class of protocols we term "time-based protocols", stating that no such protocol can provide secure communication neighbor discovery. We also identify the conditions under which the impossibility result is lifted. We then prove that specific protocols in the time-based class (under additional conditions) and specific protocols in a class we term "time- and location-based protocols," satisfy the neighbor discovery specification. We reinforce these results by mechanizing the model and the proofs in the theorem prover Isabelle. In the second part of the thesis, we explore physical-communication-layer attacks that can seemingly decrease the message arrival time without modifying its content. Thus, they can circumvent time-based neighbor discovery protocols and distance bounding protocols. (Indeed, they violate the assumptions necessary to prove protocol correctness in the first part of the thesis.) We focus on Impulse Radio Ultra-Wideband, a physical layer technology particularly well suited for implementing distance bounding, thanks to its ability to perform accurate indoor ranging. First, we adapt physical layer attacks reported in prior work to IEEE 802.15.4a, the de facto standard for Impulse Radio, and evaluate their performance. We show that an adversary can achieve a distance-decrease of up to hundreds of meters with an arbitrarily high probability of success, with only a minor cost in terms of transmission power (few dB). Next, we demonstrate a new attack vector that disrupts time-of-arrival estimation algorithms, in particular those designed to be precise. The distance-decrease achievable by this attack vector is in the order of the channel spread (order of 10 meters in indoor environments). This attack vector can be used in previously reported physical layer attacks, but it also creates a new type of external attack based on malicious interference. We demonstrate that variants of the malicious interference attack are much easier to mount than the previously reported external attack. We also provide design guidelines for modulation schemes and devise receiver algorithms that mitigate physical layer attacks. These countermeasures allow the system designer to trade off security, ranging precision and cost in terms of transmission power and packet length