FDD放大转发合作网络中的中继选择

A. Gouissem, L. Samara, R. Hamila, N. Al-Dhahir, S. Foufou
{"title":"FDD放大转发合作网络中的中继选择","authors":"A. Gouissem, L. Samara, R. Hamila, N. Al-Dhahir, S. Foufou","doi":"10.1109/PIMRC.2017.8292408","DOIUrl":null,"url":null,"abstract":"In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable suboptimal multiple relay selection and beamforming optimization scheme based on the ℓ1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming at maximizing the aggregated SNR of the two communicating nodes. Furthermore, by exploiting the previous solutions to accelerate the algorithm's convergence, our proposed algorithm converges to a suboptimal solution compared to the exhaustive search technique with much less complexity.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Relay selection in FDD amplify-and-forward cooperative networks\",\"authors\":\"A. Gouissem, L. Samara, R. Hamila, N. Al-Dhahir, S. Foufou\",\"doi\":\"10.1109/PIMRC.2017.8292408\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable suboptimal multiple relay selection and beamforming optimization scheme based on the ℓ1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming at maximizing the aggregated SNR of the two communicating nodes. Furthermore, by exploiting the previous solutions to accelerate the algorithm's convergence, our proposed algorithm converges to a suboptimal solution compared to the exhaustive search technique with much less complexity.\",\"PeriodicalId\":397107,\"journal\":{\"name\":\"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2017.8292408\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2017.8292408","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了双向双跳放大前向分频双工协同无线网络中的中继选择和分布式波束形成问题。当使用单个中继最大传输功率约束时,中继选择和波束形成优化问题成为NP困难问题,需要穷举搜索才能找到最优解。因此,我们提出了一种计算负担得起的基于l1范数平方松弛的次优多中继选择和波束形成优化方案。该方案同时对两个传输方向进行选择,同时以最大化两个通信节点的聚合信噪比为目标。此外,通过利用先前的解决方案来加速算法的收敛,我们提出的算法收敛到一个次优解,与穷举搜索技术相比,复杂性要低得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Relay selection in FDD amplify-and-forward cooperative networks
In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable suboptimal multiple relay selection and beamforming optimization scheme based on the ℓ1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming at maximizing the aggregated SNR of the two communicating nodes. Furthermore, by exploiting the previous solutions to accelerate the algorithm's convergence, our proposed algorithm converges to a suboptimal solution compared to the exhaustive search technique with much less complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RSSI-based self-localization with perturbed anchor positions Bit precision study of a non-orthogonal iterative detector with FPGA modelling verification Analytical approach to base station sleep mode power consumption and sleep depth Experimental over-the-air testing for coexistence of 4G and a spectrally efficient non-orthogonal signal Secrecy analysis of random wireless networks with multiple eavesdroppers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1