Joint Relay Selection and Power Allocation for the Physical Layer Security of Two-Way Cooperative Relaying Networks

Pan, Lei; Li, Zan; Wang, Zhengyuan; Zhang, Fenggan

doi:https://doi.org/10.1155/2019/1839256

Wireless Communications and Mobile Computing

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest References Copyright Related Articles

Research Article | Open Access

Volume 2019 | Article ID 1839256 | https://doi.org/10.1155/2019/1839256

Joint Relay Selection and Power Allocation for the Physical Layer Security of Two-Way Cooperative Relaying Networks

Lei Pan,^1,2Zan Li,¹Zhengyuan Wang,²and Fenggan Zhang²

Academic Editor: Xianfu Lei

Received09 Oct 2018

Accepted04 Dec 2018

Published01 Jan 2019

Abstract

In this paper, we investigate the physical layer security of cooperative two-way relay transmission systems using the amplify-and-forward (AF) protocol in the presence of an eavesdropper. A joint relay selection (RS) and power allocation (PA) scheme is proposed to protect the source-destination transmission against the eavesdropper. However, due to the high computational complexity, it is difficult to obtain the optimal solution for the system secrecy rate. Fortunately, an approximate optimal solution by using the particle swarm optimization (PSO) algorithm is derived. In the simulations, we use random relay selection with optimal power allocation (RRS-OPA) and equal power allocation with optimal relay selection (EPA-ORS) as benchmark schemes to verify the effectiveness of the proposed method. The simulation results show that the proposed method outperforms both RRS-OPA and EPA-ORS and significantly improves the system performance with low complexity.

1. Introduction

Cooperative relaying is a promising technology for achieving full spatial diversity, improved network coverage, and system capacity [1–3]. There are two popular relaying protocols, namely, the one-way relaying and the two-way relaying [4–6]. The one-way relaying protocol needs four time-slots for the bidirectional transmission from source to destination. By contrast, the two-way relaying protocol requires only two time-slots for the same transmission, which greatly improves the spectral efficiency and system throughput [7–9]. In [10], the joint power allocation (PA) and network beamforming algorithms are proposed to minimize the total transmit power or maximize the sum-rate for a two-way multicarrier multirelay network. In [11], a joint relay selection (RS) and PA algorithm under transmit power and primary use interference constraints is presented in cognitive radio (CR) networks with multiple relays.

On the other hand, physical layer security [12–15] has attracted growing attention to enable secure communications. It is different from the traditional cryptographic methods that rely on computational complexity and secret keys. Physical layer security mainly exploits the physical characteristics of wireless channels to enhance the security of the signal transmission. In [16], a cooperative jamming scheme is investigated to improve the system’s secrecy rate for two-way relaying system with an eavesdropper node. In [17], a two-slot cooperative relaying scheme is proposed to maximize the secrecy rate and evaluate the physical-layer security performance. However, under eavesdropping environment, the joint optimization problem of RS and PA in two-way relay transmission is difficult to derive an optimal solution due to the high computational complexity. In the aforementioned works, few researches have been done for the joint optimization problem.

In this paper, a joint RS and PA algorithm with an eavesdropper for two-way relay transmission based on particle swarm optimization (PSO) is proposed to reduce the computational complexity and improve the system secrecy rate. The PSO algorithm is a swarm intelligent and evolutionary approach, inspired from birds’ flocking or fishes’ schooling for the solution of nonlinear, nonconvex, or combinatorial optimization problems [18, 19]. Recently, it has been applied to solve many complex optimization problems in communication networks. In [20], a novel relay resource scheme that uses the PSO algorithm to jointly search the transmit/receive antenna combining matrices is proposed in cooperative multiple input multiple output system. In [21], a generalized PSO model is proposed as a low complexity method for adaptive resource allocation to improve the bandwidth efficiency. It is shown that using PSO for subcarrier allocation has a lower complexity than linear and sorted list searches which have been used in the literature. However, few research investigate PSO algorithm in two-way cooperative relaying networks. Therefore, the proposed method based on PSO is investigated to improve the system performance with low complexity under eavesdropping environment.

The contributions in this paper are summarized as follows. Firstly, a joint relay selection (RS) and power allocation (PA) scheme is proposed to protect the source-destination transmission against the eavesdropper in the two-way cooperative relaying systems. Secondly, in order to reduce the computational complexity, we propose the optimization algorithm based on PSO to improve the system secrecy rate. And then, the simulation results show that our proposed method outperforms both random relay selection with optimal power allocation (RRS-OPA) and equal power allocation with optimal relay selection (EPA-ORS) and improves the system performance with low complexity significantly.

