Optimization method and device for wireless mesh network, and electronic device

Abstract

The application relates to the technical field of wireless Mesh networks, and discloses an optimization method for a wireless Mesh network, the Mesh network comprising a plurality of Mesh network nodes connected to each other, the optimization method comprising: continuously sending N pieces of update instructions to relay nodes in the Mesh network nodes at a set time interval, so that each Mesh network node determines an optimal relay node corresponding to the Mesh network node according to the update instructions; wherein N is an integer greater than or equal to 2; determining a target optimization relay node according to the node addresses of the optimal relay nodes sent by the Mesh network nodes; and sending an optimization instruction to the target optimization relay node; wherein the optimization instruction is used for instructing the target optimization relay node to close the relay function. The technical scheme of the application can complete the optimization operation of multiple relay nodes at one time, obviously reduces the number of broadcasts of the Mesh network, and the effect of reducing the broadcast storm is more significant. The application further discloses an optimization device for a wireless Mesh network and an electronic equipment.

Description

Technical Field

[0001] This application relates to the field of wireless mesh network technology, and for example to an optimization method, apparatus, and electronic device for wireless mesh networks. Background Technology

[0002] Wireless mesh networks are high-capacity, high-bandwidth distributed networks that can be seen as a fusion of Wireless Local Area Networks (WLANs) and Ad hoc mobile ad hoc networks, leveraging the advantages of both. Once a mesh network is successfully established, relay nodes within it unconditionally forward messages. However, as the number of relay nodes increases, the number of messages in the mesh network grows exponentially, causing broadcast storms that prevent new mesh control commands from being executed or prevent mesh network nodes from reporting their status.

[0003] To reduce the number of forwardings of mesh control commands in a mesh network and lower the probability of broadcast storms, related technologies employ a first node in the mesh network that sends at least one detection message carrying a Time-to-Live (TTL). The TTL in the detection message decreases with each forwarding of the detection message. The first node receives at least one acknowledgment message from a second node in the mesh network, sent by the second node when the TTL in the received detection message is 0. Based on the at least one acknowledgment message, the first node determines the preferred TTL for message transmission between itself and the second node, and then sends a message to the second node according to the preferred TTL.

[0004] In the process of implementing the embodiments of this disclosure, it was found that at least the following problems exist in the related technology: after the first node determines the preferred TTL for transmitting messages between the first node and the second node, it sends a message to the second node according to the preferred TTL, which reduces the transmission of broadcast packets in the Mesh network to a certain extent, but the effect of reducing broadcast storms is not very obvious.

[0005] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this application, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0006] To provide a basic understanding of some aspects of the disclosed embodiments, a brief summary is given below. This summary is not intended as a general commentary, nor is it intended to identify key / important components or describe the scope of protection of these embodiments, but rather as a prelude to the detailed description that follows.

[0007] This disclosure provides an optimization method, apparatus, and electronic device for wireless mesh networks. A control node continuously sends N update commands to relay nodes in the mesh network at set intervals. Then, based on the node address of the optimal relay node fed back by each mesh network node according to the update commands, a target optimized relay node is determined, thereby completing the mesh network node optimization. This method can complete the optimization of multiple relay nodes at once, significantly reducing the number of broadcasts in the mesh network and significantly reducing broadcast storms.

[0008] In some embodiments, the mesh network includes multiple mesh network nodes connected to each other; the optimization method for the wireless mesh network applied to the control node includes: sending N update instructions to relay nodes in the mesh network nodes at consecutive intervals of a set duration, so that the mesh network nodes determine the optimal relay node corresponding to each mesh network node according to the update instructions; wherein, N is an integer greater than or equal to 2; determining the target optimized relay node according to the node address of the optimal relay node sent by each mesh network node; sending an optimization instruction to the target optimized relay node; wherein, the optimization instruction is used to instruct the target optimized relay node to disable relay function.

[0009] In some embodiments, a mesh network includes multiple mesh network nodes interconnected with each other; an optimization method for a wireless mesh network applied to the mesh network nodes includes: determining the optimal relay node corresponding to each mesh network node according to an update instruction; wherein the update instruction is one of N update instructions sent by a control node to the relay nodes in the mesh network nodes at continuous intervals of a set time, where N is an integer greater than or equal to 2; sending the node address of the optimal relay node to the control node, so that the control node determines the target optimized relay node according to the node address of the optimal relay node sent by each mesh network node, and sends an optimization instruction to the target optimized relay node; wherein the optimization instruction is used to instruct the target optimized relay node to disable its relay function.

