Abstract
In this paper, we propose a novel layered physical layer security model, which is the extension of the traditional physical layer security to the domain of multiple-layer information security. It has a hierarchical information security structure that every transmitted message has a security level, while every user has a security clearance. Users can only decode the messages with security levels lower than or equal to their clearance, otherwise they will be deemed as eavesdroppers. Based on the framework of the layered information security and assuming perfect channel state information of all users, an artificial-noise-aided optimal beamforming scheme is proposed to minimize the total transmit power at the base station, while satisfying the minimum secrecy rate requirements of all secret messages. Due to the intrinsical complexity of the formulated nonconvex problem, a safe and convex reformulation based on the first-order Taylor series expansion method is proposed to generate a tractable approximation. A successive convex approximation-based algorithm is then proposed, which solves a series of second-order cone problems with convergence to the stationary point of the original problem. We also consider the imperfect channel state information case, and then propose a worst-case robust design to overcome the influence of channel uncertainties. Semi-definite relaxation method and S-procedure are utilized to get a computationally efficient lower bound of the intractable power minimization problem. Moreover, we investigate the application of the suboptimal zero-forcing-based beamforming scheme in the system to tradeoff the achievable performance and the computational complexity. Simulation results are provided to demonstrate the effectiveness of our proposed schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.