A LoRa tree networking method, device and equipment

Abstract

The present invention discloses a method, apparatus, and device for LoRa tree networking. The method comprises: a gateway or router receives a node network joining request packet, and calculates a delayed response time based on the routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is: delay = (d+1)*100-5*SNR+|RSSI| / 5; wherein, delay is the delayed response time, in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; and RSSI is the signal strength; if the node's network joining type data is received during the delayed response time, the lock is abandoned; otherwise, a network joining lock packet is sent to the node. The present invention proposes a LoRa tree networking method, which relates to low-power wide area networks, the Internet of Things, wireless networking, and other fields. The method solves the problem that when LoRa is forming a tree network, routing forwarding occurs simultaneously, resulting in excessive forwarding in the system, leading to system congestion, performance degradation, increased packet loss rate, and increased power consumption.

Description

Technical Field

[0001] The present invention relates to the field of LoRa technology, and in particular to a method, apparatus, and device for LoRa tree networking. Background Art

[0002] LoRa is a low-power long-range wireless communication technology, where "LoRa" is the abbreviation of Long Range Radio. Its biggest feature is that it can transmit farther than other wireless methods under the same power consumption conditions, achieving the unity of low power consumption and long distance. It can extend the communication distance by 3-5 times than traditional wireless radio frequency under the same power consumption.

[0003] In many application scenarios, where obstructions exist or the distance between nodes and gateways prevents direct communication, routers must be added between the nodes and gateways. This creates a tree-like network consisting of gateways, routers, and nodes. The gateway serves as the network's management and data center, connecting to platforms via the internet for remote monitoring and control. It also uses LoRa to form a tree-like network structure. Routers are nodes with data forwarding capabilities. Expanding the number of routers effectively expands the LoRa system's coverage. Routers access the network in the same manner as nodes. Nodes generally serve as terminals for data collection, reporting, and receiving downlink data for control purposes; they do not forward data.

[0004] In existing technologies, when establishing a tree network, after a node sends a network request, any router that receives the network request and determines that it is not the destination address will forward the network request until it reaches the gateway. The gateway ultimately selects the optimal path and sends the network response information to the node along that path, thus completing the tree network establishment. This can easily lead to LoRa routers forwarding simultaneously when establishing a tree network, resulting in excessive forwarding, system congestion, performance degradation, increased packet loss rate, and increased power consumption. Summary of the Invention

[0005] In view of this, the purpose of the present invention is to propose a LoRa tree networking method, device and equipment, which can solve the problems of LoRa routing and forwarding simultaneously when forming a tree network, resulting in excessive forwarding in the system, causing system congestion, performance degradation, increased packet loss rate and increased power consumption.

[0006] According to one aspect of the present invention, a method for LoRa tree networking is provided, the method comprising:

[0007] When the gateway or router receives the node joining request packet, it calculates the delayed response time based on the routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is:

[0008] delay=(d+1)*100-5*SNR+|RSSI| / 5

[0009] Where delay is the delay response time, in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength;

[0010] If the network type data of the node is received during the delayed response time, the locking is abandoned; otherwise, a network locking packet is sent to the node.

[0011] In the above technical solution, the locking is completed at the initial stage of network addition, and there is only one optimal path to the gateway. This process achieves as few false awakenings of nodes as possible, which is beneficial to improving the low-power performance of the system. The present invention proposes a LoRa tree networking method, which relates to the fields of low-power wide area network, Internet of Things, wireless networking, etc., and solves the problems of LoRa routing and forwarding at the same time when forming a tree network, which leads to excessive forwarding in the system, resulting in system congestion, performance degradation, increased packet loss rate and increased power consumption. The method has locked the route of the optimal path at the source of the network node, avoiding invalid route forwarding. The route is only forwarded after the route is locked. Finally, there is only one optimal path to forward the network request to the gateway, effectively reducing the number of forwarding times and improving system performance.

[0012] In some embodiments, the gateway or router receives a node joining request packet, and then further includes:

[0013] Determine whether the signal-to-noise ratio and signal strength are less than the specified minimum value. If so, do not participate in forwarding.

[0014] In the above technical solution, it is first determined whether the signal-to-noise ratio (SNR) and signal strength (RSSI) are less than the specified minimum limit value. If they are less than the minimum limit value, it means that the signal quality is poor and subsequent communication may be unstable. The forwarding is not carried out to prevent the use of a path with poor signal quality from causing subsequent communication instability.

[0015] In some embodiments, sending a network lock packet to a node further includes:

[0016] If the network lock confirmation packet of the node is not received within the timeout period, the network joining process is exited; if the router receives the network lock confirmation packet of the node, it reports the network joining request to the gateway according to its own path to the gateway; when the gateway receives the network forwarding packet, it returns along the original path reported.

[0017] In the above technical solution, the path selection is sunk to the first level of nodes and routes, and the locking is completed at the node end. After that, only the routes that are successfully locked will be forwarded, which effectively reduces the number of data forwarding times.

[0018] In some embodiments, the method specifically:

[0019] If the node can communicate directly with the gateway, the steps are as follows:

[0020] The node initiates a network joining request packet. The gateway and several other routers receive the network joining request at the same time. The gateway's routing depth is zero, and the delayed response time is as follows:

[0021] GW = 100 - 5 * SNR + |RSSI| / 5 <R i =(d+1)*100-5*SNR+|RSSI| / 5

[0022] In the formula, GW is the gateway, R i is the i-th route.

[0023] The gateway puts the assigned address and path into the network joining response packet and sends it out. The other routers give up the network joining lock after receiving the network joining response. At the same time, node E receives the network joining response.

[0024] After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network.

[0025] In the above technical solution, there are mainly two situations when joining the network, namely, being able to communicate directly with the gateway and being unable to communicate directly with the gateway. The above solution provides a situation where the node can communicate directly with the gateway.

[0026] In some embodiments, if the node cannot communicate directly with the gateway, the steps are as follows:

[0027] The node sends a node-initiated network joining request packet. Several routes receive the network joining request at the same time. The priority of several routes is determined by the delayed response time.

[0028] The route with the highest priority sends a network lock packet, and the other routes exit the network joining process after receiving the network lock packet or lock response packet; after the node receives the network lock packet from the route with the highest priority, it sends a network lock confirmation packet to complete the locking.

[0029] In the above technical solution, there are mainly two situations when joining the network, namely, being able to communicate directly with the gateway and being unable to communicate directly with the gateway. The above solution describes the situation where the node cannot communicate directly with the gateway.

[0030] In some embodiments, after providing a screen lock confirmation packet to complete the lock, the following steps are further included:

[0031] After receiving the network lock confirmation packet, the router with the highest priority learns that it has successfully locked with the node, and then reports the network lock request packet to the gateway step by step through unicast along its own path to the gateway;

[0032] After receiving the network joining request packet, the gateway puts the assigned short address and path into the network joining response packet and transmits it to the node step by step through unicast;

[0033] After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network.

[0034] In the above technical solution, the present invention completes the locking of the upper-level route at the first level of the node and the route, and other routes will also complete the actions of giving up locking or attempting to lock in a short time. When the gateway responds to the network acceptance packet, the network joining request and locking packet of the node no longer exist in the system, which greatly improves the communication success rate and enhances the system performance.

[0035] According to another aspect of the present invention, there is provided a LoRa tree networking device, based on the above method, comprising:

[0036] Analysis module: used for gateway or router to receive node network request packets and calculate the delayed response time based on routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is:

[0037] delay=(d+1)*100-5*SNR+|RSSI| / 5

[0038] Where delay is the delay response time, in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength;

[0039] The locking module is configured to abandon locking if the network type data of the node is received during the delayed response time; otherwise, send a network locking packet to the node.

[0040] In the above technical solution, in order to better use the above method, the present application proposes a LoRa tree networking device, each module corresponds to each step of the above method, and its specific principles have been described above and will not be repeated here.

[0041] According to another aspect of the present invention, a LoRa tree networking device is provided, comprising:

[0042] at least one processor and a memory communicatively coupled to the at least one processor;

[0043] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can perform the above method.

[0044] In the above technical solution, in order to better run and process the method, the above method is stored in a memory and a processor is used to execute the stored method. It should be noted that the principle and effect of each step have been described above and will not be further explained here.

[0045] According to another aspect of the present invention, a computer-readable storage medium is provided, storing a computer program, wherein the computer program implements the above method when executed by a processor.

[0046] In the above technical solution, in order to better run and use the method, the above method is stored in a computer-readable storage medium and implemented by a processor. It should be noted that the principle and effect of each step have been described above and will not be further explained here. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0048] Figure 1 This is a flow chart of an embodiment of a LoRa tree networking method of the present invention;

[0049] Figure 2 This is a LoRa tree network topology diagram of an embodiment of a LoRa tree networking method of the present invention;

[0050] Figure 3 This is a specific example diagram of an embodiment of a LoRa tree networking method of the present invention;

[0051] Figure 4 This is a communication example diagram of a LoRa tree networking method according to an embodiment of the present invention that can directly communicate with a gateway;

[0052] Figure 5 This is a communication example diagram of an embodiment of a LoRa tree networking method of the present invention that cannot directly communicate with the gateway;

[0053] Figure 6 It is a structural diagram of an embodiment of a LoRa tree networking device of the present invention. DETAILED DESCRIPTION

[0054] The present invention will be described in further detail below with reference to the accompanying drawings and examples. It is particularly noted that the following examples are intended only to illustrate the present invention and are not intended to limit the scope of the present invention. Similarly, the following examples are only some embodiments of the present invention and are not intended to be exhaustive. All other embodiments obtained by those of ordinary skill in the art without creative effort are intended to fall within the scope of protection of the present invention.

[0055] The present invention provides a LoRa tree networking method, apparatus, and device, which can solve the problems of LoRa routing and forwarding simultaneously when forming a tree network, thereby causing excessive forwarding in the system, resulting in system congestion, performance degradation, increased packet loss rate, and increased power consumption.

[0056] Upon receiving a join request, the router in the existing method will forward the join data. This creates a large number of data forwarding packets in the LoRa network. Many nodes are low-power, battery-powered devices, and may be mistakenly awakened when receiving a router forwarding packet, significantly increasing power consumption and reducing battery life. This large number of forwarded packets can create a data storm. If a node needs to report emergency alarm data at this time, there is a high probability of packet loss or long delays before it reaches the platform, resulting in losses. The fundamental reason for this shortcoming is that the existing technology places the decision-making power of path selection entirely on the gateway. Therefore, the router receiving the join request has no authority to act and will forward the join request packet to the next higher-level router until it reaches the gateway. This process inevitably generates a large number of join data forwarding packets. Due to the low communication rate of LoRa, each communication takes a long time. If the system forwards too many packets, it can lead to large data collisions, delayed transmission, and even data storms. Please refer to the following examples for details on this phenomenon.

[0057] Example 1

[0058] See also Figure 1 , a LoRa tree networking method, the method comprising:

[0059] S1. The gateway or router receives the node joining request packet and calculates the delayed response time based on the routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is:

[0060] delay=(d+1)*100-5*SNR+|RSSI| / 5

[0061] Where delay is the delay response time in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength; the gateway or router receives the network joining request packet, which may be the routing or node to be joined.

[0062] In this embodiment, the gateway or router receives the node network joining request packet, which then includes:

[0063] Determine whether the signal-to-noise ratio and signal strength are less than the specified minimum limit. If so, do not participate in forwarding. First, determine whether the signal-to-noise ratio (SNR) and signal strength (RSSI) are less than the specified minimum limit. If they are, it indicates that the signal quality is poor and subsequent communication may be unstable. Do not participate in forwarding to prevent the use of paths with poor signal quality from causing subsequent communication instability.

[0064] S2. If the node's locking information or other network type data (which may be a network response or node lock confirmation packet directly given by the gateway) is received during the delayed response time, the locking is abandoned; otherwise, a network lock packet is sent to the node.

[0065] In this embodiment, the network locking packet is sent to the node, and then the following steps are further included:

[0066] S4. If the network lock confirmation packet of the node is not received within the timeout period, the network joining process is exited; if the router receives the network lock confirmation packet of the node, it reports the network joining request to the gateway according to its own path to the gateway; when the gateway receives the network forwarding packet, it returns along the original path reported.

[0067] In this embodiment, path selection is moved down to the first level of nodes and routes, and locking is completed at the node end. Afterwards, only successfully locked routes are forwarded, effectively reducing the number of data forwarding times.

[0068] In this embodiment, the present invention selects the optimal path and sinks it to the route near the node. Through a delayed response algorithm, the waiting time is calculated. The higher-priority route responds earlier and obtains the locking authority. The route is locked at the first level of the route and node. The route that fails to lock will no longer forward the network data. The network request will only be forwarded from the path from the successfully locked route to the gateway. After receiving the network request, the gateway returns the network response packet to the node along the original path, thereby completing the allocation of the node short address and data communication link. In this network process, only the route that successfully locks with the node will perform subsequent network forwarding. Other routes will no longer forward, effectively reducing the number of forwardings and the probability of false awakening of the node, thereby improving the overall performance of the system.

