Distributed scheme based on network coding to construct k -redundant multicast network

In this paper, based on the wireless network model constructed by elementary graph, an efficient distributed algorithm is proposed to build up the k -redundant multicast network for information transmissions, in which there exist k link-disjoint paths from source to each receiver. Then a method based on network coding for constructing network codes in k -redundant multicast network is proposed by exploiting the characteristics of MDS code. Finally, we analyze the computation complexity of the distributed scheme.