[0010] In some embodiments, the optimization apparatus for a wireless mesh network includes a processor and a memory storing program instructions, the processor being configured to execute the aforementioned optimization method for a wireless mesh network when executing the program instructions.

[0011] In some embodiments, the electronic device includes: an electronic device body; and the aforementioned optimization device for wireless mesh networks, which is mounted on the electronic device body.

[0012] The optimization method, apparatus, and electronic device for wireless mesh networks provided in this disclosure can achieve the following technical effects:

[0013] In this disclosed technical solution, the control node sends N update commands to the relay nodes in the mesh network at set intervals. Each mesh node determines its optimal relay node based on these update commands and then sends the address of its optimal relay node to the control node. The control node then determines the target optimized relay node based on the addresses of the optimal relay nodes sent by each mesh node and sends optimization commands to that target optimized relay node. This method, where the control node sends N update commands to the relay nodes in the mesh network at set intervals and determines the target optimized relay node based on the address of the optimal relay node returned by each mesh node based on the update commands, completes the mesh network node optimization. This allows for the simultaneous optimization of multiple relay nodes, significantly reducing the number of broadcasts in the mesh network and effectively mitigating broadcast storms.

[0014] The above general description and the description below are exemplary and illustrative only and are not intended to limit this application. Attached Figure Description

[0015] One or more embodiments are illustrated by way of example with reference to the accompanying drawings. These illustrations and drawings do not constitute a limitation on the embodiments. Elements having the same reference numerals in the drawings are shown as similar elements. The drawings are not to be scaled. And wherein:

[0016] Figure 1 This is a flowchart illustrating an optimization method for a wireless mesh network provided in an embodiment of this disclosure;

[0017] Figure 2 This is a flowchart illustrating another optimization method for wireless mesh networks provided in this disclosure embodiment;

[0018] Figure 3 This is a flowchart illustrating another optimization method for wireless mesh networks provided in this disclosure embodiment;

[0019] Figure 4 This is a flowchart illustrating another optimization method for wireless mesh networks provided in this embodiment of the disclosure.

[0020] Figure 5 This is a schematic diagram of the structure of a wireless mesh network before optimization, provided in an embodiment of this disclosure;

[0021] Figure 6 This is a schematic diagram of an optimized wireless mesh network structure provided in an embodiment of this disclosure;

[0022] Figure 7This is a schematic diagram of the structure of an optimization device for a wireless mesh network provided in an embodiment of this disclosure;

[0023] Figure 8 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this disclosure. Detailed Implementation

[0024] To provide a more detailed understanding of the features and technical content of the embodiments of this disclosure, the implementation of the embodiments of this disclosure will be described in detail below with reference to the accompanying drawings. The accompanying drawings are for illustrative purposes only and are not intended to limit the embodiments of this disclosure. In the following technical description, for ease of explanation, several details are used to provide a full understanding of the disclosed embodiments. However, one or more embodiments may still be implemented without these details. In other cases, well-known structures and devices may be simplified in their depiction to simplify the drawings.

[0025] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this disclosure are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate for the embodiments of this disclosure described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0026] Unless otherwise stated, the term "multiple" means two or more. In embodiments of this disclosure, the character " / " indicates that the preceding and following objects are in an "OR" relationship. For example, A / B means: A or B. The term "and / or" describes an association relationship between objects, indicating that three relationships can exist. For example, A and / or B means: A or B, or, A and B. The term "correspondence" can refer to an association or binding relationship; A corresponding to B means that there is an association or binding relationship between A and B.

[0027] Wireless mesh networks, also known as "multi-hop networks," are dynamic and continuously expandable network architectures that enable transmission between wireless devices. A large number of mesh network nodes (the terminal devices of the mesh network nodes) can automatically connect wirelessly to form a mesh structure. Each mesh network node can only communicate with its neighboring mesh network nodes, making it a self-organizing and self-managing intelligent network that can build a resilient network without a backbone.

