Abstract
We consider a well-known beamforming approach that induces jamming signals to avoid eavesdropping from a transmitter equipped with an antenna array in this paper. With this beamforming, which is called masked beamforming, in order to guarantee a certain instantaneous secrecy rate, we formulate robust beamforming problems with a constraint that deals with the eavesdropper channel's uncertainty and find the solutions. Unlike a guaranteed ergodic secrecy rate, this guaranteed instantaneous secrecy rate allows us to use codes of short codewords for secure communications with masked beamforming over slow-fading channels. In addition, since the optimal solutions are found in closed form, we do not need to resort to any convex optimization solvers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
