{"title":"具有不完全CSI和个体功率约束的认知网络中继子集选择","authors":"L. Blanco, M. Nájar","doi":"10.1109/EUSIPCO.2015.7362625","DOIUrl":null,"url":null,"abstract":"This paper considers the relay subset selection problem in an underlay cognitive network in which two secondary users communicate assisted by a set of N potential relays. More specifically, this paper deals with the joint problem of choosing the best subset of L secondary relays and their corresponding weights which maximize the Signal-to-Interference-plus-Noise ratio (SINR) at the secondary user receiver, subject to per-relay power constraints and interference power constraints at the primary user. This problem is a combinatorial problem with a high computational burden. Nevertheless, we propose a sub-optimal technique, based on a convex relaxation of the problem, which achieves a near-optimal performance with a reduced complexity. Contrary to other approaches in the literature, the secondary relays are not limited to cooperate at full power.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relay subset selection in cognitive networks with imperfect CSI and individual power constraints\",\"authors\":\"L. Blanco, M. Nájar\",\"doi\":\"10.1109/EUSIPCO.2015.7362625\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the relay subset selection problem in an underlay cognitive network in which two secondary users communicate assisted by a set of N potential relays. More specifically, this paper deals with the joint problem of choosing the best subset of L secondary relays and their corresponding weights which maximize the Signal-to-Interference-plus-Noise ratio (SINR) at the secondary user receiver, subject to per-relay power constraints and interference power constraints at the primary user. This problem is a combinatorial problem with a high computational burden. Nevertheless, we propose a sub-optimal technique, based on a convex relaxation of the problem, which achieves a near-optimal performance with a reduced complexity. Contrary to other approaches in the literature, the secondary relays are not limited to cooperate at full power.\",\"PeriodicalId\":401040,\"journal\":{\"name\":\"2015 23rd European Signal Processing Conference (EUSIPCO)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 23rd European Signal Processing Conference (EUSIPCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUSIPCO.2015.7362625\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUSIPCO.2015.7362625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Relay subset selection in cognitive networks with imperfect CSI and individual power constraints
This paper considers the relay subset selection problem in an underlay cognitive network in which two secondary users communicate assisted by a set of N potential relays. More specifically, this paper deals with the joint problem of choosing the best subset of L secondary relays and their corresponding weights which maximize the Signal-to-Interference-plus-Noise ratio (SINR) at the secondary user receiver, subject to per-relay power constraints and interference power constraints at the primary user. This problem is a combinatorial problem with a high computational burden. Nevertheless, we propose a sub-optimal technique, based on a convex relaxation of the problem, which achieves a near-optimal performance with a reduced complexity. Contrary to other approaches in the literature, the secondary relays are not limited to cooperate at full power.