具有不完全CSI和个体功率约束的认知网络中继子集选择

L. Blanco, M. Nájar
{"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}
引用次数: 0

摘要

本文研究了一个由N个潜在中继辅助的两个辅助用户通信的底层认知网络中的中继子集选择问题。更具体地说,本文研究了在受每个中继功率约束和主用户干扰功率约束的情况下,选择L个辅助中继的最佳子集及其相应权值,使辅助用户接收机的信噪比(SINR)最大化的联合问题。该问题是一个计算量大的组合问题。然而,我们提出了一种基于问题的凸松弛的次优技术,该技术在降低复杂性的情况下实现了接近最优的性能。与文献中的其他方法相反,二次继电器不限于在全功率下合作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信