A wireless resource scheduling method and device, and a storage medium

Abstract

Embodiments of the present application provide a wireless resource scheduling method, device and storage medium, the method comprising: an access device obtaining a first station state set, the first station state set comprising station states of a plurality of stations in a first time window; in a preset time window, the access device obtaining first time slot allocation information according to the station states, the first time slot allocation information comprising time slot allocation information of the access device for each station to use wireless resources in at least one time window; and the access device broadcasting the first time slot allocation information to each station respectively. The present scheme can reduce the interference of hidden nodes, ensure QOS, provide fair medium access, and improve the utilization rate of wireless resources.

Description

[0001] This application claims priority to the Chinese Patent Application No. 202111617276.0, filed on December 27, 2021, entitled "Wireless Resource Scheduling Method and Device and Storage Medium", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] Embodiments of the present application relate to the field of communication technology, in particular to a wireless resource scheduling method, device and storage medium. BACKGROUND

[0003] In most existing 802.11 networks, a distributed coordination function (DCF) is used to arbitrate access to a shared wireless medium. Using DCF, terminals will use a controlled channel access (CCA) mechanism to detect whether the medium is busy, and compete for access to the wireless medium. The node with the shortest avoidance time wins the medium access right. DCF does not provide quality of service (QoS) guarantees for data with bandwidth and time delay requirements, which makes it impossible to guarantee the balance of each terminal and the real-time performance of high-priority services. At the same time, in the case of long-distance data transmission, the distance between terminals is relatively far, and terminals cannot detect each other's signals. The uplink flow from the terminal to the AP end will cause serious conflicts, affecting performance, i.e., the "hidden node" problem.

[0004] To prevent conflicts, 802.11 allows workstations to use request to send (RTS) and clear to send (CTS) frames to clear the transmission area. RTS itself has two purposes: to reserve the use of the wireless medium and to require other workstations that receive this message to stop speaking. Once the receiving end receives the RTS, it will respond with CTS. Like RTS, CTS will also silence nearby workstations. However, the STA itself sending the RTS message also has conflicts, so it can only alleviate the frequency of conflicts, not completely solve the conflict problem.

[0005] In the 802.11 standard, there is another way of accessing the wireless medium, the point coordination function (PCF), which allows the 802.11 network to provide a more fair medium access mechanism. The AP polls the terminals supporting the protocol to determine whether they have data to send. Each terminal can independently occupy the channel resources, and the data transmission will not conflict, thereby solving the hidden node problem of long distance transmission. However, there are still some deficiencies: the transmission time of the polling node cannot be accurately controlled, the uncertainty of the transmission time makes the AP unable to accurately guarantee the QoS for the node, finally, the AP cannot know which nodes need to send data and which nodes do not need to send data, thereby unnecessarily allocating part of the polling time to some nodes that do not need to send data, wasting the wireless medium resources. SUMMARY

[0006] The embodiments of the present application provide a wireless resource scheduling method and device and a storage medium, which can reduce the interference of hidden nodes, guarantee QOS, provide fair medium access, and improve the utilization rate of wireless resources.

[0007] In a first aspect, the embodiments of the present application provide a wireless resource scheduling method from the perspective of an access device, the method comprising:

[0008] The access device obtains a first station state set, the first station state set comprising station states of a plurality of stations in a first time window;

[0009] In a preset time window, the access device obtains first time slot allocation information according to the station states, the first time slot allocation information comprising time slot allocation information of the access device for each station to use wireless resources in at least one time window;

[0010] The access device broadcasts the first time slot allocation information to each station respectively.

[0011] In some embodiments, the access device obtains the first time slot allocation information according to the station states, comprising:

[0012] Obtaining a preset mapping relationship, the preset mapping relationship comprising a mapping relationship among a plurality of time slot parameters, time slot parameter values corresponding to the plurality of time slot parameters, and description information of each time slot parameter;

[0013] Generating the first time slot allocation information according to the preset mapping relationship and the station states.

[0014] In some embodiments, the station state of each station comprises real-time traffic and a priority of currently accessing a wireless medium service, and the method further comprises:

[0015] The access device receives a second set of station states from the stations, the second set of station states comprising station states of the stations in a second time window, a start time of the second time window being later than an end time of the first time window;

[0016] The access device updates time slot weights of the stations in the first time slot allocation information according to the second set of station states, the time slot weights being positively related to priorities of the stations and transmission traffics.

[0017] In some embodiments, the stations comprise a first station and a second station, the first station having a higher priority than the second station.

[0018] The first time slot allocation information comprises time slot allocation information for use of wireless resources in at least three time windows, the at least three time windows comprising at least a third time window and a fourth time window, the fourth time window being later than the third time window.

[0019] The first station occupies more time slots in each of the time windows than the second station.

[0020] The first station occupies time slots in the third time window corresponding to time slots occupied by the second station in the fourth time window.

[0021] In some embodiments, the access device obtains the first time slot allocation information according to the station states, comprising:

[0022] determining scheduling information corresponding to each time slot according to the time slot allocation information for use of wireless resources in at least one time window, the scheduling information comprising a receiving station and a transmitting station corresponding to the time slot;

[0023] sorting the obtained scheduling information according to the time slots in the time slot allocation information to obtain a first schedule table;

[0024] determining whether there is at least one group of target scheduling information meeting a set condition in the scheduling information, wherein a group of target scheduling information comprises at least two scheduling information;

[0025] if so, merging the time slots of the at least two scheduling information in each group of target scheduling information;

[0026] re-performing time slot allocation according to a result of the merging to obtain the first time slot allocation information.

[0027] In some embodiments, the determining whether there is at least one set of target scheduling information meeting the set condition in the plurality of scheduling information comprises:

[0028] sorting the plurality of scheduling information in the first scheduling table according to the station address of the receiving station corresponding to the time slot to obtain a second scheduling table;

[0029] determining a first scheduling information in the current second scheduling table which has not been determined by the merging determination, and performing the merging determination on the first scheduling information to determine whether there is to-be-merged scheduling information meeting the set condition in other scheduling information after the first scheduling information;

[0030] when it is determined that there is to-be-merged scheduling information, taking the first scheduling information and the to-be-merged scheduling information as a set of target scheduling information, and removing the set of target scheduling information from the second scheduling table;

[0031] repeating the above steps until there is only one or no first scheduling information in the current second scheduling table which has not been determined by the merging determination.

[0032] In some embodiments, the performing the merging determination on the first scheduling information to determine whether there is to-be-merged scheduling information meeting the set condition in other scheduling information after the first scheduling information comprises:

[0033] comparing the first scheduling information with other scheduling information after the first scheduling information in sequence, if a first target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information; or,

[0034] comparing the first scheduling information with other scheduling information after the first scheduling information respectively, if at least one target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information;

[0035] the set condition is that the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is not a neighbor station of the receiving station of the first scheduling information; or, the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is a neighbor station of the receiving station of the first scheduling information, and the signal strength of the neighbor station is not higher than a set threshold.

[0036] In some embodiments, the re-performing time slot allocation according to the result of the merging of the target scheduling information of each group to obtain the first time slot allocation information comprises:

[0037] re-performing time slot allocation to the plurality of scheduling information according to the time sequence of the time slots corresponding to the merged target scheduling information of each group and the time slots corresponding to the unmerged scheduling information to obtain the first time slot allocation information.

[0038] In a second aspect, the embodiments of the present application provide a wireless resource scheduling method from the perspective of a first station, and the method comprises:

[0039] the first station receives first time slot allocation information from an access device, wherein the first time slot allocation information comprises time slot allocation information of the access device for each station to use wireless resources in at least one time window;

[0040] the first station polls the first time slot allocation information;

[0041] if it is determined that the station identifier corresponding to the current first time slot is the station identifier of the first station, the first station updates a first priority of the first station currently accessing wireless medium service to a second priority, wherein the second priority is higher than the first priority;

[0042] the first station transmits first data using the wireless resources in the first time slot.

[0043] In some embodiments, the first station updates the first priority of the first station currently accessing wireless medium service to the second priority comprises:

[0044] the first station acquires EDCA parameters, and updates the EDCA parameters to update the first priority of the first station currently accessing wireless medium service to the second priority.

[0045] In some embodiments, after the first station polls the first time slot allocation information, the method further comprises:

[0046] if it is determined that the station identifier corresponding to the current second time slot is not the station identifier of the first station, the first station updates a second priority of the first station currently accessing wireless medium service to the first priority;

[0047] the first station does not use the wireless resources or uses the wireless resources to transmit second data in the second time slot, wherein the ratio of the size of the second data to the size of the first data is less than a preset value.

[0048] In a third aspect, the embodiments of the present application further provide an access device, the access device comprising:

[0049] a transceiver configured to obtain a first station state set, the first station state set comprising station states of a plurality of stations in a first time window;

[0050] a processing module configured to obtain, in a preset time window, first time slot allocation information according to the station states, the first time slot allocation information comprising time slot allocation information of the access device for each station to use wireless resources in at least one time window;

[0051] the transceiver is further configured to broadcast the first time slot allocation information obtained by the processing module to each station respectively.

[0052] In some embodiments, the processing module is specifically configured to:

[0053] obtain a preset mapping relationship, the preset mapping relationship comprising a mapping relationship among a plurality of time slot parameters, time slot parameter values corresponding to the plurality of time slot parameters, and description information of each time slot parameter;

[0054] generate the first time slot allocation information according to the preset mapping relationship and the station states.

[0055] In some embodiments, the station state of each station comprises real-time traffic and a priority of current access to a wireless medium service, and the processing module is further configured to:

[0056] receive a second station state set from each station through the transceiver, the second station state set comprising station states of the plurality of stations in a second time window, a start time of the second time window being later than an end time of the first time window;

[0057] update a time slot weight of each station in the first time slot allocation information according to the second station state set, the time slot weight being in positive correlation with the priority and the transmission traffic of the station.

[0058] In some embodiments, the plurality of stations comprises a first station and a second station, and the priority of the first station is higher than that of the second station.

[0059] the first time slot allocation information comprises time slot allocation information of wireless resources in at least three time windows, and the at least three time windows comprise at least a third time window and a fourth time window, the fourth time window being later than the third time window;

[0060] wherein the first station occupies a number of time slots in each time window, which is greater than a number of time slots occupied by the second station in each time window.

[0061] The time domain position of the third time window corresponds to the time domain position of the fourth time window; and the time domain position of the third time window corresponds to the time domain position of the fourth time window.

[0062] In some embodiments, the processing module is further configured to:

[0063] determine scheduling information corresponding to each time slot according to the time slot allocation information, wherein the scheduling information includes a receiving station and a sending station corresponding to the time slot;

[0064] sort the obtained scheduling information according to the time slots in the time slot allocation information to obtain a first scheduling table;

[0065] determine whether there is at least one group of target scheduling information meeting a set condition in the scheduling information, wherein a group of target scheduling information includes at least two pieces of scheduling information;

[0066] if there is, merge the time slots of the at least two pieces of scheduling information in each group of target scheduling information;

[0067] re-perform time slot allocation according to the result of the merging of each group of target scheduling information to obtain first time slot allocation information.

[0068] In some embodiments, the processing module is further configured to:

[0069] sort the scheduling information in the first scheduling table according to the station address of the receiving station corresponding to the time slot to obtain a second scheduling table;

[0070] determine a first piece of scheduling information in the second scheduling table which has not been subjected to the merging determination, perform the merging determination on the first piece of scheduling information, and determine whether there is to-be-merged scheduling information meeting a set condition in other pieces of scheduling information after the first piece of scheduling information;

[0071] when it is determined that there is to-be-merged scheduling information, take the first piece of scheduling information and the to-be-merged scheduling information as a group of target scheduling information, and remove the group of target scheduling information from the second scheduling table;

[0072] repeat the above steps until there is only one or no first piece of scheduling information which has not been subjected to the merging determination in the second scheduling table.

[0073] In some embodiments, the processing module is further configured to:

[0074] comparing the first scheduling information with other scheduling information after the first scheduling information, if a first target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information; or,

[0075] comparing the first scheduling information with other scheduling information after the first scheduling information, if at least one target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information;

[0076] the set condition is that the receiving station of the other scheduling information is different from the receiving station of the first scheduling information, and the sending station of the other scheduling information is not a neighbor station of the receiving station of the first scheduling information; or, the receiving station of the other scheduling information is different from the receiving station of the first scheduling information, and the sending station of the other scheduling information is a neighbor station of the receiving station of the first scheduling information, and the signal strength of the neighbor station is not higher than a set threshold.

[0077] In some embodiments, the processing module is further configured to:

[0078] perform time slot allocation on the plurality of scheduling information again according to the time sequence of the time slots corresponding to the groups of target scheduling information after merging and the time slots corresponding to the unmerged scheduling information, to obtain first time slot allocation information.

[0079] In a fourth aspect, the embodiments of the present application further provide a first station, which comprises:

[0080] a transceiver module, configured to receive first time slot allocation information from an access device, the first time slot allocation information comprising time slot allocation information of the access device for each station to use wireless resources in at least one time window;

[0081] a processing module, configured to poll the first time slot allocation information, and if it is determined that a station identifier corresponding to a current time slot is a station identifier of the first station, update a first priority of the first station in accessing a wireless medium service to a second priority, the second priority being higher than the first priority;

[0082] the transceiver module is further configured to send first data using the wireless resources in the first time slot.

[0083] In some embodiments, the processing module is specifically configured to:

[0084] obtaining, by the transceiver module, the EDCA parameter, updating the EDCA parameter to update the first priority to the second priority for the first station to currently access the wireless medium service.

[0085] In some embodiments, after polling the first time slot allocation information, the processing module is further configured to:

[0086] updating the second priority to the first priority for the first station to currently access the wireless medium service if it is determined that the station identifier corresponding to the current second time slot is not the station identifier of the first station;

[0087] not using the wireless resource in the second time slot or using the wireless resource to transmit second data by the transceiver module, a ratio of a size of the second data to a size of the first data being less than a preset value.

[0088] In a fifth aspect, the embodiments of the present application further provide a processing device, including a processor and a memory, the memory storing a computer program, and the processor executing the steps in any of the wireless resource scheduling methods provided in the first aspect or the second aspect of the embodiments of the present application when invoking the computer program in the memory.

[0089] In a sixth aspect, the embodiments of the present application further provide a computer readable storage medium, the computer readable storage medium storing a plurality of instructions, and the instructions being adapted to be loaded by a processor to execute the steps in any of the wireless resource scheduling methods provided in the first aspect or the second aspect of the embodiments of the present application.

[0090] In a seventh aspect, the embodiments of the present application further provide a time division multiplexing system, including the access device of the third aspect and the first station of the fourth aspect.

[0091] From the above, the embodiments of the present application have the following technical effects:

[0092] The access device obtains a first set of station states of the stations in a first time window, and then obtains first time slot allocation information according to the station states in a preset time window, and broadcasts the first time slot allocation information to each station. Since the first time slot allocation information includes time slot allocation information of the access device for each station to use the wireless resource in at least one time window, when each station (for example, a first station) obtains the first time slot allocation information through polling, the station can use the wireless resource to transmit data in the time slot allocated to the station. In the time slot, other stations can only transmit a small amount of data or cannot transmit data. Therefore, through the wireless resource scheduling method, the time for each station to use the wireless resource can be reasonably scheduled, and the first station can avoid communication interference from other stations when transmitting data in the time slot allocated to the station. BRIEF DESCRIPTION OF DRAWINGS

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

[0094] Figure 1 is a structural schematic diagram of a time division multiplexing system software system in the present application;

[0095] Figure 2 is an operation flow schematic diagram of a wireless resource scheduling method in the present application;

[0096] Figure 3 is a signaling flow schematic diagram of a wireless resource scheduling method in the present application;

[0097] Figure 4 is a schematic diagram of a networking topology in the present application;

[0098] Figure 5 is a flow schematic diagram of a wireless resource scheduling method in the present application;

[0099] Figure 6 is a schematic diagram of a throughput test condition in the present application;

[0100] Figure 7 is a schematic diagram of time slot allocation information in the present application;

[0101] Figure 8 is a schematic diagram of a station silence condition in the present application;

[0102] Figure 9is a schematic diagram of another networking topology in the present application;

[0103] Figure 10 is a schematic diagram of time slot allocation information in the present application;

[0104] Figure 11 is a schematic diagram of a first schedule in the present application;

[0105] Figure 12 is a schematic diagram of a second schedule in the present application;

[0106] Figure 13 is a schematic diagram of a target schedule in the present application;

[0107] Figure 14 is a schematic diagram of first time slot allocation information in the present application;

[0108] Figure 15 is a schematic diagram of another time slot allocation information in the present application;

[0109] Figure 16 is a schematic diagram of a structure of an access device in the present application;

[0110] Figure 17 is a schematic diagram of a structure of a first station implementing a wireless resource scheduling method in the present application;

[0111] Figure 18 is a schematic diagram of a structure of a processing device in the present application. DETAILED DESCRIPTION

[0112] The technical solutions in the embodiments of the present application will be clearly and completely described in combination with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

[0113] In the following description, illustrative embodiments of the application will be described with reference to steps and symbolic representations of operations that are performed by one or more computers, unless indicated otherwise. As such, it will be understood that such steps and operations, while presented in a sequence, are nevertheless not inherently related, unless otherwise indicated. Moreover, many of the steps and operations can be performed by hardware, software, firmware or combination thereof, as will be apparent to those skilled in the art upon a reading of the present description and detailed description. It will also be appreciated that one or more of the steps and operations could be performed on, or using, one or more computers operating in a networked environment. It will further be appreciated that the steps and operations could be performed in an environment or across multiple environments. A representative hardware environment is depicted in Fig. 1, as will hereinafter be described. Those skilled in the art will appreciate that the mechanisms of the present application, while being primarily described in the context of a networked environment, are equally applicable to an environment in which the mechanisms of the present application are implemented across multiple computers or other devices.

[0114] The principles of the application are operable with many other general purpose or special purpose computing, communications environments or configurations. Examples of well known computing systems, environments, and configurations that can be suitable for use with the application include, but are not limited to, handheld or laptop devices, personal computers, servers, multiprocessor systems, microcomputer-based systems, networked personal computers, mainframe computers, and distributed computing environments that include any of the above systems or devices.

[0115] The terms "first", "second", and "third" and the like, are used to distinguish one element from another, and are not intended to imply a particular order or sequence. Also, the terms "comprises", "comprising", "includes", "including" and the like, are inclusive and are intended to cover non-exclusive inclusion.

[0116] Before introducing the embodiments of the application, the relevant content about the application background is introduced first.

