Rapid network access method during dynamic cut-in of Mesh network nodes

By using greedy algorithms and battery considerations in the Mesh network, the problem of slow network access speed and short battery life of Mesh network nodes is solved, and the real-time and stability of the network are improved.

CN119031439AActive Publication Date: 2024-11-26CHONGQING UNIV OF POSTS & TELECOMM
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202410988764.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-23
Publication Date
2024-11-26
Estimated Expiration
2044-07-23

AI Technical Summary

Technical Problem

The network access process of Mesh network nodes is slow, affecting the real-time and scalability of the network. The battery life of passive nodes in wireless sensor networks limits their performance, resulting in blind spots in network coverage and unstable data transmission.

Method used

The Mesh network adopts a centralized structure, uses greedy algorithms to quickly select relay nodes, combine the remaining power and signal strength of the node as the basis for relay selection, reduce routing discovery time, improve the network access speed of new nodes, and extend the battery life of nodes through dynamic load balancing. .

Benefits of technology

It improves the real-time and scalability of the network, extends the battery life of the node, and enhances the stability and overall performance of data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119031439A_ABST
    Figure CN119031439A_ABST
Patent Text Reader

Abstract

The invention relates to a rapid network access method during dynamic cut-in of Mesh network nodes, and belongs to the field of Internet of Things. The method comprises the following steps: when a new node accesses a network, firstly detecting whether a network signal exists, if the network signal is detected, broadcasting an RREQ, and waiting for an RREP in the network; all in-network nodes in the network calculate own state scores according to own state information, and construct an RREP and reply after receiving the RREQ broadcasted by the new node; after the new node receives the RREP, the state score of each response node is calculated again, and a plurality of relay nodes are selected to construct a route; and after the route is constructed, the new node constructs a network access application frame and forwards the network access application frame to the central node through the relay node, and the central node judges whether to agree to access the network of the new node. According to the method, the node residual electric quantity is comprehensively considered as the selection basis of the relay node, and the relay node is quickly selected by using the greedy algorithm, so that the route discovery time is shortened, and the network access speed of the new node is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of Internet of Things, and relates to a fast network access method when a Mesh network node is dynamically cut in. Background Art

[0002] A wireless sensor network is a self-organizing network consisting of a large number of dispersed sensor nodes that collect and exchange information about the monitoring area through wireless communication technology.

[0003] Compared with other network topologies, wireless Mesh network topology has the following advantages: 1. Easy deployment and installation: It is very simple to install Mesh network nodes, allowing users to easily add new Mesh network nodes to increase the network capacity and coverage of the Mesh network; 2. Stability: In a Mesh network, each node has one or several transmission paths. If a node fails or is interfered with, the data packet can still transmit the data to the destination through other paths; 3. Flexible structure: Devices can access the network through different nodes without causing a decrease in system performance. During the transmission process, each device has multiple transmission paths available. The network can dynamically allocate communication routes according to the communication load of each node, effectively avoiding node congestion.

[0004] Due to the complex structure of Mesh network, the process of new nodes joining the network is slow, which affects the real-time and scalability of the network. And due to the lack of a fast route discovery mechanism, new nodes may take a long time to find the best path to the destination. At the same time, some wireless sensor networks deploy passive nodes, which rely on built-in batteries to run. Battery life becomes a key factor limiting their performance. Battery life not only affects the continuous operation of a single node, but also the stability of the entire network. Nodes with exhausted batteries may cause blind spots in network coverage, affecting data collection and transmission. Summary of the invention

[0005] In view of this, the purpose of the present invention is to provide a method for quickly accessing a Mesh network node when it is dynamically switched in, by comprehensively considering the remaining power of the node as the basis for selecting a relay node, and using a greedy algorithm to quickly select the relay node, thereby reducing the route discovery time and improving the speed at which new nodes access the network.

[0006] In order to achieve the above object, the present invention provides the following technical solutions:

[0007] A method for fast network access when a Mesh network node is dynamically cut in. The Mesh network to which this method is applicable adopts a centralized structure, which includes a central node (CN) and several sub-nodes. Among them, the central node plays a core role in network management and control, and is responsible for maintaining the global information of the network, including routing tables, node status, etc. The sub-nodes are divided into relay nodes (RN) and ordinary nodes (Node). Relay nodes have data forwarding and routing functions. They are usually located in the center or key positions of the network to ensure that data can flow efficiently in the network. Ordinary nodes are mainly responsible for collecting and sending data, but do not have the responsibility of data forwarding. When a new node requests to join the network, it will send a network access request to the central node. The central node quickly authenticates and allocates necessary network parameters based on the current network status.

