MIMO Interference Channel With Confidential Messages: Achievable Secrecy Rates and Precoder Design

Fakoorian, S. Ali. A.; Swindlehurst, A. Lee

doi:10.1109/tifs.2011.2156788

Cited by 61 publications

(67 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both examples plotted in this figure illustrate that the cooperative scheme (GSVD+ANA) allows for communication over larger secrecy rates compared with the non-cooperative schemes GSVD and NCJ. In fact, as we have shown in [11], the achievable secrecy rate region of GSVD+ANA is always bigger than (or at least equal to) that of the GSVD scheme, while NCJ always has the worst performance. Note that in this figure, the achievable secrecy rate region of GSVD+ANA is bigger than that of GSVD and NCJ even with a larger number of antennas at the unintended receivers.…”

Section: Numerical Resultsmentioning

confidence: 70%

“…Let q 12 be the number of non-zero elements of the vector s 2 that do not lie in the nullspace of G 2 , which can be determined using (11) and the specific form of the diagonal matrix D 2 . Consequently, Ψ e2 is the corresponding q 12 columns of the unitary matrix Ψ e2 .…”

Section: Cooperative Solution: Gsvd + Artificial Noise Alignmentmentioning

confidence: 99%

“…In [11], we present an iterative algorithm that find the Kalai-Smorodinsky (K-S) solution for the cooperative game (GSVD+ANA) and considers the properties of the obtained operating points from the viewpoint of fairness and efficiency.…”

Section: Cooperative Solution: Gsvd + Artificial Noise Alignmentmentioning

confidence: 99%

See 2 more Smart Citations

MIMO interference channel with confidential messages: Game theoretic beamforming designs

Fakoorian

Swindlehurst

2010

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers

Self Cite

View full text Add to dashboard Cite

We study the achievable rate regions of the multiple-input multiple-output (MIMO) interference channel with confidential messages sent to two receivers. Under this model, each receiver is an eavesdropper for the other link and tries to decode both its own message and the message intended for the other receiver. We describe several transmission schemes for Gaussian interference channels and derive their achievable secrecy rate regions under the assumption that the transmitters use low complexity beamforming algorithms. We also consider the trade-offs associated with their need for channel state information at the transmitter (CSIT). We approach the above topics from a game-theoretic perspective.2099 978-1-4244-9721-8/10/$26.00

show abstract

Section: Numerical Resultsmentioning

confidence: 70%

Section: Cooperative Solution: Gsvd + Artificial Noise Alignmentmentioning

confidence: 99%

See 1 more Smart Citation

MIMO interference channel with confidential messages: Game theoretic beamforming designs

Fakoorian

Swindlehurst

2010

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers

Self Cite

View full text Add to dashboard Cite

show abstract

“…The SINR for the eavesdropped message from BS j at MS i is hence

Γ_{eij} MathClass-rel= \frac{{MathClass-rel| {bold-italich}_{ij}^{MathClass-bin†} {bold-italicw}_{j} MathClass-rel|}^{2}}{σ^{2}} MathClass-punc, for j MathClass-rel\neq i

Under this setting, the smallest message rate and the greatest equivocation rate are obtained at the MSs, and our analysis and optimization will address the worst‐case scenario. A similar argument has been used in for such formulation.…”

Section: K‐user Miso Ifc‐cm Modelmentioning

confidence: 99%

A robust and distributed design for coordinated downlink beamforming for secure MISO interference channels

Fei

Wang

et al. 2014

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this paper, we address the optimization problems of downlink coordinated beamforming over the K‐user multiple‐input single‐output interference channel with confidential messages. Our design objective is to minimise the total transmit power subject to the constraints of individual signal‐to‐interference plus noise ratio and equivocation rates. For the case with perfect channel state information (CSI), by deriving the equivalent forms for the signal‐to‐interference plus noise ratio and the secrecy constraints, the optimization problem is reformulated as a second‐order cone programme problem. Then, an optimal distributed algorithm using the partial Lagrangian duality is discussed. In addition we extend the analysis to the imperfect CSI scenario with bounded ellipsoidal errors, the centralised algorithm has been proposed by solving a semi‐definite programme with the help of rank relaxation, whereas the distributed robust algorithm is devised by using ADMM. Finally, the simulation results have shown that with perfect CSI, the centralised and distributed algorithms have nearly the same performance, but in the case of imperfect CSI, the centralised algorithm shows a slightly better performance. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…Each of the multiple messages is intended for one of the users but needs to be kept secret from the other users. The secrecy capacity of the two-user multi-antenna broadcast network was examined in [14,15]. The confidential broadcasting in the multi-user network where a multi-antenna base station (BS) serves an arbitrary number of receivers in a single cell was studied in [16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

Base Station Cooperation for Confidential Broadcasting in Multi-Cell Networks

Yang

Zhou

et al. 2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We design linear precoders that perform confidential broadcasting in multi-cell networks for two different forms of base station (BS) cooperation, namely, multi-cell processing (MCP) and coordinated beamforming (CBf). We consider a twocell network where each cell consists of an N -antenna BS and K single-antenna users. For such a network, we design a linear precoder based on the regularized channel inversion (RCI) for the MCP and a linear precoder based on the generalized RCI for the CBf. For each form of BS cooperation, we derive new channel-independent expressions to approximate the secrecy sum rate achieved by the precoder in the large system regime where K, N → ∞ with a fixed ratio β = K/N . Using these results, we determine the optimal regularization parameters of the RCI and the generalized RCI precoders that maximize the secrecy sum rate for the MCP and the CBf, respectively. We further propose power-reduction strategies that significantly increase the secrecy sum rate at high transmit signal-to-noise ratios when the network load is high. Our numerical results substantiate the derived expressions, verify the optimality of the determined optimal regularization parameters, and demonstrate the performance improvement offered by the proposed power-reduction strategies.Index Terms-Physical layer security, confidential broadcasting, multi-cell processing, coordinated beamforming, linear precoder.

show abstract

MIMO Interference Channel With Confidential Messages: Achievable Secrecy Rates and Precoder Design

Cited by 61 publications

References 24 publications

MIMO interference channel with confidential messages: Game theoretic beamforming designs

MIMO interference channel with confidential messages: Game theoretic beamforming designs

A robust and distributed design for coordinated downlink beamforming for secure MISO interference channels

Base Station Cooperation for Confidential Broadcasting in Multi-Cell Networks

Contact Info

Product

Resources

About