{"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}
引用次数: 33
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
