Next Article in Journal
Bulk Bias as an Analog Single-Event Transient Mitigation Technique with Negligible Penalty
Next Article in Special Issue
Hybrid Solar-RF Energy Harvesting Systems for Electric Operated Wheelchairs
Previous Article in Journal
Improved Clutter Removal by Robust Principal Component Analysis for Chaos Through-Wall Imaging Radar
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Secure Energy-Efficient Resource Allocation Algorithm of Massive MIMO System with SWIPT

1
School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2
Institute of Next Generation Network, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
*
Author to whom correspondence should be addressed.
Current address: No. 2 Chongwen Road, Nan’an District, Chongqing 400064, China.
Electronics 2020, 9(1), 26; https://doi.org/10.3390/electronics9010026
Submission received: 24 October 2019 / Revised: 20 December 2019 / Accepted: 22 December 2019 / Published: 25 December 2019
(This article belongs to the Special Issue RF Energy Harvesting and Wireless Power Transfer)

Abstract

:
In this paper, we consider the resource allocation problem to maximize the minimum (max–min) user’s secure energy efficiency (SEE) in downlink massive multiple-input multiple-output (MIMO) systems with simultaneous wireless information and power transfer (SWIPT). First, transmission power and power splitting ratio are designed to achieve the max–min user’s SEE subject to harvested energy threshold, the constraints of transmission power, and power splitting ratio. Secondly, the optimization problem is non-convex and very difficult to tackle. In order to solve the optimization problem, we converted to a series of parameter optimization subproblems by fractional programming. Then, we employ the first-order Taylor expansion and successive convex approximation (SCA) method to solve parameter optimization problems. Next, a secure energy-efficient resource allocation (SERA) algorithm with the bisection method is proposed to find the max–min SEE of the system. Finally, simulation results show the effectiveness and superiority of the SERA algorithm.

1. Introduction

With the rapid development of mobile internet technology, the broadcast characteristics of wireless information have led to severe information leakage problems. Physical layer security has increasingly attracted research interests in 5th-Generation (5G) mobile communication because it can ensure safe protection from information theory even when eavesdroppers have a powerful computing ability [1]. Massive multiple-input multiple-output (MIMO) is a promising technology in 5G which can be used to improve the spectrum efficiency and security of wireless communication. Moreover, massive MIMO can be used to enhance the security and power transfer efficiency of a simultaneous wireless information and power transfer (SWIPT) system because it can beamform the energy and information more accurately with large array gain [2,3].
Secure problems in massive MIMO systems have been investigated in References [4,5,6,7,8,9,10,11]. The authors in Reference [4] studied the impact of residual hardware impairment (HWI) on massive MIMO secure communication and showed the HWI has a negative impact on information security. In Reference [5], S. Timilsina et al. studied the effect of active eavesdropping on physical layer security and revealed that active eavesdroppers had a stronger ability to eavesdrop confidential information with higher pilot power. In Reference [6], Z. Chu et al. studied a MIMO secrecy channel with SWIPT. The minimum harvested energy is maximized under the secrecy rate requirements. In Reference [7], H. D. Tuan et al. considered the problem of power allocation to maximize the worst links’ secrecy throughput or the network’s secure energy efficiency (SEE) under various scenarios of available channel state information. In Reference [8], C. Du et al. studied massive MIMO relay-assisted secure communication systems, which considered the channel reciprocity in time division duplexing (TDD) mode and the energy harvesting at the relay. An energy efficiency power allocation (EEPA) scheme is proposed to maximize SEE. In Reference [9], J. He et al. studied the effect of channel aging on full-duplex massive MIMO spectral efficiency (SE) and energy efficiency (EE) and proposed four power allocation schemes. In Reference [10], S. Timilsina et al. studied relay-assisted massive MIMO downlink secure transmission with the random and zero-space degrees of freedom of artificial noise (AN) matrix vectors. In Reference [11], J. Zhu et al. studied the influence of phase noise on the downlink of secure massive MIMO with a SWIPT system. The closed-form lower bound on the worst-case secrecy rate is derived. However, most of the above works focus on security rate optimization. Energy efficiency has been one of the key performance indexes for 5G because green communication has become the developing trend and direction of the future society [12]. Therefore, it is important to optimize SEE for massive MIMO with SWIPT.
In this paper, we consider secure transmission in massive MIMO systems with SWIPT. A secure energy-efficiency resource allocation (SERA) algorithm for massive MIMO systems with SWIPT is proposed. The users utilize the harvesting energy in the previous time slot to transmit pilot information, and the active eavesdropper transmits the same pilot information as a user to achieve the purpose of eavesdropping. To reduce the eavesdropping ability of the active eavesdropper, the base station (BS) uses AN auxiliary communication. At the BS, the power splitting ratio is used to reasonably allocate the information transmission power and the AN transmission power. The AN matrix-vector at the BS adopts the null space beamforming [13], which is simplified by the properties of the Wishart matrix. By adopting a variable substitution method, the non-convex SEE maximization problem is converted into a series of parameter optimization subproblems by fractional programming. A joint power splitting ratio and the BS transmitted power allocation algorithm are proposed to maximize the minimum (max–min) SEE of the user. Simulation results are also compared with the users’ system SEE maximization in Reference [14,15] and the secure rate maximization in Reference [16] to confirm the effectiveness and superiority of the SERA algorithm.
Notation: Bold letters denote matrices or vectors, · H denotes conjugate transposes of matrices or vectors, · T denotes transpose of matrices or vectors, T r · denotes trace of matrices, E · denotes mathematical expectation, ⊗ are the Kronecker product, and x + = m a x { 0 , x } .

