{"title":"Interference-aware relay selection for multiple source-destination cooperative networks","authors":"J. Xu, Sheng Zhou, Z. Niu","doi":"10.1109/APCC.2009.5375623","DOIUrl":null,"url":null,"abstract":"We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.