arXiv:1207.5063 · IEEE Transactions on Communications

Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding

Giovanni Geraci, Malcolm Egan, Jinhong Yuan, Adeel Razi, Iain B. Collings

Published Jul 30, 2012• 161 citations

Abstract

In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter α and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal regularization parameter αLSof the precoder using large-system analysis. We show that the RCI precoder with αLSoutperforms several other linear precoding schemes, and it achieves a secrecy sum-rate that has same scaling factor as the sum-rate achieved by the optimum RCI precoder without secrecy requirements. We propose a power allocation algorithm to maximize the secrecy sum-rate for fixed α. We then extend our algorithm to maximize the secrecy sum-rate by jointly optimizing α and the power allocation vector. The jointly optimized precoder outperforms RCI with αLSand equal power allocation by up to 20 percent at practical values of the signal-to-noise ratio and for 4 users and 4 transmit antennas.

DOI: 10.1109/tcomm.2012.072612.110686

Related papers

Large system analysis of the secrecy sum-rates with Regularized Channel Inversion precoding

Giovanni Geraci, Jinhong Yuan, Iain B. Collings

In this paper, we study the performance of the Regularized Channel Inversion (RCI) precoder in a multi-user MIMO system with malicious users. We consider the general case when the number of users per transmit antenna β can take any value. We derive the optimal regularization parameter that maximizes the achievable secrecy sum-rate via large-system analysis, which we show to be accurate via simulations. We find that the secrecy requirements limit the number of users per transmit antenna that can be served with non-zero sum-rate. We show that for large signal-to-noise ratio, RCI can achieve secrecy without reducing the sum-rate if β; 1, then the secrecy requirements result in a poor sum-rate.

IEEE Wireless Communications and Networking ConferenceApr 1, 201213 citations

Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential Messages

Giovanni Geraci, Romain Couillet, Jinhong Yuan +1 more

In this paper, we study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achiev-able secrecy sum-rate which is almost surely exact as the number of transmit antennas M and the number of users K grow to infinity in a fixed ratio β = K/M. We derive the optimal regularization parameter ξ and the optimal network load β that maximize the per-antenna secrecy sum-rate. We then propose a linear precoder based on RCI and power reduction (RCI-PR) that significantly increases the high-SNR secrecy sum-rate for 1 < β < 2. Our proposed precoder achieves a per-user secrecy rate which has the same high-SNR scaling factor as both the following upper bounds: (i) the rate of the optimum RCI precoder without secrecy requirements, and (ii) the secrecy capacity of a single-user system without interference. Furthermore, we obtain a deterministic approximation for the secrecy sum-rate achievable by RCI precoding in the presence of channel state information (CSI) error. We also analyze the performance of our proposed RCI-PR precoder with CSI error, and we determine how the error must scale with the SNR in order to maintain a given rate gap to the case with perfect CSI. Index Terms Physical layer security, broadcast channel, random matrix theory, linear precoding, multi-user systems. ar X iv

Aug 18, 201680 citations

Physical layer security in multi-user wireless networks

Mehdi Sadeghzadeh

