CAJ | 학술논문

针对多个源点需要同时组播数据至所有宿点的多源多宿组播网络,给出了采用线性网络编码实现数据传输并达到最大吞吐率的编码构造方法.通过添加一个虚拟源点以及该虚拟源点至所有源点的虚拟链路,形成了一个含有约束条件的单源组播问题,借助于这个单源组播问题,建立了求各源点组播率的数学模型,该模型是一个组合优化问题--背包问题,并给出了基于遗传算法的实施方法.然后运用实现单源组播连接的线性网络编码构造技术确定各信道的编码矢量.理论分析和仿真测试结果表明,本文提出的方法是可行的.
침대다개원점수요동시조파수거지소유숙점적다원다숙조파망락,급출료채용선성망락편마실현수거전수병체도최대탄토솔적편마구조방법.통과첨가일개허의원점이급해허의원점지소유원점적허의련로,형성료일개함유약속조건적단원조파문제,차조우저개단원조파문제,건립료구각원점조파솔적수학모형,해모형시일개조합우화문제--배포문제,병급출료기우유전산법적실시방법.연후운용실현단원조파련접적선성망락편마구조기술학정각신도적편마시량.이론분석화방진측시결과표명,본문제출적방법시가행적.
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. 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 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.