Abstract
We propose linear precoding with power control to achieve confidential broadcasting in multi-input-multi-output multiuser networks such that the base station (BS) with N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sub> antennas securely broadcasts messages to K users with N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> antennas each. We focus on the practical non-homogeneous scenario where the distances between the BS and the users are not equal. We first design a linear precoder based on regularized channel inversion, and derive new channel-independent expressions for the achievable secrecy sum-rate in the large system regime. With the aid of these expressions, we examine the impact of user dispersion, N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sub> , and K on the secrecy sum-rate. We then propose a power reduction strategy and power allocation algorithms to increase the secrecy sum-rate. We demonstrate that our power reduction strategy increases the secrecy sum-rate at high signal-to-noise ratios. We also show the secrecy sum-rate advantage of optimal power allocation over equal power allocation. Furthermore, we consider channel correlation and derive an easy-to-compute expression for the secrecy sum-rate to examine its impact on the secrecy performance.
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.