Hybrid routing method, device and equipment based on clustering network topology

Abstract

The invention provides a hybrid routing method, device and equipment based on clustering network topology, and the method comprises the steps: determining to obtain a routing request from a source node to a target node, and obtaining an inter-node distance between the source node and the target node; selecting a target routing policy from a plurality of preset routing policies based on the inter-node distance; wherein the plurality of preset routing strategies at least comprise an intra-cluster double-hop routing, a non-backbone relay routing and a backbone network routing; and performing communication between the target node and the source node by adopting the target routing strategy. According to the technical scheme, the data transmission efficiency and reliability between the nodes can be improved, and the life cycle of the clustering network is prolonged.

Description

Technical Field

[0001] This application relates to the technical field of wireless ad hoc networks, and in particular, to a hybrid routing method, apparatus, and device based on a clustered network topology. Background Art

[0002] Ad hoc network routing protocols are mainly divided into three categories: table-driven routing, on-demand routing, and hybrid routing. Table-driven routing maintains a complete routing table by periodically exchanging control information, which can provide the optimal path but has a large control overhead; on-demand routing only establishes a path when communication is needed, with a small control overhead but a high initial delay; hybrid routing combines the advantages of the former two, but has inflexible area division and complex boundary handling.

[0003] Clustering technology organizes network nodes into multiple clusters and selects cluster head nodes to manage intra-cluster communication. Existing clustering-based routing schemes have the following problems: 1. The cluster head nodes are overloaded, which easily leads to rapid energy depletion; 2. Routing decisions usually rely on a single strategy and are difficult to adapt to communication requirements at different distances; 3. The link interruption handling mechanism is imperfect, resulting in a decrease in communication reliability; 4. The energy consumption distribution is uneven, affecting the lifespan of the clustered network. Summary of the Invention

[0004] This application aims to solve at least one of the technical problems in the related art to some extent.

[0005] In a first aspect, this application proposes a hybrid routing method based on a clustered network topology. The method includes: determining that a routing request from a source node to a target node is obtained, and obtaining the inter-node distance between the source node and the target node; selecting a target routing strategy from multiple preset routing strategies based on the inter-node distance; where the multiple preset routing strategies at least include: intra-cluster two-hop routing, non-backbone relay routing, backbone network routing; using the target routing strategy to communicate between the target node and the source node.

[0006] In an implementation, the selecting a target routing strategy from multiple preset routing strategies based on the inter-node distance includes: determining that the number of hops between the source node and the target node is less than M, and selecting the intra-cluster two-hop routing as the target routing strategy; or, determining that the number of hops between the source node and the target node is greater than or equal to M and less than N, and selecting the non-backbone relay routing as the target routing strategy; or, determining that the number of hops between the source node and the target node is greater than or equal to N, and selecting the backbone network routing as the target routing strategy, where M and N are positive integers, and M is less than N.

[0007] In one implementation, the target routing policy is the in-cluster two-hop routing. Using the target routing policy to communicate between the target node and the source node includes: determining that the target node is within the communication range of the cluster head node of the cluster where the source node is located, obtaining the communication path between the target node and the source node by using the shortest path algorithm, and sending the communication path to the source node; wherein, the communication path is used for the source node to communicate with the target node; or, determining that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, and sending the routing request to the adjacent cluster head node; wherein, the routing request is used to request the adjacent node to obtain the communication path between the target node and the source node, and send the communication path to the source node.

[0008] In an optional implementation, the method further includes: determining that link interruption information sent by the target node is obtained, and replacing the abnormal node; determining that the abnormal node cannot be replaced, and obtaining a new communication path between the source node and the target node.

[0009] In one implementation, the target routing policy is the non-backbone relay routing. Using the target routing policy to communicate between the target node and the source node includes: obtaining a first communication path and a second communication path between the target node and the source node; wherein, the nodes included in the first communication path are different from the nodes included in the second communication path; and sending the first communication path and the second communication path to the source node.

[0010] In one implementation, the target routing policy is the backbone network routing. Using the target routing policy to communicate between the target node and the source node includes: forwarding the routing request hop by hop through the backbone network to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node; wherein, each node passed through during the routing request forwarding process records the next-hop information.

[0011] In a second aspect, the present application provides a hybrid routing device based on a clustered network topology. The device includes: a first processing module, configured to determine that a routing request from a source node to a target node is obtained, and obtain the inter-node distance between the source node and the target node; a second processing module, configured to select a target routing policy from multiple preset routing policies based on the inter-node distance; wherein, the multiple preset routing policies at least include: in-cluster two-hop routing, non-backbone relay routing, backbone network routing; a third processing module, configured to use the target routing policy to communicate between the target node and the source node.

[0012] In one implementation, the second processing module may be configured to: determine that the number of hops between the source node and the target node is less than M, and select the intra-cluster two-hop routing as the target routing policy; or, determine that the number of hops between the source node and the target node is greater than or equal to M and less than N, and select the non-backbone relay routing as the target routing policy; or, determine that the number of hops between the source node and the target node is greater than or equal to N, and select the backbone network routing as the target routing policy, where M and N are positive integers, and M is less than N.

[0013] In one implementation, when the target routing policy is the intra-cluster two-hop routing, the third processing module may be configured to: determine that the target node is within the communication range of the cluster head node of the cluster where the source node is located, obtain the communication path between the target node and the source node by using the shortest path algorithm, and send the communication path to the source node; where the communication path is used for communication between the source node and the target node; or, determine that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, and send the routing request to the adjacent cluster head node; where the routing request is used to request the adjacent node to obtain the communication path between the target node and the source node, and send the communication path to the source node.

[0014] In an alternative implementation, the third processing module may further be configured to: determine that link interruption information sent by the target node is obtained, and replace the abnormal node; determine that the abnormal node cannot be replaced, and obtain a new communication path between the source node and the target node.

[0015] In one implementation, when the target routing policy is the non-backbone relay routing, the third processing module may be configured to: obtain a first communication path and a second communication path between the target node and the source node; where the nodes included in the first communication path are different from the nodes included in the second communication path; and send the first communication path and the second communication path to the source node.

[0016] In one implementation, when the target routing policy is the backbone network routing, the third processing module may be configured to: forward the routing request hop by hop through the backbone network to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node; where each node passed through during the routing request forwarding process records the next-hop information.

[0017] In a third aspect, the present application provides an electronic device, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executable by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor is enabled to execute the hybrid routing method based on a clustered network topology as described in the first aspect.

[0018] In a fourth aspect, the present application provides a computer-readable storage medium for storing instructions that, when executed, implement the method as described in the first aspect.

[0019] In a fifth aspect, the present application provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the hybrid routing method based on a clustered network topology as described in the first aspect.

[0020] For the hybrid routing method, apparatus, device, and storage medium based on a clustered network topology provided by the present application, after the cluster head node of the cluster where the source node is located obtains the routing request of the source node, a suitable target routing policy can be selected from a plurality of preset routing policies based on the inter-node distance between the source node and the target node, so as to use the target routing policy for communication between the target node and the source node. This can improve the data transmission efficiency and reliability between nodes and extend the lifespan of the clustered network.

[0021] Additional aspects and advantages of the present application will be given in part in the following description, become apparent in part from the following description, or be learned through the practice of the present application. Description of the Drawings

[0022] The above and / or additional aspects and advantages of the present application will become apparent and be readily understood from the following description of the embodiments in conjunction with the drawings, where:

[0023] Figure 1 is a schematic flowchart of a hybrid routing method based on a clustered network topology provided by an embodiment of the present application;

[0024] Figure 2 is a schematic flowchart of another hybrid routing method based on a clustered network topology provided by an embodiment of the present application;

[0025] Figure 3 is a schematic flowchart of yet another hybrid routing method based on a clustered network topology provided by an embodiment of the present application;

[0026] Figure 4 is a schematic flowchart of yet another hybrid routing method based on a clustered network topology provided by an embodiment of the present application;

[0027] Figure 5 It is a schematic structural diagram of a hybrid routing device based on a clustered network topology provided by an embodiment of the present application;

[0028] Figure 6 It is a schematic structural diagram of an electronic device provided by an embodiment of the present application. Detailed implementation manners

[0029] The embodiments of the present application will be described in detail below. Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals denote the same or similar elements or elements with the same or similar functions from beginning to end. The embodiments described below by referring to the accompanying drawings are exemplary and are intended to explain the present application, and should not be construed as a limitation to the present application.

[0030] The hybrid routing method and device based on a clustered network topology according to an embodiment of the present application will be described below with reference to the accompanying drawings.

[0031] It should be noted that the hybrid routing method and device based on a clustered network topology according to an embodiment of the present application can be applied to the cluster head node of the cluster where the source node is located.

[0032] Figure 1 It is a schematic flowchart of a hybrid routing method based on a clustered network topology provided by an embodiment of the present application. As Figure 1 shown, the method may include but is not limited to the following steps:

[0033] Step S101: Determine that a routing request from the source node to the target node is obtained, and obtain the inter-node distance between the source node and the target node.

[0034] Exemplarily, after the cluster head node of the cluster where the source node is located obtains the routing request from the source node to the target node, it obtains the inter-node distance between the source node and the target node.

[0035] Exemplarily, the inter-node distance may be the number of hops between nodes.

[0036] Exemplarily, the cluster head node may obtain the inter-node distance between the source node and the target node according to its corresponding visibility matrix.

[0037] Exemplarily, each cluster head node in the clustered network may periodically send topology update messages to neighboring cluster head nodes, so that the cluster head can obtain the complete topology information of all node connections within its coverage area and construct a visibility matrix.

[0038] Exemplarily, the period duration for the cluster head node to periodically send topology update messages can be determined according to the network mobility characteristics. The shorter the period duration, the higher the routing efficiency but the greater the control overhead. The longer the period duration, the smaller the control overhead, but it may lead to routing decisions based on outdated topology information.

[0039] Step S102: Select a target routing policy from multiple preset routing policies based on the distance between nodes.

[0040] Among them, in the embodiments of the present application, the above-mentioned multiple preset routing policies at least include: in-cluster two-hop routing, non-backbone relay routing, backbone network routing.

[0041] Exemplarily, if the distance between the source node and the target node is within a preset first distance range, then select in-cluster two-hop routing as the target routing policy.

[0042] Exemplarily, if the distance between the source node and the target node is within a preset second distance range, then select non-backbone relay routing as the target routing policy. Wherein, the second distance range is greater than the aforementioned first distance range.

[0043] Exemplarily, if the distance between the source node and the target node is within a preset third distance range, then select non-backbone relay routing as the target routing policy. Wherein, the third distance range is greater than the aforementioned second distance range.

[0044] Step S103: Use the target routing policy to communicate between the target node and the source node.

[0045] Exemplarily, use the target routing policy to generate end-to-end path information between the source node and the target node, so that the source node communicates with the target node based on the end-to-end path information.

[0046] By implementing the embodiments of the present application, after the cluster head node in the cluster where the source node is located obtains the routing request of the source node, based on the distance between the source node and the target node, a suitable target routing policy can be selected from multiple preset routing policies, so as to use the target routing policy to communicate between the target node and the source node. It can improve the data transmission efficiency and reliability between nodes and extend the life cycle of the clustered network.

[0047] In some embodiments, when the target node is located in the in-cluster area of the cluster where the source node is located, in-cluster two-hop routing can be used to obtain the communication path between the source node and the target node. As an example, please refer to Figure 2 , Figure 2 is a schematic flowchart of another hybrid routing method based on the clustered network topology provided by the embodiments of the present application. As shown in Figure 2 shown, the method may include but is not limited to the following steps:

[0048] Step S201: Determine that a routing request from the source node to the target node is obtained, and obtain the distance between the source node and the target node.

[0049] Exemplarily, the cluster head node of the cluster where the source node is located determines that it has obtained a routing request from the source node to the target node, and obtains the number of node hops between the source node and the target node.

[0050] Step S202: Determine that the number of hops between the source node and the target node is less than M, and select the intra-cluster two-hop routing as the target routing strategy.

[0051] Wherein, M is a positive integer.

[0052] In some embodiments, the specific value of M can be determined based on the number of cluster head nodes for information exchange.

[0053] Exemplarily, if the number of cluster head nodes for information exchange is A, then M = 4A + 2.

[0054] Step S203: Determine that the target node is within the communication range of the cluster head node of the cluster where the source node is located, use the shortest path algorithm to obtain the communication path between the target node and the source node, and send the communication path to the source node; or, determine that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, and send the routing request to the adjacent cluster head node.

[0055] Wherein, the communication path is used for the source node and the target node to communicate.

[0056] Wherein, the routing request is used to request the adjacent node to obtain the communication path between the target node and the source node.

[0057] Exemplarily, if the cluster head node determines that the target node is a node included in its own visibility matrix, then the shortest path algorithm (for example, Dijkstra shortest path algorithm) is used to calculate and obtain the communication path between the source node and the target node.

[0058] Exemplarily, if the cluster head node determines that the target node is not a node included in its own visibility matrix, then the routing request is forwarded to the adjacent first cluster head node, so that the first cluster head node determines whether the source node is a node included in the first cluster head node's visibility matrix; if the source node is a node included in the first cluster head node's visibility matrix, then the first cluster head node obtains the end-to-end path information from the source node to the target node, and returns the end-to-end path information to the source node; if the source node is not a node included in the first cluster head node's visibility matrix, then the first cluster head node forwards the routing request of the source node to the adjacent node of the first cluster head node, and repeats the above steps until the second cluster head node that includes the target node in its visibility matrix is found, and the second cluster head node obtains the end-to-end path information from the source node to the target node, and returns the end-to-end path information to the source node.

[0059] In some embodiments, the above method may further include: determining that link interruption information sent by a target node is obtained and replacing an abnormal node; determining that the abnormal node cannot be replaced and obtaining a new communication path between the source node and the target node.

[0060] Exemplarily, when the source node detects that the communication link with the target node is interrupted, the source node first requests the cluster head node of its own cluster to replace the next-hop node to only modify a single link in the path for path repair; when path repair is not feasible, a complete repair is performed, and the cluster head node of the cluster where the source node is located calculates a new path from the breakpoint to the target node and notifies relevant nodes.

[0061] In some embodiments, if the path cannot be repaired at all, a routing error message including the failed node identifier and timestamp is broadcast to the backbone network.

[0062] In some embodiments, nodes in the clustered network periodically detect the neighbor status and maintain a node disable list, recording the node identifiers, detection times, and disable periods of the detected failed nodes, which is used to judge the freshness of the topology update message and prevent outdated information from affecting routing decisions.

[0063] It should be noted that the disable period in the node disable list is related to the network mobility. In a high-mobility network, the value can be set to a smaller value (for example, 10 seconds). Whenever a node receives a topology update message containing a node in the disable list, it will check whether the disable time of the node has expired. If it has expired, the topology information contained in the update message is considered fresh; otherwise, the topology information related to the node is discarded, thus avoiding using outdated link information for routing decisions.

[0064] By implementing the embodiments of the present application, when the target node is located in the intra-cluster area of the cluster where the source node is located, an intra-cluster double-hop routing can be adopted to obtain the communication path between the source node and the target node, thereby achieving efficient intra-cluster routing.

[0065] In one implementation, if the source node and the target node belong to different clusters but are moderately distant, a non-backbone relay routing can be selected for communication between the source node and the target node. As an example, please refer to Figure 3 , Figure 3 which is a schematic flowchart of another hybrid routing method based on the clustered network topology provided by the embodiments of the present application. As shown in Figure 3 , the method may include but is not limited to the following steps:

[0066] Step S301: Determine that a routing request from the source node to the target node is obtained, and obtain the inter-node distance between the source node and the target node.

[0067] In the embodiments of the present application, step S301 can be implemented in any one of the embodiments of the present application. The embodiments of the present application do not limit this and will not be elaborated further.

[0068] Step S302: Determine that the number of hops between the source node and the target node is greater than or equal to M and less than N, and select a non-backbone relay route as the target routing strategy.

[0069] Wherein, M and N are positive integers, and M is less than N.

[0070] In some embodiments of the present application, the specific value of N can be determined based on the number of cluster head nodes for information exchange.

[0071] Exemplarily, if the number of cluster head nodes for information exchange is A, then N = 2 * (4A + 2).

[0072] Step S303: Obtain a first communication path and a second communication path between the target node and the source node.

[0073] Wherein, the nodes included in the first communication path are different from the nodes included in the second communication path.

[0074] Exemplarily, the cluster head node calculates and obtains two independent communication paths between the source node and the target node as the above-mentioned first communication path and second communication path, and these two communication paths pass through different cluster heads and gateway nodes.

[0075] Step S304: Send the first communication path and the second communication path to the source node.

[0076] Exemplarily, taking the first communication path as the main path and the second communication path as the backup path as an example, the cluster head node returns the first communication path and the second communication path to the source node, so that the source node preferentially uses the first communication path to communicate with the target node, and the source node automatically switches to the second communication path when detecting that the first communication path fails.

[0077] By implementing the embodiments of the present application, when the source node and the target node belong to different clusters but the distance is moderate, a non-backbone relay routing strategy can be selected to obtain the first communication path and the second communication path, so that the source node communicates with the target node based on the first communication path and the second communication path. Thereby improving communication reliability and reducing routing reconstruction delay.

[0078] In one implementation manner, if the inter-node distance between the source node and the target node is relatively far, a backbone network routing strategy can be adopted for communication between the target node and the source node. As an example, please refer to Figure 4 , Figure 4 is a schematic flowchart of another hybrid routing method based on a clustered network topology provided by the embodiments of the present application. As shown inFigure 3 As shown, the method may include but is not limited to the following steps:

[0079] Step S401: Determine that a routing request from a source node to a target node is obtained, and obtain the inter-node distance between the source node and the target node.

[0080] In the embodiments of the present application, step S401 can be implemented in any one of the embodiments of the present application. The embodiments of the present application do not make any limitations in this regard and will not be elaborated further.

[0081] Step S402: Determine that the number of hops between the source node and the target node is greater than or equal to N, and select the backbone network routing as the target routing strategy.

[0082] Step S403: Forward the routing request hop by hop through the backbone network to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node.

[0083] Among them, in the embodiments of the present application, each node passed through during the routing request forwarding process records the next-hop information.

[0084] Exemplarily, the routing request of the cluster head node of the cluster where the source node is located is forwarded hop by hop through the backbone network composed of cluster heads and gateways until it reaches the cluster head containing the target node, and the cluster head node of the cluster where the target node is located sends a routing response back along the backbone network. In this process, each forwarding node on the backbone network records the next-hop information to form a distance vector, and after receiving the routing response, the source node sends data to the target node through the backbone network based on the above distance vector.

[0085] In some embodiments, the above method may further include: when a routing failure is detected, handle the routing error according to the standard AODV algorithm process, and re-trigger the routing discovery process.

[0086] Exemplarily, when the source node detects a routing failure, handle the routing error according to the standard AODV (Ad hoc On-Demand Distance Vector Routing) algorithm process, and re-trigger the routing discovery process.

[0087] By implementing the embodiments of the present application, when the inter-node distance between the source node and the target node is relatively far, the backbone network routing strategy can be used to forward the routing request to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node. It can reduce the control overhead and improve the routing reliability in long-distance communication.

[0088] In some embodiments of the present application, the intermediate nodes participating in the communication between the source node and the target node can only use cache routing for data forwarding and cannot be used to initiate new end-to-end communication.

[0089] Please refer to Figure 5 , Figure 5 which is a schematic structural diagram of a hybrid routing device based on a clustered network topology provided by an embodiment of the present application. As Figure 5 shown, the device 500 includes: a first processing module 501, configured to determine that a routing request from a source node to a target node is obtained, and obtain the inter-node distance between the source node and the target node; a second processing module 502, configured to select a target routing policy from multiple preset routing policies based on the inter-node distance; where the multiple preset routing policies at least include: in-cluster two-hop routing, non-backbone relay routing, backbone network routing; a third processing module 503, configured to use the target routing policy to perform communication between the target node and the source node.

[0090] In one implementation, the second processing module 502 may be configured to: determine that the number of hops between the source node and the target node is less than M, and select in-cluster two-hop routing as the target routing policy; or, determine that the number of hops between the source node and the target node is greater than or equal to M and less than N, and select non-backbone relay routing as the target routing policy; or, determine that the number of hops between the source node and the target node is greater than or equal to N, and select backbone network routing as the target routing policy, where M and N are positive integers, and M is less than N.

[0091] In one implementation, the third processing module 503 may be configured to: determine that the target node is within the communication range of the cluster head node of the cluster where the source node is located, obtain the communication path between the target node and the source node by using the shortest path algorithm, and send the communication path to the source node; where the communication path is used for the source node and the target node to communicate; or, determine that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, and send the routing request to the adjacent cluster head node; where the routing request is used to request the adjacent node to obtain the communication path between the target node and the source node and send the communication path to the source node.

[0092] In an alternative implementation, the third processing module 503 may further be configured to: determine that link interruption information sent by the target node is obtained, and replace the abnormal node; determine that the abnormal node cannot be replaced, and obtain a new communication path between the source node and the target node.

[0093] In one implementation, the target routing policy is a non-backbone relay route, and the third processing module 503 can be used to: obtain a first communication path and a second communication path between a target node and a source node; wherein, the nodes included in the first communication path are different from the nodes included in the second communication path; and send the first communication path and the second communication path to the source node.

[0094] In one implementation, the target routing policy is a backbone network route, and the third processing module 503 can be used to: forward the routing request hop by hop through the backbone network to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node; wherein, each node passed through during the routing request forwarding process records the next-hop information.

[0095] Through the device of the embodiments of the present application, after the cluster head node of the cluster where the source node is located obtains the routing request of the source node, it can select a suitable target routing policy from a preset plurality of routing policies based on the inter-node distance between the source node and the target node, so as to use the target routing policy to communicate between the target node and the source node. It can improve the data transmission efficiency and reliability between nodes and extend the life cycle of the clustered network.

[0096] It should be noted that the foregoing explanation of the embodiments of the hybrid routing method based on the clustered network topology also applies to the hybrid routing device based on the clustered network topology of this embodiment, and will not be elaborated here.

[0097] To implement the above embodiments, the present application also proposes an electronic device. Please refer to Figure 6 , Figure 6 is a schematic structural diagram of the electronic device provided by the embodiments of the present application. As Figure 6 shown, the electronic device 600 includes: a processor 601, and a memory 602 communicatively connected to the processor 601; the memory 602 stores computer-executable instructions; the processor 601 executes the computer-executable instructions stored in the memory to implement the method provided by the foregoing embodiments.

[0098] To implement the above embodiments, the present application also proposes a computer-readable storage medium, in which computer-executable instructions are stored, and the computer-executable instructions are used to implement the method provided by the foregoing embodiments when executed by a processor.

[0099] To implement the above embodiments, the present application also proposes a computer program product, including a computer program, and the computer program implements the method provided by the foregoing embodiments when executed by a processor.

[0100] Among them, in the description of this application, unless otherwise specified, " / " means "or". For example, A / B can mean A or B; "and / or" in this text is merely an association relationship describing associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone.

[0101] In the description of the foregoing embodiments, the descriptions referring to terms such as "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of this application. In this specification, the schematic descriptions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0102] In addition, the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" can explicitly or implicitly include at least one of such features. In the description of this application, "a plurality of" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0103] Any process or method description in a flowchart or described in other ways herein can be understood as representing a module, segment, or part of code including one or more executable instructions for implementing a customized logic function or process. The scope of the preferred embodiments of this application includes additional implementations, where the functions can be executed in a substantially simultaneous manner or in the reverse order according to the involved functions, rather than in the order shown or discussed, which should be understood by those skilled in the art to which the embodiments of this application belong.

[0104] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a definable sequence list of executable instructions for implementing logical functions, which can be specifically implemented in any computer-readable medium for use by an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other systems that can fetch and execute instructions from the instruction execution system, apparatus, or device), or in combination with these instruction execution systems, apparatus, or devices. For the purposes of this specification, a "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include the following: an electrical connection portion having one or more wirings (electronic device), a portable computer diskette (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium can even be paper or other suitable media on which the program can be printed, because the program can be obtained electronically, for example, by optically scanning the paper or other media, followed by editing, interpretation, or otherwise processing as appropriate, and then storing it in a computer memory.

[0105] It should be understood that various parts of the present application can be implemented by hardware, software, firmware, or combinations thereof. In the above-described embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or a combination of the following techniques well-known in the art can be used: discrete logic circuits having logic gate circuits for implementing logical functions on data signals, application-specific integrated circuits having suitable combinational logic gate circuits, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0106] Those of ordinary skill in the art of this technology can understand that all or part of the steps carried by the method of implementing the above embodiments can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. When the program is executed, it includes one or a combination of the steps of the method embodiments.

[0107] In addition, each functional unit in various embodiments of the present application may be integrated into one processing module, may exist separately as individual physical units, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. When the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0108] The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disc, etc. Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present application. Those of ordinary skill in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of the present application.

Claims

1. A hybrid routing method based on a clustered network topology, characterized in that, The method includes: Determine that a routing request from a source node to a target node is obtained, and obtain the inter-node distance between the source node and the target node; Select a target routing policy from multiple preset routing policies based on the inter-node distance; wherein, the multiple preset routing policies at least include: in-cluster two-hop routing, non-backbone relay routing, backbone network routing; Use the target routing policy to communicate between the target node and the source node.

2. The method according to claim 1, wherein The selecting a target routing policy from multiple preset routing policies based on the inter-node distance includes: Determine that the number of hops between the source node and the target node is less than M, and select the in-cluster two-hop routing as the target routing policy; or, Determine that the number of hops between the source node and the target node is greater than or equal to M and less than N, and select the non-backbone relay routing as the target routing policy; or, Determine that the number of hops between the source node and the target node is greater than or equal to N, and select the backbone network routing as the target routing policy, where M and N are positive integers, and M is less than N.

3. The method according to claim 1, wherein When the target routing policy is the in-cluster two-hop routing, the using the target routing policy to communicate between the target node and the source node includes: Determine that the target node is within the communication range of the cluster head node of the cluster where the source node is located, use the shortest path algorithm to obtain the communication path between the target node and the source node, and send the communication path to the source node; wherein, the communication path is used for the source node and the target node to communicate; or, Determine that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, and send the routing request to the adjacent cluster head node; wherein, the routing request is used to request the adjacent node to obtain the communication path between the target node and the source node, and send the communication path to the source node.

4. The method according to claim 3, characterized in that, The method further includes: Determine that link interruption information sent by the target node is obtained, and replace the abnormal node; Determine that the abnormal node cannot be replaced, and obtain a new communication path between the source node and the target node.

5. The method according to claim 1, wherein When the target routing policy is the non-backbone relay routing, the using the target routing policy to communicate between the target node and the source node includes: Obtain a first communication path and a second communication path between the target node and the source node; wherein, the nodes included in the first communication path are different from the nodes included in the second communication path; Send the first communication path and the second communication path to the source node.

6. The method according to claim 1, wherein When the target routing policy is the backbone network routing, the using the target routing policy to communicate between the target node and the source node includes: Forward the routing request hop by hop through the backbone network to the target cluster head node of the cluster where the target node is located, so that the target cluster head node returns routing response information to the source node; wherein, each node passed through during the routing request forwarding process records the next-hop information.

7. A hybrid routing device based on a clustered network topology, characterized in that The device includes: A first processing module, configured to determine that a routing request from a source node to a target node is obtained, and obtain the inter-node distance between the source node and the target node; A second processing module, configured to select a target routing policy from multiple preset routing policies based on the inter-node distance; wherein, the multiple preset routing policies at least include: in-cluster two-hop routing, non-backbone relay routing, backbone network routing; A third processing module, configured to use the target routing policy to communicate between the target node and the source node.

8. An electronic device, characterized in that, Comprising: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, Computer-executable instructions are stored in the computer-readable storage medium, and when the computer-executable instructions are executed by a processor, they are used to implement the method according to any one of claims 1 to 6.

10. A computer program product, characterized in that, Comprising a computer program, which implements the method according to any one of claims 1 to 6 when executed by a processor.

Images