Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Computing and Networking

Cooperative Jamming in a Two-Hop Relay Wireless Network with Buffer-Aided Relays

Kenta Sasaki, Xuening Liao, Xiaohong Jiang

Published Nov 1, 2017• 7 citations
Publisher

Abstract

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.

DOI
10.1109/candar.2017.70

Related papers

Destination Assisted Cooperative Jamming for Wireless Physical-Layer Security

Yupeng Liu, Jiangyuan Li, Athina P. Petropulu

A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.

IEEE Transactions on Information Forensics and Security•Feb 25, 2013•195 citations

Link Selection for Secure Cooperative Networks with Buffer-Aided Relaying

Ji He, Jia Liu, Yulong Shen +1 more

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.

arXiv:1802.06538•Feb 19, 2018•2 citations

Cooperative beamforming and jammer selection strategies for two-hop secure communication

Hao Jiang Deng, Hui‐Ming Wang, Chaowen Liu +2 more

In this paper, we propose a novel scheme to enhance the security of a single source-destination cooperative network with multiple helpers and one eavesdropper, where a helper operates as a jammer and the others use amplify-and-forward (AF) protocol to deliver a weighted version of the received signal. Since the instantaneous channel state information (CSI) of the eavesdropper is not available, we hope to achieve the maximum signal-to-noise ratio (SNR) and guarantee that the jamming signal is cancelled out at the destination. The weights of the relay can be obtained by just solving a semidefinite programming (SDP) without bisection search. We provide two jammer selection strategies for two cases, i.e., with or without knowledge of the eavesdropper's position. Simulation results confirm a great improvement of the security in the considered network.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2015•1 citation

Outage optimal relay selection strategy using destination-based jamming for secure communication in amplify-and-forward relay networks

Sarbani Ghose, Ranjan Bose

In this paper, we consider a two-hop wireless system consisting of one source, one destination, one eavesdropper and multiple amplify-and-forward relays. A time-division duplex scheme is proposed that aims at minimizing the secrecy rate outage by selecting an optimal relay from the set of candidate relays. In the first time slot, the source transmits the information bearing signal, meanwhile the destination jams the eavesdropper. In the second slot, the selected relay forwards the received signals in amplify-and-forward fashion. Out of two hops, the eavesdropper can tap only the signal transmitted by the relay in the second hop. We obtain a closed-form expression of the end-to-end secrecy outage for instantaneous and statistical channel-state information of the eavesdropper. The analytical results suggest that the proposed destination-based jamming outperforms the conventional relay selection scheme without jamming. Monte Carlo simulations are performed to verify the analytical results.

IEEE Statistical Signal Processing Workshop (SSP)•Jun 1, 2014•2 citations

Cooperative Jamming and Power Allocation for Wireless Relay Networks in Presence of Eavesdropper

Lun Dong, Homayoun Yousefi’zadeh, Hamid Jafarkhani

Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.

International Conference on Communications•Jun 1, 2011•95 citations

Relaying techniques for enhancing the physical layer secrecy in cooperative networks with multiple eavesdroppers

Azzam Al‐nahari, Ioannis Krikidis, Ahmed S. Ibrahim +2 more

ABSTRACT Physical layer security has recently attracted considerable attention in the context of information‐theoretic point of view. In this paper, we investigate relay selection schemes for security‐constrained half‐duplex cooperative wireless networks with multiple eavesdroppers, which have the ability to cooperate to overhear the source transmission. The proposed techniques select a trusted decode‐and‐forward relay to assist the source transmission and maximize the achievable secure rate for different eavesdropper policies (cooperation or not); for the two cases, we assume that the channel is always available. In addition, a jamming method that selects two relay nodes to create an intentional interference at both phases of the decode‐and‐forward protocol to confound the eavesdropper nodes is also considered. Both the source–destination and source–eavesdroppers links are taken into account in the proposed analysis. Secrecy rate and secrecy outage probability are the two performance metrics that are used to verify the effectiveness of the proposed schemes while asymptotic approximations of the secrecy outage probability are also derived. Simulation and analytical results demonstrate the performance improvement of the proposed schemes. Copyright © 2012 John Wiley & Sons, Ltd.

Transactions on Emerging Telecommunications Technologies•Nov 7, 2012•24 citations
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.
A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.
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.
In this paper, we propose a novel scheme to enhance the security of a single source-destination cooperative network with multiple helpers and one eavesdropper, where a helper operates as a jammer and the others use amplify-and-forward (AF) protocol to deliver a weighted version of the received signal. Since the instantaneous channel state information (CSI) of the eavesdropper is not available, we hope to achieve the maximum signal-to-noise ratio (SNR) and guarantee that the jamming signal is cancelled out at the destination. The weights of the relay can be obtained by just solving a semidefinite programming (SDP) without bisection search. We provide two jammer selection strategies for two cases, i.e., with or without knowledge of the eavesdropper's position. Simulation results confirm a great improvement of the security in the considered network.
In this paper, we consider a two-hop wireless system consisting of one source, one destination, one eavesdropper and multiple amplify-and-forward relays. A time-division duplex scheme is proposed that aims at minimizing the secrecy rate outage by selecting an optimal relay from the set of candidate relays. In the first time slot, the source transmits the information bearing signal, meanwhile the destination jams the eavesdropper. In the second slot, the selected relay forwards the received signals in amplify-and-forward fashion. Out of two hops, the eavesdropper can tap only the signal transmitted by the relay in the second hop. We obtain a closed-form expression of the end-to-end secrecy outage for instantaneous and statistical channel-state information of the eavesdropper. The analytical results suggest that the proposed destination-based jamming outperforms the conventional relay selection scheme without jamming. Monte Carlo simulations are performed to verify the analytical results.
Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.
ABSTRACT Physical layer security has recently attracted considerable attention in the context of information‐theoretic point of view. In this paper, we investigate relay selection schemes for security‐constrained half‐duplex cooperative wireless networks with multiple eavesdroppers, which have the ability to cooperate to overhear the source transmission. The proposed techniques select a trusted decode‐and‐forward relay to assist the source transmission and maximize the achievable secure rate for different eavesdropper policies (cooperation or not); for the two cases, we assume that the channel is always available. In addition, a jamming method that selects two relay nodes to create an intentional interference at both phases of the decode‐and‐forward protocol to confound the eavesdropper nodes is also considered. Both the source–destination and source–eavesdroppers links are taken into account in the proposed analysis. Secrecy rate and secrecy outage probability are the two performance metrics that are used to verify the effectiveness of the proposed schemes while asymptotic approximations of the secrecy outage probability are also derived. Simulation and analytical results demonstrate the performance improvement of the proposed schemes. Copyright © 2012 John Wiley & Sons, Ltd.