Search

CN-115714998-B - Central node route discovery method based on wireless Mesh network and related equipment

CN115714998BCN 115714998 BCN115714998 BCN 115714998BCN-115714998-B

Abstract

The application relates to a wireless Mesh network-based central node route discovery method and related equipment, and relates to the technical field of wireless networks. The method comprises the steps of obtaining route discovery broadcast forwarded to a current route node by a last hop route node, determining validity of the last hop best route by comparing each route node passed by the last hop best route with the current route node, determining the current best route according to the current route node and the last hop best route under the condition that the last hop best route is valid, updating the route discovery broadcast according to the current best route, forwarding the updated route discovery broadcast to a next route node, and taking the next route node as the current route node to continue to execute route discovery until the best route from each route node to a central node is determined. By adopting the method, the network overhead of route discovery can be reduced.

Inventors

  • HUANG XIUFENG

Assignees

  • 深圳市欧瑞博科技股份有限公司

Dates

Publication Date
20260512
Application Date
20221025

Claims (9)

  1. 1. A method for discovering a route of a central node based on a wireless Mesh network, the method comprising: Obtaining a route discovery broadcast forwarded to a current-hop route node by a last-hop route node, wherein the route discovery broadcast carries an optimal path of one hop, and the optimal path of the last hop is an optimal path from the last-hop route node to a central node; Determining the effectiveness of the optimal path of the previous hop by comparing each routing node through which the optimal path of the previous hop passes with the current hop routing node; Under the condition that the optimal path of the previous hop is effective, determining the optimal path of the current hop according to the current hop routing node and the optimal path of the previous hop, and updating the route discovery broadcast according to the optimal path of the current hop; Determining a receiving time point when the current hop routing node receives the route discovery broadcast and a forwarding window of the current hop routing node, wherein the forwarding window is used for controlling the current hop routing node to forward the updated route discovery broadcast within the time range of the forwarding window; determining a forwarding time range of the updated route discovery broadcast according to the receiving time point and the forwarding window; And forwarding the updated route discovery broadcast to a next-hop route node based on the random time point in the forwarding time range, and taking the next-hop route node as a current-hop route node to continue to execute route discovery until the optimal path of each route node to the central node is determined.
  2. 2. The method of claim 1, wherein the route discovery broadcast forwarded by the last hop routing node also carries a current broadcast identification; After the route discovery broadcast forwarded by the last hop routing node to the current hop routing node is obtained, the method further includes: Acquiring a set of historical broadcast identifications, wherein the historical broadcast identifications are identifications of historical route discovery broadcasts forwarded by the current hop routing node; And under the condition that the current broadcast identification is contained in the set, determining that the current hop routing node does not execute route discovery.
  3. 3. The method of claim 1, wherein the determining the best path for the current hop based on the best paths for the current hop routing node and the previous hop comprises: generating a plurality of current-hop alternative paths of the current-hop routing node according to the optimal path of each previous hop and the current-hop routing node under the condition that the number of the previous-hop routing nodes is multiple; And carrying out path screening on the alternative paths of each current hop according to the number of the alternative path hops and the quality of the alternative path corresponding to the alternative paths of each current hop so as to determine the optimal path of the current hop.
  4. 4. The method of claim 3, wherein the performing path filtering on the candidate paths of each current hop according to the number of candidate path hops and the candidate path quality corresponding to the candidate paths of each current hop to determine the best path of the current hop comprises: according to the number of the corresponding alternative path hops of each alternative path of the current hop, selecting a target alternative path of the current hop from the alternative paths of the current hop; And under the condition that the target alternative paths of the current hop are multiple, determining the optimal path of the current hop from the target alternative paths of the current hop according to the respective corresponding alternative path quality of the target alternative paths of the current hop.
  5. 5. The method of claim 4, wherein the alternate paths for each current hop are stored in a corresponding routing table; After the determination of the best path for the current hop from the target alternative paths for the current hop, the method further comprises: And synchronously storing the determined optimal path of the current hop into the routing table.
  6. 6. The method of claim 5, wherein after said determining the best path for each routing node to the central node, the method further comprises: under the condition that the communication between the target routing node in each routing node and the central node fails according to the corresponding optimal path, screening a target path from alternative paths stored in the routing table corresponding to the target routing node; And controlling the target routing node to communicate with the central node based on the target path.
  7. 7. A central node route discovery system based on a wireless Mesh network is characterized by comprising a central node and a plurality of routing nodes; The method comprises the steps of obtaining a route discovery broadcast of a previous-hop route node to a current-hop route node, obtaining the route discovery broadcast of the previous-hop route node, wherein the route discovery broadcast carries an optimal path of the previous-hop route node to a central node, the central node is a first-hop route node, determining the effectiveness of the optimal path of the previous-hop route node by comparing each route node passed by the optimal path of the previous-hop with the current-hop route node, determining the optimal path of the current-hop route node according to the optimal path of the current-hop route node and updating the route discovery broadcast according to the optimal path of the current-hop route node under the condition that the optimal path of the previous-hop route node is effective, determining the receiving time point of the route discovery broadcast received by the current-hop route node and the forwarding window of the current-hop route node, determining the forwarding window for controlling the forwarding window to be updated in the time range of the forwarding window of the current-hop route node, determining the forwarding window of the current-hop route node to the next-hop route node according to the current-hop route discovery window, and determining the forwarding window of the current-hop node to the next-hop route node as the current-hop route discovery window, and determining the forwarding window to be updated according to the current-hop time point of the current-hop node, and determining the next-hop node to the current-hop node.
  8. 8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
  9. 9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.

Description

Central node route discovery method based on wireless Mesh network and related equipment Technical Field The application relates to the technical field of wireless networks, in particular to a wireless Mesh network-based central node route discovery method and related equipment. Background With the development of smart home, more and more smart home devices have networking functions, and some wireless network technologies need to be applied to the smart home devices in the using process. In general, in the wireless network technology, when each routing node needs to communicate with each other, but cannot reach a destination node in a single hop, for example, a central node, it is necessary to establish a path for each routing node to reach the destination node, and the above path establishment procedure is called route discovery. In the conventional route discovery method, each route node forwards the received route discovery broadcast to the next-hop route node in the process of forwarding the route discovery broadcast, and then the next-hop route node continues forwarding. In some cases, however, the route discovery broadcast forwarded by the routing node to the next-hop routing node is likely to be forwarded by the routing node, and there is a problem of repeated forwarding at this time, so that the overhead of the wireless network is affected. Disclosure of Invention In view of the foregoing, it is desirable to provide a wireless Mesh network-based central node route discovery method and related devices that can reduce the network overhead of route discovery. In a first aspect, the present application provides a method for discovering a route of a central node based on a wireless Mesh network, the method comprising: Obtaining a route discovery broadcast forwarded to a current-hop route node by a last-hop route node, wherein the route discovery broadcast carries an optimal path of one hop, and the optimal path of the last hop is an optimal path from the last-hop route node to a central node; Determining the effectiveness of the optimal path of the previous hop by comparing each routing node through which the optimal path of the previous hop passes with the current hop routing node; Under the condition that the optimal path of the previous hop is effective, determining the optimal path of the current hop according to the current hop routing node and the optimal path of the previous hop, and updating the route discovery broadcast according to the optimal path of the current hop; And forwarding the updated route discovery broadcast to a next-hop route node, and taking the next-hop route node as a current-hop route node to continue to execute route discovery until the optimal path from each route node to the central node is determined. In a second aspect, the application provides a wireless Mesh network-based central node route discovery system, which comprises a central node and a plurality of routing nodes; The method comprises the steps of obtaining a route discovery broadcast of a previous hop route node to a current hop route node, obtaining a route discovery broadcast of the previous hop route node, wherein the route discovery broadcast carries a best route of the previous hop, the best route of the previous hop is a best route from the previous hop route node to a central node, the central node is a first hop route node, determining validity of the best route of the previous hop by comparing each route node passed by the best route of the previous hop with the current hop route node, determining the best route of the current hop according to the best route of the current hop and the best route of the previous hop under the condition that the best route of the previous hop is valid, updating the route discovery broadcast according to the best route of the current hop, forwarding the updated route discovery broadcast to a next hop route node, and taking the next hop route node as the current route node to continue to execute route discovery until determining the best route of each route node to the central node. In some embodiments, the route discovery broadcast forwarded by the last hop routing node also carries the current broadcast identifier, the current hop routing node is further configured to obtain a set of historical broadcast identifiers, the historical broadcast identifiers are identifiers of historical route discovery broadcasts forwarded by the current hop routing node, and determine that the current hop routing node does not perform route discovery if the current broadcast identifier is included in the set. In some embodiments, the current-hop routing node is further configured to generate multiple current-hop alternative paths of the current-hop routing node according to the optimal paths of the previous hops and the current-hop routing node, and perform path screening on each current-hop alternative path according to the number of alternative path hops and the alternative path quality c