Pu Zhao, Meng Zhang, Hui Yu, Han-wen Luo, Wen Chen
{"title":"和功率约束下MU-MISO信道和保密率优化波束形成设计","authors":"Pu Zhao, Meng Zhang, Hui Yu, Han-wen Luo, Wen Chen","doi":"10.1109/WCSP.2014.6992154","DOIUrl":null,"url":null,"abstract":"This paper studies the beamforming design problem of a multi-user downlink network, assuming perfect channel state information (CSI) known to the base station (BS). In this scenario, the BS is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the BS employs transmit beamforming with a given requirement on sum transmitting power. The object is to maximize the sum secrecy rate (SSR) of the network, which leads to a nonconvex complicated structure, and makes he considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation (SDR) and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing (ZF) based beamforming method is presented in the case that BS is able to nullify he eavesdroppers' rate. Numerical results show that the former strategy achieves better performance than the later one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the traditional signal-to-leakage-and-noise ratio (SLNR) based algorithm.","PeriodicalId":412971,"journal":{"name":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Beamforming design of sum secrecy rate optimization for MU-MISO channel under sum power constraint\",\"authors\":\"Pu Zhao, Meng Zhang, Hui Yu, Han-wen Luo, Wen Chen\",\"doi\":\"10.1109/WCSP.2014.6992154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the beamforming design problem of a multi-user downlink network, assuming perfect channel state information (CSI) known to the base station (BS). In this scenario, the BS is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the BS employs transmit beamforming with a given requirement on sum transmitting power. The object is to maximize the sum secrecy rate (SSR) of the network, which leads to a nonconvex complicated structure, and makes he considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation (SDR) and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing (ZF) based beamforming method is presented in the case that BS is able to nullify he eavesdroppers' rate. Numerical results show that the former strategy achieves better performance than the later one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the traditional signal-to-leakage-and-noise ratio (SLNR) based algorithm.\",\"PeriodicalId\":412971,\"journal\":{\"name\":\"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.6992154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.6992154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Beamforming design of sum secrecy rate optimization for MU-MISO channel under sum power constraint
This paper studies the beamforming design problem of a multi-user downlink network, assuming perfect channel state information (CSI) known to the base station (BS). In this scenario, the BS is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the BS employs transmit beamforming with a given requirement on sum transmitting power. The object is to maximize the sum secrecy rate (SSR) of the network, which leads to a nonconvex complicated structure, and makes he considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation (SDR) and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing (ZF) based beamforming method is presented in the case that BS is able to nullify he eavesdroppers' rate. Numerical results show that the former strategy achieves better performance than the later one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the traditional signal-to-leakage-and-noise ratio (SLNR) based algorithm.