[0069] In this embodiment, the method is specifically divided into two cases: one is that the node can communicate directly with the gateway, and the other is that the node cannot communicate directly with the gateway. The steps of the two methods are as follows:

[0070] (1) Nodes can communicate directly with the gateway

[0071] A1. The node initiates a network joining request packet. The gateway and several other routers receive the network joining request at the same time. The gateway's routing depth is zero, and the delayed response time is as follows:

[0072] GW = 100 - 5 * SNR + |RSSI| / 5 <R i =(d+1)*100-5*SNR+|RSSI| / 5

[0073] In the formula, GW is the gateway, R i The gateway has a routing depth of zero and a waiting time of the shortest possible time to respond first, giving it the highest priority.

[0074] A2. The gateway puts the assigned address and path into a network joining response packet and sends it out. The remaining routers give up the network joining lock after receiving the network joining response. Meanwhile, node E receives the network joining response.

[0075] A3. After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network.

[0076] (2) Nodes cannot communicate directly with the gateway

[0077] B1. A node sends a node-initiated network joining request packet. Several routes receive the network joining request at the same time. The priority of several routes is determined by the delayed response time.

[0078] B2: The highest-priority router issues a join lock packet. The remaining routers exit the join process after receiving the join lock packet or a lock acknowledgement packet. After receiving the join lock packet from the highest-priority router, the node issues a join lock confirmation packet to complete the join. This happens because if a node is between two gateways, the gateways cannot receive data from each other, but can still communicate with the node. Therefore, the node may abandon the join process only after receiving the lock acknowledgement packet from the node.

[0079] In this embodiment, in the second case, a screen lock confirmation packet is provided to complete the lock, and then the following steps are further included:

[0080] B21. After receiving the network lock confirmation packet, the router with the highest priority knows that it has successfully locked with the node. It then reports the network lock request packet to the gateway step by step through unicast along its own path to the gateway.

[0081] B22. After receiving the network joining request packet, the gateway puts the assigned short address and path into the network joining response packet and transmits it to the node step by step through unicast;

[0082] B23. After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network.

[0083] In this embodiment, the locking of the upper-level route is completed at the first level of the node and the route, and other routes will also complete the actions of giving up locking or attempting to lock in a short time. When the gateway responds to the network acceptance packet, the network joining request and locking packet of the node no longer exist in the system, which greatly improves the communication success rate and enhances the system performance.

[0084] In this embodiment, the present invention proposes a LoRa tree networking method, which is relevant to low-power wide area networks, the Internet of Things, wireless networking, and other fields. This method addresses the problem of simultaneous routing and forwarding in LoRa tree networks, which can lead to excessive forwarding in the system, resulting in system congestion, performance degradation, increased packet loss, and increased power consumption. This method locks the optimal route at the source of the networked node, avoiding ineffective routing forwarding. Only after the route is locked does the routing forwarding begin. Ultimately, only one optimal path forwards the networked request to the gateway, effectively reducing the number of forwarding times and improving system performance.

[0085] In order to further illustrate the specific working principle of the present invention, the following will be described in detail:

[0086] See also Figure 2 This figure shows the LoRa tree network topology, which includes three roles: gateway, router, and node. The gateway serves as the network's management center and data center. Router and node data must interact with the platform through the gateway via the Internet. The communication addresses and paths of nodes and routers are allocated by the gateway. Routers are nodes with data forwarding capabilities. Routers and nodes are added to the network in the same way. Generally, the closer the router is to the gateway, the earlier it is added to the network. This allows for the optimal network to be constructed when the tree network is subsequently constructed. Nodes are generally used for data acquisition and remote control terminals. Nodes do not have data forwarding capabilities and are generally low-power battery-powered devices.

[0087] The existing technology has the following three reasons: when LoRa forms a tree network, it routes and forwards packets simultaneously, which leads to excessive forwarding in the system, resulting in system congestion, performance degradation, increased packet loss rate, and increased power consumption.

[0088] (1) The choice of the original technical path is at the gateway end. After receiving the network joining request, the router will forward the network joining request until it is forwarded to the gateway. If there are many routes, the system will be full of forwarding packets, which is prone to data storms.

