Multipath routing method and system

Abstract

The invention discloses a multi-path routing method and a multi-path routing system, which are applied to the technical field of wireless routing, and the method comprises the following steps: a source node sends a path request message to all adjacent neighbor nodes; each neighbor node routes the path request message based on a probabilistic routing method; the probabilistic routing method is a method for performing routing according to a probability value determined by own connection quality when each node performs routing; the target node receives the routed path request message, and determines a service quality parameter of each path based on a set number of path quality parameters; and the source node receives a response message returned by the target node, determines an optimal path based on the service quality parameter, and performs routing based on the optimal path. According to the invention, routing is carried out based on the own connection quality, so that the path with good quality is established, the service quality parameter of each path is determined based on a plurality of path quality parameters, and the optimal path is determined based on the service quality parameters, so that the packet loss rate during data transmission is reduced, and the data routing quality is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of wireless routing, and in particular, to a multi-path routing method and system. Background Art

[0002] Edge weak network means that edge nodes use non-dedicated lines with medium and low bandwidth for access, which are characterized by high latency, low bandwidth, and high dynamics, and are prone to connection interruptions, destroying the continuity of data transmission and the stability of services. The existing wireless on-demand routing methods usually adopt the broadcast method, that is, the source node broadcasts a routing request to the entire network through a flooding mechanism, and all adjacent nodes forward the request hop by hop until the request reaches the target node. This method causes the routing request messages to spread exponentially in the network, resulting in occupying a large amount of the already limited bandwidth resources in the edge weak network environment. In addition, such methods aim to find a feasible path, that is, only consider the connectivity between nodes and do not consider the path service quality, resulting in the possibility of transmitting data according to the established route, but there is a possibility of selecting inefficient paths with high latency and less available bandwidth, and thus facing a high packet loss rate and latency.

[0003] Therefore, how to reduce the packet loss rate during data transmission is a technical problem that those skilled in the art urgently need to solve. Summary of the Invention

[0004] In view of this, the purpose of the present invention is to provide a multi-path routing method and system, which solves the technical problem of high packet loss rate in the prior art.

[0005] To solve the above technical problem, the present invention provides a multi-path routing method, including:

[0006] The source node sends a path request message to all adjacent neighbor nodes;

[0007] Each neighbor node routes the path request message based on a probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality during routing;

[0008] The target node receives the routed path request message and determines the service quality parameter of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the service quality parameter is a parameter obtained by weighted aggregation based on the path quality parameters;

[0009] The source node receives the response message returned by the target node, determines the optimal path based on the service quality parameter of each path, and routes the data based on the optimal path.

[0010] Optionally, each neighbor node routes the path request message based on a probability routing method, including:

[0011] The neighbor node uses the probability routing method to determine a probability value according to its own connection quality, and compares the generated random number with the probability value;

[0012] When the random number is not greater than the probability value, the neighbor node routes the path request message and updates its own routing table; wherein, the routing table is a table storing forward routing, reverse routing, and quality of service parameters;

[0013] When the random number is greater than the probability value, the neighbor node terminates routing.

[0014] Optionally, after the target node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters, it further includes:

[0015] The target node selects a preset number of paths with the best quality of service based on the quality of service parameters of each path, and returns a response message carrying its own path quality parameter to the source node along the path with the best quality of service;

[0016] On the way back of the response message along the path with the best quality of service, each node updates the routing information from the current node to the target node and the maintained quality of service parameters.

[0017] Optionally, when the path quality parameters are path delay, path energy consumption, and path utilization rate, the target node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters, including:

[0018] The target node determines the sum of path delays, the sum of path energy consumptions, and the average path utilization rate of all segmented paths from the source node to the target node based on the path delay, the path energy consumption, and the path utilization rate of each segmented path;

[0019] Based on the weights corresponding to the sum of path delays, the sum of path energy consumptions, and the average path utilization rate, determine the quality of service parameter of each path.

[0020] Optionally, before the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path, it further includes:

[0021] When the target node returns the response message based on each path, when routing to the current segmented path based on the probability routing method, it updates the quality of service parameter according to the set rule to obtain the latest quality of service parameter; wherein, the set rule is a parameter indicating the improvement of the quality of service.

[0022] Correspondingly, the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path, including:

[0023] The source node receives the response message returned by the target node, determines the optimal path based on the latest quality of service parameter of each path, and routes the data based on the optimal path.

[0024] Optionally, after the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path, it further includes:

[0025] When there is no data to be routed, the above steps of the source node sending the path request message to the source node to determine the optimal path are cyclically executed for routing table update, so that the information in the routing table gradually converges; the routing table is a table storing forward routing, reverse routing and quality of service parameters.

[0026] Optionally, the path request message includes the source node address, the target node address, the sequence number and the taboo table information.

[0027] Optionally, after the source node sends the path request message to all adjacent neighbor nodes, it further includes:

[0028] The intermediate node determines whether to repeatedly process the path request message and form a loop based on the sequence number and the taboo table information;

[0029] If the path request message is not repeatedly processed and no loop is formed, the above routing step is executed;

[0030] Otherwise, discard the path request message.

[0031] Optionally, it further includes that each node exchanges information with neighbor nodes regularly to maintain the quality of service parameters of itself and neighbor nodes.

[0032] The embodiment of the present invention also provides a multi-path routing system, including:

[0033] A source node, configured to send a path request message to all adjacent neighbor nodes; and receive a response message returned by a target node, determine an optimal path based on the quality of service parameter of each path, and route data based on the optimal path;

[0034] An intermediate node for routing the path request message based on a probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality.

[0035] A target node for receiving the routed path request message and determining the quality of service parameter of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameter.

[0036] It can be seen that in the present invention, the source node sends the path request message to all adjacent neighbor nodes; each neighbor node routes the path request message based on the probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality; the target node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameter; the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path.

[0037] The beneficial effects of the present invention are as follows: Compared with the current broadcast-based routing method, when establishing a routing path based on the path request message, the present invention routes based on its own connection quality, only selects paths with good connection quality to forward the request message, will not cause path request message flooding, and can reduce the occupation of network bandwidth during the routing process; determines the quality of service parameter of each path based on multiple path quality parameters, and thus determines the optimal path based on the quality of service parameter, which can effectively reduce the packet loss rate during data transmission and improve the data transmission quality.

[0038] In addition, the present invention also provides a multi-path routing system, which also has the above beneficial effects. Description of the Drawings

[0039] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only the embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on the provided drawings.

[0040] Figure 1 The flowchart obtained by a multi-path routing method provided by an embodiment of the present invention;

[0041] Figure 2A flowchart example of a routing table maintenance method provided by an embodiment of the present invention;

[0042] Figure 3 A flowchart example of a multi-path routing method provided by an embodiment of the present invention;

[0043] Figure 4 A schematic structural diagram of a multi-path routing system provided by an embodiment of the present invention. Detailed implementation manners

[0044] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Apparently, the described embodiments are only some of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0045] Please refer to Figure 1 , Figure 1 A flowchart obtained by a multi-path routing method provided by an embodiment of the present invention. The method may include:

[0046] S101, the source node sends a path request message to all adjacent neighbor nodes.

[0047] The execution subject of this embodiment is each node. The source node in this embodiment refers to the network node that initiates data transmission. The path request message in this embodiment is a control message for discovering and establishing a path. The function of the path request message is that the source node queries path information to the target node from other nodes in the network by sending the path request message. The path request message can help the source node collect path information and select the optimal path based on this information. The neighbor nodes in this embodiment are all nodes adjacent to the source node. The path request message in this embodiment may include the source node address, target node address, sequence number, and taboo list information.

[0048] It should be further noted that, based on the above embodiment, after the source node sends the path request message to all adjacent neighbor nodes, it may further include: the intermediate node determines whether to repeatedly process the path request message and form a loop based on the sequence number and taboo list information; if the path request message is not repeatedly processed and no loop is formed, the above steps for routing are executed; otherwise, the path request message is discarded. The taboo list in this embodiment is the path information from the source node to the current node, which is used to avoid the occurrence of loops during the process of finding a path. During the process of establishing a path in this embodiment, it will be determined whether to repeatedly process the path request message to prevent the formation of loops and improve the accuracy of path establishment.

[0049] It should be further noted that, in order to improve the efficiency of updating service quality parameters, the above multi-path routing method may further include: each node regularly exchanges information with its neighbor nodes to maintain the service quality parameters between itself and its neighbor nodes. Each node will maintain the service quality parameters between its own node and its neighbor nodes, so that the service quality parameters can be updated in a timely manner and the accuracy of determining the service quality parameters can be improved.

[0050] S102. Each neighbor node routes the path request message based on a probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality when performing routing.

[0051] The probability routing method in this embodiment can determine the connection quality of the path formed by the source node to this neighbor node. This embodiment does not limit that the own connection quality can be based on network bandwidth; or this embodiment can also determine the connection quality based on network latency, and the own connection quality is a value between 0 and 1. Routing according to the probability value determined based on the own connection quality in this embodiment means that a random number between 0 and 1 can be randomly generated, and if it is determined that the random number is greater than the probability value, it is determined not to forward to the neighbor node corresponding to this neighbor node. If it is determined that the random number is not greater than the probability value, it is determined to perform routing.

[0052] It should be further noted that, based on any of the above embodiments, each neighbor node routing the path request message based on a probability routing method may include:

[0053] S1021. The neighbor node uses the probability routing method to determine a probability value according to its own connection quality and compares based on the generated random number and the probability value.

[0054] The probability value is obtained through calculation, where is the segment path connection quality between the current node and the neighbor node , is the sum of the connection qualities between all neighbor nodes of the current node .

[0055]

[0056] Wherein, , , are respectively the segment path delay between the current node and the neighbor node , the path energy consumption , the path utilization rate​ The influence factor is usually set to 1. If the generated random number is greater than the probability value , it is determined not to forward to the neighbor nodes of node ; if the generated random number is not greater than the probability value, the request message is forwarded to the neighbor nodes of node and routing is determined. ; if the generated random number is not greater than the probability value, the request message is forwarded to the neighbor nodes of node , and routing is determined.

[0057] S1022. When the random number is not greater than the probability value, the neighbor node routes the path request message and updates its own routing table; wherein, the routing table is a table storing forward routing, reverse routing, and quality of service parameters.

[0058] S1023. When the random number is greater than the probability value, the neighbor node terminates routing.

[0059] This embodiment determines the probability value based on its own connection quality, and the connection quality can be measured by various metrics. For example, the connection quality uses path delay , path energy consumption , path utilization rate and other metrics to measure. Among them, the path delay refers to the time required for a message to be transmitted from the source node to the next node, the path energy consumption refers to the energy difference before and after a node transmits a message, and the path utilization rate refers to the ratio of the occupied bandwidth to the total bandwidth; the probability value is calculated through path delay , path energy consumption , path utilization rate and other metrics, and is expressed as , where , , are the influence factors for controlling path delay , path energy consumption , and path utilization rate respectively. The probability value determined based on its own connection quality can reflect the quality of the routing path. The larger the probability value, the better the path quality. The random number in this embodiment is a random number between 0 and 1. By routing based on the probability value, this embodiment has a greater probability of selecting a path with good quality, improving the reliability of routing.

[0060] S103. The target node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameters.

[0061] In this embodiment, the target node can receive a path request message forwarded by a neighbor node adjacent to the target node. The nodes in this embodiment mainly include a source node, intermediate nodes, and a target node. The intermediate nodes include neighbor nodes adjacent to the source node, neighbor nodes adjacent to the target node, and other nodes in the middle positions. The target node of this embodiment is the end node of the routing process. This embodiment does not limit the specific set number. For example, the set number in this embodiment can be two; or the set number in this embodiment can be three. This embodiment does not limit the specific method for determining the quality of service parameters. For example, this embodiment can determine the quality of service parameters based on path delay, path energy consumption, and path utilization rate.

[0062] It should be further noted that, based on any of the above embodiments, when the path quality parameters are path delay, path energy consumption, and path utilization rate, the target node receives the routed path request message and determines the quality of service parameters of each path based on the set number of path quality parameters, which may include:

[0063] S1031, the target node determines the sum of path delays and the sum of path energy consumptions of all segmented paths from the source node to the target node, as well as the path average utilization rate, based on the path delay, path energy consumption, and path utilization rate of each segmented path;

[0064] S1032, determines the quality of service parameters of each path based on the weights corresponding to the sum of path delays, the sum of path energy consumptions, and the path average utilization rate.

[0065] The path quality parameters in this embodiment are path delay, path energy consumption, and path utilization rate. Path delay refers to the time required for a message to be transmitted from the source node to the next node, usually including propagation delay, transmission delay, processing delay, and queuing delay. Path energy consumption refers to the energy difference before and after a node transmits a message, which is usually related to the power consumption of the device, transmission distance, message size, and transmission rate. Path utilization rate refers to the ratio of the occupied bandwidth to the total bandwidth. This embodiment does not limit the specific process for determining the quality of service parameters of each path. For example, it can be determined based on the formula where, , and . , , respectively represent the sum of path energy consumptions, the path average utilization rate, and the sum of path delays, and x, y, and z are the weights of the sum of path energy consumptions, the weight of the path average utilization rate, and the weight of the sum of path delays, respectively. This embodiment selects a path with a smaller quality of service parameter to achieve the selection of a path with low energy consumption, low utilization rate, and low delay, that is, preferentially sends messages through a path with low energy consumption, low utilization rate, and low delay, thereby reducing the overall network bandwidth occupancy and energy consumption.

[0066] It should be further noted that, based on any of the above embodiments, in order to improve the path quality, after the target node receives the routed path request message and determines the quality of service parameters of each path based on a set number of path quality parameters, the following may further be included:

[0067] S1: The target node selects a preset number of paths with the best quality of service based on the quality of service parameters of each path, and returns a response message carrying its own path quality parameters to the source node along the paths with the best quality of service.

[0068] S2: During the return journey of the response message along the paths with the best quality of service, each node updates the routing information from the current node to the target node and the maintained quality of service parameters.

[0069] This embodiment does not limit the specific preset number. For example, the preset number in this embodiment can be 3; or the preset number in this embodiment can be 2, and the preset number in this embodiment is lower than the actual number of arrived paths. In the process of establishing the forward path in this embodiment, the routing paths with good quality will be retained, so as to return the response message to the source node along the forward routing path (which refers to the path between the source node and the target node). In the process of the return of the response message in this application, the routing information from each node to the target node and the maintained quality of service parameters will be updated. Among them, the routing information can be returned by using the probabilistic routing method. At this time, the routing information (the routing information can include the forward routing path information and the reverse routing path information (which refers to the path between the target node and the source node)) and the quality of service parameters can be updated.

[0070] S104: The source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path.

[0071] The response message in this embodiment refers to the feedback information returned by the target node to the source node after receiving the request sent by the source node. The purpose of the response message is to inform the source node of the processing result of the request by the target node or to provide the information required by the source node. The process for the source node in this embodiment to receive the response message returned by the target node can be that the target node routes along the reverse path. Determining the optimal path based on the quality of service parameters of each path in this embodiment can be based on the quality of service parameters of each path, and the path with the largest quality of service parameter is determined as the optimal path.

[0072] It should be further noted that, based on any of the above embodiments, before the source node receives the response message returned by the target node and determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path, it may further include: when the target node returns the response message based on each path, when routing to the current segmented path based on the probabilistic routing method, updating the quality of service parameters based on the set rules to obtain the latest quality of service parameters; wherein, the set rules are parameters indicating an improvement in the quality of service; correspondingly, the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path, which may include:

[0073] The source node receives the response message returned by the target node, determines the optimal path based on the latest quality of service parameters of each path, and routes the data based on the optimal path. This embodiment does not limit the specific set rules. For example, the set rules in this embodiment may be 0.1 multiplied by the quality of service parameter at the previous moment of the previous time, so as to reflect the optimality of the path quality (the smaller the quality parameter, the better, so the quality of service parameter can be reduced to indicate the optimality of the link quality). This embodiment also performs routing based on the probabilistic routing method during the return process, which is equivalent to further screening the quality of the returned path and further improving the quality of the path.

[0074] It should be further noted that, based on any of the above embodiments, after the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path, it may further include: when there is no data to be routed, repeatedly execute the above steps of the source node sending a path request message to determine the optimal path to update the routing table, so that the information in the routing table gradually converges; the routing table is a table storing forward routing, reverse routing, and quality of service parameters. This embodiment continuously executes the process of sending a routing request message to determine the optimal path, thereby updating the routing table and improving the accuracy of the path quality in the routing table. For ease of understanding, please refer to Figure 2 , Figure 2 which is a flowchart example of a routing table maintenance method provided by an embodiment of the present invention, and may include: the source node determines whether there is data to be sent. If so, it sends the data along the optimal path in the established routing. Otherwise, it repeats the above process of establishing the optimal path to update the routing table. After updating the routing table, if there is no data to be sent, it determines whether the maximum iteration number has been reached or whether it has converged. If not, it continues to update the routing table. If so, the routing table is no longer updated and the routing table maintenance process ends.

[0075] A multi-path routing method provided by an embodiment of the present invention may include: S101, a source node sends a path request message to all adjacent neighbor nodes; S102, each neighbor node routes the path request message based on a probabilistic routing method; wherein, the probabilistic routing method is a method in which each node routes according to a probability value determined based on its own connection quality; S103, a destination node receives the routed path request message and determines a quality of service parameter for each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameters; S104, the source node receives a response message returned by the destination node, determines an optimal path based on the quality of service parameter of each path, and routes data based on the optimal path. Compared with the current routing based on all paths, when establishing a routing path based on the path request message, this embodiment routes based on its own connection quality, so that paths with better quality are established as much as possible, and determines the quality of service parameter of each path based on multiple path quality parameters, thereby determining the optimal path based on the quality of service parameter, so as to reduce the packet loss rate during data transmission and improve the data routing quality.

[0076] Edge weak networks mean that edge nodes use non-special line access with medium and low bandwidth, and have the characteristics of high latency, low bandwidth, and high dynamics, which easily lead to connection interruptions and damage the continuity of data transmission and the stability of services. Therefore, in order to ensure stable and reliable communication and provide services with guaranteed quality, edge weak networks urgently need a quality-of-service-priority on-demand routing method. However, existing wireless on-demand routing methods usually only consider the connectivity between nodes and ignore the quality-of-service problem, resulting in the ability to transmit data according to the established routing, but facing a high packet loss rate and latency. Therefore, the present invention proposes a quality-of-service-priority routing method, aiming to improve the established routing information by maintaining the path quality of service, establish multiple paths with higher quality of service to connect the source node and the destination node, and improve the reliability and robustness of the network.

[0077] The present invention is directed to edge weak networks and provides a quality-of-service-priority multi-path routing method, which breaks through the limitations of existing wireless routing methods that are difficult to cope with connection interruptions and instability. By maintaining the path quality of service, continuously iterating and optimizing the established routing information, and finally forming multiple paths with higher quality of service to connect the source node and the destination node, a balance between the real-time performance and robustness of network connections is achieved.

[0078] For a better understanding of the present invention, please specifically refer to Figure 3 , Figure 3 which is a flow example diagram of a multi-path routing method provided by an embodiment of the present invention, and may specifically include:

[0079] Step 1: When the path information from the source node to the target node needs to be initialized or updated, the source node initializes a path request message carrying quality of service parameters.

[0080] In this embodiment, each node can exchange information with neighbor nodes by sending Hello request messages and Hello response messages, and control the message sending frequency through the HELLO_INTERVAL timer to maintain the path quality information (quality of service parameters) of neighbor nodes. Hello request messages (Hello Request) and Hello response messages (HelloResponse) are used to exchange node information and confirm the existence and reachability of neighbor nodes. HELLO_INTERVAL is a configuration parameter indicating the frequency of sending Hello messages, usually in seconds. The path request message has a unique source node IP address (Internet Protocol address) and sequence number, and carries the path delay sum, path energy consumption sum, path average utilization rate, and taboo list information from the source node to the current node. Among them, the taboo list is the path information from the source node to the current node, which is used to avoid the occurrence of loops in the process of finding paths.

[0081] Step 2: The source node sends the path request message to its adjacent neighbor nodes, and the neighbor nodes determine whether they have processed the request message.

[0082] In this embodiment, the source node broadcasts the request message, and all neighbor nodes adjacent to the source node receive the request message. Each neighbor node (all nodes between the source node and the target node need to make a judgment).

[0083] Step 3: If it has been processed, the forwarding of the path request message ends; otherwise, the neighbor node determines a probability value according to its own connection quality.

[0084] Step 4: The neighbor node makes a comparison based on the generated random number and the probability value to determine whether to forward.

[0085] The path quality parameters maintained in this embodiment may include path delay, path energy consumption, path utilization rate, and calculate the current quality of service parameter according to the above path quality parameters. The processing performed by the intermediate node (the node between the source node and the destination node) upon receiving the path request message in this embodiment may include: (1) Determine whether to process the message repeatedly or form a loop according to the source node address, sequence number, and taboo table in the path request message. If it has not been processed and no loop is formed, proceed to step 2; otherwise, directly discard the packet. (2) Obtain the path quality between the previous hop node of the path request message and the current node from the locally maintained quality of service parameter, select to terminate or continue forwarding the request to the adjacent node with a probability value of corresponding size, and allow the quality of service parameter of the selected path to be increased according to the set rules. (3) Obtain the path delay sum, path energy consumption sum, and path average utilization rate information from the source node to the previous hop node from the local node table, calculate the path delay sum, path energy consumption sum, and path average utilization rate from the source node to the current node, and update them into the request message. (4) Determine whether it is the destination node d. If it is not the destination node d, proceed to (5); otherwise, end the process. (5) Add the current node IP to the taboo table of the request message. (6) Forward the request message to all neighbor nodes of the current node. (7) Forward the path request message when the random number is not greater than the probability value, and terminate the routing when the random number is greater than the probability value. (8) When the neighbor node forwards the path request message, update its own routing table; the routing table includes forward routing information, reverse routing information, and quality of service parameter; among them, the forward routing information is the information from the current node to the destination node, and the reverse routing information is the information from the current node to the source node. The forward routing is used to check whether the same message is repeatedly sent subsequently.

[0086] When the above multi-path routing method is combined with the improved ant colony method: A: Destination IP address: Add the source IP address in the forward ant to the routing table. B: Destination sequence number: Write the source node sequence number in the forward ant into the routing table to judge the validity and freshness of the route. C: Hop count: Increment the hop count in the forward ant by 1 and record it in the routing table. The hop count represents the number of hops from the current node to the source node and is used for subsequent route selection. D: Next hop: Record the sending node (i.e., the previous hop node) of this forward ant as the next hop node to the destination node. E: Upstream node list: Record the information of the previous hop node in the upstream node list. The upstream node list is used to notify these nodes to perform route repair when the link breaks. F: Time to live: Set a time to live (node system time + ACTIVE_ROUTE_TIMEOUT) for this route entry, indicating the validity period of this route. When the time to live expires, if there is no new update, the route will be removed. At the same time, record the route information requested by the forward ant. Specifically, the following entries need to be updated: A: Destination IP address: Add the destination IP address in the forward ant to the routing table to record the route entry for this destination node. B: Destination node sequence number: Update the destination node sequence number in the forward ant to the routing table. This sequence number is used to judge the "freshness" of the route, and the higher the sequence number, the newer the route information.

[0087] Step 5: Forward the path request message when the random number is not greater than the probability value, and terminate the routing when the random number is greater than the probability value.

[0088] Step 6: Update its own routing table when the neighbor node forwards the path request message; the routing table includes forward routing information, reverse routing information, and quality of service parameters; among them, the forward routing information is the information from the current node to the target node, and the reverse routing information is the information from the current node to the source node.

[0089] Step 7: When a preset number of request messages reach the target node, the target node determines the quality of service parameters of all the routing paths passed by the request message and constructs a corresponding response message; among them, the quality of service parameter of each path in the path is determined by the path delay, path energy consumption, and path utilization rate.

[0090] This embodiment can update the path quality parameter based on the pheromone local update rule of the improved ant colony algorithm. The neighbor node (intermediate node) adds the value of the current path quality parameter to the value of the path quality parameter recorded in the forward ant and stores it in the corresponding field of the forward ant. The corresponding field has a limited length. For example, the cumulative level field is stored in 4 bits, and correspondingly, the threshold of this field is 15. Once the cumulative level reaches the set threshold, the forward ant packet is directly discarded, that is, when the total of path delay, path energy consumption, and path average utilization reaches the maximum tolerance value, this path does not meet the service requirements and will be abandoned. If it is the destination node, calculate the path quality parameter of this forward ant, count the path quality parameters of multiple ants arriving within a period of time, select the forward ants with smaller values, extract information from them, construct the corresponding backward ant (i.e., response message), carry the path quality parameter, and return along the corresponding path; the path quality parameter can be updated according to the pheromone global update rule of the improved ant colony algorithm.

[0091] Step 8: The target node selects a set number of optimal paths from all routing paths based on each quality of service parameter.

[0092] Step 9: The target node returns a response message carrying the quality of service parameter along each optimal path until the source node. During the return of the response message along the path, update the routing table of the nodes passed by the response message.

[0093] When this embodiment is combined with the improved ant colony method, during the return of the backward ant, the quality of service parameter of the selected path can be increased according to the set rule, and at the same time, the routing information is updated. To update the routing information, first, index to the entry corresponding to the destination address and destination node serial number, and then update the information such as the hop count, next hop, and path quality parameter. When the backward ant returns, find the entry corresponding to the destination IP address and destination node serial number in the local routing table and update it as follows: A: Hop count: Add 1 to the hop count value in the backward ant and update it to the routing table. This represents the hop count from the current node to the destination node. The hop count will be incremented by 1 every time the backward ant passes through a node and is initially 0. B: Next hop: Record the address of the previous hop node of the backward ant (i.e., the node that sent the backward ant) as the next hop to reach the destination node. C: Time to live: Write the time to live in the backward ant into the routing table. The time to live represents the validity period of the route, ensuring that the route is considered valid within this time period. The time to live will be stored in the routing entry and periodically checked for expiration, and expired routes will be deleted. D: Path quality parameter: Put the path quality parameter in the backward ant into the quality of service parameter field in the routing table.

[0094] Step 10: After the response messages corresponding to each optimal path reach the source node, multiple target routing paths are obtained.

[0095] Step 11: If there is data to be sent, the source node determines the target optimal routing path from multiple target routing paths based on the latest quality of service parameters.

[0096] In this embodiment, the response messages in multiple different paths have different sequence numbers, different path quality parameters, and the next-hop nodes may also be different, which are maintained by different entries in the routing table, that is, there may be routing information of multiple paths to the destination node in the routing table. When there is data to be sent, select the path with the minimum quality of service parameter to the same destination node.

[0097] Step 12: The source node sends the data to the target node based on the target optimal routing path.

[0098] Step 13: When there is no data to be sent, continue to send request messages and response messages to update the routing table, so that the routing information gradually converges.

[0099] The process of optimizing the routing path in this embodiment may include: (1) If there is data to be sent, send the data from the source node to the destination node according to the routing generated by the above routing establishment process. (2) Repeat the above routing establishment process to update the routing table in the relevant nodes. (3) If there is new data to be sent, go back to step 1; if there is no new data to be sent, and the maximum iteration number has not been reached and the routing is unstable, repeat step 2. Otherwise, end this process.

[0100] In a multi-path routing method provided by an embodiment of the present invention, each node maintains the path quality of the link with the neighbor node, selects a path according to the final path quality parameter determined by the path quality, realizes screening of paths with better quality of service in the routing establishment process, maintains multiple paths with better quality of service, continuously iterates and optimizes, realizes forwarding according to the path with the best quality of service, and can cope with abnormal situations such as link interruption at the same time. The present invention can effectively improve the reliability and robustness of network connection and is applicable to edge weak network scenarios.

[0101] Next, a multi-path routing system provided by an embodiment of the present invention will be introduced. The multi-path routing system described below can be mutually corresponded and referred to with the multi-path routing method described above.

[0102] Specifically, please refer to Figure 4 , Figure 4 which is a schematic structural diagram of a multi-path routing system provided by an embodiment of the present invention and may include:

[0103] A source node 100, configured to send a path request message to all adjacent neighbor nodes; and receive a response message returned by the target node, determine an optimal path based on the quality of service parameter of each path, and route the data based on the optimal path.

[0104] An intermediate node 200, configured to route the path request message based on a probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality.

[0105] A target node 300, configured to receive the routed path request message and determine a quality of service parameter for each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameters.

[0106] The multi-path routing system provided by an embodiment of the present invention may include: a source node 100, configured to send a path request message to all adjacent neighbor nodes; and receive a response message returned by the target node, and determine an optimal path based on the quality of service parameter of each path, and route data based on the optimal path; an intermediate node 200, configured to route the path request message based on a probability routing method; wherein, the probability routing method is a method in which each node routes according to a probability value determined based on its own connection quality; a target node 300, configured to receive the routed path request message and determine a quality of service parameter for each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameters. Compared with the current situation where routing is performed based on all paths, when establishing a routing path based on the path request message, this embodiment routes based on its own connection quality, so as to try to establish only paths with good quality, and determines the quality of service parameter of each path based on multiple path quality parameters, thereby determining the optimal path based on the quality of service parameter, so as to reduce the packet loss rate when transmitting data and improve the data routing quality.

[0107] The various embodiments in this specification are described in a progressive manner. Each embodiment focuses on the differences from other embodiments. The same or similar parts among the various embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method part.

[0108] Those skilled in the art may further realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of each example have been generally described according to functions in the above description. Whether these functions are executed in the form of hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0109] Finally, it should also be noted that in this document, relational terms such as "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the term "comprising", "including" or any other variation is intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device.

[0110] The above has introduced in detail a multi-path routing method and system provided by the present invention. Specific examples are used herein to elaborate on the principles and implementation manners of the present invention. The description of the above embodiments is only used to help understand the method and its core idea of the present invention; at the same time, for those of ordinary skill in the art, according to the idea of the present invention, there will be changes in the specific implementation manners and application scopes. In summary, the content of this specification should not be construed as a limitation to the present invention.

Claims

1. A multi-path routing method, characterized in that, Including: The source node sends a path request message to all adjacent neighbor nodes; Each neighbor node routes the path request message based on a probabilistic routing method; wherein, the probabilistic routing method is a method in which each node routes according to a probability value determined based on its own connection quality when routing; The destination node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameter; The source node receives the response message returned by the destination node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path.

2. The multi-path routing method according to claim 1, wherein Each neighbor node routes the path request message based on a probabilistic routing method, including: The neighbor node uses the probabilistic routing method to determine a probability value according to its own connection quality, and compares the generated random number with the probability value; When the random number is not greater than the probability value, the neighbor node routes the path request message and updates its own routing table; wherein, the routing table is a table storing forward routing, reverse routing, and path quality; When the random number is greater than the probability value, the neighbor node terminates routing.

3. The multi-path routing method according to claim 1, characterized in that After the destination node receives the routed path request message and determines the quality of service parameter of each path based on a set number of path quality parameters, it further includes: The destination node selects a preset number of paths with the best quality of service based on the quality of service parameter of each path, and returns a response message carrying its own path quality parameter to the source node along the paths with the best quality of service; During the return journey of the response message along the paths with the best quality of service, each node updates the routing information from the current node to the destination node and the maintained quality of service parameter.

4. The multi-path routing method according to any one of claims 1 to 3, characterized in that, When the path quality parameter is path delay, path energy consumption, and path utilization rate, the destination node receives the routed path request message and determines the quality of service parameter of each path, including: The destination node determines the sum of path delays, the sum of path energy consumptions, and the average path utilization rate of all segmented paths from the source node to the destination node based on the path delay, the path energy consumption, and the path utilization rate of each segmented path; Based on the weights corresponding to the sum of path delays, the sum of path energy consumptions, and the average path utilization rate, the quality of service parameter of each path is determined.

5. The multi-path routing method according to claim 1, wherein Before the source node receives the response message returned by the destination node, determines the optimal path based on the quality of service parameter of each path, and routes the data based on the optimal path, it further includes: During the process of the destination node returning the response message based on each path, when routing to the current segmented path based on the probabilistic routing method, the quality of service parameter is updated based on a set rule to obtain the latest quality of service parameter; wherein, the set rule is a parameter indicating an improvement in the quality of service. Correspondingly, the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path, including: The source node receives the response message returned by the target node, determines the optimal path based on the latest quality of service parameters of each path, and routes the data based on the optimal path.

6. The multi-path routing method according to claim 1, wherein After the source node receives the response message returned by the target node, determines the optimal path based on the quality of service parameters of each path, and routes the data based on the optimal path, it further includes: When there is no data to be routed, the above steps of the source node sending a path request message to the source node to determine the optimal path are cyclically executed to update the routing table, so that the information in the routing table gradually converges; the routing table is a table storing forward routing, reverse routing, and quality of service parameters.

7. The multi-path routing method according to claim 1, wherein The path request message includes the source node address, the target node address, the sequence number, and the taboo list information.

8. The multi-path routing method according to claim 7, characterized in that, After the source node sends the path request message to all adjacent neighbor nodes, it further includes: The intermediate node determines whether to repeatedly process the path request message and form a loop based on the sequence number and the taboo list information; If the path request message is not repeatedly processed and no loop is formed, the above routing steps are executed; Otherwise, the path request message is discarded.

9. The multi-path routing method according to claim 1, wherein, It further includes that each node periodically exchanges information with neighbor nodes to maintain the quality of service parameters of itself and neighbor nodes.

10. A multi-channel routing system, characterized in that, It includes: The source node is used to send the path request message to all adjacent neighbor nodes; And receive the response message returned by the target node, determine the optimal path based on the quality of service parameters of each path, and route the data based on the optimal path; The intermediate node is used to route the path request message based on the probabilistic routing method; wherein, the probabilistic routing method is a method in which each node routes according to the probability value determined based on its own connection quality when routing; The target node is used to receive the routed path request message and determine the quality of service parameters of each path based on a set number of path quality parameters; wherein, the set number is greater than 1, and the quality of service parameter is a parameter obtained by weighted aggregation based on the path quality parameter.

Images