Mesh network reconstruction methods, device and readable medium

Abstract

Provided in the present disclosure are Mesh network reconstruction methods, an apparatus, a device and a readable medium. A Mesh network reconstruction method is applied to a master node and comprises: when the master node is powered on again, acquiring stored topological information of a historical Mesh network, wherein the topological information of the historical Mesh network comprises information of the master node, information of each slave node, and a connection relationship between the master node and each slave node; and on the basis of the topological information of the historical Mesh network, reconstructing a Mesh network with the slave nodes of the historical Mesh network.

Description

Mesh network reorganization method, device and readable medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202311149769.5 filed on September 6, 2023, the contents of which are incorporated herein by reference in their entirety. Technical Field

[0003] The present disclosure relates to the field of communication technologies. Background Art

[0004] A Wireless Fidelity (Wi-Fi) mesh network consists of a master device and one or more slave devices. The master device, acting as the main controller, is the brains of the entire mesh network, responsible for establishing and managing the mesh network. Slave devices expand the mesh network's coverage and connect to the internet through the master device. The master device initiates network formation, and all devices join the mesh network during the process, forming a topology diagram for the entire mesh network.

[0005] In existing Wi-Fi Mesh technology, if the master node is powered on again, the previous networking and topology information will be cleared, and the networking will be restarted and the topology of the Wi-Fi Mesh network will be drawn.

[0006] Summary of the Invention

[0007] A first aspect of an embodiment of the present disclosure provides a Mesh network reorganization method, which is applied to a master node. The method includes: when the master node is powered on again, obtaining the saved topology information of the historical Mesh network, wherein the topology information of the historical Mesh network includes: information of the master node, information of each slave node, and the connection relationship between the master node and each slave node; and re-establishing the Mesh network with each slave node of the historical Mesh network based on the topology information of the historical Mesh network.

[0008] A second aspect of an embodiment of the present disclosure provides a Mesh network reorganization method, which is applied to a slave node. The method includes: receiving the connection relationship sent by the master node; wherein the connection relationship belongs to the topology information of the historical Mesh network; and establishing a network connection with other nodes based on the connection relationship.

[0009] A third aspect of an embodiment of the present disclosure provides an electronic device, comprising: at least one processor; a memory on which one or more programs are stored, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method according to the first aspect or the second aspect; and at least one I / O interface connected between the processor and the memory, and configured to implement information interaction between the processor and the memory.

[0010] A fourth aspect of the embodiments of the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements the method according to the first aspect or the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] FIG1 is a flow chart of a method for a master node to perform Mesh network reorganization according to an embodiment of the present disclosure;

[0012] FIG2 is a schematic diagram of a Wi-Fi Mesh network structure provided in an embodiment of the present disclosure;

[0013] FIG3 is a flow chart of a method for reorganizing a Mesh network from a node provided in an embodiment of the present disclosure;

[0014] FIG4 is a schematic diagram of a Wi-Fi Mesh networking process provided in an embodiment of the present disclosure;

[0015] FIG5 is a schematic structural diagram of a Mesh network reorganization device applied to a master node provided in an embodiment of the present disclosure;

[0016] FIG6 is a schematic structural diagram of a Mesh network reorganization device applied to a sub-node provided in an embodiment of the present disclosure;

[0017] FIG7 is a schematic diagram of the structure of a Mesh networking management system provided in an embodiment of the present disclosure;

[0018] FIG8 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0019] The following describes the specific embodiments of the present disclosure in detail with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are only used to illustrate and explain the present disclosure and are not intended to limit the present disclosure.

[0020] As used in this disclosure, the term "and / or" includes any and all combinations of one or more of the associated listed items.

[0021] The terms used in the present disclosure are only used to describe specific embodiments and are not intended to limit the present disclosure.As used in the present disclosure, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

[0022] When the terms “comprising” and / or “made of…” are used in the present disclosure, it specifies the existence of the stated features, integers, steps, operations, elements and / or components, but does not preclude the existence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0023] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meanings as those commonly understood by those skilled in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless expressly defined in this disclosure.

