Method and device for updating routing information of wireless mesh network, storage medium and wireless node

Abstract

The embodiment of the invention discloses a method and device for updating routing information of a wireless mesh network, a storage medium and a wireless node, and relates to the field of wireless communication. Through a point-to-point association request and response mechanism, the broadcast overhead in the wireless Mesh network is remarkably reduced, broadcast storm and network congestion are avoided, and wireless network bandwidth resources are effectively saved. Meanwhile, according to the scheme, the route discovery speed is improved in a mode of updating the route information step by step, so that the network can establish and maintain a complete route information table more quickly. In addition, the technical scheme can quickly adapt to the change of network topology, and ensures the timeliness and reliability of data transmission.

Description

Technical Field

[0001] The present application relates to the field of wireless communications, and in particular to a method, device, storage medium and wireless node for updating routing information of a wireless mesh network. Background Art

[0002] With the rapid development of wireless communication technology, wireless mesh network, as an emerging network architecture, has shown great application potential in many fields such as urban hotspot coverage, emergency communication, and network access in remote areas due to its strong flexibility, good scalability, and wide coverage. Wireless mesh network is a self-organizing, multi-hop communication network that can provide users with reliable data transmission services by connecting multiple mesh nodes (also called routers or relay stations) wirelessly.

[0003] However, the effective operation of wireless mesh networks is highly dependent on the performance of their routing protocols. Most existing wireless mesh network routing protocols use a multi-level broadcast-based mechanism to discover and maintain routing information. Specifically, when a mesh node needs to establish or update routes to other nodes in the network, it initiates a message broadcast of the routing discovery protocol. The message is then received by its neighboring nodes and forwarded to their respective neighboring nodes in turn. This process is carried out step by step until all relevant nodes in the entire network are notified, thereby establishing a complete routing information table.

[0004] Although this broadcast-based routing discovery mechanism performs well in small Mesh networks with a small number of nodes, its efficiency issues become increasingly prominent when the network scale expands and the number of nodes increases significantly. A large number of broadcast messages flooding the network will not only cause broadcast storms and network congestion, but also greatly waste precious wireless network bandwidth resources. In addition, with the increase in network dynamics, such as the frequent joining, exiting or moving of nodes, existing routing protocols are unable to update routing information in a timely manner and are unable to quickly adapt to changes in network topology, thus affecting the timeliness and reliability of data transmission.

[0005] Therefore, it is particularly important to develop a new and efficient routing protocol to address the problems of low efficiency, bandwidth waste, and delayed routing information updates in wireless mesh networks with many nodes. The protocol must be able to effectively reduce broadcast overhead, improve routing discovery speed, and ensure that routing information can be updated quickly and accurately when the network topology changes, in order to adapt to the growing complexity and dynamic requirements of wireless mesh networks. Summary of the invention

[0006] The embodiments of the present application provide a method, device, storage medium and wireless node for updating routing information of a wireless mesh network, which can solve the problem of high overhead and slow speed of updating routing information in related technologies. The technical solution is as follows:

[0007] In a first aspect, an embodiment of the present application provides a method for updating routing information of a wireless mesh network, the method comprising:

[0008] The first mesh node scans the surrounding mesh nodes to obtain a node list;

[0009] The first mesh node selects a second mesh node from the node list as a parent node, and sends an association request to the second mesh node;

[0010] After the association is successful, the first mesh node checks whether an IP address is assigned. If yes, it sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node. The second mesh determines whether there is a parent node. If yes, it sends the updated routing table to the parent node; if not, it determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

[0011] In a second aspect, an embodiment of the present application provides a device for updating routing information of a wireless mesh network, which is applied to a first mesh node, and the device includes:

[0012] Scanning unit, used to scan the surrounding mesh nodes to obtain a node list;

[0013] a selection unit, configured to select a second mesh node from the node list as a parent node, and send an association request to the second mesh node;

[0014] The reporting unit is used for, after successful association, the first mesh node checks whether an IP address is assigned, and if so, sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node, and the second mesh determines whether there is a parent node, and if so, sends the updated routing table to the parent node; if not, determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

[0015] In a third aspect, an embodiment of the present application provides a computer storage medium, wherein the computer storage medium stores a plurality of instructions, wherein the instructions are suitable for being loaded by a processor and executing the above-mentioned method steps.

