Scheduling method, master node and computer-readable storage medium

Abstract

A scheduling method, a master node, and a computer-readable storage medium. The scheduling method includes the steps of: receiving report information transmitted by a subnode in the Mesh network (201); determining whether a target link exists in the Mesh network based on the report information (202), where a node on the target link can provide the terminal with the preset bandwidth (202); if the target link does not exist, determining whether a target subnode exists in the Mesh network (203), where a node on a link through which the terminal reaches a network egress via the target subnode can provide the terminal with the preset bandwidth (203); and if the target subnode exists, scheduling the terminal from a currently connected subnode to the target subnode (204).

Description

[Technical field]

[0001] This application is filed based on a Chinese patent application bearing application number 202110680519.9 and filing date June 18, 2021, and claims priority to the Chinese patent application, the entire contents of which are incorporated herein by reference.

[0002] The embodiments of the present application relate to the technical field of terminals, and in particular to a scheduling method, a master node, and a computer-readable storage medium. [Background technology]

[0003] A wireless mesh network is based on the mutual cooperation and collaboration among a large number of wireless access points (abbreviated as APs) distributed in a mesh shape, and has the advantages of broadband, high speed and high spectrum efficiency, and has excellent characteristics such as dynamic self-organization, self-configuration and self-maintenance. At present, the solution for managing terminals accessed by a single AP has matured, but there is no corresponding resource scheduling method for the entire mesh network, which can meet the personal demands of users for terminal services when the functions of the nodes in the mesh network are different and each terminal can flexibly roam at each node. Summary of the Invention [Problem to be solved by the invention]

[0004] The embodiments of the present application propose a scheduling method, a master node, and a computer-readable storage medium. [Means for solving the problem]

[0005] In view of this, an embodiment of the present application provides a scheduling method applied to a master node in a mesh network, the mesh network including several nodes, the several nodes including the master node and several subnodes, the subnodes being used to allow a terminal to access the mesh network, and a resource parameter being set for the terminal, the resource parameter including at least a preset bandwidth, the preset bandwidth being sufficient for the terminal to execute a target service. The scheduling method includes the steps of: receiving report information transmitted by a subnode in the mesh network; determining whether a target link exists in the mesh network based on the report information, the node on the target link being able to provide the preset bandwidth to the terminal; if the target link does not exist, determining whether a target subnode exists in the mesh network, the node on the link through which the terminal reaches a network exit via the target subnode being able to provide the preset bandwidth to the terminal; and if the target subnode exists, determining the target link via the target subnode; scheduling the terminal from a currently connected subnode to the target subnode.

[0006] In view of this, an embodiment of the present application further provides a master node, the master node including at least one processor and a memory communicatively connected to the at least one processor, the memory storing instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one processor to perform the scheduling method.

[0007] In view of this, an embodiment of the present application further provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the above scheduling method. [Brief description of the drawings]

[0008] [Figure 1] 1 is a schematic diagram showing the distribution of each node in a Mesh network according to an embodiment of the present application. [Diagram 2] 2 is a flowchart of a scheduling method according to an embodiment of the present application; [Diagram 3] 2 is a flowchart of a method for implementing step 202 according to an embodiment of the present application. [Figure 4] 1 is a schematic diagram of multiple terminals in a Mesh network accessing the Mesh network according to an embodiment of the present application; [Diagram 5] 1 is a schematic diagram of terminal B in a mesh network being scheduled to subnode 3 in accordance with an embodiment of the present application; [Figure 6] FIG. 2 is a structural schematic diagram of a master node according to an embodiment of the present application; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] In order to make the objectives, technical solutions, and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below with reference to the drawings. However, in various embodiments of the present specification, many technical details are presented to allow the reader to better understand the present specification. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solution claimed for protection in the present application can be realized. The division of the various embodiments below is made for the convenience of explanation and does not constitute any limitation on the specific embodiments of the present application. Various embodiments may be combined with each other and reference each other unless inconsistent.

[0010] In order to make it easier to understand the embodiments of the present application, a brief description of the Mesh network according to the present application is given below.