[0024] The present disclosure provides a mesh network reorganization method. This method can be applied to a main node (i.e., a master control node in a mesh network). Prior to executing the steps of the mesh network reorganization method, the main node has already completed at least one mesh network formation process as a main node and has stored the topology information of the established mesh network. The mesh network topology information can be in the form of a network topology diagram, but other representations, such as text descriptions or tables, are also possible.

[0025] FIG1 is a flow chart of a method for a master node to perform Mesh network reorganization. The method for a master node to perform Mesh network reorganization mainly includes the following steps 101 and 102 .

[0026] In step 101, when the master node is powered on again, the saved topology information of the historical Mesh network is obtained; wherein the topology information of the historical Mesh network includes: information of the master node, information of each slave node, and connection relationships between the master node and each slave node.

[0027] In some embodiments, scenarios where a master node is powered back on include, but are not limited to, the following: rebooting the master node; powering the master node off and back on; and upgrading the master node version. In all of these scenarios, the master node may be offline from the Mesh network for a period of time and then come back online. In the disclosed embodiments, the master node will retain the topology information of the Mesh network that was established before the master node went offline.

[0028] In some embodiments, each time the master node successfully establishes a Mesh network, it saves the topology information of the Mesh network. The information can be directly saved in a local storage space that is not cleared when the power is off, or it can be saved in an external storage space that the master node can access. The specific storage location is not limited here. It only needs to ensure that the topology information of the Mesh network saved by the master node is not lost when the power is off, and can be accessed after the master node is powered on again.

[0029] In some embodiments, the historical Mesh network here refers to the Mesh network most recently established by the master node in history.

[0030] In step 102, a Mesh network is re-established with each of the slave nodes (Sub nodes) of the historical Mesh network according to the topology information of the historical Mesh network.

[0031] In some embodiments, re-establishing a Mesh network with each of the slave nodes of the historical Mesh network based on the topology information of the historical Mesh network includes: receiving information reported by each of the slave nodes; determining whether a rapid re-establishment of the network is possible based on the information reported by each of the slave nodes and the information of each of the slave nodes of the historical Mesh network; and if a rapid re-establishment of the network is possible, re-establishing the Mesh network with each of the slave nodes based on the connection relationships in the topology information of the historical Mesh network. In these embodiments, the information reported by the slave node is compared with the information of the slave node in the historical Mesh network to determine changes in the slave node, thereby determining whether a rapid re-establishment of the network is possible.

[0032] In some embodiments, re-establishing a mesh network with each of the slave nodes based on the connection relationships in the historical mesh network topology information includes: obtaining the connection relationships from the historical mesh network topology information, and sending the connection relationships to each of the slave nodes, so that the slave nodes establish network connections with other nodes based on the received connection relationships. The other nodes include at least one of a master node and other slave nodes. By sending the historical mesh network connection relationships to each slave node, each slave node directly establishes a network connection with the other nodes based on the received connection relationships, eliminating the need for the slave nodes to independently search for nodes and establish connections for networking, thereby improving network establishment efficiency.

[0033] In some embodiments, before executing the step of re-establishing a mesh network with each of the slave nodes based on the connection relationships in the historical mesh network topology information, rapid networking instruction information is sent to each of the slave nodes in the historical mesh network; wherein the rapid networking instruction information is used to notify the slave node to establish a network connection with other nodes based on the specified connection relationships. In these embodiments, the master node sends the rapid networking instruction information to each of the slave nodes in the historical mesh network to notify each of the slave nodes to stop searching for and establishing a network independently and to establish a network based on the historical mesh network topology information sent by the master node.

[0034] In some embodiments, the rapid networking indication information may be expressed in various forms, including but not limited to using a rapid networking flag as the rapid networking indication information.

[0035] In some embodiments, the information of the slave node includes at least one of the following dimensions: status information of the slave node; location information of the slave node.

[0036] In an exemplary embodiment, after being powered on again, the master node receives the location information of the corresponding slave node broadcasted by each slave node.

[0037] After sending the fast networking indication information to the slave node, the master node receives the status information of the slave node sent by the slave node (in this case, the fast networking indication information is also used to notify each slave node to report its own status information to the master node); or, after being powered on again, the master node receives the status information of the slave node broadcast by the slave node.