[0117] For the hidden node problem, the time slot allocation mechanism is used to cooperate with the switching of wireless medium access priority to alleviate the conflict of RTS message, reduce the interference of hidden nodes, guarantee QOS, provide fair medium access, and not cause waste of wireless medium resources.

[0118] 1. The AP time slot allocation algorithm allocates working time slots for different STAs according to the topology and traffic conditions, alleviates the conflict, and guarantees the balance of each STA. Meanwhile, the pre-time slot arrangement is used to ensure that the STA end can work normally without causing confusion in the case of loss of time slot information.

[0119] 2. The STA changes the priority of wireless medium service access according to the working time slot. The scheduled STA makes the data transmission of the unscheduled STA be suppressed to remain silent when there is data transmission, and the data transmission of the unscheduled STA is not suppressed when there is no data transmission, so as not to cause waste of wireless medium resources, and at the same time guarantee the real-time performance of high priority services.

[0120] The software system structure of the time division multiplexing system is shown as Figure 1 Figure 1 The control module, the device management module, the load balancing module, the timer module and their calling relationship are shown, wherein:

[0121] 1. The control module is responsible for scheduling other modules. At the AP end, the control module reasonably and effectively allocates the working time slots according to the information provided by other modules, and synchronizes the time slot analysis information to the STA end. At the STA end, the control module mainly responds to the received time slot allocation information, and improves / reduces the ability of the device to compete for the wireless medium according to whether the current time slot belongs to itself.

[0122] 2. The device management module is responsible for the control of the access of the device time division multiplexing, and uniformly manages the device information participating in the scheduling.

[0123] 3. The load balancing module calculates the time slot weight of the STA according to the real-time traffic and the service priority of each STA, records the time slot weight in the device management module, and generates the time slot allocation information according to the time slot weight information and synchronizes it by the control module.

[0124] 4. The timer module generates a timing interrupt to trigger the control module to respond: to issue time slots and adjust the priority of access to the wireless medium.

[0125] Specifically, at the AP end, the device management module can be responsible for the control of the STA access and uniformly manage the STA information participating in the scheduling when the STA accesses the AP; the load balancing module calculates the time slot weight of the STA according to the real-time traffic and the service priority of each STA, records the time slot weight in the device management module, and generates the time slot allocation information according to the time slot weight information and synchronizes it by the control module; the timer module generates a timing interrupt to trigger the control module to respond: to issue time slots and adjust the priority of access to the wireless medium; and the control module can also reasonably and effectively allocate the working time slots according to the information provided by the device management module and the load balancing module when the timer module generates a timing interrupt, and synchronize the time slot analysis information to the STA end.

[0126] At the STA end, the control module can respond to the received time slot allocation information, and determine whether to send data in the current time slot according to whether the current time slot belongs to itself, that is, to improve / reduce the ability of the device to compete for the wireless medium.

[0127] ​Before introducing the wireless resource scheduling method, the process of establishing a communication connection between the station and the access device is introduced, which is convenient for the subsequent communication between each station and the access device, such as the access device broadcasting time slot allocation information to each station, and the stations polling the time slot allocation information broadcast by the access device at irregular or regular intervals.

[0128] The operation process of the wireless resource scheduling method in the application can refer to Figure 2 , including: 101, after the STA associates with the AP successfully, the STA initiates a TDMA access request to the AP, the AP device management module allocates a unique identification ID for the STA, joins the scheduling, and responds to the STA access request.

[0129] The STA accesses successfully, and then participates in the TDMA scheduling through the ID.

[0130] 102, after the STA accesses the TDMA, the AP will regularly publish time slot arrangement information, and the STA will regularly poll the time slot arrangement information.

[0131] The normal priority of the STA to access the wireless medium service is the lowest priority, and only when the current time slot belongs to itself, the priority of the STA to access the wireless medium service is improved by changing the enhanced distributed channel access (English: Enhanced Distributed Channel Access, EDCA) parameter.

[0132] Specifically, the signaling flow diagram of the STA accessing the TDMA can refer to Figure 3 , in Figure 3 , the STA first sends an access request (assoc req) to the AP to request access to the AP, and the AP responds to the access request of the STA and can reply the information of the access success to the STA. After the STA successfully accesses the AP (assoc success tdma join req), the STA can initiate a TDMA access request (tdma join req) to the AP, the AP responds to the TDMA access request of the STA, can generate a new time slot arrangement information (generate new schedule), and reply the information of the access success to the TDMA to the STA, and the information can include the unique identification ID allocated by the AP for the STA, and the STA can participate in the TDMA scheduling (set tdmainfo) based on the allocated ID after successfully accessing the TDMA.

[0133] In some embodiments, after the AP generates the time slot arrangement information, the AP can adopt a time slot reservation update mode to require all devices (STAs and APs) to uniformly execute the time slot arrangement information at a future time slot (slot time) and to make the devices adopt a broadcast + response + timeout mechanism to ensure that the devices obtain synchronization of the time slot arrangement information.

[0134] In the time slot reservation update mode, if the current time slot is greater than the reserved time slot and the time slot arrangement information is not successfully synchronized, a timeout occurs, and the time slot arrangement information needs to be reconstructed or the AP needs to be requested to reconstruct the time slot arrangement information.

[0135] For example, the devices accessing the AP are STA1 and STA2. It is assumed that the AP generates the time slot arrangement information at 12:00 and broadcasts the time slot arrangement information to STA1 and STA2. The time slot arrangement information has a reserved time slot update of 12:30, that is, STA1 and STA2 need to uniformly execute the time slot arrangement information at 12:30.

[0136] It is assumed that STA1 receives the time slot arrangement information at 12:10. STA1 can reply to the AP to indicate that the time slot arrangement information has been received. STA2 receives the time slot arrangement information at 12:40. STA2 needs to reply to the AP with timeout information to make the AP generate and broadcast the time slot arrangement information again.

[0137] Meanwhile, the scheduling of the devices needs to rely on a local hardware timer trigger. According to the uniformly issued time slot arrangement information, the devices determine whether they are authorized at each slot time, that is, whether the current slot time belongs to the device, so as to determine whether the device transmits data at the current slot time. Meanwhile, based on high-precision time between the devices, the scheduling synchronization between the devices is performed in a timely manner, so that only one device transmits data at each time.

[0138] For example, the networking topology of the devices can be as shown in FIG. 1. According to the uid of the devices that can be obtained, the situation can be as shown in Table 1. Figure 4 Figure 4

[0139] Device AP STA1 STA2 STA3 STA4 uid 0 1 2 3 4

[0140] The time slot arrangement information generated by the AP can be as shown in Table 2.

[0141] Schedule 0 1 2 2 3 4 Number 0 1 2 3 4 5

[0142] Table 2

[0143] ​​STA1, STA2, STA3 and STA4, after receiving the time slot arrangement information, assuming that the current timing synchronization function (Timing Synchronization Function, TSF for short) value is 1501554us, the time slot length is 4ms (4000us), the current time slot value can be determined as 1501554 / 4000=375, according to the current time slot value, the number can be obtained as 375%6=3, that is, the scheduling number of the current time slot is 3, and based on Table 2, the corresponding uid can be determined as 2, that is, the device STA2, so the current time slot STA2 is authorized, and the data transmission can be performed, and other devices, that is, STA1, STA3 and STA4 need to keep silent.

[0144] In addition, due to the differences between devices and the differences between environments, the scheduling between devices will be out of sync, resulting in a deviation, so scheduling synchronization is also needed.

[0145] Specifically, the TSF of the AP can be used as a time reference to redivide the time slot with a fixed time slot length, and then the scheduling synchronization is periodically performed. For example, when entering the 1024th time slot, the current TSF value can be obtained, and the modulo operation is performed in combination with the time slot length 4ms. In an ideal case, the time deviation obtained by calculation is 0, but due to the differences between devices, the time deviation can be obtained. After obtaining the time deviation, the timeout time of the next scheduling can be obtained by the time slot length-time deviation in an ideal case, which can be used to correct the scheduling. By using the time of the next scheduling by all devices, the scheduling synchronization can be performed, and the time deviation can be corrected back.

[0146] The execution subject of the wireless resource scheduling method provided in the application can be the device provided in the application, or a server device, a physical host, a vehicle-mounted terminal or a user equipment (User Equipment, UE for short) processing device integrated with the device, wherein the device can be realized in the form of hardware or software, and the UE can be a terminal device such as a smart phone, a tablet computer, a notebook computer, a palm computer, a desktop computer or a personal digital assistant (Personal Digital Assistant, PDA for short).

[0147] The architecture of a time division multiplexing system to which the wireless resource scheduling method provided in the application is applied can be as shown in Figure 4 Figure 4 ​The AP and the STAs 1, 2, 3 and 4 are included, that is, in the architecture of the time division multiplexing system, the access device can be the AP, the first stations can be the STAs 1, 2, 3 and 4 accessing the AP, and the wireless resource scheduling method described above can be implemented by the access device and the first stations, that is, the AP, the STAs 1, 2, 3 and 4.

[0148] The wireless resource scheduling method provided by the present application will be described below.

[0149] Referring to Figure 5 , Figure 5 A flowchart of the wireless resource scheduling method of the present application is shown, and the method is applied to wireless resource scheduling in a communication system. The method provided by the present application can specifically include the following steps:

[0150] 201. The access device obtains a first station state set.

[0151] The first station state set includes the station states of the plurality of stations in a first time window, and the station state of each station can include real-time traffic and the priority of the current access to the wireless medium service.

