Site resource allocation method, apparatus, device, and medium

Abstract

The application discloses a kind of station resource allocation method, device, equipment and medium, applied to access point side, the method comprises: according to the data waiting time of M stations, the scheduling factor of M stations is calculated;According to the scheduling factor of M stations, select N from M stations Candidate station for uplink resource scheduling;The resource unit of N candidate station is merged to determine P target station for uplink resource scheduling;Basic trigger frame is sent to P target station for uplink resource scheduling.Solve the problems of resource waste and transmission performance reduction in the prior art when OFDMA resource transmission is adopted in the present application.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, and in particular to a station resource allocation method and device, equipment and medium. BACKGROUND

[0002] The current standard for wireless local area networks, IEEE 802.11, has undergone years of development and change, and has formed a series of standards, such as 802.11a / b / g / n / ac / ax, etc. The latest standard is 802.11ax, i.e. Wi-Fi 6. Many key technologies are used in 802.11ax, such as Orthogonal Frequency Division Multiple Access (OFDMA), Multi-User Multiple-Input Multiple-Output (MU-MIMO), etc.

[0003] OFDMA is a method of adding multiple access in OFDM systems by allocating subsets of subcarriers to different users. So far, it has been adopted by many wireless technologies, such as 3GPP LTE. 802.11ax is the first WLAN standard to introduce OFDMA into WLAN networks. In addition, the 802.11ax standard also follows the LTE nomenclature, referring to the smallest subchannel as a "Resource Unit (RU)", which includes at least 26 subcarriers in each RU. OFDMA allows multiple users with different bandwidth requirements to be served simultaneously, thus efficiently utilizing the available spectrum. Subcarriers are divided into groups, each denoted as a resource unit with a minimum size of 26 subcarriers (bandwidth 2MHz) and a maximum size of 996 subcarriers (bandwidth 77.8MHz). In OFDM for traditional WLANs, the total channel bandwidth (20MHz, 40MHz, 80MHz, 160MHz, ) is used for any one frame transmission.

[0004] Multi-user OFDMA resource allocation dynamically allocates available bandwidth resources to appropriate users according to user needs and channel conditions, thus optimizing the use of resources. Currently, most OFDMA algorithms equally divide RUs or directly poll stations. Since a station will add a padding field at the end of the frame when the frame is not long enough when sending a frame, direct polling does not take into account the problem of resource waste, which reduces the transmission performance of OFDMA. Therefore, it is urgent to solve the problem of station and RU resource allocation, so as to improve the transmission efficiency of OFDMA. SUMMARY

[0005] Embodiments of the present application provide a station resource allocation method, device, equipment and medium, and solve the problems of resource waste and reduced transmission performance in the prior art.

[0006] In one aspect, the present application provides a station resource allocation method by an embodiment of the present application, which is applied to an access point side, and the method comprises:

[0007] calculating scheduling factors of M stations according to data waiting times of the M stations, M being a positive integer;

[0008] selecting N candidate stations for uplink resource scheduling from the M stations according to the scheduling factors of the M stations, N being a positive integer less than or equal to M;

[0009] merging resource units of the N candidate stations to determine P target stations for uplink resource scheduling, P being a positive integer less than N;

[0010] sending a basic trigger frame to the P target stations for uplink resource scheduling.

[0011] Optionally, the calculating the scheduling factors of the M stations according to the data waiting times of the M stations comprises:

[0012] normalizing the data waiting times of the M stations to obtain normalized waiting times of the M stations;

[0013] calculating the scheduling factors of the M stations according to the normalized waiting times of the M stations and a proportional balance factor.

[0014] Optionally, before the calculating the scheduling factors of the M stations according to the normalized waiting times of the M stations and the proportional balance factor, the method further comprises:

[0015] calculating initial balance factors of the M stations respectively according to instantaneous transmission rates and average transmission rates of the M stations

[0016] normalizing the initial balance factors of the M stations respectively to obtain normalized proportional balance factors of the M stations.

[0017] Optionally, the selecting the N candidate stations for uplink resource scheduling from the M stations according to the scheduling factors of the M stations comprises:

[0018] performing priority sorting on the scheduling factors of the M stations to obtain a sorting result;

[0019] selecting N candidate stations whose number of transmission resource units exceeds a preset threshold from the sorting result.

[0020] Optionally, the combining of the resource units of the N candidate stations to determine the P target stations for uplink resource scheduling comprises:

[0021] According to the data length of each transmission of the N candidate stations, the sending time required by the N candidate stations is calculated;

[0022] According to the sending time and priority of the N candidate stations, the resource units of the N candidate stations are combined to determine the P target stations from the N candidate stations.

[0023] Optionally, after the sending of the basic trigger frame to the P target stations for uplink resource scheduling, the method further comprises:

[0024] The data waiting time of the P target stations is updated, and the throughput rate of the P target stations is calculated.

[0025] Optionally, the method further comprises:

[0026] According to the sending time and throughput rate of the M stations, the M stations are maintained.

[0027] In another aspect, an embodiment of the present application provides a station resource allocation device, applied to an access point side, the device comprising a calculation module, a selection module, a processing module and a scheduling module, wherein:

[0028] The calculation module is configured to calculate a scheduling factor of M stations according to the data waiting time of the M stations, M being a positive integer;

[0029] The selection module is configured to select N candidate stations for uplink resource scheduling from the M stations according to the scheduling factor of the M stations, N being a positive integer less than or equal to M;

[0030] The processing module is configured to combine the resource units of the N candidate stations to determine P target stations for uplink resource scheduling, P being a positive integer less than N;

[0031] The scheduling module is configured to send a basic trigger frame to the P target stations for uplink resource scheduling.

[0032] The content not introduced or described in the embodiments of the present application can be correspondingly referred to the relevant introduction in the foregoing method embodiments, which will not be described here.

[0033] In another aspect, an embodiment of the present application provides a terminal device, which comprises a processor, a memory, a communication interface and a bus; the processor, the memory and the communication interface are connected through the bus and complete communication with each other; the memory stores executable program codes; the processor runs programs corresponding to the executable program codes by reading the executable program codes stored in the memory, so as to execute the site resource allocation method as described above.

[0034] In another aspect, an embodiment of the present application provides a computer readable storage medium, which stores programs, and when the programs run in a terminal device, the site resource allocation method as described above is executed.

[0035] The one or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: the present application calculates scheduling factors of M sites according to data waiting times of the M sites, where M is a positive integer; selects N candidate sites for uplink resource scheduling from the M sites according to the scheduling factors of the M sites, where N is a positive integer less than or equal to M; performs resource unit merging on the N candidate sites to determine P target sites for uplink resource scheduling, where P is a positive integer less than N; and sends a basic trigger frame to the P target sites for uplink resource scheduling. In the above solution, the present application can perform resource rescheduling based on data waiting times of M sites, so that site resource allocation can be conveniently and quickly realized, and technical problems such as resource waste and transmission performance reduction existing in OFDMA resource transmission in the prior art can be avoided. BRIEF DESCRIPTION OF DRAWINGS

[0036] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings needed in the embodiment description. Obviously, the drawings in the following description are some embodiments of the present application, and other drawings can also be obtained by those skilled in the art without creative effort on the basis of these drawings.

[0037] Figure 1 is a flowchart of a site resource allocation method provided by an embodiment of the present application.

[0038] Figure 2 is a flowchart of site maintenance provided by an embodiment of the present application.

[0039] Figure 3 is a structural diagram of a site resource allocation device provided by an embodiment of the present application.

[0040] Figure 4 is a structural diagram of a terminal device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0041] The embodiment of the present application provides a station resource allocation method, and solves the problems of resource waste and transmission performance reduction in prior art.

[0042] To solve the above technical problem, the technical scheme of the embodiment of the present application is as follows: calculating scheduling factors of M stations according to data waiting times of the M stations, M being a positive integer; selecting N candidate stations for uplink resource scheduling from the M stations according to the scheduling factors of the M stations, N being a positive integer less than or equal to M; performing resource unit merging on the N candidate stations to determine P target stations for uplink resource scheduling, P being a positive integer less than N; and sending a basic trigger frame to the P target stations for uplink resource scheduling.

[0043] In order to better understand the above technical scheme, the above technical scheme will be described in detail in combination with the drawings of the specification and specific embodiments.

[0044] Firstly, the term "and / or" appearing in the present document is only used to describe the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B can represent the following three cases: A exists alone, A and B exist together, and B exists alone. In addition, the character " / " in the present document generally represents an "or" relationship between the front and rear associated objects.