[0038] The location information of the slave node can be obtained by the slave node through positioning, and the positioning method includes but is not limited to at least one of the following methods: Wi-Fi, Bluetooth, and Global Positioning System (GPS). After the slave node locates its own location information, it broadcasts it.

[0039] The status information of the slave node includes information such as the working status and signal strength of the slave node. The working status of the slave node includes a flag indicating whether the slave node is in a normal working state. Flag A indicates that the slave node is in a normal working state, and flag B indicates that the slave node is in an abnormal state.

[0040] In some embodiments, the manner of determining whether the network can be re-established varies depending on the different dimensions of information included in the information of the slave node, including but not limited to the following cases A, B, and C.

[0041] Case A, judging whether the network can be quickly re-established based on the information reported by each of the slave nodes and the information of each of the slave nodes in the historical Mesh network, includes: judging whether the status of each of the slave nodes has changed based on the status information reported by each of the slave nodes and the status information of each of the slave nodes in the historical Mesh network; determining that the network can be quickly re-established if the status of each of the slave nodes has not changed; and determining that the network cannot be quickly re-established if the status of at least one of the slave nodes has changed.

[0042] In this case, the master node can quickly re-establish the network when the status of each slave node does not change.

[0043] For example, after confirming that the location information of each slave node has not changed, the user activates the master node's fast re-networking mode. If the master node determines that the status of each node has not changed, it controls the fast re-networking, that is, the fast re-networking is directly based on the historical mesh network topology information. For example, if the user determines that the current device node location has not changed, the user can initiate the fast re-networking through the app or by pressing a button.

[0044] Case B, judging whether the network can be quickly re-established based on the information reported by each of the slave nodes and the information of each of the slave nodes in the historical Mesh network, includes: judging whether the position of each of the slave nodes has changed based on the position information reported by each of the slave nodes and the position information of each of the slave nodes in the historical Mesh network; determining that the network can be quickly re-established if the position of each of the slave nodes has not changed; and determining that the network cannot be quickly re-established if the position of at least one of the slave nodes has changed.

[0045] In this case, the master node does not care about the status of each slave node, and can quickly re-network when the positions of each node do not change.

[0046] Case C, judging whether the network can be quickly re-established based on the information reported by each of the slave nodes and the information of each of the slave nodes in the historical Mesh network, includes: judging whether the position of each of the slave nodes has changed based on the position information reported by each of the slave nodes and the position information of each of the slave nodes in the historical Mesh network; judging whether the status of each of the slave nodes has changed based on the status information reported by each of the slave nodes and the status information of each of the slave nodes in the historical Mesh network; determining that the network can be quickly re-established when the position of each of the slave nodes has not changed and the status of each of the slave nodes has not changed; determining that the network cannot be quickly re-established when the position or status of at least one of the slave nodes has changed.

[0047] In this case, it is necessary to pay attention to the position change and status change of each slave node. The master node can quickly re-establish the network when the position and status of each slave node remain unchanged.

[0048] In the three cases above, a slave node's status remains unchanged if the change is minor and within a certain range. For example, if the difference between the signal strength value reported by a slave node and the signal strength value of the slave node in the historical Mesh network is within a certain range, the slave node's signal strength is considered unchanged. If the difference exceeds this range, the slave node's signal strength is considered to have changed.

[0049] Similarly, if a slave node's position information remains unchanged, it means that the change in the slave node's position is small and within a certain range. For example, if the difference between the reported position coordinates and the historical position coordinates of the slave node in the Mesh network is within a certain range, the slave node's position is considered unchanged. If the difference exceeds this range, the slave node's position is considered changed.

[0050] In some embodiments, the method for Mesh network reorganization further includes: before executing the step of determining whether the network can be quickly re-established based on the information reported by each of the slave nodes and the information of each of the slave nodes in the historical Mesh network, receiving a startup instruction for a fast re-establishment mode.

[0051] There are multiple ways to generate the startup instruction of the fast re-networking mode, including but not limited to the following method 1 and method 2.

[0052] Method 1: When the master node detects a trigger operation of a designated key (virtual key or physical key), it generates a startup instruction for the fast re-networking mode.

[0053] For example, a user clicks a physical button on the master node for initiating the fast re-networking mode. The master node detects the physical button click and generates the initiation command, entering the fast re-networking mode. In this case, the user determines the location information of each slave node in the historical Mesh network established by the master node and confirms that the location information of these slave nodes has not changed.

[0054] In the second method, the master node receives a command to start the fast re-networking mode from another device. The other device can be any device that can establish a communication connection with the master node, such as a server. In this case, the other device determines the location information of each slave node in the historical mesh network formed by the master node and confirms that the location information of these slave nodes has not changed.

[0055] Accordingly, when the master node receives the startup instruction of the fast re-networking mode, it determines whether it can quickly re-network based on the status information reported by each of the slave nodes and the status information of each of the slave nodes in the historical Mesh network, without having to compare the location information reported by the slave node with the location information of each of the slave nodes in the historical Mesh network.

[0056] In some embodiments, the master node and each slave node in the Mesh network are wireless access hotspots (Wi-Fi), and the formed Mesh network is a Wi-Fi Mesh network.

[0057] Figure 2 shows a typical Wi-Fi Mesh network structure diagram. Here, only four Mesh nodes are used as an example. The number of Mesh nodes can be set according to demand. The Wi-Fi Mesh network includes a master node A and slave nodes B, C, and D. The master node is connected to the network interface provided by the Internet. Slave nodes B, C, and D extend the Wi-Fi network, which can expand the coverage of the Wi-Fi Mesh network. Master node A is responsible for establishing the Wi-Fi Mesh network. During the network establishment process, a topology diagram of the Wi-Fi Mesh network will be drawn. In a traditional Wi-Fi Mesh network, when master node A is powered off or restarted, that is, when master node A is powered on again, master node A needs to re-initiate network establishment. There is no topology record of the previous network in the Mesh network. Assuming that the status of each node has not changed at this time, re-establishment is still required. By adopting the fast networking method provided by the embodiment of the present disclosure, when the master node A is powered off or restarted, the previous network topology is saved, the status of each slave node is judged during the startup of the master node A, and the fast reorganization network indication information is transmitted in the message during the networking process, so that each node can complete the fast connection and networking according to the original topology, thereby improving the networking efficiency in the reset state of the master node and enhancing the user experience.

[0058] In an exemplary embodiment, when the master node powers on, it first checks whether the user has enabled fast re-networking. If not, the master node compares the location information reported by each slave node with the previously saved location information of the corresponding node. If no changes have occurred, it initiates fast re-networking. Regardless of the method used to initiate fast re-networking, the master node sends a fast re-networking instruction message to each slave node, instructing them to form a network according to the historical mesh network topology and to cease the traditional process of self-searching and forming a network. The slave nodes report their status, such as the Wi-Fi signal strength of each slave node. If the master node determines that the Wi-Fi signal strength is within a certain range and that the slave node's status remains essentially unchanged, it quickly re-networks the network according to the previously saved Wi-Fi mesh network topology.

[0059] In some embodiments, if it is determined that a quick re-networking is not possible, the master node restarts the network in a normal networking manner and records the topology information of the re-networked mesh network (such as network connection and topology map information). It is understood that the recorded topology information of the re-networked mesh network can be used as the historical mesh network topology information after the master node is powered off and powered on again.

[0060] Correspondingly, an embodiment of the present disclosure also provides a Mesh network reorganization method, which is applied to a slave node.

[0061] FIG3 is a flow chart showing a method for reorganizing a Mesh network from a node. The method for reorganizing a Mesh network from a node mainly includes the following steps 301 and 302 .

[0062] In step 301, a connection relationship specified by the master node is received; wherein the connection relationship belongs to topology information of a historical Mesh network.

[0063] In step 302, a network connection is established with other nodes according to the connection relationship.

[0064] In some embodiments, before executing the step of receiving the connection relationship specified by the master node, fast networking indication information sent by the master node is received; wherein, the fast networking indication information is used to notify the slave node to establish a network connection with other nodes according to the specified connection relationship.

[0065] In some embodiments, before executing the step of establishing a network connection with other nodes based on the connection relationship, the slave node reports the information of the slave node to the master node, and the information of the slave node includes at least one of the following dimensions: the status information of the slave node; the location information of the slave node.

[0066] In some embodiments, the slave node broadcasts its location information to the master node. Specifically, the location information may be broadcast periodically when the slave node is powered on. The slave node obtains its location information through positioning, which may include but is not limited to at least one of the following methods: Wi-Fi, Bluetooth, and GPS. The location information may specifically be physical location coordinates, such as longitude and latitude coordinates.

[0067] In some embodiments, the slave node sends its own status information to the master node by periodically broadcasting the status information while powered on, or by sending its own status information to the master node after receiving rapid networking indication information sent by the master node (in this case, the rapid networking indication information is also used to notify the slave node to report its own status information to the master node). The status information may include signal strength information of the slave node, etc.

[0068] In some embodiments, the connection relationship sent by the master node and received by the slave node may specifically be the connection relationship between all nodes in the historical Mesh network, or the connection relationship related to the slave node in the historical Mesh network.

[0069] The mesh reorganization method provided in the disclosed embodiments stores the topology information of the mesh network. When the master node is powered on again, the master node retrieves the saved topology information of the historical mesh network, which includes information about the master node, information about each slave node, and the connection relationships between the master node and each slave node. The master node then reorganizes the mesh network with the slave nodes of the historical mesh network based on the topology information of the historical mesh network. This allows for rapid mesh reorganization, avoids the need to re-collect information and re-establish the mesh network according to the complete establishment process each time the master node is powered on again, optimizes the mesh reorganization process, and improves the efficiency of mesh network establishment after the master node is powered on again.

[0070] For Wi-Fi Mesh networking, refer to the schematic diagram of the Wi-Fi Mesh networking process shown in Figure 4. It should be noted that this networking process is only an example, and the order of some steps can be adjusted without affecting the overall networking effect. For example, the slave node reports the working status information of the Wi-Fi signal strength after receiving the fast networking flag, or the slave node first reports the working status information of the Wi-Fi signal strength and then receives the fast networking flag. The adjustment of the order of the two does not affect the overall networking effect. The embodiment of the present disclosure can solve the problem of low efficiency in the previous Wi-Fi Mesh networking process, which requires re-networking and constructing the network topology. The topology of the Wi-Fi Mesh network before re-networking is the information formed after the Wi-Fi Mesh completes the networking based on the location and status information of each node. The master node will save the original network topology information for subsequent re-networking use. When re-networking, the master node determines that the positions of the slave nodes in the current network have not changed, and initiates a rapid network reorganization. Each slave node receives the rapid network reorganization flag and reports the working status information of the Wi-Fi signal strength. When the master node determines that the working status of each slave node has not changed, it completes the rapid networking according to the saved network topology information. The efficiency of establishing a Wi-Fi Mesh network is improved, the network topology can be quickly constructed, and the user experience is greatly improved. Currently, Wi-Fi Mesh networks have become a popular application for deploying wireless networks in homes and offices. The method provided in the embodiments of the present disclosure can be applied to the deployment of WLAN Mesh network products. On the basis of existing CPE (Customer Premise Equipment) network equipment, the efficiency of reorganizing the Wi-Fi Mesh network is greatly improved, and the user experience of WLAN Mesh products is further improved.

[0071] The steps of the various methods above are divided only for clarity of description. During implementation, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this disclosure. Adding insignificant modifications or introducing insignificant designs to the algorithm or process without changing the core design of the algorithm and process are all within the scope of protection of this disclosure.

[0072] The present disclosure provides a Mesh network reorganization device, which is applied to a master node. The specific implementation of the device can be found in the relevant description of the method embodiment, which will not be repeated here. FIG5 shows a schematic diagram of the structure of the device. As shown in FIG5, the device includes an acquisition module 501 and a reorganization module 502.

[0073] The acquisition module 501 is configured to acquire the saved historical Mesh network topology information when the master node is powered on again; wherein the historical Mesh network topology information includes: information of the master node, information of each slave node, and the connection relationship between the master node and each slave node.

[0074] The reorganization module 502 is configured to reorganize the Mesh network with each of the slave nodes of the historical Mesh network according to the topology information of the historical Mesh network.

[0075] The present disclosure provides a Mesh network reorganization device for use with a slave node. The specific implementation of the device can be found in the relevant description of the method embodiment and will not be repeated here. FIG6 shows a schematic diagram of the structure of the device. As shown in FIG6 , the device includes a first receiving module 601 and a connecting module 602.