[0008] The method provided by the present invention comprises the following steps:

[0009] S1. In a Mesh network, when a new node joins the network, it first detects whether there is a network signal. If a network signal is detected, it broadcasts a route request frame (RREQ) and waits for a route response frame (RREP) from the network.

[0010] S2. All nodes in the network calculate their own status scores based on their own status information. After receiving the RREQ broadcast by the new node, they construct RREP and reply.

[0011] Among them, the network node regularly obtains its own status information such as remaining power and hop count, and calculates the status score based on this status information;

[0012] S3. After receiving the RREP, the new node calculates the status score of each response node again, and then uses the greedy algorithm to select multiple relay nodes based on the status score of each response node, and uses the selected relay nodes to build the route;

[0013] S4. After the route is built, the new node constructs a network access application frame and forwards it to the central node through the relay node. The central node determines whether to approve the new node to access the network.

[0014] S5. After the new node successfully joins the network, the fast relay network access process ends.

[0015] Furthermore, the new node determines whether there is a network signal by detecting the received signal strength (RSSI); if the RSSI value is higher than a set threshold, it is considered that the new node has entered the network coverage and there is a network signal; otherwise, the channel is switched to continue detection.

[0016] Furthermore, the status score is calculated by the following formula:

[0017]

[0018] node score =ω 1 ×Hop score +ω 2 ×battery score +ω 3 ×rssi score

[0019] In the formula, node score Represents the state score of the node; ω 1 ,ω 2 ,ω 3 is the weight coefficient; Hop score Indicates the node hop score, Hop count Indicates the number of hops from the response node to the central node; battery score Indicates the node power status score, voltage full Indicates the voltage value when the battery is fully charged. empty Indicates the voltage value when the battery is exhausted, current voltage Indicates the current voltage value of the battery; rssi score Indicates the node signal strength score, rssi value Indicates the actual current signal strength value between two nodes, rssi threshold Indicates ideal signal strength, rssi range Indicates the signal strength variation range.

[0020] Furthermore, when each node on the network constructs a RREP, if there are multiple routes, the state score of the neighboring nodes on each route needs to be calculated separately.

[0021] Furthermore, when the new node recalculates the status scores of each responding node after receiving the RREP, it is necessary to first obtain the actual signal strength value rssi between the new node and each responding node. value Then, the status score of each response node is calculated based on the number of hops and power information in the response node routing response frame. score .

[0022] After the status score is recalculated, the new node will calculate each response node according to the status score node score Sorting is performed to generate a sorting table, and then a greedy algorithm is used to select three response nodes with the highest scores from the sorting table as relay nodes.

[0023] Furthermore, after receiving the network access application frame of the new node, the central node evaluates the current network capacity. If the current network has sufficient resources to accommodate the new node, it agrees to allow the new node to access the network, fills the result in the network access application response frame, and sends the network access application response frame to the new node.

[0024] Furthermore, after the new node successfully joins the network, if there is a subsequent new node that selects the new node that has joined the network as a relay node, the new node that has joined the network is changed from a common node to a relay node.

[0025] The beneficial effects of the present invention are:

[0026] (1) The present invention uses a greedy algorithm to quickly select relay nodes, reduce routing discovery time, improve network efficiency and the speed at which new nodes join the network, and enhance the real-time and scalability of the network.

[0027] (2) The present invention realizes load balancing by comprehensively considering the remaining power of the node as the basis for relay selection, which can extend the battery life of the node and further improve the stability of data transmission and the overall performance of the network.

[0028] Other advantages, objectives and features of the present invention will be described in the following description to some extent, and to some extent, will be obvious to those skilled in the art based on the following examination and study, or can be taught from the practice of the present invention. The objectives and other advantages of the present invention can be realized and obtained through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention will be described in detail below in conjunction with the accompanying drawings, wherein:

[0030] Figure 1 It is a schematic diagram of the process of the method of the present invention;

[0031] Figure 2 This is the Mesh network structure diagram;

[0032] Figure 3 Schematic diagram of the new node broadcast process. DETAILED DESCRIPTION

[0033] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and features in the embodiments can be combined with each other without conflict.

