A multi-device data transmission method based on MESH relay

Abstract

The present application discloses a multi-device data transmission method based on MESH relay, including: obtaining at least one transmission task at the current moment in the MESH network; based on each transmission task, inputting into the path distributed search algorithm to obtain the feasible path set corresponding to the transmission task; the path distributed search algorithm includes: determining the source node as the local search point, searching all network nodes within the distance range with the local search point as the center as candidate relay nodes; determining the target node with a relay cost value greater than the value threshold, generating the local relay link segment of each target node; using each target node as a new local search point to generate the corresponding target node and its local relay link segment, until there is a terminal node within the distance range of the local search point, stop searching, and generate the feasible path set of the transmission task; based on the transmission branch strategy, using the feasible path set to transmit the data packet. Thus, the transmission efficiency and quality of multiple transmission tasks in the MESH network are improved.

Description

Technical Field

[0001] The present invention relates to the field of Internet technology, and in particular to a multi-device data transmission method based on MESH relay. Background Art

[0002] In the face of the technical problem that multiple devices cannot perform mesh self-networking at the same time, the main method adopted is: modify the networking logic of the master device and the slave device in the existing Mesh networking technology, remove the step of sending overlap information to the corresponding slave device and interrupting the networking process when the master device receives probe information from multiple slave devices at the same time, and store the networking information in the received probe information into the message queue, and continue to obtain the networking information from the message queue after completing the current networking process. In this way, although the networking failure caused by the overlap of smart devices can be avoided, the networking information cannot realize the networking of multiple devices at the same time according to the queue and networking process, and then the technical problem of activating the networking one by one is required. However, it also brings new problems. That is, in a multi-channel network environment, if the node of the self-networking only uses one interface, it will cause interference between adjacent hops on the same path or adjacent paths. The nodes cannot be accurately synchronized, and the channels cannot be quickly switched, so the coordinated communication between the nodes cannot be realized.

[0003] The invention patent with patent application number 202310200483.9 discloses a mesh network networking method. By setting all mesh nodes as network peer nodes, each network peer node can obtain networking information from other network peer nodes and forward the relay information between adjacent nodes to each node. There is no need to send data in the form of message queues between the master device and the slave device, and an optimal path is determined for data transmission according to the distance between the networking nodes, making the overall networking process simpler, the data packet loss rate can be effectively reduced, and multiple devices can perform mesh self-networking at the same time.

[0004] However, when all nodes can be used as relays to transmit data, if multiple large-scale data transmission tasks are carried out simultaneously in the mesh network, and transmission is carried out by relying on a single optimal path, all traffic is concentrated on the optimal path, which may cause local overload in the entire mesh network, and the unknown risks faced will gradually become more serious. In the mesh self-organizing network of multiple devices, there is a hidden danger of unreasonable network load, resulting in poor efficiency and quality of data transmission. In particular, when a node becomes the intersection of multiple data transmission paths, its processing pressure and transmission delay may increase significantly. Summary of the invention

[0005] The present application provides a multi-device data transmission method based on MESH relay to improve the transmission efficiency and quality of multiple transmission tasks in a MESH network.

[0006] The present application provides a multi-device data transmission method based on MESH relay, which is applied to a MESH network including a plurality of network nodes that serve as relays for each other, including:

[0007] S101, obtaining at least one transmission task at the current moment in the MESH network, where the transmission task includes a source node, a terminal node, and a data packet;

[0008] S102, based on each transmission task, input into a preset path distributed search algorithm to obtain a feasible path set corresponding to the transmission task, the feasible path set including at least one feasible path; the path distributed search algorithm includes:

[0009] S201, determine the source node as the local search point, and search all network nodes within a preset distance range with the local search point as the center as candidate relay nodes; S202, obtain the relay cost value of each candidate relay node based on the distance feature vector formed by the local search point and the candidate relay node; S203, determine the candidate relay node whose relay cost value is greater than the value threshold as the target node, and generate a local relay link segment for each target node; S204, based on each target node, use it as a new local search point, repeat steps S201 to S204, generate the target node corresponding to the local search point, and the local relay link segment corresponding to the target node, until there is an end node within the distance range of the local search point, and stop searching; S205, when all local search points have stopped searching, count all local relay link segments stored in the end node, determine each local relay link segment as a feasible path, and generate a feasible path set for the transmission task;

[0010] S103, based on the feasible path set of the transmission task and according to a preset transmission branch strategy, the data packet is transmitted using the feasible path set.

