Exploiting secure performance of full-duplex decode and forward in optimal relay selection networks

In the presence of an illegitimate user, we investigate the secrecy outage probability (SOP) of the optimal relay selection (ORS) networks by applying decode-and-forward (DnF) based full-duplex (FD) relaying mode. The closed-form expressions for the allocations of the end-to-end signal-to-interference-plus-noise ratio (SINR) in each wireless network are derived as well as the closed-form expression for the exact SOP of the proposed ORS system is presented under Rayleigh fading schemes. As an important achievement, SOP is also compared between orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) schemes. Our results reveal that the SOP of the suggested scheme can be considerably influenced by several parameters involved, including the number of relays, the average signal-to-noise ratio (SNR) of eavesdropper links, transmit power and the average residual self-interference (SI) enforced on the FD relays.Web of Science244767

Distributed MAC Protocol Supporting Physical-Layer Network Coding

Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access control (MAC) protocols, which are not applicable to general multi-hop wireless networks, to the best of our knowledge. In this paper, we propose a distributed MAC protocol that supports PNC in multi-hop wireless networks. The proposed MAC protocol is based on the carrier sense multiple access (CSMA) strategy and can be regarded as an extension to the IEEE 802.11 MAC protocol. In the proposed protocol, each node collects information on the queue status of its neighboring nodes. When a node finds that there is an opportunity for some of its neighbors to perform PNC, it notifies its corresponding neighboring nodes and initiates the process of packet exchange using PNC, with the node itself as a relay. During the packet exchange process, the relay also works as a coordinator which coordinates the transmission of source nodes. Meanwhile, the proposed protocol is compatible with conventional network coding and conventional transmission schemes. Simulation results show that the proposed protocol is advantageous in various scenarios of wireless applications.Comment: Final versio

Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels

Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.Comment: to appear in IEEE Trans. on Communications, 201

Physical layer network coding based communication systems in frequency selective channels

PhD ThesisThe demand for wireless communications is growing every day which requiresmore speed and bandwidth. In two way relay networks (TWRN), physical layer network coding (PLNC) was proposed to double the bandwidth. A TWRN is a system where two end users exchange data through a middle node called the relay. The two signals are allowed to be physically added before being broadcasted back to the end users. This system can work smoothly in flat fading channels, but can not be applied straightforward in frequency selective channels. In a multipath multi-tap FIR channel, the inter-symbol interference (ISI) spreads through several symbols. In this case, the symbols at the relay are not just an addition of the sent symbols but also some of the previous symbols from both sides. This not only causes a traditional PLNC to fail but also a simple one equalizer system will not solve the problem. Three main methods have been proposed by other researchers. The OFDM based PLNC is the simplest in terms of implementation and complexity but suffers from the disadvantages of the OFDMlike cyclic prefix overhead and frequency offset. The main disadvantage, however is the relatively low BER performance because it is restricted to linear equalizers in the PLNC system. Another approach is pre-filtering or pre-equalization. This method also has some disadvantages like complexity, sensitivity to channel variation and the need of a feedback channel for both end nodes. Finally, the maximum likelihood sequence detector was also proposed but is restricted to BPSK modulation and exponentially rising complexity are major drawbacks. The philosophy in this work is to avoid these disadvantages by using a time domain based system. The DFE is the equalizer of choice here because it provides a non-trivial BER performance improvement with very little increase in complexity. In this thesis, the problem of frequency selective channels in PLNC systems can be solved by properly adjusting the design of the system including the DFE. The other option is to redesign the equalizer to meet that goal. An AF DFE system is proposed in this work that provides very low complexity especially at the relay with little sensitivity to channel changes. A multi-antenna DNF DFE system is also proposed here with an improved performance. Finally, a new equalizer is designed for very low complexity and cost DNF approach with little sacrifice of BER performance. Matlab was used for the simulations with Monte Carlo method to verify the findings of this work through finding the BER performance of each system. This thesis opens the door for future improvement on the PLNC system. More research needs to be done like testing the proposed systems in real practical implementation and also the effect of adding channel coding to these systems.Iraqi Government, Ministry of Higher Educatio

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

Two–Way Relaying Communications with OFDM and BICM/BICM-ID

