Chained Mesh network ordered networking addressing method and system

Abstract

The invention relates to a chain Mesh network ordered networking addressing method and system, and the method comprises the following steps: a node which is not provided with a network broadcasts beacons to surrounding nodes, each node receives the surrounding broadcast beacons, and records the broadcast beacons of the surrounding nodes; each node receives the broadcast beacon, calculates a comprehensive score of each surrounding node, and sorts the plurality of surrounding nodes according to the comprehensive scores; a plurality of nodes with comprehensive scores in the front row around each node are selected as neighbors, and a multi-level neighborhood relation is established; selecting a node as a network base point, and setting an initial address and an automatic address increment value of the network base point; and according to the initial address and the automatic address increment value of the network base point, automatic address allocation and networking are carried out on the multilevel neighborhood relation of the network base point and other nodes in sequence. According to the invention, automatic address allocation and networking are realized, rapid positioning and maintenance are facilitated, the installation and debugging efficiency is improved, and the cost can be effectively reduced.

Description

Technical Field

[0001] The present invention relates to the field of Internet of Things communication technology, and more particularly to a method and system for orderly networking and addressing of a chained Mesh network. Background Art

[0002] Currently, the addressing of lamps in tunnel lighting single-lamp control technology mainly adopts DIP switch addressing, 485-MDX wired addressing, wireless sensor trigger addressing and fixed address QR code scanning to record the lamp address. There is a lack of efficient and low-cost lamp addressing implementation solutions. In the current mesh networking address allocation method, the addresses assigned to nodes by distribution network equipment are in a disordered state and cannot be arranged in an orderly manner according to the installation location of the lamps, which is not conducive to rapid fixed-point control in multi-node scenarios. Summary of the Invention

[0003] The present invention aims to address, at least to a certain extent, one of the aforementioned technical problems in the prior art. To this end, one objective of the present invention is to provide a method and system for chained mesh network addressing that automatically allocates addresses and forms a network, facilitates rapid location and maintenance, improves installation and debugging efficiency, and effectively reduces costs.

[0004] The present invention solves the above-mentioned technical problem with the following technical solution: A chained Mesh network orderly networking addressing method comprises the following steps: The unconnected nodes broadcast beacons to the nodes around them. At the same time, each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes. Each node receives the broadcast beacon, calculates the comprehensive score of each surrounding node, and sorts the multiple nodes around it according to the comprehensive score; each node selects several nodes with the highest comprehensive scores as its neighbors, establishing a multi-level neighborhood relationship; Select a node as the network base point, set the initial address and automatic address increment value of the network base point; according to the initial address and automatic address increment value of the network base point, automatically assign addresses and network the multi-level neighborhood relationship of the network base point and other nodes.

[0005] The beneficial effects of the present invention are: by calculating the comprehensive scores of other nodes around a node, sorting the nodes around it according to the comprehensive scores, building its multi-level neighborhood relationship, and automatically allocating addresses and networking according to its multi-level neighborhood relationship, the cost of manual configuration of the network can be effectively reduced, the allocated addresses are strictly increased according to the physical location, which facilitates the rapid positioning and maintenance of the nodes, can improve the installation and debugging efficiency of lamps, and reduce construction costs.

[0006] On the basis of the above technical solution, the present invention can also be improved as follows.

[0007] Furthermore, each node calculates the comprehensive score of each surrounding node based on the received broadcast beacon, which specifically includes the following steps: Each node samples the broadcast beacon of each node around it multiple times, obtains multiple RSSI values ​​and UUID information of the broadcast signal of each node, calculates the average of the multiple RSSI values ​​of each node, and obtains the average RSSI value of the signal of each node; The variance of multiple RSSI values ​​of each node is calculated to obtain the RSSI value variance of each node; the signal-to-noise ratio of each node is calculated based on the broadcast signals sampled multiple times; The comprehensive scores of multiple nodes are calculated based on the RSSI mean, RSSI variance and signal-to-noise ratio of each node.

[0008] The beneficial effect of adopting the above further scheme is: calculating the comprehensive scores of multiple nodes based on the signal RSSI mean, RSSI variance and signal-to-noise ratio of each node, sorting the nodes using the comprehensive scores, and taking the nodes with high comprehensive scores as their neighbors to establish their multi-level neighborhood relationships; thereby achieving efficient screening of better nodes and improving the efficiency of nodes in building multi-level neighborhood relationships.