[0089] (2) The original technology is to screen the paths at the gateway end and select the appropriate path for allocation. However, when the gateway sends the network joining response packet, some routes may still be forwarding the network joining request packet. At this time, the data may be lost due to collision in the air, resulting in a decrease in the network joining success rate. In addition, if an emergency event is reported during this process, data may be lost or delayed seriously.

[0090] (3) The routing of the original technology will forward the network request packet after receiving it. Since most nodes are low-power battery-powered devices, a large number of nodes may be woken up by mistake, resulting in increased power consumption and reduced battery life.

[0091] Based on the above three points, the specific beneficial effects of the method proposed in the present invention are as follows:

[0092] (1) The present invention sinks the path selection to the first level of nodes and routes, and completes the locking at the node end. After that, only the routes that are successfully locked will be forwarded, effectively reducing the number of data forwarding times.

[0093] (2) The present invention completes the locking of the upper-level route at the first level of the node and route, and other routes will also complete the actions of giving up locking or attempting to lock in a short time. When the gateway responds to the network acceptance packet, the network joining request and locking packet of the node no longer exist in the system, which greatly improves the communication success rate and enhances the system performance.

[0094] (3) The present invention completes the locking at the initial stage of network joining, and there is only one optimal path to the gateway. This process minimizes the number of false awakenings of nodes, thereby improving the low power consumption performance of the system.

[0095] Based on the above three points, the detailed solutions of the present invention are as follows:

[0096] See also Figure 3 This figure is a specific example diagram of the present invention, which shows the process of calculating the delayed response time and completing the locking process with the node after the gateway or router receives the network request packet. The details are as follows:

[0097] Step 101: A gateway or a router receives a network joining request packet, where the network joining request packet may be a router or a node to be joined.

[0098] Step 102: First determine whether the signal-to-noise ratio (SNR) and signal strength (RSSI) are less than the specified minimum limit value. If they are less than the minimum limit value, it means that the signal quality is poor and subsequent communication may be unstable. Do not participate in forwarding to prevent the use of a path with poor signal quality from causing subsequent communication instability.

[0099] Step 103: Calculate the delayed response time using the routing depth (d), signal-to-noise ratio (SNR), and signal strength (RSSI). The weighted priority is d > SNR > RSSI. The number of hops to the gateway is the depth. The gateway's depth d is 0, so the gateway has the highest priority. The signal-to-noise ratio (SNR) value can be negative or positive. A larger value shortens the wait time, while a smaller value results in a longer wait time and a lower priority. Negative signal strength values ​​are calculated by taking their absolute value. Smaller values ​​result in longer wait times and lower priority. The formula for calculating the delayed response time is delay (ms) = (d + 1) * 100 - 5 * SNR + |RSSI| / 5. If this is a gateway, the lock is skipped and the process proceeds directly to step 108 to execute the network joining response.

[0100] Step 104: If the node receives a network lock, lock confirmation packet, network forwarding, or network completion response from the node while waiting to send the lock packet, it means that a better path than itself has been added to the network and the node has already performed further network addition operations. Then, the node abandons the lock and does not participate in the subsequent network addition process.

[0101] Step 105: If no network lock packet, lock confirmation packet, network forwarding packet, network completion response packet, etc. are received during the waiting period, a network lock packet is sent to the node to try to lock with the node.

[0102] Step 106: If the node does not receive a network lock confirmation packet within the timeout period, the network lock process is exited. If the node has successfully locked with another router, it will not respond to other network locks.

[0103] Step 107: After receiving the lock confirmation packet, the router reports the network joining request to the gateway according to the path from itself to the gateway.

[0104] Step 108: Upon receiving the network join forwarding packet, the gateway returns along the original path reported, completing the entire process. If the gateway can directly receive the network join request packet and the signal quality is good, the gateway skips the locking process and directly sends the network join response packet to the node, completing the network join process. The gateway also adds the node and path to the tree network.

[0105] In the system, E is a node, GW is a gateway, and R is a router. There are two main situations when joining the network: communicating directly with the gateway and not communicating directly with the gateway. The following describes the network joining process in detail for the two situations:

[0106] (1) Can communicate directly with the gateway

[0107] See also Figure 4 , follow the communication steps as follows:

[0108] Step S-1: Node E initiates a network joining request. GW, R1, and R2 receive the network joining request at the same time. Assuming the signal quality meets the specification, the gateway depth is 0, R1 depth is 1, and R2 depth is 2, so the response priority should be GW>R1>R2.

