计算机应用 ›› 2018, Vol. 38 ›› Issue (3): 769-775.DOI: 10.11772/j.issn.1001-9081.2017081982

• 网络与通信 • 上一篇    下一篇

基于网络编码的确定性逐层构造算法

徐光宪, 赵越, 赖俊宁   

  1. 辽宁工程技术大学 电子与信息工程学院, 辽宁 葫芦岛 125105
  • 收稿日期:2017-08-15 修回日期:2017-10-19 出版日期:2018-03-10 发布日期:2018-03-07
  • 通讯作者: 赵越
  • 作者简介:徐光宪(1977-),男,江苏盐城人,教授,博士,主要研究方向:信息论、网络编码;赵越(1992-),女,辽宁葫芦岛人,硕士研究生,主要研究方向:信息论、网络编码、信息安全;赖俊宁(1992-),男,辽宁阜新人,硕士,主要研究方向:网络编码、信息安全。
  • 基金资助:

    国家科技支撑计划项目(2013BAH12F02);辽宁省高等学校杰出青年学者成长计划项目(LJQ2012029)。

Deterministic layered construction algorithm based on network coding

XU Guangxian, ZHAO Yue, LAI Junning   

  1. School of Electronics and Information Engineering, Liaoning Technical University, Huludao Liaoning 125105, China
  • Received:2017-08-15 Revised:2017-10-19 Online:2018-03-10 Published:2018-03-07
  • Supported by:

    This work is partially supported by National Science and Technology Support Program of China (2013BAH12F02), the Liaoning Colleges and Universities Fund for Distinguished Young Scholars (LJQ2012029).

摘要:

为了解决适用于多源组播通信的网络编码构造算法存在收敛时间较长的问题,提出一种基于网络编码的确定线性逐层构造算法。在已有研究基础上,利用虚拟信源点进行虚拟试播:首先,根据决策树算法逐层确定获得非满秩局部编码矩阵的节点;然后,重构与该节点对应的上层变换节点的局部编码系数,生成新的编码向量;最后,重传这些编码向量至对应节点,使该节点的局部编码矩阵满秩,从而得到可行的编码方案。在试播过程中允许对出现数据冗余的链路进行修剪枝,以提高带宽利用率。与基于信宿反馈的确定网络编码(SNFDNC)算法相比,该算法只需进行一次虚拟试播。仿真测试结果表明该算法在中等规模网络中收敛时间更短,能进一步提高多源组播通信的平均传输速率。

关键词: 网络编码, 确定性网络拓扑, 多源组播, 逐层构造, 决策树算法, 收敛时间

Abstract:

To solve the problem that the construction algorithm of multi-source multicast network coding costs long convergence time, a deterministic layered construction algorithm based on network coding was proposed. On the basis of existing studies, a virtual source was used for virtual trial. Firstly, the nodes with non-full rank local coding matrix were determined layer-by-layer by decision tree algorithm. Then, the local encoding coefficients of the upper transform nodes were reconstructed and a new encoding vector was generated. Finally, the new encoding vector was transmitted to the lower node corresponding to it, and the local coding matrix of the lower node was full rank, so a feasible coding scheme was obtained to realize network coding. Moreover, when redundant data is found in some links, pruning branches method was implemented to improve bandwidth utilization. The algorithm only needs one virtual trial multicast in comparison with the Sink Nodes Feedback Deterministic Network Coding (SNFDNC), and the simulation results show that the convergence time of the proposed algorithm is shorter in the medium scale network, and the average transmission rate of multicast communication is further improved.

Key words: network coding, deterministic network topology, multi-source multicast, layered construction, decision tree algorithm, convergence time

中图分类号: