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

Computer Networks

Cooperative Jamming Aided Securing Wireless Communications Without Csi of Eavesdroppers

Kan Yu, Jiguo Yu, Zhiyong Feng, Min Guo

Published Jan 1, 2022• 2 citations
Publisher
DOI
10.1016/j.comnet.2023.109906

Related papers

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

Kenta Sasaki, Xuening Liao, Xiaohong Jiang

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.

International Symposium on Computing and Networking•Nov 1, 2017•7 citations

Cooperative Secrecy in Wireless Communications

Şennur Ulukuş, Ersen Ekrem

Springer eBooks•Jan 1, 2009•29 citations

An Effective Cooperative Jamming-Based Secure Transmission Scheme for a Mobile Scenario

Haidong Huang, Yan Huo, Qinghe Gao +2 more

Lecture notes in computer science•Nov 12, 2024•0 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

Cooperative Jamming-Aided Secure Communication in Wireless Powered Sensor Networks

Linqing Gui, Weihao Zhou, Pinchang Zhang +1 more

Cooperative jamming (CJ) is a promising technique for enhancing the physical-layer security in wireless powered sensor networks. The secrecy performance of CJ-aided wireless powered sensor networks is affected by three issues including disguised eavesdropper as cooperative node, estimation error of the channel between sink node and each sensor node, and distance-related limitation on the transmit power of cooperative nodes. To address the above issues, this paper proposes a CJ-aided secure communication scheme for wireless powered sensor networks with disguised eavesdropper and imperfect channel estimation. Since each cooperative node could be the disguised eavesdropper, the proposed scheme incorporates all possible cases of the eavesdropper disguising itself as unfixed cooperative jamming node. The maximization of secrecy rate over all possible cases is formulated for designing secrecy optimization problem. The imperfect channel estimation and distance-related jamming power limitation are both integrated as constraints into the secrecy rate maximization problem. Since the original optimization problem is complex and non-convex, a two-level optimization algorithm is proposed to solve it. Simulation results show that the proposed scheme achieves significant secrecy rate improvement over typical existing schemes.

IEEE Transactions on Dependable and Secure Computing•Mar 27, 2023•10 citations

Selective Modulation and Cooperative Jamming for Secure Communication in Untrusted Relay Systems

Li Qun Huang, Xiaoxu Wu, Hang Long

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2022•0 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.
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.
Cooperative jamming (CJ) is a promising technique for enhancing the physical-layer security in wireless powered sensor networks. The secrecy performance of CJ-aided wireless powered sensor networks is affected by three issues including disguised eavesdropper as cooperative node, estimation error of the channel between sink node and each sensor node, and distance-related limitation on the transmit power of cooperative nodes. To address the above issues, this paper proposes a CJ-aided secure communication scheme for wireless powered sensor networks with disguised eavesdropper and imperfect channel estimation. Since each cooperative node could be the disguised eavesdropper, the proposed scheme incorporates all possible cases of the eavesdropper disguising itself as unfixed cooperative jamming node. The maximization of secrecy rate over all possible cases is formulated for designing secrecy optimization problem. The imperfect channel estimation and distance-related jamming power limitation are both integrated as constraints into the secrecy rate maximization problem. Since the original optimization problem is complex and non-convex, a two-level optimization algorithm is proposed to solve it. Simulation results show that the proposed scheme achieves significant secrecy rate improvement over typical existing schemes.