[0034] This embodiment builds a Mesh network, such as Figure 2 As shown in the figure, the network adopts a centralized structure, including a central node and several sub-nodes. Among them, the central node plays a core role in network management and control, and is responsible for maintaining the global information of the network, including routing tables, node status, etc. The sub-nodes are divided into relay nodes and ordinary nodes. Relay nodes have data forwarding and routing functions. They are usually located in the center or key positions of the network to ensure that data can flow efficiently in the network; ordinary nodes are mainly responsible for collecting and sending data, but do not have the responsibility of data forwarding.

[0035] In this network, when a new node requests to join the network, it sends a network access request to the central node. The central node quickly performs authentication and allocates necessary network parameters based on the current network status. In this embodiment, the network access method of the new node is as follows: Figure 1 As shown, the specific process is as follows:

[0036] Step 1: The new node detects whether there is a network signal. Specifically, by detecting RSSI, if the RSSI value is higher than the set threshold, it is considered that the new node has entered the network coverage. If the new node does not detect the corresponding RSSI, it switches the channel to continue to detect whether there is a network. The set threshold is -70dBm.

[0037] Step 2: After detecting the network signal, the new node broadcasts REEQ and waits for REEP from the network to collect relevant status information of surrounding nodes. The REEQ format and REEP format are shown in Table 1 and Table 2 respectively.

[0038] Table 1

[0039] Fields describe Message Type Distinguishing different message types RREQ ID Distinguishing different routing requests life cycle The maximum time that a RREQ can exist in the network Destination IP address Destination node address Source IP address Source node address

[0040] Table 2

[0041]

[0042]

[0043] In the REEP structure shown in Table 2, the accumulated node score The value refers to the sum of the comprehensive scores of all relay nodes on the path from the current response node to the central node. Whenever a data packet arrives at a new relay node, the node will update the accumulated node score, that is, add its own score to the current accumulated value.

[0044] In step 2, specifically, the REEQ broadcast process of the new node is as follows: Figure 3 As shown. First, the new node prepares to send a broadcast message and initializes the broadcast sequence; then the new node constructs the broadcast message according to the REEQ format; before sending the broadcast, the new node needs to use the CSMA / CA mechanism to detect whether the channel is idle to reduce conflicts; when the channel is idle, the new node sends the broadcast message and sets a continuous receiving time window after broadcasting REEQ. In this embodiment, the time window lasts for 200ms and is used to receive REEP from surrounding nodes.

[0045] Step 3: All nodes in the network periodically obtain their own status information such as remaining power and hop count, and calculate their own status score based on the status information. After receiving the REEQ from the new node, they construct and reply REEP.

[0046] The calculation process of the own status score is as follows:

[0047]

[0048] node score =ω 1 ×Hop score +ω 2 ×battery score +ω 3 ×rssi score (4)

[0049] Among them, Hop score Hop is the node hop score. count is the number of hops from the node to the central node, battery score is the node power status score, voltage full is the voltage value when the battery is fully charged. empty is the voltage value when the battery is exhausted, current voltage is the current voltage value of the battery, rssi score is the node signal strength score, rssi value is the actual signal strength value between two nodes, rssi threshold is the ideal signal strength, rssi range is the signal strength variation range, and its value is rssi max-rssi min , node score is the node comprehensive status score, ω 1 ,ω 2 ,ω 3 is a constant, and ω 1 +ω 2 +ω 3 = 1. In particular, the rssi between nodes value It is detected by the receiving node through scanning the wireless channel during the communication process.

[0050] It should be noted that in the process of constructing REEP, there may be multiple routes to the responding node, and the neighbor nodes on each route need to be calculated separately. score Among them, neighbor nodes refer to nodes that can communicate directly within the wireless coverage area.

[0051] Step 4: After receiving the REEP of the online node, the new node recalculates the status score of each responding node based on its own RSSI measurement value relative to the neighboring node. Specifically, the new node obtains the RSSI between itself and the responding node. value , and according to the hop count, power and other information in the response frame of the response node, the node is recalculated and updated through equations (1) to (4). score , all the response nodes are sorted according to their node score Sort.

[0052] Step 5: Based on the ranking table generated in step 4, apply the greedy algorithm to select the node with the highest priority as the relay node, and select the three nodes with the highest scores in the ranking table as relay nodes. Then use the selected relay nodes to build multiple routes to the network center or other destination nodes.

