CN114338558A - Scheduling method, scheduling device and electronic equipment - Google Patents

Scheduling method, scheduling device and electronic equipment Download PDF

Info

Publication number
CN114338558A
CN114338558A CN202011079583.3A CN202011079583A CN114338558A CN 114338558 A CN114338558 A CN 114338558A CN 202011079583 A CN202011079583 A CN 202011079583A CN 114338558 A CN114338558 A CN 114338558A
Authority
CN
China
Prior art keywords
service
acquiring
scheduling
queue
airtime
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202011079583.3A
Other languages
Chinese (zh)
Inventor
陈飞
樊双
周一新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN202011079583.3A priority Critical patent/CN114338558A/en
Priority to PCT/CN2021/122872 priority patent/WO2022073512A1/en
Publication of CN114338558A publication Critical patent/CN114338558A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/56Queue scheduling implementing delay-aware scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/02Selection of wireless resources by user or terminal

Abstract

The embodiment of the invention relates to the field of communication, in particular to a scheduling method, a scheduling device and electronic equipment. The scheduling method comprises the following steps: acquiring scheduling information and service data of a service, wherein the scheduling information comprises a service delay requirement, a user type, an EDCA parameter and a data structure parameter of the service; acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement; acquiring an air interface time Airtime of the service according to the data structure parameter of the service; acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority; acquiring an initial scheduling scheme according to the scheduling period, the Airtime, the user type number and the MPDU queue; and adjusting the initial scheduling scheme according to the EDCA parameters, and sending the service data according to the adjusted scheduling scheme. The method is applied to the wireless local area network, and achieves the purpose of meeting the low-delay requirement of a user.

Description

Scheduling method, scheduling device and electronic equipment
Technical Field
The embodiment of the invention relates to the field of wireless communication, in particular to a scheduling method, a scheduling device and electronic equipment.
Background
Conventional WIFI employs a carrier sense multiple access/collision avoidance mechanism to schedule multiple Stations (STAs). The flow of the carrier sense multiple access/collision avoidance mechanism is: the equipment which needs to send information monitors whether the channel is idle, if the channel is idle, the equipment waits for a Distributed Inter-frame Spacing (DIFS), otherwise, the equipment continues to monitor; if the channel has data transmission in the waiting process, the equipment needing to send information resumes listening, and if the channel is idle all the time in the waiting process, the equipment needing to send information occupies the channel to transmit data after waiting for the end.
However, with the increase of services with low traffic but low delay requirements, such as acceleration of games, low delay has become a core quality of service, but the scheduling of multiple devices using the carrier sense multiple access/collision avoidance mechanism does not take into account the low delay requirements of users.
Disclosure of Invention
The main objective of the embodiments of the present application is to provide a WIFI scheduling method, apparatus and electronic device,
in order to solve the above technical problem, an embodiment of the present invention provides a scheduling method, including: acquiring scheduling information and service data of a service, wherein the scheduling information comprises a service delay requirement, a user type, an EDCA parameter and a data structure parameter of the service; acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement; acquiring an air interface time Airtime of the service according to the data structure parameter of the service; acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority; acquiring an initial scheduling scheme according to the scheduling period, the Airtime, the user type and the MPDU queue; and adjusting the initial scheduling scheme according to the EDCA parameters, and sending the service data according to the adjusted scheduling scheme.
The embodiment of the present invention further provides a scheduling apparatus, including: the information acquisition module is used for acquiring scheduling information and service data of a service, wherein the scheduling information comprises a service delay requirement, a user type, an EDCA parameter and a data structure parameter of the service; the Airtime acquiring module is used for acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement and acquiring an Airtime of a service according to a data structure parameter of the service; and the scheduling module is used for acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority, acquiring an initial scheduling scheme according to the scheduling period, the Airtime, the user type and the MPDU queue, adjusting the initial scheduling scheme according to the EDCA parameter, and transmitting the service data according to the adjusted scheduling scheme.
An embodiment of the present invention further provides an electronic device, including:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the scheduling method described above.
Compared with the prior art, the embodiment of the invention can acquire the service data, the service delay requirement, the user type, the EDCA parameter and the data structure parameter of the service, and then acquire the service delay parameter, the scheduling period and the service priority according to the service delay requirement; acquiring an air interface time Airtime of a service according to a data structure parameter of the service, acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to a service priority, processing the service data so as to process the data according to a scheduling scheme, then acquiring an initial scheduling scheme according to a scheduling period, the Airtime, a user type and the MPDU queue, adjusting the initial scheduling scheme according to an EDCA parameter, ensuring a scheduling scheme closest to a user delay requirement under the condition of meeting a hardware condition, and finally sending the service data according to the adjusted scheduling scheme. The problem that the low-delay requirement of a user is not considered in the scheduling process in the prior art is solved. Because the service delay requirement and the service priority are introduced in the acquiring process of the scheduling scheme, the service with high priority is transmitted preferentially, the service with high priority generally has high delay requirement, the requirement of the user with less delay is reduced, and the acquired scheduling method can meet the delay requirement of the user.
Drawings
One or more embodiments are illustrated by the corresponding figures in the drawings, which are not meant to be limiting.
Fig. 1 is a flowchart of a scheduling method according to a first embodiment of the present invention;
FIG. 2 is a flow chart of a scheduling method provided by a second embodiment of the present invention;
fig. 3 is a flowchart of steps 206 and 207 in the scheduling method provided by the second embodiment of the present invention shown in fig. 2;
fig. 4 is a schematic structural diagram of a scheduling apparatus according to a third embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that in the examples of the present application, numerous technical details are set forth in order to provide a better understanding of the present application. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present application, and the embodiments may be mutually incorporated and referred to without contradiction.
A first embodiment of the present invention relates to a scheduling method applied in a wireless local area network, and a flow thereof is as shown in fig. 1, including:
step 101, obtaining scheduling information and service data of a service, wherein the scheduling information includes a service delay requirement, a user type, an EDCA parameter, and a data structure parameter of the service.
In this embodiment, the user type is a supportable protocol or mechanism type negotiated by the basic service set device and the AP, such as SU, MU-AX/AC, OFDMA, Legacy, TWT, and so on. And the data structure parameter of the service is the parameter of the data structure designed by the data path, the downlink is an actual value, and the uplink is the TID Buffer length distributed after the ADDBA response frame structure is confirmed. Service data is data required for a service provided by a device to a user.
And 102, acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement.
In this embodiment, the service delay parameter includes an average delay parameter and a maximum delay parameter, where the average delay parameter is commonly used. The service priority is information carried in the service delay requirement, and the definition of the priority conforms to the IEEE802.11ax protocol. With priority 15 being the highest and priority 0 being the lowest. Four ACs (access classes) that are compatible with legacy standards: AC _ VO (voice traffic), AC _ VI (video traffic), AC _ BE (best effort), AC _ BK (background traffic). Some custom service priorities (such as game operation, game instructions, game voice, game video, etc.) are also applicable, and can also be used as management signaling channels (highest priority).
And 103, acquiring an air interface time Airtime of the service according to the data structure parameter of the service.
And step 104, acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority.
In this embodiment, the content of the MPDU queue is service data, but the service and device corresponding to the service data are not limited, and may be a partial service of a single device or may be service data of a plurality of devices.
And 105, acquiring an initial scheduling scheme according to the scheduling period, Airtime, the user type and the MPDU queue.
And step 106, adjusting the initial scheduling scheme according to the EDCA parameters, and sending the service data according to the adjusted scheduling scheme.
In the present embodiment, an MPDUA frame in an MPDU queue is transmitted when transmitting traffic data.
Compared with the prior art, the embodiment of the invention can acquire the service data, the service delay requirement, the user type, the EDCA parameter and the data structure parameter of the service, and then acquire the service delay parameter, the scheduling period and the service priority according to the service delay requirement; acquiring an air interface time Airtime of a service according to a data structure parameter of the service, acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to a service priority, processing the service data so as to process the data according to a scheduling scheme, then acquiring an initial scheduling scheme according to a scheduling period, the Airtime, a user type number and the MPDU queue, adjusting the initial scheduling scheme according to an EDCA parameter, ensuring a scheduling scheme closest to a user delay requirement under the condition of meeting a hardware condition, and finally sending the service data according to the adjusted scheduling scheme. The problem that the low-delay requirement of a user is not considered in the scheduling process in the prior art is solved. Because the service delay requirement and the service priority are introduced in the acquiring process of the scheduling scheme, the service with high priority is transmitted preferentially, the service with high priority generally has high delay requirement, the requirement of the user with less delay is reduced, and the acquired scheduling method can meet the delay requirement of the user.
A second embodiment of the present invention relates to a scheduling method, which is applied in a wireless local area network, and a flow thereof is shown in fig. 2, including:
step 201, obtaining a service delay requirement and a service delay parameter configured by a user interface or an APP.
In this embodiment, the following parameter table may be obtained from the main contents of the user interface or APP configuration:
Figure BDA0002718014010000031
Figure BDA0002718014010000041
therein, the device and Traffic Id (TID) may be designed as a data structure in the form of "device _ TID" over the data path. In this embodiment, the maximum supported number of devices is 256, and the maximum supported number of TIDs is 16. The Length field is a data structure parameter of 'device _ TID', and is an actual value in the process of data downlink transmission, and is a Buffer Length allocated to a service after a response frame is confirmed in the process of data uplink transmission, and CW is a contention window, a minimum value CWmin and a maximum value CWmax defined by a standard. Latency _ tag is a traffic delay parameter. The aSlotTime is an air interface time slot defined by the standard, 9us under an OFDM mechanism, 20us under an HR/DSSS mechanism, the aSIFSTime is a short interval frame defined by the standard, 16us under the OFDM mechanism, and 10us under the HR/DSSS mechanism. In the actual use process, the service delay parameter will be stored in a descriptor generated according to a certain format, and the service delay parameter will be transmitted through the descriptor in the use process. It should be noted that, because the descriptor generator is sensitive to delay, it needs to be generated in the Cache with a faster running speed.
Step 202, determining a scheduling period.
In this embodiment, the method for determining the scheduling period may be to select a maximum requirement min (Latency _ tag 1.. Latency _ tag n) for all TID target delays configured by the user; or directly selecting a Beacon period. When the requirement of the user input delay _ tag is less than 1 Beacon period, the minimum Beacon period can be adopted. When the wireless access point AP is a multi-SSID, the Beacon period is complex, and the minimum Beacon period can still be used.
And 203, acquiring the minimum air interface time Airtime required by each service according to the data structure parameters.
In this embodiment, Airtime is length rate, where rate is the scheduling period theoretical rate value of the standard provided TID.
Step 204, an MSDU queue is constructed according to the service priority.
In this embodiment, data in MSDU frames in an MSDU queue is service data, one service corresponds to one MSDU frame, and each descriptor generated according to a service delay parameter corresponds to one MSDU frame. The MSDU queue is a plurality of queues obtained by classifying all MSDUs, but in the present embodiment, the classification method is not limited, and MSDU frames of the same device may be classified into one class to form one queue, or the same services of different devices may be classified into one class to form one queue. It should be noted that, in this embodiment, the order in which MSDU frames enter the queue to construct the MSDU queue is determined according to the service priority.
Step 205, judging whether the service supports an OFDMA mechanism and/or an MU-MIMO mechanism according to the user type.
In this embodiment, the user type is a type of a protocol or mechanism that can be supported by both devices and the wireless access point AP after negotiation in the basic service set BBS, such as SU, MU-AX/AC, OFDMA, Legacy, TWT, and the like. Therefore, whether the OFDMA mechanism and/or the MU-MIMO mechanism is supported can be directly judged according to the user type.
Step 206, aggregating MSDUs/MPDUs based on traffic.
In this embodiment, for the data transmission process capable of using the OFDMA mechanism and/or the MU-MIMO mechanism, consideration of whether the service belongs to the same user may be weakened, while the delay requirement is preferentially considered, and service data with similar delay requirements are aggregated, so that the requirement of the service with a high delay requirement may be shortened as much as possible in advance, and the user requirement may be better met. Step 207, aggregating MSDUs/MPDUs based on the user.
In this embodiment, since different user types use different mechanisms or different protocol types in the communication process, for example, when the user type is Legacy, service data may not adopt space division multiplexing in the transmission process because a Legacy mechanism requires an exclusive channel. Therefore, aggregation needs to be performed according to the user at this time. In this embodiment, in practice, MSDUs are aggregated to obtain an a-MSDU subframe, then the a-MSDU subframe is aggregated to obtain an a-MSDU, and the a-MSDU subframe is subjected to physical layer processing to obtain an a-MSDU subframe, and then the a-MSDU subframe is aggregated to obtain an MPDU frame.
Specifically, the flow of step 206 or step 207 is shown in fig. 3:
and 301, acquiring the initial token number of the service according to the service delay parameter.
In this embodiment, the initial token number of the service may be according to the expression:
Figure BDA0002718014010000051
token _ tag is the initial Token number of the service, and M is max (Latency _ tag)1,…,Latency_tagn) And i is 1, 2, …, n, and the first addend in the expression represents rounding the parenthetical internal value. In this embodiment, the TID with the minimum delay requirement can be calculated according to the data in the table to obtain 9 tokens, and the TID with the maximum delay requirement can obtain 2 tokens.
Step 302, starting a timer according to the original token number of the service and updating the token number of the service to obtain a count value of the timer.
In this embodiment, when the number of tokens of the service is not 0, one token may be consumed to enable the timer, and the timer may start counting. The MSDU queue is entered when approximately the number of bytes can be transmitted within Airtime.
Step 303, obtaining the transmission opportunity TXOP according to the count value of the timer.
And step 304, aggregating the MSDU according to the TXOP, and acquiring an A-MSDU subframe queue.
Specifically, when the token is present, a timer is started to count the full acquisition enabled MSDU queue into the A-MSDU queue. And ending when the approximate byte number matched by Airtime enters the A-MSDU queue. And subtracting one from the number of tokens of the corresponding service to complete the updating of the number of tokens.
And 305, acquiring an A-MPDU subframe queue according to the A-MSDU subframe queue.
And step 306, aggregating the A-MPDU subframes in the A-MPDU subframe queue according to the number of the tokens, the antenna information and the RU distribution result of the service, and acquiring the MPDU queue.
It should be noted that, in the present embodiment, the MPDU aggregation process needs to take the influence of the channel and RU allocation result into consideration, which is different from the MSDU aggregation process. And the resource unit RU allocation result is an output result of the resource allocator, and comprises the currently available RUs and the current most matched RU allocation scheme, wherein the RU allocator can make different profiles for calling according to the frequency bands, and the released RUs need to refresh the state in the next scheduling period.
Specifically, for example, when TID0 of a certain STA1 is required to delay Latency _ tag to be 5ms, Latency _ max to be 20ms, and TIDs of other STAs to be 50ms or more, the scheduling period 302 at this time is reduced to 5ms, and TID0 of STA1 is preferentially aggregated into an a-MSDU alone, and the minimum Airtime2 is allocated (it may not be aggregated depending on the TID length). For example, STA1 is a HE terminal supporting UL-OFDMA, and at this time, other STA n also mostly supports UL-OFDMA, TID0 of STA1 will be aggregated with other TIDs 1-15 and allocated into a Trigger frame, and at this time, TXOP of the Trigger frame will always preferentially allocate TID0 message of STA 1.
It should be noted that, a service capable of supporting an OFDMA mechanism and/or an MU-MIMO mechanism may share a window, and before an AP obtains an air interface, the AP needs to acquire a TXOP based on an EDCA method, and when the AP has an air interface, the AP may configure EDCAF parameters of an STA to implement a related timing scheduling; traffic that cannot support the OFDMA mechanism and/or the MU-MIMO mechanism requires an exclusive window, and TXOP needs to be acquired based on the EDCA method. Therefore, the steps of aggregating the MSDU to obtain the MPDU are not the same, and the service capable of supporting the OFDMA mechanism and/or the MU-MIMO mechanism does not need to acquire the TXOP through the token to contend for transmission but contend for transmission through the EDCAF parameter in the EDCA mechanism when the AP has an air interface; due to the different behavior of the two on window sharing, the aggregation modes can be different, namely one based on user aggregation and one based on business aggregation.
In step 208, Airtime1 is obtained.
In this embodiment, Airtime1 is an air interface time for a Trigger frame. And (4) comparing and determining the air interface time of the Trigger frame. Since UL-OFDMA random access is possible through the UORA procedure after user association. Therefore, Airtime1 can be roughly estimated according to the number of users, the types of users and the bandwidth applied by the users.
In step 209, Airtime2 is obtained.
In this embodiment, Airtime2 is the air interface time for EDCA frames. Mainly used for devices in the basic service set which can not support OFDMA mechanism and/or MU-MIMO mechanism. These devices will also have TIDs with high latency requirements. It needs to be embodied in the scheduling timing. For TIDs of such devices, the main strategy is to guarantee delay and take bandwidth into account. Airtime2 can be roughly estimated according to the number of users, the types of users and the bandwidth applied by the users. Given that Airtime2 has fewer users and lower bandwidth, it may not be necessary to allocate each scheduling period (reference user delay configuration is required).
And step 210, normalizing the Airtime1 and the Airtime2, acquiring an initial scheduling scheme, adjusting the initial scheduling scheme according to the acquired EDCA parameters, and sending the MPDU.
In the present embodiment, normalization is to convert dimensional Airtime1 and Airtime2 into dimensionless scalar data in order to simplify subsequent calculations. The specific normalization is to represent Airtime1 and Airtime2 by a scheduling period, for example, Airtime1 is 13T, Airtime2 is 15T, that is, Airtime is nT, and T is the scheduling period. Because the initial scheduling period is a software-level ideal scheduling scheme, hardware limitations also need to be considered, and therefore fine tuning is performed according to EDCA parameters.
It should be noted that synchronization is required before MPDU transmission, and one reference synchronization method is to synchronize according to standard pulse per second 1PPS and Beacon frames specified by a precision clock synchronization protocol of a network measurement and control system. Of course, the above is only an example, and in practical cases, any synchronization method capable of achieving synchronization may be used.
In the present embodiment, the adjusted parameter may be a channel quality indicator CQI parameter in consideration of the problem of the error rate, and the like, so as to further improve the accuracy of the transmitted data.
In the actual scheduling process, along with the release of the air interface time of the Legacy user, Airtime acquired by the user supporting the OFDMA and/or MU-MIMO mechanism is refreshed to a larger value. The method comprises the following specific steps:
if one STA1_ TID7 supports OFDMA and/or MU-MIMO users, the other STA does not support OFDMA and/or MU-MIMO users. The scheduling period T is 10 ms. The QOS delay requires STA5_ TID7 to be 10ms at most, STA4_ TID5 delay requires 20ms, STA3_ TID5 delay requires 30ms, and STA2_ TID3 delay requires 40 ms. And obtaining the TXOP through air interface time estimation. All users are assigned a TXOP during the 1 st scheduling period T1 by token issuance. In the 2 nd scheduling period T2, STA2_ TID3 cannot acquire TXOP because the token is exhausted. In the 3 rd scheduling period T3, STA3_ TID5 token is exhausted and cannot acquire TXOP. In the 4 th scheduling period T3, STA4_ TID5 token is exhausted and TXOP cannot be acquired. When all Legacy user tokens are exhausted, the token of each STA _ TID is refreshed to an initial value until a new user joins the schedule.
Compared with the prior art, the second embodiment of the invention aggregates the service data to obtain the MPDU frame on the basis of achieving the beneficial effects brought by the first embodiment, and transmits the data by transmitting the MPDU frame, thereby increasing the effective bandwidth in the transmission process and ensuring the channel bandwidth in the transmission process. And the channel bandwidth is further ensured on the basis of ensuring the delay. In addition, in the whole scheduling process, multiple services of multiple users are scheduled, so that the performance of the multiple users is ensured.
A third embodiment of the present invention relates to a scheduling apparatus, a flow of which is shown in fig. 4, including:
an information obtaining module 401, configured to obtain scheduling information and service data of a service, where the scheduling information includes a service delay requirement, a user type, an EDCA parameter, a beacon interval timeslot, a data structure parameter of the service, antenna information, and a resource unit RU allocation result, and the service delay requirement carries a service priority;
an Airtime obtaining module 402, configured to obtain a service delay parameter and a scheduling period according to the service delay requirement, and obtain an Airtime of a service according to a data structure parameter of the service;
the scheduling module 403 is configured to obtain an MPDU queue of an MAC protocol data unit according to the service data, obtain an initial scheduling scheme according to the scheduling period, the Airtime, the user type number, and the MPDU queue, adjust the initial scheduling scheme according to the EDCA parameter, and send the service data according to the adjusted scheduling scheme.
The specific implementation method of the technical solution provided in this embodiment may be referred to the information processing method provided in the first and second embodiments, and is not described herein again.
A fourth embodiment of the present invention relates to an electronic apparatus, as shown in fig. 5, including:
at least one processor 501; and the number of the first and second groups,
a memory 502 communicatively coupled to the at least one processor 501; wherein the content of the first and second substances,
the memory 502 stores instructions executable by the at least one processor 501 to enable the at least one processor 501 to perform the scheduling method according to the first and second embodiments of the present invention.
Where the memory and processor are connected by a bus, the bus may comprise any number of interconnected buses and bridges, the buses connecting together one or more of the various circuits of the processor and the memory. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor is transmitted over a wireless medium via an antenna, which further receives the data and transmits the data to the processor.
The processor is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And the memory may be used to store data used by the processor in performing operations. It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.