[0011] A mesh network includes several nodes, including a master node and several subnodes, and the subnodes are used to allow terminals to access the mesh network. The nodes in a mesh network may be from the same manufacturer or different manufacturers. The Wi-Fi functions and locations of each node may be different or partially the same. The distribution diagram of each node in a mesh network can be seen in Figure 1, and each subnode may be accessed by one or more terminals.

[0012] In one example, the Mesh network may be an EasyMesh network. In "Multi-AP Specification Version 2.0" (i.e., EasyMesh R2 standard), the protocol specifies a frame format for initiating client scheduling, but does not clarify the timing of the scheduling and the scheduling policy. For the entire network, when the functions of the nodes in the network are different and each terminal can flexibly perform mobile roaming at each node, there is no corresponding resource scheduling method that can meet the user's personal demand for terminal services.

[0013] In view of this, an embodiment of the present application provides a scheduling method applied to a master node in a Mesh network. A subnode in the Mesh network can be used to allow a terminal to access the Mesh network, and a resource parameter is set for the terminal, the resource parameter including at least a preset bandwidth, and the preset bandwidth satisfies the bandwidth required for the terminal to execute a target service. The target service may be set according to actual demand, such as high-definition video service, download service, etc. In this embodiment, the Mesh network can provide the bandwidth required for the terminal to execute the target service, so as to better ensure that the terminal executes the target service and meet the personal demand of the user's terminal for the target service.

[0014] In one example, the preset bandwidth is the lowest bandwidth required for the terminal to execute the target service. That is, the preset bandwidth corresponds to the minimum resources that the terminal can reserve. For a particular service, such as high definition video or real-time service, the lowest bandwidth is required to ensure the service demand, and allocating more bandwidth cannot further improve the user experience. The lowest bandwidth can meet the target service demand, and there is no need to allocate more bandwidth. This allows the limited bandwidth to be allocated to more terminals, which is advantageous in meeting the service demands of more terminals in the Mesh network.

[0015] In this embodiment, the flowchart of the scheduling method can be seen in FIG.

[0016] Step 201: Receive report information sent by a subnode in a Mesh network.

[0017] Step 202: Based on the report information, determine whether the target link exists in the Mesh network. If so, execute step 206; if not, proceed to step 203. Here, the node on the target link can provide the terminal with a preset bandwidth.

[0018] Step 203: Determine whether the target subnode exists in the Mesh network. If so, execute step 204; if not, proceed to step 205. A node on the link through which the terminal reaches the network exit via the target subnode can provide the terminal with a preset bandwidth.

[0019] Step 204: Schedule the terminal from the currently connected subnode to the target subnode.

[0020] Step 205: Allocate and reserve resources for the terminal to satisfy the access request of the terminal.

[0021] Step 206: Execute the target service of the terminal through the target link.

[0022] Step 207: The target subnode executes the target service of the terminal through the link that reaches the network exit.

[0023] In the embodiment of the present application, resource parameters are set for a terminal accessed in a Mesh network, and the resource parameters include at least a preset bandwidth. The preset bandwidth meets the bandwidth required for the terminal to execute the target service, so that if the target link exists, a node on the target link can provide the terminal with the preset bandwidth, and the terminal can successfully execute the target service through the target link. If the target link does not exist, the terminal is scheduled from the currently connected subnode to the target subnode, and a node on the link through which the terminal reaches the network exit through the target subnode can provide the terminal with the preset bandwidth. Thus, the terminal can also successfully execute the target service by using the preset bandwidth provided by the associated node during the process of roaming in the Mesh network. In the embodiment of the present application, for a scenario in which the terminal can roam between different nodes in the Mesh network, a scheduling method is provided that can better execute the target service of the terminal, which is favorable to satisfy the user's personal demand for the target service of the terminal.

[0024] In one example, the report information in step 201 includes connection topology information of the subnode, remaining resources of the subnode, a first rate of data transmission between the subnode and a node adjacent to the subnode, and a second rate of data transmission between the subnode and the terminal connected to the terminal. The connection topology information of the subnode may be understood as route information for the subnode to reach a network outlet in the Mesh network. The network outlet may be an optical modem, a wireless air interface, etc., and the network outlet may be connected to the master node or may be installed in the master node. The node adjacent to the subnode may be another subnode or the master node in the Mesh network. In a specific implementation, the subnode may periodically report the required report information to the master node.

[0025] For example, each subnode in a Mesh network reports its 2.4G bandwidth, its 5th Generation Mobile Communication Technology (abbreviated as 5G) bandwidth, and the capabilities it can obtain from the connection of the upper node. The obtained capabilities may be understood as the rate at which the upper node transmits data to the lower node. For example, the maximum 2.4G rate that subnode 1 supports is 300Mb / s, and the 5G rate is 866Mb / s, that is, when subnode 1 is connected to its upper node by 5G, the actual negotiation rate is 866Mb / s. A subnode connected to a terminal in a Mesh network reports a real-time negotiation rate with the terminal, that is, the rate of data transmission between the subnode connected to the terminal and the terminal.

[0026] In one example, the implementation method of step 202 can be seen in FIG.

[0027] Step 301: Based on the connection topology information of the subnodes connected to the terminal, a candidate link in the Mesh network through which the terminal reaches the network exit is determined.

[0028] Step 302: According to the remaining resource, the first rate, the second rate and the preset bandwidth of each node on the candidate link, determine whether each node on the candidate link can provide the preset bandwidth to the terminal. If yes, execute step 303; if not, proceed to step 203.

[0029] Step 303: Use the candidate link as the target link.

[0030] There are multiple nodes in the Mesh network, and there may be multiple routes for the terminal to reach the network exit. In step 301, the master node may determine multiple links in the Mesh network through which information transmitted by the terminal can reach the network exit based on the connection topology information reported by the subnodes connected to the terminal, and use these multiple links as candidate links.

[0031] In step 302, the master node may determine whether each node on the candidate link can provide the terminal with the preset bandwidth based on the remaining resource, the first rate, the second rate and the preset bandwidth of each node on the candidate link. Each node on the candidate link includes a subnode 1 (which may be called a leaf node) connected to the terminal, a master node, and an intermediate node connected between the leaf node and the master node. In a specific implementation, the master node may sequentially determine whether the leaf node, the intermediate node and the master node on the candidate link can provide the terminal with the preset bandwidth in the following manner:

[0032] First, based on the second rate and the remaining resources of the subnode connected to the terminal, determine whether the subnode connected to the terminal on the candidate link can provide the terminal with a preset bandwidth. Specifically, if R(C, S2)>BW and BW / R(C, S2)>L(S2) ​​are satisfied, determine that the subnode connected to the terminal on the candidate link can provide the terminal with a preset bandwidth. Here, R(C, S2) is the second rate, BW is the preset bandwidth, and L(S2) ​​is the remaining resources of the subnode connected to the terminal. R(C, S2) may also be understood as the rate at which the subnode connected to the terminal transmits data to the terminal.

[0033] Then, based on the first rate of data transmission between the intermediate node and the node adjacent to the intermediate node on the candidate link and the remaining resource of the intermediate node, it is determined whether the intermediate node can provide the terminal with the preset bandwidth. Here, the intermediate node is each node on the candidate link, excluding the master node and the subnode connected to the terminal. Specifically, if R(S2, S1)>BW and BW / (R(S2, S1))>L(S1) are satisfied, it is determined that the intermediate node can provide the terminal with the preset bandwidth. Here, R(S2, S1) is the first rate of data transmission between the intermediate node and the node adjacent to the intermediate node, BW is the preset bandwidth, and L(S1) is the remaining resource of the intermediate node. R(S2, S1) may further be understood as the rate at which the subnode as an uplink node transmits data to the subnode as a downlink node among two adjacent subnodes.

[0034] Then, based on the first rate of data transmission between the master node and the subnode connected to the master node on the candidate link and the remaining resource of the master node, determine whether the master node can provide the terminal with the preset bandwidth. Specifically, if R(S1,M)>BW and BW / (R(S1,M))>L(M) are satisfied, determine that the master node can provide the terminal with the preset bandwidth. Here, R(S1,M) is the first rate of data transmission between the master node and the subnode connected to the master node on the candidate link, BW is the preset bandwidth, and L(M) is the remaining resource of the master node. R(S1,M) may also be understood as the rate at which the master node transmits data to the subnode connected to the master node.

[0035] For ease of understanding, an example is given below to illustrate how to determine whether a candidate link can be used as a target link.

[0036] First, we define some symbols for the nodes in the Mesh network.

[0037] S2, S1, and M represent nodes in the Mesh network, S represents a subnode, and M represents a master node.

[0038] R(S2, S1) represents the real-time rate of the uplink subnode S1 of subnode S2, in b / s, ie, the rate at which subnode S1 transmits data to subnode S2.

[0039] L(S2) ​​represents the remaining resources of node S2, which may be expressed as a percentage of the remaining resources in a specific implementation, with the default value being 100%.

[0040] Assume that a client, i.e., a terminal, reaches a network exit via a two-hop Mesh node, i.e., one candidate link is subnode S2----------subnode S1----------master node M. The nodes may be connected by wireless connection such as 4G, 5G, etc. The bandwidth value that the node on the candidate link needs to reserve for the terminal is BW, i.e., the preset bandwidth set for the terminal is BW. The node on the candidate link reserves the preset bandwidth for the terminal, which may be expressed as follows at each node: subnode S2 reserves resources for the terminal, subnode S1 reserves resources for subnode S2, and master node M reserves resources for subnode S1. The candidate link "subnode S2----------subnode S1----------master node M" includes three routes, and the following describes the three routes respectively.

[0041] First path: terminal C----------subnode S2. It is necessary to reserve a bandwidth of BW b / s, and the real-time rate between terminal C and subnode S2 is R(C,S2). If R(C,S2)>BW and BW / R(C,S2)>L(S2), it is considered that this part of the link meets the bandwidth requirement of the preset bandwidth required by the terminal. That is, subnode S2 can provide the preset bandwidth to the terminal. It is necessary to reserve a resource of BW / (R(C,S2)) for the terminal in S2, and at this time, the remaining allocatable resource of S2 is L(S2)-BW / (R(C,S2)).

[0042] Second path: subnode S2 -----------subnode S1. Similarly, S1 needs to reserve BW bandwidth to S2 so that S1 can reserve BW bandwidth to terminal C. The real-time rate between subnode S2 and subnode S1 is R(S2,S1). If R(S2,S1)>BW and BW / (R(S2,S1))>L(S1), this part of the link is also considered to meet the bandwidth requirement of the terminal, the preset bandwidth required. After reserving BW / (R(S2,S1)) in S1, the remaining resource that can be allocated in S1 is L(S1)-BW / R(S2,S1).

[0043] The third path: Subnode S1------------Master node M. Similarly, the resource that needs to be reserved in this part is BW / (R(S1,M)), and the remaining resource of Master node M is L(M)-BW(R(S1,M)). When all three paths meet the bandwidth requirement of the terminal, the preset bandwidth required, they update the remaining resource of S2, S1, M respectively. In this way, the resource of this part is reserved for the terminal.

[0044] If a route does not meet the bandwidth requirement of the preset bandwidth required by the terminal, the terminal may be marked to indicate that the current topology is insufficient to meet the bandwidth demand of the terminal, i.e., there is no target link for the terminal in the Mesh network. In this case, the method may proceed to step 203 to determine whether a target subnode exists in the Mesh network. Here, the node on the link where the terminal reaches the network exit through the target subnode can provide the terminal with the preset bandwidth. The reason why a route does not meet the bandwidth requirement of the preset bandwidth required by the terminal may be that most terminals are all connected to a certain subnode, and the resources of this subnode are all used, while other subnodes are still in an idle state. The terminal can be used normally by moving it to another subnode in an idle state.

[0045] For example, if the current location of the terminal does not have enough bandwidth, i.e., the terminal is at a position where it is connected to the current subnode, all the links through which the terminal reaches the network exit do not meet the bandwidth requirement of the preset bandwidth required for the terminal. Currently, the subnode with remaining resources is N, and at this time, the terminal is still connected to the original subnode. In order to calculate whether the bandwidth requirement of the preset bandwidth required for the terminal is met after the terminal is connected to the subnode N, the real-time rate that can be approximately obtained after the terminal is connected to the subnode N may be estimated first, that is, the rate of data transmission between the terminal and the subnode N may be estimated. At this time, since the terminal is not connected to the subnode N, the rate of data transmission between the terminal and the subnode N may be estimated after the terminal is connected to the subnode N (the IEEE802.11k protocol can realize this estimation). Then, in the above method of determining whether each node on the candidate link can provide the terminal with the preset bandwidth, the node on the path through which the data transmitted by the terminal reaches the network exit via the subnode N may determine whether it can provide the terminal with the preset bandwidth. If so, the subnode N may be taken as the target node, and the terminal may be scheduled from the currently connected node to the target node. Here, this scheduling process of scheduling the terminal from the currently connected node to the target node may be realized using various steering requests defined in the EasyMesh protocol, and this embodiment is not specifically limited thereto.

[0046] In one example, if the terminal does not have a target subnode, the master node may allocate and reserve resources for the terminal to meet the terminal's access request. This allows the terminal to still maintain the ability to access the Mesh network, and subsequently facilitates scheduling the terminal to an idle node if there is one. In another example, if the terminal does not have a target subnode, the process in FIG. 2 may directly end, and the terminal may compete fairly for resources with other terminals in the Mesh network.

[0047] In one embodiment, the number of terminals accessed to the Mesh network is multiple, and the resource parameters further include a priority. The priority corresponds to a priority of resources set for different terminals. The resource scheduler can preferentially satisfy the service demand of a terminal with a high priority according to the priority, and reduce the bandwidth allocated to a terminal with a low priority when the total bandwidth resource is insufficient. If the priority of a terminal is not set, it is considered to set the default lowest priority to the terminal.

[0048] The resource parameters in this embodiment include the lowest bandwidth (i.e., the preset bandwidth) and the priority. A terminal may have a resource parameter set {BW, priority}, where BW is the lowest bandwidth of the terminal and priority is the priority of the terminal.

[0049] In one example, for a terminal newly accessing the Mesh network, the master node may pre-configure a set of default resource parameters and set the newly accessed terminal to the lowest priority, which means that no special attention is paid to the terminal, the node does not reserve bandwidth for it, and the terminal competes fairly for channel resources with other terminals that are not configured.

[0050] In another example, a user may manually set a set of resource parameters for a newly accessed terminal so that the terminal meets its service demand. For example, a user may input the corresponding resource parameters for the newly accessed terminal through a UI interface. The UI interface may display the following Table 1, which includes the resource parameters:

[0051] [Table 1]

[0052] The location is a location set by the subnode to which the terminal is connected, and the priority may be 1, 0, or default in descending order, that is, the priority is set to default, which indicates the lowest priority. The preset bandwidth may have a preset default value. The default value may be preset by those skilled in the art according to actual needs and stored in the master node, and the embodiment does not specifically limit this. The media access control (MAC) address may be the MAC address of the terminal, and the Internet Protocol (IP) address may be the IP address of the terminal.

[0053] In this embodiment, the step of determining whether a target link exists in the Mesh network based on the report information may include a step of sequentially determining whether a target link exists in the Mesh network through which multiple terminals reach a network exit based on the report information in order of priority of multiple terminals accessed to the Mesh network. For example, the terminals accessed to the Mesh network include terminal A, terminal B, terminal C, and terminal D, and the priorities of these four terminals are terminal D, terminal B, terminal C, and terminal A in descending order of priority. At this time, the master node first determines whether a target link exists in the Mesh network through which terminal D reaches a network exit based on the report information, and ensures that resources can be reserved preferentially for terminal D when a target link exists through which terminal D reaches a network exit. Next, the master node determines whether a target link exists in the Mesh network through which terminal B reaches a network exit based on the report information. Next, the master node determines whether a target link exists in the Mesh network through which terminal C reaches a network exit based on the report information. Finally, the master node determines whether a target link exists in the Mesh network through which terminal A reaches a network exit based on the report information. That is, the master node calculates whether a series of nodes corresponding to each terminal can reserve a preset bandwidth for each terminal in the order of priority. First, it determines whether a target link of a terminal with high priority exists in the Mesh network, which is favorable for preferentially satisfying the service demand of the terminal with high priority, and further satisfies the personal demand of the user for the terminal service. For example, it sets a higher priority for the terminal requested by the service with high user demand.

[0054] In one example, the number of terminals to be accessed in the Mesh network is more than one, and the step of determining whether a target subnode exists in the Mesh network includes the following steps: The master node first determines the remaining resources of each node in the Mesh network. Then, the master node determines the scheduled terminals for which there is no target link. When the number of scheduled terminals is more than one, the master node sequentially determines whether a target subnode exists for the multiple scheduled terminals in the Mesh network based on the remaining resources of each node in descending order of priority of the multiple scheduled terminals. That is, after the master node determines whether a target link exists for the multiple terminals to reach the network exit in the Mesh network, the master node can obtain the remaining resources of each node and the terminals that cannot meet the bandwidth requirements (the scheduled terminals for which there is no target link). At this time, the master node finds suitable locations for these scheduled terminals in other subnodes in descending order of priority based on the remaining resources of each node. This can ensure that the scheduled terminals with high priority are scheduled preferentially, and the service demands of the scheduled terminals with high priority can be met preferentially.

[0055] In one example, if a target subnode of a terminal in a Mesh network does not exist, these terminals may be marked in the UI interface, and some reserved resources may be collectively allocated to these terminals without a target subnode to ensure their lowest access requirements.

[0056] For ease of understanding, the following description will be given by way of example. Referring to FIG. 4, the Mesh network in FIG. 4 includes a master node installed in the living room, a subnode 1 installed in the study, a subnode 2 installed in the bedroom, a subnode 3 installed in the bedroom on the second floor, and a subnode 4 installed in the dining room. The terminals that access the Mesh network include terminal A and terminal B connected to subnode 4, terminal C connected to subnode 2, and terminal D connected to subnode 1. Based on the report information, the master node determines that target links for terminal A, terminal C, and terminal D exist in the Mesh network, and that a target link for terminal B does not exist, that is, it is assumed that terminal B is a terminal to be scheduled. As determined by calculation, if terminal B is connected to subnode 3, a node on the link through which terminal B reaches the network exit via subnode 3 can provide terminal B with a preset bandwidth set for terminal B. In this case, the master node may schedule terminal B from the currently connected subnode 4 to subnode 3. The schematic diagram after scheduling can be seen in Fig. 5, where terminal B can execute the service it needs to execute through the link through which subnode 3 reaches the network exit. The nodes on the link through which subnode 3 reaches the network exit include subnode 3, subnode 1, and master node.

[0057] The embodiments of the present application can be applied to the following scenarios: 1. Reserving the bandwidth of a single or multiple terminals in the entire Mesh network (e.g., by setting a preset bandwidth for a single or multiple terminals); 2. Detecting in real time whether the bandwidth of terminals at different locations (e.g., locations connected to different subnodes) meets expectations, and providing it with movement / location recommendations (e.g., scheduling the terminal to the target subnode); 3. Reserving the service demand of individual terminals that require special attention to be accessed to the Mesh network in a prioritized manner (e.g., by setting a higher priority for terminals that require special attention).

[0058] The scheduling method in this embodiment can ensure that the nodes in the Mesh network can provide the required pre-set bandwidth to execute the target service no matter which node the terminal moves to, and ensure the smooth execution of the target service. If the terminal is too far away from any node to provide the required pre-set bandwidth, a prompt can also be given to the user. By setting priorities for multiple terminals accessed in the Mesh network and setting high priorities for terminals that need special attention, the Mesh network can preferentially meet the service demands of terminals with high priorities, thereby meeting the user's personal demands for terminal services.

[0059] It should be noted that all of the above examples in the embodiments of the present application are merely illustrative explanations for ease of understanding, and are not intended to limit the technical solutions of the present application.

[0060] The steps of the above methods are divided for clarity of description, and may be combined into one step or some steps may be divided into multiple steps in realization, as long as they contain the same logical relationship, and are within the scope of protection of this patent. Adding non-essential modifications or introducing non-essential designs to the algorithm or process without changing the core design of the algorithm or process are within the scope of protection of this patent.

[0061] The embodiment of the present application relates to a master node. The master node includes at least one processor 601 and a memory 602 communicatively connected to the at least one processor 601, as shown in Fig. 6. The memory 602 stores instructions executable by the at least one processor 601, which are executed by the at least one processor 601 to cause the at least one processor 601 to execute the scheduling method in the above embodiment.

[0062] Here, the memory 602 and the processor 601 are connected by a bus, which may include any number of interconnected buses and bridges, connecting various circuits of one or more processors 601 and memories 602 together. The bus may also connect various other circuits together, such as peripherals, voltage regulators, power management circuits, etc., all of which are known to those skilled in the art and will not be described further herein. The bus interface provides an interface between the bus and a transceiver. The transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, that provide a means for communicating with various other devices over a transmission medium. The data processed by the processor 601 is transmitted over a wireless medium via an antenna. Additionally, the antenna receives data and transmits data to the processor 601.

[0063] The processor 601 is responsible for managing the bus and general processing and may further provide a variety of functions including timing, peripheral interfaces, voltage regulation, power management and other control functions, while the memory 602 may be used to store data used by the processor 601 in performing operations.

[0064] An embodiment of the present application relates to a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the above method embodiments.

[0065] In the embodiment of the present application, resource parameters are set for a terminal accessed in a Mesh network, and the resource parameters include at least a preset bandwidth. The preset bandwidth meets the bandwidth required for the terminal to execute the target service, so that if the target link exists, a node on the target link can provide the terminal with the preset bandwidth, and the terminal can successfully execute the target service through the target link. If the target link does not exist, the terminal is scheduled from the currently connected subnode to the target subnode, and a node on the link through which the terminal reaches the network exit through the target subnode can provide the terminal with the preset bandwidth. Thus, the terminal can also successfully execute the target service by using the preset bandwidth provided by the associated node during the process of roaming in the Mesh network. In the embodiment of the present application, for a scenario in which the terminal can roam between different nodes in the Mesh network, a scheduling method is provided that can better execute the target service of the terminal, which is favorable to satisfy the user's personal demand for the target service of the terminal.

[0066] That is, implementing all or part of the steps in the methods of the above embodiments can be achieved by a program instructing related hardware. The program is stored in a storage medium and includes several instructions for causing an apparatus (which may be a single chip, chip, etc.) or a processor to execute all or part of the steps of the methods described in various embodiments of the present application. Meanwhile, the storage medium mentioned above includes various media capable of storing program codes, such as USB memory, removable hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.

[0067] The above embodiments are specific examples for implementing the present application, and in actual application, various changes in form and details may be made without departing from the spirit and scope of the present application.

Claims

1. A scheduling method applied to a master node in a Mesh network, the Mesh network including several nodes, the several nodes including the master node and several subnodes, the subnodes being used to allow a terminal to access the Mesh network, resource parameters being set in the terminal, the resource parameters including at least a preset bandwidth, the preset bandwidth satisfying a bandwidth required for the terminal to execute a target service; The scheduling method includes: receiving report information transmitted by a subnode in the Mesh network; determining whether a target link exists in the Mesh network based on the report information, and a node on the target link can provide the terminal with the preset bandwidth; If the target link does not exist, determining whether a target subnode exists in the Mesh network, wherein a node on a link through which the terminal reaches a network egress via the target subnode can provide the terminal with the preset bandwidth; If the target subnode exists, scheduling the terminal from a currently connected subnode to the target subnode to determine the target link via the target subnode.

2. The number of terminals accessed by the Mesh network is multiple, and the resource parameters further include a priority; The step of determining whether a target link exists in the Mesh network based on the report information includes: The scheduling method according to claim 1, further comprising a step of determining, in order of priority of a plurality of terminals to be accessed by the mesh network, whether or not there is a target link within the mesh network through which the plurality of terminals reach a network exit, based on the report information.

