基于认知干扰的主网络保密传输能力

Hongyu Ma, K. Niu, Weilin Wu, Shengyu Li, Guangqian Chu
{"title":"基于认知干扰的主网络保密传输能力","authors":"Hongyu Ma, K. Niu, Weilin Wu, Shengyu Li, Guangqian Chu","doi":"10.1109/ICT.2015.7124651","DOIUrl":null,"url":null,"abstract":"The secrecy transmission performance of cognitive radio ad hoc networks is investigated in this paper. The existing work on secrecy capacity of cognitive radio networks focus on order sense results like scaling laws, however, these results only give asymptotic predictions without an exact expression. In order to overcome this limitation, we propose a new method to derive the closed-form expression of secrecy transmission capacity of the primary network. The nearest neighbour routing protocol is considered. Furthermore, we evaluate the optimal PR density maximizing the secrecy transmission capacity under constraints of the connection outage probability (COP) and the secrecy outage probability (SOP), and obtain the maximum achievable secrecy transmission capacity. Analytical results show that cognitive interference is helpful to improve the secrecy connection performance satisfying the constraint that the average channel condition of primary networks is better than that of eavesdropping networks. Numerical results indicate that there is a tradeoff between the reliability and security in cognitive radio networks.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"34 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secrecy transmission capacity of primary network with help of cognitive interference\",\"authors\":\"Hongyu Ma, K. Niu, Weilin Wu, Shengyu Li, Guangqian Chu\",\"doi\":\"10.1109/ICT.2015.7124651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The secrecy transmission performance of cognitive radio ad hoc networks is investigated in this paper. The existing work on secrecy capacity of cognitive radio networks focus on order sense results like scaling laws, however, these results only give asymptotic predictions without an exact expression. In order to overcome this limitation, we propose a new method to derive the closed-form expression of secrecy transmission capacity of the primary network. The nearest neighbour routing protocol is considered. Furthermore, we evaluate the optimal PR density maximizing the secrecy transmission capacity under constraints of the connection outage probability (COP) and the secrecy outage probability (SOP), and obtain the maximum achievable secrecy transmission capacity. Analytical results show that cognitive interference is helpful to improve the secrecy connection performance satisfying the constraint that the average channel condition of primary networks is better than that of eavesdropping networks. Numerical results indicate that there is a tradeoff between the reliability and security in cognitive radio networks.\",\"PeriodicalId\":375669,\"journal\":{\"name\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"volume\":\"34 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2015.7124651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 22nd International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2015.7124651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了认知无线电自组织网络的保密传输性能。现有的关于认知无线网络保密能力的研究主要集中在尺度律等序感结果上,但这些结果只能给出渐近的预测,没有精确的表达式。为了克服这一限制,我们提出了一种新的方法来推导主网络保密传输容量的封闭表达式。考虑最近邻路由协议。进一步,在连接中断概率(COP)和保密中断概率(SOP)的约束下,我们评估了使保密传输容量最大化的最优PR密度,得到了可实现的最大保密传输容量。分析结果表明,在满足主网络平均信道条件优于窃听网络的约束条件下,认知干扰有助于提高保密连接性能。数值结果表明,在认知无线网络中存在可靠性与安全性之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Secrecy transmission capacity of primary network with help of cognitive interference
The secrecy transmission performance of cognitive radio ad hoc networks is investigated in this paper. The existing work on secrecy capacity of cognitive radio networks focus on order sense results like scaling laws, however, these results only give asymptotic predictions without an exact expression. In order to overcome this limitation, we propose a new method to derive the closed-form expression of secrecy transmission capacity of the primary network. The nearest neighbour routing protocol is considered. Furthermore, we evaluate the optimal PR density maximizing the secrecy transmission capacity under constraints of the connection outage probability (COP) and the secrecy outage probability (SOP), and obtain the maximum achievable secrecy transmission capacity. Analytical results show that cognitive interference is helpful to improve the secrecy connection performance satisfying the constraint that the average channel condition of primary networks is better than that of eavesdropping networks. Numerical results indicate that there is a tradeoff between the reliability and security in cognitive radio networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Artificial neural network-based nonlinear channel equalization: A soft-output perspective Joint resource scheduling for full-duplex cellular system Spatial coupling of root-LDPC: Parity bits doping Simplified robust design for nonregenerativemm multicasting MIMO relay systems A tree-based regularized orthogonal matching pursuit algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1