{"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}
引用次数: 9
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.