The Achievable Information Rate Region for Multi-source Multi-sink Multicast Case Based on Network Coding

Based on network coding data transmission, this work consider the achievable information rate region in context of multi-source multi-sink multicast case, in which several source nodes require to multicast information to the same set of sink nodes. We present a method that can not only compute the achievable information rate region, but also construct linear network coding scheme. According to the peculiarity of the same set of sink nodes, the multi-source network coding problem is transformed into a specific single-source multicast network coding scenario with a constraint at the source node. A multi-objective optimization model is build for solve the specific single-source multicast scenario. From esparto set the achievable information rate region can be figured out. The proposed method is derived from theoretical analysis and the simulation results show that it is effective.