This paper proposes a new artificial noise (AN) scheme that combines with the relay selection techniques to improve the physical layer security for a wiretap full-duplex decode-and-forward cooperative network. The communication consists of two phases. In the first phase, the source transmits a message to the selected full-duplex relay, which simultaneously injects AN to mitigate eavesdropping attacks. In the second phase, the selected relay decodes the source message, XORs the source message and AN, and then broadcasts the mixed-signal to the destination. Different form existing schemes, the proposed AN scheme makes the eavesdropper fail in obtaining any information about the source message directly in the second phase. We take into account the correlation of the channel coefficients for the same link during different phases in the performance analysis of AN-aided max-min (MM) and partial (Par) relay selection schemes, and characterize the security-reliability trade-off (SRT) of the proposed schemes by the closed-form expressions of outage probability and intercept probability. Numerical results show that the proposed AN-aided MM/Par relay selection achieves a better SRT performance than the corresponding full-duplex mode assisted AN-aided relay selection scheme in existing literature. Furthermore, the MM scheme outperforms the Par scheme in terms of the SRT, and the SRT of the MM scheme can be substantially improved by increasing the number of relays, while the improvement of the Par scheme is limited.

Relay transmissions play an important role in many types of communication systems. In this paper, we consider packet-level coded transmissions over lossy relay links with the finite-buffer and coding coefficients delivery cost constraints. We propose a low-complexity coding scheme where packets are encoded from sequentially formed random subsets of source packets called batches. The relay recodes only from the buffered packets belonging to the same batch to maintain the code sparsity, lowering the packet header overhead and the decoding complexity compared to the random linear network coding (RLNC). To analyze the performance, we first propose an absorbing Markov chain model to analyze the RLNC transmission over finite-buffer relay links. The finite-length analysis not only provides a lower bound on the completion time using any sparser random codes but also characterizes each individual batch's transmission of the proposed code. Based on the analysis, another Markov chain is proposed to determine the decoding failure probability and the expected completion time of the batch coding scheme. As shown through analysis and simulations, the proposed scheme achieves higher effective end-to-end rates than RLNC when the coding coefficients delivery cost is considered and is also with much lowered decoding complexity thanks to its sparseness.

In order to decrease energy consumption caused by the dense deployment of pico base stations (PBSs) in heterogeneous cellular networks (HetNets), this paper first analyzes the energy efficiency (EE) of two-tier HetNets and then proposes a method to maximize the network EE by adjusting the PBS transmit power. The two-tier HetNets are modeled by the Poisson point process (PPP) and the Poisson hole process (PHP), and then the coverage probability of the macro base station (MBS) and the PBS in the two-tier HetNets is derived based on the mean interference to signal ratio (MISR). According to the user association probability, the coverage probability of the PPP-PHP HetNets is obtained. Then, the tractable expression of the average achievable rate is deduced on the basis of the relationship between the coverage probability and the average achievable rate. Finally, the expression of EE is derived and the EE optimization algorithm is proposed based on the PBS transmit power. The simulation results show that the PPP-PHP network is superior to the PPP-PPP network in terms of coverage probability and EE, and the network EE can be effectively improved by setting an appropriate PBS transmit power.

This paper analyzed the performance of multi-hop relay cooperative spectrum sensing. The closed form expression of the upper bound of the detection probability of multi-hop relay cooperation is derived in Rayleigh flat fading channel. It provides the theoretical basis for analyzing the performance of multi-hop relay cooperative spectrum sensing. Simulation results show that the detection probability decreases as the increase of the hop number when each hop sub-channel has the same average signal to noise ratio (SNR). The detection performance of three-hop relay cooperative spectrum sensing outperforms that of two-hop relay when both SNRs of the last two hops in three-hop relay are 3 dB bigger than the SNR of the second hop in two-hop relay.