[0028] After receiving control commands (data packets) from the user, the control node in a mesh network sends the control commands to all mesh network nodes within the network. Mesh network nodes are devices that have been started, configured, and become members of the mesh network. Mesh network nodes are categorized as relay nodes and non-relay nodes. Relay nodes are mesh network nodes with relay functionality, capable of retransmitting received control commands to ensure rapid propagation throughout the mesh network. Non-relay nodes are mesh network nodes with relay functionality disabled; they cannot retransmit received control commands but can send relevant information to the control node. Furthermore, mesh network nodes with control command sending capabilities (such as control nodes and relay nodes) are called sending nodes.

[0029] Combination Figure 1 As shown, this disclosure provides an optimization method for a wireless mesh network, applied to a control node. The mesh network includes multiple interconnected mesh network nodes. The optimization method includes the following steps:

[0030] S101, continuously send N update instructions to the relay nodes in the Mesh network at set intervals, so that the Mesh network nodes can determine the optimal relay node corresponding to each Mesh network node according to the update instructions; where N is an integer greater than or equal to 2.

[0031] Optionally, the number of update commands N can be determined as follows: determine the number of relay nodes in the Mesh network; determine the number of update commands N based on the number of relay nodes.

[0032] As the number of relay nodes in a mesh network increases, the number of broadcasts in the mesh network also increases accordingly. Generally speaking, the more relay nodes there are, the more redundant paths there are within the mesh network. Therefore, the number of update commands N is positively correlated with the number of relay nodes; that is, the more relay nodes there are, the more update commands N there are. Consequently, the fewer optimal relay nodes determined by the mesh network nodes based on the update commands, the more relay nodes are eliminated from the mesh network. Determining the number of update commands N based on the number of relay nodes allows for better selection of an appropriate number of target optimized relay nodes, reducing redundant paths within the mesh network while preventing the elimination of too many relay nodes that could disrupt normal communication between mesh network nodes.

[0033] Optionally, the number of update instructions N is determined based on the number of relay nodes, including calculating the number of update instructions N according to the following formula:

[0034] N = N0 + [M / M0]

[0035] Where N is the number of update commands, N0 is the preset number of update commands, M is the number of relay nodes, and M0 is the preset number of relay nodes.

[0036] For example, the preset number of relay nodes M0 is 10, and the preset number of update instructions N0 corresponding to the preset number of relay nodes M0 is 2. When the number of relay nodes M is 5, [M / M0] = [5 / 10] = 0 (rounded down), N = N0 + [M / M0] = 2 + 0 = 2; when the number of relay nodes M is 10, [M / M0] = [10 / 10] = 1, N = N0 + [M / M0] = 2 + 0 = 2. o [M / M0] = 2 + 1 = 3; when the number of relay nodes M is 54, [M / M0] = [54 / 10] = 5, N = N0 + [M / M0] = 2 + 5 = 7.

[0037] The number of update commands N is calculated in the above manner. On the one hand, the more relay nodes there are, the more update commands N there are, and the more relay nodes are optimized out of the Mesh network, which can greatly reduce redundant paths in the Mesh network and reduce the occurrence of broadcast storms in the Mesh network. On the other hand, the number of update commands added to the preset number of update commands N0 is calculated according to [M / M0]. That is, the number of update commands added to the preset number of update commands N0 is determined by taking the integer part of the quotient of the number of relay nodes M and the preset number of relay nodes M0. This avoids optimizing out too many relay nodes, which would affect the normal communication of each Mesh network node in the Mesh network.

[0038] S102, determine the target optimized relay node based on the node address of the optimal relay node sent by each Mesh network node.

[0039] Optionally, the target optimized relay node is determined based on the node address of the optimal relay node sent by each Mesh network node, including: traversing the node addresses of all relay nodes in the Mesh network; obtaining the target node address from all the node addresses of the relay nodes other than the node address of the optimal relay node sent by each Mesh network node; and determining the relay node corresponding to the target node address as the target optimized relay node.

[0040] After receiving the optimal relay node addresses from each Mesh network node, the control node retrieves the node addresses of all relay nodes stored in the Mesh network. Then, it iterates through the node addresses of all relay nodes for each Mesh network node, excluding itself. If the stored relay node address is among the received optimal relay node addresses, the relay node is considered to be a relay node that does not require optimization; otherwise, it is considered a relay node to be optimized (i.e., the target optimized relay node).