[0016] In a fourth aspect, an embodiment of the present application provides a wireless node, which may include: a processor, a memory and a WiFi module; wherein the memory stores a computer program, and the computer program is suitable for being loaded by the processor and executing the above-mentioned method steps.

[0017] The beneficial effects brought about by the technical solutions provided by some embodiments of the present application include at least:

[0018] The point-to-point association request and response mechanism replaces the traditional multi-level broadcast-based route discovery method. The first mesh node only sends association requests and routing information to the selected second mesh node (parent node), which significantly reduces the number of broadcast messages in the network, thereby avoiding broadcast storms and network congestion, and saving wireless network bandwidth resources.

[0019] The routing information update process in this application is more direct and efficient. Once the association is successful, the first mesh node immediately sends its IP address and routing table to the second mesh node, and the second mesh node updates its own routing table accordingly and continues to pass the update information to the parent node (if it exists). This step-by-step update method can establish and maintain the routing information of the entire network more quickly than the broadcast method.

[0020] When nodes in the network frequently join, exit, or move, this application can respond to these changes quickly. Newly joined mesh nodes are quickly integrated into the network through scanning and association processes, and the routing tables of related nodes are updated. At the same time, since routing information is transmitted level by level, any changes in the network topology can be promptly reflected in the routing table of the entire network, ensuring the timeliness and reliability of data transmission.

[0021] This application does not depend on a specific network size or number of nodes and is applicable to wireless mesh networks of various sizes. As the network size expands or shrinks, nodes can flexibly join or leave the network without significantly affecting the performance or stability of the network. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0023] Figure 1 is an architecture diagram of a wireless mesh network provided in an embodiment of the present application;

[0024] Figure 2 It is a flowchart of a method for updating routing information of a wireless mesh network provided in an embodiment of the present application;

[0025] Figure 3 It is a schematic diagram of a process of associating a first mesh node with a sub-node provided in an embodiment of the present application;

[0026] Figure 4 It is a structural diagram of a device for updating routing information of a wireless mesh network provided by the present application;

[0027] Figure 5 It is a structural diagram of a wireless node provided by this application. DETAILED DESCRIPTION

[0028] In order to make the objectives, technical solutions and advantages of the present application more clear, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings.

[0029] See also Figure 1 , Figure 1 The network architecture diagram of the wireless mesh network of this application includes:

[0030] Routers, access points (AP) and multiple stations (STA). The router serves as the gateway between AP and the Internet. AP and multiple nearby STAs form a tree-shaped communication network, which includes two types of nodes: parent nodes and child nodes. AP is the root node of the tree-shaped communication network. The root node is a special parent node. The root node has only child nodes. The tree-shaped communication network has at least one layer. The nodes in each layer are first-level child nodes, second-level child nodes, third-level child nodes, etc. according to the distance from the AP node. The nodes in the last layer have only parent nodes, which are also called leaf nodes; except for the nodes in the first and last layers, they are both parent nodes of the lower layer nodes and child nodes of the upper layer nodes.

[0031] In this application, any mesh node has at most one parent node, and the number of child nodes of any mesh node is not limited.

[0032] The embodiment of the present application provides a method for updating routing information of a wireless mesh network, and the method for updating routing information of a wireless mesh network can be applied to a wireless node, and the wireless node of the present application can be a site, an access point or a relay node (having site and access point functions). The wireless node can be a router, a relay amplifier, a smart phone, a tablet computer, a gaming device, an AR (Augmented Reality) device, a car, a data storage device, an audio playback device, a video playback device, a notebook, a desktop computing device, a wearable device such as an electronic watch, an electronic glasses, an electronic helmet, an electronic bracelet, an electronic necklace, an electronic clothing, and the like.

[0033] The following will be combined with the attached Figure 2 -Attached Figure 3 , a method for updating routing information of a wireless mesh network provided in an embodiment of the present application is described in detail. Among them, the device for executing the method for updating routing information of a wireless mesh network in an embodiment of the present application may be Figure 1 The wireless node shown in .

[0034] See also Figure 2 , a flow chart of a method for updating routing information of a wireless mesh network is provided for an embodiment of the present application. Figure 2 As shown, the method of the embodiment of the present application may include the following steps:

[0035] S201: A first mesh node scans surrounding mesh nodes to obtain a node list.

[0036] The first mesh node initializes its wireless communication module and starts an active or passive scanning process to discover surrounding mesh nodes. This usually involves sending or listening to specific wireless signals (such as beacon frames, probe requests, etc.). After receiving the scanning signal, the surrounding mesh nodes (potential neighbor nodes) will send a response signal (such as a beacon response, a probe response, etc.), which contains their identity information (such as node ID, MAC address, etc.).

[0037] The first mesh node collects all received response signals, parses the information in them, and builds a node list containing information about surrounding mesh nodes based on this information. This list usually contains the identification information of each neighboring node, signal strength, and other possible parameters (such as supported frequencies, security capabilities, etc.). When the first mesh node does not receive more response signals within a predetermined time, or reaches a predetermined number of scans, it stops the scanning process and saves the node list for subsequent use.

[0038] S202: The first mesh node selects a second mesh node from the node list as a parent node, and sends an association request to the second mesh node.

[0039] Among them, the first mesh node selects an optimal mesh node as its parent node based on the information in the node list and adopts certain strategies (such as signal strength, node load, path diversity, etc.). The selected node is the second mesh node. The first mesh node prepares an association request message, which contains its own identity information (such as node ID, MAC address, etc.), request type (association request), and possible additional information (such as supported encryption algorithms, security keys, etc.). The first mesh node sends the association request message to the second mesh node through a wireless channel. This process may involve encryption and authentication steps to ensure the security and integrity of the message. The first mesh node may set a timeout while waiting for a response from the second mesh node. If no response is received within the timeout, the parent node may be reselected and the association process may be retried.

[0040] S203. After the association is successful, the first mesh node checks whether an IP address is assigned. If yes, it sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node. The second mesh determines whether there is a parent node. If yes, it sends the updated routing table to the parent node; if not, it determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

[0041] Among them, when the first mesh node receives the association success response from the second mesh node, it confirms that it has successfully associated with the network. The first mesh node checks whether it has been assigned a valid IP address. This IP address may be obtained through the previous network configuration process, or it may be dynamically assigned through a mechanism such as the Dynamic Host Configuration Protocol (DHCP). If the first mesh node has been assigned an IP address, it will construct an information packet containing its own IP address and the current routing table and send it to the second mesh node. This routing table contains the best path information known by the first mesh node to reach other nodes. After receiving the information packet from the first mesh node, the second mesh node updates its own routing table based on the IP address and routing table information therein. This process may involve steps such as deleting old routing information, adding new routing information, and calculating a new best path. If the second mesh node already has a parent node (that is, it is not a root node), it will further propagate the updated routing table information to its parent node. This process may propagate upward along the parent node chain until the root node or a predetermined propagation depth is reached. If the second mesh node is a root node (i.e. it has no parent node), it does not need to propagate routing updates further. When all relevant mesh nodes have updated their routing tables and there are no more routing updates to propagate, the routing information update process for the entire wireless mesh network is complete. At this point, every node in the network has the latest routing information and can efficiently forward data packets.

[0042] It should be noted that in the wireless mesh network of the present application, the number of parent nodes of any mesh node is at most one, and the number of child nodes of any mesh node is not limited, which may be no child nodes, one child node, or multiple child nodes.

[0043] Further, in the examples of the present application, see Figure 3 As shown, the schematic diagram of the process of the first mesh node as a parent node associating a child node includes:

[0044] S301: A first mesh node receives an association request from a third mesh node.

[0045] S302: The first mesh node verifies the identity of the third mesh node according to the received association request, and establishes association with the third mesh node after the verification is successful.

[0046] S303: receiving the IP address and routing table of the third mesh node sent by the third mesh node, and the first mesh node updates its own routing table according to the received IP address and routing table.

[0047] S304: The first mesh node determines that its parent node is the second mesh node, and sends the updated routing table to the second mesh node.

[0048] During normal operation, the first mesh node may receive an association request from another mesh node (in this case, the third mesh node). This request usually includes the identity information of the third mesh node, the request type (association request), and possible additional information (such as security keys, supported encryption algorithms, etc.).

[0049] After receiving the association request, the first mesh node needs to verify the identity of the third mesh node. This usually involves checking whether the identity information in the request matches a known legitimate node, and possible security authentication processes (such as password verification, digital signature verification, etc.). If the verification fails, the first mesh node will reject the association request; if the verification succeeds, it will proceed to the next step.

[0050] Once the identity of the third mesh node is verified, the first mesh node will establish an association with the third mesh node. This may involve steps such as updating the first mesh node's neighbor node list, allocating resources (such as bandwidth, time slots, etc.) to the third mesh node, and establishing a secure channel.

[0051] After the association is successful, the third mesh node will send its IP address and routing table to the first mesh node. This routing table contains the best path information to other nodes known by the third mesh node. The first mesh node needs to receive and parse this information.

[0052] The first mesh node updates its own routing table based on the IP address and routing table information received from the third mesh node. This process may involve steps such as deleting old routing information, adding new routing information, and calculating a new optimal path. The updated routing table will reflect the new topology and path information in the network.

[0053] Since the first mesh node has determined that its parent node is the second mesh node (this has been determined in the previous step), it needs to send the updated routing table to the second mesh node. This process may involve encryption and authentication steps to ensure the security and integrity of the information. After receiving the updated routing table, the second mesh node will also update its own routing table accordingly, and may propagate the updated information to the parent node at the next level, and so on, until the routing table of the entire network is updated.

[0054] Furthermore, in some embodiments of the present application, it also includes:

[0055] The first mesh node receives an uplink data packet from the third mesh node;

[0056] The first mesh node parses the source IP address and the source MAC address of the uplink data packet, and updates its own routing table with the source IP address and the source MAC address;

[0057] The first mesh node parses the destination IP address of the uplink data packet, and searches its own routing table for the next hop node according to the destination IP address, which is the second mesh node;

[0058] The uplink data packet is sent to the second mesh node.

[0059] Among them, during the normal data transmission process, the first mesh node will receive an uplink data packet from other mesh nodes (in this case, the third mesh node). This data packet usually contains the source IP address, source MAC address, destination IP address, data payload, and possible additional information (such as checksum, sequence number, etc.). The first mesh node needs to parse the header information of the uplink data packet, especially the source IP address and source MAC address. This information is crucial for updating the routing table because they reflect the actual source of the data packet. According to the parsed source IP address and source MAC address, the first mesh node can update its own routing table. If this is the first time to receive a data packet from the third mesh node, the first mesh node may add a new entry to the routing table to record the IP address and MAC address of the third mesh node and the corresponding interface information. If the relevant entry already exists before, the first mesh node may update some information of the entry (such as the last activity time, path quality, etc.). Next, the first mesh node needs to parse the destination IP address of the uplink data packet and search for an entry matching the destination IP address in its own routing table. This search process may involve the longest prefix matching algorithm or other similar routing search algorithms. Once a matching entry is found, the first mesh node can determine the next hop node, that is, the next mesh node to which the data packet should be forwarded. In this example, it is assumed that the routing table of the first mesh node indicates that the next hop node is the second mesh node. Finally, the first mesh node forwards the uplink data packet to the second mesh node. This process may involve steps such as encapsulating the data packet (such as adding a new MAC header, IP header, etc.), encrypting (if necessary), and sending the data packet through a wireless channel. Before forwarding, the first mesh node may also update certain fields of the data packet (such as TTL, checksum, etc.) to ensure the integrity and correctness of the data packet during transmission.

[0060] Further, in some embodiments of the present application, in a wireless mesh network, DHCP (Dynamic Host Configuration Protocol) is used to assign IP addresses and other network configuration parameters to devices newly added to the network. This supplement will describe how the first mesh node receives a DHCP request packet from a third mesh node, parses the Transaction ID therein, and establishes a temporary routing table based on the ID to ensure that the DHCP response packet can be accurately returned to the requester (i.e., the third mesh node).

