放大转发协作通信系统的用户中继分配

Y. Su, Zhiquan Bai, Shanshan Peng, Shangqian Sun, T. Han, K. Kwak
{"title":"放大转发协作通信系统的用户中继分配","authors":"Y. Su, Zhiquan Bai, Shanshan Peng, Shangqian Sun, T. Han, K. Kwak","doi":"10.1109/ISCIT.2016.7751586","DOIUrl":null,"url":null,"abstract":"In this paper, we study the low complexity user-relay assignment problem in amplify-and-forward (AF) cooperative communication systems, where multiple users compete for the same group of relays. In order to reduce the great computational complexity of the exhaustive user-relay assignment algorithm which provides the best performance in multi-user multi-relay environment, we propose a suboptimal low complexity user-relay assignment algorithm. The proposed algorithm can also optimize the achievable system average sum rate and improve the system outage probability. Simulation results and analysis demonstrate the efficiency and superiority of the proposed algorithm in average system sum rate and outage probability of the worst user. The complexity of the proposed algorithm is increased linearly with the number of the users and the relays.","PeriodicalId":240381,"journal":{"name":"2016 16th International Symposium on Communications and Information Technologies (ISCIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"User-relay assignment for amplify-and-forward cooperative communication systems\",\"authors\":\"Y. Su, Zhiquan Bai, Shanshan Peng, Shangqian Sun, T. Han, K. Kwak\",\"doi\":\"10.1109/ISCIT.2016.7751586\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the low complexity user-relay assignment problem in amplify-and-forward (AF) cooperative communication systems, where multiple users compete for the same group of relays. In order to reduce the great computational complexity of the exhaustive user-relay assignment algorithm which provides the best performance in multi-user multi-relay environment, we propose a suboptimal low complexity user-relay assignment algorithm. The proposed algorithm can also optimize the achievable system average sum rate and improve the system outage probability. Simulation results and analysis demonstrate the efficiency and superiority of the proposed algorithm in average system sum rate and outage probability of the worst user. The complexity of the proposed algorithm is increased linearly with the number of the users and the relays.\",\"PeriodicalId\":240381,\"journal\":{\"name\":\"2016 16th International Symposium on Communications and Information Technologies (ISCIT)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 16th International Symposium on Communications and Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2016.7751586\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 16th International Symposium on Communications and Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2016.7751586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了放大转发(AF)协作通信系统中多用户竞争同一组中继的低复杂度用户中继分配问题。为了降低穷举式用户中继分配算法巨大的计算复杂度,在多用户多中继环境下提供最佳性能,提出了一种次优低复杂度用户中继分配算法。该算法还可以优化可实现的系统平均和率,提高系统停机概率。仿真结果和分析表明,该算法在系统平均和率和最差用户的停机概率方面具有较高的效率和优越性。该算法的复杂度随用户和中继数量的增加呈线性增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User-relay assignment for amplify-and-forward cooperative communication systems
In this paper, we study the low complexity user-relay assignment problem in amplify-and-forward (AF) cooperative communication systems, where multiple users compete for the same group of relays. In order to reduce the great computational complexity of the exhaustive user-relay assignment algorithm which provides the best performance in multi-user multi-relay environment, we propose a suboptimal low complexity user-relay assignment algorithm. The proposed algorithm can also optimize the achievable system average sum rate and improve the system outage probability. Simulation results and analysis demonstrate the efficiency and superiority of the proposed algorithm in average system sum rate and outage probability of the worst user. The complexity of the proposed algorithm is increased linearly with the number of the users and the relays.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信