基于网络编码的协作恢复机制线性可解性研究

Research on linear solvability of network coding based cooperative recovery scheme

针对基于网络编码的协作恢复(CR)机制线性可解性未知问题,建立了CR机制网络编码包的线性可解性的量化分析模型,给出了在任意阶伽罗华编码有限域下接收方解码出所有源数据包的概率上下界,并提出了一种改进Gauss-Jordan的线性可解性在线判定算法。数值实验结果验证了所提上下界的紧密性和改进Gauss-Jordan算法解码的低等待时延特性,节点部署实验显示改进Gauss-Jordan算法较传统Gauss算法解码复杂度降低35%。

The linear solvability of network coding based cooperative recovery/repair(CR)scheme was studied.Specifically,the solvability analysis model for network coding based CR scheme was established,the upper and lower bounds of the probability for any receiver to decode all original information under arbitrary order of Galois coding field were proposed and proved,and an on-line solvability judgement algorithm was designed by improvement of Gauss-Jordan algorithm.Numerical results validate the compactness of the proposed upper and lower bounds as well as the short-time decoding waiting delay of the improved Gauss-Jordan algorithm.Node deployment experiments show that the decoding complexity of the improved Gauss Jordan algorithm is reduced by 35%compared with the traditional Gauss algorithm.