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

IEEE International Conference on Acoustics Speech and Signal Processing

Cooperation strategies for secrecy in MIMO relay networks with unknown eavesdropper CSI

Jing Huang, Arnold Lee Swindlehurst

Published May 1, 2011• 12 citations
Publisher

Abstract

We investigate secure communications for a four-node relay-eavesdropper channel with multiple data stream transmission, assuming that the eavesdropper's channel state information (ECSI) is unavailable. Our approach is to allocate part of the global transmit power to satisfy a fixed target rate for the relay link, and then use the remaining power for jamming the eavesdropper. Two cooperative jamming strategies are investigated. In the first, jamming signals are only broadcast by the terminals that are also transmitting data. In the second scheme, the normally inactive nodes in the relay network are used as cooperative jamming sources. Algorithms are proposed for allocating the transmit power and the number of signal dimensions that carry data. Simulation results show that, under a global transmit power constraint, the secrecy rate is dramatically increased when the normally inactive nodes in the relay network provide jamming support for the relayed signals.

DOI
10.1109/icassp.2011.5947121

Related papers

Cooperative Jamming for Secure Communications in MIMO Relay Networks

Jing Huang, Arnold Lee Swindlehurst

Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.

arXiv:1107.1544•IEEE Transactions on Signal Processing•Jul 7, 2011•345 citations

Wireless Secure Communications via Cooperative Relaying and Jamming

Ling Tang, Hao Chen, Jianhui Wu

We consider wireless secure communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate under individual power constraints. Further, we study the case with imperfect channel state information (CSI) for both CR and CJ. At last, extensive numerical results are provided.

IEICE Transactions on Communications•Jan 1, 2012•0 citations

Secure Transmission with Hybrid Relay Scheme: Relaying and Jamming

Qi Xiong, Kwok Hung Li, Ying‐Chang Liang +1 more

In this paper, secure transmission is considered in a wireless relay network in the presence of an eavesdropper. A novel hybrid relay scheme, named as relaying-and-jamming (RJ), is advocated to achieve information theoretical security. In the RJ scheme, the relay node is equipped with multiple antennas. It responses for two missions: re-transmitting the information signal from source code and broadcasting the jamming signal to degrade eavesdropper's channel. The objective of this paper is to maximize the achievable ergodic secrecy rate. We are interested in the scenario that eavesdropper's instant channel state information (CSI) is unknown, in which the ergodic secrecy rate expression is derived. The optimal power allocation between information signal and jamming signal at the relay node is found statistically to achieve the largest ergodic secrecy rate. Simulation is carefully designed and respective results are presented to confirm the theoretical analysis and compare with existing work.

UKSim European Symposium on Computer Modeling and Simulation (EMS)•Nov 1, 2013•1 citation

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

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

Secure wireless communications via cooperative relaying and jamming

Ling Tang, Xiaowen Gong, Jianhui Wu +1 more

We consider secure wireless communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2011•24 citations
We investigate secure communications for a four-node relay-eavesdropper channel with multiple data stream transmission, assuming that the eavesdropper's channel state information (ECSI) is unavailable. Our approach is to allocate part of the global transmit power to satisfy a fixed target rate for the relay link, and then use the remaining power for jamming the eavesdropper. Two cooperative jamming strategies are investigated. In the first, jamming signals are only broadcast by the terminals that are also transmitting data. In the second scheme, the normally inactive nodes in the relay network are used as cooperative jamming sources. Algorithms are proposed for allocating the transmit power and the number of signal dimensions that carry data. Simulation results show that, under a global transmit power constraint, the secrecy rate is dramatically increased when the normally inactive nodes in the relay network provide jamming support for the relayed signals.
Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.
We consider wireless secure communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate under individual power constraints. Further, we study the case with imperfect channel state information (CSI) for both CR and CJ. At last, extensive numerical results are provided.
In this paper, secure transmission is considered in a wireless relay network in the presence of an eavesdropper. A novel hybrid relay scheme, named as relaying-and-jamming (RJ), is advocated to achieve information theoretical security. In the RJ scheme, the relay node is equipped with multiple antennas. It responses for two missions: re-transmitting the information signal from source code and broadcasting the jamming signal to degrade eavesdropper's channel. The objective of this paper is to maximize the achievable ergodic secrecy rate. We are interested in the scenario that eavesdropper's instant channel state information (CSI) is unknown, in which the ergodic secrecy rate expression is derived. The optimal power allocation between information signal and jamming signal at the relay node is found statistically to achieve the largest ergodic secrecy rate. Simulation is carefully designed and respective results are presented to confirm the theoretical analysis and compare with existing work.
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.
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.
We consider secure wireless communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate.