Multi-path routing transmission method, system and equipment for reliable data communication of multi-hop wireless network and medium

Abstract

The invention provides a multipath routing transmission method, system and device for reliable data communication of a multi-hop wireless network, and a medium. The method comprises the following steps: selecting an optimal reliable transmission path as a main path for routing transmission by using a Dijkstra algorithm; selecting an auxiliary path with better reliable transmission from neighbor nodes of the main path; and the main path and the auxiliary path are combined to carry out multipath routing transmission. On one hand, on the basis of a network topology structure and link quality related information, efficient selection of an optimal reliable transmission main path is realized, and multipath routing transmission between source / destination nodes is realized by constructing an auxiliary path participated by neighbor nodes on the main path, so that the reliability of data transmission is improved. And on the other hand, a Dijkstra algorithm is adopted as a basis to carry out enhanced routing design, so that the problem of serious loss of end-to-end data transmission caused by unreliable link transmission of the network can be effectively improved, and the success rate of one-time delivery of message transmission is improved.

Description

Technical Field

[0001] The present invention relates to the field of wireless network communication technology, and in particular to a multipath routing transmission method, system, equipment and medium for reliable communication of multi-hop wireless network data. Background Art

[0002] Wireless networks use electromagnetic wave signals for communication, which are inevitably affected by changes in the channel environment and interference from various electromagnetic spectrum signals, resulting in greater instability in wireless communications and a higher message data loss rate in the communication links between nodes. In multi-hop wireless networks, end-to-end node communication often requires multi-hop link relay forwarding to be achieved. Each hop relay forwarding selects an unstable and unreliable link, which will further reduce the success rate of end-to-end communication data transmission and make it difficult to ensure communication reliability. Severe data loss during the communication process will make it impossible for applications that can run normally on traditional wired networks to work normally in a wireless network environment, which greatly limits the application of wireless networks.

[0003] In order to achieve highly reliable end-to-end service communication in multi-hop wireless networks under the above application conditions, the network needs to have the ability to respond to rapid topology changes and overcome the impact of unstable links. Although retransmission measures can solve the problem of transmission loss on the path to a certain extent, retransmission cannot guarantee the real-time communication. Therefore, choosing to optimize the transmission path of multi-hop relay is a better solution. Traditional network routing design uses the shortest hop strategy for route selection, and selects a path with the smallest hop count between the source node and the destination node for service transmission, which cannot achieve highly reliable service communication. When the single-path routing communication encounters poor quality of the relay link on the path or a link interruption, the end-to-end service communication will be interrupted, which will have a bad impact on those real-time control or emergency alarm data communications that are sensitive to packet loss or interruption.

[0004] Some existing methods implement multi-path routing based on the AODV on-demand routing mechanism. The source node broadcasts a routing request message RREQ to detect multiple paths that may exist in the network. After receiving the RREQ detection, the destination node selects from the multiple paths found and notifies the source node of the feedback. On-demand routing has the disadvantages of long routing discovery time and insufficient response to network topology changes. In addition, in order to achieve multi-path routing discovery, the data transmission volume of routing broadcast messages will be greatly increased, increasing network overhead. Compared with on-demand routing design, the active routing mechanism can grasp the link status information between nodes in the network through topology learning, and use the network topology to quickly calculate multiple paths, and efficiently select the optimal multi-path for transmission. Existing multi-path transmission methods are mainly proposed to address problems such as path failure, load balancing, and QoS guarantee. In terms of reliable transmission support, the instability of relay links and the broadcast characteristics of wireless communication links are not fully considered. Summary of the invention

[0005] The present invention aims to provide a multipath routing transmission method, system, device and medium for reliable communication of data in a multi-hop wireless network, so as to solve the problems of poor link transmission reliability in wireless networks and serious data message loss during multi-hop relay communication.

[0006] The present invention provides a multi-path routing transmission method for reliable communication of multi-hop wireless network data, comprising the following steps:

[0007] Link quality-based routing: Use the Dijkstra algorithm to select the optimal reliable transmission path as the main path for routing transmission;

[0008] Multipath routing selection: Select an auxiliary path with better and more reliable transmission from the neighboring nodes of the main path;

[0009] Data routing transmission: Multipath routing transmission is performed by combining the main path and the auxiliary path.

[0010] In one embodiment, the method of selecting the optimal reliable transmission path as the main path for routing transmission by using the Dijkstra algorithm includes the following sub-steps:

[0011] Calculate the weight of the link in the network topology diagram based on the data transmission loss rate;

[0012] A network topology weighted graph of the network topology graph is constructed, and the Dijkstra algorithm is used to find the optimal reliable transmission path from the source node to the destination node in the network as the main path, that is, the path with the minimum sum of weights among all feasible paths.

[0013] In one embodiment, the weight of the link in the network topology diagram is calculated based on the data transmission loss rate:

[0014]

[0015] Among them, W(e i ) represents the i-th link e in the network topology graph i The weight of L(e i ) represents the i-th link e in the network topology graph i Indicates the loss rate of message data transmission.

[0016] In one embodiment, selecting an auxiliary path with better reliable transmission from neighboring nodes of the primary path includes the following sub-steps:

[0017] Step S101: Set set N to be empty;

[0018] Step S102: traverse each node v in the network topology weighted graph G′ i , determine node v i and the node set V(Path op Whether any node in (s,d)) is a neighbor node, Path op (s,d) indicates the main path; if so, and the node Then the node v i Add to set N;

[0019] Step S103: Add the source node s and the destination node d to the set N;

[0020] Step S104: Prune the original network topology weighted graph G′, delete the nodes that do not belong to the set N and the links related to the deleted nodes; at the same time, further delete the nodes that belong to the link set E (Path op (s,d)) links; the pruned topology is denoted as G′1;

[0021] Step S105: Based on the topology graph G′1, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s, d); if a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the nodes are not independent, and the next step is executed;

[0022] Step S106: Set V(Path op The nodes in (s, d)) are added to the set N, and the pruning operation similar to step S104 is performed to obtain a pruned topology graph denoted as G′2;

[0023] Step S107: Based on the topology graph G′2, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su(s, d); if a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the links are not independent, and the next step is executed;

[0024] Step S108: For the topology graph G′2, starting from the source node s, perform a breadth-first search to find the node m that is farthest from the source node s in hops, and m∈V(Path op (s,d)); Path op The next hop node of m on (s, d) is represented as w;

[0025] Step S109: adding a link e(m,w) to the topology graph G′2, and repeating step S108 until there is a node m=d, and defining the topology graph G′2 at this time as the final topology graph G′3;

[0026] Step S110: Based on the final topology graph G′3, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s,d), the optimal reliable transmission path Path su (s,d) is the auxiliary path.

[0027] In one embodiment, if there is a Path su (s,d)=Path op (s,d), it means that there is no suitable optional multi-path in the network.

[0028] In one embodiment, the multipath routing transmission using the main path and the auxiliary path jointly includes the following sub-steps:

[0029] Step S201: The source node s sends the main path Path op (s,d) and auxiliary path Path su The routing forwarding node ID on (s, d) is carried in the header of the message data, and the message sequence number is added, and then the message data is sent; the message sequence number is used to uniquely identify a message data transmitted from the source node to the destination node, and the source node increases its message sequence number by 1 every time it sends a new message data;

[0030] Step S202: The node receiving the message data in the network checks the information in the message data header and determines whether the message is received for the first time based on the message sequence number; if yes, further processing is performed; otherwise, the duplicate message is discarded; for the message received for the first time, according to the node ID on the path indicated in the message header, it is determined whether it is a relay forwarding node on the transmission path from the source node s to the destination node d; if yes, the node forwards the data; otherwise, no forwarding is required and the message is discarded;

[0031] Step S203: After receiving the message data, the destination node d performs a duplication check on the received message data based on the message sequence number; for the data message received for the first time, it is delivered to the upper layer application; otherwise, it is discarded.

[0032] In one embodiment, in step S202, for a link shared by multiple paths, the node needs to perform multiple forwardings.

[0033] The present invention also provides a multipath routing transmission system for reliable communication of multi-hop wireless network data, comprising:

[0034] A main path selection unit, used to select an optimal reliable transmission path as a main path for routing transmission using a Dijkstra algorithm;

[0035] An auxiliary path selection unit, used to select an auxiliary path with better reliable transmission from neighboring nodes of the main path;

[0036] The transmission unit is used to perform multipath routing transmission by utilizing a main path and an auxiliary path in combination.

[0037] The present invention also provides an electronic device, comprising:

[0038] at least one processor; and a memory communicatively coupled to the at least one processor;

[0039] The memory stores instructions that can be executed by the at least one processor, and the at least one processor executes the above method by executing the instructions stored in the memory.

[0040] The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium is used to store instructions, and when the instructions are executed, the above method is implemented.

[0041] In summary, due to the adoption of the above technical solution, the beneficial effects of the present invention are:

[0042] 1. Based on the network topology and link quality related information, the present invention realizes the efficient selection of the optimal reliable transmission main path, and realizes multipath routing transmission between source / destination nodes by constructing auxiliary paths involving neighbor nodes on the main path, thereby improving the reliability of data transmission.

[0043] 2. The present invention is applicable to wireless networks with multi-hop relay transmission. It adopts the classic Dijkstra algorithm as the basis for enhanced routing design. It is easy to quickly and efficiently implement multipath transmission support expansion on the existing routing protocol. It can effectively improve the serious problem of end-to-end data transmission loss caused by unreliable link transmission in the network, and improve the success rate of one-time delivery of message transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 The present invention provides a flowchart of a multi-path routing transmission method for reliable communication of multi-hop wireless network data.

[0045] Figure 2 A schematic diagram of a multi-hop wireless network path configuration provided by an embodiment of the present invention.

[0046] Figure 3 An example multi-hop wireless network topology connection diagram provided for an embodiment of the present invention.

[0047] Figure 4 An example of a path selection diagram for multi-path routing transmission in a multi-hop wireless network provided in an embodiment of the present invention.

[0048] Figure 5 An example of a multi-hop wireless network topology connection diagram provided in an embodiment of the present invention.

[0049] Figure 6 A schematic diagram of path selection for multi-path routing transmission in a multi-hop wireless network is provided as an example of an embodiment of the present invention.

[0050] Figure 7 A schematic structural diagram of a multipath routing transmission system for reliable communication of data in a multi-hop wireless network provided by an embodiment of the present invention.

[0051] Figure 8 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0052] In order to make the purpose, 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 in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0053] Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the invention claimed for protection, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0054] Example

[0055] In order to solve the problem of poor link transmission reliability in wireless networks and serious data packet loss during multi-hop relay communication, such as Figure 1As shown, this embodiment proposes a multipath routing transmission method for reliable communication of multi-hop wireless network data, which is divided into three operation stages:

[0056] Link quality-based routing: Use the Dijkstra algorithm to select the optimal reliable transmission path as the main path for routing transmission;

[0057] Multipath routing selection: Select an auxiliary path with better and more reliable transmission from the neighboring nodes of the main path;

[0058] Data routing transmission: Multipath routing transmission is performed by combining the main path and the auxiliary path.

[0059] Consider a multi-hop wireless network consisting of N nodes. Assume that the nodes in the network have obtained the complete topological connection information between each node in the network through topological learning. For the convenience of the following description, the topological connection relationship of the network is represented by a directed graph G = (V, E), where V is the set of nodes in the network and E is the set of links between nodes in the network. |A| represents the number of elements in set A, and |V| = N. For two nodes u and v with a one-hop communication link in the network, e(u, v) represents the transmission link from node u to node v, and e(u, v)∈E. Two nodes with a one-hop communication link e(u, v) are called neighbor nodes, where node u is called the inner neighbor of node v, and node v is called the outer neighbor of node u.

[0060] (1) Routing based on link quality

[0061] Affected by the wireless environment and interference, the transmission quality of different links in the network varies. In order to achieve reliable transmission of messages, it is necessary to select links with low packet loss rates in the network to form multi-hop relay paths for end-to-end communication. Based on link quality, the extended Dijkstra algorithm is used to select the optimal route. L(e) represents the loss rate of message data transmission on link e. Figure 2 As shown in the figure, the path Path(s,d) from the source node s to the destination node d in the network is composed of k links connected in series, which are represented as e1, e2, ..., e k .

[0062] For data transmission through the path Path(s,d), the transmission success rate S can be calculated as:

[0063]

[0064] Taking the natural logarithm of both sides, we get:

[0065]

[0066] Through the above transformation, the evaluation of the reliability of an end-to-end path transmission only needs to accumulate the relevant calculation results of the transmission success rate of each link on the path, which improves the path-finding efficiency of the algorithm design. Finding the path with the highest transmission success rate S in the network is equivalent to finding the calculation results of each link on the path ln(1-L(e i )) are accumulated to have the maximum value. The typical value range of the transmission success rate S is (0,1], and the corresponding operator ln(·) is a non-positive value. The Dijkstra algorithm based on graph theory can be used to solve the shortest path problem of weighted graphs, and is applicable to directed graphs in which the weights of all edges in the graph are non-negative. In order to use the Dijkstra algorithm to achieve efficient routing of the optimal reliable transmission path, the following calculation transformation is further performed:

[0067]

[0068] The data transmission loss rate L(e) of a link has a typical value range of [0,1). The result of the calculation is a non-negative value. In this way, the weight W(e) of link e in the topology graph G is defined as follows:

[0069]

[0070] Through the above weight calculation, the network topology weighted graph G′ of the network topology graph is constructed. Using the Dijkstra algorithm, the optimal reliable transmission path Path from the source node s to the destination node d in the network can be quickly searched and found. op (s,d), that is, the path with the minimum sum of weights among all feasible paths op (s,d):

[0071]

[0072] According to the characteristics of the Dijkstra algorithm, as long as there is a reachable path in the topological graph G, a path with the smallest sum of weights from the source node to the destination node can be found.

[0073] (2) Multipath routing selection

[0074] In the previous operation, we found an optimal reliable transmission path from the source node s to the destination node d, which we call the main path of the route. Furthermore, the present invention will select auxiliary paths for data transmission through multipath routing selection operations to achieve multipath parallel transmission support from the source node to the destination node, further improving the reliability of data transmission. The selection of auxiliary paths will be generated from the neighbor node set of the node on the main path. Through these neighbor nodes, the broadcast characteristics of wireless communication can be used to achieve redundant reception of message transmission on the main path. At the same time, the redundant receiving nodes on the auxiliary path relay and forward message data to enhance the reliable reception and forwarding capabilities of message transmission on the main path. Through multipath joint routing transmission, nodes on different paths form redundant reception and transmission with each other, thereby improving the reliability of message transmission from the source node s to the destination node d and reducing transmission delay.

[0075] Let the node set on the main path be V(Path op (s,d)), the link set is E(Path op (s,d)), the algorithm steps of auxiliary multi-path selection are as follows:

[0076] Step S101: Set the set N to be empty, that is,

[0077] Step S102: traverse each node v in the network topology weighted graph G′ i , determine node v i With the set V(Path op Is any node in (s,d) a neighbor node? If yes, and node Then the node v i Add to set N.

[0078] Step S103: Add the source node s and the destination node d to the set N.

[0079] Step S104: Prune the original network topology weighted graph G′, and delete the nodes that do not belong to the set N and the links related to the deleted nodes. At the same time, further delete the nodes that belong to the set E (Path op The pruned topology is denoted as G′1.

[0080] Step S105: Based on the topology graph G′1, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s, d). If a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the nodes are not independent, and the next step is executed.

[0081] Step S106: Set V(Path op The nodes in (s, d)) are added to the set N, and the pruning operation similar to step S104 is performed to obtain a pruned topology graph denoted as G′2.

[0082] Step S107: Based on the topology graph G′2, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s, d). If a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the links are not independent, and the next step is executed.

[0083] Step S108: For the topology graph G′2, starting from the source node s, perform a breadth-first search (BFS) to find the node m that is farthest from the source node s in hops, and m∈V (Path op (s,d)). Path op The next hop node of m on (s,d) is denoted as w.

[0084] Step S109: Add a link e(m,w) to the topology graph G′2, and repeat step S108 until there is a node m=d, and define the topology graph G′2 at this time as the final topology graph G′3.

[0085] Step S110: Based on the final topology graph G′3, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s,d).

[0086] Through the above algorithm steps, a better new path Path is found that is relayed by the neighbor nodes of the nodes on the main path and can reach the destination node d. su (s,d), as the main path Path op (s,d) auxiliary path. In particular, if there is a Path su (s,d)=Path op (s,d), it means that there is no suitable optional multi-path in the network.

[0087] (3) Data routing transmission

[0088] After finding the path, the source node s in the network will start data transmission. Based on the multi-path joint transmission design, it uses the routing relay forwarding support provided by the nodes on the main path and auxiliary path to perform highly reliable data transmission communication to the destination node d.

[0089] The steps to perform data routing transmission are as follows:

[0090] Step S201: The source node s sends the main path Path op (s,d) and auxiliary path Path su The routing forwarding node ID (i.e., node identity) on (s, d) is carried in the message data header, and the message sequence number is added, and then the message data is sent. The message sequence number is used to uniquely identify a message data transmitted from the source node to the destination node, and the source node increases its message sequence number by 1 every time it sends a new message data.

[0091] Step S202: The node that receives the message data in the network checks the information in the message data header and determines whether the message is received for the first time based on the message sequence number. If so, further processing is performed; otherwise, the duplicate message is discarded. For the first received message, according to the node ID on the path indicated in the message header, it is determined whether it is a relay forwarding node on the path related to the transmission from the source node s to the destination node d. If so, the node forwards the data; otherwise, no forwarding is required and the message is discarded. In particular, for links shared by multiple paths, the node needs to perform multiple forwardings.

[0092] Step S203: After receiving the message data, the destination node d performs a duplication check on the received message data based on the message sequence number, and delivers the first received data message to the upper layer application; otherwise, it is discarded.

[0093] The following is a specific embodiment of the present invention with reference to two network examples to further illustrate the method of the present invention. It should be noted that the typical network examples are used as reference scenarios to specifically illustrate the implementation and operation process of the technical solution of the present invention, but the method of the present invention is not limited to use in these example networks.

[0094] Example 1 Network Implementation

[0095] like Figure 3 As shown, a topological connection diagram of a multi-hop wireless network, wherein the dotted line represents a one-hop link for communication between nodes, the number in the circle represents the ID of the node, and the number on the link represents the data transmission loss rate of the link. In the example, 8 nodes constitute a network with a multi-hop mesh topology connection. With node 1 as the source node and node 7 as the destination node, the multipath routing transmission method for reliable communication of multi-hop wireless network data of the present invention is used to realize reliable routing transmission from node 1 to node 7.

[0096] The weight W(e) of each link is calculated by formula (4) i ), construct the network topology weighted graph G′, and use the Dijkstra algorithm to search for the optimal reliable transmission main path Path op(1,7) is node 1→node 4→node 3→node 7. Further, by searching the neighbor nodes of the nodes on the main path, the node set N={1,2,5,6,7} is obtained, and the topology graph G′1 is generated through the pruning operation in step S104. Based on the topology graph G′1, the auxiliary path Path is searched and found using the Dijkstra algorithm. su (1,7) is node 1→node 5→node 6→node 7.

[0097] The transmission path of multipath routing is as follows Figure 4 As shown. Based on the main path and auxiliary path found, node 1 carries the node ID on the path in the header of the message data sent, including nodes 4 / 3 / 5 / 6. After receiving the message sent by node 1 for the first time, these nodes on the path will relay the message. Since the nodes on the main path and the auxiliary path are neighboring nodes to each other, the message forwarded by the node on the main path can be received by the node on the auxiliary path, and vice versa, which enhances the reliability of message transmission on the path. Compared with the traditional single-path routing, considering selecting the shortest path node 1→node 2→node 3→node 7 for transmission, its data transmission success rate is calculated to be only 0.673; while using the multi-path routing transmission method for reliable communication of multi-hop wireless network data of the present invention, the transmission success rate of the preferred main path is 0.770, and the transmission success rate of the auxiliary path is 0.704. The transmission success rate of the main path and the auxiliary path multipath combination can reach more than 0.973, and the data transmission reliability is significantly improved.

[0098] Example 2 Network Implementation

[0099] like Figure 5 As shown in the figure, another topology connection diagram of a multi-hop wireless network, in which 9 nodes form a multi-hop mesh topology network. With node 1 as the source node and node 8 as the destination node, reliable routing transmission from node 1 to node 8 is achieved. In this network topology, link e(6,8) will be the only necessary path for routing transmission to node 8.

[0100] Similarly, the weight W(e) of each link is calculated by formula (4) i ), construct the network topology weighted graph G′, and use the Dijkstra algorithm to search for the optimal reliable transmission main path Path op(1,8) is node 1→node 5→node 7→node 6→node 8. Further, by searching the neighbor nodes of the nodes on the main path, the node set N={1,2,3,4,8,9} is obtained, and the topology graph G′1 is generated through the pruning operation of step S104. Based on the topology graph G′1, using the Dijkstra algorithm, it is impossible to find a valid path to the destination node 8, so continue to step S106 to generate the topology graph G′2. In step S107, based on the topology graph G′2, it is still impossible to find a valid path to the destination node 8, so steps S108 and S109 will continue to be executed to generate the topology graph G′3. Based on the topology graph G′3, using the Dijkstra algorithm, search and find the auxiliary path Path su (1,8) is node 1→node 2→node 6→node 8.

[0101] The transmission path of multipath routing is as follows Figure 6 As shown. Based on the main path and auxiliary path found, node 1 carries the node ID on the path in the header of the message data sent, including nodes 5 / 7 / 6 / 2 / 6. After receiving the message sent by node 1 for the first time, these nodes on the path will relay the message. Compared with the traditional single-path routing, considering selecting the shortest path node 1→node 2→node 6→node 8 for transmission, its data transmission success rate is calculated to be 0.711; and the multi-path routing transmission method for reliable communication of multi-hop wireless network data of the present invention is used, and the transmission success rate of the preferred main path is 0.755, and the transmission success rate of the auxiliary path is 0.711. The transmission success rate of the main path and the auxiliary path multipath combination can reach more than 0.961, and the data transmission reliability is significantly improved.

[0102] Based on the same concept as the above method, Figure 7 As shown, this embodiment also provides a multipath routing transmission system for reliable communication of multi-hop wireless network data, including:

[0103] A main path selection unit, used to select an optimal reliable transmission path as a main path for routing transmission using a Dijkstra algorithm;

[0104] An auxiliary path selection unit, used to select an auxiliary path with better reliable transmission from neighboring nodes of the main path;

[0105] The transmission unit is used to perform multipath routing transmission by utilizing a main path and an auxiliary path in combination.

[0106] The specific processing process of each unit refers to the above method and will not be repeated here.

[0107] The above describes a multi-path routing transmission method and system for reliable communication of multi-hop wireless network data provided by the embodiment of the present application, as a possible product form of the above system, such as Figure 8 As shown, an embodiment of the present application further provides an electronic device, including:

[0108] At least one processor; and a communication interface that is communicatively connected to the at least one processor; the at least one processor executes instructions stored in the memory, so that the electronic device executes the method steps executed by any device in the above method embodiments through the communication interface.

[0109] Optionally, the memory is located outside the electronic device.

[0110] Optionally, the electronic device includes the memory, the memory is connected to the at least one processor, and the memory stores instructions that can be executed by the at least one processor. Figure 8 The dashed lines indicate that the memory is optional for the electronic device.

[0111] The processor and the memory may be coupled via an interface circuit or may be integrated together, which is not limited here.

[0112] The specific connection medium between the processor, memory and communication interface is not limited in the embodiments of the present application. Figure 8 The processor, memory and communication interface are connected by a bus. Figure 8 The connections between the other components are shown in bold lines, which are only for illustration and are not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 8 In the example, only one thick line is used to represent the bus, but it does not mean that there is only one bus or one type of bus. It should be understood that the processor mentioned in the embodiment of the present application can be implemented by hardware or by software. When implemented by hardware, the processor can be a logic circuit, an integrated circuit, etc. When implemented by software, the processor can be a general-purpose processor, which is implemented by reading the software code stored in the memory.

[0113] Exemplarily, the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0114] It should be understood that the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct memory bus random access memory (DirectRambus RAM, DR RAM).

[0115] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, the memory (storage module) can be integrated into the processor.

[0116] It should be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0117] As another possible product form, an embodiment of the present application also provides a computer-readable storage medium, which is used to store instructions. When the instructions are executed, the computer executes the method steps executed by any device in the above method example.

[0118] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0119] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0120] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0121] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0122] 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 multipath routing transmission method for reliable communication of multi-hop wireless network data, characterized in that: The steps include: Link quality-based routing: Use the Dijkstra algorithm to select the optimal reliable transmission path as the main path for routing transmission; Multipath routing selection: select an auxiliary path with better and more reliable transmission from the neighboring nodes of the main path; Data routing transmission: Multipath routing transmission is performed by combining the main path and the auxiliary path.

2. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 1, characterized in that: The method of selecting the optimal reliable transmission path as the main path of routing transmission by using the Dijkstra algorithm includes the following sub-steps: Calculate the weight of the link in the network topology diagram based on the data transmission loss rate; A network topology weighted graph of the network topology graph is constructed, and the Dijkstra algorithm is used to find the optimal reliable transmission path from the source node to the destination node in the network as the main path, that is, the path with the minimum sum of weights among all feasible paths.

3. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 2, characterized in that: The weight of the link in the network topology diagram calculated based on the data transmission loss rate is: Among them, W(e i ) represents the i-th link e in the network topology graph i The weight of L(e i ) represents the i-th link e in the network topology graph i Indicates the loss rate of message data transmission.

4. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 1, characterized in that: The step of selecting an auxiliary path with better reliable transmission from the neighboring nodes of the main path includes the following sub-steps: Step S101: Set set N to be empty; Step S102: traverse each node v in the network topology weighted graph G′ i , determine node v i and the node set V(Path op Whether any node in (s,d)) is a neighbor node, Path op (s,d) indicates the main path; If yes, and the node Then the node v i Add to set N; Step S103: Add the source node s and the destination node d to the set N; Step S104: Prune the original network topology weighted graph G′, delete the nodes that do not belong to the set N and the links related to the deleted nodes; at the same time, further delete the nodes that belong to the link set E (Path op (s,d)) links; the pruned topology is denoted as G′1; Step S105: Based on the topology graph G′1, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s, d); if a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the nodes are not independent, and the next step is executed; Step S106: Set V(Path op The nodes in (s, d)) are added to the set N, and the pruning operation similar to step S104 is performed to obtain a pruned topology graph denoted as G′2; Step S107: Based on the topology graph G′2, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s, d); if a reachable path is found, the algorithm ends; otherwise, multi-path selection is allowed under the constraint that the links are not independent, and the next step is executed; Step S108: For the topology graph G′2, starting from the source node s, perform a breadth-first search to find the node m that is farthest from the source node s in hops, and m∈V(Path op (s,d)); Path op The next hop node of m on (s, d) is represented as w; Step S109: adding a link e(m,w) to the topology graph G′2, and repeating step S108 until there is a node m=d, and defining the topology graph G′2 at this time as the final topology graph G′3; Step S110: Based on the final topology graph G′3, use the Dijkstra algorithm to search for the optimal reliable transmission path Path from the source node s to the destination node d su (s,d), the optimal reliable transmission path Path su (s,d) is the auxiliary path.

5. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 4, characterized in that: If there is a Path su (s,d)=Path op (s,d), it means that there is no suitable optional multi-path in the network.

6. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 1, characterized in that: The method of using the main path and the auxiliary path to perform multipath routing transmission includes the following sub-steps: Step S201: The source node s sends the main path Path op (s,d) and auxiliary path Path su The routing forwarding node ID on (s, d) is carried in the header of the message data, and the message sequence number is added, and then the message data is sent; the message sequence number is used to uniquely identify a message data transmitted from the source node to the destination node, and the source node increases its message sequence number by 1 every time it sends a new message data; Step S202: The node receiving the message data in the network checks the information in the message data header and determines whether the message is received for the first time based on the message sequence number; If yes, further processing; Otherwise, discard the duplicate message; for the first received message, determine whether it is a relay forwarding node on the path related to the transmission from the source node s to the destination node d according to the node ID on the path indicated in the message header; If yes, the node forwards the data; Otherwise, there is no need to forward the message and the message is discarded; Step S203: After receiving the message data, the destination node d performs a duplication check on the received message data based on the message sequence number; for the data message received for the first time, it is delivered to the upper layer application; otherwise, it is discarded.

7. The multipath routing transmission method for reliable communication of multi-hop wireless network data according to claim 6, characterized in that: In step S202, for a link shared by multiple paths, the node needs to perform multiple forwardings.

8. A multipath routing transmission system for reliable communication of multi-hop wireless network data, characterized in that: include: A main path selection unit, used to select an optimal reliable transmission path as a main path for routing transmission using a Dijkstra algorithm; An auxiliary path selection unit, used to select an auxiliary path with better reliable transmission from neighboring nodes of the main path; The transmission unit is used to perform multipath routing transmission by utilizing the main path and the auxiliary path in combination.

9. An electronic device, characterized in that: include: at least one processor; and a memory communicatively coupled to the at least one processor; The memory stores instructions that can be executed by the at least one processor, and the at least one processor executes the method as described in any one of claims 1 to 7 by executing the instructions stored in the memory.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store instructions, and when the instructions are executed, the method according to any one of claims 1 to 7 is implemented.

Images