分布式时空编码中继网络的可更新ARQ协议

Jun Zhang, Chao Zhang, Lei Wang, Guo Wei
{"title":"分布式时空编码中继网络的可更新ARQ协议","authors":"Jun Zhang, Chao Zhang, Lei Wang, Guo Wei","doi":"10.1109/APCC.2009.5375499","DOIUrl":null,"url":null,"abstract":"An updatable Automatic Repeat reQuest (ARQ) protocol for distributed space-time coded cooperative networks is proposed in this paper. We define a decoding relay set (DS), composed of the relays decoding the packet from source correctly. The DS would be expanded as the round of ARQ increasing, because the relays failing to receive correct packet in previous (re)transmission are still possible to decode the packet successfully in future retransmission. Since more and more relays would participate in ARQ process, the possibility that the destination can decode the error-free packet would be improved. Simulation results show that the updatable protocol has a lower packet loss ratio (PLR) and smaller average number of retransmission (Naver) than conventional protocol. Especially, when the channels between relays are in good condition, the proposed protocol can obtain about 1.6dB gain at a PLR of 10−3.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Updatable ARQ protocol for distributed space-time coded relay networks\",\"authors\":\"Jun Zhang, Chao Zhang, Lei Wang, Guo Wei\",\"doi\":\"10.1109/APCC.2009.5375499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An updatable Automatic Repeat reQuest (ARQ) protocol for distributed space-time coded cooperative networks is proposed in this paper. We define a decoding relay set (DS), composed of the relays decoding the packet from source correctly. The DS would be expanded as the round of ARQ increasing, because the relays failing to receive correct packet in previous (re)transmission are still possible to decode the packet successfully in future retransmission. Since more and more relays would participate in ARQ process, the possibility that the destination can decode the error-free packet would be improved. Simulation results show that the updatable protocol has a lower packet loss ratio (PLR) and smaller average number of retransmission (Naver) than conventional protocol. Especially, when the channels between relays are in good condition, the proposed protocol can obtain about 1.6dB gain at a PLR of 10−3.\",\"PeriodicalId\":217893,\"journal\":{\"name\":\"2009 15th Asia-Pacific Conference on Communications\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 15th Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2009.5375499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种适用于分布式空时编码协作网络的可更新自动重复请求(ARQ)协议。我们定义了一个解码中继集(DS),由正确解码数据包的中继组成。DS会随着ARQ轮数的增加而扩大,因为在前一次(重)传输中没有接收到正确数据包的中继在以后的重传中仍然有可能成功解码数据包。由于越来越多的中继参与到ARQ过程中,目的端解码无错误报文的可能性就会提高。仿真结果表明,与传统协议相比,可更新协议具有更低的丢包率(PLR)和更小的平均重传次数(Naver)。特别是,当中继之间的信道状况良好时,该协议在PLR为10−3时可获得约1.6dB增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Updatable ARQ protocol for distributed space-time coded relay networks
An updatable Automatic Repeat reQuest (ARQ) protocol for distributed space-time coded cooperative networks is proposed in this paper. We define a decoding relay set (DS), composed of the relays decoding the packet from source correctly. The DS would be expanded as the round of ARQ increasing, because the relays failing to receive correct packet in previous (re)transmission are still possible to decode the packet successfully in future retransmission. Since more and more relays would participate in ARQ process, the possibility that the destination can decode the error-free packet would be improved. Simulation results show that the updatable protocol has a lower packet loss ratio (PLR) and smaller average number of retransmission (Naver) than conventional protocol. Especially, when the channels between relays are in good condition, the proposed protocol can obtain about 1.6dB gain at a PLR of 10−3.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信