The remainder of this paper is organized as follows. The system model of cooperative two-way relaying protocol, with an eavesdropper, is given in Section 2. In Section 3, we present an optimal RS and PA scheme based on PSO. Moreover, in Section 4, simulation results are given to corroborate our study. Finally, Section 5 contains some concluding remarks.

2. System and Channel Model

We consider a wireless cooperative relay communication system as shown in Figure 1, which includes a pair of transceiver nodes (S₁ and S₂), an eavesdropper node E and L friendly relay nodes (). It is assumed that there is no direct link between S₁ and S₂. In addition, E is assumed to be within the coverage area of all nodes (S₁, S₂ and R_i). All of the nodes are equipped with single antenna and operated in half-duplex mode. We assume that both the main and the wiretap are modeled by Rayleigh fading channels, and the channels are reciprocal.

The relays employ amplify-and-forward (AF) two-way relaying, where the communication process between the two transceiver nodes takes place in two time-slots. In the first time-slot, both transceivers transmit their data to the relays simultaneously. Let the transceiver nodes, S₁ and S₂, transmit the symbols and , respectively. Without loss of generality, we assume that , where and denote the expectation operator and the absolute value of a complex number, respectively. The signals received at the relays can be expressed aswhere and are the transmit power from and to the th relay () respectively. and denote the channel gain for links and respectively. In addition, is an independent and identically distributed (i.i.d) complex Gaussian random variable with zero mean and variance representing the additive noise at the th relay node.

At the same time, the signals received at from and can be expressed aswhere and denote the channel gain for links and respectively. is an i.i.d complex Gaussian random variable with zero mean and variance representing the additive noise at the node.

And then, as can be seen from (2), receives a mixed signal including and . The node can employ the two matched filters corresponding to and . So, is treated as interference while eavesdropping at , and vice versa. The received SNR at with respect to can be written as

Similarly, the received SNR at with respect to can be given by

In the second time-slot, each relay transmits a scaled version of the signal received in the previous time-slot. And the signals received at the , , and are denoted as , , and respectively, which can be expressed asandwhere is the gain factor. denotes the channel gain for links . , , and stand for the additive white Gaussian noise (AWGN) at , , and , with zero mean and variances , , and , respectively. Through the analysis of the formulas (5) and (6), the first term in (5) and the second term in (6) can be subtracted from and , respectively, known as self-interference. Thus, the residual signals and can be given byand

Therefore, the SNR at and can be written asand

For the same reason as (3) and (4), the SNR at the eavesdropper equalsand

And then, the transmit power of the th relay can be given by

From (14), it can be derived

So, substituting (15) into (10), (11), (12), and (13), we obtain (16)-(19), respectively.

It is assumed that the eavesdropper performs maximal-ratio combining of the first and second slot received signals, so its SNR equalsand

3. Optimal Relay Selection and Power Allocation

In this section, we consider the joint optimal RS and PA for the two-way relaying network. RS and PA [11] can be formulated as the following optimization problem,where is the index of the selected best relay, is the secrecy rate, and is defined by the transmit power. This is a joint optimization over the relay indexes and the transmit powers. Thus, we first obtain the maximization of the secrecy rate according to the transmit powers of the relay and transceivers.

The system secrecy rate [16] can be given bywhereandwhere denotes .

Based on (22), (23), and (24), the power allocation problem can be formulated as follows:where . is the total system power constraint.

However, this is a nonconcave and nonconvex problem through analysis. Due to the high computational complexity, it is difficult to derive an optimal solution. In this paper, the PSO algorithm is considered to solve this complex optimization problem and achieve the optimal results. The flowchart of the proposed PSO algorithm is shown in Figure 2. It is assumed that there are particles in the population. Each particle has a corresponding velocity, position, the local optimum, and the global optimum solution in the evolutionary process of the proposed PSO scheme.

In the initial step, a swarm is created and initialized. We denote the th particle’s velocity, position, the local optimum, and the global optimum solution, respectively, as ,, , and for the 1st generation.

In the second step, the velocity and position of the particle are modified so that the particle is within the effective range. The th particle’s velocity is checked by if or , , then , else .

where , are the th particle’s velocity and position, respectively, in the th generation .

In the third step, the corresponding particles’ positions can be updated by

In the fourth step, the objective value of is evaluated in (27). And the corresponding particles’ local optimum solution and global optimum solution , respectively, can be updated by