[0045] Please refer to Figure 1 is a flowchart of a station resource allocation method provided by the embodiment of the present application. As shown in the method applied to an access point (base station) side, the method comprises the following implementation steps: Figure 1

[0046] S101, calculating scheduling factors of M stations according to data waiting times of the M stations, M being a positive integer set by the system.

[0047] In a specific embodiment, the data waiting times of the M stations can be normalized to obtain normalized waiting times of the M stations. Specifically, the data waiting time of each station can be determined according to whether each station participates in the current round (time) of scheduling, which is specifically shown in the following formula (1):

[0048]

[0049] Wherein, represents the data waiting time of station i calculated in the current round. represents the predicted sending time of the remaining data of station i. ​Data latency of the last round. t s-1 Transmission time of the last round of station i. x s-1 Whether station i participates in the last round of scheduling.

[0050] After obtaining the data latencies of the M stations, the application can normalize the data latencies of the M stations to obtain normalized latencies of the M stations. The specific normalization processing is shown in the following formula (2):

[0051]

[0052] Wherein, D i Data amount reported by station i, which can specifically represent the data amount reported by station i in the BSR field in the trigger frame (BSRP). Data amount transmitted by station i in the last round of transmission process in the resource unit RU j Data amount transmitted by station i in the last round of transmission process in the resource unit RU i Average transmission rate of station i, i.e. average data transmission rate. Transmission rate of station i in the resource unit RU j Transmission rate of station i in the resource unit RU s Transmission time of the current round of station i.

[0053] Further, the application can calculate the scheduling factors of the M stations according to the normalized latencies of the M stations and the proportional balance factors. In specific implementation, the application can calculate the initial balance factors (also referred to as initial proportional balance factors) of the M stations according to the instantaneous transmission rates and average transmission rates of the M stations. The initial balance factor of each station can be specifically calculated according to the following formula (3):

[0054]

[0055] Wherein, Initial balance factor of station i. Instantaneous transmission rate of station i in the resource unit RU j Instantaneous transmission rate of station i in the resource unit RU

[0056] Then, the application can normalize the initial balance factors of the M stations to obtain normalized proportional balance factors of the M stations. Finally, the application can calculate the scheduling factors of the M stations according to the normalized latencies and the normalized proportional balance factors of the M stations. Specifically, the application can add the normalized latencies and the normalized proportional balance factors to obtain the corresponding scheduling factors, and the specific calculation can be shown in the following formula (4):

[0057]

[0058] Where, η i This represents the scheduling factor for station i. This indicates the data waiting time for site i. This indicates the data waiting time for site j. This represents the initial balance factor of site i. This represents the initial balance factor of station j, where j is a positive integer less than or equal to M.

[0059] S102. Based on the scheduling factors of the M sites, select N candidate sites from the M sites for uplink resource scheduling, where N is a positive integer less than or equal to M.

[0060] In one specific embodiment, this application can prioritize the scheduling factors of M sites to obtain a ranking result, wherein the ranking result includes the priority of each of the M sites. Further, this application can select N candidate sites from the ranking result whose number of transmission resource units exceeds a preset threshold. The preset threshold is a system-defined setting, for example, set according to the actual transmission needs of the system.

[0061] Specifically, in this application, the access point can allocate a scheduling factor η for each site. i The sites are sorted to obtain a priority ranking result including M sites. Then, based on the current channel's maximum allocable resource units (RUs), N candidate sites with the largest number of maximum RUs are selected for uplink OFDMA resource scheduling. Here, N is a positive integer less than or equal to M, and its specific value can be defined by the system or the user; this application does not impose any limitations.

[0062] S103. Merge the resource units of the N candidate sites to determine the P target sites for uplink resource scheduling, where P is a positive integer less than N.

[0063] In one specific embodiment, this application can add N candidate sites to a site set, and calculate the required transmission time for the N candidate sites based on the data length transmitted by each of the N candidate sites, as shown in the following formula (5):

[0064]

[0065] in, This represents the transmission time calculated by the access point based on the data length reported by site i. i This indicates whether site i participates in the calculation of the sending time in this round. i =1 indicates that site i participates in the calculation of the sending time in this round; otherwise, x i =0 indicates that site i did not participate in the calculation of the sending time in this round.

[0066] It should be noted that the set of stations involved in the present application can be determined according to the bandwidth of the current channel, for example, there are 4 sets of stations in a 20MHz channel, 5 sets of stations in a 40MHz channel, 6 sets of stations in an 80MHz channel, and 7 sets of stations in a 160MHz channel. The number of station sets is determined by the number of RU types contained in the current channel, which is not limited in the present application.

