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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Cooperative Jamming for Secure Transmission with Finite Alphabet Input under Individual Power Constraint

Kuo Cao, Yueming Cai, Yongpeng Wu, Weiwei Yang

Published May 31, 2018• 0 citations
Publisher

Abstract

This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.

DOI
10.1587/transfun.e101.a.961

Related papers

Cooperative Jamming for Secure Communication With Finite Alphabet Inputs

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This letter considers cooperative jamming to secure communication in the presence of multiple eavesdroppers with finite alphabet inputs. Considering the global constraint, the joint design of artificial noise covariance matrices and power allocation between the source and the relays is studied. Specifically, we transformed the problem of artificial noise design into a semi-definite programming problem, which is efficiently solved by standard optimization method. Besides, the power allocation between the source and relays is derived by utilizing the relationship between mutual information and minimum mean square error. Furthermore, a two-step algorithm is developed to enhance the achievable secrecy rate of cooperative jamming wireless network. Numerical examples demonstrate the proposed algorithm achieves a significant gain over the conventional counterparts in terms of secrecy rate.

IEEE Communications Letters•Jun 19, 2017•14 citations

Hybrid relaying and jamming for secure two-way relay networks with per-node power constraint

Hui‐Ming Wang, Miao Luo, Qinye Yin

Cooperative relaying and jamming are two efficient schemes to improve the physical-layer security of a wireless transmission in the presence of an eavesdropper. In this paper, we propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where some intermediate nodes adopt distributed beamforming to improve the channel quality to legitimate terminals and others jam the eavesdropper, simultaneously. Subjected to the more practical per-node power constraint of each cooperative node, we propose a secrecy scheme to maximize the secrecy sum rate of the two terminals. It is shown that the problem can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. We then propose a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization technique in the previous literature. Simulations show that the proposed hybrid schemes greatly improve the security of the two-way relay networks.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2012•1 citation

Joint Cooperative Beamforming and Jamming to Secure AF Relay Systems With Individual Power Constraint and No Eavesdropper's CSI

Hui‐Ming Wang, Miao Luo, Xiang‐Gen Xia +1 more

Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

IEEE Signal Processing Letters•Nov 14, 2012•192 citations

Optimal Transmit Design at Relay Nodes for Secure AF Relay Networks

Lingxiang Li, Liu Li, Zhi Chen +1 more

We study the transmit design at relay nodes for secure amplify-and-forward (AF) networks. Two joint cooperative relaying and jamming schemes, namely Secrecy Rate Maximization Scheme and Null-Space Jamming Scheme, are proposed. In the first scheme, optimal relaying weight vector and optimal covariance matrix associated with the artificial noise (AN) are obtained, which involves doing a one-dimensional search and solving a sequence of semidefinite programs(SDPs). In the second scheme, which is suboptimal but computationally much cheaper, AN is designed to decrease the rate at the eavesdropper while the relaying weight vector is determined to increase the rate at the destination. In addition, Power Allocation based on secrecy rate maximization provides a balance between these two goals. Numerical results show that the proposed Secrecy Rate Maximization Scheme outperforms the existing cooperative relaying without jamming scheme. Especially, when the power is large enough, the secrecy rate achieved by the proposed schemes approaches the maximal achievable rate for the no-eavesdropper case.

IEEE Vehicular Technology Conference•May 1, 2015•2 citations

Secure Communication for Amplify-and-Forward Relay Networks With Finite Alphabet Input

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.

IEEE Transactions on Information Forensics and Security•Mar 21, 2018•12 citations

Robust transmit design for secure AF relay networks based on worst-case optimization

Lingxiang Li, Zhi Chen, Jun Fang

This paper studies robust transmit design to maximize the worst-case secrecy rate in AF networks under both total and individual relay power constraints. Channel state information (CSI) in the network is assumed to be perfectly known except for that associated with the eavesdroppers whose imperfection is modeled as deterministic bounded errors. To use the power at the relay nodes more efficiently, a joint cooperative relaying and jamming scheme is considered. Through some matrix manipulations, we recast the original nonconvex optimization problem as a sequence of semidefinite programs (SDPs), which enables us to obtain the optimal relay weights and the optimal covariance matrix of the jamming signal. Numerical results are presented to show the efficacy of the proposed scheme.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•8 citations
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
This letter considers cooperative jamming to secure communication in the presence of multiple eavesdroppers with finite alphabet inputs. Considering the global constraint, the joint design of artificial noise covariance matrices and power allocation between the source and the relays is studied. Specifically, we transformed the problem of artificial noise design into a semi-definite programming problem, which is efficiently solved by standard optimization method. Besides, the power allocation between the source and relays is derived by utilizing the relationship between mutual information and minimum mean square error. Furthermore, a two-step algorithm is developed to enhance the achievable secrecy rate of cooperative jamming wireless network. Numerical examples demonstrate the proposed algorithm achieves a significant gain over the conventional counterparts in terms of secrecy rate.
Cooperative relaying and jamming are two efficient schemes to improve the physical-layer security of a wireless transmission in the presence of an eavesdropper. In this paper, we propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where some intermediate nodes adopt distributed beamforming to improve the channel quality to legitimate terminals and others jam the eavesdropper, simultaneously. Subjected to the more practical per-node power constraint of each cooperative node, we propose a secrecy scheme to maximize the secrecy sum rate of the two terminals. It is shown that the problem can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. We then propose a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization technique in the previous literature. Simulations show that the proposed hybrid schemes greatly improve the security of the two-way relay networks.
Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.
We study the transmit design at relay nodes for secure amplify-and-forward (AF) networks. Two joint cooperative relaying and jamming schemes, namely Secrecy Rate Maximization Scheme and Null-Space Jamming Scheme, are proposed. In the first scheme, optimal relaying weight vector and optimal covariance matrix associated with the artificial noise (AN) are obtained, which involves doing a one-dimensional search and solving a sequence of semidefinite programs(SDPs). In the second scheme, which is suboptimal but computationally much cheaper, AN is designed to decrease the rate at the eavesdropper while the relaying weight vector is determined to increase the rate at the destination. In addition, Power Allocation based on secrecy rate maximization provides a balance between these two goals. Numerical results show that the proposed Secrecy Rate Maximization Scheme outperforms the existing cooperative relaying without jamming scheme. Especially, when the power is large enough, the secrecy rate achieved by the proposed schemes approaches the maximal achievable rate for the no-eavesdropper case.
This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.
This paper studies robust transmit design to maximize the worst-case secrecy rate in AF networks under both total and individual relay power constraints. Channel state information (CSI) in the network is assumed to be perfectly known except for that associated with the eavesdroppers whose imperfection is modeled as deterministic bounded errors. To use the power at the relay nodes more efficiently, a joint cooperative relaying and jamming scheme is considered. Through some matrix manipulations, we recast the original nonconvex optimization problem as a sequence of semidefinite programs (SDPs), which enables us to obtain the optimal relay weights and the optimal covariance matrix of the jamming signal. Numerical results are presented to show the efficacy of the proposed scheme.