在任意多跳放大转发中继网络中通过选择实现完全分集

W. Shi, Sumit Roy
{"title":"在任意多跳放大转发中继网络中通过选择实现完全分集","authors":"W. Shi, Sumit Roy","doi":"10.1109/GLOCOM.2009.5425579","DOIUrl":null,"url":null,"abstract":"Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by the number of links on the minimum cut set, and achieved by a selection strategy which maximizes end-to-end SNR. The optimal selection requires the channel information of all the links and serves as a performance bound. A sub-optimal selection method is then proposed to achieve full diversity in a distributed and low-complexity manner. The performance loss of the sub-optimal selection is shown to be small by both theoretic analysis and simulations.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Achieving Full Diversity by Selection in Arbitrary Multi-Hop Amplify-and-Forward Relay Networks\",\"authors\":\"W. Shi, Sumit Roy\",\"doi\":\"10.1109/GLOCOM.2009.5425579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by the number of links on the minimum cut set, and achieved by a selection strategy which maximizes end-to-end SNR. The optimal selection requires the channel information of all the links and serves as a performance bound. A sub-optimal selection method is then proposed to achieve full diversity in a distributed and low-complexity manner. The performance loss of the sub-optimal selection is shown to be small by both theoretic analysis and simulations.\",\"PeriodicalId\":405624,\"journal\":{\"name\":\"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2009.5425579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2009.5425579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

虽然针对简单的2跳多中继网络已经提出了几种合作分集策略,但是对于任意的多跳放大转发中继网络,目前还没有实用有效的策略来保证最大的分集顺序。在本文中,对于给定的连通性,最大可实现的分集顺序由最小切割集上的链路数决定,并通过最大化端到端信噪比的选择策略来实现。最优选择需要所有链路的信道信息,并作为性能边界。然后提出了一种次优选择方法,以分布式和低复杂度的方式实现充分的多样性。理论分析和仿真结果表明,次优选择的性能损失较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Achieving Full Diversity by Selection in Arbitrary Multi-Hop Amplify-and-Forward Relay Networks
Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by the number of links on the minimum cut set, and achieved by a selection strategy which maximizes end-to-end SNR. The optimal selection requires the channel information of all the links and serves as a performance bound. A sub-optimal selection method is then proposed to achieve full diversity in a distributed and low-complexity manner. The performance loss of the sub-optimal selection is shown to be small by both theoretic analysis and simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信