[0067] Then, the present application can perform resource unit (RU) merging on N candidate stations according to the transmission time and priority of the N candidate stations to determine P target stations from the N candidate stations. Specifically, the present application can perform resource unit RU merging on the station with the longest transmission time and the lowest priority among the N candidate stations until the merging cannot continue, thereby determining the P target stations that need to be finally scheduled. The target station is the station with the longest transmission time among the two candidate stations that need to be merged.

[0068] Optionally, when selecting the target station, the number of selected target stations is determined by the number of accessed stations (N stations) and the maximum number of 26tone RUs that can be allocated in the current channel. Specifically, for 20MHz, 40MHz, 80MHz, and 160MHz channels, the corresponding numbers are 9, 19, 37, and 74, respectively. The number of target stations finally scheduled is the minimum value of the maximum RU number of the number of accessed stations.

[0069] S104, sending a basic trigger frame to the P target stations for uplink resource scheduling.

[0070] After determining the P target stations, the present application can send a basic trigger frame (Basic Trigger) to these stations for uplink resource scheduling. Optionally, the present application can also update the data waiting time of the P target stations and calculate the throughput rate and other information of the P target stations until the current frame scheduling ends. Specifically, for example, the present application can update the estimated transmission time of the remaining data in each target station The average transmission rate Q of each target station i and the transmission time t of the current round of scheduling s .

[0071] Optionally, the calculation formula of Q i may be shown in the following formula (6):

[0072]

[0073] Wherein, T represents a sliding time window, T can be taken as 50. Generally, T is determined by the maximum idle time of the user. Generally, the greater the user idle time, the greater the value of T should be ensured, thereby improving the transmission throughput.

[0074] Optionally, the access point can add up the lengths of the data to be transmitted of all stations, and divide by the transmission time of the current scheduling, to obtain the current throughput, which is calculated according to the following formula (7):

[0075]

[0076] Wherein, T PPDU is the maximum transmission time of a single PPDU limited by the physical layer.

[0077] In an optional embodiment, the application can maintain the stations in the station set, for example, the application can maintain the M stations according to the transmission time and the throughput of the M stations. Please refer to Figure 2 is a possible flowchart of station maintenance provided by the embodiment of the application. As shown in the method shown in Figure 2 includes the following implementation steps:

[0078] S201, add all the stations to be scheduled (for example, M stations) to the station set N1, and let all x i =1, calculate the transmission time of each station, and calculate the total throughput.

[0079] S202, maintain the set N i , sort the stations according to the transmission time from large to small, select the station STA i with the largest transmission time, and then sort the stations according to the scheduling factor η i from small to large, select the station STA j with the smallest scheduling factor.

[0080] S203, judge the relationship between STA i and STA j . Specifically, if i=j, the transmission time of the station i does not participate in the calculation of the transmission time of the current round, that is, x i =0. Otherwise, merge the RUs of STA i and STA j into a larger RU, remove STA j , and update the transmission time of the station and calculate the total throughput. If the throughput increases, remove STA j from N i and add STA i to the set N i+1 . Otherwise, go to step S205.

[0081] S204, judge N i whether there are two stations in the set N i = 0, if the set is N1, it also needs to judge whether the number of remaining stations is less than or equal to the number of non-mergeable RUs, if it is satisfied, go to step S205, otherwise go to step S202.

[0082] S205, judge the number of stations in the set N i+1 is greater than or equal to 1, if it is satisfied, go to step S206, otherwise the maintenance process ends.

[0083] S206, judge whether there is a station with a larger scheduling factor in the set N j , j < i, if there is, the maintenance process ends, otherwise go to step S207.

[0084] S207, i = i + 1, set all x i = 1 in the set, go to step S202.

[0085] In an optional embodiment, when scheduling stations, since the IEEE 802.11ax protocol stipulates that there are several 26tone RUs that cannot participate in the RU merging process when allocating RUs, when determining the RU position of the stations in the set N1, it is necessary to preferentially allocate them to these 26tone RUs. The remaining stations are allocated from large to small according to the size of the RU, and the position of the RU is ensured not to overlap during the RU allocation process. Specifically, for example, the station set N1 in the present application represents the station set allocated with 26tone RUs, N2 represents the station set allocated with 52tone RUs, N3 represents the station set allocated with 106tone RUs, N4 represents the station set allocated with 242tone RUs, N5 represents the station set allocated with 484tone RUs, N6 represents the station set allocated with 996tone RUs, N7 represents the station set allocated with 2x996tone RUs, etc., without limitation.

[0086] It should be noted that in the process of maintaining the station set, the calculation is performed for the entire channel, so for RUs of the same size but different positions, the influence of channel interference is considered to be the same at the same time, so the position of the RU is not considered in the process of merging RUs, only the size of the RU is considered.

[0087] By implementing the present application, the present application increases the throughput of the system by reallocating the resources of the stations, and determining whether to continue the next calculation according to the size of the throughput in each calculation. Meanwhile, the scheduling factor is also considered in the calculation process, so as to ensure the fairness of the scheduling, and the starvation phenomenon will not occur due to the too large data volume of a station. In addition, the BSR information of the stations does not need to be obtained all the time in the iteration process of the algorithm, and all the stations that need to be scheduled at present can be obtained from the information of the previous round, which is compatible with the commonly used Bsrp scheduling mechanism. Compared with the traditional proportional balance factor scheduling method, the consideration of the data backlog in the previous round is added, the new scheduling factor is used for scheduling, so as to ensure that the stations that have not been sent in the last round can quickly join in the scheduling round afterwards. In this way, the present application implements the resource allocation and scheduling of the stations, fully considers the sending fairness of each station, and reduces the padding size of each frame as much as possible under the premise of ensuring the fairness, improves the channel utilization, and thus improves the performance of the OFDMA uplink scheduling transmission.

[0088] Based on the same inventive concept, another embodiment of the present application provides a device and a terminal equipment corresponding to the station resource allocation method described in the embodiments of the present application. Please refer to Figure 3 Fig. 1 is a structural schematic diagram of a station resource allocation device provided by an embodiment of the present application. As shown in Figure 3 The device 30 shown in Fig. 1 includes a calculation module 301, a selection module 302, a processing module 303 and a scheduling module 304, wherein:

[0089] The calculation module 301 is configured to calculate the scheduling factors of M stations according to the data waiting times of the M stations, and M is a positive integer.

[0090] The selection module 302 is configured to select N candidate stations for uplink resource scheduling from the M stations according to the scheduling factors of the M stations, and N is a positive integer less than or equal to M.

[0091] The processing module 303 is configured to merge the resource units of the N candidate stations to determine P target stations for uplink resource scheduling, and P is a positive integer less than N.

[0092] The scheduling module 304 is configured to send a basic trigger frame to the P target stations for uplink resource scheduling.

[0093] Optionally, the calculation module 301 is specifically configured to:

[0094] normalize the data waiting times of the M stations to obtain the normalized waiting times of the M stations.

[0095] According to the normalized time and the proportional balance factor of the M stations, a scheduling factor of the M stations is calculated.

[0096] Optionally, before the calculating the scheduling factor of the M stations according to the normalized time and the proportional balance factor of the M stations, the calculating module 301 is further configured to:

[0097] According to the instantaneous transmission rate and the average transmission rate of the M stations, an initial balance factor of each of the M stations is calculated.

[0098] The initial balance factor of each of the M stations is normalized to obtain a normalized proportional balance factor of the M stations.

[0099] Optionally, the selecting module 302 is specifically configured to:

[0100] The scheduling factors of the M stations are prioritized to obtain a sorting result.

[0101] From the sorting result, N candidate stations whose number of transmission resource units exceeds a preset threshold are selected.

[0102] Optionally, the processing module 303 is specifically configured to:

[0103] According to the data length of each of the N candidate stations, a sending time required by the N candidate stations is calculated.

[0104] According to the sending time and the priority of the N candidate stations, resource units of the N candidate stations are merged to determine P target stations from the N candidate stations.

[0105] Optionally, after the sending the basic trigger frame to the P target stations for uplink resource scheduling, the processing module 303 is further configured to:

[0106] The data waiting time of the P target stations is updated, and the throughput rate of the P target stations is calculated.

[0107] Optionally, the processing module 303 is further configured to:

[0108] According to the sending time and the throughput rate of the M stations, the stations are maintained.

