Primary Secrecy Is Achievable: Optimal Secrecy Rate in Overlay CRNs with an Energy Harvesting Secondary Transmitter

Long Chen, Liusheng Huang, Hongli Xu, Chenkai Yang, Zehao Sun, Xinglong Wang
{"title":"Primary Secrecy Is Achievable: Optimal Secrecy Rate in Overlay CRNs with an Energy Harvesting Secondary Transmitter","authors":"Long Chen, Liusheng Huang, Hongli Xu, Chenkai Yang, Zehao Sun, Xinglong Wang","doi":"10.1109/ICCCN.2015.7288450","DOIUrl":null,"url":null,"abstract":"To tackle the challenging secrecy communication problem in energy harvesting cognitive radio networks, this paper considers an overlay system with one energy harvesting secondary user (SU) to assist primary transmission under the assumption that the primary channel at primary receiver is worse than the eavesdropper. Under such scenario, we optimize the secrecy rate of the PU transmitter by jointly investigating energy harvesting slot, cooperative transmission slot and so on. Given the transmission rate requirement between SUs, the optimization problem is formulated as a mixed integer non-linear (MINLP) program. Due to the special features, we design a polynomial time algorithm SRMA to optimally solve this problem. The algorithm computes the lower bound and upper bound of the transmission power in a secondary transmitter, which are relative with the QoS requirement and energy harvesting parameters. Then SRMA determines its optimal transmission power by iteratively searching between two bounds. Numerical results demonstrate that the primary secrecy rate grows with the increasing energy save ratio and optimal energy save ratio is inversely proportional to the energy harvesting rate.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

To tackle the challenging secrecy communication problem in energy harvesting cognitive radio networks, this paper considers an overlay system with one energy harvesting secondary user (SU) to assist primary transmission under the assumption that the primary channel at primary receiver is worse than the eavesdropper. Under such scenario, we optimize the secrecy rate of the PU transmitter by jointly investigating energy harvesting slot, cooperative transmission slot and so on. Given the transmission rate requirement between SUs, the optimization problem is formulated as a mixed integer non-linear (MINLP) program. Due to the special features, we design a polynomial time algorithm SRMA to optimally solve this problem. The algorithm computes the lower bound and upper bound of the transmission power in a secondary transmitter, which are relative with the QoS requirement and energy harvesting parameters. Then SRMA determines its optimal transmission power by iteratively searching between two bounds. Numerical results demonstrate that the primary secrecy rate grows with the increasing energy save ratio and optimal energy save ratio is inversely proportional to the energy harvesting rate.
主保密是可实现的:具有能量收集二次发射机的覆盖crn的最优保密率
为了解决能量收集认知无线网络中具有挑战性的保密通信问题,在假设主接收端主信道比窃听端差的情况下,提出了一种具有一个能量收集辅助用户(SU)的覆盖系统来辅助主传输。在这种情况下,我们通过联合研究能量收集槽、协同传输槽等来优化PU发射机的保密率。在给定单元间传输速率要求的情况下,将优化问题表述为一个混合整数非线性(MINLP)方案。由于该算法的特殊特性,我们设计了一种多项式时间算法SRMA来最优地解决这一问题。该算法计算二次发射机发射功率的下界和上界,这与QoS要求和能量收集参数有关。然后,通过在两个边界之间迭代搜索确定其最优传输功率。数值结果表明,一级保密率随着节能率的增大而增大,最优节能率与能量收集率成反比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信