.png){kind=icon}
返回
Robust Optimality of Secure TIN
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2021.3118019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In order to discover larger networks and parameter regimes where sharp Generalized Degrees of Freedom (GDoF) characterizations may he found based on the optimality of robust schemes for interference and broadcast networks with channel state information at the transmitters (CSIT) limited to finite precision, we explore the impact of secrecy constraints. In the absence of secrecy constraints, the largest such parameter regime for K user interference networks is the CTIN regime (so named for the Convexity of the GDoF region achieved by Treating Interference as Noise (TIN)) originally discovered by Yi and Cake, whose optimality was established by Chan et al. For the corresponding broadcast networks the largest regime is the SLS (Simple Layered Superposition) regime discovered by Davoodi and Jafar, but only for small networks with K <= 3 users. By including secrecy constraints, we identify much larger regimes, the STIN regime and the SLS regime, where GDoF are fully characterized for arbitrary number of users under finite precision CSIT, for interference networks and broadcast networks, respectively. The optimal achievable scheme in both cases is based on TIN along with power control and jamming. Proofs of optimality rely on a combination of secrecy constraints and Aligned Images sum-set inequalities.
Keyword:
Interference channels
secure generalized degrees of freedom
treating interference as noise
extremal network theory
aligned image bounds
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容