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

Abstract

The application provides a hybrid routing method, device and equipment based on a clustering network topology. The method comprises the following steps: determining a routing request from a source node to a target node, and obtaining the distance between the nodes; selecting a target routing strategy from a plurality of preset routing strategies based on the distance between the nodes; wherein the plurality of preset routing strategies at least comprise an intra-cluster double-hop routing, a non-main trunk relay routing and a main trunk routing; and the target routing strategy is used for communication between the target node and the source node. The technical scheme can improve the data transmission efficiency and reliability between nodes, and prolong the life cycle of the clustering network.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless self-organizing networks, and in particular to a hybrid routing method based on a clustered network topology, a device and equipment. BACKGROUND

[0002] Self-organizing 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, which has a small control overhead but a high initial delay. Hybrid routing combines the advantages of the first two, but the area division is not flexible and the border processing is complex.

[0003] The 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 node is overloaded, which easily leads to rapid energy depletion; 2. Routing decisions usually rely on a single strategy, which is difficult to adapt to different distance communication needs; 3. The link interruption processing mechanism is imperfect, which leads to a decrease in communication reliability; 4. Energy consumption is unevenly distributed, which affects the lifetime of the clustered network. SUMMARY

[0004] The present application aims to at least partially solve one of the technical problems in the related art.

[0005] In a first aspect, the present application provides a hybrid routing method based on a clustered network topology, the method comprising: determining that a routing request from a source node to a target node is obtained, obtaining an inter-node distance between the source node and the target node; selecting a target routing strategy from a plurality of preset routing strategies based on the inter-node distance; wherein the plurality of preset routing strategies at least include: intra-cluster double-hop routing, non-main trunk relay routing, and main trunk routing; and using the target routing strategy for communication between the target node and the source node.

[0006] In an implementation manner, the selecting a target routing strategy from a plurality of preset routing strategies based on the inter-node distance comprises: determining that the number of hops between the source node and the target node is less than M, selecting the intra-cluster double-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, selecting the non-main trunk 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, selecting the main trunk routing as the target routing strategy, wherein M and N are positive integers and M is less than N.

[0007] In an implementation, the target routing strategy is the intra-cluster double-hop routing, and the communication between the target node and the source node is performed by using the target routing strategy, including: determining that the target node is within the communication range of a cluster head node of a cluster where the source node is located, obtaining a communication path between the target node and the source node by using a 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 a routing request to a neighboring cluster head node; wherein the routing request is used to request the neighboring 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 a link interruption information sent by the target node is obtained, and the abnormal node is replaced; determining that the abnormal node cannot be replaced, and a new communication path between the source node and the target node is obtained.

[0009] In an implementation, the target routing strategy is the non-backbone relay routing, and the communication between the target node and the source node is performed by using the target routing strategy, including: 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 an implementation, the target routing strategy is the backbone network routing, and the communication between the target node and the source node is performed by using the target routing strategy, including: forwarding the routing request hop by hop through a backbone network to a target cluster head node of a 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 in the routing request forwarding process records next hop information.

[0011] In a second aspect, the application provides a hybrid routing device based on a clustered network topology, the device including: a first processing module configured to determine that a routing request from a source node to a target node is obtained, and obtain a node-to-node distance between the source node and the target node; a second processing module configured to select a target routing strategy from a plurality of preset routing strategies based on the node-to-node distance; wherein the plurality of preset routing strategies include at least: intra-cluster double-hop routing, non-backbone relay routing, and backbone network routing; and a third processing module configured to perform communication between the target node and the source node by using the target routing strategy.

[0012] In an implementation manner, the second processing module can be configured to: determine that the number of hops between the source node and the target node is less than M, select the intra-cluster double-hop routing as the target routing strategy; 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, select the non-backbone relay routing as the target routing strategy; or determine that the number of hops between the source node and the target node is greater than or equal to N, select the backbone network routing as the target routing strategy, wherein M and N are positive integers, and M is less than N.

[0013] In an implementation manner, the target routing strategy is the intra-cluster double-hop routing, and the third processing module can be configured to: determine that the target node is within the communication range of a cluster head node of a cluster where the source node is located, acquire a communication path between the target node and the source node by using a shortest path algorithm, and send the communication path to the source node; wherein the communication path is used for the source node to communicate with 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 a routing request to a neighboring cluster head node; wherein the routing request is used to request the neighboring node to acquire the communication path between the target node and the source node, and send the communication path to the source node.

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

[0015] In an implementation manner, the target routing strategy is the non-backbone relay routing, and the third processing module can be configured to: acquire 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 send the first communication path and the second communication path to the source node.

[0016] In an implementation manner, the target routing strategy is the backbone network routing, and the third processing module can be configured to: forward the routing request hop by hop to a target cluster head node of a cluster where the target node is located through a backbone network, so that the target cluster head node returns routing response information to the source node; wherein each node passed through in the routing request forwarding process records next-hop information.

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

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

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

[0020] The hybrid routing method based on a clustering network topology, the device, the electronic device and the storage medium provided by the present application can, after the cluster head node of the cluster where the source node is located acquires the routing request of the source node, select a suitable target routing strategy from a plurality of preset routing strategies based on the inter-node distance between the source node and the target node, and use the target routing strategy to perform communication between the target node and the source node. The data transmission efficiency and reliability between nodes can be improved, and the life cycle of the clustering network can be prolonged.

[0021] Additional aspects and advantages of the present application will be in part apparent and in part pointed out hereinafter. BRIEF DESCRIPTION OF DRAWINGS

[0022] The above and / or additional aspects and advantages of the present application will become apparent and be readily appreciated from the following description, including the accompanying drawings, wherein:

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

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

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

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

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

[0028] Figure 6 is a structural schematic diagram of an electronic device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0029] Embodiments of the present application are described in detail below with reference to the accompanying drawings, examples of which are shown in the drawings, wherein the same or similar notations represent the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present application, and cannot be understood as a limitation of the present application.

[0030] A hybrid routing method and device based on a clustering network topology of an embodiment of the present application are described below with reference to the accompanying drawings.

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

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

[0033] Step S101: determining that a routing request of a source node to a target node is acquired, and acquiring an inter-node distance between the source node and the target node.

[0034] Exemplarily, after the cluster head node of the cluster in which the source node is located acquires the routing request of the source node to the target node, the inter-node distance between the source node and the target node is acquired.

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

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

[0037] Exemplarily, each cluster head node in the clustering network can periodically send a topology update message to a neighboring cluster head node, so that the cluster head can acquire complete topology information of all node connections within its coverage range and construct a visibility matrix.

[0038] Exemplarily, the period length of the periodic sending of the topology update message by the cluster head node can be determined according to network mobility characteristics. The shorter the period length, the higher the routing efficiency but the greater the control overhead, and the longer the period length, the smaller the control overhead, but it can lead to routing decisions based on outdated topology information.

[0039] Step S102: selecting a target routing strategy from the plurality of preset routing strategies based on the inter-node distance.

[0040] In the embodiments of the present application, the plurality of preset routing strategies at least include: intra-cluster double-hop routing, non-backbone relay routing, and backbone network routing.

[0041] For example, if the inter-node distance between the source node and the target node is within a preset first distance range, the intra-cluster double-hop routing is selected as the target routing strategy.

[0042] For example, if the inter-node distance between the source node and the target node is within a preset second distance range, the non-backbone relay routing is selected as the target routing strategy. The second distance range is greater than the first distance range.

[0043] For example, if the inter-node distance between the source node and the target node is within a preset third distance range, the non-backbone relay routing is selected as the target routing strategy. The third distance range is greater than the second distance range.

[0044] Step S103: performing communication between the target node and the source node by using the target routing strategy.

[0045] For example, the end-to-end path information between the source node and the target node is generated by using the target routing strategy, 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 of the cluster where the source node is located obtains the routing request of the source node, a suitable target routing strategy is selected from the plurality of preset routing strategies based on the inter-node distance between the source node and the target node, and the target routing strategy is used to perform communication between the target node and the source node. The data transmission efficiency and reliability between nodes can be improved, and the lifetime of the clustered network can be prolonged.

[0047] In some embodiments, the target node is located in the intra-cluster region of the cluster where the source node is located, and the intra-cluster double-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 another flowchart of a hybrid routing method based on the clustered network topology provided by the embodiments of the present application. As shown in Figure 2 , the method can include but is not limited to the following steps:

[0048] Step S201: determining that the routing request of the source node to the target node is obtained, and obtaining the inter-node 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 to obtain the routing request from the source node to the target node, and obtains the inter-node hop number between the source node and the target node.

[0050] In step S202, it is determined that the hop number between the source node and the target node is less than M, and the intra-cluster double-hop routing is selected 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] In step S203, it is determined that the target node is within the communication range of the cluster head node of the cluster where the source node is located, the shortest path algorithm is used to obtain the communication path between the target node and the source node, and the communication path is sent to the source node; or it is determined 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 the routing request is sent to the adjacent cluster head node.

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

[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, the cluster head node determines that the target node is a node contained in the own visibility matrix, and then uses the shortest path algorithm (for example, the Dijkstra shortest path algorithm) to calculate and obtain the communication path between the source node and the target node.

[0058] Exemplarily, the cluster head node determines that the target node is not a node contained in the own visibility matrix, and then forwards the routing request to the adjacent first cluster head node, so that the first cluster head node determines whether the source node is a node contained in the visibility matrix of the first cluster head node; if the source node is a node contained in the visibility matrix of the first cluster head node, the first cluster head node obtains the end-to-end path information between the source node and the target node, and returns the end-to-end path information to the source node; if the source node is not a node contained in the visibility matrix of the first cluster head node, 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 a second cluster head node containing the target node in the visibility matrix is found, and the second cluster head node obtains the end-to-end path information between the source node and the target node, and returns the end-to-end path information to the source node.

[0059] In some embodiments, the method further comprises: determining that the link interruption information sent by the target node is acquired, and replacing the abnormal node; determining that the abnormal node cannot be replaced, and acquiring a new communication path between the source node and the target node.

[0060] As an example, when the source node detects that the communication link with the target node is interrupted, the source node first requests a cluster head node of a cluster where the source node is located to replace a next hop node to modify only a single link in the path for path repair; when path repair is not feasible, full repair is performed, and the cluster head node of the cluster where the source node is located calculates a new path from the interruption point to the target node and notifies relevant nodes.

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

[0062] In some embodiments, nodes in the clustered network periodically detect neighbor states and maintain a node disable list, record the identifier of a detected failed node, a detection time, and a disable period, which are used to determine the freshness of a 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 network mobility, and in a high-mobility network, the value can be set to a small value (for example, 10 seconds). Whenever a node receives a topology update message containing a node in the disable list, the node checks whether the disable time of the node exceeds, and if the disable time exceeds, it is considered that the topology information contained in the update message is fresh, otherwise, the node discards the topology information related to the node, thereby 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 region of the cluster where the source node is located, an intra-cluster two-hop routing can be used to acquire a communication path between the source node and the target node. Thus, efficient intra-cluster routing is achieved.

[0065] In an implementation manner, the source node and the target node belong to different clusters but are at a moderate distance, and 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 is a flowchart of another hybrid routing method based on a clustered network topology provided by the embodiments of the present application. As shown in Figure 3 , the method can include but is not limited to the following steps:

[0066] Step S301: determining that a routing request of a source node to a target node is acquired, and acquiring an inter-node distance between the source node and the target node.

[0067] In the embodiments of the present application, step S301 can be implemented by any of the embodiments of the present application, and the embodiments of the present application do not limit this, and will not be repeated here.

[0068] Step S302: determining that the hop number between the source node and the target node is greater than or equal to M and less than N, and selecting a non-backbone relay routing 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 of information exchange.

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

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

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

[0074] For example, the cluster head node calculates two independent communication paths between the source node and the target node as the first communication path and the second communication path, and the two communication paths pass through different cluster heads and gateway nodes.

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

[0076] For example, 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 switches to the second communication path when detecting that the first communication path is invalid.

[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, the non-backbone relay routing strategy can be used 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. Thus, the communication reliability is improved and the routing reconstruction delay is reduced.

[0078] In one implementation, if the distance between the nodes of the source node and the target node is far, the backbone network routing strategy can be used for communication between the target node and the source node. As an example, please refer to Figure 4 , Figure 4 is another flowchart of a hybrid routing method based on a clustered network topology provided by the embodiments of the present application. As shown inFigure 3 The method can 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 acquired, and acquire an inter-node distance between the source node and the target node.

[0080] In the embodiments of the present application, step S401 can be implemented by any of the embodiments of the present application, and the embodiments of the present application do not limit this and will not be repeated.

[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 a backbone network routing as a target routing strategy.

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

[0083] In the embodiments of the present application, each node in the routing request forwarding process records the next hop information.

[0084] Illustratively, the routing request of the source node 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 the routing response back along the backbone network. Each forwarding node on the backbone network records the next hop information to form a distance vector in this process, and the source node receives the routing response and sends data to the target node through the backbone network based on the above distance vector.

[0085] In some embodiments, the above method can further include: when detecting that the routing is invalid, processing the routing error according to the standard AODV algorithm process, and retriggering the routing discovery process.

[0086] Illustratively, when the source node detects that the routing is invalid, the routing error is processed according to the standard AODV (Ad hoc On-Demand Distance Vector Routing, Wireless Ad Hoc Network On-Demand Flat Distance Vector Routing Protocol) algorithm process, and the routing discovery process is retriggered

[0087] By implementing the embodiments of the present application, when the inter-node distance between the source node and the target node is far, the routing request can be forwarded to the target cluster head node of the cluster where the target node is located by using the backbone network routing strategy, so that the target cluster head node returns the 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 this application, intermediate nodes participating in communication between the source node and the target node can only use cached routing for data forwarding and cannot be used to initiate new end-to-end communication.

[0089] Please see Figure 5 , Figure 5 This is a schematic diagram of a hybrid routing device based on a clustered network topology provided in an embodiment of this application. Figure 5 As shown, the device 500 includes: a first processing module 501, used to determine that a routing request from a source node to a target node has been obtained, and to obtain the inter-node distance between the source node and the target node; a second processing module 502, used to select a target routing strategy from multiple preset routing strategies based on the inter-node distance; wherein the multiple preset routing strategies include at least: intra-cluster two-hop routing, non-backbone relay routing, and backbone network routing; and a third processing module 503, used to perform communication between the target node and the source node using the target routing strategy.

[0090] In one implementation, the second processing module 502 can be used to: determine that the number of hops between the source node and the target node is less than M, and select an intra-cluster two-hop route as the target routing strategy; 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 a non-backbone relay route as the target routing strategy; or, determine that the number of hops between the source node and the target node is greater than or equal to N, and select a backbone network route as the target routing strategy, where M and N are positive integers, and M is less than N.

[0091] In one implementation, the third processing module 503 can be used 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 using a shortest path algorithm, and send the communication path to the source node; wherein 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 a routing request to a neighboring cluster head node; wherein the routing request is used to request a neighboring 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 can also be used to: determine that the link interruption information sent by the target node has been 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 an implementation, the target routing strategy is non-backbone relay routing, and the third processing module 503 can be configured to: acquire a first communication path and a second communication path between the target node and the source node; the first communication path contains different nodes from the second communication path; and send the first communication path and the second communication path to the source node.

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

[0095] Through the device, after the cluster head node of a cluster where the source node is located acquires the routing request of the source node, a suitable target routing strategy is selected from a plurality of preset routing strategies based on the distance between nodes between the source node and the target node, so that the target routing strategy is used for communication between the target node and the source node. The data transmission efficiency and reliability between nodes can be improved, and the life cycle of the clustered network can be prolonged.

[0096] It should be noted that the foregoing explanation and description of the embodiment of the mixed routing method based on the clustered network topology also applies to the embodiment of the mixed routing device based on the clustered network topology, which will not be repeated here.

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

[0098] To implement the above-mentioned embodiments, the present application further provides a computer readable storage medium, which stores computer execution instructions, and the computer execution instructions are executed by a processor to implement the method provided by the foregoing embodiments.

[0099] To implement the above-mentioned embodiments, the present application further provides a computer program product, which includes a computer program, and the computer program is executed by a processor to implement the method provided by the foregoing embodiments.

[0100] In the description of the present application, unless otherwise stated, " / " means the meaning of or, for example, A / B can mean A or B; "and / or" herein is only a description of the relationship between the associated objects, which means that there can be three relationships, for example, A and / or B, which can mean that A exists alone, A and B exist together, and B exists alone.

[0101] In the foregoing embodiment description, the description of the terms "one embodiment", "some embodiments", "an example", "a specific example", or "some examples" means 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 the present application. In the present specification, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in any one or more embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the specification and the features of the different embodiments or examples without contradiction.

[0102] In addition, the terms "first", "second" are only for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include at least one of the features. In the description of the present application, the meaning of "multiple" is at least two, for example, two, three, etc., unless otherwise specifically limited.

[0103] Any process or method descriptions in flow charts or otherwise described herein can be understood as representing code modules, segments, or portions of code that include one or more executable instructions for implementing the specified logic functions or processes, and the preferred embodiments of the present application include additional implementations in which the order of execution is different, in which the functions are performed in substantially simultaneous, in which the functions are performed at different times, or in which additional functions are performed, all of which are within the scope of the present application.

[0104] The logic and / or steps represented in the flowcharts and / or described herein, for example, can be considered as a sequence of instructions to implement logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, apparatus, or device, such as a computer-based system, processor- based system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For purposes of this specification, a "computer-readable medium" can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-readable medium can be a computer- readable storage medium or a computer-readable signal medium. The computer- readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include the following: an electrical connection having one or more wires (electrical connections), a portable computer diskette (a 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, and a portable compact disc read-only memory (CDROM). In addition, the computer-readable medium can even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, for example, via optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.

[0105] It should be understood that aspects of the application can be implemented in hardware, software, firmware or combinations thereof. In the above embodiments, various steps or methods can be implemented in software or firmware that is stored in memory and executed by a suitable instruction execution system. As such, in some embodiments, specifically configured hardware can be used to implement at least some of the functionality described herein. For example, if implemented in hardware, the hardware can include any or a combination of the following: a discrete logic circuit having logic gates for implementing logic functions upon data signals, an application specific integrated circuit having appropriate combinational logic gates, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0106] Those of skill in the art would understand that information and signals can be represented using any of a variety of technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that can be referenced throughout the above description can be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0107] In addition, each of the functional units in the various embodiments of the present application can be integrated in one processing module, or each of the units can be physically present separately, or two or more units can be integrated in one module. The integrated module can 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 can also be stored in a computer readable storage medium.

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

Claims

1. A hybrid routing method based on clustered network topology, characterized in that, The method includes: Determine if 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. The target routing strategy is selected from multiple preset routing strategies based on the distance between nodes; wherein, the multiple preset routing strategies include at least: intra-cluster two-hop routing, non-backbone relay routing, and backbone network routing; The target routing strategy is used for communication between the target node and the source node; The step of selecting a target routing strategy from multiple preset routing strategies based on the distance between nodes includes: If the hop count between the source node and the target node is determined to be less than M, the intra-cluster two-hop route is selected as the target routing strategy; or... If the hop count between the source node and the target node is greater than or equal to M and less than N, then the non-backbone relay route is selected as the target routing policy; or... If the number of hops between the source node and the target node is greater than or equal to N, the backbone network route is selected as the target routing policy, where M and N are positive integers and M is less than N.

2. The method as described in claim 1, characterized in that, The target routing strategy is the intra-cluster two-hop routing, and the communication between the target node and the source node using the target routing strategy includes: Determine that the target node is within the communication range of the cluster head node of the cluster where the source node resides, use a 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 communication between the source node and the target node; or, If it is determined that the target node is not within the communication range of the cluster head node of the cluster where the source node is located, the routing request is sent to the neighboring cluster head node; wherein, the routing request is used to request the neighboring node to obtain the communication path between the target node and the source node, and send the communication path to the source node.

3. The method as described in claim 2, characterized in that, The method further includes: Once the link interruption information sent by the target node is confirmed, the abnormal node is replaced. If it is determined that the abnormal node cannot be replaced, a new communication path is obtained between the source node and the target node.

4. The method as described in claim 1, characterized in that, The target routing policy is the non-backbone relay route, and the communication between the target node and the source node using the target routing policy 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; The first communication path and the second communication path are sent to the source node.

5. The method as described in claim 1, characterized in that, The target routing policy is the backbone network routing, and the step of using the target routing policy for communication between the target node and the source node includes: The routing request is forwarded 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 through which the routing request passes during the forwarding process records the next hop information.

6. A hybrid routing device based on clustered network topology, characterized in that, The device includes: The first processing module is used to determine that a routing request from the source node to the target node has been obtained, and to obtain the inter-node distance between the source node and the target node; The second processing module is used to select a target routing strategy from multiple preset routing strategies based on the distance between nodes; wherein the multiple preset routing strategies include at least: intra-cluster two-hop routing, non-backbone relay routing, and backbone network routing; The third processing module is used to perform communication between the target node and the source node using the target routing strategy; The second processing module is specifically used for: If the hop count between the source node and the target node is determined to be less than M, the intra-cluster two-hop route is selected as the target routing strategy; or... If the hop count between the source node and the target node is greater than or equal to M and less than N, then the non-backbone relay route is selected as the target routing policy; or... If the number of hops between the source node and the target node is greater than or equal to N, the backbone network route is selected as the target routing policy, where M and N are positive integers and M is less than N.

7. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1 to 5.

9. A computer program product, characterized in that, It includes a computer program that, when executed by a processor, implements the method as described in any one of claims 1 to 5.

Images