Secure Network Coding Applied Research In Wireless Mesh

Network coding can improve network transmission capacity and security. The emergence of network coding is a turning point in network communication, which has challenged the traditional "store-and-forward" mode of communication. Network coding not only allows network nodes to retains their original function, but also encodes the network nodes themselves, thereby improving information security and transmission capacity at the same time, This occurs by allowing the transmission capacity to achieve the upper limit of the maximum flow and minimum cut theorem, which the traditional store-and-forward mode is unable to achieve. Since network coding has important theoretical significance and wide application potential, network coding theory and its applications are an increasing concerning among experts.The original intention of network coding was to improve network throughput, however, further research revealed that it can also be used to ensure secure information transmission with in the network. Currently, network coding theory is increasingly used in the study of network security.In this thesis, the concepts and basic network coding theory are comprehensively discussed, Then, an introduction to matrix theory, particularly the characteristics of the Hadamard matrix and basic concepts of finite field is given. On this basis, I propose a type of secure network coding algorithm based on the Hadamard matrix and explain how the algorithm can be applied to wireless mesh networks.In this algorithm, the Hadamard matrix was regarded as the coefficient matrix of the input information, and between the two of them has used XOR computing was used to encode the input information, Source information was then recovered by putting the encoded input information through an inverse Hadamard matrix Elements for the Hadamard matrix were randomly selected in a finite field, and the resultant coefficient matrix was sufficiently random.Any would-be attacker would need substantial time to reconstruct the original and inverse matrix to retrieve original information. Use this algorithm would increase the difficulty of deciphering encoded information for many applications. The most widely regarded advantage of WMNs is self-organization, This thesis explores WMN theory, advantages and potential application. The proposed algorithm for use in WMNs t will expand their range of application. Network security coding for WMN research history and future trends is also discussed.