[0061] Specifically, when the third mesh node joins the network for the first time or needs to reacquire an IP address, it broadcasts a DHCP request packet. This packet contains the requester's MAC address, the requested IP address type (such as IPv4 or IPv6), and other possible options (such as domain name, DNS server address, etc.). The first mesh node, as a node in the network, will receive this broadcast packet. The first mesh node needs to parse the content of the DHCP request packet, especially the Transaction ID field therein. Transaction ID is a unique identifier used to distinguish different DHCP sessions and requests. It ensures that the DHCP server can correctly match requests and responses. Based on the parsed Transaction ID, the first mesh node can establish a temporary routing table or routing cache inside it. This temporary routing table records the mapping relationship between the Transaction ID and the third mesh node (i.e., the DHCP requester). This mapping relationship is crucial for accurately returning the DHCP response packet to the requester later. This temporary routing table is dynamic and will be deleted after the DHCP session ends. In addition, since the DHCP request packet is usually broadcast, the first mesh node may need to cooperate with other mesh nodes to ensure that the DHCP response packet can be returned to the requester along the correct path. This may require the use of a specific protocol or mechanism to pass the Transaction ID and related routing information.

[0062] In some cases, the first mesh node may need to forward the DHCP request packet to a DHCP server or other node in the network that can handle DHCP requests. This forwarding process may involve steps such as looking up a routing table, selecting the best path, and encapsulating and sending data packets. However, in some network topologies (such as a network with a centralized DHCP server), the first mesh node may directly forward the DHCP request packet to a known DHCP server address. When the DHCP server receives the DHCP request packet and generates a response packet, it uses the same Transaction ID to identify the response. This response packet is returned to the third mesh node along the opposite path of the request packet. At the first mesh node, it identifies the destination of the response packet based on the information in the temporary routing table or routing cache, and accurately forwards it to the third mesh node.

[0063] In some embodiments of the present application, the process of the first mesh node processing an ARP request in the downstream direction includes: the first mesh node receives an ARP request from a second mesh node. ARP requests are generally used to query the MAC address corresponding to a certain IP address. The first mesh node parses the ARP request packet to obtain the IP address therein. Based on the parsed IP address, the first mesh node queries its own routing table to see whether there is a matching target IP address entry. If a matching target IP address entry is found, the first mesh node constructs an ARP reply packet containing the MAC address corresponding to the target IP address and sends it to the second mesh node. If no matching entry is found, the first mesh node may not be able to directly reply to the ARP reply, but may try to forward the request to other mesh nodes.

[0064] The process of the first mesh node processing a neighbor discovery request in the downstream direction includes: the first mesh node receives a neighbor discovery request from the second mesh node. The neighbor discovery protocol (such as neighbor discovery in ICMPv6) is used to discover other nodes in the network and maintain neighbor information. The first mesh node parses the neighbor discovery request packet and obtains the destination IP address therein. According to the destination IP address obtained by the parsing, the first mesh node queries whether there is a matching entry in its own routing table. If a matching entry is queried, the first mesh node constructs a neighbor discovery response packet and sends it to the second mesh node. The response packet may contain information such as the MAC address and link layer address of the first mesh node. If no matching entry is queried, the first mesh node may not be able to directly reply to the response, but may try to forward the request to other mesh nodes.

[0065] The process of the first mesh node processing the DHCP response packet in the downstream direction includes:

[0066] The first mesh node receives a DHCP response packet from the DHCP server. This response packet is the DHCP server's response to the DHCP request from the third mesh node (or other requester). The first mesh node parses the DHCP response packet to obtain the Transaction ID and the assigned IP address. Based on the parsed Transaction ID, the first mesh node queries its temporary routing table to see if there is a matching entry to determine the next hop node. If a matching entry is found, the first mesh node will establish a formal routing table entry for the destination mesh node (i.e., the third mesh node) based on the parsed IP address. This formal routing table entry will be used for subsequent data packet forwarding and routing decisions. At the same time, the first mesh node may delete the temporary routing table entry associated with the Transaction ID.

[0067] In some embodiments of the present application, in a wireless mesh network, a data packet may need to be transmitted between multiple nodes to reach its destination node. As an intermediate node, the first mesh node is responsible for parsing the data packet, querying the routing table, and forwarding the data packet to the next hop node.

[0068] Specifically, the first mesh node receives a downlink data packet from the second mesh node. This data packet may be sent from a source in the network (such as the Internet or other mesh nodes) to reach a specific node in the network (i.e., the destination node). The first mesh node needs to parse the received data packet to obtain the destination IP address therein. This destination IP address is the IP address of the node to which the data packet needs to reach. According to the parsed destination IP address, the first mesh node queries whether there is a matching entry in its routing table. The routing table is a database containing network topology and node connection information, which can help nodes determine which next-hop node the data packet should be forwarded to. If the first mesh node finds a matching destination IP address entry in the routing table, and the entry specifies a next-hop node, then the first mesh node forwards the data packet to the next-hop node. The forwarding process may involve steps such as encapsulating data packets and updating data packet header information (such as the destination MAC address and TTL value). If there is no matching entry in the routing table, the first mesh node may try to use other methods (such as broadcasting or asking other nodes) to determine the next-hop node. However, in most cases, the nodes in the Mesh network maintain a relatively complete routing table to ensure that the data packet can be efficiently transmitted to the destination node. This process continues until the data packet reaches its destination node. During the transmission process, the data packet may pass through multiple intermediate nodes (such as other nodes in the Mesh network), and each node will perform similar parsing, querying, and forwarding steps.

[0069] According to the embodiments of the present application, during the networking process, the present application utilizes networking constraints to constrain the topological structure of the network, and the current networking constraints are stricter than the previous networking constraints. Until the total number of nodes in the network obtained according to the current networking constraints is less than a certain data threshold, the previous networking constraints are used to re-network to obtain the final network. In this way, a stable and reliable communication network can be obtained according to different application scenarios.

[0070] The following is an embodiment of the device of the present application, which can be used to execute the embodiment of the method of the present application. For details not disclosed in the embodiment of the device of the present application, please refer to the embodiment of the method of the present application.

[0071] See also Figure 4 , which shows a schematic diagram of the structure of an apparatus for updating routing information of a wireless mesh network provided by an exemplary embodiment of the present application. The apparatus can be implemented as all or part of a wireless node through software, hardware, or a combination of both. The apparatus 9 for updating routing information of a wireless mesh network (hereinafter referred to as apparatus 4) includes: a scanning unit 401, a selection unit 402, and a reporting unit 403.

[0072] A scanning unit 401 is used to scan surrounding mesh nodes to obtain a node list;

[0073] A selection unit 402, configured to select a second mesh node from the node list as a parent node, and send an association request to the second mesh node;

[0074] The reporting unit 403 is used for, after successful association, the first mesh node checks whether an IP address is assigned, and if so, sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node, and the second mesh determines whether there is a parent node, and if so, sends the updated routing table to the parent node; if not, determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

[0075] In one or more possible embodiments, it further includes:

[0076] an updating unit, configured to receive an association request from a third mesh node;

[0077] Verifying the identity of the third mesh node according to the received association request, and establishing association with the third mesh node after the verification is successful;

[0078] receiving an IP address and a routing table of the third mesh node sent by the third mesh node, wherein the first mesh node updates its own routing table according to the received IP address and routing table;

[0079] Determine that its parent node is the second mesh node, and send the updated routing table to the second mesh node.

[0080] In one or more possible embodiments, it further includes:

[0081] an uplink processing unit, configured to receive an uplink data packet from the third mesh node;

[0082] Parse the source IP address and source MAC address of the uplink data packet, and update its own routing table with the source IP address and source MAC address;

[0083] Parsing the destination IP address of the uplink data packet, and finding out that the next hop node is the second mesh node in its own routing table according to the destination IP address;

[0084] The uplink data packet is sent to the second mesh node.

[0085] In one or more possible embodiments, the uplink processing unit is further configured to:

[0086] Receiving a DHCP request packet from the third mesh node;

[0087] Parse the Transaction ID carried in the DHCP request packet, and establish a temporary routing table according to the Transaction ID so that the DHCP response packet reaches the destination mesh node.

[0088] In one or more possible embodiments, it further includes:

[0089] A downlink processing unit, configured to receive an ARP request from the second mesh node;

[0090] Parse the ARP request to obtain an IP address, and query the target IP address in its own routing table according to the resolved IP address; if found, reply an ARP reply carrying the target IP address to the second mesh node; or

[0091] receiving a neighbor discovery request from the second mesh node;

[0092] According to the destination IP address of the neighbor discovery request, query its own routing table;

[0093] If the search is successful, a neighbor discovery response is returned to the second mesh node; or

[0094] receiving a DHCP response packet from the second mesh node;

[0095] Parsing the DHCP response packet to obtain a Transaction ID;

[0096] The next hop node is searched in its temporary routing table according to the resolved Transaction ID, and the IP address in the DHCP response packet is resolved, and a formal routing table is established for the destination mesh node according to the resolved IP address.

[0097] In one or more possible embodiments, the downlink processing unit is further configured to:

[0098] receiving a downlink data packet from the second mesh node;

[0099] Parsing the downlink data packet to obtain a destination IP address, and searching for a next hop node in its own routing table according to the parsed destination IP address;

[0100] The downlink data packet is forwarded to the next hop node.

[0101] In one or more possible embodiments, the first mesh node selects a second mesh node from the node list as a parent node, comprising:

[0102] The first mesh node selects a mesh node with the best received signal quality, the smallest delay, or the largest signal bandwidth in the node list as the second mesh node.

[0103] It should be noted that, when the device 4 provided in the above embodiment executes the method for updating the routing information of the wireless mesh network, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the device for updating the routing information of the wireless mesh network provided in the above embodiment and the method embodiment for updating the routing information of the wireless mesh network belong to the same concept, and the implementation process thereof is detailed in the method embodiment, which will not be repeated here.

[0104] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0105] The present application also provides a computer storage medium, which can store multiple instructions, and the instructions are suitable for being loaded and executed by a processor as described above. Figure 2-Figure 3 The method steps of the embodiment shown in the figure can be found in the specific implementation process. Figure 2-Figure 3 The specific description of the illustrated embodiment will not be repeated here.

[0106] The present application also provides a computer program product, which stores at least one instruction, and the at least one instruction is loaded and executed by the processor to implement the method for updating routing information of a wireless mesh network as described in the above embodiments.

[0107] See also Figure 5 , which is a schematic diagram of the structure of a wireless node provided in an embodiment of the present application. Figure 5 As shown, the device can be Figure 1 The device 500 for updating routing information of the wireless mesh network may include: at least one processor 501, at least one network interface 504, a user interface 503, a memory 505, and at least one communication bus 502.

[0108] The communication bus 502 is used to realize the connection and communication between these components.

[0109] The user interface 503 is an interface for the user to interact with the server, and may include a display screen (Display) and a camera (Camera). Optionally, the user interface 503 may also include a standard wired interface and a wireless interface.

[0110] The network interface 504 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0111] Among them, the processor 501 may include one or more processing cores. The processor 501 uses various interfaces and lines to connect various parts of the entire electronic device 500, and executes various functions and processes data of the electronic device 500 by running or executing instructions, programs, code sets or instruction sets stored in the memory 505, and calling data stored in the memory 505. Optionally, the processor 501 can be implemented in at least one hardware form of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), and programmable logic array (Programmable Logic Array, PLA). The processor 501 can integrate one or a combination of a central processing unit (Central Processing Unit, CPU), a graphics processing unit (Graphics Processing Unit, GPU) and a modem. Among them, the CPU mainly processes the operating system, user interface and application programs; the GPU is responsible for rendering and drawing the content to be displayed on the display screen; the modem is used to process wireless communications. It can be understood that the above-mentioned modem may not be integrated into the processor 501, and it can be implemented separately through a chip.

[0112] Among them, the memory 505 may include a random access memory (Random Access Memory, RAM) and may also include a read-only memory (Read-Only Memory). Optionally, the memory 505 includes a non-transitory computer-readable storage medium. The memory 505 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 505 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 505 may also be optionally at least one storage device located away from the aforementioned processor 501. As Figure 5 As shown, the memory 505 as a computer storage medium may include an operating system, a network communication module, a user interface module and an application program.

[0113] exist Figure 5 In the electronic device 500 shown, the user interface 503 is mainly used to provide an input interface for the user and obtain the data input by the user; and the processor 501 can be used to call the application program interface configuration stored in the memory 505, and specifically execute Figure 2 or Figure 3 The method described in the method embodiment.

[0114] The concept and Figure 2 or Figure 3 The method embodiment is the same as that of the embodiment, and the technical effect it brings is also the same. The specific process can be referred to Figure 2 or Figure 3 The description of the embodiments will not be repeated here.

[0115] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing related hardware through a computer program, and the program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. The storage medium can be a disk, an optical disk, a read-only storage memory, or a random access memory, etc.