And then, updating the velocities of the particles for the next generation can be given bywhere and are random variables uniformly distributed in the range .

The steps in Figure 2 are repeated until the number of iterations is , i.e., . Finally, the optimal power allocation problem in (27) can be achieved. After determining the solution, the best relay can be selected, i.e.,, . is the secrecy rate of the th relay with optimal power allocation.

4. Simulation Results

In this section, the simulation setting is to confirm the proposed optimal RS and PA scheme. It is assumed that both the main and the wiretap are modeled by Rayleigh fading channels, and the channels are reciprocal. We assume that the channel state information (CSI) is perfectly known. The channels among all of nodes are assumed to be i.i.d, complex Gaussian with zero mean and unit variance. In simulations, the parameter is set as the number of relays . Further, we set the number of particles and the number of iterations in the population.

Figure 3 shows the system secrecy rate versus the number of relays for the different power allocation scheme. In this simulations, the parameter is set as = 30dB. There are two situations to be considered: the EPA-ORS and the proposed joint RS and PA scheme. It demonstrates clearly that, compared with two cases, the optimal performance of the system secrecy rate is achieved in the proposed scheme. This can be explained that the power allocation scheme based on PSO can increase the system secrecy rate.

Figure 4 illustrates the system secrecy rate versus the number of relays for the different relay selection scheme. These are the RRS-OPA and the proposed optimal PA/RS scheme based on PSO, respectively. It is observed that the proposed method is superior to RRS-OPA scheme. The reason is that potential selection diversity gain is improved. For RRS-OPA scheme, it has nothing to do with the number of relays. And, in Figures 2 and 3, the simulation results clearly show that the PSO algorithm can solve this complex optimal PA/RS problem and achieve the optimal results.

Figure 5 illustrates the system secrecy rate versus the number of relays for the different eavesdropping area of eavesdropper. There are three cases to be considered: the nodes R only can be eavesdropped; the nodes R and the partial transceiver nodes ( or ) can be eavesdropped; all of the nodes can be eavesdropped (the proposed model). It is seen clearly that the optimal performance of the system secrecy rate is achieved in the first case. This can be explained that potential spatial diversity gain is different for the different eavesdropping area of eavesdropper. The system secrecy rate decreases with the increases of eavesdropping area. So, it is noteworthy that the eavesdropping area of eavesdropper cannot be ignored.

Figure 6 depicts the system secrecy rate versus the number of relays for three given the total system power constraint = 10dB, 20dB, 30dB. It is observed that the system secrecy rate increases with the increase of the total system power constraint. The reason is that the higher total power constraint is, the higher transmit powers at the transceiver nodes and the relay nodes are. On the other hand, by comparing with the different number of candidate relays, the system secrecy rate can be enhanced by increasing the number of relays. This is because potential selection diversity gain is increased.

5. Conclusion

The joint optimization problem of RS and PA with an eavesdropper for two-way relay transmission is a complex optimization problem. And it is difficult to derive an optimal solution. In this paper, we investigate an optimal RS and PA scheme based on PSO in two-way relaying systems to solve this problem. RRS-OPA and EPA-ORS as benchmark schemes are used to verify the effectiveness of the proposed method. The simulation results show that the proposed method outperforms both RRS-OPA and EPA-ORS and significantly improves the system performance with low complexity.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

