• 网络与通信 •

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

1. 邵阳学院 激光与信息研究所, 湖南 邵阳 422001
• 收稿日期:2014-12-26 修回日期:2015-03-24 发布日期:2015-06-12
• 通讯作者: 朱鸿鹏(1977-),男,湖南邵阳人,讲师,硕士,主要研究方向:网络优化算法;52872485@qq.com
• 作者简介:蒲保兴(1965-),男,湖南邵阳人,教授,博士,主要研究方向:网络编码、进化计算;赵乘麟(1965-),男,湖南邵阳人,教授,硕士,主要研究方向:图像编码。
• 基金资助:

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

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

1. Institute of Laser Technology and Information, Shaoyang University, Shaoyang Hunan 422001, China
• Received:2014-12-26 Revised:2015-03-24 Published:2015-06-12

Abstract:

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 multicast network coding scenario with a constraint at the source node. By theoretical analyses and formula derivation, the constraint relationship among the multicast 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 multicast 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.