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 Transactions on Signal Processing

Distributed Beamforming for Physical-Layer Security of Two-Way Relay Networks

Hui‐Ming Wang, Qinye Yin, Xiang‐Gen Xia

Published Mar 22, 2012• 289 citations
Publisher

Abstract

In this paper, we address the security of a two-way relay network in the presence of an eavesdropper, where each node is only equipped with single antenna. We propose two-phase distributed analog network coding, or distributed beamforming and power allocation to enhance the secrecy sum rate of the data exchange. In the first phase, the two terminals broadcast their information data simultaneously to all the relay nodes. In the second phase, three different security schemes are proposed: optimal beamforming, null-space beamforming, and artificial noise beamforming. In the first scheme, the objective is to achieve the maximum secrecy sum rate of the two terminals. Mathematically, the objective function is difficult to optimize. In the second scheme, we maximize the total information exchanged while we eliminate the information leakage completely, subject to the total transmission power constraint. We show that the problem has a unique and global optimum, which can be solved using bisection method. When the instantaneous channel state information of the eavesdropper is not available, we propose an artificial noise beamforming in the third scheme. We minimize the information transmission power so that the artificial noise power is maximized to eliminate information leakage, under the constraints of quality of service (QoS) required by terminals. It is a second-order convex cone programming (SOCP) problem, thus can be efficiently solved using interior point methods. Numerical results are provided and analyzed to show the properties and efficiency of the proposed designs.

DOI
10.1109/tsp.2012.2191543

Related papers

Improving the Physical-Layer Security of Wireless Two-Way Relaying via Analog Network Coding

Hui‐Ming Wang, Qinye Yin, Xiang‐Gen Xia

In this paper, we address the physical-layer security of two-way (bi-directional) transmissions of two terminals with the help of multiple relay nodes in the presence of an eavesdropper, where each node in the network is only equipped with single antenna. The secrecy sum rate is used as the metric of security, which is the rate difference between the legitimate information exchange between the terminals and the information leakage to the eavesdropper. We propose two-phase analog network coding (ANC) and power allocation scheme for the relay nodes and terminals to enhance the security of the data exchange. Three different schemes are proposed. The first scheme is the optimal ANC to achieve the maximum secrecy sum rate, i.e. secrecy capacity, which is found to be mathematically difficult to solve. Two suboptimal schemes are proposed with and without the instantaneous channel state information (CSI) of the eavesdropper, respectively. The solutions of both schemes are shown to be unique and globally optimum, which are solved by convex optimization techniques. Numerical evaluation results of the obtained secrecy sum rate and transmit power are provided and analyzed to show the properties and efficiency of the proposed ANCs.

Globecom•Dec 1, 2011•29 citations

Hybrid Cooperative Beamforming and Jamming for Physical-Layer Security of Two-Way Relay Networks

Hui‐Ming Wang, Miao Luo, Qinye Yin +1 more

In this paper, we propose a hybrid cooperative beamforming and jamming scheme to enhance the physical-layer security of a single-antenna-equipped two-way relay network in the presence of an eavesdropper. The basic idea is that in both cooperative transmission phases, some intermediate nodes help to relay signals to the legitimate destination adopting distributed beamforming, while the remaining nodes jam the eavesdropper, simultaneously, which takes the data transmissions in both phases under protection. Two different schemes are proposed, with and without the instantaneous channel state information of the eavesdropper, respectively, and both are subjected to the more practical individual power constraint of each cooperative node. Under the general channel model, it is shown that both problems can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. A current state of the art technique for handling such a problem is the semi-definite relaxation (SDR) and randomization techniques. In this paper, however, we propose a penalty function method incorporating the rank-1 constraint into the objective function. Although the so-obtained problem is not convex, we develop an efficient iterative algorithm to solve it. Each iteration is a convex SDP problem, thus it can be efficiently solved using the interior point method. When the channels are reciprocal such as in TDD mode, we show that the problems become second-order convex cone programming ones. Numerical evaluation results are provided and analyzed to show the properties and efficiency of the proposed hybrid security scheme, and also demonstrate that our optimization algorithms outperform the SDR technique.

IEEE Transactions on Information Forensics and Security•Oct 24, 2013•228 citations

To secure amplify-and-forward relay systems via joint cooperative beamforming and jamming

Hui‐Ming Wang, Xiang‐Gen Xia, Qinye Yin

Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, 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, such that both phases are secured. 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 China Summit and International Conference on Signal and Information Processing (ChinaSIP)•Jul 1, 2013•4 citations

Secure Beamforming with Artificial Noise for Two-way Relay Networks

Dandan Li, Ke Xiong, Guanyao Du +1 more

This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper.To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold.For comparsion, the relay beamforming without artificial noise (RBoA) is also considered.We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected.Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory.Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

KSII Transactions on Internet and Information Systems•Jun 26, 2013•3 citations

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•194 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
In this paper, we address the security of a two-way relay network in the presence of an eavesdropper, where each node is only equipped with single antenna. We propose two-phase distributed analog network coding, or distributed beamforming and power allocation to enhance the secrecy sum rate of the data exchange. In the first phase, the two terminals broadcast their information data simultaneously to all the relay nodes. In the second phase, three different security schemes are proposed: optimal beamforming, null-space beamforming, and artificial noise beamforming. In the first scheme, the objective is to achieve the maximum secrecy sum rate of the two terminals. Mathematically, the objective function is difficult to optimize. In the second scheme, we maximize the total information exchanged while we eliminate the information leakage completely, subject to the total transmission power constraint. We show that the problem has a unique and global optimum, which can be solved using bisection method. When the instantaneous channel state information of the eavesdropper is not available, we propose an artificial noise beamforming in the third scheme. We minimize the information transmission power so that the artificial noise power is maximized to eliminate information leakage, under the constraints of quality of service (QoS) required by terminals. It is a second-order convex cone programming (SOCP) problem, thus can be efficiently solved using interior point methods. Numerical results are provided and analyzed to show the properties and efficiency of the proposed designs.
In this paper, we address the physical-layer security of two-way (bi-directional) transmissions of two terminals with the help of multiple relay nodes in the presence of an eavesdropper, where each node in the network is only equipped with single antenna. The secrecy sum rate is used as the metric of security, which is the rate difference between the legitimate information exchange between the terminals and the information leakage to the eavesdropper. We propose two-phase analog network coding (ANC) and power allocation scheme for the relay nodes and terminals to enhance the security of the data exchange. Three different schemes are proposed. The first scheme is the optimal ANC to achieve the maximum secrecy sum rate, i.e. secrecy capacity, which is found to be mathematically difficult to solve. Two suboptimal schemes are proposed with and without the instantaneous channel state information (CSI) of the eavesdropper, respectively. The solutions of both schemes are shown to be unique and globally optimum, which are solved by convex optimization techniques. Numerical evaluation results of the obtained secrecy sum rate and transmit power are provided and analyzed to show the properties and efficiency of the proposed ANCs.
In this paper, we propose a hybrid cooperative beamforming and jamming scheme to enhance the physical-layer security of a single-antenna-equipped two-way relay network in the presence of an eavesdropper. The basic idea is that in both cooperative transmission phases, some intermediate nodes help to relay signals to the legitimate destination adopting distributed beamforming, while the remaining nodes jam the eavesdropper, simultaneously, which takes the data transmissions in both phases under protection. Two different schemes are proposed, with and without the instantaneous channel state information of the eavesdropper, respectively, and both are subjected to the more practical individual power constraint of each cooperative node. Under the general channel model, it is shown that both problems can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. A current state of the art technique for handling such a problem is the semi-definite relaxation (SDR) and randomization techniques. In this paper, however, we propose a penalty function method incorporating the rank-1 constraint into the objective function. Although the so-obtained problem is not convex, we develop an efficient iterative algorithm to solve it. Each iteration is a convex SDP problem, thus it can be efficiently solved using the interior point method. When the channels are reciprocal such as in TDD mode, we show that the problems become second-order convex cone programming ones. Numerical evaluation results are provided and analyzed to show the properties and efficiency of the proposed hybrid security scheme, and also demonstrate that our optimization algorithms outperform the SDR technique.
Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, 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, such that both phases are secured. 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.
This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper.To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold.For comparsion, the relay beamforming without artificial noise (RBoA) is also considered.We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected.Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory.Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.
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.
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.