Secrecy Transmit Beamforming for Heterogeneous Networks
read more
Citations
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical Layer Security in Heterogeneous Cellular Networks
A Survey of Optimization Approaches for Wireless Physical Layer Security
Secure Communications in Millimeter Wave Ad Hoc Networks
Small Cells in the Forthcoming 5G/IoT: Traffic Modelling and Deployment Overview
References
Convex Optimization
Communication theory of secrecy systems
Five disruptive technology directions for 5G
Broadcast channels with confidential messages
Femtocell networks: a survey
Related Papers (5)
Frequently Asked Questions (14)
Q2. What have the authors stated for future works in "Secrecy transmit beamforming for heterogeneous networks" ?
For the future work, it would be interesting to consider the scenario where multiple eavesdroppers and/or targeted MUs exist in the HetNet. Additionally, the robust STB schemes in the context of imperfect CSI may be investigated. The maximization problem ( 32 ) can be equivalently transformed into min { Xm } Mm=1, ζ { { Xnk } Kk=1 } Nn=1 Tr ( HEX1 ) ( 37a ) s. t. M∑ m=1 Tr ( Xm ) ≤ PMζ, ( 37b ) K∑ k=1 Tr ( Xnk ) ≤ PF ζ, n ∈ [ 1, N ], ( 37c ) Tr ( HmXm ) ≥ γm ⎛ ⎜⎝ M∑ q=1, q =m Tr ( HmXq ) + Note that ( 38a ), ( 38c ) and ( 38e ) have a similar structure, hence the authors only focus on the proof of rank ( X∗1 ) = 1. rank ( X∗m ) = 1, m ∈ [ 2, M ], and rank ( X∗nk ) = 1, n ∈ [ 1, N ], k ∈ [ 1, K ], can be proved by using the same method.
Q3. Why does the secrecy rate of MU1 increase with increasing power?
Because the wiretapped MU1 receives more power but the received noise power does not rise when the transmit power of the MBS increases, so the authors can observe that the secrecy rate performance of all the four schemes grow as the transmit power of MBS increases.
Q4. Why does the SINR requirement of FUs in STB-JMF decrease?
But for the STB-SMF scheme, as the transmit power of the MBS increases, the SINR of FUs goes down dramatically because more interference is introduced at FUs.
Q5. How can the optimization problem be solved?
4Remark 1: Since the optimization problem defined in (15) is convex, the optimal solutions {w∗m}Mm=1, t∗0, t∗1, t∗2, are obtained by solving (15) for a given (w̃m, t̃1, t̃2).
Q6. What is the Gaussian noise obeying i.i.d. CN?
N∑ n=1 K∑ k=1 hn,Ewnksnk + nE , (2)where hE ∈ C1×NM denotes the channel vector from the MBS to the eavesdropper, hn,E ∈ C1×NF is the channel vector from FBSn to the eavesdropper, and nE is the Gaussian noise obeying i.i.d. CN (0, σ2E) at the eavesdropper.
Q7. What is the way to obtain the beamforming vector?
the authors can obtain the beamforming vector solution as follows: if rank(W̃m) = 1, the optimal beamforming vector w̃m is exactly obtained via eigenvalue decomposition; otherwise some rank-one approximation procedures, e.g., Gaussian randomization [48] can be applied to W̃m for obtaining w̃m.
Q8. Why is there no optimal solution in STB-JMF?
It is worth noting that when the transmit power of each FBS is relatively low, e.g., around 20 dBm, the SINR constraint in STB-JMF could not be satisfied and thus there is no optimal solution.
Q9. What is the computational complexity of Algorithm 3?
Algorithm 3 is based on SDP and one-dimensional line search, and its computational complexity is TS · O(NK(N3.5M +N3.5F ) + N2K2(N2.5M + N 2.5 F ) + N 3K3(N0.5M +N 0.5 F )) · log2( 1 ), where denotes the accuracy requirement, TI is the number of iterations required in Algorithms 1 and 2, and TS is the number of searches carried out in Algorithm 3.
Q10. How can the proposed schemes achieve a high secrecy rate?
even with little transmit power at each FBS, the proposed schemes can achieve very high secrecy rate, which is in sharp contract to the benchmark scheme.
Q11. What is the simplest way to verify that Problem (37) meets the Slater’s?
N∑ n=1 K∑ k=1 Tr(Hn,EXnk) + ζ = 1, (37g) Xm, Xnk 0, ζ > 0. (37h)It is easy to verify that Problem (37) satisfies the Slater’s condition.
Q12. How fast does the secrecy rate of the proposed three STB schemes increase?
It is also shown that the secrecy rates of the proposed three STB schemes always increase faster than the benchmark scheme, especially when the transmit power of the MBS is high (e.g., 42 dBm and 45 dBm).
Q13. how can i get the global optimum of the resultant convex optimization problem?
The globally optimal solution of the resultant convex optimization problem can be obtained upon using Algorithm 1, which, according to [41], can be proved to converge to a local optimum of the original optimization problem in a few steps.
Q14. What is the precoding vector and the message signal intended for the k-th FU?
wnk ∈ CNF×1 and snk are the precoding vector and the message signal intended for the k-th FU of the n-th cooperative FBS, denoted as FUnk.