{"title":"具有离散传输速率的缓冲辅助中继","authors":"Wayan Wicke, N. Zlatanov, V. Jamali, R. Schober","doi":"10.1109/CWIT.2015.7255182","DOIUrl":null,"url":null,"abstract":"We consider a slow fading three-node network consisting of a source, a half-duplex decode-and-forward relay, and a destination, where a direct link between the source and the destination does not exist. We assume that the half-duplex relay is equipped with a buffer and employs in each time slot adaptive scheduling of reception and transmission based on the instantaneous qualities of the source-to-relay and relay-to-destination links. Furthermore, as a practical constraint, we assume that in each time slot, the source and the relay can select transmission rates only from a discrete and finite set of available transmission rates. For this network, we design the optimal scheduling of reception and transmission at the relay and the optimal selection of the transmission rates at the source and the relay such that the throughput is maximized. Our numerical results show that the maximum throughput achieved with the proposed buffer-aided protocol for discrete transmission rates is significantly larger than the throughput achieved with conventional relaying protocols with continuous transmission rates.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Buffer-aided relaying with discrete transmission rates\",\"authors\":\"Wayan Wicke, N. Zlatanov, V. Jamali, R. Schober\",\"doi\":\"10.1109/CWIT.2015.7255182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a slow fading three-node network consisting of a source, a half-duplex decode-and-forward relay, and a destination, where a direct link between the source and the destination does not exist. We assume that the half-duplex relay is equipped with a buffer and employs in each time slot adaptive scheduling of reception and transmission based on the instantaneous qualities of the source-to-relay and relay-to-destination links. Furthermore, as a practical constraint, we assume that in each time slot, the source and the relay can select transmission rates only from a discrete and finite set of available transmission rates. For this network, we design the optimal scheduling of reception and transmission at the relay and the optimal selection of the transmission rates at the source and the relay such that the throughput is maximized. Our numerical results show that the maximum throughput achieved with the proposed buffer-aided protocol for discrete transmission rates is significantly larger than the throughput achieved with conventional relaying protocols with continuous transmission rates.\",\"PeriodicalId\":426245,\"journal\":{\"name\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2015.7255182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2015.7255182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Buffer-aided relaying with discrete transmission rates
We consider a slow fading three-node network consisting of a source, a half-duplex decode-and-forward relay, and a destination, where a direct link between the source and the destination does not exist. We assume that the half-duplex relay is equipped with a buffer and employs in each time slot adaptive scheduling of reception and transmission based on the instantaneous qualities of the source-to-relay and relay-to-destination links. Furthermore, as a practical constraint, we assume that in each time slot, the source and the relay can select transmission rates only from a discrete and finite set of available transmission rates. For this network, we design the optimal scheduling of reception and transmission at the relay and the optimal selection of the transmission rates at the source and the relay such that the throughput is maximized. Our numerical results show that the maximum throughput achieved with the proposed buffer-aided protocol for discrete transmission rates is significantly larger than the throughput achieved with conventional relaying protocols with continuous transmission rates.