[0109] Step S-2: The gateway puts the allocated address and path into a network joining response packet and sends it out. R1 receives the network joining response and gives up the network joining lock. Meanwhile, node E also receives the network joining response.

[0110] Step S-3: R2 is far away from the gateway and cannot receive the network joining response from GW. After the waiting time is up, R2 will try to lock with E. R2 sends a network joining lock packet to E. Since R2 has a lower priority than GW, when R2 sends the network joining lock packet, E is receiving the network joining confirmation packet or has completed the network joining. Regardless of the status, E will not respond to R2's lock packet. R2 exits the network joining process after the waiting timeout.

[0111] Finally, after receiving the gateway network joining response packet, E obtains the short address and the path to the gateway as E->GW. The gateway also adds node E and the path to the tree network.

[0112] (2) Cannot communicate directly with the gateway

[0113] See also Figure 5 , will be described in detail according to the communication sequence number:

[0114] Step S-1: Node E initiates a network joining request. R2, R3, and R8 receive the network joining request packet at the same time. The depth values ​​d of R2 and R3 are both 2, and the depth value of R8 is 3. Therefore, R8 has a larger depth value and the longest waiting time. R2 and R3 have the same depth, but R2 has better signal quality. The final priority is R2>R3>R8.

[0115] Step S-2: By calculating that R2 has priority in providing the network lock packet, R3 can also receive the packet sent by R2. R3 is now in the waiting state and exits the network process after receiving the network lock packet from R2.

[0116] Step S-3: After receiving the network lock packet sent by R2, the node sends a network lock confirmation packet, thus completing the lock with R2. If the network lock response packet is not received within the timeout period, the node can re-initiate the network lock.

[0117] Step S-4: After receiving the network lock confirmation packet, R2 knows that the node lock is successful, and then reports the network request packet to the gateway level by level through unicast along its own path to the gateway, and first forwards the network request packet to the upper-level router R1.

[0118] Step S-5: After receiving the network joining request forwarded by R2, R1 forwards it to the gateway.

[0119] Step S-6: After receiving the network joining request packet, the gateway places the assigned short address and path into the network joining response packet and sends it to R1 according to the reported path. The path to node E, [GW->R1->R2->E], is added to the tree network to establish the network.

[0120] Step S-7: After receiving the addition response packet from GW, R1 forwards it to R2 along the path.

[0121] Step S-8: After receiving the network joining response forwarding packet from R1, R2 forwards it to node E. At this point, node E completes the network joining request operation and obtains the assigned short address and the communication path to the gateway: E->R2->R1->GW.

[0122] Step S-9: After receiving E's network joining request, R8 calculates the delay time, and if it does not receive the network joining response packet, network joining lock packet, network joining lock confirmation packet, etc. during the waiting process, it will send the network joining lock packet to E. At this time, E is in the receiving S-2 state or has completed the reception of S-2. Regardless of the state, it will not respond to R8's lock packet. If R8 still does not receive the lock confirmation packet after the waiting timeout, it will exit the network joining process.

[0123] Based on the above detailed steps, it can be seen that compared with the existing technology, the present invention finds the optimal path and completes the route lock at the beginning of the network addition, and then only forwards from this path to the gateway. The existing technology is that the path selection right is in the gateway. After the router receives the network addition data, it forwards it until the gateway makes a path selection. The present invention reduces the invalid network addition forwarding of the router, thereby greatly reducing the probability of other nodes being woken up by mistake, thereby improving the battery life of low-power devices. In addition, due to the reduction of data packets in the system, the probability of data collision is reduced, the success rate of network addition is improved, the occurrence of data storms is prevented, and the system performance is improved. In this process, if there is an emergency report, it can also be reported in a timely manner and handled in a timely manner.

[0124] Example 2

[0125] See also Figure 6 , a LoRa tree networking device, based on the method described in one of the embodiments; comprising:

[0126] Analysis module: used for gateway or router to receive node network request packets and calculate the delayed response time based on routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is:

[0127] delay=(d+1)*100-5*SNR+|RSSI| / 5

[0128] Where delay is the delay response time, in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength;

[0129] The locking module is configured to abandon locking if the network type data of the node is received during the delayed response time; otherwise, send a network locking packet to the node.

