认知无线电系统中一种高效的多中继选择方案

M. Naeem, D. Lee, U. Pareek
{"title":"认知无线电系统中一种高效的多中继选择方案","authors":"M. Naeem, D. Lee, U. Pareek","doi":"10.1109/ICCW.2010.5503967","DOIUrl":null,"url":null,"abstract":"In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the number of relays. In this paper, we propose an interference-aware greedy algorithm for the relay selection problem. The proposed algorithm has low computational complexity, and its effectiveness is verified through simulation results.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"424 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"An Efficient Multiple Relay Selection Scheme for Cognitive Radio Systems\",\"authors\":\"M. Naeem, D. Lee, U. Pareek\",\"doi\":\"10.1109/ICCW.2010.5503967\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the number of relays. In this paper, we propose an interference-aware greedy algorithm for the relay selection problem. The proposed algorithm has low computational complexity, and its effectiveness is verified through simulation results.\",\"PeriodicalId\":422951,\"journal\":{\"name\":\"2010 IEEE International Conference on Communications Workshops\",\"volume\":\"424 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Communications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2010.5503967\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2010.5503967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

提出了一种低复杂度的认知无线电系统干扰感知多中继选择(IAMRS)方案。选择多中继的主要目标是在对主用户可接受干扰的约束下,使目的地信噪比最大化。通过穷举搜索寻找最优IAMRS的计算复杂度随着继电器数量呈指数增长。针对中继选择问题,提出了一种干扰感知贪婪算法。该算法具有较低的计算复杂度,仿真结果验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Multiple Relay Selection Scheme for Cognitive Radio Systems
In this paper, we present a low-complexity Interference Aware Multiple Relay Selection (IAMRS) scheme for cognitive radio system. The main objective in selecting multiple relays is to maximize the SNR at the destination under the constraint of acceptable interference to the primary users (PU). The computational complexity of finding an optimal IAMRS by exhaustive search grows exponentially with the number of relays. In this paper, we propose an interference-aware greedy algorithm for the relay selection problem. The proposed algorithm has low computational complexity, and its effectiveness is verified through simulation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信