[0041] Based on the optimal relay node address sent by each mesh network node, the target relay node to be optimized is determined by traversing the node addresses of all relay nodes in the mesh network, thus completing the relay node optimization operation of the mesh network. This avoids missing any relay nodes in the mesh network, thereby achieving better mesh network optimization.

[0042] S103, send an optimization command to the target optimized relay node; wherein, the optimization command is used to instruct the target optimized relay node to disable the relay function.

[0043] In practical applications, after receiving network optimization control commands from the user, the control node sends an "Initiate Optimization Broadcast" command to all Mesh network nodes (including relay nodes and non-relay nodes). Mesh network nodes receive the "Initiate Optimization Broadcast" command from the control node and enter recording mode. The control node sends N update commands to the relay nodes in the Mesh network at set intervals. Based on these update commands, the Mesh network nodes determine the optimal relay node for each node. After sending the update commands, the control node sends a "Terminate Optimization Broadcast" command to the Mesh network nodes. The Mesh network nodes receive this command and exit recording mode. After sending the "Terminate Optimization Broadcast" command, the control node sends a reporting command to the Mesh network nodes. The Mesh network nodes receive this command and report the cached address of the optimal relay node to the control node. Based on the addresses of the optimal relay nodes sent by each Mesh network node, the control node determines the target optimized relay node and sends an optimization command to the target optimized relay node, disabling its relay function and completing the Mesh network optimization.

[0044] Combination Figure 5 and Figure 6 As shown, before mesh network optimization, all mesh network nodes ah (a, b, c, d, e, f, g, h) are relay nodes. After optimization, mesh network nodes b, c, d, f, and h disable their relay function and become non-relay nodes. This optimization of multiple relay nodes is completed at once, significantly reducing the number of broadcasts in the mesh network.

[0045] The optimization method for wireless mesh networks provided in this disclosure involves a control node sending N update commands to relay nodes in the mesh network at set intervals. Each mesh node determines its optimal relay node based on these update commands and then sends its address to the control node. The control node then determines the target optimized relay node based on the addresses of the optimal relay nodes sent by each mesh node and sends optimization commands to that target node. This method, by sending N update commands to relay nodes at set intervals and determining the target optimized relay node based on the optimal relay node addresses returned by each mesh node, completes the mesh network node optimization. This approach enables the optimization of multiple relay nodes simultaneously, significantly reducing the number of broadcasts in the mesh network and effectively mitigating broadcast storms.

[0046] Combination Figure 2 As shown, this disclosure provides an optimization method for wireless mesh networks, applied to mesh network nodes. The mesh network includes multiple interconnected mesh network nodes. The optimization method includes the following steps:

[0047] S201, determine the optimal relay node corresponding to the Mesh network node according to the update command.

[0048] The update instruction is one of N update instructions sent by the control node to the relay node in the Mesh network at set intervals, where N is an integer greater than or equal to 2.

[0049] Optionally, the update instruction includes a sequence number, instruction lifespan, and the node address of the sending node.

[0050] The sequence number indicates the type of update instruction. The instruction time-to-live (TTL) decreases with each relay. The sending node's address is unique, and the corresponding node is determined based on the sending node's address. Based on the update instruction's sequence number, the optimal relay node corresponding to the Mesh network node is determined according to the latest instruction's TTL and the latest node address. This method accurately identifies the optimal relay node for each Mesh network node and is simple and easy to implement.

[0051] Optionally, determining the optimal relay node corresponding to the Mesh network node based on the update instruction includes: obtaining the latest update instruction sent by the relay node; determining the latest instruction lifespan and the latest node address of the relay node in the latest update instruction; and determining the optimal relay node corresponding to the Mesh network node based on the latest instruction lifespan and the latest node address.

[0052] The latest update command is the last update command sent by the control node. For example, if the control node sends one update command to a relay node in the mesh network, this command is the latest update command; if the control node sends five update commands to relay nodes in the mesh network at set intervals, the fifth command is the latest update command. Determining the optimal relay node for a mesh network node based on the latest command's lifespan and latest node address is accurate and easy to implement.

