{"title":"认知无线电网络中迭代鲁棒下行波束形成","authors":"I. Wajid, Hristina Nikolaeva, M. Pesavento","doi":"10.4108/ICST.CROWNCOM.2011.245766","DOIUrl":null,"url":null,"abstract":"The problem of multi-user worst-case robust downlink beamforming and power allocation in a cognitive radio (CR) framework is studied. The goal is to minimize the total transmitted power while providing the secondary users (SUs) with a minimum acceptable quality-of-service (QoS), with additional constraints on the total interference leaked to the primary network (PN). An iterative algorithm has been proposed to solve this problem. In each iteration the algorithm approximates the worst-case covariance mismatch from the solution of the previous iteration und performs a fixed-point iteration that is based on uplink-downlink duality. Computer simulations show that the proposed technique converges to the global optimal solution at reduced computational complexity compared to the existing methods that rely on convex optimization.","PeriodicalId":249175,"journal":{"name":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Iterative robust downlink beamforming in cognitive radio networks\",\"authors\":\"I. Wajid, Hristina Nikolaeva, M. Pesavento\",\"doi\":\"10.4108/ICST.CROWNCOM.2011.245766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of multi-user worst-case robust downlink beamforming and power allocation in a cognitive radio (CR) framework is studied. The goal is to minimize the total transmitted power while providing the secondary users (SUs) with a minimum acceptable quality-of-service (QoS), with additional constraints on the total interference leaked to the primary network (PN). An iterative algorithm has been proposed to solve this problem. In each iteration the algorithm approximates the worst-case covariance mismatch from the solution of the previous iteration und performs a fixed-point iteration that is based on uplink-downlink duality. Computer simulations show that the proposed technique converges to the global optimal solution at reduced computational complexity compared to the existing methods that rely on convex optimization.\",\"PeriodicalId\":249175,\"journal\":{\"name\":\"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/ICST.CROWNCOM.2011.245766\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.CROWNCOM.2011.245766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative robust downlink beamforming in cognitive radio networks
The problem of multi-user worst-case robust downlink beamforming and power allocation in a cognitive radio (CR) framework is studied. The goal is to minimize the total transmitted power while providing the secondary users (SUs) with a minimum acceptable quality-of-service (QoS), with additional constraints on the total interference leaked to the primary network (PN). An iterative algorithm has been proposed to solve this problem. In each iteration the algorithm approximates the worst-case covariance mismatch from the solution of the previous iteration und performs a fixed-point iteration that is based on uplink-downlink duality. Computer simulations show that the proposed technique converges to the global optimal solution at reduced computational complexity compared to the existing methods that rely on convex optimization.