[0152] It can be understood that the access device obtains the station state of each station from the plurality of stations, that is, the access device obtains the station state of the first station from the first station. The first station is any station in the plurality of stations, and the other stations are the same, and will not be described here.

[0153] 202. In a preset time window, the access device obtains first time slot allocation information according to the station state.

[0154] The first time slot allocation information includes time slot allocation information of the access device for each station to use wireless resources in at least one time window.

[0155] In some embodiments, the access device obtains the first time slot allocation information according to the station state, including:

[0156] Obtaining a preset mapping relationship, the preset mapping relationship includes a plurality of time slot parameters, time slot parameter values corresponding to the plurality of time slot parameters, and a mapping relationship between the description information of each time slot parameter;

[0157] Generating the first time slot allocation information according to the preset mapping relationship and the station state.

[0158] For example, the AP generates time slot arrangement information through a time slot allocation algorithm according to the STA information of the device management module at regular intervals, and publishes it. The time slot arrangement information is shown in Table 3 as shown in Table 3. Figure 7 The time slot allocation algorithm information is shown in Table 3 as shown in Table 3.

[0159]

[0160]

[0161] Table 3

[0162] It is evident that by setting the aforementioned preset mapping relationship, the speed of determining the first time slot allocation information can be effectively accelerated, and the accuracy of obtaining the first time slot allocation information can be improved.

[0163] In some implementations, the plurality of sites includes a first site and a second site, wherein the first site has a higher priority than the second site;

[0164] The first time slot allocation information includes time slot allocation information for using radio resources within at least three time windows; the at least three time windows include at least a third time window and a fourth time window, the fourth time window lagging behind the third time window;

[0165] Wherein, the number of time slots occupied by the first station in each time window is greater than the number of time slots occupied by the second station in each time window;

[0166] The time domain position of the first station in the third time window corresponds to the time domain position of the fourth time window; the time domain position of the second station in the third time window corresponds to the time domain position of the fourth time window.

[0167] Preferably, the at least three time windows may include a third time window and a fourth time window, plus the first and second time windows in the above embodiments, for a total of four time windows. Specifically, within the first time window, each station can send data and report its own information, i.e., station status (e.g., real-time traffic), to the access device. Within the second time window, the access device obtains the first time slot allocation information based on the station status of each station and broadcasts the first time slot allocation information to each station before the end of the second time window. The broadcast first time slot allocation information includes the time slots in the third and fourth time windows, meaning that after receiving the first time slot allocation information, each station can send data in the corresponding time slots of the third and fourth time windows.

[0168] like Figure 7 The diagram illustrates one approach to allocating the first time slot. Taking a time window as an example, within each period, the scheduling order of radio resources is STAs corresponding to IDs 0->1->1->2. The STA with ID 1 has a higher weight than other STAs and occupies two time slots in one period. There are four time slots and three periods. For example... Figure 5, #1 in cycle 1 corresponds to #1 in cycle 2 and cycle 3 respectively, and the time domain position (for example, time slot) in each cycle is distributed according to this rule, so as to explain the time domain position distribution of each station using wireless resources in each repeated cycle. Since the first station has high priority and there are only 4 time domain positions in a cycle, the first station must occupy at least 2 time domain positions to reflect its priority advantage.

[0169] 203、The access device broadcasts the first time slot allocation information to each station respectively.

[0170] It can be understood that the access device will send the first time slot allocation information to each station which has established a communication connection with it and is in a normal communication state, and these stations will poll the channel regularly or irregularly to obtain the first time slot allocation information. The embodiment of the present application takes the first station (the station which has established a communication connection with the access device and is in a normal communication state) as an example, which receives the first time slot allocation information by polling. The same applies to other stations, which will not be described here.

[0171] The AP generates time slot arrangement information and sends it by broadcasting. According to the time slot length and the number of time slots, it can be known that the time slot arrangement information will be generated and published again after 4ms*4=16ms.

[0172] 204、The first station receives the first time slot allocation information from the access device.

[0173] The first time slot allocation information includes the time slot allocation information of the access device for each station to use wireless resources in at least one time window.

[0174] After the STA accesses the TDMA, the AP will regularly publish the time slot arrangement information, and the STA will regularly poll the time slot arrangement information. The normal priority of the STA to access the wireless medium service is the lowest priority, and only when the current time slot belongs to itself, the priority of the STA to access the wireless medium service is improved by changing the EDCA parameter.

[0175] For wireless medium resources, the opportunity obtained by low-priority devices is much smaller than that obtained by high-priority devices, and even the low-priority devices cannot obtain wireless medium resources, and are completely suppressed and in a silent state. For example, as shown in the IxChariot throughput test case in Figure 6 .

[0176] After receiving the time slot arrangement information, the STA updates the local arrangement information. The STA will regularly poll the time slot arrangement information to determine whether the ID corresponding to the current time slot is the same as the ID of the STA itself. If they are the same, the priority of the STA to access the wireless medium service is improved, that is, the ability of the STA to compete for the wireless medium is improved. If they are not the same, the priority of the STA to access the wireless medium service is reduced, that is, the ability of the STA to compete for the wireless medium is reduced.

[0177] 205. polling the first station for the first time slot allocation information;

[0178] 206. if it is determined that the station identifier corresponding to the current first time slot is the station identifier of the first station, updating, by the first station, a first priority at which the first station currently accesses the wireless medium service to a second priority.

[0179] wherein the second priority is higher than the first priority.

[0180] 207. transmitting, by the first station, first data using the wireless resource in the first time slot.

[0181] It can be understood that when the first station uses the wireless resource, the priority of the first station is higher, and only the first station can use the wireless resource to transmit data in the first time slot, or other stations (for example, a second station) can also transmit data in the first time slot, but can only use the wireless resource to transmit a small amount of data.

[0182] In some other embodiments, after the first station polls the first time slot allocation information, the method further comprises:

[0183] if it is determined that the station identifier corresponding to the current second time slot is not the station identifier of the first station, updating, by the first station, the second priority at which the first station currently accesses the wireless medium service to the first priority;

[0184] not using, by the first station, the wireless resource in the second time slot or using the wireless resource to transmit second data, wherein a ratio of a size of the second data to a size of the first data is less than a preset value.

[0185] For example, as shown in FIG. 2, STA1 is a high priority, and STA2 and STA3 are low priorities. The low priority STAs will be suppressed by the high priority STA and cannot transmit data or can only transmit a small amount of data. In this way, a silence effect is achieved, and the hidden node interference problem is alleviated. Figure 8

[0186] ​Compared with existing technologies, in this embodiment, after the access device obtains a set of first site states from multiple sites within a first time window, it obtains first time slot allocation information based on the site states within a preset time window. The access device then broadcasts the first time slot allocation information to each site. Since this first time slot allocation information includes time slot allocation information for each site to use wireless resources within at least one time window, when each site (taking the first site as an example) obtains the first time slot allocation information through polling, it can use the wireless resources to transmit data within its allocated time slot. During the time slot when the first site transmits data, other sites (such as the second site) can only use the wireless resources to transmit a small amount of data or cannot use the wireless resources to transmit data. Therefore, this wireless resource scheduling method can reasonably schedule the time each site uses wireless resources and avoid communication interference from other sites when the first site transmits data within its own time slot.

[0187] In some implementations, the access device can determine the scheduling information corresponding to each time slot based on time slot allocation information for each site to use radio resources within at least one time window. The scheduling information includes a receiving site and a transmitting site corresponding to the respective time slot.

[0188] For example, suppose there are four sites: STA1, STA2, STA3, and STA4, and the network topology of STA1, STA2, STA3, and STA4 with the access devices (APs) can be as follows: Figure 9 As shown. In Figure 9 In the diagram, STA3's parent site is STA1, STA4's parent site is STA2, STA1's parent site is AP, and STA2's parent site is AP.

[0189] The AP can obtain the time slot allocation information for each station's use of radio resources within at least one time window based on the station status of each station in STA1, STA2, STA3, and STA4. The time slot allocation information for each station within a time window can be as follows: Figure 10 As shown. In Figure 10 In this process, STA3 transmits data in the first time slot, STA1 transmits data in the second time slot, STA4 transmits data in the third time slot, STA2 transmits data in the fourth time slot, STA2 transmits data in the fifth time slot, and STA2 transmits data in the sixth time slot.

[0190] according to Figure 10 The time slot allocation information of each station in the data can determine, for example, Figure 11 The scheduling information corresponding to each time slot is shown. For example... Figure 11As shown, in the scheduling information 1, the sending station is STA3 and the receiving station is STA1, i.e. in the scheduling information, STA3 sends data and STA1 receives data; in the scheduling information 2, the sending station is STA1 and the receiving station is AP, i.e. in the scheduling information, STA1 sends data and AP receives data; in the scheduling information 3, the sending station is STA1 and the receiving station is AP, i.e. in the scheduling information, STA1 sends data and AP receives data; in the scheduling information 4, the sending station is STA4 and the receiving station is STA2, i.e. in the scheduling information, STA4 sends data and STA2 receives data; in the scheduling information 5, the sending station is STA2 and the receiving station is AP, i.e. in the scheduling information, STA2 sends data and AP receives data; in the scheduling information 6, the sending station is STA2 and the receiving station is AP, i.e. in the scheduling information, STA2 sends data and AP receives data.

[0191] After obtaining the plurality of scheduling information, the access device can sort the plurality of scheduling information according to the time slots in the time slot allocation information to obtain a first scheduling table, and sort the plurality of scheduling information in the first scheduling table according to the station addresses of the receiving stations corresponding to the time slots to obtain a second scheduling table.

[0192] Optionally, the station address of the receiving station can be a mac address of the receiving station.

[0193] For example, the first scheduling table obtained by the access device by sorting the plurality of scheduling information according to the time slots in the time slot allocation information can be as shown in Figure 11 As shown, the receiving stations are sorted according to the station addresses in Figure 11 , and STA1, STA2 and AP are obtained, the second scheduling table obtained by sorting the plurality of scheduling information in the first scheduling table according to the station addresses of the receiving stations corresponding to the time slots can be as shown in Figure 12 .

[0194] In an embodiment, the plurality of scheduling information in the first scheduling table can also be sorted according to the device serial numbers of the receiving stations corresponding to the time slots to obtain the second scheduling table.

[0195] Determine the first scheduling information in the current second scheduling table which has not been determined by the merging determination, and perform the merging determination on the first scheduling information to determine whether there is any to-be-merged scheduling information meeting the set condition in the other scheduling information after the first scheduling information.

[0196] When it is determined that there is to-be-merged scheduling information, the first scheduling information and the to-be-merged scheduling information are taken as a group of target scheduling information, and the second scheduling table is removed; the group of target scheduling information includes at least two scheduling information.

[0197] The above steps are repeated until there is only one or no first scheduling information in the current second scheduling table that has not been determined to be merged.

[0198] Specifically, the first scheduling information is compared with other scheduling information after the first scheduling information in sequence, if a first target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information, and the target other scheduling information is taken as the to-be-merged scheduling information; when the first scheduling information is compared with other scheduling information after the first scheduling information in sequence, if a target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information; or,

[0199] The first scheduling information is compared with other scheduling information after the first scheduling information respectively, if at least one target other scheduling information meeting the set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information, and the at least one target other scheduling information is taken as the to-be-merged scheduling information.

[0200] The set condition is that the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is not the neighbor station of the receiving station of the first scheduling information; or, the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is the neighbor station of the receiving station of the first scheduling information, and the signal strength of the neighbor station is not higher than a set threshold.

[0201] The set condition is to find the sending station that does not conflict with the sending station of the first scheduling information from the other scheduling information, so that the sending station of the found target scheduling information can concurrently send data with the sending station of the first scheduling.

[0202] The basis of the set condition is that the sending stations that do not conflict and can concurrently send data cannot receive signals from each other, and the receiving stations in the multiple scheduling information of the sending stations are not the same.

[0203] Wherein, the neighbor station of the receiving station is the sending station which the receiving station can receive the station information. For example, the structure of the networking topology can be as shown in Figure 9 , and when STA1 is the receiving station, STA1, STA2, STA3, STA4 can all be the sending station. Assuming that the receiving station STA1 can receive the station information sent by the sending station STA2 and the sending station STA3 respectively, but cannot receive the station information sent by the sending station STA4, then the sending station STA2 and the sending station STA3 can be regarded as the neighbor stations of the receiving station STA1, and since the sending station STA1 is the same station as the receiving station STA1, the sending station STA1 can also be regarded as the neighbor station of the receiving station STA1.

[0204] The above threshold value can be adjusted according to the actual situation, which can be set to -90dBm in the embodiment.

[0205] For example, as shown in Figure 12 , it is the current second schedule table, and the scheduling scheduling information 1 is compared with the following five scheduling scheduling information one by one or respectively. Assuming that the receiving stations of the scheduling scheduling information 3, the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6 are all different from the receiving station of the scheduling scheduling information 1, and the sending stations of the scheduling scheduling information 3, the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6 are all the neighbor stations of the receiving station of the scheduling scheduling information 1, then it can be determined that the scheduling scheduling information 3, the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6 are not the to-be-merged scheduling scheduling information; and the receiving station of the scheduling scheduling information 2 is different from the receiving station of the scheduling scheduling information 1, and the sending station of the scheduling scheduling information 2 is not the neighbor station of the receiving station of the scheduling scheduling information 1, then it can be determined that the scheduling scheduling information 2 is the to-be-merged scheduling scheduling information, and the scheduling scheduling information 1 and the scheduling scheduling information 2 are taken as a group of target scheduling scheduling information, and then the scheduling scheduling information 1 and the scheduling scheduling information 2 are removed from the current second schedule table.

[0206] Based on the above processing, the current second schedule table contains the scheduling scheduling information 3, the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6. The scheduling scheduling information 3 is compared with the following three scheduling scheduling information one by one or respectively. Since the receiving stations of the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6 are all the same as the receiving station of the scheduling scheduling information 3, it can be determined that the scheduling scheduling information 4, the scheduling scheduling information 5 and the scheduling scheduling information 6 are not the to-be-merged scheduling scheduling information.

[0207] Based on the above processing, the current second schedule table contains scheduling information 4, scheduling information 5 and scheduling information 6. Comparing scheduling information 4 with the following two scheduling information in turn or separately, since the receiving stations of scheduling information 5 and scheduling information 6 are the same as that of scheduling information 4, it can be determined that scheduling information 5 and scheduling information 6 are not the to-be-merged scheduling information.

[0208] Based on the above processing, the current second schedule table contains scheduling information 5 and scheduling information 6. Comparing scheduling information 5 with the following scheduling information 6, since the receiving station of scheduling information 6 is the same as that of scheduling information 5, it can be determined that scheduling information 6 is not the to-be-merged scheduling information.

[0209] When it is determined that there is at least one group of target scheduling information meeting the set condition in the plurality of scheduling information, the time slots of at least two scheduling information in each group of target scheduling information are merged;

[0210] According to the result of merging each group of target scheduling information, the time slot allocation is performed again to obtain the first time slot allocation information, that is, according to the time sequence of the time slots corresponding to each group of target scheduling information after merging and the time slots corresponding to the unmerged scheduling information, the time slot allocation is performed again to obtain the first time slot allocation information.

[0211] The above re-performing time slot allocation to obtain the first time slot allocation information according to the result of merging each group of target scheduling information includes two cases:

[0212] Firstly, when the time slots of at least two scheduling information in each group of target scheduling information are merged, if all the time slots of the scheduling information can be merged, that is, there is no unmerged scheduling information in the plurality of scheduling information, then only according to the result of merging each group of target scheduling information, the time slot allocation is performed again to obtain the first time slot allocation information;

[0213] Secondly, when the time slots of at least two scheduling information in each group of target scheduling information are merged, part of the time slots of the scheduling information can be merged, and part of the time slots of the scheduling information cannot be merged, that is, there is unmerged scheduling information in the plurality of scheduling information, then according to the result of merging each group of target scheduling information and the unmerged scheduling information, the time slot allocation is performed again to obtain the first time slot allocation information.

[0214] For example, the schedule table contains eight scheduling information, i.e., scheduling information 1, scheduling information 2, scheduling information 3, scheduling information 4, scheduling information 5, scheduling information 6, scheduling information 7 and scheduling information 8, and the scheduling information 1 corresponds to the first time slot, the scheduling information 2 corresponds to the second time slot, the scheduling information 3 corresponds to the third time slot, and the scheduling information 8 corresponds to the eighth time slot.

[0215] Suppose that based on the above-mentioned merging determination, it is determined that the scheduling information 1, the scheduling information 3 and the scheduling information 5 are a group of target scheduling information, and the scheduling information 2 and the scheduling information 6 are a group of target scheduling information, then the time slots of the scheduling information 1, the scheduling information 3 and the scheduling information 5 can be merged so that the scheduling information 1, the scheduling information 3 and the scheduling information 5 correspond to the same time slot, and the time slots of the scheduling information 2 and the scheduling information 6 can be merged so that the scheduling information 2 and the scheduling information 6 correspond to the same time slot.

[0216] After the above-mentioned merging, it is determined that the scheduling information 1, the scheduling information 2, the scheduling information 3, the scheduling information 4, the scheduling information 5, the scheduling information 6, the scheduling information 7 and the scheduling information 8 correspond to five time slots, then the above-mentioned eight scheduling information can be re-allocated time slots according to the time sequence of the time slots corresponding to the scheduling information, and it is obtained that the scheduling information 1 corresponds to the first time slot, the scheduling information 2 corresponds to the second time slot, the scheduling information 3 corresponds to the first time slot, the scheduling information 4 corresponds to the third time slot, the scheduling information 5 corresponds to the first time slot, the scheduling information 6 corresponds to the second time slot, the scheduling information 7 corresponds to the fourth time slot, and the scheduling information 8 corresponds to the fifth time slot.

[0217] In an embodiment, when it is determined that there is at least one group of target scheduling information in the plurality of scheduling information which meets the set condition, the time slots of at least two scheduling information in each group of target scheduling information can also be merged into the time slot which is the earliest in time in the group of target scheduling information, and then the first time slot allocation information can be obtained by re-allocating time slots according to the merging result of each group of target scheduling information.

[0218] Exemplarily, assuming that a group of target scheduling information includes three scheduling information A, B and C, and A corresponds to time slot 1, B corresponds to time slot 4, and C corresponds to time slot 5, the time slots corresponding to B and C can be merged into the time slot corresponding to A, that is, after merging, the time slots corresponding to A, B and C are all 1; assuming that a group of target scheduling information includes two scheduling information D and E, and D corresponds to time slot 3, and E corresponds to time slot 6, the time slot corresponding to E can be merged into the time slot corresponding to D, that is, after merging, the time slots corresponding to D and E are both 3.

[0219] The above scheme is described below through two specific embodiments:

[0220] Embodiment 1: Assuming that a first scheduling table includes seven scheduling information A, B, C, D, E, F and G, wherein A corresponds to time slot 1, B corresponds to time slot 2, C corresponds to time slot 3, D corresponds to time slot 4, E corresponds to time slot 5, F corresponds to time slot 6, and G corresponds to time slot 7, after performing merging determination, it can be determined that A, D and E are a group of target scheduling information, and B and G are a group of target scheduling information, then D and E can be merged into the time slot corresponding to A, and G can be merged into the time slot corresponding to B, after merging, the time slots corresponding to A, D and E are 1, the time slots corresponding to B and G are 2, the time slot corresponding to C is 3, the time slot corresponding to F is 6, and the total number of time slots is 4, then according to the time sequence of the time slots corresponding to the scheduling information, the time slots of the above seven scheduling information are re-allocated to obtain first time slot allocation information: the time slots corresponding to A, D and E are 1, the time slots corresponding to B and G are 2, the time slot corresponding to C is 3, and the time slot corresponding to F is 4.

[0221] Embodiment 2: Assuming that a first scheduling table includes eight scheduling information A, B, C, D, E, F, G and H, wherein A corresponds to time slot 1, B corresponds to time slot 2, C corresponds to time slot 3, D corresponds to time slot 4, E corresponds to time slot 5, F corresponds to time slot 6, G corresponds to time slot 7, and H corresponds to time slot 8, after performing merging determination, it can be determined that A, C and E are a group of target scheduling information, and B, D and F are a group of target scheduling information, then C and E can be merged into the time slot corresponding to A, and D and F can be merged into the time slot corresponding to B, after merging, the time slots corresponding to A, C and E are 1, the time slots corresponding to B, D and F are 2, the time slot corresponding to G is 7, the time slot corresponding to H is 8, and the total number of time slots is 4, then according to the time sequence of the time slots corresponding to the scheduling information, the time slots of the above eight scheduling information are re-allocated to obtain first time slot allocation information: the time slots corresponding to A, C and E are 1, the time slots corresponding to B, D and F are 2, the time slot corresponding to G is 3, and the time slot corresponding to H is 4.

[0222] For example, after the above-mentioned merging determination is performed, it can be obtained that Figure 11 In the case that the scheduling scheduling information 1 and the scheduling scheduling information 4 are a group of target scheduling scheduling information, the time slots of the scheduling scheduling information 1 and the scheduling scheduling information 4 can be merged into the time slot of the scheduling scheduling information 1, that is, the time slots of the scheduling scheduling information 1 and the scheduling scheduling information 4 are both the first time slot.

[0223] After the above-mentioned merging, it can be obtained that the time slot corresponding to the scheduling scheduling information 1 and the scheduling scheduling information 4 is the first time slot, the time slot corresponding to the scheduling scheduling information 2 is the second time slot, the time slot corresponding to the scheduling scheduling information 3 is the third time slot, the time slot corresponding to the scheduling scheduling information 5 is the fifth time slot, and the time slot corresponding to the scheduling scheduling information 6 is the sixth time slot, that is, the six scheduling scheduling information correspond to five time slots, then the above-mentioned six scheduling scheduling information can be re-allocated according to the time sequence of the time slots corresponding to the scheduling scheduling information, and the obtained target schedule table can be as shown in Figure 13 In the case that the time slot of the scheduling scheduling information 1 and the scheduling scheduling information 4 is the first time slot, the time slot of the scheduling scheduling information 2 is the second time slot, the time slot of the scheduling scheduling information 3 is the third time slot, the time slot of the scheduling scheduling information 5 is the fourth time slot, and the time slot of the scheduling scheduling information 6 is the fifth time slot. Figure 13

[0224] Further, according to the target schedule table, the obtained first time slot allocation information can be as shown in Figure 14 In the case that the STA3 and the STA4 can perform concurrent data transmission in the same time slot. Figure 14 In some embodiments, after each station is successfully associated with the upper station, the station can send station information to the access device, the station information can include the mac address of the station and the mac address of the upper device associated with the station. Each station can also receive the signals of the surrounding stations, generate surrounding station information, and periodically send the surrounding station information to the access device, the surrounding station information can include the mac address of the surrounding station and the signal strength of the surrounding station.

[0225] After the access device receives the station information sent by each station, the networking topology of each station can be determined, and the time slot allocation information of each station using wireless resources in at least one time window can be determined according to the networking topology and the station state of each station.

[0226] For example, after the access device receives the station information sent by each station, it is determined that the networking topology of each station is as shown in

[0227] Figure 9 For example, after the access device receives the station information sent by each station, it is determined that the networking topology of each station is as shown in Figure 10 ​​The time slot allocation information shown, according to the station state of each station, can determine that the real-time traffic of STA1 is large, and then one more time slot can be allocated to STA1, and the time slot allocation information is as shown in Figure 15 The time slot allocation information shown.

[0228] In some other embodiments, after the networking topology of each station is stable, the access device can determine the mutually conflicting sending stations in the networking topology according to the surrounding station information sent by each station, compress the mutually conflicting sending stations, generate the first time slot allocation information, and broadcast the first time slot allocation information to each station respectively.

[0229] The condition for the stability of the networking topology can be that the networking topology does not change within a set time threshold, and the set time threshold can be adjusted according to actual conditions. In this embodiment, the set time threshold can be set to 1 minute.

[0230] Specifically, the process of determining the mutually conflicting sending stations in the networking topology can be as follows:

[0231] 1. After obtaining the first schedule table, all scheduling information in the first schedule table can be arranged according to the station address of the receiving station to obtain a second schedule table.

[0232] 2. A copy of the second schedule table is made and named as second schedule table_1.

[0233] 3. The first untraversed scheduling information is taken out in sequence.

[0234] (1) The taken-out scheduling information is named as first scheduling information.

[0235] (2) The receiving station and the sending station in the first scheduling information are determined.

[0236] 4. All contents in the second schedule table_1 except the first scheduling information are copied and named as second schedule table_2.

[0237] 5. The contents in the second schedule table_2 are traversed from the beginning.

[0238] (1) If there is no content in the second schedule table_2 at this time, the traversal ends and a failure is returned.

[0239] (2) If there is content in the second schedule table_2, the taken-out scheduling information is named as second scheduling information.

[0240] (3) The sending station and the receiving station of the second scheduling information are obtained.

[0241] (4) When the receiving node of the second scheduling information is the same as the receiving node of the first scheduling information, the second scheduling information is returned to the original position in the second scheduling table 2, and the remaining content is continued to be traversed.

[0242] (5) When the sending node of the second scheduling information appears on the neighbor information table of the receiving node of the first scheduling information, and the signal strength is higher than the set threshold, the second scheduling information is returned to the original position in the second scheduling table 2, and the remaining content is continued to be traversed.

[0243] (6) When the second scheduling information meets the requirements, that is, no conditions in the above steps (4) and (5) are hit, the current search is ended, and the search is returned as successful.

[0244] (7) The above steps (1)-(6) are repeated until the search is ended or the search is successful.

[0245] 6、When the search is returned as successful, the first scheduling information and the second scheduling information are removed from the second scheduling table 1, and the traversal is continued, and the first scheduling information and the second scheduling information are added to the merged table, and the merged ID is divided.

[0246] 7、When the search is returned as unsuccessful, the first scheduling information is returned to the original position in the second scheduling table 1, and the traversal is continued until all the scheduling information is traversed.

[0247] Since the transmission times of the stations are staggered, that is, all the stations are exclusive air interface data transmission times, but actually, for the stations that do not conflict with signals, concurrent data transmission can be performed.

[0248] Therefore, in the embodiment of the application, after the access device determines the scheduling information corresponding to each time slot according to the time slot allocation information of the wireless resources used by each station in at least one time window, whether there is at least one group of target scheduling information meeting the set condition in the plurality of scheduling information can be determined, so that the stations that do not conflict with each other and can perform concurrent data transmission can be found.

[0249] And when it is determined that there is, the time slots of at least two scheduling information in each group of target scheduling information can be merged, so that the stations that do not conflict with each other and can perform concurrent data transmission can perform data transmission in the same time slot.

[0250] In addition, the time slots of the multiple scheduling and dispatching information can be re-allocated according to the time sequence of the time slots corresponding to the scheduling and dispatching information of each group after the combination and the time slots corresponding to the scheduling and dispatching information which is not combined, to obtain first time slot allocation information, so that the sending time of the stations which can send data concurrently and do not conflict with each other in each station can be compressed, and the overall throughput of the system is improved.

[0251] In some embodiments of the present application, the access device can also periodically or randomly update the time slot allocation information. The embodiments of the present application take the periodic update of the time slot allocation information as an example.

[0252] The station state of each station includes real-time traffic and priority of current access to wireless medium service, and the method further includes:

[0253] The access device receives a second station state set from each station, the second station state set including station states of the multiple stations in a second time window, and the start time of the second time window lags behind the end time of the first time window;

[0254] The access device updates the time slot weight of each station in the first time slot allocation information according to the second station state set, and the size of the time slot weight is in positive correlation with the priority and the transmission traffic of the station.

[0255] It can be seen that, by updating the time slot allocation information, the problem of unreasonable allocation of wireless resources in this period due to the fixed time slot allocation information when some stations do not need to send data or only need to send a small amount of data and other stations need to send a large amount of data in some time slots can be avoided. Therefore, in order to improve the utilization rate of wireless resources in different periods, the embodiments of the present application update the wireless resource occupation time of each station more reasonably by updating the time slot allocation information.

