[go: up one dir, main page]

WO2018176946A1 - Procédé et appareil de sélection d'itinéraire - Google Patents

Procédé et appareil de sélection d'itinéraire Download PDF

Info

Publication number
WO2018176946A1
WO2018176946A1 PCT/CN2017/119050 CN2017119050W WO2018176946A1 WO 2018176946 A1 WO2018176946 A1 WO 2018176946A1 CN 2017119050 W CN2017119050 W CN 2017119050W WO 2018176946 A1 WO2018176946 A1 WO 2018176946A1
Authority
WO
WIPO (PCT)
Prior art keywords
route
intermediate node
nmc
score
routes
Prior art date
Application number
PCT/CN2017/119050
Other languages
English (en)
Chinese (zh)
Inventor
林栋�
邓榤生
韩泽宇
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2018176946A1 publication Critical patent/WO2018176946A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality

Definitions

  • the present application relates to the field of communications, and in particular, to a routing method and apparatus.
  • Wireless Mesh network also known as wireless mesh network or wireless mesh network, combines the advantages of Wireless Local Area Network (WLAN) technology and AdHoc network. It is a network with large capacity, high speed and wide coverage.
  • Wireless Mesh networks are low-power multi-hop multihop systems that process messages by passing packets from one node to another until the packet reaches its destination.
  • the nodes of each wireless Mesh network can serve as access terminals, and can also have routing and information forwarding functions, and have extremely high networking degrees of freedom.
  • a wireless mesh network provides multiple redundant routes from a source node to a destination node. If a node on a route stops working due to hardware failure or interference, the mesh automatically changes the routing of the packets and passes them through an alternate route.
  • the route from the source node to the target node can be selected through Open Shortest Path First (OSPF).
  • OSPF Open Shortest Path First
  • the source node has five routes to the target node, and the route with the shortest path is selected from the five routes as the target route, and the source node and the target node communicate through the target route.
  • the embodiment of the present application provides a routing method and device, which are used to select a target route in combination with the ability of a route to resist failure, thereby improving communication reliability.
  • the embodiment of the present application provides a routing method, including acquiring at least two routes from a source node to a target node, and acquiring a micro-structure count NMC score of an intermediate node in at least two routes; wherein, the intermediate node The NMC score is obtained according to the number of polygons constructed by the intermediate node; wherein the intermediate node is a vertex of the polygon constructed by the intermediate node; according to the NMC score of the intermediate node in at least two routes, from at least two A destination route is selected in the route.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • the NMC score of the intermediate node is obtained according to the number of M-type polygons constructed by the intermediate node; wherein, M is an integer greater than or equal to 1, and if M is greater than or equal to 2, any two of the M-type polygons Class polygons have different numbers of sides.
  • M is an integer greater than or equal to 1
  • M is greater than or equal to 2
  • any two of the M-type polygons Class polygons have different numbers of sides.
  • the NMC score of the intermediate node is: performing weighting calculation on the number of each type of polygon in the M-type polygon constructed by the intermediate node according to the weight corresponding to each type of polygon in the M-type polygon; wherein The NMC score of the intermediate node is used to indicate: the fault repair capability of the intermediate node.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • selecting a target route from the at least two routes according to the NMC score of the intermediate node in the at least two routes including: determining, according to the NMC score of the intermediate node in the at least two routes, at least two The NMC score of the route in the route; wherein the NMC score of the route is used to indicate the fault repair capability of the route; according to the NMC score of the route in at least two routes, the route with the strongest fault repair capability indicated The route corresponding to the NMC score is determined as the target route.
  • determining, according to the NMC score of the intermediate node in the at least two routes, the NMC score of the route in the at least two routes including the following manner: repairing the fault indicated in the route in the at least two routes.
  • the NMC score of the weakest intermediate node is determined as the NMC score of the route; the intermediate node NMC score in the route of at least two routes is mathematically calculated, and the result of the mathematical calculation is determined as the NMC score of the route.
  • the NMC scores of the intermediate nodes in the at least two routes are obtained, and the NMC scores reported by each of the at least two routes are obtained by using a flooding or periodic information exchange mechanism.
  • the NMC score of the intermediate node may be obtained by receiving the NMC score reported by each of the at least two routes, or calculating the route of each of the at least two routes by directly calculating. The NMC score for each intermediate node in .
  • obtaining at least two routes from the source node to the target node, and acquiring NMC scores of the intermediate nodes in the at least two routes including: a broadcast routing request; wherein the routing request includes an identifier of the target node; and receiving the target The route response corresponding to the route request returned by the node, where the route response includes: at least two routes from the source node to the target node, and an NMC score of the intermediate node in the at least two routes.
  • the scheme can be performed by a routing device disposed on the source node.
  • the embodiment of the present application provides a routing method, including: performing, for an intermediate node of at least two routes from a source node to a target node, determining, according to network topology information of the intermediate node, a polygon constructed by the intermediate node. The number of the vertices of the polygon constructed by the intermediate node; determining the NMC score of the microstructure of the intermediate node according to the number of polygons constructed by the intermediate node; reporting the NMC score of the intermediate node; The NMC score of the intermediate node in the at least two routes is used to: select a target route from the at least two routes according to the NMC score of the intermediate node in the at least two routes.
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • determining the number of polygons constructed by the intermediate node according to the network topology information of the intermediate node including: determining, according to network topology information of the intermediate node, the number of M types of polygons constructed by the intermediate node; wherein, M is greater than An integer equal to 1, and if M is greater than or equal to 2, the number of sides of any two types of polygons in the M-type polygon is different; determining the NMC score of the intermediate node according to the number of polygons constructed by the intermediate node, including: according to the middle The number of M-type polygons constructed by the node determines the NMC score of the intermediate node. In this way, the M-type polygon can be reasonably set according to the actual situation and the specific application scenario, so that the NMC score more accurately reflects the fault repair capability of the intermediate node.
  • determining the NMC score of the intermediate node according to the number of M types of polygons constructed by the intermediate node includes: determining a weight corresponding to each type of polygon in the M type polygon; and according to weights corresponding to each type of polygon in the M type polygon, Weighting the number of each type of polygon in the M-type polygon constructed by the intermediate node; determining the result of weighting the number of each type of polygon in the M-type polygon constructed by the intermediate node as the NMC score of the intermediate node .
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the NMC scores of the intermediate nodes in the at least two routes are obtained, and the NMC scores reported by each of the at least two routes are obtained by using a flooding or periodic information exchange mechanism.
  • the NMC score of the intermediate node may be obtained by receiving the NMC score reported by each of the at least two routes, or calculating the route of each of the at least two routes by directly calculating. The NMC score for each intermediate node in .
  • the reporting the NMC score of the intermediate node includes: receiving a routing request; wherein the routing request includes an identifier of the target node; and determining, according to the identifier of the routing request, the identifier of the intermediate node after determining that the routing request is received for the first time
  • the NMC score is added to the routing record of the routing request, and the routing request with the identifier of the intermediate node and the NMC score is forwarded.
  • the scheme can be performed by a routing device disposed on the intermediate node.
  • the embodiment of the present application provides a routing device, where the routing device includes a memory, a transceiver, and a processor, where: the memory is used to store program instructions; the processor is configured to execute and send and receive according to program instructions for executing memory storage.
  • the device performs signal reception and signal transmission, and when the processor executes the program instruction stored in the memory, the routing device is configured to perform the method of any of the above first aspect or the first aspect.
  • an embodiment of the present application provides a routing device, where the routing device includes a memory, a transceiver, and a processor, where: the memory is used to store program instructions; the processor is configured to execute, according to a program instruction for executing the memory, and control the sending and receiving.
  • the device performs signal reception and signal transmission, and when the processor executes the program instruction stored in the memory, the routing device is configured to perform the method of any of the above second aspect or the second aspect.
  • the embodiment of the present application provides a routing device, which is used to implement any one of the foregoing first aspect or the first aspect, and includes a corresponding functional module, which is used to implement the steps in the foregoing method.
  • the embodiment of the present application provides a routing apparatus, which is used to implement the method of any one of the foregoing second aspect or the second aspect, and includes a corresponding functional module, which is used to implement the steps in the foregoing method.
  • an embodiment of the present application provides a computer storage medium, where a computer storage medium stores program instructions, when executed on a computer, causing the computer to perform the first aspect or any possible implementation manner of the first aspect. method.
  • an embodiment of the present application provides a computer storage medium, where a computer storage medium stores program instructions, and when executed on a computer, causes the computer to perform the second aspect or any possible implementation manner of the second aspect. method.
  • the embodiment of the present application provides a computer program product comprising program instructions, when executed on a computer, causing the computer to perform the method in the first aspect or any possible implementation manner of the first aspect.
  • the embodiment of the present application provides a computer program product comprising program instructions, when executed on a computer, causing the computer to perform the method in any of the possible implementations of the second aspect or the second aspect.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • FIG. 1 is a schematic structural diagram of a communication system to which an embodiment of the present application is applied;
  • 1a is a schematic structural diagram of another communication system to which the embodiment of the present application is applied;
  • FIG. 2 is a schematic flowchart of a routing method according to an embodiment of the present application.
  • FIG. 2a is a schematic diagram of two phase transitions of path expansion in a route repair process according to an embodiment of the present application
  • 2b is a schematic structural diagram of a system of routing according to an embodiment of the present application.
  • 2c is a schematic structural view of a triangle constructed by the intermediate node 122 of FIG. 2b;
  • 2d is a schematic structural view of a quadrangle constructed by the intermediate node 122 of FIG. 2b;
  • 2 e is a schematic flowchart of a method for enabling a first routing device to acquire an NMC score of each intermediate node according to an embodiment of the present application
  • FIG. 3 is a schematic structural diagram of a routing apparatus according to an embodiment of the present disclosure.
  • FIG. 4 is a schematic structural diagram of a routing apparatus according to an embodiment of the present disclosure.
  • FIG. 5 is a schematic structural diagram of a routing apparatus according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of a routing apparatus according to an embodiment of the present disclosure.
  • the embodiments of the present application are applicable to wired or wireless networks, such as wireless Mesh networks that combine the advantages of WLAN and AdHoc networks.
  • Wireless Mesh networks are low-power multi-level hopping systems that process messages by passing packets from one node to another until the packet reaches its destination.
  • the nodes of each wireless Mesh network can serve as access terminals, and can also have routing and information forwarding functions, and have extremely high networking degrees of freedom.
  • the source node, the target node, and the intermediate node in the embodiment of the present application are all nodes in the network to which the embodiment of the present application applies, and each of the source node, the target node, and the intermediate node has a routing and information forwarding function.
  • two parties of data transmission are respectively referred to as a source node and a target node, and a node through which a route between the source node and the target node passes is referred to as an intermediate node.
  • the solution in the embodiment of the present application provides a routing scheme between the source node and the target node, and the source node may send data to the target node by using the selected route, and accordingly, the target node may also send the route to the source node by using the selected route. data.
  • the source node and the target node defined in the embodiment of the present application may also become intermediate nodes in other data transmission schemes, and the intermediate node may also become a source node or a target node in other data transmission schemes.
  • FIG. 1 is a schematic diagram showing a structure of a communication system to which the embodiment of the present application is applied.
  • the source node 101 and the target node 102 are connected by a route including an intermediate node 111, an intermediate node 112, and Intermediate node 113.
  • the routing device provided in the embodiment of the present application may include two parts, which may be respectively referred to as a first routing device and a second routing device, and the first routing device is configured to count the microstructures of each intermediate node according to the route ( The Node Motif Count (NMC) scores the target routing.
  • the second routing device can be used to calculate the NMC score of each intermediate node, and report the calculated NMC score to the first routing device.
  • NMC Node Motif Count
  • an alternative deployment scenario is to deploy the first routing device on the source node 101 and the second routing device on each intermediate node.
  • Another alternative deployment scenario is to deploy the first routing device on the target node 102 and the second routing device on each intermediate node.
  • the first routing device and the second routing device are deployed on each of the source node, the target node, and the intermediate node, and the first route on the source node 101 and the target node 102 is routed.
  • the selection means executes, which is performed by the second routing means on each intermediate node when calculating the NMC score for each intermediate node.
  • FIG. 1a is a schematic diagram showing another architecture of a communication system to which the embodiment of the present application is applied.
  • the source node 101 and the target node 102 are connected by a route, and the route includes an intermediate node 111 and an intermediate node 112. And intermediate node 113.
  • the source node 101, the target node 102, and each intermediate node are all connected to the routing device 141.
  • the routing device 141 calculates the NMC score of each intermediate node, and then selects the destination route according to the NMC score, and sends the target route to the destination route.
  • Source node 101 and target node 102 are calculated by the NMC score of each intermediate node, and then selects the destination route according to the NMC score, and sends the target route to the destination route.
  • the solution provided by the embodiment of the present application is performed by the routing device, and the routing device may be the routing device 141 shown in FIG. 1a, or may be the device including the first routing device and the second routing device in FIG. .
  • the following description is separately described by the first routing device and the second routing device, but any of the following method steps may be performed by any one of the first routing device and the second routing device, the first routing device And the second routing device may be respectively deployed on different nodes or different devices, or may be integrated on one device, for example, the first routing device and the second routing device are integrated on the routing device 141 shown in FIG. 1a. .
  • the source node 101 and the target node 102 may have multiple redundant routes. If a route stops working due to hardware failure or interference, the network automatically changes the routing of the packets, passing them through an alternate path.
  • the embodiment of the present application provides a solution for selecting a route with high reliability and strong resistance against faults from multiple redundant routes of a source node and a target node.
  • FIG. 2 is a schematic flowchart diagram of a routing method provided by an embodiment of the present application.
  • a routing method implemented by the routing apparatus provided by the embodiment of the present application is provided. As shown in Figure 2, the method includes:
  • Step 201 The routing device acquires at least two routes from the source node to the target node, and obtains an NMC score of the intermediate node in the at least two routes.
  • the NMC score of the intermediate node is a polygon constructed according to the intermediate node. The number obtained; wherein the intermediate node is a vertex of a polygon constructed by the intermediate node;
  • Step 202 The routing device selects a target route from the at least two routes according to the NMC score of the intermediate node in the at least two routes.
  • the routing device in the foregoing steps 201 and 202 may be the routing device 141 in the foregoing FIG. 1a, or may be the first routing device and the second routing device in the foregoing content.
  • the routing device determines, according to the network topology information of the intermediate node, the intermediate node in the at least two routes from the source node to the target node.
  • the number of polygons constructed by the node determining the NMC score of the intermediate node according to the number of polygons constructed according to the intermediate node; selecting one of the at least two routes according to the NMC score of the intermediate node in the at least two routes Target routing.
  • the second routing device is configured for the intermediate node of the at least two routes from the source node to the target node, according to the intermediate node.
  • the network topology information determines the number of polygons constructed by the intermediate node; determines the NMC score of the intermediate node according to the number of polygons constructed by the intermediate node; reports the NMC score of the intermediate node; wherein the intermediate node is the The vertices of the polygons constructed by the intermediate nodes; the NMC scores of the intermediate nodes in the at least two routes are used to: select a target route from the at least two routes according to the NMC score of the intermediate nodes in the at least two routes.
  • the first routing device acquires at least two routes from the source node to the target node, and obtains an NMC score of the intermediate node in the at least two routes; wherein the NMC score of the intermediate node is constructed according to the intermediate node The number of polygons obtained; wherein the intermediate node is a vertex of the polygon constructed by the intermediate node; the first routing device selects one of the at least two routes according to the NMC score of the intermediate node in the at least two routes Target routing.
  • any of the above method steps may be performed by the first routing device or the second routing device, and the above merely exemplarily shows a division scheme of the first routing device and the second routing device.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the polygon defined in the embodiment of the present application may include a closed figure having more sides than two sides, such as a triangle, a quadrangle, a pentagon, a hexagon, and the like.
  • a node (such as an intermediate node) participates in a constructed polygon, and a link between two nodes connected by wireless or wired is referred to as an edge in a polygon, and each node is referred to as a vertex in the polygon.
  • route rerouting exposure path expansion
  • D new refers to the path length (or routing cost) of the repaired new route
  • D old refers to the path length (or routing cost) of the old route before the repair.
  • FIG. 2a is a schematic diagram showing two phase transitions of path expansion in a route repair process provided by an embodiment of the present application.
  • curves under different topology types are slightly different, but both are worn. After saturation, it quickly saturates "two phase transitions. In a random network, this phenomenon can be mathematically proven.
  • the horizontal axis "reroute path expansion hop count” relative to the vertical axis "route repair (reroute) successful cumulative probability” diagram, you can clearly see the two times after the penetration quickly saturated Phase change. Its physical interpretation and significance is that in such a network, if there is an open circuit, there is a great possibility to implement an end-to-end route repair given a small number of expanded route hops.
  • the embodiment of the present application can evaluate the repair capability of the node after the fault according to the number of polygons that the node constructs in a small range. Therefore, the number of sides of the polygon may not be too large, such as a fifteen-sided shape.
  • the polygon in the embodiment of the present application for example, a triangle or a quadrilateral, can satisfy the requirement.
  • the intermediate node calculates the NMC score.
  • the complexity of the value also increases the rate at which the NMC score is calculated.
  • the embodiment of the present application also considers a scheme of repairing a route in a small range as much as possible, and avoids the problem that the repaired route delay is too long after the repaired route is excessively bypassed, that is, the route repairing capability of the selected target route is adopted. A comprehensive consideration has been made between the delay of the repaired route and the delay.
  • the embodiment of the present application further includes a repair count value, for each intermediate node in the target route, if the intermediate node determines a route fault between the intermediate node and the next hop intermediate node in the target route, and When it is determined that the repair count value is not greater than the threshold, a route repair is performed and the repair count value is incremented by one.
  • Performing a route repair specifically means that the intermediate node selects another alternate path to reach the next hop intermediate node of the target route. If the intermediate node determines a route fault between the intermediate node and the next hop intermediate node in the target route, and determines that the repair count count value is greater than the threshold, the route repair is not performed.
  • the repair count value and the route may be attached to the packet header portion of the data packet, forwarded along the routing path, and modified along the way when modification is required.
  • the combination of route and forwarding can be implemented. In the case of a link-level route interruption, the forwarding is not interrupted, and the route at the service level is not interrupted.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In the embodiment of the present application, it can be determined that the fault repair capability of the route in the two equal-cost routes is higher.
  • the first route and the second route are equivalent to the at least two routes, where the first route and the second route are any two routes of the at least two routes; the first route and the second route are equivalently specific
  • the first route and the second route may meet the preset condition, and the preset condition may include multiple types, such as the following first case to the fifth case:
  • the number of hops between nodes included in the first route is the same as the number of hops between nodes included in the second route.
  • the number of hops between nodes included in the route refers specifically to the number of hops in the route that the data needs to jump between the nodes.
  • the number of hops between nodes included in the route may be the same as the number of intermediate nodes included in the route. For example, if the route includes three intermediate nodes, the route may include 4 hops, but may also include 5 hops, 6 Jump and so on.
  • the first route and the second route are equivalently the same.
  • the number of intermediate nodes included in the first route is the same as the number of intermediate nodes included in the second route.
  • the transmission delay of the first route is the same as the transmission delay included in the second route.
  • the transmission delay of the first route specifically refers to the time required for data to be transmitted from the source node to the destination node along the first route; or the time required for data to be transmitted from the target node to the source node along the first route.
  • the transmission delay of the second route specifically refers to the time required for data to be transmitted from the source node to the destination node along the second route; or the time required for data to be transmitted from the target node to the source node along the second route.
  • the number of hops between the nodes included in the first route may be different or the same as the number of hops between the nodes included in the second route.
  • a scheme is provided optionally for calculating the transmission delay of a route, each router maintains a distance vector (usually a delay is a variable) table, and then advertises the distance by a distance vector between adjacent nodes.
  • the update of the vector table may be advertised between nodes by periodic or event-triggered forms, such as delay between the node and the neighboring node, link state information, and the like.
  • the distance vector table may include a delay between nodes, and the delay of a route may be calculated based on the distance vector table.
  • the sum of the weights of the links included in the first route is the same as the sum of the weights of the links included in the second route.
  • the link included in each of the first route and the second route specifically refers to a link between any two nodes on the first route, and each link corresponds to one weight.
  • the weight of the link may be related to delay, maximum bandwidth, delay jitter, unit bandwidth price, and so on.
  • the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route.
  • Each intermediate node included in each of the first route and the second route corresponds to one weight.
  • the weight corresponding to the intermediate node may be related to the maximum processing power of the intermediate node, the current load level, and the like.
  • the intermediate node can be a router.
  • the sum of the weight of the link included in the first route and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • FIG. 2b is a schematic diagram showing a system architecture of a route provided by an embodiment of the present application.
  • the source node 101 and the target node 102 include multiple redundant routes, such as:
  • Route A source node 101, intermediate node 111, intermediate node 112, intermediate node 113, and target node 102;
  • Route B source node 101, intermediate node 121, intermediate node 122, intermediate node 123, and target node 102;
  • Route C source node 101, intermediate node 131, intermediate node 132, and target node 102.
  • the source node 101 and the target node 102 further include other routes, such as the route D, including: the source node 101, the intermediate node 121, the intermediate node 151, the intermediate node 122, the intermediate node 123, and the target node 102;
  • the route E includes: the source node 101, the intermediate node including the intermediate node 121, the intermediate node 152, the intermediate node 123, and the target node 102.
  • the route that can connect the source node 101 to the target node 102 also includes others, and details are not described herein again.
  • the route-equivalent preset condition in the embodiment of the present application is the foregoing second case, and if the transmission delays of the route A and the route B are the same, and the transmission delays of the route A and the route B are It is the two routes with the smallest transmission delay among all the routes between the source node 101 and the target node 102.
  • the route with the smallest transmission delay can be selected as the target route, and the route with the strong transmission delay can be selected as the target route in the route with the smallest transmission delay.
  • the embodiment of the present application is applicable to multiple networks, such as a random network and a power rate network, where the network topology in the WMN belongs to a typical random network, and the topology in the inter-domain routing scenario belongs to a typical power rate network.
  • some polygons for calculating the NMC score may be predefined, and the polygons used by each intermediate node to calculate the NMC score are specifically notified, and may be notified by broadcast or one-by-one notification.
  • Each of the nodes in the network in the embodiment of the present application includes an intermediate node, a source node, and a target node.
  • the method for calculating the NMC score is the same for each node.
  • an intermediate node calculates the NMC score as The example is introduced.
  • the number of polygons constructed by the intermediate nodes is determined according to the network topology information, and the intermediate nodes are the vertices of the polygons constructed by the intermediate nodes.
  • the description is based on FIG. 2b, taking the intermediate node 122 in FIG. 2b as an example.
  • FIG. 2c exemplarily shows the structural diagram of the triangle formed by the intermediate node 122 in FIG. 2b
  • FIG. 2d exemplarily shows the figure. Schematic diagram of the quadrilateral constructed by the intermediate node 122 in 2b.
  • the intermediate node 122 constructs four triangles, which are a triangle composed of an intermediate node 122, an intermediate node 121, and an intermediate node 151; and an intermediate node 122, an intermediate node 151, and an intermediate node 123.
  • the intermediate node 122 constructs four quadrilaterals, which are a quadrangle composed of an intermediate node 122, an intermediate node 152, an intermediate node 121, and an intermediate node 151; an intermediate node 122, an intermediate node 152, an intermediate node 123, and an intermediate node.
  • a node (such as an intermediate node) participates in a constructed polygon, and a link between two nodes connected by wireless or wired is referred to as an edge in a polygon, and each node is referred to as a vertex in the polygon.
  • the number of triangles and quadrilaterals constructed by the intermediate node 122 is calculated in the above, with four triangles and four quadrilaterals.
  • the trigonometry and the quadrilateral constructed by the intermediate node 121 are respectively: a triangle formed by the intermediate node 121, the intermediate node 151, and the intermediate node 122; the intermediate node 121, the intermediate node 152, and the intermediate node 122 A triangle formed by the intermediate node 121, the intermediate node 152, the intermediate node 122, and the intermediate node 151. It can be seen that the intermediate node 121 constructs two triangles and one quad.
  • N is an integer, and N is greater than or equal to half the number of sides of a type of polygon having the largest number of sides in the defined polygon. For example, if the type of polygon with the largest number of edges in the M-type polygon is a hexagon, then N can be 3, that is, the network topology within the three-hop range of the intermediate node can be known.
  • the solution for obtaining the network topology of the intermediate node is obtained by broadcasting, for example, by knowing, by the intermediate node itself, flooding the N-hop topology of the neighboring area, and notifying the second routing device, if the second routing device is used. If the second routing device is directly deployed on the intermediate node, the second routing device can also query the N-hop topology around the intermediate node deployed by itself.
  • the predefined polygons may include M-type polygons, and any two types of polygons in the M-type polygon have different numbers of sides.
  • the M-type polygon includes only one type of polygon with the same number of sides, such as a triangle; when M is two, the M-type polygon may include two types of polygons with different sides, such as a triangle and a quadrangle.
  • the NMC score of the intermediate node is obtained according to the number of M-type polygons constructed by the intermediate node; if M is an integer greater than or equal to 1, and if M is greater than or equal to 2, any two of the M-type polygons The number of sides of the polygon is different. In this way, the M-type polygon can be reasonably set according to the actual situation and the specific application scenario, so that the NMC score more accurately reflects the fault repair capability of the intermediate node.
  • determining the number of polygons constructed by the intermediate node according to the network topology information of the intermediate node, the second routing device determining, according to the network topology information of the intermediate node, the M class constructed by the intermediate node The number of polygons; where M is an integer greater than or equal to 1, and if M is greater than or equal to 2, the number of sides of any two types of polygons in the M-type polygon is different; and the number of polygons constructed by the second routing device according to the intermediate node, Determining the NMC score of the intermediate node includes: determining an NMC score of the intermediate node according to the number of M-type polygons constructed by the intermediate node.
  • this embodiment can also be implemented by a first routing device.
  • the NMC score of the intermediate node is determined by various calculation schemes, such as directly taking the sum of the number of M types of polygons as the NMC score of the intermediate node, or presetting some formulas, such as by a formula (log (NMC triangle + NMC quadrilateral ))
  • the NMC score of the intermediate node is calculated, wherein the NMC triangle is the number of triangles constructed by the intermediate node, and the NMC quadrilateral is the number of quadrilaterals constructed by the intermediate node.
  • the NMC score of the intermediate node is: performing weighting calculation on the number of each type of polygon in the M-type polygon constructed by the intermediate node according to the weight corresponding to each type of polygon in the M-type polygon; wherein The NMC score of the intermediate node is used to indicate: the fault repair capability of the intermediate node.
  • determining the NMC score of the intermediate node according to the number of M-type polygons constructed by the intermediate node includes: determining, by the second routing device, a weight corresponding to each type of polygon in the M-type polygon; The routing device performs weighting calculation on the number of each type of polygon in the M-type polygon constructed by the intermediate node according to the weight corresponding to each type of polygon in the M-type polygon; the second routing device constructs the M-type polygon in the intermediate node The result of the weighted calculation of each type of polygon is determined as the NMC score of the intermediate node.
  • this embodiment can also be implemented by a first routing device.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the weighting calculation in the above solution specifically refers to mathematically calculating the number of each type of polygon constructed by the intermediate node according to a preset formula and a weight corresponding to each type of polygon in the M-type polygon.
  • weights corresponding to each type of polygon in the M-type polygon are multiplied by the number of such polygons, and the obtained M products are added, multiplied or subtracted, or other mathematical operations are performed.
  • the result obtained is the NMC score of the intermediate node.
  • the number of each type of polygon in the M-type polygon is reciprocal and then summed, and the obtained result is the NMC score of the intermediate node.
  • the result is the NMC score of the intermediate node.
  • the minimum value of the number of M-type polygons is taken, and the minimum number of polygons is used as the NMC score of the intermediate node.
  • other M-1 classes other than the smallest type of polygons may be used.
  • the weight corresponding to the number of polygons is set to zero, and the weight of the number of polygons corresponding to the smallest number is set to 1.
  • the NMC score of the route is used to indicate the fault repair capability of the route.
  • the NMC score of the intermediate node is obtained by adding the number of polygons constructed by the intermediate node, or weighted and added, and the intermediate node is obtained. The higher the NMC score is, the stronger the fault repair capability of the intermediate node is; or the NMC score of the intermediate node is obtained by adding the reciprocal of the number of polygons constructed by the intermediate node, and the NMC score of the intermediate node is higher.
  • the fault repair capability of the intermediate node is weaker.
  • selecting a target route from the at least two routes according to the NMC score of the intermediate node in the at least two routes including: the first routing device according to the NMC score of the intermediate node in the at least two routes Determining the NMC score of the route in the at least two routes; wherein the NMC score of the route is used to indicate the fault repair capability of the route; the first routing device according to the NMC score of the route in the at least two routes, The route corresponding to the NMC score of the indicated route with the strongest fault repair capability is determined as the target route.
  • this embodiment can also be implemented by a second routing device.
  • determining, according to the NMC score of the intermediate node in the at least two routes, the NMC score of the route in the at least two routes including multiple manners.
  • the first method and the second method in the following content.
  • the first routing device determines, as the NMC score of the route, the NMC score of the intermediate node with the weakest fault repair capability indicated in the route in the at least two routes. For example, if the NMC score is larger, the fault repair capability is stronger; if the NMC score is smaller, the fault repair capability is weaker. Then, the NMC score of the smallest intermediate node in each route is determined as the NMC score of the route.
  • the first routing device determines the route corresponding to the NMC score of the route with the strongest fault repair capability as the target route according to the NMC score of the route in the at least two routes.
  • the scores of the intermediate nodes on the two routes are (route F: 3, 5, 6, 3, 2, 1), (route G: 2, 2, 2, 3, 2, 2).
  • the NMC score on route F is the lowest, and the NMC score on route G is the lowest. Therefore, the route of route F has an NMC score of 1, and the route of route G has an NMC score of 2, because route G is routed.
  • the NMC score is greater than the NMC score of the route of the route F.
  • the larger the NMC score of the route is the stronger the fault repair capability of the route is. Therefore, the route G is selected as the target route.
  • This equal-cost routing strategy can make "in the case of any link failure, more than 98% of end-to-end routes can be recovered, and the cost is less than 2 hops.
  • the first routing device performs a mathematical calculation on the intermediate node NMC in the route of at least two routes, and determines the result of the mathematical calculation as the NMC score of the route.
  • an average value of the NMC scores of the intermediate nodes of each route is calculated, and then mathematical calculation is performed, and the average value of the intermediate node NMC scores on the route is determined as the NMC score of the route.
  • the first routing device determines the route corresponding to the NMC score of the route with the strongest fault repair capability as the target route according to the NMC score of the route in the at least two routes.
  • the scores of the intermediate nodes on the two routes are (routes H: 0.61, 0.67, 0.65, 0.7, 0.6, 0.8), respectively (routes I: 0.65, 0.67, 0.7, 0.8, 0.65, 0.65).
  • the NMC score of the route on the route H is the average of the NMC scores of the intermediate nodes, which is 0.6717.
  • the NMC score on the route I is the average value of the NMC scores of the intermediate nodes, which is 0.6867.
  • the NMC score of the route is greater than the NMC score of the route of route H.
  • route I is selected as the target route.
  • the experimental results show that this equal-cost routing strategy can make "in the case of any link failure, more than 90% of end-to-end routes can be recovered, and the cost is less than 3 hops.
  • the first routing device if the first routing device is deployed at the source node, the second routing device is deployed at the intermediate node; or the first routing device is deployed in the routing device 141 as shown in FIG. 1a, Selecting the NMC scores of the intermediate nodes in the at least two routes, including: the first routing device acquires the NMC reported by each intermediate node in each of the at least two routes by using a flooding or periodic information exchange mechanism. Score. That is, in one embodiment, the NMC score for each intermediate node can be calculated by each intermediate node and then reported to the first routing device. Or the NMC score of each intermediate node may also be calculated by the first routing device or the second routing device or the routing device 141 as shown in Figure 1a.
  • the NMC score reported by each intermediate node in each of the at least two routes is obtained by flooding.
  • Flooding does not require maintaining the topology of the network and related routing calculations. It only requires that the node receiving the information forwards the packet in a broadcast manner.
  • the source node wants to send a piece of data to the target node.
  • the source node first transmits a copy of the data to each of its neighbor nodes over the network, and each neighbor node transmits the data to the respective node other than the node from which the data was sent. This continues until the data is transferred to the target node or the data set lifetime (TTL) is zero. It can be seen that the NMC score of each intermediate node can be obtained through the scheme.
  • the NMC score reported by each intermediate node in each of the at least two routes is obtained by using a periodic information exchange mechanism.
  • the periodic information exchange mechanism can periodically broadcast its own NMC scores for the intermediate nodes, and so on.
  • FIG. 2e exemplarily shows a schematic flowchart of a method for the first routing device to obtain the NMC score of each intermediate node, as shown in FIG. 2 e.
  • the method includes:
  • Step 251 The first routing device broadcasts a routing request.
  • the routing request includes an identifier of the target node.
  • the first routing device can be deployed to the source node, and the source node can first broadcast a "Route Request" message to its node.
  • the message may include a field of "route record”, a field of "identity of route request", and the like.
  • the “Route Record” field is used to record the identifier of the intermediate node included in the route from the source node to the target node.
  • the identifier of the intermediate node may also be the address of the intermediate node, and the intermediate node can be uniquely found.
  • Step 252 the second routing device receives the routing request.
  • the routing request includes an identifier of the target node.
  • the second routing device is deployed on the intermediate node.
  • Step 253 After determining that the routing request is received for the first time, the second routing device adds the identifier of the intermediate node and the NMC score to the routing record of the routing request according to the identifier of the routing request, and forwards and adds the identifier of the intermediate node. Routing request for NMC scores. Specifically, the forwarding increases the identifier of the intermediate node and the routing request of the NMC score, and the routing request that adds the identifier of the intermediate node and the NMC score can be broadcasted in a broadcast manner.
  • the second routing device determines, after receiving the routing request, whether there is a plurality of determining manners for receiving the routing request for the first time, for example, the method is: the intermediate node maintains a sequence pair list, where The source node identifier of the route request in the sequence pair list, the identifier of the route request>, when the route request is received, if the ⁇ source node identifier of the route request, the identifier of the route request> does not exist in the sequence pair list of the intermediate node , indicating that the routing request is received for the first time, and the routing request ⁇ source node identifier, the identifier of the routing request> is saved in the sequence pair list of the intermediate node; if the source node identifier of the routing request, the routing request The identifier> exists in the sequence pair list of the intermediate node, indicating that the route request has been received before, and this time it is not processed.
  • Another optional method for judging whether the route request is received for the first time is: determining whether the identifier of the intermediate node is included in the “Route Record” field in the route request, and if not, determining that it is received for the first time, and The identifier of the intermediate node and the NMC score are added to the field of the route record of the route request; if it is included, it indicates that the route request has been received before, and this time it is not processed.
  • the target node receives the routing request and returns a routing response to the source node.
  • the route response includes: at least two routes from the source node to the target node, and NMC scores of the intermediate nodes in the at least two routes.
  • the sequence of the identifiers of the intermediate nodes in the route record in the route request constitutes a route
  • the target node attaches the route to the route response, and sends the route to the source node, and the NMC of each intermediate node in the route. Score.
  • the target node may receive multiple routing requests, and there are different routes included in at least two routing requests.
  • the target node attaches at least the two routes to two routing responses or is attached to one route.
  • the response is returned to the source node.
  • the target node replies with a route response for each received route request, where each route response includes a route included in the route request.
  • the target node may invert the sequence of the identifier of the intermediate node in the route record, that is, a route from the target node to the source node, and the target node may return a route response to the source node along the route.
  • the channel is asymmetric, and the target node needs to initiate a routing request process to the source node, and at the same time, the routing response message is carried in the new routing request.
  • Step 255 The first routing device receives the routing response corresponding to the routing request returned by the target node, where the routing response includes: at least two routes from the source node to the target node, and NMC points of the intermediate nodes in the at least two routes. value.
  • the first routing device is deployed on the source node, and after receiving the routing response, the first routing device reverses the sequence of the identifier of the intermediate node included in the routing response, that is, the source node to the target is obtained.
  • the route of the node After receiving the at least two routes, the source node selects the destination route according to the foregoing solution, and details are not described herein.
  • the calculation scheme is simple, the complexity is fast, and the route calculation speed is fast; and each node, such as an intermediate node, needs less state information to be maintained, for example, only It is sufficient to maintain the NMC score of the user.
  • the information exchanged between the nodes in the embodiment of the present application is less, and the information exchanged between each node and the first routing device and the second routing device is less.
  • the network load is alleviated; in the fourth aspect, the target route selected by the solution provided by the embodiment of the present application has strong ability to resist failure, fast self-healing speed, and low cost.
  • the solution provided by the embodiment of the present application is not only applicable to the WMN network, but also effective for the large-scale dynamic network robust routing problem, but the microstructure selection and routing formula in different networks may be different, and may be combined with specific After the scenario is analyzed offline, the relevant conclusions are obtained and then the specific configuration is performed.
  • FIG. 3 exemplarily shows a schematic structural diagram of a routing apparatus provided by the present application.
  • the routing device 300 may include the first routing device in the above content, or may include the first routing device and the second routing device in the above content, or may be the routing device 141 in FIG. 1a in the above content. That is, the routing device 300 may be configured to perform any of the foregoing methods, that is, perform any one of the foregoing methods performed by the first routing device or the second routing device, or execute the first routing device. And any one of the schemes performed by the second routing device, or any of the schemes performed by the routing device 141 described above.
  • the routing device 300 includes a processor 301, a transceiver 302, a memory 303, and a communication interface 304; wherein the processor 301, the transceiver 302, the memory 303, and the communication interface 304 are connected to one another via a bus 305.
  • the bus 305 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 3, but it does not mean that there is only one bus or one type of bus.
  • the memory 303 may include a volatile memory such as a random-access memory (RAM); the memory may also include a non-volatile memory such as a flash memory.
  • RAM random-access memory
  • non-volatile memory such as a flash memory.
  • HDD hard disk drive
  • SSD solid-state drive
  • the memory 303 may also include a combination of the above types of memories.
  • the communication interface 304 can be a wired communication access port, a wireless communication interface, or a combination thereof, wherein the wired communication interface can be, for example, an Ethernet interface.
  • the Ethernet interface can be an optical interface, an electrical interface, or a combination thereof.
  • the wireless communication interface can be a WLAN interface.
  • the processor 301 can be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.
  • the processor 301 may further include a hardware chip.
  • the hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof.
  • the PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL), or any combination thereof.
  • the memory 303 can also be used to store program instructions, and the processor 301 calls the program instructions stored in the memory 303 to perform one or more steps in the embodiment shown in FIG. 2 to FIG. 2e, or alternatively
  • the embodiment enables the routing device 300 to implement the functions of the first routing device and/or the second routing device in the above method, and to cause the routing device 300 to implement the functions of the routing device 141 in the above method.
  • the processor 301 is configured to control the transceiver 302 to perform signal reception and signal transmission according to the instruction for executing the memory storage.
  • the routing device is configured to: acquire at least two of the source node to the target node. And routing the NMC scores of the intermediate nodes of the at least two routes; and selecting a destination route from the at least two routes according to the NMC score of the intermediate nodes in the at least two routes; wherein, the middle The NMC score of the node is obtained according to the number of polygons constructed by the intermediate node; wherein the intermediate node is the vertex of the polygon constructed by the intermediate node.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • the NMC score of the intermediate node is obtained according to the number of M-type polygons constructed by the intermediate node; wherein, M is an integer greater than or equal to 1, and if M is greater than or equal to 2, any two of the M-type polygons Class polygons have different numbers of sides.
  • M is an integer greater than or equal to 1
  • M is greater than or equal to 2
  • any two of the M-type polygons Class polygons have different numbers of sides.
  • the NMC score of the intermediate node is: performing weighting calculation on the number of each type of polygon in the M-type polygon constructed by the intermediate node according to the weight corresponding to each type of polygon in the M-type polygon; wherein The NMC score of the intermediate node is used to indicate: the fault repair capability of the intermediate node.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the processor 301 is configured to determine, according to an NMC score of the intermediate node in the at least two routes, an NMC score of the route in the at least two routes, where the NMC score of the route is used to indicate the The fault repairing capability of the route is determined by the NMC score of the route of the at least two routes, and the route corresponding to the NMC score of the route with the strongest fault repair capability is determined as the target route.
  • the processor 301 is configured to determine, by using any one of the following methods, the NMC score of the route in the at least two routes: the NMC score of the intermediate node that has the weakest fault repair capability indicated in the route in the at least two routes.
  • the NMC score is determined as a route; the intermediate node NMC score in the route of at least two routes is mathematically calculated, and the result of the mathematical calculation is determined as the NMC score of the route.
  • the transceiver 302 is further configured to: obtain, by using a flooding or periodic information exchange mechanism, an NMC score reported by each of the at least two routes.
  • the processor 301 obtains the NMC score of the intermediate node, and the control transceiver 302 receives the NMC score reported by each of the at least two routes, and may also calculate at least two by the processor 301.
  • the NMC score of each intermediate node in each route in the route is further configured to: obtain, by using a flooding or periodic information exchange mechanism, an NMC score reported by each of the at least two routes.
  • the processor 301 obtains the NMC score of the intermediate node
  • the control transceiver 302 receives the NMC score reported by each of the at least two routes, and may also calculate at least two by the processor 301.
  • the NMC score of each intermediate node in each route in the route may also calculate at least two by the processor 301.
  • the transceiver 302 is configured to: broadcast a routing request; where the routing request includes an identifier of the target node; and receive a routing response corresponding to the routing request returned by the target node; where the routing response includes: the source node to the target node At least two routes, and NMC scores of intermediate nodes in at least two routes.
  • routing device 300 can be integrated on the source node.
  • FIG. 4 exemplarily shows a schematic structural diagram of a routing apparatus provided by the present application.
  • the routing device 400 may include the second routing device in the above content, or may include the first routing device and the second routing device in the above content, or may be the routing device 141 in FIG. 1a in the above content. That is, the routing device 400 can be configured to perform any of the foregoing methods, that is, perform any one of the foregoing methods performed by the first routing device or the second routing device, and execute the routing device 141. Any of the programs implemented.
  • the routing device 400 includes a processor 401, a transceiver 402, a memory 403, and a communication interface 404; wherein the processor 401, the transceiver 402, the memory 403, and the communication interface 404 are connected to one another via a bus 405.
  • the bus 405 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 4, but it does not mean that there is only one bus or one type of bus.
  • the memory 403 may include a volatile memory such as a random-access memory (RAM); the memory may also include a non-volatile memory such as a flash memory.
  • RAM random-access memory
  • the memory may also include a non-volatile memory such as a flash memory.
  • a hard disk drive (HDD) or a solid-state drive (SSD); the memory 403 may also include a combination of the above types of memories.
  • the communication interface 404 can be a wired communication access port, a wireless communication interface, or a combination thereof, wherein the wired communication interface can be, for example, an Ethernet interface.
  • the Ethernet interface can be an optical interface, an electrical interface, or a combination thereof.
  • the wireless communication interface can be a WLAN interface.
  • the processor 401 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.
  • the processor 401 may further include a hardware chip.
  • the hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof.
  • the PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL), or any combination thereof.
  • the memory 403 can also be used to store program instructions, and the processor 401 calls the program instructions stored in the memory 403, and can perform one or more steps in the embodiment shown in FIG. 2 to FIG. 2e, or
  • the embodiment enables the routing device 400 to implement the functions of the first routing device and/or the second routing device in the above method, or to cause the routing device 400 to implement the functions of the routing device 141 in the above method.
  • the processor 401 is configured to control the transceiver 402 to perform signal reception and signal transmission according to the instruction for executing the memory storage.
  • the routing device is configured to: at least two for the source node to the target node.
  • An intermediate node in the routing performing: determining, according to network topology information of the intermediate node, a number of polygons constructed by the intermediate node; wherein the intermediate node is a vertex of a polygon constructed by the intermediate node; and a polygon constructed according to the intermediate node
  • the NMC score of the intermediate node is determined by the quantity; the NMC score of the intermediate node is reported; wherein the NMC score of the intermediate node in the at least two routes is used: according to the intermediate node of the at least two routes
  • the NMC score selects a destination route from at least two routes.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • the processor 401 is configured to determine, according to network topology information of the intermediate node, the number of M types of polygons constructed by the intermediate node, where M is an integer greater than or equal to 1, and if M is greater than or equal to 2, The number of sides of any two types of polygons in the M-type polygon is different; according to the number of M-type polygons constructed by the intermediate node, the NMC score of the intermediate node is determined.
  • the M-type polygon can be reasonably set according to the actual situation and the specific application scenario, so that the NMC score more accurately reflects the fault repair capability of the intermediate node.
  • the processor 401 is configured to: determine a weight corresponding to each type of polygon in the M-type polygon; and, according to the weight corresponding to each type of polygon in the M-type polygon, each type of polygon in the M-type polygon constructed by the intermediate node The number is weighted; the result of weighting the number of each type of polygon in the M-type polygon constructed by the intermediate node is determined as the NMC score of the intermediate node.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the transceiver 402 is further configured to: obtain, by using a flooding or periodic information exchange mechanism, an NMC score reported by each of the at least two routes.
  • the NMC score reported by each of the at least two routes may be received by the transceiver 402, and each of the at least two routes may be calculated by the processor 401.
  • the NMC score of the node may be obtained by using a flooding or periodic information exchange mechanism.
  • the transceiver 402 is configured to: receive a routing request, where the routing request includes an identifier of the target node; and after determining that the routing request is received for the first time, the identifier of the intermediate node and the NMC score are determined according to the identifier of the routing request. Add to the routing record of the routing request, and forward the routing request with the identifier of the intermediate node and the NMC score.
  • routing device 300 can be integrated on the intermediate node.
  • FIG. 5 is a schematic structural diagram of a routing apparatus provided by an embodiment of the present application.
  • the routing device 500 may include the first routing device in the above content, or may include the first routing device and the second routing device in the above content, or may be the routing device 141 in FIG. 1a in the above content. That is, the routing device 500 can be used to perform any of the above methods. As shown in FIG. 5, the routing device 500 includes a receiving unit 501, a processing unit 502, and a transmitting unit 503.
  • the processing unit 502 is configured to: obtain at least two routes from the source node to the target node, and obtain a micro structure count NMC score of the intermediate node in the at least two routes; according to the NMC score of the intermediate node in the at least two routes, A target route is selected from at least two routes; wherein the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node; wherein the intermediate node is a vertex of the polygon constructed by the intermediate node.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • the NMC score of the intermediate node is obtained according to the number of M-type polygons constructed by the intermediate node; wherein, M is an integer greater than or equal to 1, and if M is greater than or equal to 2, any two of the M-type polygons Class polygons have different numbers of sides.
  • M is an integer greater than or equal to 1
  • M is greater than or equal to 2
  • any two of the M-type polygons Class polygons have different numbers of sides.
  • the NMC score of the intermediate node is: performing weighting calculation on the number of each type of polygon in the M-type polygon constructed by the intermediate node according to the weight corresponding to each type of polygon in the M-type polygon; wherein The NMC score of the intermediate node is used to indicate: the fault repair capability of the intermediate node.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the processing unit 502 is configured to determine, according to an NMC score of the intermediate node in the at least two routes, an NMC score of the route in the at least two routes, where the NMC score of the route is used to indicate the The fault repairing capability of the route is determined by the NMC score of the route of the at least two routes, and the route corresponding to the NMC score of the route with the strongest fault repair capability is determined as the target route.
  • the processing unit 502 is configured to determine, by using any one of the following methods, the NMC score of the route in the at least two routes: the NMC score of the intermediate node that has the weakest fault repair capability indicated in the route in the at least two routes.
  • the NMC score is determined as a route; the intermediate node NMC score in the route of at least two routes is mathematically calculated, and the result of the mathematical calculation is determined as the NMC score of the route.
  • the receiving unit 501 is further configured to: obtain, by using a flooding or periodic information exchange mechanism, an NMC score reported by each intermediate node in each of the at least two routes.
  • the processing unit obtains the NMC score of the intermediate node, and the control receiving unit receives the NMC score reported by each of the at least two routes in the at least two routes; or the at least two routes are calculated by the processing unit.
  • the sending unit 503 is configured to: broadcast a routing request, where the routing request includes an identifier of the target node, and the receiving unit 501 is configured to receive a routing response corresponding to the routing request returned by the target node, where the routing response includes: At least two routes from the source node to the destination node, and NMC scores of intermediate nodes in at least two routes.
  • routing device 500 can be integrated on the source node.
  • routing device 300 can include a processor 301, a transceiver 302, and a memory 303.
  • the memory 303 can be used to store the code when the processor 301 executes the solution, and the code can be a program/code pre-installed by the routing device 300 at the factory.
  • FIG. 6 is a schematic structural diagram of a routing apparatus provided by an embodiment of the present application.
  • the routing device 600 may include the second routing device in the above content, or may include the first routing device and the second routing device in the above content, or may be the routing device 141 in FIG. 1a in the above content. That is, the routing device 600 can be used to perform any of the above methods. As shown in FIG. 6, the routing device 600 includes a receiving unit 601, a processing unit 602, and a transmitting unit 603.
  • the processing unit 602 is configured to: determine, according to the network topology information of the intermediate node, the number of polygons constructed by the intermediate node, where the intermediate node is the intermediate node, and the intermediate node of the at least two routes of the source node to the target node The vertices of the constructed polygons; determining the NMC score of the microstructure of the intermediate node according to the number of polygons constructed by the intermediate node; reporting the NMC score of the intermediate node; wherein, the NMC points of the intermediate nodes in at least two routes The value is used to: select a target route from at least two routes according to an NMC score of an intermediate node in at least two routes.
  • the NMC score of the intermediate node is obtained according to the number of polygons constructed by the intermediate node, and the intermediate node is a vertex of the polygon constructed by the intermediate node, that is, an NMC score of an intermediate node.
  • the number of polygons that the intermediate node participates in constructing may be reflected. Since the polygon is closed and the intermediate node is a vertex of the polygon, the number of polygons constructed by the intermediate node may reflect that the link of the intermediate node is faulty.
  • the fault repairing capability of the intermediate node, and the target route is selected from the source node to the target node according to the NMC score of the intermediate node in the at least two routes in the embodiment of the present application, that is, the implementation of the present application
  • the target route is selected based on the fault repair capability of the intermediate node. Therefore, the solution provided by the embodiment of the present application can improve the capability of the target route to resist the fault, thereby improving the reliability of the communication.
  • the first route and the second route are equivalent to the at least two routes; wherein the first route and the second route are any two routes of the at least two routes; the first route and the second route meet the following content Any one of the following: the hop count between the nodes included in the first route is the same as the hop count between the nodes included in the second route; the transmission delay of the first route is the same as the transmission delay included in the second route; the first route The sum of the weights of the included links is the same as the sum of the weights of the links included in the second route; the sum of the weights of the intermediate nodes included in the first route is the same as the sum of the weights of the intermediate nodes included in the second route; the first route The sum of the weight of the included link and the weight of the intermediate node is the same as the sum of the weight of the link included in the second route and the weight of the intermediate node.
  • the target route selected in the embodiment of the present application considers the route repair capability of each intermediate node on the route, and thus the reliability of the route can be improved. Further, for the two equal-cost routes, the advantages of the method in the present application can be further improved. In this embodiment, the fault repair capability of the route in the two equal-cost routes is determined to be higher.
  • the processing unit 602 is configured to: determine, according to network topology information of the intermediate node, the number of M types of polygons constructed by the intermediate node; where M is an integer greater than or equal to 1, and if M is greater than or equal to 2, The number of sides of any two types of polygons in the M-type polygon is different; according to the number of M-type polygons constructed by the intermediate node, the NMC score of the intermediate node is determined.
  • M-type polygon can be reasonably set according to the actual situation and the specific application scenario, so that the NMC score more accurately reflects the fault repair capability of the intermediate node.
  • the processing unit 602 is configured to: determine weights corresponding to each type of polygon in the M type polygon; and perform weights of each type of polygon in the M type polygon constructed by the intermediate node according to weights corresponding to each type of polygon in the M type polygon The number is weighted; the result of weighting the number of each type of polygon in the M-type polygon constructed by the intermediate node is determined as the NMC score of the intermediate node.
  • the weights of each type of polygon in the M-type polygon can be set according to actual conditions, for example, the weight of each type of polygon is the same, both are 1; or the polygons with more edges may have a larger routing delay after repairing, Therefore, the polygons with more edges may have smaller weights, etc., so that the NMC score is balanced between the fault repair capability of the intermediate node and the delay of the repaired route.
  • the receiving unit 601 is further configured to: obtain, by using a flooding or periodic information exchange mechanism, an NMC score reported by each of the at least two routes.
  • the receiving unit 601 can receive the NMC score reported by each of the at least two routes, and the processing unit 602 can calculate each middle of each of the at least two routes. The NMC score of the node.
  • the receiving unit 601 is configured to: receive a routing request, where the routing request includes an identifier of the target node, and the processing unit 602 is configured to: after determining that the routing request is received for the first time, the intermediate node is determined according to the identifier of the routing request The identifier and the NMC score are added to the routing record of the routing request, and the routing request that adds the identity of the intermediate node and the NMC score is forwarded by the sending unit 603.
  • routing device 600 can be integrated on the intermediate node.
  • routing device 400 can include a processor 401, a transceiver 402, and a memory 403.
  • the memory 403 can be used to store the code when the processor 401 executes the solution, and the code can be a program/code pre-installed by the routing device 400 at the factory.
  • the embodiment of the present application provides a computer storage medium for storing computer program instructions used by the routing device 300, including a program for executing the above routing method.
  • the computer storage medium can be any available media or data storage device accessible by the computer, including but not limited to magnetic memory (eg, floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.), optical storage (eg, CD, DVD, BD, HVD, etc.), and semiconductor memories (such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state hard disk (SSD)).
  • magnetic memory eg, floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.
  • optical storage eg, CD, DVD, BD, HVD, etc.
  • semiconductor memories such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state hard disk (SSD)).
  • the embodiment of the present application further provides another computer storage medium for storing computer program instructions used by the routing device 400, including a program for executing the routing method described above.
  • the computer storage medium can be any available media or data storage device accessible by the computer, including but not limited to magnetic memory (eg, floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.), optical storage (eg, CD, DVD, BD, HVD, etc.), and semiconductor memories (such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state hard disk (SSD)).
  • magnetic memory eg, floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.
  • optical storage eg, CD, DVD, BD, HVD, etc.
  • semiconductor memories such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state hard disk (SSD)).
  • embodiments of the present application can be provided as a method, system, or computer program product. Therefore, the embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Moreover, embodiments of the present application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG.
  • These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé et un appareil de sélection d'itinéraire, qui sélectionnent un itinéraire cible au moyen de la combinaison d'une capacité de résistance aux défaillances de l'itinéraire, améliorant ainsi la fiabilité de communication. Dans les modes de réalisation de la présente invention, une valeur NMC d'un nœud intermédiaire est obtenue en fonction du nombre de polygones construits par le nœud intermédiaire, et le nœud intermédiaire sert de sommet au polygone construit par le nœud intermédiaire, c'est-à-dire qu'une valeur NMC d'un nœud intermédiaire peut indiquer le nombre de polygones, le nœud intermédiaire participant à la constructions des ces derniers. Étant donné que le polygone est fermé, et que le nœud intermédiaire est le sommet du polygone, le nombre de polygones construits par le nœud intermédiaire peut indiquer une capacité de résistance aux défaillances du nœud intermédiaire après une défaillance d'une chaîne du nœud intermédiaire, de telle sorte qu'un itinéraire cible sélectionné sur la base de la capacité de résistance aux défaillances du nœud intermédiaire dans les modes de réalisation de la présente invention améliore la fiabilité de communication.
PCT/CN2017/119050 2017-03-29 2017-12-27 Procédé et appareil de sélection d'itinéraire WO2018176946A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710197733.2A CN108668334B (zh) 2017-03-29 2017-03-29 一种路由选择方法和装置
CN201710197733.2 2017-03-29

Publications (1)

Publication Number Publication Date
WO2018176946A1 true WO2018176946A1 (fr) 2018-10-04

Family

ID=63674132

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/119050 WO2018176946A1 (fr) 2017-03-29 2017-12-27 Procédé et appareil de sélection d'itinéraire

Country Status (2)

Country Link
CN (1) CN108668334B (fr)
WO (1) WO2018176946A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101437305A (zh) * 2008-12-09 2009-05-20 重庆邮电大学 无线传感器网络双连通并优化通信路径的方法
CN101742529A (zh) * 2009-12-10 2010-06-16 上海交通大学 无线协作网络中中继分配和合作维持方法
US9077817B2 (en) * 2005-05-27 2015-07-07 Telecommunication Systems, Inc. Voice over internet protocol (VoIP) E911 metro street address guide (MSAG) validation
CN105103619A (zh) * 2013-03-15 2015-11-25 波音公司 基于路由器物理位置的安全路由

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9077817B2 (en) * 2005-05-27 2015-07-07 Telecommunication Systems, Inc. Voice over internet protocol (VoIP) E911 metro street address guide (MSAG) validation
CN101437305A (zh) * 2008-12-09 2009-05-20 重庆邮电大学 无线传感器网络双连通并优化通信路径的方法
CN101742529A (zh) * 2009-12-10 2010-06-16 上海交通大学 无线协作网络中中继分配和合作维持方法
CN105103619A (zh) * 2013-03-15 2015-11-25 波音公司 基于路由器物理位置的安全路由

Also Published As

Publication number Publication date
CN108668334A (zh) 2018-10-16
CN108668334B (zh) 2020-06-16

Similar Documents

Publication Publication Date Title
US10310944B2 (en) Phased network formation for power restoration
CN107852362B (zh) 网格网络系统和方法
EP2548341B1 (fr) Chemins descendants de rechange pour un routage de graphe acyclique orienté (dag)
US10439880B2 (en) Loop-free convergence in communication networks
US7567577B2 (en) Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof
CN115769549B (zh) 在通信网络中分发信息
Le Multipath routing design for wireless mesh networks
Yamada et al. Cooperative MPR selection to reduce topology control packets in OLSR
Sharma et al. Improving the QOS in MANET by Enhancing the Routing Technique of AOMDV Protocol
WO2018176946A1 (fr) Procédé et appareil de sélection d'itinéraire
Doghri et al. On The Recovery Performance of Single-and Multipath OLSR in Wireless Multi-Hop Networks
Rao et al. Performance analysis of MANET routing protocols-dsdv DSR AODV AOMDV using NS-2
Pramod et al. Characterization of wireless mesh network performance in an experimental test bed
Latiff et al. Load distributed routing protocol for wireless mesh networks
CN114430387B (zh) 一种节点的配置方法、控制器和节点
Pathak et al. A performance study of hybrid protocols for opportunistic communications
Saleh et al. Impact of Route Selection Metrics on the Performance of DSR Protocol for MANETs
Chang et al. On multipath routing in wireless mesh networks with multiple gateways
Kampen et al. Reconnection strategies in WSN running RPL
Abdou et al. NICE-MRP: A near-optimal radio-interference aware multi-path routing protocol for MANETs
Sundararajan et al. Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks
Manjunath et al. Stipulated Region Based Routing (SRR) algorithm for Mobile Ad Hoc Network
Pham et al. A radio load based load balancing scheme with admission control
Rajput et al. Real Time Traffic Reduced Implying LBA in Mobile Ad Hoc Network
Ong et al. Effect of Nodes Mobility on Density-Based Probabilistic Routing Algorithm in Ad-hoc Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17904100

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17904100

Country of ref document: EP

Kind code of ref document: A1