[0011] Preferably, the distance feature vector is expressed as , the relay cost value of each candidate relay node is calculated according to the following formula:

[0012] ;

[0013] Where w is the relay cost value of the candidate relay node, is the angle between the local search point and the candidate relay node, and d is the distance between the candidate relay node and the local search point.

[0014] Preferably, the generated local relay link segment of the target node is stored in the corresponding target node, and each target node stores a unique local relay link segment;

[0015] The local relay link segment of the target node is generated in a specific manner as follows: a link segment formed by the target node and its corresponding local search point and a local relay link segment already stored in the local search point are spliced ​​and generated.

[0016] Preferably, the preset transmission branch strategy is specifically: obtaining the number M of feasible paths in the feasible path set, randomly splitting the data packet into M data blocks, and respectively allocating the data blocks to the feasible paths for transmission.

[0017] Preferably, after S205, the method further includes:

[0018] S301, based on each transmission task, obtain a corresponding feasible path set, and perform quality evaluation on each feasible path therein according to a path quality evaluation algorithm to obtain the transmission quality of each feasible path;

[0019] S302, sorting the transmission qualities of the feasible paths in descending order, removing the feasible paths corresponding to abnormal transmission qualities, and updating the feasible path set;

[0020] Each feasible path consists of a node sequence It consists of k relay link segments. is the source node, is the final node, and the path quality evaluation algorithm is as follows:

[0021] ;

[0022] in, is the transmission quality of the jth feasible path in the feasible path set, is the length of the jth feasible path, For network nodes and The packet loss rate of the relay link segment composed of For network nodes The load at the current moment.

[0023] Preferably, the step of obtaining the number M of feasible paths in the feasible path set, randomly splitting the data packet into M data blocks, and respectively allocating the data blocks to the feasible paths for transmission specifically includes:

[0024] S401, calculate the size of the data block allocated to each feasible path according to the following formula:

[0025] ;

[0026] in, is the size of the data block allocated to the jth feasible path in the feasible path set, is the size of the data packet, is the transmission quality of the jth feasible path, M is the total number of feasible paths in the feasible path set, is the cross interference value of the jth feasible path;

[0027] S402 , according to the sizes of the data blocks allocated to the M feasible paths, split the data packet into M data blocks of corresponding sizes, and respectively allocate the data blocks to the corresponding feasible paths for transmission tasks.

[0028] Preferably, based on all transmission tasks at the current moment, a certain transmission task is taken as an example and defined as a target transmission task. The cross interference value of each feasible path in the feasible path set of the target transmission task is obtained in the following manner:

[0029] B1. Obtain the mapping contour area of ​​the feasible path set of all transmission tasks at the current moment, and the mapping contour area is set to the maximum closed area formed by all feasible paths in the feasible path set;

[0030] B2, determine whether the mapping contour area of ​​the target transmission task overlaps with the mapping contour areas of other transmission tasks. If so, obtain all overlapping areas and execute B3. Otherwise, set the cross interference value of the feasible path set of the target transmission task to 1;

[0031] B3. Based on each feasible path of the target transmission task, all interference sections covered by the overlapping area are obtained, and the cross interference value of each feasible path in the feasible path set of the target transmission task is calculated according to the following formula:

[0032] ;

[0033] in, is the cross interference value of the jth feasible path, X is the total number of other transmission tasks that overlap with the jth feasible path, is the length of the jth feasible path, is the length of the interference section corresponding to the xth overlapping area on the jth feasible path, is the area of ​​the xth overlapping region, is the area size of the mapping contour area of ​​other transmission tasks to which the x-th overlapping area belongs, is the size of the data packet in other transmission tasks to which the x-th overlapping area belongs.

[0034] Preferably, after S204, the method further includes:

[0035] S501, based on each transmission task, monitoring in real time the transmission progress of its M data blocks on the corresponding feasible paths, including the network nodes where the data blocks are currently located on their feasible paths;

[0036] S502, when it is detected that the next network node for a data block transmission is in an interference section, the interference section is determined as a target interference section, the data block is determined as a target data block, and step S503 is executed;

[0037] S503, using a path quality evaluation algorithm to obtain the transmission quality of the target interference section , and compare it with the transmission quality of the feasible path to which the target interference section belongs calculated in S301 Compare and determine whether to trigger the interference adjustment mechanism.

[0038] Preferably, the S503 specifically includes:

[0039] If the target interferes with the transmission quality of the road section Lower than the transmission quality of the feasible path to which it belongs If the interference is greater than 80%, the interference adjustment mechanism is triggered.

[0040] Preferably, the interference adjustment mechanism includes: splitting the target data block into sub-data blocks, and relaying the sub-data blocks to preferred nodes of other feasible paths for transmission; wherein the preferred node is determined to be a network node that is closest to the target interference section and is not in the interference section.

[0041] One or more technical solutions provided in this application have at least the following technical effects or advantages:

[0042] By searching for multiple feasible paths for transmission tasks and transmitting data in parallel, the multi-path transmission capability of the MESH network is effectively utilized, thus improving the efficiency of data transmission. Transmitting data through multiple paths increases the redundancy of data. Even if a path fails, other paths can still transmit data, thus ensuring the reliability of data transmission and improving the utilization of network resources. By finding multiple feasible paths through a distributed search algorithm, the load in the network can be balanced, thus avoiding congestion on a certain path due to excessive data transmission. The distributed search algorithm can provide as many feasible paths as possible while ensuring a certain distance range (relay cost value), thus maximizing the load of the data packets of the transmission task on the transmission process.

[0043] By splitting and allocating data packets taking into account the transmission quality and cross-interference value (network interference between different transmission tasks) of feasible paths, high-quality paths in the feasible path set of transmission tasks can be more effectively utilized, while reducing network interference between different transmission tasks, improving the efficiency and quality of data transmission, especially in multi-task scenarios; by intelligently splitting and allocating data packets, unnecessary data transmission on paths with poor quality or high interference can be avoided, which helps to optimize the utilization of network resources and reduce resource waste and local congestion;

[0044] By real-time monitoring of the transmission progress of multiple data blocks corresponding to the transmission task on the corresponding feasible path, interference problems in the transmission process can be discovered and handled in a timely manner, thereby improving the reliability and stability of the transmission; when it is monitored that the data block is about to reach the interfering section where the transmission quality is significantly reduced, by splitting the data block and relaying it to the preferred node of other feasible paths, it is possible to effectively bypass the interfering section and continue to complete the data transmission without interrupting the transmission task; by optimizing the handling method of the interfering section, the transmission delay and packet loss caused by interference can be reduced, thereby improving the overall transmission efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 The figure is a flowchart of a multi-device data transmission method based on MESH relay according to an embodiment of the present invention. DETAILED DESCRIPTION

[0046] To facilitate the understanding of the present invention, the present application will be described more comprehensively below with reference to the relevant drawings; the drawings show preferred embodiments of the present invention, but the present invention can be implemented in many different forms and is not limited to the embodiments described herein; on the contrary, the purpose of providing these embodiments is to enable a more thorough and comprehensive understanding of the disclosed content of the present invention.

[0047] It should be noted that the terms “vertical”, “horizontal”, “up”, “down”, “left”, “right” and similar expressions used in this document are only for illustrative purposes and do not represent the only implementation method.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by technicians in the technical field to which the present invention belongs; the terms used in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention; the term "and / or" used herein includes any and all combinations of one or more related listed items.

[0049] Embodiment 1: In the networking process of the MESH network, all network nodes can relay each other and obtain the configured networking information from the external wired network device. The networking information can be a connection guide for all network nodes. According to the networking information, it can be understood how the network nodes are connected to each other for relay transmission. The corresponding MESH networking information is sent to each network node through the wired network device, that is, each device in the MESH network, and each device can obtain the connection method with other devices, thereby completing the networking of the entire MESH network.

[0050] After the MESH network is completed, the networking information will be transferred from the external wired network device to a network node in the MESH network for storage. Even if the external wired network device is disconnected, the devices in the network can continue to connect to each other according to the networking information to maintain the stability of the network.

[0051] Among them, the networking information of each network node may include the frequency, frequency band and bandwidth it uses. By obtaining the networking information, the antennas between devices can be "adapted" to establish a connection.

[0052] However, data transmission usually relies on an optimal path. If a node on the optimal path fails, the entire data transmission will be affected. All data transmission is concentrated on an optimal path, which can easily cause congestion on the path, while other paths may be idle, making it impossible to fully utilize the multi-path transmission capabilities of the MESH network.

[0053] Based on this, an embodiment of the present invention proposes a multi-device data transmission method based on MESH relay.

[0054] Figure 1 It is a flowchart of a multi-device data transmission method based on MESH relay in an embodiment of the present invention.

