Evaluating the effect of self-interference on the performance of full-duplex two-way relaying communication with energy harvesting

In this paper, we study the throughput and outage probability (OP) of two-way relaying (TWR) communication system with energy harvesting (EH). The system model consists two source nodes and a relay node which operates in full-duplex (FD) mode. The effect of self-interference (SI) due to the FD operation on the system performance is evaluated for both one-way full duplex (OWFD) and two-way full duplex (TWFD) diagrams where the amplify-and-forward (AF) relay node collects energy harvesting with the time switching (TS) scheme. We first propose an individual OP expression for each specific source. Then, we derive the exact closed-form overall OP expression for the OWFD diagram. For the TWFD diagram, we propose an approximate closed-form expression for the overall OP. The overall OP comparison among hybrid systems (Two-Way Half-Duplex (TWHD), OWFD, TWFD) are also discussed.  Finally, the numerical/simulated results are presented for Rayleigh fading channels to demonstrate the correction of the proposed analysis

Multihop Decode-and-Forward Relay Networks: Secrecy Analysis and Relay Position Optimization

Relay communication has advantages over direct transmission in terms of secrecy capacity. In this paper, the performance of secrecy, offered by multihop decode-and-forward relaying, is investigated and compared to its counterpart in direct transmission. Three key performance measures are derived over Rayleigh fading channels: probability of non-zero secrecy capacity, secure outage probability and secrecy capacity, which are valid for an arbitrary number of hops. Based on the tractable form of the probability of non-zero secrecy capacity, the optimization problem of trusty relay replacement is also studied. Numerical results indicate that a proper relay replacement can increase the network security without extra network resources. The correctness of analytical results is confirmed by using a MATLAB-based independent simulation model

Security for Two-Way Untrusted Relay against Constant and Reactive Jamming with Fixed Signals

Active attacking in physical-layer security has not been significantly studied while potentially causing serious consequences for the legitimate networks. In this paper, we propose a novel method to estimate and remove the jamming signals from multiple multi-antenna jammers in a two-way relay network with multi-antenna legitimate and relay nodes. We carefully consider the signals in the time slots in order to exploit the repetition of the signals and design the transmitted signals which can work in different cases. The numerical results show that the secrecy maximum achievable sum-rate (MASR) at the legitimate nodes is higher than that of the conventional method when considering the affect of transmit SNR; the number antennas at the legitimate and relay nodes; normalized distance between one legitimate node and the relay; and the vertical coordinate of the relay

Modified Dijkstra's Routing Algorithm for Security with Different Trust Degrees

A great number of efficient methods to improve the performance of the networks have been proposed in physical-layer security for wireless communications. So far, the security and privacy in wireless communications is optimized based on a fixed assumption about the trustworthiness or trust degrees (TD) of certain wireless nodes. The nodes are often classified into different types such as eavesdroppers, untrusted relays, and trusted cooperative nodes. Wireless nodes in different networks do not completely trust each other when cooperating or relaying information for each other. Optimizing the network based on trust degrees plays an important role in improving the security and privacy for the modern wireless network. We proposed a novel algorithm to find the route with the smallest total transmission time from the source to the destination and still guarantee that the accumulated TD is larger than a trust degree threshold. Simulation results are presented to analyze the affects of the transmit SNR, node density, and TD threshold on different network performance elements

On The Performance of Underlay Relay Cognitive Networks

The bit error rate (BER) performance of underlay relay cognitive networks in the presence of Rayleigh fading is thoroughly analyzed in this paper. New exact and asymptotic analytic expressions under consideration of both interference power constraint and maximum transmit power constraint are derived in closed-form and are extensively corroborated by Monte-Carlo simulations. These expressions facilitate in evaluating effectively the network performance behaviour in key operation parameters as well as in optimizing system parameters. A multitude of analytical results expose that underlay relay cognitive networks experience the performance saturation phenomena while their performance considerably depends on the number of hops for the linear network model. Additionally, optimum relay position is significantly dependent of maximum transmit power, maximum interference power, and licensee location. Moreover, the appropriate order of locating unlicensees with different maximum transmit power levels can dramatically improve the network performance

Security for Multi-hop Communication of Two-tier Wireless Networks with Different Trust Degrees

Many effective strategies for enhancing network performance have been put forth for wireless communications' physical-layer security. Up until now, wireless communications security and privacy have been optimized based on a set assumption on the reliability or network tiers of certain wireless nodes. Eavesdroppers, unreliable relays, and trustworthy cooperative nodes are just a few examples of the various sorts of nodes that are frequently categorized. When working or sharing information for one another, wireless nodes in various networks may not always have perfect trust in one another. Modern wireless networks' security and privacy may be enhanced in large part by optimizing the network based on trust levels. To determine the path with the shortest total transmission time between the source and the destination while still ensuring that the private messages are not routed through the untrusted network tier, we put forth a novel approach. To examine the effects of the transmit SNR, node density, and the percentage of the illegitimate nodes on various network performance components, simulation results are provided

Hardware Architectures of Visible Light Communication Transmitter and Receiver for Beacon-based Indoor Positioning Systems

High-speed applications of Visible Light Communications have been presented recently in which response times of photodiode-based VLC receivers are critical points. Typical VLC receiver routines, such as soft-decoding of run-length limited (RLL) codes and FEC codes was purely processed on embedded firmware, and potentially cause bottleneck at the receiver. To speed up the performance of receivers, ASIC-based VLC receiver could be the solution. Unfortunately, recent works on soft-decoding of RLL and FEC have shown that they are bulky and time-consuming computations. This causes hardware implementation of VLC receivers becomes heavy and unrealistic. In this paper, we introduce a compact Polar-code-based VLC receivers. in which flicker mitigation of the system can be guaranteed even without RLL codes. In particular, we utilized the centralized bit-probability distribution of a pre-scrambler and a Polar encoder to create a non-RLL flicker mitigation solution. At the receiver, a 3-bit soft-decision filter was implemented to analyze signals received from the VLC channel to extract log-likelihood ratio (LLR) values and feed them to the Polar decoder. Therefore, the proposed receiver could exploit the soft-decoding of the Polar decoder to improve the error-correction performance of the system. Due to the non-RLL characteristic, the receiver has a preeminent code-rate and a reduced complexity compared with RLL-based receivers. We present the proposed VLC receiver along with a novel very-large-scale integration (VLSI) architecture, and a synthesis of our design using FPGA/ASIC synthesis tools

An Improved White Space Prediction Algorithm for Cognitive Radio Systems

Cognitive radio (CR) is a promising technology to enhance the current low usage of limited frequency resources. TV white space (TVWS) - TV bands at a particular time in a particular geographic area that are not being used by licensed services - is perceived as the most suitable frequency bands for CR. This paper proposes a new prediction TVWS algorithm for CR systems based on the ITU 1546.1 and the Okumura-Hata models. The proposed algorithm is verified with the data of 22 provinces in the South of Vietnam. The numerical results confirm the advantage of the proposed algorithm as well as the possibility of TVWS CR networks

A Survey on Approximations of One-Dimensional Gaussian Q-Function

Predicting the digital communication system performance plays a very important role in the process of system design. This performance is usually quantified by symbol error probability or bit error probability. Computing these probabilities in presence of Additive White Gaussian Noise requires to work with integrals involving the Gaussian Qfunction, which cannot be expressed in closed-form in terms of elementary functions. As a result, approximating the Gaussian Q-function in closed-form expressions with high accuracy becomes a necessity. In this paper, we give an overview about the Gaussian Q-function approximations and via some illustrating examples, we discuss their accuracy, tractability as well as their computational complexit