2. System Model

As shown in Figure 1, a single-cell downlink massive MIMO system with SWIPT consists of one BS connected with K users and one eavesdropper [17,18,19]. The number of transmitting antennas at BS is N, which satisfies N > > K . Each user and the eavesdropper are equipped with a single antenna. The BS simultaneously serves K users in the same time-frequency resource block [20]. Especially, it is assumed that the active eavesdropper perfectly knows the pilot sequence transmitted by the mth user node [21], where m { 1 , , K } . Without loss of generally, we suppose that each time slot has a unit length. Each time slot has two parts. In the first time slot τ , users use the energy harvested by the previous time block to transmit pilot information to the BS. The active eavesdropper also transmits pilot information to the BS. In the 1 τ time slot, BS transmits information or energy to users and the eavesdropper. The user’s terminal receiver decodes the signal into two parts; one part is used for information decoding, and the other is used for energy harvesting. The eavesdropper mainly is used for information decoding [15].
The BS-to-user and BS-to-eavesdropper channels are denoted by G , h , which is given by
G = D G ¯ , h = ϑ h ¯
where G ¯ CN K × N ( 0 , I K I N ) and h ¯ C N 1 × N ( 0 , I 1 × N ) are the small scale Rayleigh fading and where D m , m = β m , m = { 1 , , K } and ϑ are the path loss from BS-to-user and BS-to-eavesdropper channels, respectively. The path loss is modeled as β m = l m r and ϑ = d r , where r is the path loss exponent factor, l m is the distance between the BS and user m, and d is the distance between the BS and eavesdropper [5].
In TDD massive MIMO, the users-to-BS and eavesdropper-to-BS channels are estimated at the BS via uplink pilots transmitted. The BS stores the channel state information (CSI) through channel reciprocity. The superimposed pilot signal received at BS is
y B S = τ p u G T s + τ p e h T s m + n
where p u and p e express the average transmit powers from the users and the eavesdropper; s = { s 1 , , s m , s K } T , where s m s m H = 1 and s m s m H = 0 for m m and m , m { 1 , , K } . n is the noise with independent and identically distributed (i.i.d.) CN ( 0 , 1 ) distribution for each element. Assuming that BS uses the minimum mean squared error (MMSE) estimation, the BS-to-user channel is obtained as follows [5,19]:
G = G ^ + E
g ^ m = ( τ p u g m + τ p e h + n ) ( τ p u β m + I i , m τ p e ϑ + 1 ) 1 τ p u β m
where G ^ = { g ^ 1 , g ^ 2 , , g ^ K } , i, m { 1 , , K } , I i , m = 1 , m = i I i , m = 0 , m i , β ^ m = τ p u β m 2 τ p u β m + I i , m τ p e ϑ + 1 , E is the estimation error matrix.
To prevent the eavesdropper from stealing confidential information, the BS introduces AN subsidiary communications [13]. The BS uses the power splitting ratio to information power and AN transmission power [5,19]; the transmission information at BS is given as follows:
X = W ^ P t φ x + V ( I φ ) P t N K z
where P t represents the transmit power; φ = d i a g ( φ 1 , φ 2 , , φ K ) , where φ m is the power splitting ratio coefficient of the BS for user m ( m = 1 , , K ) ; channel matrices W ^ C N × K and V C N × K denote the precoding matrix for the data and AN [13,22]; W ^ = α G ^ H ( G ^ G ^ H ) 1 ; α = N K T r ( D ^ 1 ) ; V = ( I G ^ H ( G ^ G ^ H ) 1 G ^ ) ; x = { x 1 , x 2 , , x K } T is the signal vector transmitted to K users satisfying E [ x x H ] = I K ; and z CN ( 0 K , σ z 2 I K ) is an AN sequence.
The users utilize the power splitting ratio to decode information from BS simultaneously, where one part is used to harvest energy and the other part is decoded into useful information, and the eavesdropper mainly wiretaps useful information from BS [23]. Therefore, the mth user and the eavesdropper receiving useful information is given as follows [5,19,20]:
y m = P t φ m ( 1 ρ m ) g m W ^ m x m + P t φ m ( 1 ρ m ) ( g m W ^ m E [ g m W ^ m ] ) x m + m i K P t φ m ( 1 ρ m ) g m W ^ i x i + P t ( 1 φ m ) ( 1 ρ m ) ( N K ) g m Vz + n m
y e , m = P t φ m h W ^ m x m + P t ( 1 φ m ) ( N K ) hVz + n e
where ρ = { ρ 1 , , ρ m , , ρ K } express the power splitting receiver from users. The first item denotes the desired signal, the second term is the beamforming gain uncertainty, the third term is the inter-user interference, and the remaining terms are AN leaked to legitimate users and the additive white Gaussian noise (AWGN) at the mth user node. The mth user harvest energy is given by
E m ( P t , φ m , ρ m ) = η m ( 1 τ ) ρ m ( P t φ m | g m W ^ m | 2 + ( 1 φ m ) P t σ z 2 | g m V | 2 N K )
where η m ( 0 < η m 1 ) is the energy conversion efficiency for user m, which transfers the harvested energy into electric energy stored by the users and eavesdropper.
Provided that the worst-case uncorrelated additive noise distributed as independent Gaussian noise has the same variance [5], the achievable rate of the mth user can be lower bounded by the following expression
R m l ( P t , φ m , ρ m ) = ( 1 τ ) ln ( 1 + E [ γ m ] )
where γ m is given by
γ m = ( 1 ρ m ) P t φ m | g m W ^ m | 2 ( 1 ρ m ) P t φ m | g m W ^ m E [ g m W ^ m ] | 2 + γ m , o
where γ m , o is the effective noise which is defined as follows:
γ m , o = ( 1 ρ m ) P t φ m m i K | g m W ^ i | 2 + P t ( 1 φ m ) ( 1 ρ m ) σ z 2 | g m V | 2 ( N K ) + σ m 2
Provided that the eavesdropper eliminates the other users interference terms [5,19], the upper bounded achievable rate of the mth user signal leaked into eavesdropper can be written as
R e , m u ( P t , φ m ) = ( 1 τ ) ln ( 1 + E [ γ e , m ] )
where γ e , m is expressed as
γ e , m = P t φ m | h W ^ m | 2 ( 1 φ m ) P t σ z 2 | h V | 2 N K + σ e 2
Hence, the mth user achievable secure rate is as follows [5,19]:
R s e c , m ( P t , φ m , ρ m ) R ¯ s e c , m ( P t , φ m , ρ m ) = m a x { 0 , R m l ( P t , φ m , ρ m ) R e , m u ( P t , φ m ) }
Using wishart matrix to simplify Equations (8)–(14) as in References [5,19], the harvesting energy by user m can be written as follows:
E m ( P t , φ m , ρ m ) = P t η m ( 1 τ ) ρ m ( φ m α 2 + ( 1 φ m ) σ z 2 ( β m β ^ m ) N K )
The achievable secure rate of user m is given by [5,19]
R m l ( P t , φ m , ρ m ) = ( 1 τ ) ln ( 1 + ( E [ γ m 1 ] ) 1 ) = ( 1 τ ) ln ( 1 + φ m α 2 ( 1 ρ m ) P t ( φ m A m + ( 1 φ m ) B m ) ( 1 ρ m ) P t + σ m 2 )
The achievable rate of the mth user signal leaked into eavesdropper is simplified as follows [5,19]:
R e , m u ( P t , φ m ) = ( 1 τ ) ln ( 1 + ( E [ γ m 1 ] ) 1 ) = ( 1 τ ) ln ( 1 + φ m C m P t ( 1 φ m ) D m P t + σ e 2 )
where A m = α 2 ( β m β ^ m ) N K ( β ^ m 1 + i m K β ^ i 1 ) > 0 , B m = σ z 2 ( β m β ^ m ) ( N K ) > 0 , C m = α 2 ϑ 2 β m 2 p u p e > 0 , and D m = σ z 2 ϑ N K > 0 .

