Abstract

In this paper, the K-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the transmitters carefully mix information symbols with artificial noises to ensure confidentiality. Achieving positive secure degrees of freedom (SDoF) is challenging due to the delayed nature of CSIT, and the distributed nature of the transmitters. Our scheme works over two phases: Phase one, in which each transmitter sends information symbols mixed with artificial noises, and repeats such transmission over multiple rounds. In the next phase, each transmitter uses the delayed CSIT of the previous phase and sends a function of the net interference and artificial noises (generated in previous phase), which is simultaneously useful for all receivers. These phases are designed to ensure the decodability of the desired messages while satisfying the secrecy constraints. We present our achievable scheme for three models, namely: (1) K-user interference channel with confidential messages (IC-CM), and we show that SDoF is achievable; (2) K-user interference channel with an external eavesdropper (IC-EE); and (3) K-user IC with confidential messages and an external eavesdropper (IC-CM-EE). We show that for the K-user IC-EE, SDoF is achievable, and for the K-user IC-CM-EE, is achievable. To the best of our knowledge, this is the first result on the K-user interference channel with secrecy constrained models and delayed CSIT that achieves an SDoF which scales with , square-root of number of users.

Highlights

  • Delayed channel state information at transmitters (CSIT) can impact the spectral efficiency of wireless networks, and this problem has received significant recent attention

  • √ we show that for the K-user interference channel with an external eavesdropper (IC-EE), 12 ( K − 3) secure degrees of freedom (SDoF) is achievable, and for the K-user with confidential messages and an external eavesdropper (IC-CM-EE), 2 ( K − 6) is achievable

  • We studied the K-user interference channel with three secrecy constrained channel models and delayed CSIT: We showed that for the K-user interference channel with confidential messages, the sum secure degrees of freedom (SDoF) is at least 12 ( K − 6), and scales with square root of the number

Read more

Summary

Introduction

Delayed channel state information at transmitters (CSIT) can impact the spectral efficiency of wireless networks, and this problem has received significant recent attention. The result in [8] is interesting, as it shows that the sum DoF for the K-user interference channel does scale with K, even with delayed CSIT. Another important aspect in wireless networks is ensuring secure communication between transmitters and receivers. These results show that sum secure degrees of freedom (SDoF) scales with K. For rounding operations on a variable x, we use b x c as the floor rounding operator on x and d x e as the ceiling rounding operator on x

System Model
Main Results
Proof of Theorem 1
Overview of the Achievability Scheme and SDoF Analysis
Detailed Description of the Achievability Scheme
Phase 1
Phase 2
Choice of T1 and T2 to Satisfy the Confidentiality Constraints
Secrecy Rate and SDoF Calculation
Proof of Theorem 2
Proof of Theorem 3
Conclusions
Full Text
Published version (Free)

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 call