[0009] Furthermore, the calculation algorithm of the comprehensive score is as follows: in: , , is the adjustment coefficient, , It is the linearity adjustment coefficient, the basic value is 0.5, and it can be adjusted by ±0.1; is the signal-to-noise ratio coefficient, the basic value is 0.3, and it can be adjusted by ±0.1; It is the signal fluctuation coefficient, with a basic value of 0.2 and can be adjusted by ±0.1.

[0010] Furthermore, each node selects several nodes with the highest comprehensive scores around it as its neighbors, and the establishment of its multi-level neighborhood relationship specifically includes the following steps: Each node selects the four nodes with the highest comprehensive scores around it, selects the two devices with the highest comprehensive scores from the four nodes and sets them as the first neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the first right neighbor of the node, and another node is set as the first left neighbor of the node; selects the two nodes with the second lowest comprehensive scores from the four nodes and sets them as the second neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the second right neighbor of the node, and another node is set as the second left neighbor of the node.

[0011] The beneficial effects of adopting the above further scheme are: selecting neighbors of nodes by comprehensive scores, selecting and marking nodes by comprehensive scores, and establishing their multi-level neighborhood relationships; improving the efficiency of nodes in building multi-level neighborhood relationships.

[0012] Furthermore, the method further comprises the following steps: The neighbors of the network base point are used to perform neighborhood verification. If the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed. If the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

[0013] The beneficial effect of adopting the above further solution is: through base point anchoring, neighborhood exchange and neighborhood verification, nodes are automatically assigned addresses according to the preset initial address and address increment, ensuring that the Mesh address is strictly incremented according to the physical location.

[0014] Furthermore, the method further comprises the following steps: When an exception occurs during the node networking process, the node is triggered to re-establish the neighborhood relationship and network again; when the node networking fails for more than three consecutive times, manual intervention is performed to end the current networking or manually designate the next network distribution node to continue the networking operation.

[0015] The beneficial effect of adopting the above further solution is: facilitating manual intervention on nodes that fail to network, and ensuring the continuous advancement of node networking.

[0016] Another technical solution of the present invention to solve the above technical problems is as follows: a chain-type Mesh network orderly networking addressing system, comprising: A collection module, wherein the collection module broadcasts beacons from the unconnected nodes to the surrounding nodes, and each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes; A calculation module, which uses the broadcast beacons received by each node to calculate the comprehensive score of each surrounding node and sort the multiple nodes around it according to the comprehensive score; each node selects several surrounding nodes with the highest comprehensive scores as its neighbors, and establishes a multi-level neighborhood relationship; The networking module selects a node as a network base point, sets an initial address and an automatic address increment value of the network base point, and automatically allocates addresses and networks the multi-level neighborhood relationships of the network base point and other nodes according to the initial address and the automatic address increment value of the network base point.

[0017] The beneficial effects of the present invention are: by calculating the comprehensive scores of other nodes around a node, sorting the nodes around it according to the comprehensive scores, building its multi-level neighborhood relationship, and automatically allocating addresses and networking according to its multi-level neighborhood relationship, the cost of manual configuration of the network can be effectively reduced, the allocated addresses are strictly increased according to the physical location, which facilitates the rapid positioning and maintenance of the nodes, can improve the installation and debugging efficiency of lamps, and reduce construction costs.

[0018] On the basis of the above technical solution, the present invention can also be improved as follows.

[0019] Furthermore, it also includes: The verification module uses the neighbors of the network base point to perform neighborhood verification. If the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed. If the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

[0020] The beneficial effect of adopting the above further solution is: through base point anchoring, neighborhood exchange and neighborhood verification, nodes are automatically assigned addresses according to the preset initial address and address increment, ensuring that the Mesh address is strictly incremented according to the physical location.

[0021] Furthermore, it also includes: The abnormal module triggers the node to re-establish the neighborhood relationship and re-network when an abnormality occurs during the node networking process; when the node networking fails for more than three consecutive times, manual intervention is performed to end the current networking or manually designate the next distribution node to continue the networking operation.

