Wireless mesh network coding method

Abstract

The invention discloses a wireless mesh network coding method, which solves the problem of low coding gain of the existing COPE coding algorithm. In this method, for the original data packet participating in XOR, the DESN mark is added in the packet header of the generated data packet to identify the destination node of the original data packet, and the receiving side judges whether itself or the neighbor is the destination node through the DESN mark, To implement different strategies, the receiving side only needs to decode the link entering the relay node, and select the link route entering the target node. By adopting this mechanism, the performance of network coding is improved. The present invention can be applied to various communication networks, can reduce the number of original data packet transmissions, effectively improve the network coding gain and network throughput, has very good practical value, and provides a new way for the research and design of network coding.

Description

technical field [0001] The invention relates to a wireless mesh network coding method, which belongs to the technical field of network information and network coding. Background technique [0002] In traditional networks, nodes acting as relays can only replicate, amplify, and forward received signals, which is sometimes a waste of network resources. In 2000, Ahlswede proposed the concept of network coding, that is, network nodes perform specific operations on received information bit streams, such as modulo 2 sums, operations on finite fields, etc., and then send them out instead of just copying and forwarding. From the point of view of information theory, they rigorously proved that network coding can help us reach the maximum capacity of the communication network, thereby maximizing the use of the existing resources of the network. The proposal of network coding essentially breaks the traditional information processing method in communication network, and has become a ne...

AI Technical Summary

Problems solved by technology

When a node receives a data packet encoded by n original data packets, the node will search for n-1 original data packet IDs stored in the data pool. If it can be found, the node will encode this The data packet and the searched n-1 data packets are decoded by phase AND operation to obtain the required data packet; if the search cannot be found, that is, it cannot be decoded, the node will simply store the data packet in the data packet pool and will not send it to In the output queue, this characteristic determines that the COPE encoding algorithm cannot achieve the maximum network throughput in some network topologies

Images