[0053] Optionally, the optimal relay node corresponding to the Mesh network node is determined based on the latest instruction lifespan and the latest node address, including: if the latest instruction lifespan is greater than or equal to the instruction lifespan stored in the Mesh network node, the relay node corresponding to the latest node address is determined as the optimal relay node; if the latest instruction lifespan is less than the instruction lifespan stored in the Mesh network node, the relay node corresponding to the node address stored in the Mesh network node is determined as the optimal relay node.

[0054] In practical applications, after receiving the network optimization control command issued by the user, the control node sends a start optimization broadcast command to all Mesh network nodes within the Mesh network. The Mesh network nodes receive the start optimization broadcast command from the control node and enter recording mode. After entering recording mode, the control node sends a first update command B1 to the relay nodes in the Mesh network. Upon receiving the first update command B11 from the sending node, the Mesh network node records the sequence number sn11, the instruction time-to-live (ttl11) value, and the node address s11 of the previous sending node from the first update command B11. Upon receiving the second update command B12 from other sending nodes, the Mesh network node obtains the sequence number sn12, the instruction time-to-live (ttl12) value, and the node address s12 of the previous sending node from the second update command B12. The control node compares the instruction lifetime (ttl11) and ttl12 values. If the ttl11 value is larger than the ttl12 value, it indicates better signal transmission of the first update instruction B11. The relay node corresponding to node address s11 is then determined as the optimal relay node. The sequence number sn11, instruction lifetime (ttl11), and the sending node's address s11 from the first update instruction B11 are saved. After a preset interval (e.g., 0.5 seconds), the control node sends a second update instruction B2 to a relay node in the Mesh network. Upon receiving the second update instruction B2 from the sending node, the Mesh network node obtains the sequence number sn2, instruction lifetime (ttl2), and the address s2 of the previous sending node from the second update instruction B2. Compare the instruction lifetime (ttl11) and ttl2 values. If the ttl2 value is larger than the ttl11 value, it indicates better signal transmission for the second update instruction B2. In this case, the relay node corresponding to node address s2 is determined to be the optimal relay node. The sequence number sn2, instruction lifetime (ttl2), and the sending node address s2 from the first update instruction B2 are saved. Update instructions B3-Bn are then sent continuously at preset intervals. If the latest instruction lifetime is greater than or equal to the instruction lifetime stored by the Mesh network node, the relay node corresponding to the latest node address is determined to be the optimal relay node. If the latest instruction lifetime is less than the instruction lifetime stored by the Mesh network node, the relay node corresponding to the node address stored by the Mesh network node is determined to be the optimal relay node.

[0055] By comparing the lifespan of the latest updated instruction with that of the instruction stored in the Mesh network node, and then determining the optimal relay node corresponding to the Mesh network node based on the node address of the corresponding sending node, the optimal relay node corresponding to the Mesh network node can be accurately determined, and the operation is simple and easy to implement.

[0056] Other implementations for determining the optimal relay node corresponding to a Mesh network node based on the latest instruction liveness time and the latest node address are not limited here. For example, the difference between the latest instruction liveness time and the maximum liveness time can also be calculated. If the latest liveness time difference is less than or equal to the liveness time difference stored by the Mesh network node, the relay node corresponding to the latest node address is determined to be the optimal relay node; if the latest liveness time difference is greater than the liveness time difference stored by the Mesh network node, the relay node corresponding to the node address stored by the Mesh network node is determined to be the optimal relay node.

[0057] S202, send the node address of the optimal relay node to the control node, so that the control node can determine the target optimized relay node based on the node addresses of the optimal relay nodes sent by each Mesh network node, and send optimization instructions to the target optimized relay node.

[0058] The optimization command is used to instruct the target optimization relay node to disable its relay function.

[0059] The optimization method for wireless mesh networks provided in this disclosure involves a control node sending N update commands to relay nodes in the mesh network at set intervals. Each mesh node determines its optimal relay node based on these update commands and then sends its address to the control node. The control node then determines the target optimized relay node based on the addresses of the optimal relay nodes sent by each mesh node and sends optimization commands to that target node. This method, by sending N update commands to relay nodes at set intervals and determining the target optimized relay node based on the optimal relay node addresses returned by each mesh node, completes the mesh network node optimization. This approach enables the optimization of multiple relay nodes simultaneously, significantly reducing the number of broadcasts in the mesh network and effectively mitigating broadcast storms.

