Abstract
This paper investigates the sum secure degrees of freedom (SDoF) of the $K$-user Multiple Input/Single Output (MISO) Broadcast Channel with Confidential Messages (BCCM) under alternating Channel State Information at the Transmitter (CSIT). We consider a scenario where the CSI for receivers $2$ through $K$ is known instantaneously, while the CSI for receiver $1$ alternates between instantaneous and delayed availability. We characterize the sum SDoF as $(2K-1)/2$, achieved through a strategy involving artificial noise to protect messages from unintended decoders.
Introduction
In modern wireless networks, ensuring the secrecy of transmitted messages is a fundamental challenge. The MISO Broadcast Channel with Confidential Messages (BCCM) provides a framework for studying how a multi-antenna transmitter can securely communicate with multiple single-antenna receivers. A critical factor in achieving high data rates and secrecy is the availability of Channel State Information at the Transmitter (CSIT). While perfect CSIT is ideal, practical constraints often lead to delayed or alternating feedback. This paper explores the "synergistic gains" possible when CSIT availability fluctuates over time.
System Model
The system consists of a transmitter with $K$ antennas and $K$ single-antenna receivers. The transmitter sends messages $W_1, W_2, \dots, W_K$, where message $W_k$ is intended for receiver $k$. The secrecy constraint requires that message $W_k$ be kept secret from all receivers $j$ where $j < k$.
The CSIT availability is asymmetric:
- Receivers $2, \dots, K$: The transmitter has instantaneous CSI for these channels at all times.
- Receiver $1$: The CSI is available instantaneously for half the time (State 1) and with a unit delay for the other half (State 2).
Achievability and Artificial Noise
The core of the proposed communication scheme is the strategic use of artificial noise (AN). In State 2, when the transmitter lacks instantaneous knowledge of User 1's channel, it cannot perfectly null interference at User 1. Instead, it transmits AN that is designed to be orthogonal to the signal space of Users $2 \dots K$. This noise acts as a mask, preventing User 1 from decoding the private messages intended for the other users, thereby satisfying the secrecy constraints.
In State 1, where full CSIT is available, the transmitter can use standard beamforming techniques to ensure that each user receives its intended message without leakage to restricted receivers.
Main Results
The primary contribution of this work is the characterization of the sum SDoF for the $K$-user MISO BCCM with alternating CSIT.
Theorem: The sum SDoF for the $K$-user MISO BCCM with the described alternating CSIT is given by: $$SDoF_{\rm sum} = \frac{2K - 1}{2}$$
For a 3-user system ($K=3$), the sum SDoF is $2.5$. This implies that over two time slots, the system can securely deliver 5 independent symbols across the three users. The authors prove the optimality of this result by establishing a matching upper bound using the Statistical Equivalence Property (SEP), which involves creating a virtual receiver to bound the information leakage.
Conclusion
This research demonstrates that alternating CSIT can be effectively leveraged to maintain high secure communication rates. By using a simple yet powerful artificial noise injection strategy, the transmitter can overcome the limitations of delayed feedback for specific users. These findings provide a theoretical foundation for designing robust and secure feedback strategies in next-generation wireless broadcast systems.
Summary updated