In this thesis, we study the physical layer security in downlink multi-user wireless networks. Traditionally, security has been addressed by cryptography at the higher layers of the communication stack. Security at the physical layer has been a major research topic in recent years. We study two different precoder designs alongside artificial noise (AN) to mitigate multi-user interference and deteriorate reception at the eavesdropper (Eve). We study the large scale analysis to calculate the secrecy sum-rate for these two cases and analyze the effect of AN on the system. First, we consider the worst case scenario, when eavesdropper's (Eve's) rate is not deteriorated by the interference caused by the legitimate users. Later, we investigate how interference from legitimate users would affect the large scale security sum rate. At the end, we assume more practical situation where the channel state information at the transmitter is not perfect due to feedback limitation and estimation error. We first study block diagonalization (BD) precoding. We derive the asymptotic secrecy sum-rate of BD for physical layer security in downlink multi-user wireless networks using artificial noise (AN). We first derive the secrecy sum-rate assuming that the channel of the eavesdropper is not known at the transmitter and derive the asymptotic secrecy sum-rate. Then we derive the optimum power allocation for asymptotic secrecy sum-rate. We design the system based on large scale analysis for different special cases. Simulation results show that the proposed precoders outperform channel inversion (CI) and regularized channel inversion (RCI) schemes at all SNRs. We also show that as the number of receive antennas of each user increases, the sum-rate gap between the proposed scheme and existing methods increases. We, then, study two methods of regularized block diagonalization (RBD) precoding using artificial noise (AN) for physical layer security in downlink multi-user MIMO wireless networks. We compare the complexity analysis of these two methods in terms of floating point operations per second (FLOPS). We derive the secrecy and asymptotic secrecy sum-rates for these schemes. We also derive closed form expressions for the asymptotic optimal power allocation to the AN signal and legitimate users. Simulations show RBD precoding outperform regularized channel inversion (RCI) in terms of secrecy sum-rate with a margin of 0.5 bits/s/Hz. Also, simulation results show our closed-form asymptotic secrecy sum-rates matches closely with the simulations for perfect and imperfect CSIT. We also study the effect of interference on BD precoding scheme. In the first two studies the worst case scenarios was considered and the effect of interference was not considered at the eavesdropper. We first derive the closed-form secrecy and asymptotic secrecy sum-rates for this scheme. Then, we derive the optimum power allocation. Using the derived optimum power allocation, we determine the conditions under which adding AN helps. We also investigate the optimum number of users, number of antennas at the eavesdropper, and the number of transmit antennas to fully study the conditions where using AN improves performance. We show that as the number of users increases or the number of receive antennas at the eavesdropper decreases, improved performance is achieved by allocating a smaller fraction of the total power to transmit the AN. The closed form expressions for the secrecy sum rate (SSR) and optimum power allocation closely match our simulation results. In Chapter 5, we study the effect of imperfect channel state information at the transmitter (CSIT) for each case studied in earlier chapters. We first study the effect of imperfect CSIT for BD precoding in both scenarios when interference does and does not exist at eavesdropper. We show that the imperfect CSI play the same role as interference for the desired users. Then, we study the effect of imperfect CSIT for RBD precoding when interference does not exist at eavesdropper. We show as channel estimation error increases, the secrecy sum-rate decreases. This is due to the fact that channel estimation error just affects the desired users' rate and has no effect on eavesdropper's performance. Finally, in the last chapter, we conclude our thesis and provide some road map for future--Author's abstract

Jan 1, 20200 citations

Large scale analysis of physical layer security in multi-user wireless networks

Mehdi Sadeghzadeh, Mehdi Maleki, Masoud Salehi +1 more

We derive the asymptotic secrecy sum-rate of block diagonalization (BD) precoding for physical layer security in downlink multi-user wireless networks using artificial noise (AN). We first derive the secrecy sum-rate assuming that the channel of the eavesdropper is not known at the transmitter and then the asymptotic secrecy sum-rate is derived. The optimum power allocation for asymptotic secrecy sum-rate is derived after that. Simulation results show that the proposed precoders outperform channel inversion (CI) and regularized channel inversion (RCI) schemes in terms of the secrecy sum-rate at all SNRs. We also show that as the number of receive antennas of each user increases, the sum-rate gap between the proposed scheme and existing methods increases.

International Conference on CommunicationsMay 1, 20176 citations

Confidential Broadcasting via Linear Precoding in Non-Homogeneous MIMO Multiuser Networks

Nan Yang, Giovanni Geraci, Jinhong Yuan +1 more

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 Ntantennas securely broadcasts messages to K users with Nrantennas 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, Nt, 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.

IEEE Transactions on CommunicationsJun 6, 201435 citations

Large-Scale Analysis of Regularized Block Diagonalization Precoding for Physical Layer Security of Multi-User MIMO Wireless Networks

Mehdi Sadeghzadeh, Mehdi Maleki, Masoud Salehi

In this paper, we propose regularized block diagonalization (RBD) precoding using artificial noise (AN) for physical layer security in downlink multi-user MIMO wireless networks. We derive secrecy sum rate and asymptotic secrecy sum rate for the proposed scheme. The optimum power allocation for legitimate users and the AN signal are derived in closed form for optimal asymptotic secrecy sum rate. Our analysis shows that to achieve best performance, it is more efficient to degrade the performance of the eavesdropper than improving legitimate users' rates. We also study the impact of error in channel estimation on the system and derive closed-form SINR and secrecy sum-rate expressions for this case. Simulations show that the secrecy sum rate of RBD precoding outperforms the secrecy sum rate of regularized channel inversion by 0.5 bits/s/Hz. We also show that in the presence of channel estimation error, our approximate closed forms for secrecy sum rate are very closed to the actual secrecy sum rate over a wide range of SNR and channel estimation error values.

IEEE Transactions on Vehicular TechnologyApr 27, 201912 citations