.png){kind=icon}
返回
On Intercept Probability Minimization Under Sparse Random Linear Network Coding
.png){kind=icon}
OA
AI
DOI：10.1109/TVT.2019.2907290.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used.
Keyword:
Sparse random network coding
intercept probability
physical layer security
secrecy outage probability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容