[0060] Combination Figure 3 As shown, this disclosure provides an optimization method for wireless mesh networks, applied to mesh network nodes. The optimization method includes the following steps:

[0061] S301, receive the latest update command sent by the relay node.

[0062] S302, determine the latest instruction's lifespan and the latest node address of the relay node in the latest update instruction.

[0063] S303: If the lifespan of the latest instruction is greater than or equal to the lifespan of the instructions stored in the Mesh network node, determine the relay node corresponding to the latest node address as the optimal relay node.

[0064] S304, after determining that the instruction relay node corresponding to the latest node address is the optimal instruction relay node, update the node address saved by the relay node to the latest node address.

[0065] S305: If the lifespan of the latest instruction is less than the lifespan of the instructions stored in the Mesh network node, determine the relay node corresponding to the node address stored in the Mesh network node as the optimal relay node.

[0066] The optimization method for wireless mesh networks provided in this disclosure involves controlling nodes to send N update commands to relay nodes in the mesh network at set intervals. Then, based on the node address of the optimal relay node fed back by each mesh network node according to the update commands, the target optimized relay node is determined, thereby completing the mesh network node optimization. This method can optimize multiple relay nodes simultaneously, significantly reducing the number of broadcasts in the mesh network and significantly mitigating broadcast storms. Furthermore, after determining the instruction relay node corresponding to the latest node address as the optimal instruction relay node, the node address stored in the relay node is updated to the latest node address, improving the accuracy of optimal relay node identification and thus enhancing the precision of mesh network optimization.

[0067] Combination Figure 4 As shown, this disclosure provides an optimization method for wireless mesh networks applied to mesh network nodes, comprising the following steps:

[0068] S401, the control node sends N update commands to the relay nodes in the Mesh network at set intervals.

[0069] S402, Mesh network nodes receive update commands.

[0070] S403, the Mesh network node determines the optimal relay node corresponding to the Mesh network node according to the update command.

[0071] S404, Mesh network nodes send the node address of the optimal relay node to the control node.

[0072] S405, the control node receives the node address of the optimal relay node.

[0073] S406, the control node determines the target optimized relay node based on the node address of the optimal relay node sent by each Mesh network node.

[0074] S407, the control node sends an optimization command to the target optimization relay node.

[0075] The optimization method for wireless mesh networks provided in this disclosure involves a control node sending N update commands to relay nodes in the mesh network at set intervals. Then, based on the node address of the optimal relay node fed back by each mesh network node according to the update commands, the target optimized relay node is determined, thereby completing the node optimization of the mesh network. By flexibly issuing control parameters, redundant relay nodes in the mesh network are selected and optimized and shut down, significantly reducing the number of broadcasts in the mesh network, reducing broadcast storms in the mesh network, and improving the success rate of command execution.

[0076] Combination Figure 7 The present disclosure provides an optimization apparatus for wireless mesh networks, including a processor 70 and a memory 71, and may further include a communication interface 72 and a bus 73. The processor 70, communication interface 72, and memory 71 can communicate with each other via the bus 73. The communication interface 72 can be used for information transmission. The processor 70 can call logical instructions in the memory 71 to execute the optimization method for wireless mesh networks described in the above embodiment.

[0077] Furthermore, the logic instructions in the aforementioned memory 71 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium.

[0078] The memory 71, as a computer-readable storage medium, can be used to store software programs and computer-executable programs, such as program instructions / modules corresponding to the methods in the embodiments of this disclosure. The processor 70 executes functional applications and data processing by running the program instructions / modules stored in the memory 71, thereby implementing the optimized method for wireless mesh networks in the above method embodiments.

[0079] The memory 71 may include a program storage area and a data storage area. The program storage area may store the operating system and application programs required for at least one function; the data storage area may store data created based on the use of the terminal device. Furthermore, the memory 71 may include high-speed random access memory and may also include non-volatile memory.

[0080] The optimization apparatus for wireless mesh networks provided in this disclosure involves a control node sending N update commands to relay nodes in the mesh network at set intervals. Each mesh node determines its optimal relay node based on these update commands and then sends its address to the control node. The control node, based on the addresses of the optimal relay nodes sent by each mesh node, determines the target optimized relay node and sends optimization commands to it. This process—sending N update commands to relay nodes at set intervals and determining the target optimized relay node based on the address of the optimal relay node returned by each mesh node—completes the mesh network node optimization. It enables simultaneous optimization of multiple relay nodes, significantly reducing the number of broadcasts in the mesh network and effectively mitigating broadcast storms.

