Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Communications

Confidential broadcasting via coordinated beamforming in two-cell networks

Biao He, Nan Yang, Xiangyun Zhou, Jinhong Yuan

Published Jun 1, 2015• 1 citation
Publisher

Abstract

We design a linear precoder based on the principles of the generalized regularized channel inversion (RCI) precoder that achieves confidential broadcasting in a two-cell network. In each cell of the network, an N-antenna base station (BS) communicates with K single-antenna users. We consider coordinated beamforming where the BSs in the two cells do not share messages but the users in the two cells feed back their channel state information to both BSs. In the precoder design, we determine the optimal regularization parameter that maximizes the secrecy sum rate. To this end, we derive new channel-independent expressions for the secrecy sum rate in the large-system regime, where K and N approach infinity with a fixed ratio μ = K/N. Moreover, we propose a power-reduction strategy that significantly improves the secrecy sum rate at high transmit signal-to-noise ratios when μ is higher than 0.5.

DOI
10.1109/icc.2015.7249505

Related papers

Coordinated Beamforming for Secure Transmission in the Downlink Multicell MIMO Systems

Juan Bai, Tao Dong, Qin Zhang +2 more

In this paper, we consider secure transmission in the downlink of a multicell multiple-input multiple-output (MIMO) system with M cells; each cell consists of an N -antenna base station (BS) and K single-antenna users. Coordinated beamforming (CBf) is employed for secrecy enhancement. For CBf, the BSs can jointly design their respective beamformers to control intercell interference and information leakage. Based on regularized channel inversion (RCI) precoding structures, we derive the concise formulas for the signal-to-interference-plus-noise ratio (SINR) for the legitimate users and the colluding malicious users and the achievable secrecy sum rate for the CBf. Furthermore, we obtain a novel closed-form expression of the secrecy sum in the large-system regime where N and K tend to infinity with a fixed ratio β=K/N . Based on the large-system regime result, the regularization parameter is optimized to maximize the secrecy sum rate. It shows that the optimal regularization parameter decreases with the signal-to-noise ratio (SNR) and stays constant at high SNR if β>1/M . Compared with single-cell processing (SCP) without BS cooperation, simulation results show that the secrecy performance can be significantly enhanced by exploiting CBf. The analytical results are validated with the finite-size system by simulation.

Mathematical Problems in Engineering•May 20, 2020•0 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, 2016•80 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 Communications•Jun 6, 2014•35 citations

Coordination beamforming for secrecy enhancement in the downlink MU-MIMO cellular networks

Qin Zhang, Juan Bai, Linrang Zhang +2 more

In a conventional cellular wireless networks, single cell processing (SCP) is usually considered where inter-cell interference is treated as noise. As we know, interference can cause severe information leakage for secret communication, the paper studies the secrecy performance with coordination beamforming (CBf) scheme in the downlink of a two-cell multi-user MIMO (MU-MIMO) cellular network. For CBf, the BSs can jointly design their respective beamformers to control inter-cell interference. Based on regularized channel inversion (RCI) precoding, we derive the concise formulas for the signal-to interference plus noise (SINR) at a legitimate user and the colluding malicious users, and the achievable secrecy sum-rate for the CBf scheme. Furthermore, we obtain their corresponding approximation in large-system regime, in which the number of users per cell K and the number of antenna at BS N tend to infinity, while with their ratio β = K/N being held constant. The analytical results are validated with finite-size system by simulation. Compared with SCP without BS cooperation, simulation results show that the secrecy performance can be significantly enhanced by exploiting CBf scheme.

International Symposium on Wireless Personal Multimedia Communications (WPMC)•Nov 1, 2016•0 citations

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

Giovanni Geraci, Malcolm Egan, Jinhong Yuan +2 more

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.

arXiv:1207.5063•IEEE Transactions on Communications•Jul 30, 2012•161 citations