[0109] Please see FIG. 4, which is a structural schematic diagram of a terminal device provided by an embodiment of the present application. As shown in FIG. 4, the terminal device comprises a processor 401 and a memory 402. Figure 4The terminal device 40 shown includes at least one processor 401, a communication interface 402, a user interface 403, and a memory 404, which can be connected by a bus or other means, and embodiments of the present application take the connection by the bus 405 as an example. Among them,

[0110] The processor 401 can be a general-purpose processor, such as a central processing unit (CPU).

[0111] The communication interface 402 can be a wired interface (such as an Ethernet interface) or a wireless interface (such as a cellular network interface or a wireless local area network interface) for communicating with other terminals or websites. In embodiments of the present application, the communication interface 402 is specifically used to obtain data latency and other information.

[0112] The user interface 403 can specifically be a touch panel, including a touch screen and a touch screen, for detecting operation instructions on the touch panel. The user interface 403 can also be a physical key or a mouse. The user interface 403 can also be a display screen for outputting and displaying images or data.

[0113] The memory 404 can include volatile memory (Volatile Memory), such as random access memory (RAM); the memory can also include non-volatile memory (Non-Volatile Memory), such as read-only memory (ROM), flash memory (Flash Memory), hard disk (HDD) or solid state disk (SSD); the memory 404 can also include a combination of the above types of memory. The memory 404 is used to store a set of program codes, and the processor 401 is used to call the program codes stored in the memory 404 to perform the following operations:

[0114] According to the data latency of the M stations, calculate the scheduling factor of the M stations, M is a positive integer;

[0115] According to the scheduling factor of the M stations, select N candidate stations for uplink resource scheduling from the M stations, N is a positive integer less than or equal to M;

[0116] Merge the resource units of the N candidate stations to determine P target stations for uplink resource scheduling, P is a positive integer less than N;

[0117] Send a basic trigger frame to the P target stations for uplink resource scheduling.

[0118] Optionally, the calculating the scheduling factors of the M stations according to the data waiting times of the M stations comprises:

[0119] normalizing the data waiting times of the M stations to obtain normalized times of the M stations;

[0120] calculating the scheduling factors of the M stations according to the normalized times and the proportional balance factors of the M stations.

[0121] Optionally, before the calculating the scheduling factors of the M stations according to the normalized times and the proportional balance factors of the M stations, the processor 401 is further configured to:

[0122] calculating initial balance factors of the M stations according to the instantaneous transmission rates and the average transmission rates of the M stations

[0123] normalizing the initial balance factors of the M stations to obtain normalized proportional balance factors of the M stations.

[0124] Optionally, the selecting N candidate stations from the M stations for uplink resource scheduling according to the scheduling factors of the M stations comprises:

[0125] performing priority sorting on the scheduling factors of the M stations to obtain a sorting result;

[0126] selecting N candidate stations whose transmission resource units exceed a preset threshold from the sorting result.

[0127] Optionally, the merging resource units of the N candidate stations to determine P target stations for uplink resource scheduling comprises:

[0128] calculating sending times required by the N candidate stations according to data lengths transmitted by the N candidate stations respectively;

[0129] merging resource units of the N candidate stations according to the sending times and priorities of the N candidate stations to determine P target stations from the N candidate stations.

[0130] Optionally, after the sending the basic trigger frame to the P target stations for uplink resource scheduling, the processor 401 is further configured to:

[0131] updating data waiting times of the P target stations and calculating throughput rates of the P target stations.

[0132] Optionally, the processor 401 is further configured to:

[0133] According to the sending time and the throughput rate of the M stations, the M stations are maintained.

[0134] As to the contents not introduced or described in the embodiments of the present application, reference can be made to the related introduction in the foregoing method embodiments, which will not be repeated here.

[0135] The one or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: the present application calculates the scheduling factors of M stations according to the data waiting time of the M stations, M being a positive integer; selects N candidate stations for uplink resource scheduling from the M stations according to the scheduling factors of the M stations, N being a positive integer less than or equal to M; performs resource unit merging on the N candidate stations to determine P target stations for uplink resource scheduling, P being a positive integer less than N; and sends a basic trigger frame to the P target stations for uplink resource scheduling. In the above solution, the present application can perform resource rescheduling based on the data waiting time of the M stations, so that the station resource allocation can be conveniently and quickly implemented, and technical problems such as resource waste and transmission performance reduction existing in the prior art OFDMA resource transmission can be avoided.

[0136] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage, etc.) containing computer-usable program code.