3. The report information includes connection topology information of the subnode, remaining resources of the subnode, a first rate of data transmission between the subnode and a node adjacent to the subnode, and a second rate of data transmission between the terminal and a subnode connected to the terminal; The step of determining whether a target link exists in the Mesh network based on the report information includes: determining a candidate link in the Mesh network through which the terminal reaches a network exit based on connection topology information of a subnode connected to the terminal; determining whether each node on the candidate link can provide the preset bandwidth to the terminal based on the remaining resources of each node on the candidate link, the first rate, the second rate, and the preset bandwidth; 2. The method of claim 1, further comprising: if each node on the candidate link can provide the terminal with the preset bandwidth, using the candidate link as the target link.

4. The step of determining whether each node on the candidate link can provide the preset bandwidth to the terminal based on the remaining resources of each node on the candidate link, the first rate, the second rate, and the preset bandwidth of the terminal, comprises: determining whether a subnode connected to the terminal on the candidate link can provide the preset bandwidth to the terminal based on the second rate and remaining resources of a subnode connected to the terminal; determining whether the intermediate node can provide the terminal with the preset bandwidth based on a first rate of data transmission between the intermediate node on the candidate link and a node adjacent to the intermediate node and a remaining resource of the intermediate node, the intermediate node being each node on the candidate link excluding the master node and the subnode connected to the terminal; and determining whether the master node can provide the preset bandwidth to the terminal based on a first rate of data transmission between the master node and a subnode connected to the master node on the candidate link and the remaining resources of the master node.

5. The step of determining whether a subnode connected to the terminal on the candidate link can provide the preset bandwidth to the terminal based on the second rate and remaining resources of a subnode connected to the terminal, further comprising: determining that a subnode connected to the terminal on the candidate link can provide the preset bandwidth to the terminal when R(C, S2)>BW and BW / R(C, S2)>L(S2), where R(C, S2) is the second rate, BW is the preset bandwidth, and L(S2) ​​is the remaining resource of the subnode connected to the terminal; The step of determining whether the intermediate node can provide the terminal with the preset bandwidth based on a first rate of data transmission between the intermediate node and a node adjacent to the intermediate node on the candidate link and a remaining resource of the intermediate node, comprises: determining that the intermediate node can provide the terminal with the preset bandwidth when R(S2, S1)>BW and BW / (R(S2, S1))>L(S1), where R(S2, S1) is a first rate of data transmission between the intermediate node and a node adjacent to the intermediate node, BW is the preset bandwidth, and L(S1) is a remaining resource of the intermediate node; The step of determining whether the master node can provide the terminal with the preset bandwidth based on a first rate of data transmission between the master node and a subnode connected to the master node on the candidate link and a remaining resource of the master node, 5. The scheduling method of claim 4, further comprising the step of: determining that the master node can provide the terminal with the preset bandwidth when R(S1,M)>BW and BW / (R(S1,M))>L(M), where R(S1,M) is a first rate of data transmission between the master node and a subnode connected to the master node on the candidate link, BW is the preset bandwidth, and L(M) is the remaining resource of the master node.

6. The number of terminals accessed by the Mesh network is multiple, and the resource parameters further include a priority; The step of determining whether a target subnode exists in the Mesh network comprises: determining remaining resources of each node in the Mesh network; determining a scheduled terminal for which the target link does not exist; 2. The scheduling method of claim 1, further comprising: if there are a plurality of terminals to be scheduled, determining whether or not there are target subnodes for the plurality of terminals to be scheduled in the Mesh network based on the remaining resources of each node in descending order of priority of the plurality of terminals to be scheduled.

7. After the step of determining whether a target subnode exists in the Mesh network, The method of claim 1 , further comprising the step of allocating and reserving resources to the terminal to satisfy the access request of the terminal if the target subnode does not exist.

8. The method of claim 1, wherein the preset bandwidth is the lowest bandwidth required for the terminal to execute a target service.

9. At least one processor; a memory communicatively connected to the at least one processor; A master node, wherein the memory stores instructions executable by the at least one processor that, when executed by the at least one processor, cause the at least one processor to perform the scheduling method described in any one of claims 1 to 8.

10. A computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the scheduling method according to any one of claims 1 to 8.

Images