Secrecy Rates in Broadcast Channels with Confidential Messages and External Eavesdroppers

Giovanni Geraci, Sarabjot Singh, Jeffrey G. Andrews +2 more

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable with regularized channel inversion (RCI) precoding by performing a large-system analysis that combines results from stochastic geometry and random matrix theory, where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as \fraclambda_esqrt{N} as the density of external eavesdroppers λ_e grows, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.

IEEE Transactions on Wireless Communications•Apr 16, 2014•116 citations
We design a linear precoder based on the principles of the generalized regularized channel inversion (RCI) precoder that achieves confidential broadcasting in a two-cell network. In each cell of the network, an N-antenna base station (BS) communicates with K single-antenna users. We consider coordinated beamforming where the BSs in the two cells do not share messages but the users in the two cells feed back their channel state information to both BSs. In the precoder design, we determine the optimal regularization parameter that maximizes the secrecy sum rate. To this end, we derive new channel-independent expressions for the secrecy sum rate in the large-system regime, where K and N approach infinity with a fixed ratio μ = K/N. Moreover, we propose a power-reduction strategy that significantly improves the secrecy sum rate at high transmit signal-to-noise ratios when μ is higher than 0.5.
In this paper, we consider secure transmission in the downlink of a multicell multiple-input multiple-output (MIMO) system with M cells; each cell consists of an N -antenna base station (BS) and K single-antenna users. Coordinated beamforming (CBf) is employed for secrecy enhancement. For CBf, the BSs can jointly design their respective beamformers to control intercell interference and information leakage. Based on regularized channel inversion (RCI) precoding structures, we derive the concise formulas for the signal-to-interference-plus-noise ratio (SINR) for the legitimate users and the colluding malicious users and the achievable secrecy sum rate for the CBf. Furthermore, we obtain a novel closed-form expression of the secrecy sum in the large-system regime where N and K tend to infinity with a fixed ratio β=K/N . Based on the large-system regime result, the regularization parameter is optimized to maximize the secrecy sum rate. It shows that the optimal regularization parameter decreases with the signal-to-noise ratio (SNR) and stays constant at high SNR if β>1/M . Compared with single-cell processing (SCP) without BS cooperation, simulation results show that the secrecy performance can be significantly enhanced by exploiting CBf. The analytical results are validated with the finite-size system by simulation.
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
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.
In a conventional cellular wireless networks, single cell processing (SCP) is usually considered where inter-cell interference is treated as noise. As we know, interference can cause severe information leakage for secret communication, the paper studies the secrecy performance with coordination beamforming (CBf) scheme in the downlink of a two-cell multi-user MIMO (MU-MIMO) cellular network. For CBf, the BSs can jointly design their respective beamformers to control inter-cell interference. Based on regularized channel inversion (RCI) precoding, we derive the concise formulas for the signal-to interference plus noise (SINR) at a legitimate user and the colluding malicious users, and the achievable secrecy sum-rate for the CBf scheme. Furthermore, we obtain their corresponding approximation in large-system regime, in which the number of users per cell K and the number of antenna at BS N tend to infinity, while with their ratio β = K/N being held constant. The analytical results are validated with finite-size system by simulation. Compared with SCP without BS cooperation, simulation results show that the secrecy performance can be significantly enhanced by exploiting CBf scheme.
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.
In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. Using the proposed model, we study the secrecy rates achievable with regularized channel inversion (RCI) precoding by performing a large-system analysis that combines results from stochastic geometry and random matrix theory, where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. We obtain explicit expressions for the probability of secrecy outage and an upper bound on the rate loss due to the presence of external eavesdroppers. We show that both these quantities scale as \fraclambda_esqrt{N} as the density of external eavesdroppers λ_e grows, irrespective of their collusion strategy. Furthermore, we derive a practical rule for the choice of the regularization parameter, which is agnostic of channel state information and location of eavesdroppers, and yet provides close to optimal performance.