[0022] The beneficial effect of adopting the above further solution is: facilitating manual intervention on nodes that fail to network, and ensuring the continuous advancement of node networking. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 This is a flow chart of a chained Mesh network orderly networking addressing method of the present invention; Figure 2 This is a module block diagram of a chain-type Mesh network ordered networking addressing system of the present invention.

[0024] In the accompanying drawings, the components represented by the reference numerals are as follows: 1. Acquisition module, 2. Calculation module, 3. Networking module, 4. Verification module, 5. Exception module. DETAILED DESCRIPTION

[0025] The principles and features of the present invention are described below with reference to the accompanying drawings. The examples given are only used to explain the present invention and are not used to limit the scope of the present invention.

[0026] like Figure 1As shown, a chain-type Mesh network orderly networking addressing method includes the following steps: The unconnected nodes broadcast beacons to the nodes around them. At the same time, each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes. Each node receives the broadcast beacon, calculates the comprehensive score of each surrounding node, and sorts the multiple nodes around it according to the comprehensive score; each node selects several nodes with the highest comprehensive scores as its neighbors, establishing a multi-level neighborhood relationship; Select a node as the network base point, set the initial address and automatic address increment value of the network base point; according to the initial address and automatic address increment value of the network base point, automatically assign addresses and network the multi-level neighborhood relationship of the network base point and other nodes.

[0027] When this embodiment is applied specifically, by calculating the comprehensive scores of other nodes around the node, sorting the nodes around it according to the comprehensive scores, building its multi-level neighborhood relationship, and automatically allocating addresses and networking according to its multi-level neighborhood relationship, it can effectively reduce the cost of manual configuration and networking. The allocated addresses are strictly incremented according to the physical location, which is convenient for rapid positioning and maintenance of the nodes, can improve the installation and debugging efficiency of lamps, and reduce construction costs.

[0028] In the above embodiment, each node calculates the comprehensive score of each surrounding node based on the received broadcast beacon, specifically including the following steps: Each node samples the broadcast beacon of each node around it multiple times, obtains multiple RSSI values ​​and UUID information of the broadcast signal of each node, calculates the average of the multiple RSSI values ​​of each node, and obtains the average RSSI value of the signal of each node; The variance of multiple RSSI values ​​of each node is calculated to obtain the RSSI value variance of each node; the signal-to-noise ratio of each node is calculated based on the broadcast signals sampled multiple times; The comprehensive scores of multiple nodes are calculated based on the RSSI mean, RSSI variance and signal-to-noise ratio of each node.

[0029] In the specific application of this embodiment, each node broadcasts a simplified beacon containing UUID information and device type identification, where the UUID information is a universally unique identification code; the broadcast beacon of each node around it is sampled multiple times, and the average of multiple RSSI values ​​is taken as the final signal strength value to reduce instantaneous fluctuation interference; the stability of the signal is evaluated by calculating the RSSI variance, and nodes with high stability are given priority as neighbors; multi-dimensional data is collected and assisted by SNR. SNR is specifically the signal-to-noise ratio, SNR=RSSI-N_floor, where N_floor is the noise floor of dynamic calibration, and the noise floor is usually provided by the chip manual, such as -95dBm.

[0030] The comprehensive scores of multiple nodes are calculated based on the RSSI mean, RSSI variance and signal-to-noise ratio of each node. The nodes are sorted using the comprehensive scores, and nodes with high comprehensive scores are regarded as their neighbors to establish their multi-level neighborhood relationships. This allows for efficient screening of better nodes and improves the efficiency of nodes in building multi-level neighborhood relationships.

[0031] In the above embodiment, the calculation algorithm of the comprehensive score is specifically as follows: in: , , is the adjustment coefficient, , It is the linearity adjustment coefficient, the basic value is 0.5, and it can be adjusted by ±0.1; is the signal-to-noise ratio coefficient, the basic value is 0.3, and it can be adjusted by ±0.1; It is the signal fluctuation coefficient, with a basic value of 0.2 and can be adjusted by ±0.1.

[0032] In the above embodiment, each node selects several nodes with the highest comprehensive scores around it as its neighbors, and establishing a multi-level neighborhood relationship specifically includes the following steps: Each node selects the four nodes with the highest comprehensive scores around it, selects the two devices with the highest comprehensive scores from the four nodes and sets them as the first neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the first right neighbor of the node, and another node is set as the first left neighbor of the node; selects the two nodes with the second lowest comprehensive scores from the four nodes and sets them as the second neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the second right neighbor of the node, and another node is set as the second left neighbor of the node.