J. M. Paredes, B. H. Khalaj, and A. B. Gershman, “Cooperative transmission for wireless relay networks using limited feedback,” IEEE Transactions on Signal Processing, vol. 58, no. 7, pp. 3828–3841, 2010.
View at: Publisher Site | Google Scholar | MathSciNet
J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, 2004.
View at: Publisher Site | Google Scholar | MathSciNet
A. Bletsas, H. Shin, and M. Z. Win, “Cooperative communications with outage-optimal opportunistic relaying,” IEEE Transactions on Wireless Communications, vol. 6, no. 9, pp. 3450–3460, 2007.
View at: Publisher Site | Google Scholar
M. Xia and S. Aïssa, “Moments based framework for performance analysis of one-way/two-way CSI-assisted AF relaying,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 8, pp. 1464–1476, 2012.
View at: Publisher Site | Google Scholar
Y. Li, T. Wang, Z. Zhao, M. Peng, and W. Wang, “Relay Mode Selection and Power Allocation for Hybrid One-Way/Two-Way Half-Duplex/Full-Duplex Relaying,” IEEE Communications Letters, vol. 19, no. 7, pp. 1217–1220, 2015.
View at: Publisher Site | Google Scholar
L. Pan, J. Si, Z. Li, H. Huang, and J. Chen, “Optimal relay selection and power allocation for cognitive two-way relay transmission with primary user's interference,” in Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC '13, pp. 1797–1801, China, April 2013.
View at: Google Scholar
K.-S. Hwang, Y.-C. Ko, and M.-S. Alouini, “Performance analysis of two-way amplify and forward relaying with adaptive modulation over multiple relay network,” IEEE Transactions on Communications, vol. 59, no. 2, pp. 402–406, 2011.
View at: Publisher Site | Google Scholar
X. Cheng, B. Yu, X. Cheng, and L. Yang, “Two-Way Full-Duplex Amplify-and-Forward Relaying,” in Proceedings of the IEEE Military Communications Conference (MILCOM '13), pp. 1–6, San Diego, CA, USA, 2013.
View at: Publisher Site | Google Scholar
E. Li, S. Yang, and H. Wu, “A source-relay selection scheme in two-way amplify-and-forward relaying networks,” IEEE Communications Letters, vol. 16, no. 10, pp. 1564–1567, 2012.
View at: Publisher Site | Google Scholar
R. AliHemmati, S. ShahbazPanahi, and M. Dong, “Joint spectrum sharing and power allocation for OFDM-Based two-way relaying,” IEEE Transactions on Wireless Communications, vol. 14, no. 6, pp. 3294–3308, 2015.
View at: Publisher Site | Google Scholar
P. Ubaidulla and S. Aïssa, “Optimal relay selection and power allocation for cognitive two-way relaying networks,” IEEE Wireless Communications Letters, vol. 1, no. 3, pp. 225–228, 2012.
View at: Publisher Site | Google Scholar
Y. Zou, “Physical-Layer Security for Spectrum Sharing Systems,” IEEE Transactions on Wireless Communications, vol. 16, no. 2, pp. 1319–1329, 2017.
View at: Publisher Site | Google Scholar
F. Zhu, F. Gao, T. Zhang, K. Sun, and M. Yao, “Physicallayer security for full duplex communications with self-interference mitigation,” IEEE Transactions on Wireless Communications, vol. 15, no. 1, pp. 329–340, 2016.
View at: Publisher Site | Google Scholar
Y. Zou, J. Zhu, L. Yang, Y.-C. Liang, and Y.-D. Yao, “Securing physical-layer communications for cognitive radio networks,” IEEE Communications Magazine, vol. 53, no. 9, pp. 48–54, 2015.
View at: Publisher Site | Google Scholar
H.-M. Wang, Q. Yin, and X.-G. Xia, “Distributed beamforming for physical-layer security of two-way relay networks,” IEEE Transactions on Signal Processing, vol. 60, no. 7, pp. 3532–3545, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
H. Long, W. Xiang, J. Wang, Y. Zhang, and W. Wang, “Cooperative jamming and power allocation with untrusty two-way relay nodes,” IET Communications, vol. 8, no. 13, pp. 2290–2297, 2014.
View at: Publisher Site | Google Scholar
Y. Liu, J. Li, and A. P. Petropulu, “Destination assisted cooperative jamming for wireless physical-layer security,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 4, pp. 682–694, 2013.
View at: Publisher Site | Google Scholar
J. C. Bansal, “Particle Swarm Optimization,” in Evolutionary and Swarm Intelligence Algorithms, vol. 779 of Studies in Computational Intelligence, pp. 11–23, Springer International Publishing, Cham, 2019.
View at: Publisher Site | Google Scholar
M. R. Javan, N. Mokari, F. Alavi, and A. Rahmati, “Resource Allocation in Decode-and-Forward Cooperative Communication Networks with Limited Rate Feedback Channel,” IEEE Transactions on Vehicular Technology, vol. 66, no. 1, pp. 256–267, 2017.
View at: Google Scholar
H.-Y. Lu, “Particle swarm optimization assisted joint transmit/receive antenna combining for multiple relays in cooperative MIMO systems,” Applied Soft Computing, vol. 12, no. 7, pp. 1865–1874, 2012.
View at: Publisher Site | Google Scholar
S. Gheitanchi, F. Ali, and E. Stipidis, “Particle swarm optimization for adaptive resource allocation in communication networks,” EURASIP Journal on Wireless Communications and Networking, vol. 2010, 2010.
View at: Google Scholar

Copyright

Copyright © 2019 Lei Pan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

985

Downloads

967

Citations