T. Le, Quoc-Tuan Vien, H. Nguyen, D. W. K. Ng, R. Schober
{"title":"基于概率约束的高效安全SWIPT鲁棒优化","authors":"T. Le, Quoc-Tuan Vien, H. Nguyen, D. W. K. Ng, R. Schober","doi":"10.1109/GLOCOM.2016.7842232","DOIUrl":null,"url":null,"abstract":"In this paper, we propose beamforming schemes to simultaneously transmit data to multiple information receivers (IRs) while transfering power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the imperfection of the instantaneous channel state information, we introduce a probabilistic-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, secure data transmission, and power transfer reliability. As the proposed optimization problem is non-convex and has an infinite number of constraints, we propose two robust reformulations of the original problem adopting safe-convex-approximation techniques. The derived robust formulations are in semidefinite programming forms, hence, they can be effectively solved by standard convex optimization packages. Simulation results confirm the superiority of the proposed approaches to a baseline scheme in guaranteeing transmission security.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Robust Optimization with Probabilistic Constraints for Power-Efficient and Secure SWIPT\",\"authors\":\"T. Le, Quoc-Tuan Vien, H. Nguyen, D. W. K. Ng, R. Schober\",\"doi\":\"10.1109/GLOCOM.2016.7842232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose beamforming schemes to simultaneously transmit data to multiple information receivers (IRs) while transfering power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the imperfection of the instantaneous channel state information, we introduce a probabilistic-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, secure data transmission, and power transfer reliability. As the proposed optimization problem is non-convex and has an infinite number of constraints, we propose two robust reformulations of the original problem adopting safe-convex-approximation techniques. The derived robust formulations are in semidefinite programming forms, hence, they can be effectively solved by standard convex optimization packages. Simulation results confirm the superiority of the proposed approaches to a baseline scheme in guaranteeing transmission security.\",\"PeriodicalId\":425019,\"journal\":{\"name\":\"2016 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2016.7842232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2016.7842232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust Optimization with Probabilistic Constraints for Power-Efficient and Secure SWIPT
In this paper, we propose beamforming schemes to simultaneously transmit data to multiple information receivers (IRs) while transfering power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the imperfection of the instantaneous channel state information, we introduce a probabilistic-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, secure data transmission, and power transfer reliability. As the proposed optimization problem is non-convex and has an infinite number of constraints, we propose two robust reformulations of the original problem adopting safe-convex-approximation techniques. The derived robust formulations are in semidefinite programming forms, hence, they can be effectively solved by standard convex optimization packages. Simulation results confirm the superiority of the proposed approaches to a baseline scheme in guaranteeing transmission security.