[0033] In the specific application of this embodiment, when node A among multiple nodes establishes a multi-level neighborhood relationship, it selects four nodes B, C, D, and E with the highest comprehensive scores from the surrounding nodes as neighbors of node A, and selects nodes B and C with the highest comprehensive scores as the first neighbors, and nodes D and E with the second lowest comprehensive scores as the second neighbors. Node A obtains the UUID information and RSSI value of node B and node C from node B and node C, selects node B with the highest comprehensive score from the first neighbor as the right first neighbor of node A, and node A selects node B with the highest comprehensive score as the right first neighbor of node A. Node B is marked as the first right neighbor node, represented by A-R1-B; node C with a low comprehensive score is selected from the first neighbor as the first left neighbor of node A, and node A marks node C as the first left neighbor, represented by A-L1-C; node D with a high comprehensive score is selected from the second neighbor as the second right neighbor of node A, and node A marks node D as the second right neighbor, represented by A-R2-D; node E with a low comprehensive score is selected from the second neighbor as the second left neighbor of node A, and node A marks node E as the second left neighbor, represented by A-L2-E; This embodiment selects neighbors of a node by comprehensive scores, and also uses the comprehensive scores to select and mark nodes and establish their multi-level neighborhood relationships, thereby improving the efficiency of nodes in building multi-level neighborhood relationships.

[0034] The above embodiment further includes the following steps: The neighbors of the network base point are used to perform neighborhood verification. If the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed. If the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

[0035] In the specific application of this embodiment, node A is selected as the network base point. According to the determined neighborhood relationship of node A: A-R1-B, A-R2-C, there is no left neighbor; the remaining two pre-selected second neighbors D and E; it can be known that node B is the next node to be addressed, and a network configuration invitation is sent to node B, and node B is informed that node A is the first left neighbor of node B, the first right neighbor of node B may be node C, and the second right neighbor may be node D and node E, with node D being the most likely; node B compares and verifies in its own neighborhood relationship list whether node A and node C are the first neighbors of node B. , and verify whether nodes B and C are each other's first neighbors. If not, the neighborhood relationship is re-established; if so, continue to verify whether node A is the left first neighbor of node B, and whether node C is the right first neighbor of node B. If not, trigger neighborhood exchange; similarly, node B takes out node D with the highest comprehensive score among the second neighbors from the neighborhood relationship table, and compares and verifies it with the second neighbor informed by node A, and determines that D is the right second neighbor of node B. At this point, the neighborhood relationship of node B is determined to be: B-L1-A, B-R1-C, B-R2-D. There is no left second neighbor, so E is the node after D.

[0036] This embodiment verifies the neighborhood relationship of node B based on the neighborhood relationship of node A. Through neighborhood verification, the neighborhood relationship chain of the node can be corrected. Through base point anchoring, neighborhood exchange and neighborhood verification, the node is automatically assigned an address according to the preset initial address and address increment, ensuring that the Mesh address is strictly incremented according to the physical location.

[0037] The above embodiment further includes the following steps: When an exception occurs during the node networking process, the node is triggered to re-establish the neighborhood relationship and network again; when the node networking fails for more than three consecutive times, manual intervention is performed to end the current networking or manually designate the next network distribution node to continue the networking operation.

[0038] In the specific application of this embodiment, the initial address and address increment are set, node A is manually selected as the network base point, node B with the highest comprehensive score in the neighborhood relationship is taken, node B is determined to be the first right neighbor and node C is determined to be the second right neighbor, and node C is followed by nodes D and E; node B is invited to join the network, neighborhood verification and neighborhood exchange are performed, B's neighborhood relationship is determined, node C is determined to be the first right neighbor of node B, node C is invited to join the network, neighborhood verification and neighborhood exchange are performed, C's neighborhood relationship is determined, and so on, to complete the networking of multiple nodes; when the networking of the same node fails for more than 3 consecutive times, manual intervention is performed, which facilitates manual intervention on the node that failed to network and ensures the continuous advancement of node networking.