[0055] like Figure 1 As shown, a multi-device data transmission method based on MESH relay is applied to a MESH network including a plurality of network nodes that serve as relays for each other, and includes the following steps:

[0056] S101, obtaining at least one transmission task at the current moment in the MESH network, where the transmission task includes a source node, a terminal node, and a data packet.

[0057] S102, based on each transmission task, input into a preset path distributed search algorithm to obtain a feasible path set corresponding to the transmission task, the feasible path set including at least one feasible path.

[0058] The preset path distributed search algorithm specifically includes:

[0059] S201, determining a source node as a local search point, and searching all network nodes within a preset distance range with the local search point as a center as candidate relay nodes.

[0060] The preset distance range is set according to actual conditions to define a local range for searching for relay network nodes, and the present invention does not impose any limitation on this.

[0061] S202, obtaining the relay cost value of each candidate relay node according to the distance feature vector formed by the local search point and the candidate relay node.

[0062] Among them, the distance feature vector is expressed as , the relay cost value of each candidate relay node is calculated according to the following formula:

[0063] ;

[0064] Where w is the relay cost value of the candidate relay node, is the angle between the local search point and the candidate relay node, and d is the distance between the candidate relay node and the local search point.

[0065] S203, determine the candidate relay nodes whose relay cost value is greater than the value threshold as target nodes, and generate a local relay link segment for each target node, and store it in the corresponding target node, each target node stores a unique local relay link segment.

[0066] The local relay link segment of the target node is generated by concatenating the link segment composed of the target node and its corresponding local search point and the local relay link segment stored in its local search point (if the local search point is a source node, its local relay link segment can be ignored). Specifically, the link segment composed of the target node and its corresponding local search point is recorded as: local search point-target node, for example, target node B and its local search point A, and the local relay link segment originally stored in local search point A is PA, then the local relay link segment of target node B is recorded as PAB.

[0067] It can be understood that the local search point corresponds to at least one target node, that is, all network nodes within the distance range determined by the local search point, and the target node of the local search point is determined according to the relay cost value of each network node.

[0068] S204, based on each target node, take it as a new local search point, repeat steps S201 to S204, generate the target node corresponding to the local search point, and the local relay link segment corresponding to the target node, until there is a terminal node within the distance range of the local search point, and stop searching.

[0069] Specifically, if the search is stopped, the end node is used as the only target node of the new local search point, and a local relay link segment of the only target node is generated as a feasible path.

[0070] S205, after all local search points stop searching, all local relay link segments stored in the terminal node are counted, each local relay link segment is determined as a feasible path, and a feasible path set for the transmission task is generated.

[0071] As an example, a transmission task (source node A, end node E) at the current moment is input into the path distributed search algorithm to obtain the feasible path set of the transmission task:

[0072] A1. Start the search with source node A as the local search point, search for network nodes B and C within the preset distance range, obtain candidate relay nodes B and C, calculate their relay cost values ​​respectively, and find that the relay cost values ​​of B and C are both greater than the value threshold, and determine B and C as the target nodes of local search point A;

[0073] A2. For the target nodes B and C of the local search point A, generate their local relay link segments. For the target node B, its local relay link segment is AB, and for the target node C, its local relay link segment is AC;

[0074] A3. Use B and C as new local search points and repeat the above steps:

[0075] If a network node D is found within the distance range of the local search point B, and the relay cost value of D is greater than the threshold, D is determined as the target node of the local search point B, and a local relay link segment ABD of the target node D is generated based on the local relay link segment AB stored in the local search point B and the link segment BD composed of the target node D and its corresponding local search point B; D is used as a new local search point, and the above steps are repeated: if the terminal node E is found within the distance range of the local search point D, the search is stopped, and the terminal node E is used as the only target node of the local search point D, a local relay link segment ABDE of the only target node E is generated and used as a feasible path;

[0076] When the end node E is found within the search range of the local search point C, the search stops, and the end node E is used as the only target node of the local search point C. The local relay link segment ACE of the only target node E is generated and used as a feasible path;

[0077] A4. After all local search points stop searching, the two local relay link segments stored in the terminal node E are counted and determined as feasible paths for the transmission task, forming a feasible path set: ABDE, ACE.

[0078] S103, based on the feasible path set of the transmission task and according to a preset transmission branch strategy, the data packet is transmitted using the feasible path set.