[0076] The first receiving module 601 is configured to receive the connection relationship sent by the master node; wherein the connection relationship belongs to the topology information of the historical Mesh network.

[0077] The connection module 602 is configured to establish a network connection with other nodes according to the connection relationship.

[0078] The functions or modules included in the apparatus provided in the embodiments of the present disclosure can be used to execute the method described in the method embodiments. The specific implementation and technical effects thereof can be referred to the description of the above method embodiments, and will not be repeated here for the sake of brevity.

[0079] It should be noted that all modules involved in this embodiment are logical modules. In actual applications, a logical unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, to highlight the innovations of this disclosure, this embodiment does not include units that are not closely related to solving the technical problems proposed by this disclosure. However, this does not mean that other units do not exist in this embodiment.

[0080] The embodiment of the present disclosure further provides a Mesh networking management system, as shown in FIG7 , which includes a slave node information reporting module 701 , a slave node status determination module 702 , a Mesh topology management module 703 and a Mesh networking management module 704 .

[0081] Among them, the slave node information reporting module 701 is set in the slave node; the slave node status judgment module 702, the Mesh topology management module 703 and the Mesh networking management module 704 are set in the master node.

[0082] The slave node information reporting module 701 is configured to report the location information and status information of the slave node to the master node.

[0083] The slave node status determination module 702 is configured to determine whether the status of the slave node has changed according to the status information reported by the slave node, and determine whether the position of the slave node has changed according to the position information reported by the slave node.

[0084] The Mesh topology management module 703 is configured to save the topology information of the historical Mesh network.

[0085] The Mesh networking management module 704 is configured to obtain the topology information of the historical Mesh network from the Mesh topology management module and quickly re-network when the master node is powered on again and the slave node status judgment module determines that the status and position of the slave node have not changed.

[0086] 8 , an embodiment of the present disclosure provides an electronic device, comprising: at least one processor 801; a memory 802 on which at least one program is stored, and when the at least one program is executed by the at least one processor, the at least one processor implements the above method; and at least one I / O interface 803, connected between the processor and the memory, and configured to implement information interaction between the processor and the memory.

[0087] Among them, the processor 801 is a device with data processing capabilities, including but not limited to a central processing unit (CPU); the memory 802 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically such as SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and flash memory (FLASH); the I / O interface (read-write interface) 803 is connected between the processor 801 and the memory 802, and can realize information exchange between the processor 801 and the memory 802, including but not limited to a data bus (Bus), etc.

[0088] In some embodiments, the processor 801 , the memory 802 , and the I / O interface 803 are connected to each other via a bus, and further connected to other components of the computing device.

[0089] This embodiment further provides a computer-readable medium on which a computer program is stored. When the program is executed by a processor, the method provided in this embodiment is implemented. To avoid repeated description, the specific steps of the method are not repeated here.

[0090] It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules / units in the methods applied for above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As is well known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable, and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0091] It should be noted that, in this document, the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, article, or apparatus comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or apparatus. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article, or apparatus comprising the element.

[0092] Those skilled in the art will understand that although some embodiments described herein include certain features included in other embodiments but not other features, the combination of features from different embodiments is meant to be within the scope of the present embodiment and to form different embodiments.

[0093] It is understood that the above embodiments are merely exemplary embodiments for illustrating the principles of the present disclosure, and the present disclosure is not limited thereto. Those skilled in the art may make various modifications and improvements without departing from the spirit and substance of the present disclosure, and such modifications and improvements are also considered to be within the scope of protection of the present disclosure.

Claims

1. A Mesh network reorganization method, applied to a master node, the method comprising: When the master node is powered on again, the saved topology information of the historical Mesh network is obtained; wherein the topology information of the historical Mesh network includes: information of the master node, information of each slave node, and connection relationship between the master node and each slave node; According to the topology information of the historical Mesh network, a Mesh network is re-established with each of the slave nodes of the historical Mesh network.

2. The method according to claim 1, wherein: The re-establishing a Mesh network with each of the slave nodes of the historical Mesh network according to the topology information of the historical Mesh network includes: Receiving information reported by each of the slave nodes; Determine whether the network can be quickly re-established based on the information reported by each slave node and the information of each slave node of the historical Mesh network; In the case where the network can be re-established quickly, the Mesh network is re-established with each slave node according to the connection relationship in the topology information of the historical Mesh network.

3. The method according to claim 1 or 2, wherein: The re-establishing a Mesh network with each of the slave nodes of the historical Mesh network according to the topology information of the historical Mesh network includes: The connection relationship is acquired from the topology information of the historical Mesh network, and the connection relationship is sent to each of the slave nodes, so that the slave node establishes a network connection with other nodes according to the received connection relationship.

4. The method according to claim 2, further comprising: Before executing the step of re-establishing the Mesh network with each slave node according to the connection relationship in the topology information of the historical Mesh network, fast networking indication information is sent to each slave node in the historical Mesh network; wherein the fast networking indication information is used to notify the slave node to establish a network connection with other nodes according to the specified connection relationship.

5. The method according to claim 2, wherein: The information of the slave node and the information reported by the slave node include at least one of the following dimensions: Status information of the slave node; The location information of the slave node.

6. The method according to claim 5, wherein: The determining whether the network can be quickly re-established according to the information reported by each slave node and the information of each slave node of the historical Mesh network includes: Determine whether the status of each slave node has changed according to the status information reported by each slave node and the status information of each slave node in the historical Mesh network; In the case where the states of the slave nodes do not change, determining that the network can be quickly re-established; When the state of at least one of the slave nodes changes, it is determined that rapid re-networking is not possible.

7. The method according to claim 5, wherein: The determining whether the network can be quickly re-established according to the information reported by each slave node and the information of each slave node of the historical Mesh network includes: According to the position information reported by each of the slave nodes and the position information of each of the slave nodes in the historical Mesh network, determining whether the position of each of the slave nodes has changed; In the case where the positions of the slave nodes do not change, determining that the network can be quickly re-established; In the case where the position of at least one of the slave nodes changes, it is determined that rapid re-networking is not possible.

8. The method according to claim 5, wherein: The determining whether the network can be quickly re-established according to the information reported by each slave node and the information of each slave node of the historical Mesh network includes: According to the position information reported by each of the slave nodes and the position information of each of the slave nodes in the historical Mesh network, determining whether the position of each of the slave nodes has changed; Determine whether the status of each slave node has changed according to the status information reported by each slave node and the status information of each slave node in the historical Mesh network; In the case where the positions of the slave nodes do not change and the states of the slave nodes do not change, determining that the network can be quickly re-established; When the position or state of at least one of the slave nodes changes, it is determined that the network cannot be quickly re-established.

9. The method according to claim 2, wherein: The method further comprises: Before executing the step of determining whether a fast re-networking is possible based on the information reported by each slave node and the information of each slave node of the historical Mesh network, a startup instruction for a fast re-networking mode is received.

10. The method according to any one of claims 1 to 9, wherein: The master node and each slave node in the Mesh network are wireless access hotspots.

11. A Mesh network reorganization method, wherein: Applied to a slave node, the method comprises: Receive a connection relationship specified by a master node; wherein the connection relationship belongs to topology information of a historical Mesh network; Establish a network connection with other nodes according to the connection relationship.

12. The method according to claim 11, wherein: The method further comprises: Before executing the step of receiving the connection relationship specified by the master node, fast networking indication information sent by the master node is received; wherein the fast networking indication information is used to notify the slave node to establish a network connection with other nodes according to the specified connection relationship.

13. The method according to claim 11, wherein: The method further comprises: Before executing the step of establishing a network connection with other nodes according to the connection relationship, reporting the information of the slave node to the master node, wherein the information of the slave node includes at least one of the following dimensions: Status information of the slave node; The location information of the slave node.

14. An electronic device comprising: at least one processor; A memory having at least one program stored thereon, wherein when the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 10 or implements the method according to any one of claims 11 to 13; At least one I / O interface is connected between the processor and the memory and is configured to implement information interaction between the processor and the memory.

15. A computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method according to any one of claims 1 to 10 or the method according to any one of claims 11 to 13 is implemented.

Images