全双工无线供电通信网络保密吞吐量最大化

Roohollah Rezaei, Sumei Sun, Xin Kang, Y. Guan, Mohammadreza Pakravan
{"title":"全双工无线供电通信网络保密吞吐量最大化","authors":"Roohollah Rezaei, Sumei Sun, Xin Kang, Y. Guan, Mohammadreza Pakravan","doi":"10.1109/ICC.2019.8761724","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during the information transmission phase, with which we then obtain the optimum beamforming in each time slot and its duration. We compare our algorithm with uniform time slot and uniform beamforming in different settings and demonstrate its superior performance.","PeriodicalId":402732,"journal":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secrecy Throughput Maximization for Full-Duplex Wireless Powered Communication Networks\",\"authors\":\"Roohollah Rezaei, Sumei Sun, Xin Kang, Y. Guan, Mohammadreza Pakravan\",\"doi\":\"10.1109/ICC.2019.8761724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during the information transmission phase, with which we then obtain the optimum beamforming in each time slot and its duration. We compare our algorithm with uniform time slot and uniform beamforming in different settings and demonstrate its superior performance.\",\"PeriodicalId\":402732,\"journal\":{\"name\":\"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)\",\"volume\":\"177 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2019.8761724\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2019.8761724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了全双工无线供电通信网络的保密吞吐量。多天线基站(BS)一直向节点传输能量,每个节点在其传输时隙之前收集能量。在其他被认为是潜在窃听者的节点存在的情况下,节点依次将其机密信息传输到BS。导出了保密率,并给出了所有节点的保密吞吐量优化总和。优化变量为时隙持续时间和不同传输阶段的BS波束形成。这个问题是非凸且非平凡的。我们提出了一种次优方法,即在信息传输阶段,bss集中波束形成以使潜在的窃听者(其他节点)失明,然后在每个时隙及其持续时间内获得最佳波束形成。将该算法与均匀时隙和均匀波束形成在不同设置下进行了比较,证明了其优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secrecy Throughput Maximization for Full-Duplex Wireless Powered Communication Networks
In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during the information transmission phase, with which we then obtain the optimum beamforming in each time slot and its duration. We compare our algorithm with uniform time slot and uniform beamforming in different settings and demonstrate its superior performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信