[0079] Specifically, the preset transmission branch strategy is as follows: obtain the number M of feasible paths in the feasible path set, randomly split the data packet into M data blocks (each data block is assigned a unique number, which can be composed of a split sequence number and a transmission task number, and is used by the terminal node to sequentially splice all data blocks to obtain the original data packet of the transmission task), and respectively distribute the data blocks to the feasible paths for transmission. The terminal node obtains the data packet content of the transmission task based on the received data blocks and their unique numbers.

[0080] The technical solutions in the above embodiments of the present application have at least the following technical effects or advantages:

[0081] By searching for multiple feasible paths for the transmission task and transmitting data in parallel, the multi-path transmission capability of the MESH network is effectively utilized, thereby improving the efficiency of data transmission. Transmitting data through multiple paths increases data redundancy. Even if a path fails, other paths can still transmit data, ensuring the reliability of data transmission and improving the utilization rate of network resources. By finding multiple feasible paths through a distributed search algorithm, the load in the network can be balanced, avoiding congestion on a certain path due to excessive data transmission. The distributed search algorithm can provide as many feasible paths as possible while ensuring a certain distance range (relay cost value), thereby maximizing the load sharing of the data packets of the transmission task on the transmission process.

[0082] For all network nodes and transmission tasks in the entire MESH network, the distributed search algorithm relies on the search superposition of relay link segments from local to global, and disperses the task of global path calculation to each target node (local search point), thereby effectively reducing the burden of the EMSH network. Through distributed computing, each node shares the task of path calculation and improves the efficiency of selecting feasible path sets for transmission tasks.

[0083] Embodiment 2: In embodiment 1, all feasible paths for the transmission task are determined by a path distributed search algorithm, and the paths are combined based on the relay cost value calculated within the distance range as an indicator to obtain all feasible paths. Directly using all feasible paths to perform data packet splitting and allocation strategies for data transmission may result in invalid transmission, that is, although some feasible paths meet the search conditions, due to their own poor path quality performance, part of the data packet of the transmission task is lost or the transmission efficiency is too slow, resulting in reduced reliability of data transmission and waste of network resources, leading to local congestion.

[0084] Therefore, the embodiments of the present application are optimized to a certain extent based on the above embodiments.

[0085] In some embodiments, after step S205, the method further includes:

[0086] S301, based on each transmission task, obtain a corresponding feasible path set, and perform quality evaluation on each feasible path therein according to a path quality evaluation algorithm to obtain the transmission quality of each feasible path.

[0087] Each feasible path consists of a node sequence It consists of k relay link segments. is the source node, is the final node, and the path quality evaluation algorithm is as follows:

[0088] ;

[0089] in, is the transmission quality of the jth feasible path in the feasible path set, is the length of the jth feasible path, that is, the sum of the lengths of all relay link segments, For network nodes and The packet loss rate of the relay link segment composed of For network nodes The load at the current moment. The historical time window can be set to 10 minutes from the current moment.

[0090] S302, sorting the transmission qualities of the feasible paths in descending order, removing the feasible paths corresponding to abnormal transmission qualities, and updating the feasible path set to ensure that the feasible paths used for data transmission have higher transmission qualities.

[0091] Specifically, the method for determining abnormal transmission quality is as follows: the transmission quality of feasible paths is sorted in descending order to obtain a transmission quality sequence; based on the transmission quality sequence, the difference amplitude rates between adjacent transmission qualities are calculated in turn; and the adjacent transmission qualities corresponding to the difference amplitude rates greater than the difference threshold are determined to be abnormal transmission quality at the later sorting position.

[0092] Among them, the difference amplitude rate between adjacent transmission qualities is: , m is the position number of the transmission quality in the transmission quality sequence, is the m+1th transmission quality in the transmission quality sequence, is the mth transmission quality in the transmission quality sequence.

[0093] The technical solutions in the above embodiments of the present application have at least the following technical effects or advantages:

[0094] Through the path quality evaluation algorithm, the path length, historical packet loss rate and current node load are comprehensively considered to conduct a comprehensive quality evaluation of the feasible paths; by introducing the difference amplitude rate of transmission quality for the feasible path set, the feasible paths with poor quality are eliminated, which reduces the problem of data packet loss or low transmission efficiency during transmission and improves the reliability of data transmission; data transmission on paths with poor quality is avoided, thereby optimizing the utilization of network resources and reducing the occurrence of local congestion;

[0095] Through the path quality evaluation algorithm and the calculation of the difference amplitude rate, the intelligent screening of feasible paths is realized, and the accuracy and efficiency of path selection are improved.

[0096] Example 3: In Example 1 and Example 2, in order to load balance the data transmission in the MESH network and ensure the transmission quality, all feasible paths are screened for transmission quality, and the data packets are split and transmitted according to the number of feasible paths. However, the random splitting lacks the specificity of the feasible paths, resulting in low data transmission efficiency. Since there must be differences between the feasible paths formed between the source node and the terminal node, when using them to transmit data blocks, the size of the data block is also crucial to the transmission efficiency and quality of the feasible path. In addition, in a multi-task scenario, since the transmission task at the current moment is not unique, each transmission task corresponds to a feasible path set. When allocating the transmission task of the data packet, even if the data packet size is split considering the differences between the feasible paths of the transmission task itself, there are certain defects in the multi-task scenario in the entire MESH network, because there may be certain network interference between different transmission tasks, thereby affecting the transmission efficiency and quality.

[0097] Therefore, the embodiments of the present application are optimized to a certain extent based on the above embodiments.

[0098] In some embodiments, obtaining the number M of feasible paths in the feasible path set, randomly splitting the data packet into M data blocks, and respectively allocating the data blocks to the feasible paths for transmission, specifically includes:

[0099] S401, calculate the size of the data block allocated to each feasible path according to the following formula:

[0100] ;

[0101] in, is the size of the data block allocated to the jth feasible path in the feasible path set, is the size of the data packet, is the transmission quality of the jth feasible path, M is the total number of feasible paths in the feasible path set, is the cross interference value of the jth feasible path.

[0102] Specifically, based on all transmission tasks at the current moment, a transmission task is taken as an example and defined as a target transmission task. The cross interference value of each feasible path in the feasible path set of the target transmission task is obtained as follows:

[0103] B1. Obtain the mapping contour area of ​​the feasible path set of all transmission tasks at the current moment. The mapping contour area is set to the maximum closed area formed by all feasible paths in the feasible path set.

[0104] B2. Determine whether the mapping contour area of ​​the target transmission task overlaps with the mapping contour areas of other transmission tasks. If so, obtain all overlapping areas and execute B3. Otherwise, set the cross interference value of the feasible path set of the target transmission task to 1.

[0105] It should be noted that there is at least one overlapping area, and each overlapping area corresponds to a transmission task other than the target transmission task, that is, the mapping contour area of ​​the target transmission task may overlap with the mapping contour areas of multiple other transmission tasks.

[0106] B3. Based on each feasible path of the target transmission task, all interfering sections covered by the overlapping area (sections with intersecting endpoints with the overlapping area) are obtained, and the cross-interference value of each feasible path in the feasible path set of the target transmission task is calculated according to the following formula:

[0107] ;

[0108] in, is the cross interference value of the jth feasible path, X is the total number of other transmission tasks that overlap with the jth feasible path, and each other transmission task corresponds to an overlapping area, that is, the jth feasible path is associated with X overlapping areas. is the length of the jth feasible path, is the length of the interference section corresponding to the xth overlapping area on the jth feasible path, is the area of ​​the xth overlapping region, is the area size of the mapping contour area of ​​other transmission tasks to which the x-th overlapping area belongs, is the size of the data packet in other transmission tasks to which the x-th overlapping area belongs.

[0109] It should be noted that if a feasible path of the target transmission task does not have a road section covered by the overlapping area, the cross interference value assigned to the feasible path is 1.

[0110] S402 , according to the sizes of the data blocks allocated to the M feasible paths, split the data packet into M data blocks of corresponding sizes, and respectively allocate the data blocks to the corresponding feasible paths for transmission tasks.

[0111] The technical solutions in the above embodiments of the present application have at least the following technical effects or advantages:

[0112] By splitting and allocating data packets considering the transmission quality and cross-interference value (network interference between different transmission tasks) of feasible paths, high-quality paths in the feasible path set of the transmission task can be more effectively utilized, while reducing the network interference between different transmission tasks, thus improving the efficiency and quality of data transmission, especially in multi-task scenarios;

[0113] By intelligently splitting and distributing data packets, unnecessary data transmission on paths with poor quality or high interference can be avoided, which helps optimize the utilization of network resources and reduce resource waste and local congestion.

[0114] Embodiment 4: In a complex MESH network, due to the dynamically changing network environment, the path interference problem between different transmission tasks is particularly prominent. When the data block of the transmission task is transmitted on the corresponding feasible path, the transmission quality of the path changes in real time. Especially when encountering interference sections, the data transmission efficiency and reliability will be greatly reduced. How to adaptively and dynamically adjust the transmission strategy of the data block is extremely critical to the smooth progress of the transmission task.

[0115] Therefore, the embodiments of the present application are optimized to a certain extent based on the above embodiments.

[0116] In some embodiments, after step S204, the method further includes:

[0117] S501, based on each transmission task, monitoring in real time the transmission progress of its M data blocks on the corresponding feasible paths, including the network nodes where the data blocks are currently located on the feasible paths.

[0118] S502, when it is detected that the next network node of a data block transmission is in an interference section, the interference section is determined as a target interference section and the data block is determined as a target data block, and step S503 is executed; otherwise, the transmission continues along its feasible path.

[0119] S503, using a path quality evaluation algorithm to obtain the transmission quality of the target interference section , and compare it with the transmission quality of the feasible path to which the target interference section belongs calculated in S301 Compare and determine whether to trigger the interference adjustment mechanism.

[0120] Among them, the path quality evaluation algorithm is used to obtain the transmission quality of the target interference section The calculation principle is the same as that in step S301, except that the object is replaced with the target interference section, which includes at least one network node , i≤p, specifically:

[0121] ;

[0122] in, is the current transmission quality of the target interference section, is the length of the target interference section, p is the total number of network nodes on the target interference section, The network nodes on the target interference section and the next network node The packet loss rate of the relay link segment composed of The network nodes on the target interference section The load at the current moment.

[0123] In some embodiments, the transmission quality calculated in S301 is compared with the feasible path to which the target interference section belongs. Compare and determine whether to trigger the interference adjustment mechanism, including: if the transmission quality of the target interference section Lower than the transmission quality of the feasible path to which it belongs If the interference is greater than 80%, the interference adjustment mechanism is triggered.

[0124] Specifically, the interference adjustment mechanism includes: splitting the target data block into sub-data blocks, and relaying the sub-data blocks to preferred nodes of other feasible paths for transmission.

[0125] The preferred node is determined as a network node that is closest to the target interference section and is not located in the interference section.

[0126] It should be noted that the size of the sub-data block can be determined based on the current transmission quality of the target interference section. The transmission quality of the feasible path to which it belongs For example, the size of the target data block is set to The size of the sub-data block is obtained by multiplying, and the present invention does not impose any limitation on this.

[0127] The technical solutions in the above embodiments of the present application have at least the following technical effects or advantages:

[0128] By real-time monitoring of the transmission progress of multiple data blocks corresponding to the transmission task on the corresponding feasible path, interference problems in the transmission process can be discovered and handled in a timely manner, thereby improving the reliability and stability of the transmission; when it is monitored that the data block is about to reach the interfering section where the transmission quality is significantly reduced, by splitting the data block and relaying it to the preferred node of other feasible paths, it is possible to effectively bypass the interfering section and continue to complete the data transmission without interrupting the transmission task; by optimizing the handling method of the interfering section, the transmission delay and packet loss caused by interference can be reduced, thereby improving the overall transmission efficiency.

[0129] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A multi-device data transmission method based on MESH relay, applied to a MESH network including a number of network nodes that relay each other, characterized in that: include: S101, obtaining at least one transmission task at the current moment in the MESH network, where the transmission task includes a source node, a terminal node, and a data packet; S102, based on each transmission task, input into a preset path distributed search algorithm to obtain a feasible path set corresponding to the transmission task, the feasible path set including at least one feasible path; the path distributed search algorithm includes: S201, determine the source node as the local search point, and search all network nodes within a preset distance range with the local search point as the center as candidate relay nodes; S202, obtain the relay cost value of each candidate relay node based on the distance feature vector formed by the local search point and the candidate relay node; S203, determine the candidate relay node whose relay cost value is greater than the value threshold as the target node, and generate a local relay link segment for each target node; S204, based on each target node, use it as a new local search point, repeat steps S201 to S204, generate the target node corresponding to the local search point, and the local relay link segment corresponding to the target node, until there is an end node within the distance range of the local search point, and stop searching; S205, when all local search points have stopped searching, count all local relay link segments stored in the end node, determine each local relay link segment as a feasible path, and generate a feasible path set for the transmission task; S103, based on the feasible path set of the transmission task, according to a preset transmission branch strategy, using the feasible path set to transmit the data packet; The preset transmission branch strategy is specifically: obtaining the number M of feasible paths in the feasible path set, randomly splitting the data packet into M data blocks, and respectively allocating the data blocks to the feasible paths for transmission; After S205, the method further includes: S301, based on each transmission task, obtain a corresponding feasible path set, and perform quality evaluation on each feasible path therein according to a path quality evaluation algorithm to obtain the transmission quality of each feasible path; S302, sorting the transmission qualities of the feasible paths in descending order, removing the feasible paths corresponding to abnormal transmission qualities, and updating the feasible path set; Among them, each feasible path consists of a node sequence ( ), which consists of k relay link segments, is the source node, is the final node.

2. The multi-device data transmission method based on MESH relay according to claim 1, characterized in that: The local relay link segment of the target node is stored in the corresponding target node, and each target node stores a unique local relay link segment; The local relay link segment of the target node is generated in a specific manner as follows: a link segment formed by the target node and its corresponding local search point and a local relay link segment already stored in the local search point are spliced ​​and generated.

3. The multi-device data transmission method based on MESH relay according to claim 1, characterized in that: The step of obtaining the number M of feasible paths in the feasible path set, randomly splitting the data packet into M data blocks, and respectively allocating the data blocks to the feasible paths for transmission, specifically includes: S401, calculate the size of the data block allocated to each feasible path according to the following formula: ； in, is the size of the data block allocated to the jth feasible path in the feasible path set, is the size of the data packet, is the transmission quality of the jth feasible path, M is the total number of feasible paths in the feasible path set, is the cross interference value of the jth feasible path, is the transmission quality of the rth feasible path, is the cross interference value of the rth feasible path; S402 , according to the sizes of the data blocks allocated to the M feasible paths, split the data packet into M data blocks of corresponding sizes, and respectively allocate the data blocks to the corresponding feasible paths for transmission tasks.

4. The multi-device data transmission method based on MESH relay as claimed in claim 3, characterized in that: Based on all the transmission tasks at the current moment, take one of the transmission tasks as an example and define it as the target transmission task. The cross interference value of each feasible path in the feasible path set of the target transmission task is obtained as follows: B1. Obtain the mapping contour area of ​​the feasible path set of all transmission tasks at the current moment, and the mapping contour area is set to the maximum closed area formed by all feasible paths in the feasible path set; B2, determine whether the mapping contour area of ​​the target transmission task overlaps with the mapping contour areas of other transmission tasks. If so, obtain all overlapping areas and execute B3. Otherwise, set the cross interference value of the feasible path set of the target transmission task to 1; B3. Based on each feasible path of the target transmission task, all interference sections covered by the overlapping area are obtained, and the cross interference value of each feasible path in the feasible path set of the target transmission task is calculated according to the following formula: ; in, is the cross interference value of the jth feasible path, X is the total number of other transmission tasks that overlap with the jth feasible path, is the length of the jth feasible path, is the length of the interference section corresponding to the xth overlapping area on the jth feasible path, is the area of ​​the xth overlapping region, is the area size of the mapping contour area of ​​other transmission tasks to which the x-th overlapping area belongs, is the size of the data packet in other transmission tasks to which the x-th overlapping area belongs.

5. The multi-device data transmission method based on MESH relay as claimed in claim 4, characterized in that: After S204, the method further includes: S501, based on each transmission task, monitoring in real time the transmission progress of its M data blocks on the corresponding feasible paths, including the network nodes where the data blocks are currently located on their feasible paths; S502, when it is detected that the next network node for a data block transmission is in an interference section, the interference section is determined as a target interference section, the data block is determined as a target data block, and step S503 is executed; S503, using a path quality evaluation algorithm to obtain the transmission quality of the target interference section , and compare it with the transmission quality of the feasible path to which the target interference section belongs calculated in S301 Compare and determine whether to trigger the interference adjustment mechanism.

6. The multi-device data transmission method based on MESH relay as claimed in claim 5, characterized in that: The S503 specifically includes: If the target interferes with the transmission quality of the road section Lower than the transmission quality of the feasible path to which it belongs If the interference adjustment mechanism is triggered, 7. The multi-device data transmission method based on MESH relay as claimed in claim 5, characterized in that: The interference adjustment mechanism includes: splitting the target data block into sub-data blocks, and relaying the sub-data blocks to preferred nodes of other feasible paths for transmission; wherein the preferred node is determined to be a network node that is closest to the target interference section and is not in the interference section.

Images