[0039] Example 2

[0040] like Figure 2 As shown, a chain-type Mesh network ordered networking addressing system includes: Acquisition module 1, wherein the acquisition module 1 broadcasts beacons from the unconnected node to the surrounding nodes, and each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes; Calculation module 2, which uses the broadcast beacons received by each node to calculate the comprehensive score of each surrounding node and sort the multiple nodes around it according to the comprehensive score; each node selects several surrounding nodes with the highest comprehensive scores as its neighbors, and establishes a multi-level neighborhood relationship; Networking module 3, the networking module 3 selects a node as a network base point, sets the initial address and automatic address increment value of the network base point; automatically allocates addresses and networks the multi-level neighborhood relationships of the network base point and other nodes according to the initial address and automatic address increment value of the network base point.

[0041] When this embodiment is applied specifically, by calculating the comprehensive scores of other nodes around the node, sorting the nodes around it according to the comprehensive scores, building its multi-level neighborhood relationship, and automatically allocating addresses and networking according to its multi-level neighborhood relationship, it can effectively reduce the cost of manual configuration and networking. The allocated addresses are strictly incremented according to the physical location, which is convenient for rapid positioning and maintenance of the nodes, can improve the installation and debugging efficiency of lamps, and reduce construction costs.

[0042] The above embodiment further includes: Verification module 4, the verification module 4 uses the neighbors of the network base point to perform neighborhood verification, and if the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed; if the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

[0043] In the specific application of this embodiment, node A is selected as the network base point. According to the determined neighborhood relationship of node A: A-R1-B, A-R2-C, there is no left neighbor; the remaining two pre-selected second neighbors D and E; it can be known that node B is the next node to be addressed, and a network configuration invitation is sent to node B, and node B is informed that node A is the first left neighbor of node B, the first right neighbor of node B may be node C, and the second right neighbor may be node D and node E, with node D being the most likely; node B compares and verifies in its own neighborhood relationship list whether node A and node C are the first neighbors of node B. , and verify whether nodes B and C are each other's first neighbors. If not, the neighborhood relationship is re-established; if so, continue to verify whether node A is the left first neighbor of node B, and whether node C is the right first neighbor of node B. If not, trigger neighborhood exchange; similarly, node B takes out node D with the highest comprehensive score among the second neighbors from the neighborhood relationship table, and compares and verifies it with the second neighbor informed by node A, and determines that D is the right second neighbor of node B. At this point, the neighborhood relationship of node B is determined to be: B-L1-A, B-R1-C, B-R2-D. There is no left second neighbor, so E is the node after D.

[0044] This embodiment verifies the neighborhood relationship of node B based on the neighborhood relationship of node A. Through neighborhood verification, the neighborhood relationship chain of the node can be corrected. Through base point anchoring, neighborhood exchange and neighborhood verification, the node is automatically assigned an address according to the preset initial address and address increment, ensuring that the Mesh address is strictly incremented according to the physical location.

[0045] The above embodiment further includes: Abnormal module 5, when an abnormality occurs during the node networking process, the abnormal module 5 triggers the node to re-establish the neighborhood relationship and network again; when the node networking fails for more than 3 consecutive times, manual intervention is performed to end the current networking or manually designate the next distribution node to continue the networking operation.

[0046] In the specific application of this embodiment, the initial address and address increment are set, node A is manually selected as the network base point, node B with the highest comprehensive score in the neighborhood relationship is taken, node B is determined to be the first right neighbor and node C is determined to be the second right neighbor, and node C is followed by nodes D and E; node B is invited to join the network, neighborhood verification and neighborhood exchange are performed, B's neighborhood relationship is determined, node C is determined to be the first right neighbor of node B, node C is invited to join the network, neighborhood verification and neighborhood exchange are performed, C's neighborhood relationship is determined, and so on, to complete the networking of multiple nodes; when the networking of the same node fails for more than 3 consecutive times, manual intervention is performed, which facilitates manual intervention on the node that failed to network and ensures the continuous advancement of node networking.

