Determine The Security Features Of Network Coding

Network coding has become a hot research field of Computer and Information Theory. This paper proposed an deterministic linear network coding based a deterministic algorithm which is relative to the random linear network coding. We discussed its work model in unicast and multicast network topology, and then establish the simulation model compared with the difference between random linear network coding and deterministic linear network coding, the results shows that deterministic linear network coding can be guaranteed 100% decoding success rate in spite of the size of limited field, and random linear network coding could not decoding with high probability in little limited field.We focused on analyzing the safety features of deterministic linear network coding. First, we introduced the weakly secure network coding and k-secure network conding, and then discussed the secure of deterministic linear network coding in unicast and multicast network topology. We proved that the deterministic linear network coding is satisfy「h/2」-secure in theory in which h is the multicast capacity of network, and establish the simulation model to verify the theoretical derivation that the deterministic linear network coding is satisfy「h/2」-secure. Then we provide a method to translate the weakly secure network coding into k-secure network coding.We build the experimental platform based on Zigbee wireless nodes, and we has completed some experiments as follows:the decode success rate experiment, security level validation experiment, prevent pollution attacks experiment. The results show that the deterministic linear network coding is better than random linear network coding, and improving overall security of network.