变距离保密约束下认知无线网络中的干净中继

Pin-Hsun Lin, Frederic Gabry, R. Thobaben, Eduard Axel Jorswieck, M. Skoglund
{"title":"变距离保密约束下认知无线网络中的干净中继","authors":"Pin-Hsun Lin, Frederic Gabry, R. Thobaben, Eduard Axel Jorswieck, M. Skoglund","doi":"10.1109/GLOCOMW.2014.7063619","DOIUrl":null,"url":null,"abstract":"In this paper we investigate the cooperative secure communication in a four-node cognitive channel where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission with variational distance constraint. And the primary user's secrecy rate is required to be unchanged. We propose the clean relaying with the cooperative jamming scheme to achieve this goal, where the secondary transmitter splits its transmitting phase into two non-overlapped intervals after successfully decoding the primary message. Due to the considered secrecy metric, we resort to the information spectrum method, to derive the achievable secrecy rates for the primary user. Then we formulate the secondary user's rate maximization problem over the power allocation and time splitting at the cognitive transmitter under the constraint that primary user's secrecy rate is unchanged. Numerical results show that the secondary transmitter can choose clean relaying or pure cooperative jamming according to the relative positions of the nodes to achieve better performance than the one without any clean phase.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Clean relaying in cognitive radio networks with variational distance secrecy constraint\",\"authors\":\"Pin-Hsun Lin, Frederic Gabry, R. Thobaben, Eduard Axel Jorswieck, M. Skoglund\",\"doi\":\"10.1109/GLOCOMW.2014.7063619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate the cooperative secure communication in a four-node cognitive channel where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission with variational distance constraint. And the primary user's secrecy rate is required to be unchanged. We propose the clean relaying with the cooperative jamming scheme to achieve this goal, where the secondary transmitter splits its transmitting phase into two non-overlapped intervals after successfully decoding the primary message. Due to the considered secrecy metric, we resort to the information spectrum method, to derive the achievable secrecy rates for the primary user. Then we formulate the secondary user's rate maximization problem over the power allocation and time splitting at the cognitive transmitter under the constraint that primary user's secrecy rate is unchanged. Numerical results show that the secondary transmitter can choose clean relaying or pure cooperative jamming according to the relative positions of the nodes to achieve better performance than the one without any clean phase.\",\"PeriodicalId\":354340,\"journal\":{\"name\":\"2014 IEEE Globecom Workshops (GC Wkshps)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Globecom Workshops (GC Wkshps)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2014.7063619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2014.7063619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文研究了一种四节点认知信道中的协作保密通信,在这种信道中,从接收端被视为潜在的窃听者,相对于具有变距离约束的主传输端。并且要求主用户的保密率保持不变。为了实现这一目标,我们提出了配合干扰的干净中继方案,其中二次发射机在成功解码主消息后将其发射相位分成两个不重叠的间隔。由于考虑了保密度量,我们采用信息谱方法,推导出主用户可实现的保密率。然后,在主用户保密率不变的约束下,提出了认知发射机上功率分配和时间分割的次用户保密率最大化问题。数值结果表明,二次发射机可以根据节点的相对位置选择干净中继或纯协同干扰,以获得比无干净相位时更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clean relaying in cognitive radio networks with variational distance secrecy constraint
In this paper we investigate the cooperative secure communication in a four-node cognitive channel where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission with variational distance constraint. And the primary user's secrecy rate is required to be unchanged. We propose the clean relaying with the cooperative jamming scheme to achieve this goal, where the secondary transmitter splits its transmitting phase into two non-overlapped intervals after successfully decoding the primary message. Due to the considered secrecy metric, we resort to the information spectrum method, to derive the achievable secrecy rates for the primary user. Then we formulate the secondary user's rate maximization problem over the power allocation and time splitting at the cognitive transmitter under the constraint that primary user's secrecy rate is unchanged. Numerical results show that the secondary transmitter can choose clean relaying or pure cooperative jamming according to the relative positions of the nodes to achieve better performance than the one without any clean phase.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信