[0116] The above disclosure is only the preferred embodiment of the present application, which certainly cannot be used to limit the scope of rights of the present application. Therefore, equivalent changes made according to the claims of the present application are still within the scope covered by the present application.

Claims

1. A method for updating routing information of a wireless mesh network, characterized in that: The method comprises: The first mesh node scans the surrounding mesh nodes to obtain a node list; The first mesh node selects a second mesh node from the node list as a parent node, and sends an association request to the second mesh node; After the association is successful, the first mesh node checks whether an IP address is assigned. If yes, it sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node. The second mesh determines whether there is a parent node. If yes, it sends the updated routing table to the parent node; if not, it determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

2. The method according to claim 1, characterized in that Also includes: The first mesh node receives an association request from a third mesh node; The first mesh node verifies the identity of the third mesh node according to the received association request, and establishes association with the third mesh node after the verification is successful; receiving an IP address and a routing table of the third mesh node sent by the third mesh node, wherein the first mesh node updates its own routing table according to the received IP address and routing table; The first mesh node determines that its parent node is the second mesh node, and sends the updated routing table to the second mesh node.

3. The method according to claim 2, characterized in that Also includes: The first mesh node receives an uplink data packet from the third mesh node; The first mesh node parses the source IP address and the source MAC address of the uplink data packet, and updates its own routing table with the source IP address and the source MAC address; The first mesh node parses the destination IP address of the uplink data packet, and searches its own routing table for the next hop node according to the destination IP address, which is the second mesh node; The uplink data packet is sent to the second mesh node.

4. The method according to claim 2 or 3, characterized in that: Also includes: The first mesh node receives a DHCP request packet from the third mesh node; Parse the Transaction ID carried in the DHCP request packet, and establish a temporary routing table according to the Transaction ID so that the DHCP response packet reaches the destination mesh node.

5. The method according to claim 4, characterized in that Also includes: The first mesh node receives an ARP request from the second mesh node; The first mesh node parses the ARP request to obtain an IP address, and queries its own routing table for a target IP address according to the parsed IP address; If found, the first mesh node replies to the second mesh node with an ARP reply carrying the target IP; or The first mesh node receives a neighbor discovery request from the second mesh node; According to the destination IP address of the neighbor discovery request, query its own routing table; If the search is successful, a neighbor discovery response is returned to the second mesh node; or The first mesh node receives a DHCP response packet from the second mesh node; Parsing the DHCP response packet to obtain a Transaction ID; The next hop node is searched in its temporary routing table according to the resolved Transaction ID, and the IP address in the DHCP response packet is resolved, and a formal routing table is established for the destination mesh node according to the resolved IP address.

6. The method according to claim 1, characterized in that Also includes: The first mesh node receives a downlink data packet from the second mesh node; The first mesh node parses the downlink data packet to obtain a destination IP address, and queries a next hop node in its own routing table according to the parsed destination IP address; The downlink data packet is forwarded to the next hop node.

7. The method according to claim 1, characterized in that The first mesh node selects a second mesh node from the node list as a parent node, comprising: The first mesh node selects a mesh node with the best received signal quality, the smallest delay, or the largest signal bandwidth in the node list as the second mesh node.

8. A device for updating routing information of a wireless mesh network, characterized in that: Applied to a first mesh node, the device comprises: Scanning unit, used to scan the surrounding mesh nodes to obtain a node list; a selection unit, configured to select a second mesh node from the node list as a parent node, and send an association request to the second mesh node; The reporting unit is used for, after successful association, the first mesh node checks whether an IP address is assigned, and if so, sends its own IP address and routing table to the second mesh node, so that the second mesh node updates its own routing table according to the received IP address and routing table of the first mesh node, and the second mesh determines whether there is a parent node, and if so, sends the updated routing table to the parent node; if not, determines that the second mesh node is the root node of the wireless mesh network, thereby completing the update of the routing information of the wireless mesh network.

9. A computer storage medium, characterized in that: The computer storage medium stores a plurality of instructions, and the instructions are suitable for being loaded by a processor and executing the method steps according to any one of claims 1 to 7.

10. A wireless node, characterized in that: include: A processor, a memory and a WiFi module; wherein the memory stores a computer program, and the computer program is suitable for being loaded by the processor and executing the method steps as claimed in any one of claims 1 to 7.

Images