Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (2): 380-385.

• 软件、算法与仿真 • 上一篇    下一篇

多源多宿组播网络线性网络编码的优化构造

蒲保兴1,2, 王伟平1, 杨路明1   

  1. (1. 中南大学信息科学与工程学院, 湖南 长沙 410083; 
    2. 邵阳学院信息工程系, 湖南 邵阳 422001)
  • 出版日期:2010-02-03 发布日期:2010-01-03

Optimal construction of linear network coding for 
multisource multisink multicast networks

PU Bao-xing1,2, WANG Wei-ping1, YANG Lu-ming1   

  1. PU Baoxing1,2, WANG Weiping1, YANG Luming1
  • Online:2010-02-03 Published:2010-01-03

摘要:

针对多个源点需要同时组播数据至所有宿点的多源多宿组播网络,给出了采用线性网络编码实现数据传输并达到最大吞吐率的编码构造方法。通过添加一个虚拟源点以及该虚拟源点至所有源点的虚拟链路,形成了一个含有约束条件的单源组播问题,借助于这个单源组播问题,建立了求各源点组播率的数学模型,该模型是一个组合优化问题——背包问题,并给出了基于遗传算法的实施方法。然后运用实现单源组播连接的线性网络编码构造技术确定各信道的编码矢量。理论分析和仿真测试结果表明,本文提出的方法是可行的。

Abstract:

Aiming at the multisource multisink multicast network in which each source node needs to multicast data to all sink nodes simultaneously, this paper proposes a linear network coding construction approach to implementing data transmission with maximum throughput. By appending an imaginary source node and the imaginary links from the imaginary source node to source nodes, a singlesource multicast problem with constraint condition is generated from the original network. 〖JP2〗To determine the multicast rates of source nodes, a mathematical model is established by virtue of this singlesource multicast problem. The model is a combinatorial 〖JP〗optimization problem, or knapsack problem, and is solved by the genetic algorithm. Then, the coding vectors of all channels are constructed by linear network coding construction technology for singlesource multicast connection. Theoretical analysis and simulation results show that the proposed approach is feasible.