[0047] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A chain-type Mesh network orderly networking addressing method, characterized in that: The following steps are involved: The unconnected nodes broadcast beacons to the nodes around them. At the same time, each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes. Each node receives the broadcast beacon, calculates the comprehensive score of each surrounding node, and sorts the multiple nodes around it according to the comprehensive score; each node selects several nodes with the highest comprehensive scores as its neighbors, establishing a multi-level neighborhood relationship; Select a node as the network base point, set the initial address and automatic address increment value of the network base point; according to the initial address and automatic address increment value of the network base point, automatically assign addresses and network the multi-level neighborhood relationship of the network base point and other nodes.

2. The chained Mesh network ordered networking addressing method according to claim 1, characterized in that: Each node calculates the comprehensive score of each surrounding node based on the received broadcast beacon. The specific steps include: Each node samples the broadcast beacon of each node around it multiple times, obtains multiple RSSI values ​​and UUID information of the broadcast signal of each node, calculates the average of the multiple RSSI values ​​of each node, and obtains the average RSSI value of the signal of each node; The variance of multiple RSSI values ​​of each node is calculated to obtain the RSSI value variance of each node; the signal-to-noise ratio of each node is calculated based on the broadcast signals sampled multiple times; The comprehensive scores of multiple nodes are calculated based on the RSSI mean, RSSI variance and signal-to-noise ratio of each node.

3. The chained Mesh network orderly networking addressing method according to claim 2, characterized in that: The calculation algorithm of the comprehensive score is as follows: in: , , is the adjustment coefficient, , It is the linearity adjustment coefficient, the basic value is 0.5, and it can be adjusted by ±0.1; is the signal-to-noise ratio coefficient, the basic value is 0.3, and it can be adjusted by ±0.1; It is the signal fluctuation coefficient, with a basic value of 0.2 and can be adjusted by ±0.

1.

4. The chained Mesh network ordered networking addressing method according to claim 1, characterized in that: Each node selects several nodes with the highest comprehensive scores around it as its neighbors. The establishment of its multi-level neighborhood relationship includes the following steps: Each node selects the four nodes with the highest comprehensive scores around it, selects the two devices with the highest comprehensive scores from the four nodes and sets them as the first neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the first right neighbor of the node, and another node is set as the first left neighbor of the node; selects the two nodes with the second lowest comprehensive scores from the four nodes and sets them as the second neighbors of the node, then selects the node with the highest comprehensive score from these two nodes and sets it as the second right neighbor of the node, and another node is set as the second left neighbor of the node.

5. The chained Mesh network orderly networking addressing method according to claim 1, characterized in that: The following steps are also included: The neighbors of the network base point are used to perform neighborhood verification. If the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed. If the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

6. The chained Mesh network orderly networking addressing method according to claim 1, characterized in that: The following steps are also included: When an exception occurs during the node networking process, the node is triggered to re-establish the neighborhood relationship and network again; when the node networking fails for more than three consecutive times, manual intervention is performed to end the current networking or manually designate the next network distribution node to continue the networking operation.

7. A chain-type Mesh network orderly networking addressing system, characterized in that: include: A collection module, wherein the collection module broadcasts beacons from the unconnected nodes to the surrounding nodes, and each node receives the broadcast beacons around it and records the broadcast beacons of the surrounding nodes; A calculation module, which uses the broadcast beacons received by each node to calculate the comprehensive score of each surrounding node and sort the multiple nodes around it according to the comprehensive score; each node selects several surrounding nodes with the highest comprehensive scores as its neighbors, and establishes a multi-level neighborhood relationship; The networking module selects a node as a network base point, sets an initial address and an automatic address increment value of the network base point, and automatically allocates addresses and networks the multi-level neighborhood relationships of the network base point and other nodes according to the initial address and the automatic address increment value of the network base point.

8. The chained Mesh network ordered networking addressing system according to claim 7, characterized in that: Also includes: The verification module uses the neighbors of the network base point to perform neighborhood verification. If the verification is passed, a multi-level neighborhood relationship of the network base point neighbors is constructed. If the verification fails, a neighborhood exchange is performed to correct the multi-level neighborhood relationship of the network base point.

9. The chained Mesh network ordered networking addressing system according to claim 7, characterized in that: Also includes: An exception module, which triggers the node to re-establish a neighbor relationship and re-network when an exception occurs during the node networking process; If the node fails to network for more than three times in a row, manual intervention is performed to end the current networking or manually designate the next network configuration node to continue the networking operation.

Images