[0081] Combination Figure 8 As shown, this disclosure provides an electronic device (e.g., a computer, server, etc.) 80, including: an electronic device body, and the aforementioned optimization device 90 for wireless mesh networks. The optimization device 90 for wireless mesh networks is mounted on the electronic device body. The mounting relationship described herein is not limited to placement inside the product, but also includes mounting connections with other components of the product, including but not limited to physical connections, electrical connections, or signal transmission connections. Those skilled in the art will understand that the optimization device 90 for wireless mesh networks can be adapted to feasible electronic device bodies to achieve other feasible embodiments.

[0082] This disclosure provides a computer program that, when executed by a computer, enables the computer to implement the above-described optimization method for wireless mesh networks.

[0083] This disclosure provides a computer program product including computer instructions stored on a computer-readable storage medium. When the program instructions are executed by a computer, the computer implements the above-described optimization method for wireless mesh networks.

[0084] This disclosure provides a computer-readable storage medium storing computer-executable instructions configured to perform the above-described optimization method for wireless mesh networks.

[0085] The aforementioned computer-readable storage medium may be a transient computer-readable storage medium or a non-transitory computer-readable storage medium.

[0086] The technical solutions of this disclosure can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes one or more instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in this disclosure. The aforementioned storage medium can be a non-transitory storage medium, including: a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and other media capable of storing program code; it can also be a transient storage medium.

[0087] The technical solutions of this disclosure can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes one or more instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in this disclosure. The aforementioned storage medium can be a non-transitory storage medium, including: a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and other media capable of storing program code; it can also be a transient storage medium.

[0088] The foregoing description and accompanying drawings fully illustrate embodiments of the present disclosure to enable those skilled in the art to practice them. Other embodiments may include structural, logical, electrical, procedural, and other changes. The embodiments represent only possible variations. Individual components and functions are optional unless explicitly required, and the order of operation may vary. Parts and features of some embodiments may be included or substituted for parts and features of other embodiments. The scope of the embodiments of this disclosure includes the entire scope of the claims and all available equivalents of the claims. While the terms “first,” “second,” etc., may be used in this application to describe elements, these elements should not be limited by these terms. These terms are used only to distinguish one element from another. For example, a first element may be called a second element without changing the meaning of the description, and similarly, a second element may be called a first element, provided that all occurrences of “first element” are consistently renamed and all occurrences of “second element” are consistently renamed. First and second elements are both elements, but may not be the same element. Moreover, the terminology used in this application is only for describing embodiments and is not intended to limit the claims. As used in the description of the embodiments and claims, unless the context clearly indicates otherwise, the singular forms “a,” “an,” and “the” are intended to also include the plural forms. Similarly, the term “and / or” as used herein means including one or more of the associated listed elements and all possible combinations thereof. Additionally, when used herein, the terms “comprise” and its variations “comprises” and / or “comprising” refer to the presence of stated features, integrals, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components, and / or groups thereof. Without further limitations, an element defined by the phrase “comprising an…” does not exclude the presence of additional identical elements in the process, method, or apparatus that includes said element. In this document, each embodiment may focus on the differences from other embodiments, and similar or identical parts between embodiments can be referred to mutually. For methods, products, etc., disclosed in the embodiments, if they correspond to the method section disclosed in the embodiments, the relevant parts can be referred to the description of the method section.

[0089] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the embodiments of this disclosure. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0090] The methods and products (including but not limited to devices and equipment) disclosed in the embodiments herein can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For instance, the division of units may be merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the shown or discussed units may be through some interfaces, and the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the units may be selected to implement this embodiment according to actual needs. Furthermore, the functional units in the embodiments of this disclosure may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0091] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than that shown in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. In the descriptions corresponding to the flowcharts and block diagrams in the accompanying drawings, the operations or steps corresponding to different blocks may also occur in a different order than disclosed in the description, and sometimes there is no specific order between different operations or steps. For example, two consecutive operations or steps may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. Each block in a block diagram and / or flowchart, and combinations of blocks in a block diagram and / or flowchart, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

Claims

1. An optimization method for wireless mesh networks, applied to control nodes, characterized in that, The mesh network comprises multiple interconnected mesh network nodes; the optimization method includes: N update instructions are sent to relay nodes in the Mesh network at consecutive intervals to determine the optimal relay node for each Mesh network node based on the update instructions; where N is an integer greater than or equal to 2; the sending of N update instructions to relay nodes in the Mesh network at consecutive intervals includes: sending one update instruction to a relay node in the Mesh network at every consecutive interval, for a total of N update instructions; each Mesh network node determines its optimal relay node as follows: obtaining the latest update instruction sent by the relay node, determining the latest instruction lifespan and the latest node address of the relay node in the latest update instruction, and determining the corresponding optimal relay node based on the latest instruction lifespan and the latest node address; The target optimized relay node is determined based on the node address of the optimal relay node sent by each Mesh network node. An optimization instruction is sent to the target optimized relay node; wherein the optimization instruction is used to instruct the target optimized relay node to disable its relay function.

2. The optimization method according to claim 1, characterized in that, The number of update instructions N is determined as follows: Determine the number of relay nodes in the Mesh network; The number of update instructions N is determined based on the number of relay nodes.

3. The optimization method according to claim 2, characterized in that, Determining the number of update instructions N based on the number of relay nodes includes calculating the number of update instructions N according to the following formula: Where N is the number of update instructions, The preset number of update commands is given, where M is the number of relay nodes. The preset number of relay nodes is used to calculate the number of update instructions added to the preset number of update instructions N0. That is, the number of update instructions added to the preset number of update instructions N0 is determined by taking the integer part of the quotient of the number of relay nodes M and the preset number of relay nodes M0.

4. The optimization method according to claim 1, characterized in that, The step of determining the target optimized relay node based on the node address of the optimal relay node sent by each Mesh network node includes: Traverse the node addresses of all relay nodes in the Mesh network; Obtain the target node address from all relay node addresses, excluding the node address of the optimal relay node sent by each Mesh network node. The relay node corresponding to the target node address is determined as the target optimized relay node.

5. The optimization method according to any one of claims 1 to 4, characterized in that, The update instruction includes a serial number, instruction lifespan, and the node address of the sending node.

6. An optimization method for wireless mesh networks, characterized in that, The mesh network comprises multiple interconnected mesh network nodes; the optimization method includes: In each Mesh network node, the optimal relay node corresponding to itself is determined according to the update instruction. The update instruction is one of N update instructions sent by the control node to the relay nodes in the Mesh network node at continuous intervals of a set time interval, where N is an integer greater than or equal to 2. Sending N update instructions to the relay nodes in the Mesh network node at continuous intervals of a set time interval includes sending one update instruction to the relay nodes in the Mesh network node at each set time interval, for a total of N update instructions. Each Mesh network node determines its corresponding optimal relay node in the following manner: obtaining the latest update instruction sent by the relay node, determining the latest instruction's lifespan and the latest node address of the relay node in the latest update instruction, and determining the corresponding optimal relay node based on the latest instruction's lifespan and the latest node address. Each Mesh network node sends the node address of the optimal relay node to the control node, so that the control node determines the target optimized relay node based on the node addresses of the optimal relay nodes sent by each Mesh network node, and sends an optimization command to the target optimized relay node; wherein, the optimization command is used to instruct the target optimized relay node to disable relay function.

7. The optimization method according to claim 6, characterized in that, The step of determining the corresponding optimal relay node based on the latest instruction's lifespan and the latest node address includes: If the lifespan of the latest instruction is greater than or equal to the lifespan of the instructions stored in this Mesh network node, the relay node corresponding to the latest node address is determined as the optimal relay node. If the lifespan of the latest instruction is less than the lifespan of the instructions stored in this Mesh network node, the relay node corresponding to the node address stored in this Mesh network node is determined as the optimal relay node.

8. An optimization apparatus for wireless mesh networks, comprising a processor and a memory storing program instructions, characterized in that, The processor is configured to perform the optimized method for wireless mesh networks as described in any one of claims 1 to 7 when executing the program instructions.

9. An electronic device, characterized in that, include: The main body of the electronic device; as well as, The optimization device for wireless mesh networks as described in claim 8 is installed on the main body of the electronic device.

Images