| 正交中继-窃听信道的最优中继函数及其可达安全速率 |
| |
| 引用本文： | 陈驰阳,邓志祥,王保云.正交中继-窃听信道的最优中继函数及其可达安全速率[J].应用科学学报,2014,32(2):119-124. |
| |
| 作者姓名： | 陈驰阳 邓志祥 王保云 |
| |
| 作者单位： | 1. 南京邮电大学通信与信息工程学院，南京210003
2. 东南大学移动通信国家重点实验室，南京210096
3. 南京邮电大学自动化学院，南京210003 |
| |
| 基金项目： | 国家自然科学基金(No.60972045, No.61271232, No.61071089)；江苏省自然科学基金(No.BK2010077)；东南大学移动通信国家重点实验室开放研究基金(No.2012D05)；江苏省优势学科建设项目基金；江苏省高校研究生创新项目基金(No.CXZZ11_0395)；江苏省高校优秀创新研究团队基金(No.TJ208029)资助 |
| |
| 摘 要： | 从信息理论安全的角度研究正交中继-窃听信道中的安全通信. 考虑采用瞬时中继策略的中继信道，即中继的输出仅依赖当前接收信号，首先给出可达安全速率的表达式，在此基础上得到中继函数为分段线性函数时信道安全速率的数学表示. 给出了安全速率的数值计算方法，通过迭代网格搜索优化分段线性函数的各段参数，得到了安全速率的次优解. 通过仿真对比了分段线性中继策略、放大前传策略、译码前传策略下的可达安全速率，结果表明分段线性中继比放大前传中继策略的可达安全速率更大. 当源-中继信道增益较小时，分段线性中继的安全速率比译码前传策略更高，复杂度更低且时延更小.
|
| 关 键 词： | 正交中继-窃听信道 安全速率 分段线性中继 |
| 收稿时间： | 2012-05-18 |
| 修稿时间： | 2013-01-14 |
Optimal Relay Function and Achievable Secrecy Rate in Orthogonal Relay-Eavesdropper Channel |
| |
| CHEN Chi-yang,DENG Zhi-xiang,WANG Bao-yun.Optimal Relay Function and Achievable Secrecy Rate in Orthogonal Relay-Eavesdropper Channel[J].Journal of Applied Sciences,2014,32(2):119-124. |
| |
| Authors: | CHEN Chi-yang DENG Zhi-xiang WANG Bao-yun |
| |
| Institution: | 1. College of Communication and Information Engineering, Nanjing University of Posts and;
Telecommunications, Nanjing 210003, China;
2. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China;
3. College of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210003, China |
| |
| Abstract: | In this paper, secret communication in an orthogonal relay-eavesdropper channel is studied in view of information-theoretical security. For an orthogonal relay-eavesdropper channel with instantaneous relay in which the present output depends only on the currently received signal, the achievable secrecy rate is
formulated. The achievable secrecy rate with piecewise linear(PL) relaying function is derived and computed numerically. A sub-optimal solution to this secrecy rate is obtained by optimizing the parameters of the piecewise linear function with an iterative grid search algorithm. The achievable secrecy rate with PL relaying is compared to that with amplify-and-forward (AF) relaying and decode-and-forward (DF) relaying by simulation. The results show that PL always outperforms AF, and outperforms DF when the source-relay link is poor. Meanwhile, compared with DF, PL relaying has lower complexity and lower time-delay. |
| |
| Keywords: | orthogonal relay-eavesdropper channel secrecy rate piecewise linear relaying |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《应用科学学报》浏览原始摘要信息 |
| 点击此处可从《应用科学学报》下载免费的PDF全文 |