[0256] In order to better implement the method of the present application, the embodiments of the present application also provide an access device and a station (taking the first station in the method embodiment as an example, and the other stations are the same, and are not described here).

[0257] Please refer to Figure 16 , Figure 16 A structure diagram of the access device 30 in the embodiments of the present application is provided, wherein the access device 30 can specifically include the following structure:

[0258] The transceiver module 301 is configured to obtain a first station state set, the first station state set including station states of multiple stations in a first time window;

[0259] The processing module 302 is configured to obtain first time slot allocation information according to the station states within a preset time window, the first time slot allocation information including time slot allocation information of wireless resources used by the access device for each station within at least one time window.

[0260] The transceiver module 301 is further configured to broadcast the first time slot allocation information obtained by the processing module 302 to each station respectively.

[0261] In some embodiments, the processing module 302 is specifically configured to:

[0262] obtain a preset mapping relationship, the preset mapping relationship including a plurality of time slot parameters, time slot parameter values corresponding to the plurality of time slot parameters, and a mapping relationship between description information of each time slot parameter;

[0263] generate the first time slot allocation information according to the preset mapping relationship and the station states.

[0264] In some embodiments, the station state of each station includes real-time traffic and a priority of current access to a wireless medium service, and the processing module 302 is further configured to:

[0265] receive a second set of station states from each station through the transceiver module 301, the second set of station states including station states of the plurality of stations within a second time window, a start time of the second time window being later than an end time of the first time window;

[0266] update a time slot weight of each station in the first time slot allocation information according to the second set of station states, the time slot weight being in positive correlation with the priority and the transmission traffic of the station.

[0267] In some embodiments, the plurality of stations include a first station and a second station, the priority of the first station being higher than that of the second station.

[0268] The first time slot allocation information includes time slot allocation information of wireless resources used within at least three time windows, the at least three time windows including at least a third time window and a fourth time window, the fourth time window being later than the third time window.

[0269] The first station occupies a number of time slots in each time window greater than a number of time slots occupied by the second station in each time window.

[0270] The time domain position of the first station in the third time window corresponds to the time domain position of the first station in the fourth time window, and the time domain position of the second station in the third time window corresponds to the time domain position of the second station in the fourth time window.

[0271] In some embodiments, the processing module 302 is further configured to:

[0272] determine scheduling information corresponding to each time slot according to the time slot allocation information, wherein the scheduling information includes a receiving station and a transmitting station corresponding to the time slot;

[0273] sort the obtained scheduling information according to the time slot in the time slot allocation information to obtain a first scheduling table;

[0274] determine whether there is at least one group of target scheduling information meeting a set condition in the scheduling information, wherein a group of target scheduling information includes at least two scheduling information;

[0275] if there is, merge the time slots of the at least two scheduling information in each group of target scheduling information;

[0276] re-perform time slot allocation according to the result of the merging of each group of target scheduling information to obtain first time slot allocation information.

[0277] In some embodiments, the processing module 302 is further configured to:

[0278] sort the scheduling information in the first scheduling table according to the station address of the receiving station corresponding to the time slot to obtain a second scheduling table;

[0279] determine a first scheduling information in the second scheduling table which has not been subjected to the merging determination, and perform the merging determination on the first scheduling information, and determine whether there is to-be-merged scheduling information meeting a set condition in the other scheduling information after the first scheduling information;

[0280] when it is determined that there is to-be-merged scheduling information, take the first scheduling information and the to-be-merged scheduling information as a group of target scheduling information, and remove them from the second scheduling table;

[0281] repeat the above steps until there is only one or no first scheduling information which has not been subjected to the merging determination in the second scheduling table.

[0282] In some embodiments, the processing module 302 is further configured to:

[0283] compare the first scheduling information with the other scheduling information after the first scheduling information in sequence, if a first target other scheduling information meeting a set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting a set condition in the other scheduling information; or,

[0284] comparing the first scheduling information with other scheduling information after the first scheduling information, if at least one target other scheduling information meeting a set condition is determined from the other scheduling information, it is determined that there is to-be-merged scheduling information meeting the set condition in the other scheduling information;

[0285] The set condition is that the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is not a neighbor station of the receiving station of the first scheduling information; or the receiving station of the other scheduling information is not the same as the receiving station of the first scheduling information, and the sending station of the other scheduling information is a neighbor station of the receiving station of the first scheduling information, and the signal strength of the neighbor station is not higher than a set threshold.

[0286] In some embodiments, the processing module 302 is further configured to:

[0287] According to the time sequence of the time slots corresponding to the groups of target scheduling information after merging and the time slots corresponding to the unmerged scheduling information, the processing module 302 re-performs time slot allocation on the multiple scheduling information to obtain first time slot allocation information.

[0288] In the embodiments of the present application, after the transceiver module 301 in the access device 30 obtains the first station state set of the station states of the stations in the first time window, in a preset time window, the processing module 302 in the access device 30 obtains the first time slot allocation information according to the station states, and the access device broadcasts the first time slot allocation information to each station. Since the first time slot allocation information includes the time slot allocation information of the wireless resources used by each station in at least one time window by the access device 30, when each station (taking the first station as an example) obtains the first time slot allocation information through polling, it can use the wireless resources in the time slots allocated to itself to transmit data. In the time slots in which the first station 40 transmits data, other stations (for example, the second station) can only transmit a small amount of data using the wireless resources or cannot transmit data using the wireless resources. Therefore, by using this wireless resource scheduling mode, the time when each station uses the wireless resources can be reasonably scheduled, and the first station can avoid communication interference from other stations when transmitting data in the time slots belonging to itself.

[0289] Please refer to Figure 17 , Figure 17 A structure diagram of the first station 40 in the embodiments of the present application is shown in FIG. 2. The first station 40 can specifically include the following structures:

[0290] The transceiver module 401 is configured to receive first time slot allocation information from the access device, wherein the first time slot allocation information comprises time slot allocation information of wireless resources used by the access device for each station in at least one time window.

[0291] The processing module 402 is configured to poll the first time slot allocation information, and if it is determined that the station identifier corresponding to the current first time slot is the station identifier of the first station, update the first priority of the first station in current access to the wireless medium service to a second priority, wherein the second priority is higher than the first priority.

[0292] The transceiver module 401 is further configured to transmit first data using the wireless resources in the first time slot.

[0293] In some embodiments, the processing module 402 is specifically configured to:

[0294] The transceiver module 401 is further configured to obtain EDCA parameters, and update the EDCA parameters to update the first priority of the first station in current access to the wireless medium service to the second priority.

[0295] In some embodiments, after polling the first time slot allocation information, the processing module 402 is further configured to:

[0296] If it is determined that the station identifier corresponding to the current second time slot is not the station identifier of the first station, update the second priority of the first station in current access to the wireless medium service to the first priority.

[0297] In the second time slot, the transceiver module 401 does not use the wireless resources or uses the wireless resources to transmit second data, wherein the ratio of the size of the second data to the size of the first data is less than a preset value.

[0298] In the embodiments of the present application, the transceiver module 401 in the first station 40 receives first time slot allocation information from the access device 30. Since the first time slot allocation information comprises time slot allocation information of wireless resources used by the access device 30 for each station in at least one time window, when the processing module 402 of the first station 40 can use the wireless resources to control the transceiver module 401 to transmit data in the time slot allocated to itself, other stations (for example, the second station) can only use the wireless resources to transmit small amount of data or cannot use the wireless resources to transmit data in the time slot in which the first station 40 transmits data. Therefore, by using this wireless resource scheduling mode, the time of using wireless resources by each station can be reasonably scheduled, and the first station can avoid communication interference from other stations when transmitting data in the time slot belonging to itself.

[0299] The present application further provides a processing device, which is described in detail in Figure 18 ,Figure 18 A structural schematic diagram of the processing device of the present application is shown. Specifically, the processing device provided by the present application includes a processor, which is configured to implement the steps in any one of the corresponding embodiments of the present application when executing the computer program stored in the memory; or the processor is configured to implement the functions of the modules in the corresponding embodiments when executing the computer program stored in the memory. Figures 1-15 A structural schematic diagram of the processing device of the present application is shown. Specifically, the processing device provided by the present application includes a processor, which is configured to implement the steps in any one of the corresponding embodiments of the present application when executing the computer program stored in the memory; or the processor is configured to implement the functions of the modules in the corresponding embodiments when executing the computer program stored in the memory. Figure 16 A structural schematic diagram of the processing device of the present application is shown. Specifically, the processing device provided by the present application includes a processor, which is configured to implement the steps in any one of the corresponding embodiments of the present application when executing the computer program stored in the memory; or the processor is configured to implement the functions of the modules in the corresponding embodiments when executing the computer program stored in the memory. Figure 17 A structural schematic diagram of the processing device of the present application is shown. Specifically, the processing device provided by the present application includes a processor, which is configured to implement the steps in any one of the corresponding embodiments of the present application when executing the computer program stored in the memory; or the processor is configured to implement the functions of the modules in the corresponding embodiments when executing the computer program stored in the memory.

[0300] For example, the computer program can be divided into one or more modules / units, one or more modules / units are stored in the memory and executed by the processor to complete the present application. One or more modules / units can be a series of computer program instruction segments capable of completing a specific function, which is used to describe the execution process of the computer program in the computer device.

[0301] The processing device can include, but is not limited to, a processor, a memory. Those skilled in the art can understand that the schematic diagram is only an example of the processing device and does not constitute a limitation on the processing device, which can include more or fewer components than the diagram, or combine certain components, or different components, for example, the processing device can also include an input / output device, a network access device, a bus, etc., and the processor, the memory, the input / output device and the network access device are connected through the bus.

[0302] The processor can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor, etc. The processor is the control center of the processing device, which connects all parts of the processing device through various interfaces and lines.

[0303] Memory can be used to store computer programs and / or modules. The processor performs various functions of the computer device by running or executing the computer programs and / or modules stored in the memory, and by accessing data stored in the memory. Memory can primarily include a program storage area and a data storage area. The program storage area can store the operating system, application programs required for at least one function (such as sound playback, image playback, etc.), etc.; the data storage area can store data created based on the use of the processing device (such as audio data, video data, etc.). Furthermore, memory can include high-speed random access memory, and can also include non-volatile memory, such as hard disks, RAM, plug-in hard disks, smart media cards (SMC), secure digital cards (SD cards), flash cards, at least one disk storage device, flash memory device, or other volatile solid-state storage devices.

[0304] The display screen is used to display characters of at least one character type output by the input / output unit.

[0305] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the above-described apparatus, processing equipment, and their corresponding modules can be found in, for example... Figures 1-15 The descriptions of any corresponding embodiments are not repeated here.

[0306] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0307] Therefore, embodiments of this application provide a computer-readable storage medium storing a plurality of instructions that can be loaded by a processor to execute the present application. Figures 1-15 For details regarding the steps in any of the corresponding embodiments, please refer to the following: Figures 1-15 The descriptions of any corresponding embodiments are not repeated here.

[0308] The computer-readable storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0309] Because of the instructions stored in the computer-readable storage medium, the present application can be executed as described above. Figures 1-15The steps in any of the corresponding embodiments can be implemented, and thus the application can be achieved as Figures 1-15 The achievable beneficial effects in any of the corresponding embodiments are described in detail in the foregoing description, and will not be repeated here.

[0310] The above describes in detail a wireless resource scheduling method and device and storage medium provided by the application. The principles and implementation manners of the application are described by applying specific examples in the embodiments of the application. The above embodiment descriptions are only used to help understand the method of the application and its core idea. Meanwhile, for those skilled in the art, the specific implementation manners and application ranges can be changed according to the idea of the application. In conclusion, the content of the specification should not be understood as a limitation of the application.

Claims

1. A wireless resource scheduling method, characterized in that, The method includes: The access device obtains a first site status set, which includes the site status of multiple sites within a first time window. Within a preset time window, the access device obtains first time slot allocation information based on the site status. The first time slot allocation information includes time slot allocation information for each site to use radio resources within at least one time window. The access devices broadcast the first time slot allocation information to each site respectively.

2. The method according to claim 1, characterized in that, The access device obtains the first time slot allocation information based on the site status, including: Obtain a preset mapping relationship, which includes a mapping relationship between multiple time slot parameters, time slot parameter values ​​corresponding to the multiple time slot parameters, and description information of each time slot parameter; The first time slot allocation information is generated based on the preset mapping relationship and the site status.

3. The method according to claim 1 or 2, characterized in that, The site status of each site includes real-time traffic and the current priority of accessing the wireless media service. The method also includes: The access device receives a second site status set from each site. The second site status set includes the site status of the multiple sites within a second time window, where the start time of the second time window lags behind the end time of the first time window. The access device updates the time slot weight of each site in the first time slot allocation information according to the second site status set. The size of the time slot weight is positively correlated with the site priority and transmission traffic.

4. The method according to claim 3, characterized in that, The plurality of sites includes a first site and a second site, wherein the first site has a higher priority than the second site; The first time slot allocation information includes time slot allocation information for using radio resources within at least three time windows; the at least three time windows include at least a third time window and a fourth time window, the fourth time window lagging behind the third time window; Wherein, the number of time slots occupied by the first station in each time window is greater than the number of time slots occupied by the second station in each time window; The time domain position of the first station in the third time window corresponds to the time domain position of the fourth time window; the time domain position of the second station in the third time window corresponds to the time domain position of the fourth time window.

5. The method according to claim 1, characterized in that, The access device obtains the first time slot allocation information based on the site status, including: Based on the time slot allocation information for each station to use radio resources within at least one time window, the scheduling information corresponding to each time slot is determined, and the scheduling information includes a receiving station and a transmitting station corresponding to the corresponding time slot. The obtained scheduling information is sorted according to the time slots in the time slot allocation information to obtain the first scheduling table; Determine whether there exists at least one set of target scheduling information that meets the set conditions among the plurality of scheduling information, wherein a set of target scheduling information includes at least two scheduling information; If they exist, the time slots of at least two scheduling information in each group of target scheduling information will be merged; Based on the result of merging the scheduling information of each group of targets, the time slot allocation is re-performed to obtain the first time slot allocation information.

6. The method according to claim 5, characterized in that, Determining whether at least one set of target scheduling information that meets the set conditions exists among the plurality of scheduling information includes: The scheduling information in the first scheduling table is sorted according to the station address of the receiving station corresponding to the time slot to obtain the second scheduling table; The first scheduling information in the current second scheduling table that has not been merged is identified, and a merge determination is performed on the first scheduling information to determine whether there are any scheduling information to be merged that meet the set conditions among the other scheduling information after the first scheduling information. When it is determined that there is scheduling information to be merged, the first scheduling information and the scheduling information to be merged are taken as a set of target scheduling information and removed from the second scheduling table; Repeat the above steps until the current second schedule table contains only one or no first schedule information that has not been merged.

7. The method according to claim 6, characterized in that, The step of performing a merging determination on the first scheduling information to determine whether there are any scheduling information to be merged that meet the set conditions among the other scheduling information following the first scheduling information includes: The first scheduling information is compared sequentially with other scheduling information following it. If a first target other scheduling information that meets the set conditions is identified from the other scheduling information, then it is determined that there is scheduling information to be merged that meets the set conditions among the other scheduling information; or... The first scheduling information is compared with other scheduling information after the first scheduling information. If at least one target other scheduling information that meets the set conditions is determined from the other scheduling information, it is determined that there is scheduling information to be merged that meets the set conditions among the other scheduling information. The conditions for meeting the criteria are as follows: the receiving station of the other scheduling information is different from the receiving station of the first scheduling information, and the sending station of the other scheduling information is not a neighboring station of the receiving station of the first scheduling information; or, the receiving station of the other scheduling information is different from the receiving station of the first scheduling information, and the sending station of the other scheduling information is a neighboring station of the receiving station of the first scheduling information, and the signal strength of the neighboring station is not higher than a set threshold.

8. The method according to claim 5, characterized in that, The step of re-allocating time slots based on the merged results of the target scheduling information of each group to obtain the first time slot allocation information includes: Based on the time slots corresponding to the merged target scheduling information of each group and the time slots corresponding to the unmerged scheduling information, the multiple scheduling information is reallocated to obtain the first time slot allocation information.

9. A wireless resource scheduling method, characterized in that, The method includes: The first station receives first time slot allocation information from the access device, the first time slot allocation information including time slot allocation information of the access device for each station to use radio resources within at least one time window; The first site polls for the first time slot allocation information; If it is determined that the site identifier corresponding to the current first time slot is the site identifier of the first site, then the first site updates the first priority of the first site's current access to the wireless media service to the second priority, where the second priority is higher than the first priority; The first station uses the wireless resources to transmit the first data within the first time slot.

10. The method according to claim 9, characterized in that, The first site updates its current priority for accessing the wireless media service from the first priority to the second priority, including: The first site obtains the EDCA parameters and updates the EDCA parameters to change the first priority of the first site's current access to the wireless media service to the second priority.

11. The method according to claim 9 or 10, characterized in that, After the first site polls the first time slot allocation information, the method further includes: If it is determined that the site identifier corresponding to the current second time slot is not the site identifier of the first site, then the first site updates the second priority of the first site's current access to the wireless media service to the first priority; The first station either does not use the wireless resources or uses the wireless resources to transmit second data during the second time slot, wherein the ratio of the size of the second data to the size of the first data is less than a preset value.

12. An access device, characterized in that, The access device includes: The transceiver module is used to obtain a first set of station statuses, which includes the station statuses of multiple stations within a first time window. The processing module is used to obtain first time slot allocation information based on the site status within a preset time window. The first time slot allocation information includes time slot allocation information for each site to use radio resources within at least one time window by the access device. The transceiver module is also used to broadcast the first time slot allocation information obtained by the processing module to each station.

13. A first station, characterized in that, The first site includes: The transceiver module is configured to receive first time slot allocation information from the access device, the first time slot allocation information including time slot allocation information of the access device for each site to use radio resources within at least one time window; The processing module is used to poll the first time slot allocation information; if it is determined that the site identifier corresponding to the current first time slot is the site identifier of the first site, then the first priority of the first site accessing the wireless media service is updated to the second priority, where the second priority is higher than the first priority; The transceiver module is also used to transmit first data using the wireless resources within the first time slot.

14. A processing apparatus, characterized in that, It includes a processor and a memory, wherein the memory stores a computer program, and the processor, when invoking the computer program in the memory, performs the method as described in any one of claims 1 to 8, or performs the method as described in any one of claims 9 to 11.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a plurality of instructions adapted for loading by a processor to perform the method of any one of claims 1 to 8, or to perform the method of any one of claims 9 to 11.

Images