[0137] The present application is described with reference to flowcharts and / or block diagrams of the method, device (system), and computer program product according to the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing apparatus produce a device that implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in one or more flows and / or blocks Figure 1 The means for performing the functions specified in one or more flows and / or blocks.

[0138] These computer program instructions can also be stored in a computer-readable memory that can direct the computer or other programmable data processing apparatus to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including instruction means that implement the functions specified in the flowcharts and / or block diagrams.Figure 1 one or more processes and / or functions specified in the block or blocks. Figure 1 one or more processes and / or functions specified in the block or blocks.

[0139] These computer program instructions can also be loaded into computer or other programmable data processing devices, so that a series of operation steps are performed on the computer or other programmable data processing devices to generate computer-implemented processes, thus the instructions executed on the computer or other programmable data processing devices provide a process for implementing the functions specified in the flowchart Figure 1 one or more processes and / or functions specified in the block or blocks. Figure 1 one or more processes and / or functions specified in the block or blocks.

[0140] Although preferred embodiments of the application have been described herein, additional changes and modifications can be suggested to one skilled in the art, particularly in light of the

[0141] It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application cover the modifications and variations of this application provided they come within the scope of the appended claims and their equivalents.

Claims

1. A method of allocating resources to stations, characterized by, Applied to the access point side, the method comprises: According to the data waiting time of M stations, the scheduling factors of M stations are calculated, M is a positive integer; According to the scheduling factors of M stations, N candidate stations for uplink resource scheduling are selected from M stations, N is a positive integer less than or equal to M; The resource units of N candidate stations are merged to determine P target stations for uplink resource scheduling, P is a positive integer less than N; The basic trigger frame is sent to P target stations for uplink resource scheduling.

2. The method of claim 1, wherein, The scheduling factors of M stations are calculated according to the data waiting time of M stations, which comprises: The data waiting time of M stations is normalized to obtain the normalized time of M stations waiting; The scheduling factors of M stations are calculated according to the normalized time of M stations and the proportional balance factor.

3. The method of claim 2, wherein, Before the scheduling factors of M stations are calculated according to the normalized time of M stations and the proportional balance factor, the method further comprises: The initial balance factor of each of M stations is calculated according to the instantaneous transmission rate and the average transmission rate of M stations The initial balance factor of each of M stations is normalized to obtain the normalized proportional balance factor of M stations.

4. The method of claim 1, wherein, The N candidate stations for uplink resource scheduling are selected from M stations according to the scheduling factors of M stations, which comprises: The scheduling factors of M stations are prioritized to obtain the sorting result; From the sorting result, N candidate stations whose transmission resource units exceed a preset threshold are selected.

5. The method of claim 4, wherein, The resource units of N candidate stations are merged to determine P target stations for uplink resource scheduling, which comprises: The sending time required by N candidate stations is calculated according to the data length transmitted by each of N candidate stations; According to the sending time and priority of N candidate stations, the resource units of N candidate stations are merged to determine P target stations from N candidate stations.

6. The method of claim 1, wherein, After the basic trigger frame is sent to P target stations for uplink resource scheduling, the method further comprises: The data waiting time of P target stations is updated, and the throughput rate of P target stations is calculated.

7. The method of claim 1, wherein, The method further comprises: According to the sending time and throughput rate of M stations, the stations of M stations are maintained.

8. A site resource allocation device, characterized in that, Applied to the access point side, the device comprises a calculation module, a selection module, a processing module and a scheduling module, wherein: The calculation module is configured to calculate the scheduling factors of M stations according to the data waiting time of M stations, M is a positive integer; The selection module is configured to select N candidate stations for uplink resource scheduling from M stations according to the scheduling factors of M stations, N is a positive integer less than or equal to M; The processing module is configured to merge the resource units of N candidate stations to determine P target stations for uplink resource scheduling, P is a positive integer less than N; The scheduling module is configured to send the basic trigger frame to P target stations for uplink resource scheduling.

9. A terminal device, comprising: The terminal device comprises a processor, a memory, a communication interface and a bus; the processor, the memory and the communication interface are connected through the bus and complete communication with each other; the memory stores executable program codes; the processor runs programs corresponding to the executable program codes by reading the executable program codes stored in the memory, so as to execute the site resource allocation method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer readable storage medium stores programs, and when the programs run in the terminal device, the site resource allocation method according to any one of claims 1-7 is executed.

Images