We consider utilizing a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts reception and transmission time slots based on the channel quality, while considering both the two-hop transmission efficiency and the security. Closed-form expressions for the secrecy throughput and the secrecy outage probability (SOP) are derived, and the selection parameters are optimized to maximize the secrecy throughput or minimize the SOP. We also study two sub-optimal link selection schemes that only require a line search to solve the optimization problem. Numerical results show that buffer-aided relaying provides a significant improvement in security compared to conventional unbuffered relaying.
We consider utilizing a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts reception and transmission time slots based on the channel quality, while considering both the two-hop transmission efficiency and the security. Closed-form expressions for the secrecy throughput and the secrecy outage probability (SOP) are derived, and the selection parameters are optimized to maximize the secrecy throughput or minimize the SOP. We also study two sub-optimal link selection schemes that only require a line search to solve the optimization problem. Numerical results show that buffer-aided relaying provides a significant improvement in security compared to conventional unbuffered relaying.
This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.
This article investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay helps forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. To ensure the transmission security and communication quality of service (QoS) of the system, we design novel link selection policies for two cases that the instantaneous channel state information is available or unavailable at the source node. For evaluating the system performance, we then derive the closed-form expressions of end-to-end secrecy outage probability, system throughput and secrecy throughput, respectively. Based on the theoretical performance analysis, we further explore the performance optimization issues, revealing the insightful tradeoffs between the transmission security and QoS. An iterative algorithm is developed to identify the optimal setting of link selection parameters, which is helpful for the practical configuration of link selection policies to satisfy various system performance requirements. Finally, we conduct simulations to validate our theoretical performance analysis, and also provide extensive numerical results to illustrate the efficiency of the proposed link selection policies for ensuring the secure communication in a two-hop cooperative network.
We investigate the physical-layer security of a buffer-aided multiple-input multiple-output relay channel. The wireless network under investigation is composed of one legitimate source node (Alice), one legitimate half-duplex relay node, and one legitimate destination node (Bob). Alice communicates with both relay and Bob in the presence of a potential passive multi-antenna eavesdropper (Eve). Without knowing the instantaneous eavesdropper's channel state information at the legitimate nodes, we propose a precoded artificial-noise injection scheme to enhance the security of the legitimate transmissions. The relay is equipped with a finite buffer to store the unsuccessfully decoded packets at Bob. We analyze the Markov chain of the relay's queue and derive its steady-state distributions. Our optimization problem is formulated such that the average end-to-end secure throughput is maximized under the secrecy outage probability constraint on the Alice-relay link. Our numerical results demonstrate that our proposed buffer-aided relaying scheme achieves a significant improvement in the secure throughput compared with the conventional bufferless relaying scheme, where the time slot is divided equally between the source and the relay for their data transmissions.
In this paper, we consider a two-hop relay wireless network with one source, one destination, one eavesdropper and multiple half-duplex (HD) relays each having a finite buffer. We assume two cases of the eavesdropper's channel state information (CSI), i.e., the perfect CSI case where the instantaneous CSI of the eavesdropper channels are available, and the partial CSI case where only the average CSI of the eavesdropper channels are available. Cooperative jamming schemes are proposed for both eavesdropper's CSI cases, where two relays are selected in each hop, one is selected as a message relay and another as a jammer to transmit jamming signals to degrade the eavesdropper channel. The security performance in terms of the secrecy outage probability (SOP) is analyzed by simulation. We also make comparison between our proposed cooperative jamming schemes with the random jammer selection scheme. Results show that the proposed cooperative jamming scheme outperforms the random jammer selection scheme and the joint consideration of the buffer-aided relay selection and jamming can achieve better security performance.
This paper considers the security of transmission in buffer-aided decode-and-forward cooperative wireless networks. An eavesdropper which can intercept the data transmission from both the source and relay nodes is considered to threaten the security of transmission. Finite size data buffers are assumed to be available at every relay in order to avoid having to select concurrently the best source-to-relay and relay-to-destination links. A new max-ratio relay selection policy is proposed to optimize the secrecy transmission by considering all the possible source-to-relay and relay-to-destination links and selecting the relay having the link which maximizes the signal to eavesdropper channel gain ratio. Two cases are considered in terms of knowledge of the eavesdropper channel strengths: exact and average gains, respectively. Closed-form expressions for the secrecy outage probability for both cases are obtained, which are verified by simulations. The proposed max-ratio relay selection scheme is shown to outperform one based on a max-min-ratio relay scheme.
In this paper, we investigate the physical layer security of a dual-hop cooperative network in the presence of a full-duplex active eavesdropper, which can overhear the confidential signals and transmit jamming signals simultaneously. We utilize the optimal relay selection scheme to improve the secrecy performance, where the relay maximizing the secrecy capacity will be selected to forward the information. To evaluate the secrecy performance of our system, we derive a compact closed-form expression of the secrecy outage probability. Besides, we also analyze the asymptotic performance related to the position of the nodes. Finally, we verify our analysis through the numerical results, and demonstrate that there exists a secrecy protection region where the secrecy outage probability is below a target probability.