Claims (10)

1. A scheduling method applied to a wireless local area network includes:
acquiring scheduling information and service data of a service, wherein the scheduling information comprises a service delay requirement, a user type, an EDCA parameter and a data structure parameter of the service;
acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement;
acquiring the air interface time Airtime with the minimum service according to the data structure parameters of the service;
acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority;
acquiring an initial scheduling scheme according to the scheduling period, the Airtime, the user type and the MPDU queue;
and adjusting the initial scheduling scheme according to the EDCA parameters, and sending the service data according to the adjusted scheduling scheme.
2. The method of claim 1, wherein obtaining the scheduling period comprises:
acquiring a beacon interval time slot Bacon parameter;
taking the Bacon parameter as the scheduling period; alternatively, the first and second electrodes may be,
and taking the minimum value in the delay parameters as the scheduling period.
3. The method according to claim 1, wherein the obtaining an Airtime of the service according to the data structure parameter of the service comprises:
acquiring the rate of a service scheduling period;
and acquiring the Airtime according to the service scheduling period and the structural parameters of the service.
4. The method of claim 1, wherein said obtaining an initial scheduling scheme based on said scheduling period, said Airtime, said user type, and said MPDU queue comprises:
judging whether the service supports an OFDMA mechanism and/or an MU-MIMO mechanism or not according to the user type;
when the service supports the OFDMA mechanism and/or the MU-MIMO mechanism, the Airtime of the service is a first class Airtime;
when the service does not support the OFDMA mechanism and does not support the MU-MIMO mechanism, the Airtime of the service is a second type Airtime;
respectively summing the first Airtime type and the second Airtime type to obtain Airtime1 and Airtime 2;
normalizing said Airtime1 and said Airtime2 according to said scheduling period;
and acquiring the initial scheduling scheme according to the normalized Airtime1, the normalized Airtime2 and the MPDU queue.
5. The method of claim 1, wherein the obtaining the MAC protocol data unit MPDU queue corresponding to the service data according to the service delay priority comprises:
acquiring an MAC Service Data Unit (MSDU) according to the service data;
acquiring an MSDU queue according to the service delay priority and the MSDU;
acquiring the initial token number of the service according to the service delay parameter;
determining an aggregation mode according to the user type;
acquiring antenna information and an RU resource allocation result;
and aggregating the MSDU queue according to the aggregation mode according to the initial token number of the service, the antenna information and the RU distribution result to obtain the MPDU queue.
6. The method of claim 5, wherein the aggregating the MSDU in the aggregation manner according to the initial token number of the service, the antenna information, and the resource unit allocation result to obtain the MPDU queue comprises:
starting a timer according to the original token number of the service and updating the token number of the service to obtain a count value of the timer;
acquiring a sending opportunity TXOP according to the count value of the timer;
aggregating the MSDU queue according to the TXOP and the user type to obtain an A-MSDU subframe queue;
acquiring an A-MPDU subframe queue according to the A-MSDU subframe queue;
and aggregating the A-MPDU subframes in the A-MPDU subframe queue according to the number of the tokens of the service, the antenna information and the RU distribution result, and acquiring the MPDU queue.
7. The method of claim 1, further comprising:
acquiring a Channel Quality Indicator (CQI) parameter;
and adjusting the initial scheduling scheme according to the CQI parameter.
8. The method of claim 1, wherein before the transmitting data according to the adjusted scheduling scheme, the method comprises:
and synchronizing according to the standard pulse per second 1PPS and the Beacon frame specified by a precise clock synchronization protocol of the network measurement and control system.
9. A scheduling apparatus, comprising:
the information acquisition module is used for acquiring scheduling information and service data of a service, wherein the scheduling information comprises a service delay requirement, a user type, an EDCA parameter and a data structure parameter of the service;
the Airtime acquiring module is used for acquiring a service delay parameter, a scheduling period and a service priority according to the service delay requirement and acquiring an Airtime of a service according to a data structure parameter of the service;
and the scheduling module is used for acquiring an MAC Protocol Data Unit (MPDU) queue corresponding to the service data according to the service priority, acquiring an initial scheduling scheme according to the scheduling period, the Airtime, the user type and the MPDU queue, adjusting the initial scheduling scheme according to the EDCA parameter, and transmitting the service data according to the adjusted scheduling scheme.
10. An electronic device, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the scheduling method of any one of claims 1 to 8.
CN202011079583.3A 2020-10-10 2020-10-10 Scheduling method, scheduling device and electronic equipment Pending CN114338558A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202011079583.3A CN114338558A (en) 2020-10-10 2020-10-10 Scheduling method, scheduling device and electronic equipment
PCT/CN2021/122872 WO2022073512A1 (en) 2020-10-10 2021-10-09 Scheduling method and apparatus, and electronic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011079583.3A CN114338558A (en) 2020-10-10 2020-10-10 Scheduling method, scheduling device and electronic equipment