Relay-aided communication methods have gained strong interests in academic community and been applied in various wireless communication scenarios. Among different techniques in relay-aided communication system, two-way relaying communication (TWRC) achieves the highest spectral efficiency due to its bi-directional transmission capability. Nevertheless, different from the conventional point-to-point communication system, TWRC suffers from detection quality degradation caused by the multiple-access interference (MAI). In addition, because of the propagation characteristics of wireless channels, fading and multipath dispersion also contribute strongly to detection errors. Therefore, this thesis is mainly concerned with designing transmission and detection schemes to provide good detection quality of TWRC while taking into account the negative impacts of fading, multipath dispersion and multiple-access interference. First, a TWRC system operating over multipath fading channels is considered and orthogonal frequency-division multiplexing (OFDM) is adopted to handle the inter-symbol interference (ISI) caused by the multipath dispersion. In particular, adaptive physical-layer network coding (PNC) is employed to address the MAI issue. By analyzing the detection error probability, various adaptive PNC schemes are discussed for using with OFDM and the scheme achieving the best trade-off among performance, overhead and complexity is suggested. In the second part of the thesis, the design of distributed precoding in TWRC using OFDM under multipath fading channels is studied. The objective is to design a distributed precoding scheme which can alleviate MAI and achieve multipath diversity to combat fading. Specifically, three types of errors are introduced when analyzing the error probability in the multiple access (MA) phase. Through analysis and simulation, the scheme that performs precoding in both time and frequency domains is demonstrated to achieve the maximum diversity gains under all types of errors. Finally, the last part of the thesis examines a communication system incorporating forward error correction (FEC) codes. Specifically, bit-interleaved code modulation (BICM) without and with iterative decoding (BICM-ID) are investigated in a TWRC system. Distributed linear constellation precoding (DLCP) is applied to handle MAI and the design of DLCP in a TWRC system using BICM/BICM-ID is discussed. Taking into account the multiple access channel from the terminal nodes to the relay node, decoding based on the quaternary code representation is introduced. Several error probability bounds are derived to aid in the design of DLCP. Based on these bounds, optimal parameters of DLCP are obtained through analysis and computer search. It is also found that, by combining XORbased network coding with successful iterative decoding, the MAI is eliminated and thus DLCP is not required in a BICM-ID system

Capacity Approaching Coding Strategies for Machine-to-Machine Communication in IoT Networks

Radio access technologies for mobile communications are characterized by multiple access (MA) strategies. Orthogonal MA techniques were a reasonable choice for achieving good performance with single user detection. With the tremendous growth in the number of mobile users and the new internet of things (IoT) shifting paradigm, it is expected that the monthly mobile data traffic worldwide will exceed 24.3 exabytes by 2019, over 100 billion IoT connections by 2025, and the financial impact of IoT on the global economy varies in the range of 3.9 to 11.1 trillion dollars by 2025. In light of the envisaged exponential growth and new trends, one promising solution to further enhance data rates without increasing the bandwidth is by increasing the spectral efficiency of the channel. Non-orthogonal MA techniques are potential candidates for future wireless communications. The two corner points on the boundary region of the MA channel are known to be achievable by single user decoding followed by successive decoding (SD). Other points can also be achieved using time sharing or rate splitting. On the other hand, machine-to-machine (M2M) communication which is an enabling technology for the IoT, enables massive multipurpose networked devices to exchange information among themselves with minor or no human intervention. This thesis consists of three main parts. In the first part, we propose new practical encoding and joint belief propagation (BP) decoding techniques for 2-user MA erasure channel (MAEC) that achieve any rate pair close to the boundary of the capacity region without using time sharing nor rate splitting. While at the encoders, the corresponding parity check matrices are randomly built from a half-rate LDPC matrix, the joint BP decoder employs the associated Tanner graphs of the parity check matrices to iteratively recover the erasures in the received combined codewords. Specifically, the joint decoder performs two steps in each decoding iteration: 1) simultaneously and independently runs the BP decoding process at each constituent sub-graph to recover some of the common erasures, 2) update the other sub-graph with newly recovered erasures and vice versa. When the number of erasures in the received combined codewords is less than or equal to the number of parity check constraints, the decoder may successfully decode both codewords, otherwise the decoder declares decoding failure. Furthermore, we calculate the probability of decoding failure and the outage capacity. Additionally, we show how the erasure probability evolves with the number of decoding iterations and the maximum tolerable loss. Simulations show that any rate pair close to the capacity boundary is achievable without using time sharing. In the second part, we propose a new cooperative joint network and rateless coding strategy for machine-type communication (MTC) devices in the multicast settings where three or more MTC devices dynamically form a cluster to disseminate messages between themselves. Specifically, in the basic cluster, three MTC devices transmit their respective messages simultaneously to the relay in the first phase. The relay broadcasts back the combined messages to all MTC devices within the basic cluster in the second phase. Given the fact that each MTC device can remove its own message, the received signal in the second phase is reduced to the combined messages coming from the other two MTC devices. Hence, this results in exploiting the interference caused by one message on the other and therefore improving the bandwidth efficiency. Furthermore, each group of three MTC devices in vicinity can form a basic cluster for exchanging messages, and the basic scheme extends to N MTC devices. Furthermore, we propose an efficient algorithm to disseminate messages among a large number of MTC devices. Moreover, we implement the proposed scheme employing practical Raptor codes with the use of two relaying schemes, namely amplify and forward (AF) and de-noise and forward (DNF). We show that with very little processing at the relay using DNF relaying scheme, performance can be further enhanced. We also show that the proposed scheme achieves a near optimal sum rate performance. In the third part, we present a comparative study of joint channel estimation and decoding of factor graph-based codes over flat fading channels and propose a simple channel approximation scheme that performs close to the optimal technique. Specifically, when channel state information (CSI) is not available at the receiver, a simpler approach is to estimate the channel state of a group of received symbols, then use the approximated value of the channel with the received signal to compute the log likelihood ratio. Simulation results show that the proposed scheme exhibits about 0.4 dB loss compared to the optimal solution when perfect CSI is available at the receiver