有序优化重传次数的网络编码算法  

Orderly and optimal retransmission times network coding algorithm

作　　者：郭豪[1] 王琦[1] 王青山[1] 杨康[1] 

机构地区：[1]合肥工业大学数学学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2017年第7期908-911,共4页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61401144;61571179);安徽省自然科学基金资助项目(1308085MF87);高等学校博士学科点专项基金资助项目(2013111120018)

摘　　要：在时延敏感的无线多播网络中,由于网络终端的丢包问题,源节点往往需要重传数据包。在重传数据包过程中,文章应用网络编码技术提出了一种有序优化重传次数(orderly and optimal retransmission times,OORT)的网络编码算法。该算法通过对哈希值互补值邻域中不同的值对应的数据包进行相互编码,以减少其哈希值的度,再与其互补哈希值对应的数据包编码组成有序数据包发送组合,来产生更多的编码机会。该算法在监听概率较低导致其他算法不能进行网络编码时,还可以进行再次编码,从而减少重传次数,提高了网络性能。模拟实验结果表明,该算法与著名的COPE网络编码算法和HLAR算法相比较,在重传次数和时延上都有明显的降低。In delay-aware wireless multicast networks, due to the packet losses of network terminals, the source node often requires retransmitting the packets. Based on the application of network coding in the process of packet retransmissions, an orderly and optimal retransmission times（OORT） network coding algorithm is proposed. Firstly, the algorithm encodes the packets which correspond to different values of complementary hash value field. Based on the result of the reduced hash value de- gree, it encodes the packets which the complementary hash value corresponds to. The proposed algo- rithm creates more encoding opportunities, especially in a low listening probability, so that it reduces the retransmission times and improves the network performance. The simulation results show that the proposed algorithm can significantly reduce the transmission times and delay compared with the COPE algorithm and the HLAR algorithm.

关 键 词：丢包率 网络编码 重传次数 时延 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]