多源多宿组播网络编码的可达信息率区域  

Achievable information rate region of multi-source multi-sink multicast network coding

作　　者：蒲保兴[1] 朱鸿鹏[1] 赵乘麟[1] 

机构地区：[1]邵阳学院激光与信息研究所,湖南邵阳422001

出　　处：《计算机应用》2015年第6期1546-1551,共6页journal of Computer Applications

基　　金：湖南省教育厅重点科研项目(11A111;12A068);湖南省科技计划项目(2012FJ3108)

摘　　要：为了解决多源多宿组播网络编码问题,提出了计算可达信息率区域的算法和构造线性网络编码的方法。在已有研究的基础上,把多源多宿组播网络编码问题转化为一个含有约束的单源组播网络编码问题,通过理论分析与推导,找出了各源点组播率之间的相互约束关系,进而构造了一个多目标优化模型来表征可达信息率区域的边界,提出了两种求解该多目标优化问题的方法:枚举法和基于遗传算法的多目标优化算法。从求出的Pareto边界可以导出可达信息率区域。选定了各源点的组播率后,通过求解含有约束的单源组播网络编码问题便可以构造出线性网络编码方案。仿真测试结果表明提出的方法可以求出可达信息率区域的整数点边界,并能构造线性网络编码方案。In order to solve the problem of multi-source multi-sink multicast network coding, an algorithm for computing achievable information rate region and an approach for constructing linear network coding scheme were proposed. Based on the previous studies, the multi-source multi-sink multicast network coding problem was transformed into a specific single-source muhicast network coding scenario with a constraint at the source node. By theoretical analyses and formula derivation, the constraint relationship among the muhicast rate of source nodes was found out. Then a multi-objective optimization model was constructed to describe the boundary of achievable information rate region. Two methods were presented for solving this model. One was the enumeration method, the other was multi-objective optimization method based on genetic algorithm. The achievable information rate region could be derived from Pareto boundary of the multi-objective optimization model. After assigning the muhicast rate of source nodes, the linear network coding scheme could be constructed by figuring out the single- source multicast network coding scenario with a constraint. The simulation results show that the proposed methods can find out the boundary of achievable information rate region including integral points and construct linear network coding scheme.

关 键 词：多源多宿组播 可达信息率区域 单源组播 网络编码 多目标优化 

分 类 号：TN919.03[电子电信—通信与信息系统] TP393.01[电子电信—信息与通信工程]