[0053] Among them, the greedy algorithm is a method that selects the best option in the current state in each step, which can quickly determine the local optimal relay node without waiting for the calculation of the global optimal solution, thereby speeding up the speed of new nodes entering the network.

[0054] Step 6: After the route is built, the new node constructs a network application frame and forwards it to the central node through the relay node. After receiving the network application frame, the central node evaluates the current network capacity and determines whether there are enough resources to accommodate the new node. It determines whether to agree to the new node to join the network and fills the result in the reply network application response frame. The formats of the network application frame and the network application response frame are shown in Table 3 and Table 4.

[0055] Table 3

[0056] Fields describe Message Type Identify the frame as a network access application frame Source Address New node address Destination Address Central node address Serial Number Used to match network application Node Status Including battery level, etc. Routing ID Uniquely identifies each route <![CDATA[Accumulate node score > <![CDATA[Accumulated node for each route score > Hop Count Number of hops from the new node to the central node Relay Node List The address of the relay node that the new node passes through

[0057] Table 4

[0058]

[0059]

[0060] Step 7: When the new node successfully joins the network, the fast relay network access process ends. If a routing request frame from other newly joined nodes is subsequently received, step 3 and subsequent steps are executed.

[0061] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solution, which should be included in the scope of the claims of the present invention.

Claims

1. A method for fast network access when a Mesh network node is dynamically switched in, characterized by: The method comprises: when a new node enters the network, it first detects whether there is a network signal, if a network signal is detected, it broadcasts a route request frame, and waits for a route response frame from the network; the networked nodes in the network calculate their own state scores according to their own state information, and after receiving the route request frame broadcast by the new node, they construct and reply a route response frame; after receiving the route response frame, the new node calculates the state score of each response node again, and then uses a greedy algorithm to select multiple relay nodes based on the state score of each response node, and uses the selected relay nodes to construct a route; after the route is constructed, the new node constructs a network entry application frame and forwards it to the central node through the relay node, and the central node determines whether to approve the new node to enter the network.

2. The fast network access method according to claim 1, characterized in that: The new node determines whether there is a network signal by detecting the received signal strength; if the received signal strength is higher than a set threshold, it is considered that the new node has entered the network coverage and there is a network signal; otherwise, the channel is switched to continue detection.

3. The fast network access method according to claim 1, characterized in that: The status score is calculated by the following formula: node score =ω1×Hop score +ω2×battery score +ω3×rssi score In the formula, node score Represents the state score of the node; ω1, ω2, ω3 are weight coefficients; Hop score Indicates the node hop score, Hop count Indicates the number of hops from the response node to the central node; battery score Indicates the node power status score, voltage full Indicates the voltage value when the battery is fully charged. empty Indicates the voltage value when the battery is exhausted, current voltage Indicates the current voltage value of the battery; rssi score Indicates the node signal strength score, rssi value Indicates the actual current signal strength value between two nodes, rssi threshold Indicates ideal signal strength, rssi range Indicates the signal strength variation range.

4. The fast network access method according to claim 1, characterized in that: When each node on the network constructs a routing response frame, if there are multiple routes, the state score of the neighboring nodes on each route needs to be calculated separately.

5. The fast network access method according to claim 1, characterized in that: In the process of calculating the status score of each responding node again after receiving the routing response frame, the new node needs to first obtain the actual signal strength value rssi between the new node and each responding node. value Then, the status score of each response node is calculated based on the number of hops and power information in the response node routing response frame. score .

6. The fast network access method according to claim 5, characterized in that: The new node scores each response node according to its status score Sorting is performed to generate a sorting table, and then a greedy algorithm is used to select three response nodes with the highest scores from the sorting table as relay nodes.

7. The fast network access method according to claim 1, characterized in that: After receiving the network access application frame of the new node, the central node evaluates the current network capacity. If the current network has sufficient resources to accommodate the new node, it agrees to allow the new node to enter the network, fills the result in the network access application response frame, and sends the network access application response frame to the new node.

Citation Information

Patent Citations

  • Multi-hop self-organizing sleep routing algorithm

    CN104320829A

  • Method of switching root node in mesh network

    CN108366406A

  • Multi-hop networking switching method and device, computer equipment, medium and program product

    CN118201022A

  • Hybrid ad-hoc routing protocol

    US20220417140A1