3. Problem Formulation and Energy-Efficient Algorithm

With the above analysis for achievable rate and energy for user and eavesdropper, the max–min SEE optimization problem of the system can be expressed as
P 1 : m a x P t , φ m , ρ m m i n 1 m K R ¯ s e c , m ( P t , φ m , ρ m ) ε ( P t φ m ( 1 τ ) + p u τ ) + P c , m s . t . C 1 : m = 1 K P t φ m P m a x , m = 1 , , K , C 2 : E 0 E m ( P t , φ m , ρ m ) , m = 1 , , K , C 3 : 0 < P t , 0 < φ m , m = 1 , , K , C 4 : 0 < ρ m < 1 , m = 1 , , K
In P 1 , the objective is to maximize and minimize SEE of the system. C 1 and C 3 are the transmit power constraints, and C 2 is the energy harvested constraint for user m. ε ( P t φ m ( 1 τ ) + p u τ ) and P c , m denote the power consumption of the mth user and circuit consumption, and ε denotes the power consumption coefficient.
The optimal solution to Equation (18) can be solved by fractional programming [24] to find zero roots of the following parameter optimization problem F ( λ ) [25]:
F ( λ ) = m a x P t , φ m , ρ m m i n 1 m K { R m l ( P t , φ m , ρ m ) R e , m u ( P t , φ m ) λ ( ε ( P t φ m ( 1 τ ) + p u τ ) + P c , m ) }
According to the conclusions in References [24,25], the optimal solution to Equation (19) is λ * such that F ( λ * ) = 0 is held. We define Γ m as
Γ m ( λ , P t , φ m , ρ m ) = R m l ( P t , φ m , ρ m ) R e , m u ( P t , φ m ) λ ( ε ( P t φ m ( 1 τ ) + p u τ ) + P c , m )
Due to the non-smoothness of the objective function, we introduce a new variable t to transform the equivalent non-smooth optimization problem in Equation (20) into a smooth optimization problem. Equation (18) can be equivalently reformulated as
P 2 : m a x P t , φ m , ρ m , t t s . t . C 1 : m = 1 K P t φ m P m a x , m C 2 : E 0 η m ( 1 τ ) ρ m ( P t φ m α 2 + ( 1 φ m ) P t σ z 2 ( β m β ^ m ) N K ) , m C 3 : 0 < P t , 0 < φ m , m C 4 : 0 < ρ m < 1 , m C 5 : t Γ m ( P t , φ m , ρ m ) , m
P 2 has four optimization variables. First, fix BS’ power splitting ratio coefficient φ m and the transmit power P t are used to obtain a ρ m suboptimal solution. Then, use the suboptimal solution of ρ m iterative optimization power splitting ratio coefficient φ m and the BS transmit power P t . Finally, update variable t.
Firstly, optimize ρ m . Because ρ m is only associated with R m l ( P t , φ m , ρ m ) from Equations (16) and (20), which is monotonic decreasing function about ρ m , ρ m depends on constraint C 2 .
ρ m = ( E 0 η m ( 1 τ ) P t ( φ m α 2 + ( 1 φ m ) σ z 2 ( β m β ^ m ) N K ) ) , m
Then, optimize φ m , and P t is a hard problem. In Equation (21), the difference of two convex functions is non-convex. Therefore, we need to replace the non-convex part in Equation (21) by linear approximation and we rewrite constraint C 5 ; let
f m ( P t , φ m ) = ( 1 τ ) ln ( 1 + α 2 ( 1 ρ m ) P t φ m ( P t φ m A m + ( 1 φ m ) P t B m ) ( 1 ρ m ) + σ m 2 ) λ ( ε ( P t φ m ( 1 τ ) + p u τ ) + P c , m ) , m
h m ( P t , φ m ) = ( 1 τ ) ln ( 1 + C m P t φ m ( 1 φ m ) D m P t + σ e 2 ) , m
Finally, we use the difference of convex functions algorithm (DCA) from References [14,26]. P 3 is as follows:
P 3 : m a x P t , φ m , t t s . t . C 1 , C 2 , C 3 , C 4 C 5 : t f m ( P t , φ m ) h m ( P t , φ m ) , m
In Equation (25), C 5 is the difference between two concave functions, which can be effectively solved by sequential convex programming. At step n, we get an iterative power allocation. We use first-order Taylor expansion h m ( P t , φ m )
h m ( P t , φ m ) = h m ( P t n , φ m n ) + h m ( P t n , φ m n ) P t n ( P t P t n ) + h m ( P t n , φ m n ) φ m n ( φ m φ m n ) , m
We further transform P 3 into
P 4 : m a x P t , φ m , t t s . t . C 1 , C 2 , C 3 , C 4 C 5 : t f m ( P t , φ m ) ( h m ( P t n , φ m n ) + h m ( P t n , φ m n ) P t n ( P t P t n ) + h m ( P t n , φ m n ) φ m n ( φ m φ m n ) ) , m
P 4 now is a smooth and standard convex optimization problem, and thus, it can be efficiently solved by successive convex approximation (SCA) method [15].
Up till now, the convex programming P 4 is capable of successively approximating the solution of the original SEE optimization problem. We will employ the bisection method in one-dimension to update λ
F ( λ ) = R m l ( P t * , φ m * , ρ m * ) R e , m u ( P t * , φ m * ) λ ( ε ( P t * φ m * ( 1 τ ) + p u τ ) + P c , m )
where ρ m * is the optimal values of ρ m in Equation (22) and where P t * and φ m * are the optimal values of P t and φ m from Algorithm 1.
Algorithm 1 SCA algorithm for solving Equation (26)
  • Initialization
  •       Set n = 0 and the tolerance 0 < ζ 1 .
  •       Set φ m 0 , ρ m 0 , P t 0 ,calculate F 0 = m i n m [ f m ( φ m 0 , P t 0 ) h m ( φ m 0 , P t 0 ) ]
  • repeat
  •       Solve (27) to obtain P t * and φ m *
  •       Set n = n + 1 , and P t n = P t * and φ m n = φ m *
  •       Calculate F n = m i n m [ f m ( φ m n , P t n ) h m ( φ m n , P t n ) ]
  • until
  •        F n F n 1 < ζ