[0130] In this embodiment, in order to better use the method described in one of the embodiments, the present application proposes a LoRa tree networking device, each module corresponds to each step of the above method, and its specific principles have been described above and will not be repeated here.

[0131] Embodiment 3

[0132] A LoRa tree networking device, comprising:

[0133] at least one processor and a memory communicatively coupled to the at least one processor;

[0134] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can perform the above method.

[0135] In this embodiment, in order to better execute and process the method described in one embodiment, the above method is stored in a memory, and a processor is used to execute the method described in one of the stored embodiments. It should be noted that the principles and effects of each step have been described above and will not be further explained here.

[0136] Example 4

[0137] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the method described in one of the embodiments.

[0138] In this embodiment, in order to better execute and use the method described in one embodiment, the above method is stored in a computer-readable storage medium, and a processor is used to implement the method described in one embodiment. It should be noted that the principles and effects of each step have been described above and will not be further explained here.

[0139] The above descriptions are only some embodiments of the present invention and do not limit the scope of protection of the present invention. Any equivalent device or equivalent process transformation made by using the contents of the description and drawings of the present invention, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A LoRa tree networking method, characterized in that: The method comprises: When the gateway or router receives the node joining request packet, it calculates the delayed response time based on the routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is: delay = (d+1)*100 - 5*SNR + |RSSI| / 5 Where delay is the delay response time, in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength; If any one of the network response packet, network lock packet, and network lock confirmation packet is received from the node during the delayed response time, the lock is abandoned; otherwise, a network lock packet is sent to the node; The method specifically: If the node can communicate directly with the gateway, the steps are as follows: The node initiates a network joining request packet. The gateway and several other routers receive the network joining request at the same time. The gateway's routing depth is zero, and the delayed response time is as follows: delay GW =100-5*SNR + |RSSI| / 5 <delay Ri = (d+1)*100 - 5*SNR + |RSSI| / 5 Where delay GW The delay time for the gateway to respond. Ri is the delayed response time of the i-th route; The gateway puts the assigned address and path into the network joining response packet and sends it out. The other routers receive the network joining response packet during their delayed response time and give up the network joining lock. At the same time, node E receives the network joining response packet. After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network. If the node cannot communicate directly with the gateway, the steps are as follows: The node sends a network request packet, and several routers receive the network request at the same time. The priority of several routes is determined by their respective delayed response time; The highest priority route sends a network lock packet. The remaining routes exit the network joining process after receiving a network lock packet or a network lock confirmation packet during their delayed response time. After receiving the network lock packet from the highest priority route, the node sends a network lock confirmation packet to complete the locking. After receiving the network lock confirmation packet, the router with the highest priority learns that it has successfully locked with the node, and then reports the network lock request packet to the gateway step by step through unicast along its own path to the gateway; After receiving the network joining request packet, the gateway puts the assigned short address and path into the network joining response packet and transmits it to the node step by step through unicast; After receiving the gateway network joining response packet, the node obtains the short address and the path to the gateway. The gateway also adds node E and the path to the tree network.

2. A LoRa tree networking method as claimed in claim 1, characterized in that, The gateway or router receives the node network request packet, which also includes: Determine whether the signal-to-noise ratio and signal strength are less than the specified minimum value. If so, do not participate in forwarding.

3. A LoRa tree networking method as claimed in claim 1, characterized in that, Send a network lock packet to the node, followed by: If the network lock confirmation packet of the node is not received within the timeout period, the network joining process is exited; if the router receives the network lock confirmation packet of the node, it reports the network joining request to the gateway according to its own path to the gateway; when the gateway receives the network forwarding packet, it returns along the original path reported.

4. A LoRa tree networking device, characterized in that: The method according to any one of claims 1 to 3; comprising sequentially connecting: Analysis module: used for gateway or router to receive node network request packets and calculate the delayed response time based on routing depth, signal-to-noise ratio, and signal strength. The delayed response time calculation formula is: delay = (d+1)*100 - 5*SNR + |RSSI| / 5 Where delay is the delayed response time in milliseconds; d is the routing depth; SNR is the signal-to-noise ratio; RSSI is the signal strength; Locking module: used for giving up locking if the network type data of the node is received during the delayed response time; Otherwise, send a network lock packet to the node.

5. A LoRa tree networking device, characterized in that: include: at least one processor and a memory communicatively coupled to the at least one processor; The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 3.

6. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.

Images