Yi Yuan, Zheng Chu, Z. Ding, K. Cumanan, M. Johnston
{"title":"Joint relay beamforming and power splitting ratio optimization in a multi-antenna relay network","authors":"Yi Yuan, Zheng Chu, Z. Ding, K. Cumanan, M. Johnston","doi":"10.1109/WCSP.2014.6992047","DOIUrl":null,"url":null,"abstract":"This paper investigates simultaneous wireless information and power transfer (SWIPT) in a multi-antenna relay network. We consider robust transmit power minimization problem at the relay by jointly optimizing beamforming and adaptive power splitting subject to the signal-to-inference-plus-noise (SINR) and energy harvesting constraints by incorporating channel uncertainty model. We formulate the original non-convex problem into semidefinite programming problem (SDP) by relaxing rank-one constraint and we show the optimal solution of SDP is always rank-one. Simulation results are provided to validate the performance of the proposed robust algorithms.","PeriodicalId":412971,"journal":{"name":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2014.6992047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
This paper investigates simultaneous wireless information and power transfer (SWIPT) in a multi-antenna relay network. We consider robust transmit power minimization problem at the relay by jointly optimizing beamforming and adaptive power splitting subject to the signal-to-inference-plus-noise (SINR) and energy harvesting constraints by incorporating channel uncertainty model. We formulate the original non-convex problem into semidefinite programming problem (SDP) by relaxing rank-one constraint and we show the optimal solution of SDP is always rank-one. Simulation results are provided to validate the performance of the proposed robust algorithms.