Based on the above discussion, we propose a SERA algorithm for the max–min SEE in massive MIMO systems by Algorithm 2.
Then, we characterize the computational complexity of the proposed algorithm to get a better insight into the computational complexity of the SERA algorithm. The SCA method complexity is O ( I K 3 2 l o g 1 ς ) [27]; ς is the convergence precision, and I denotes the value of iterations. Therefore, the total computational complexity of the SERA algorithm is about O ( I 2 K 3 2 l o g L ς 2 ) , and L is the length of the value.
Algorithm 2 SERA algorithm for the min user’ SEE maximization.
  • InitializationN, K, τ , ε , η , σ 2 , P m a x , φ m 0 , for m = 1 , , K . SEE initial value λ m i n , λ m a x , tolerance 0 < ζ 1 , ρ m 0 , P t 0 , iteration index i = 0 , the maximum iteration number T m a x .
  • repeat
  •       Set λ i = ( λ m a x + λ m i n ) 2
  •        F λ m i n i , F λ m a x i
  •       Solve (28) for given λ i and obtain the P t i and φ m i using SCA method.
  • if ( | F ( λ i ) = m i n m ( R m ( P t i , φ m i ) R e , m ( P t i , φ m i ) λ i ( ε ( P t i φ m i ( 1 τ ) + p u τ ) + P c , m ) | ) < ζ then
  •        φ * = φ m i , P t * = P t i , λ * = m i n m R m ( P t * , φ m * ) R e , m ( P t * , φ m * ) ( ε ( P t * φ m * ( 1 τ ) + p u τ ) + P c , m )
  • else if
  •        F ( λ i ) < 0 then
  •        λ m a x = λ i
  • else
  •        λ m i n = λ i
  • end
  • end
  •        i = i + 1
  • until i > T m a x

4. Simulation Results

In this part, simulation results are presented to show the effectiveness of the proposed algorithm. The simulation parameters are given as follows. The number of users is K = 4 . The coordinates of BS are (40,0)m; the users are randomly distributed in the rectangular area [ 20 , 20 ] × [ 20 , 20 ] m. The path loss model is adopted with path loss exponent r = 3.3 . The background noise is σ m 2 = σ e 2 = σ z 2 = 90 dBm [14], and the user fixed circuit power loss is P c , m = 5 dBm.
Figure 2 compares the minimum SEE of each algorithm for different P m a x . When the transmit power P m a x of the BS increases, the minimum SEE obtained by the min user’ SEE maximization and users’ system SEE maximization gradually increases to remain unchanged; this is because the increase of the BS transmit power resistant against eavesdroppers achieves a balance in the information rates leaked into the eavesdropper. Moreover, as can be seen from the secure rate maximization algorithm, with the increase of power, the ultimate SEE decreases. Therefore, it shows the stability of the SERA algorithm.
Figure 3 shows the minimum SEE of the three algorithms for the different number of BS antennas. The minimum SEE is monotone increasing with the antenna number of BS for three algorithms. This is because of the array gain due to the multi-antenna diversity. As the number of BS antennas increases, the secure rate of three algorithms increases faster than the power consumption. In addition, it can be observed that the minimum SEE performance of the SERA algorithm is better than the other two algorithms.
In Figure 4, we show the convergence performance of the different P m a x . It can be seen that the SERA algorithm can quickly converge. In the three cases under consideration, the number of iterations that the algorithm converges to the optimal value is within four times. When the number of BS antennas is N = 100 , the numerical results reveal that the performance of the P m a x = 30 dBm has increased about 20.1% and 41.5% more than P m a x = 25 dBm and P m a x = 15 dBm.
In Figure 5, we show the minimum SEE versus the eavesdropper transmit power under different algorithms. When the number of BS antennas is N = 100 and BS transmit power P m a x = 30 dBm, as the eavesdropper transmit power increases, the minimum SEE gradually decreases. From Equation (4), increasing the eavesdropper transmit power impacts the channel estimation. This leads to a decrease in the SEE and an increase in the information rates leaked into the eavesdropper.
Figure 6 shows the minimum SEE of the three algorithms for a different number of users. The minimum SEE is monotone decreasing with the number of users. The minimum SEE obtained by SERA algorithms is about 3% and 62.2% compared with the users’ system SEE maximization and secure rate maximization algorithm when the number of users K is 4 and BS maximum transmit power is P m a x = 30 dBm. In addition, it can be observed that the minimum SEE performance of the SERA algorithm is better than the other two algorithms.

5. Conclusions

In this paper, we consider downlink massive MIMO systems employing AN auxiliary communication for the physical layer. The users use the energy harvested by the previous time block for channel estimation. At the BS, the power splitting ratio is used to reasonably allocate the information transmission power and the AN transmission power; the eavesdropper’s eavesdropping ability is reduced while ensuring the integrity of the secret information transmission. The non-convex SEE maximization problem is first converted into a series of parameter optimization subproblems, which is then solved by the SCA method. A SERA algorithm with joint power splitting ratio and BS transmitted power allocation is proposed to max–min SEE of the systems. Simulation results show that the proposed algorithm can provide higher SEE compared with other benchmark algorithms.

Author Contributions

Z.W. conceived and designed the system model; X.W. analyzed the data; Z.F. contributed the formal analysis; X.Y. performed the simulation and wrote the paper. All authors have read and agreed to the published version of the manuscript.

Acknowledgments

This work was partially supported by the National Natural Science Foundation of China (No.61701064), Chongqing Natural Science Foundation (No.cstc2019jcyj-msxmX0264), and Scientific and Technological Research Program of Chongqing Municipal Education Commission (No.KJ1600424).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wu, Y.; Khisti, A.; Xiao, C.; Caire, G.; Wong, K.; Gao, X. A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead. IEEE J. Sel. Areas Commun. 2018, 36, 679–695. [Google Scholar] [CrossRef] [Green Version]
  2. Chen, X.; Ng, D.W.K.; Chen, H. Secrecy wireless information and power transfer: Challenges and opportunities. IEEE Wirel. Commun. 2016, 23, 54–61. [Google Scholar] [CrossRef]
  3. Wu, Q.; Li, G.Y.; Chen, W.; Ng, D.W.K.; Schober, R. An Overview of Sustainable Green 5G Networks. IEEE Wirel. Commun. 2017, 24, 72–80. [Google Scholar] [CrossRef] [Green Version]
  4. Zhu, J.; Ng, D.W.K.; Wang, N.; Schober, R.; Bhargava, V.K. Analysis and Design of Secure Massive MIMO Systems in the Presence of Hardware Impairments. IEEE Trans. Wirel. Commun. 2017, 16, 2001–2016. [Google Scholar] [CrossRef]
  5. Timilsina, S.; Baduge, G.A.A.; Schaefer, R.F. Secure Communication in Spectrum-Sharing Massive MIMO Systems with Active Eavesdropping. IEEE Trans. Commun. 2018, 4, 390–405. [Google Scholar] [CrossRef]
  6. Zhu, Z.; Chu, Z.; Zhou, F.; Niu, H.; Wang, Z.; Lee, I. Secure Beamforming Designs for Secrecy MIMO SWIPT Systems. IEEE Wirel. Commun. Lett. 2018, 7, 424–427. [Google Scholar] [CrossRef]
  7. Sheng, Z.; Tuan, H.D.; Nasir, A.A.; Duong, T.Q.; Poor, H.V. Power Allocation for Energy Efficiency and Secrecy of Wireless Interference Networks. IEEE Trans. Wirel. Commun. 2018, 17, 3737–3751. [Google Scholar] [CrossRef]
  8. Du, C.; Chen, X.; Lei, L. Energy-efficient optimisation for secrecy wireless information and power transfer in massive MIMO relaying systems. IET. Commun. 2018, 11, 10–16. [Google Scholar] [CrossRef]
  9. He, J.; Li, L.; Zhang, H.; Chen, W.; Yang, L.; Han, Z. Multi-Pair Bidirectional Relaying with Full-Duplex Massive MIMO Experiencing Channel Aging. In Proceedings of the IEEE GLOBECOM, Singapore, 4–8 December 2017; pp. 1–6. [Google Scholar]
  10. Timilsina, S.; Amarasuriya, G. Secure Communication in Relay-Assisted Massive MIMO Downlink. In Proceedings of the IEEE GLOBECOM, Singapore, 4–8 December 2017; pp. 1–7. [Google Scholar]
  11. Zhu, J.; Li, Y.; Wang, N.; Xu, W. Wireless Information and Power Transfer in Secure Massive MIMO Downlink with Phase Noise. IEEE Wirel. Commun. Lett. 2017, 6, 298–301. [Google Scholar] [CrossRef]
  12. Wu, Q.; Zhang, G.; Ng, D.W.K.; Chen, W.; Schober, R. GeneralizedWireless-Powered Communications: When to Activate Wireless Power Transfer? IEEE Trans. Veh. Technol. 2019, 68, 8243–8248. [Google Scholar] [CrossRef] [Green Version]
  13. Song, H.; Wen, H.; Hu, L.; Chen, Y.; Liao, R. Optimal Power Allocation for Secrecy Rate Maximization in Broadcast Wiretap Channels. IEEE Wirel. Commun. Lett. 2018, 7, 514–517. [Google Scholar] [CrossRef]
  14. Chen, Y.; Wang, L.; Ma, M.; Jiao, B. Power Allocation for Full-Duplex Relay Networks: Secure Energy Efficiency Optimization. In Proceedings of the IEEE GLOBECOM, Washington, DC, USA, 4–8 December 2016; pp. 1–6. [Google Scholar]
  15. Zhou, X.; Cai, W.; Chen, R. Secrecy energy efficiency optimization for MISO SWIPT systems. Phys Commun. 2018, 28, 19–27. [Google Scholar] [CrossRef]
  16. Alageli, M.; Ikhlef, A.; Chambers, J. SWIPT massive mimo systems with active eavesdropping. IEEE J. Sel. Areas Commun. 2019, 37, 233–247. [Google Scholar] [CrossRef] [Green Version]
  17. Chakravarty, J.; Johnson, O.; Piechocki, R. A Convex Scheme for the Secrecy Capacity of a MIMOWiretap Channel with a Single Antenna Eavesdropper. In Proceedings of the IEEE ICC, Shanghai, China, 20–24 May 2019; pp. 1–5. [Google Scholar]
  18. Xu, S.; Han, S.; Du, Y.; Meng, W.; He, L.; Zhang, C. AN-Aided Secure Beamforming Design for MISO Wiretap Channels. IEEE Commun. Lett. 2019, 4, 628–631. [Google Scholar] [CrossRef]
  19. Schaefer, R.F.; Amarasuriya, G.; Poor, H.V. Physical layer security in massive MIMO systems. In Proceedings of the Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 29 October–1November 2017; pp. 3–8. [Google Scholar]
  20. Tan, F.; Lv, T.; Huang, P. Global Energy Efficiency Optimization forWireless-Powered Massive MIMO Aided Multiway AF Relay Networks. IEEE Trans. Signal Process. 2018, 9, 2384–2398. [Google Scholar] [CrossRef]
  21. Li, B.; Li, L.; He, D.; Chen, J.; Kong, W. Energy-efficient secure transmission in massive MIMO systems with pilot attack. In Proceedings of the IC-WCSP, Yangzhou, China, 13–15 October 2016; pp. 1–5. [Google Scholar]
  22. Zhu, J.; Schober, R.; Bhargava, V.K. Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems. IEEE Trans. Wirel. Commun. 2016, 15, 2245–2261. [Google Scholar] [CrossRef]
  23. Khan, T.A.; Yazdan, A.; Heath, R.W. Optimization of Power Transfer Efficiency and Energy Efficiency for Wireless-Powered Systems with Massive MIMO. IEEE Trans. Wirel. Commun. 2018, 17, 7159–7172. [Google Scholar] [CrossRef] [Green Version]
  24. Zappone, A.; Jorswieck, E. Energy efficiency in wireless networks via fractional programming theory. Found. Trends Commun. Inf. Theory 2015, 11, 185–396. [Google Scholar] [CrossRef]
  25. Li, Y.; Sheng, M.; Wang, X.; Zhang, Y.; Wen, J. Max Min Energy Efficient Power Allocation in Interference Limited Wireless Networks. IEEE Trans. Veh. Technol. 2015, 64, 4321–4326. [Google Scholar] [CrossRef]
  26. Tran, T.T.; Thi, H.A.L.; Dinh, T.P. DC Programming and DCA for Enhancing Physical Layer Security via Cooperative Jamming. Comput. Oper. Res. 2016, 87, 235–244. [Google Scholar] [CrossRef]
  27. Nesterov, Y.; Nemirovskii, A. Interior-Point Polynomial Algorithms in Convex Programming; Studies in Applied Mathematics; Siam: Philadelphia, PA, USA, 1994. [Google Scholar]
Figure 1. System model.
Figure 1. System model.
Electronics 09 00026 g001
Figure 2. Minimum SEE for different BS transmit power.
Figure 2. Minimum SEE for different BS transmit power.
Electronics 09 00026 g002
Figure 3. Minimum SEE under a different number of BS antennas.
Figure 3. Minimum SEE under a different number of BS antennas.
Electronics 09 00026 g003
Figure 4. The convergence performance of the different BS transmit powers.
Figure 4. The convergence performance of the different BS transmit powers.
Electronics 09 00026 g004
Figure 5. The minimum SEE versus the eavesdropper transmit power.
Figure 5. The minimum SEE versus the eavesdropper transmit power.
Electronics 09 00026 g005
Figure 6. Minimum SEE under a different number of users.
Figure 6. Minimum SEE under a different number of users.
Electronics 09 00026 g006

Share and Cite

MDPI and ACS Style

Yang, X.; Wang, Z.; Wan, X.; Fan, Z. Secure Energy-Efficient Resource Allocation Algorithm of Massive MIMO System with SWIPT. Electronics 2020, 9, 26. https://doi.org/10.3390/electronics9010026

AMA Style

Yang X, Wang Z, Wan X, Fan Z. Secure Energy-Efficient Resource Allocation Algorithm of Massive MIMO System with SWIPT. Electronics. 2020; 9(1):26. https://doi.org/10.3390/electronics9010026

Chicago/Turabian Style

Yang, Xiaoxia, Zhengqiang Wang, Xiaoyu Wan, and Zifu Fan. 2020. "Secure Energy-Efficient Resource Allocation Algorithm of Massive MIMO System with SWIPT" Electronics 9, no. 1: 26. https://doi.org/10.3390/electronics9010026

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop