立即可解网络编码应用于无线网络重传中的时延分析

立即可解网络编码(instantly decodable network coding,IDNC)分为狭义立即可解网络编码(strict IDNC,S-IDNC)和广义立即可解网络编码(generalized IDNC,G-IDNC).分析了S-IDNC和G-IDNC的特点,并对这2种思想应用于重传的时延性能做了对比分析.以最小化解码时延为目标提出基于S-IDNC和基于G-IDNC权重顶点搜索算法,实验对比分析了所提算法和已有典型算法性能,验证了所提算法的有效性,并归纳了S-IDNC和G-IDNC的时延特征差异.实验结果表明,基于S-IDNC的重传算法使得信宿节点的时延大小分布较为聚集,而基于G-IDNC的重传算法时延大小分布更为分散,G-IDNC时延均值优于S-IDNC,而S-IDNC系统完成时延优于G-IDNC.

Delay analysis of instantly decodable network coding applied to wireless network retransmission

Instantly decodable network coding ( IDNC ) can be divided into strict instantly decodable network coding ( S-IDNC) and generalized instantly decodable network coding( G-IDNC) . In this paper the characteristics of S-IDNC and G-IDNC are analyzed,and the performances of the retransmission algorithms based on the basic idea of S-IDNC and G-IDNC respectively are compared. To minimize decoding delay, weighted search algorithms based on S-IDNC( WSAS) and G-IDNC ( WSAG) are proposed respectively. In the simulation experiment, the performance comparison among the algorithms pro-posed and the typical algorithms available has been shown, and the effectiveness of the algorithms proposed is verified. The characteristic difference of S-IDNC and G-IDNC is concluded. The simulation results show that the delay distribution of the retransmission algorithm based on S-IDNC is more aggregated, on the contrary the delay distribution of the retransmission algorithm based on G-IDNC is more scattered. The average delay of G-IDNC is superior to S-IDNC, and the system comple-tion delay of S-IDNC is better than G-IDNC.