最小化重传次数的无线网络编码广播重传算法

发布时间：2018-02-27 03:09

本文关键词： 最小化重传次数缓存网络编码无线广播网络重传效率　出处：《信号处理》2017年10期 　论文类型：期刊论文

【摘要】：提出了一种最小化重传次数的无线网络编码广播重传算法。针对无线广播网络,本文首先引入了缓存网络编码(C-IDNC)的概念,在接收端,正确接收但不能解码的网络编码数据包将被缓存起来等待将来的解码机会而不是简单的丢弃该编码包。其次,通过对基于IDNC重传策略的问题描述,分析了不同因素对重传次数的影响,并把这些影响因子量化为可度量的数值。随后,构造了IDNC图((ν,ξ),用于表征所有可行编码和编码增益,并把最小化重传次数问题转化为最大权重搜寻问题,给出了寻找最优解的编码方法。同时,为降低算法复杂度和计算量,提出一种启发式的最大权重搜寻算法(CI-MWSA)。仿真结果表明,与传统方案相比,提出的策略和算法能有效提高重传效率、减少重传次数。
[Abstract]:A wireless network-coded broadcast retransmission algorithm is proposed to minimize the number of retransmissions. For wireless broadcast networks, the concept of cache network coding (C-IDNC) is introduced in this paper. Properly received but not decoded network encoded packets will be cached for future decoding opportunities rather than simply discarded. Secondly, by describing the problem based on the IDNC retransmission policy, The influence of different factors on the number of retransmissions is analyzed, and these factors are quantized into measurable values. Then, the IDNC diagram is constructed to represent all feasible coding and coding gain. The problem of minimizing the number of retransmissions is transformed into the maximum weight search problem, and the coding method for finding the optimal solution is given. In order to reduce the complexity and computational complexity of the algorithm, a heuristic maximum weight search algorithm is proposed. Compared with the traditional scheme, the proposed strategy and algorithm can effectively improve the efficiency of retransmission and reduce the number of retransmissions.
【作者单位】：解放军理工大学通信工程学院;
【基金】：国家自然科学基金重大研究计划(91438115,61671472);国家自然科学基金(61371123,61301165) 江苏省自然科学基金(BK20160079) 中国博士后基金特别资助项目(2015T81079) 中国博士后科学基金(2014M552612) 预研项目基金(9140C020306130C02007)资助项目
【分类号】：TN92

【相似文献】