Publications (1)

Publication Number Publication Date
CN114338558A true CN114338558A (en) 2022-04-12

Family

ID=81032717

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011079583.3A Pending CN114338558A (en) 2020-10-10 2020-10-10 Scheduling method, scheduling device and electronic equipment

Country Status (2)

Country Link
CN (1) CN114338558A (en)
WO (1) WO2022073512A1 (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102665280A (en) * 2012-05-08 2012-09-12 杭州华三通信技术有限公司 Processing method of client hiding situation and wireless AP (access point)
CN113811014A (en) * 2015-09-30 2021-12-17 中兴通讯股份有限公司 Access method and device of wireless network
US10159009B2 (en) * 2016-10-12 2018-12-18 Qualcomm Incorporated Method and apparatus for adaptation of EDCA parameters to ensure access by a wireless node
GB2555455B (en) * 2016-10-28 2020-02-26 Canon Kk QoS management for multi-user EDCA transmission mode in 802.11ax networks
GB2560787B (en) * 2017-01-06 2019-06-26 Canon Kk Qos management for multi-user and single user EDCA transmission mode in wireless networks

Also Published As

Publication number Publication date
WO2022073512A1 (en) 2022-04-14

Similar Documents

Publication Publication Date Title
US10841924B2 (en) Basic bandwidth device on secondary channel
KR101711464B1 (en) System and methods for differentiated association service provisioning in wifi networks
CN105376861B (en) Method, system and access point for transmitting occupied unauthorized carrier
US10045374B2 (en) Low latency WLAN medium access
EP1615395A1 (en) Contention-free access point controlled sequential access in WLAN 802.11e
US20200205105A1 (en) Systems and Methods for Operation of Wireless User Devices with Cellular and Wi-Fi Interfaces
CN111050328A (en) Method and apparatus for performing coordinated transmission performed by a coordinated access point in a wireless local area network
JP2013502886A (en) Deterministic backoff channel access
EP4145938A1 (en) Multi-link communication method and related apparatus
EP3091782B1 (en) Efficient ofdma resource utilization by multiple access categories allowance
US11683732B2 (en) Transmission opportunity control method and apparatus
US20230413176A1 (en) Declaration of low latency reliable service in a bss
CN109076506A (en) A kind of resource regulating method, access network equipment and user equipment
US20240032089A1 (en) Communication apparatus and communication method for prioritized traffic
JP6573724B2 (en) System and method for indicating periodic assignments
US10674538B2 (en) Method and device for competitive transmission
CN114338558A (en) Scheduling method, scheduling device and electronic equipment
US20230128915A1 (en) Multi-link flexible wake time scheduling
US20240015711A1 (en) Communication method, terminal apparatus, and system
WO2022199691A1 (en) Wi-fi based fixed wireless access protocol
EP3562219B1 (en) Channel contention method and wur station
CN116170851A (en) Data transmission control method and device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination