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}
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.