基于C-IDNC的无线广播重传时间最小化研究

Teng Niu, Dongmei Zhang, Kui Xu, Fei Wang
{"title":"基于C-IDNC的无线广播重传时间最小化研究","authors":"Teng Niu, Dongmei Zhang, Kui Xu, Fei Wang","doi":"10.1109/ICCS.2016.7833611","DOIUrl":null,"url":null,"abstract":"We are concerned with designing feedback-based adaptive Instantly Decodable Network Coding (IDNC) schemes with the aim of minimizing retransmission times in wireless multicast and broadcast scenarios. In this paper, we first analyze the multiple factors influencing the transmission times and give the quantitative formula. Meantime, we introduce the concept of Cache-based Instantly Decodable Network Coding (C-IDNC) that the correctly received undecodable retransmission packets are waited in the cache for a future network decoding opportunity rather than delete. Then, we formulate the retransmission times minimization problem as an max-weight search problem and propose efficient algorithms for finding its optimal solution. Further, we propose a heuristic algorithms with worst case linear execution complexity based on sorting and iteration. Simulation results show that our proposed algorithms significantly reduce the IDNC retransmission times compared to previous works.","PeriodicalId":282352,"journal":{"name":"2016 IEEE International Conference on Communication Systems (ICCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On minimizing retransmission times based on C-IDNC for wireless broadcasting\",\"authors\":\"Teng Niu, Dongmei Zhang, Kui Xu, Fei Wang\",\"doi\":\"10.1109/ICCS.2016.7833611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We are concerned with designing feedback-based adaptive Instantly Decodable Network Coding (IDNC) schemes with the aim of minimizing retransmission times in wireless multicast and broadcast scenarios. In this paper, we first analyze the multiple factors influencing the transmission times and give the quantitative formula. Meantime, we introduce the concept of Cache-based Instantly Decodable Network Coding (C-IDNC) that the correctly received undecodable retransmission packets are waited in the cache for a future network decoding opportunity rather than delete. Then, we formulate the retransmission times minimization problem as an max-weight search problem and propose efficient algorithms for finding its optimal solution. Further, we propose a heuristic algorithms with worst case linear execution complexity based on sorting and iteration. Simulation results show that our proposed algorithms significantly reduce the IDNC retransmission times compared to previous works.\",\"PeriodicalId\":282352,\"journal\":{\"name\":\"2016 IEEE International Conference on Communication Systems (ICCS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Communication Systems (ICCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2016.7833611\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Communication Systems (ICCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2016.7833611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们关注的是设计基于反馈的自适应即时可解码网络编码(IDNC)方案,以减少无线组播和广播场景下的重传时间。本文首先分析了影响传输次数的多种因素,并给出了定量公式。同时,我们引入了基于缓存的即时可解码网络编码(C-IDNC)的概念,即正确接收到的不可解码重传数据包在缓存中等待未来的网络解码机会,而不是删除。然后,我们将重传次数最小化问题表述为一个最大权值搜索问题,并提出了寻找其最优解的有效算法。此外,我们提出了一种基于排序和迭代的最坏情况线性执行复杂度的启发式算法。仿真结果表明,与以往的算法相比,本文提出的算法显著减少了IDNC重传次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On minimizing retransmission times based on C-IDNC for wireless broadcasting
We are concerned with designing feedback-based adaptive Instantly Decodable Network Coding (IDNC) schemes with the aim of minimizing retransmission times in wireless multicast and broadcast scenarios. In this paper, we first analyze the multiple factors influencing the transmission times and give the quantitative formula. Meantime, we introduce the concept of Cache-based Instantly Decodable Network Coding (C-IDNC) that the correctly received undecodable retransmission packets are waited in the cache for a future network decoding opportunity rather than delete. Then, we formulate the retransmission times minimization problem as an max-weight search problem and propose efficient algorithms for finding its optimal solution. Further, we propose a heuristic algorithms with worst case linear execution complexity based on sorting and iteration. Simulation results show that our proposed algorithms significantly reduce the IDNC retransmission times compared to previous works.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信