CN110730141B - Aggregation scheduling method, sending end and computer readable storage medium - Google Patents

Aggregation scheduling method, sending end and computer readable storage medium Download PDF

Info

Publication number
CN110730141B
CN110730141B CN201910924316.2A CN201910924316A CN110730141B CN 110730141 B CN110730141 B CN 110730141B CN 201910924316 A CN201910924316 A CN 201910924316A CN 110730141 B CN110730141 B CN 110730141B
Authority
CN
China
Prior art keywords
frame
mpdu
data
aggregation
sending end
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.)
Active
Application number
CN201910924316.2A
Other languages
Chinese (zh)
Other versions
CN110730141A (en
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.)
Zhejiang Kerui Microelectronics Technology Co ltd
Original Assignee
Zhejiang Kerui Microelectronics Technology Co ltd
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 Zhejiang Kerui Microelectronics Technology Co ltd filed Critical Zhejiang Kerui Microelectronics Technology Co ltd
Priority to CN201910924316.2A priority Critical patent/CN110730141B/en
Publication of CN110730141A publication Critical patent/CN110730141A/en
Application granted granted Critical
Publication of CN110730141B publication Critical patent/CN110730141B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1816—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of the same, encoded, message
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6245—Modifications to standard FIFO or LIFO
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/827—Aggregation of resource allocation or reservation requests

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a polymerization scheduling method, which is applied to a sending end and comprises the following steps: after the sending end sends the last frame of A-MPDU aggregated data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregated data into a hardware queue in advance; and when the sending end receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregation data, the sending end sends the next frame of A-MPDU aggregation data, wherein the Block ACK is from a receiving end. The invention can reduce the frame interval between A-MPDU transmission, improve the channel utilization rate and improve the system throughput rate. Meanwhile, the invention also discloses a sending end and a computer readable storage medium.

Description

Aggregation scheduling method, sending end and computer readable storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method for aggregation scheduling, a sending end, and a computer-readable storage medium.
Background
Currently, most portable WLAN (Wireless Local Area Network) devices use Wi-Fi (Wireless fidelity) chips of SDIO (Secure Digital Input and Output), USB (Universal Serial Bus), or SPI (Serial Peripheral Interface) interfaces.
However, since the clock frequency of the interface is low and the CMD (Command prompt) interaction time of the transmission and reception process is long, there is a great delay in the data frame transmission and reception of the wireless WLAN. In addition, the CPU processing performance of the current embedded WLAN chip is generally low, and the redundant time for transmitting and receiving data frames is also increased. However, almost no WLAN chip (e.g. Realtek8192cu, broadcom 4330) in commercial use currently optimizes for the delay additionally introduced by the interface and the processor, which results in a great reduction in the channel utilization rate when the physical layer rate is increased, and seriously affects the system throughput rate.
Disclosure of Invention
The embodiments of the present application provide an aggregation scheduling method, a transmitting end, and a computer-readable storage medium, which solve the technical problems of low channel utilization rate and system throughput loss of a portable WLAN device in the prior art, and achieve the technical effects of reducing frame intervals between a-MPDUs transmission, improving channel utilization rate, and improving system throughput.
In a first aspect, the present application provides the following technical solutions through an embodiment of the present application:
an aggregation scheduling method is applied to a sending end and comprises the following steps:
after the transmitting end finishes transmitting the last frame of A-MPDU aggregation data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregation data in a hardware queue in advance;
and when the sending end receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregation data, the sending end sends the next frame of A-MPDU aggregation data, wherein the Block ACK is from a receiving end.
Preferably, before the bottom medium access control layer LMAC stores the next frame of a-MPDU aggregation data in the hardware queue in advance, the method further includes:
after an upper medium access control layer UMAC receives a plurality of data subframes to be sent by a network layer, the UMAC packages the data subframes to be sent to obtain the next frame of A-MPDU aggregation data.
Preferably, the layer media access control layer LMAC stores the next frame a-MPDU aggregation data in advance in a hardware queue, including:
the LMAC stores the next frame of A-MPDU aggregation data in a Random Access Memory (RAM) through a designated interface;
and the LMAC carries the next frame of A-MPDU aggregation data from the RAM to a first-in first-out register.
Preferably, the LMAC moves the next frame of a-MPDU aggregation data from the RAM to a first-in first-out register, including:
and the LMAC completes Direct Memory Access (DMA) configuration and carries the next frame of A-MPDU aggregation data from the RAM to the first-in first-out register through the DMA.
Preferably, the transmitting end transmitting the next frame a-MPDU aggregation data includes:
and when the sender receives the Block ACK, the LMAC accesses a channel and sends the next frame of A-MPDU aggregation data to the receiver through the channel.
Preferably, after the sender receives a block ack corresponding to the a-MPDU aggregated data of the previous frame, the method further includes:
the LMAC carries the Block ACK to the RAM and sends a notification message to the UMAC, wherein the notification message is used for notifying the UMAC to acquire the Block ACK;
after the UMAC acquires the Block ACK, the UMAC judges whether a data frame needs to be retransmitted or not according to a Bitmap sub-field in the Block ACK;
and if so, the sending end acquires a retransmission frame, wherein the retransmission frame is a lost data frame in the last frame of A-MPDU aggregated data, and the sending end sends the retransmission frame to the receiving end.
Preferably, the sending end sends the retransmission frame to the receiving end, including:
the sending end judges whether the number of the aggregation packets is less than or equal to a specific numerical value, wherein the specific numerical value is one half of the size of a reordering window, and the number of the aggregation packets is the number of data subframes contained in a frame of A-MPDU aggregation data;
if so, the sending end sends the retransmission frame to the receiving end based on the reordering window;
if not, the sending end adds a specific frame at the end of the retransmission frame, and sends the retransmission frame to the receiving end based on the reordering window, wherein the specific frame is used for adjusting the starting position of the reordering window.
Based on the same inventive concept, in a second aspect, the present application provides the following technical solutions through an embodiment of the present application:
a transmitting end, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor, when executing the program, may implement the method steps of any of the embodiments of the first aspect.
Based on the same inventive concept, in a third aspect, the present application provides the following technical solutions through an embodiment of the present application:
a computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, is adapted to carry out the method steps of any of the embodiments of the first aspect.
One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages:
in the embodiment of the application, an aggregation scheduling method is disclosed, which is applied to a sending end and comprises the following steps: after the sending end sends the last frame of A-MPDU aggregated data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregated data into a hardware queue in advance; and when the sender receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregated data, the sender sends the next frame of A-MPDU aggregated data, wherein the Block ACK is from a receiver. The LMAC stores the next frame of A-MPDU aggregation data into the hardware queue in advance before the sender receives the Block ACK, so that the sender can immediately send the next frame of A-MPDU aggregation data when the sender receives the Block ACK, thus the frame interval between the sending of the A-MPDU is reduced, the channel utilization rate is improved, and the system throughput rate is improved, and the technical problems of low channel utilization rate and system throughput rate loss of the portable WLAN equipment in the prior art are solved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on the drawings without creative efforts.
Fig. 1 is a flowchart of an aggregation scheduling method in an embodiment of the present application;
fig. 2 is a timing diagram of an aggregation scheduling method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a transmitting end in an embodiment of the present application;
fig. 4 is a schematic structural diagram of a computer-readable storage medium in an embodiment of the present application.
Detailed Description
The embodiments of the present application provide an aggregation scheduling method, a sending end, and a computer-readable storage medium, which solve the technical problems of low channel utilization rate and system throughput loss of a portable WLAN device in the prior art, and achieve the technical effects of reducing frame intervals between a-MPDU transmissions, improving channel utilization rate, and improving system throughput.
In order to solve the technical problems, the general idea of the embodiment of the application is as follows:
an aggregation scheduling method is applied to a sending end and comprises the following steps: after the sending end sends the last frame of A-MPDU aggregated data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregated data into a hardware queue in advance; and when the sender receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregated data, the sender sends the next frame of A-MPDU aggregated data, wherein the Block ACK is from a receiver. The LMAC stores the next frame of A-MPDU aggregation data into the hardware queue in advance before the sender receives the Block ACK, so that the sender can immediately send the next frame of A-MPDU aggregation data when the sender receives the Block ACK, thus the frame interval between the sending of the A-MPDU is reduced, the channel utilization rate is improved, and the system throughput rate is improved, and the technical problems of low channel utilization rate and system throughput rate loss of the portable WLAN equipment in the prior art are solved.
In order to better understand the technical solution, the technical solution will be described in detail with reference to the drawings and the specific embodiments.
First, it is stated that the term "and/or" appearing herein is merely one type of associative relationship that describes an associated object, meaning that three types of relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter associated objects are in an "or" relationship.
Example one
As shown in fig. 1, this embodiment provides an aggregation scheduling method, which is applied to a sending end, and the method includes:
step S101: after the transmitting end sends the last frame of A-MPDU aggregation data, the LMAC stores the next frame of A-MPDU aggregation data in a hardware queue in advance.
In a specific implementation process, the sending end refers to a device for sending a-MPDU aggregated data, for example, a smart phone, a tablet computer, a smart watch, a vehicle-mounted computer, and other portable WLAN devices. Here, as to what kind of device the sending end is specifically, the embodiment is not specifically limited.
Correspondingly, the receiving end refers to a device for receiving a-MPDU aggregated data, for example, a smart phone, a tablet computer, a smart watch, a vehicle-mounted computer, and other WLAN devices, and the specific type of the receiving end is not specifically limited in this embodiment.
In the specific implementation process, the system architecture of the sending end at least includes, from top to bottom: a network layer (IP layer), a MAC layer, and a physical layer (physical layer). As shown in fig. 2, the MAC layer is further divided into a UMAC (upper Media Access Control) layer and a LMAC (Lower Media Access Control) layer.
As shown in fig. 2, the "upper MAC" refers to the UMAC, the "lower MAC" refers to the LMAC, the "current aggregation frame" refers to the previous frame of a-MPDU aggregation data, and the "next aggregation frame" refers to the next frame of a-MPDU aggregation data.
In a specific implementation process, the hardware queue refers to a hardware queue corresponding to an LMAC layer, and the hardware queue belongs to the LMAC layer.
A-MPDU (media access control protocol data unit aggregation) is an aggregation algorithm introduced in 802.11n/ac/ad and is used for improving the utilization rate of a MAC layer.
In the specific implementation process, the a-MPDU aggregated data of the previous frame and the a-MPDU aggregated data of the next frame are relative, specifically, two frames of a-MPDU aggregated data with adjacent transmission timings are used. Here, the "previous frame" may also be referred to as a "previous frame", and the "next frame" may also be referred to as a "next frame".
As an optional embodiment, before the LMAC stores the next frame a-MPDU aggregation data in the hardware queue in advance, the method further includes:
after the UMAC receives a plurality of data subframes to be sent issued by the IP layer, the UMAC packages the data subframes to be sent to obtain the next frame of A-MPDU aggregated data.
In the specific implementation process, the IP layer is configured to issue data subframes to be sent (i.e., data packets to be sent) to the UMAC layer, and the UMAC layer may aggregate the data subframes based on an a-MPDU aggregation algorithm and then encapsulate the aggregated data to obtain a next frame of a-MPDU aggregated data.
For example, as shown in fig. 2, the a-MPDU aggregated data of the previous frame is a data block consisting of three sub-frames with sequence numbers 0, 1 and 2, and the a-MPDU aggregated data of the next frame is a data block consisting of three sub-frames with sequence numbers 3, 4 and 5. After the sending end puts the previous frame of A-MPDU aggregation data into a channel, after a period of CMD interaction delay, when the blockACK replied by the receiving end is not received, the next frame of A-MPDU aggregation data is immediately pre-stored into a hardware queue of the LMAC.
Specifically, the LMAC stores the next frame of a-MPDU aggregation data in advance in a hardware queue, and includes:
the LMAC stores the next frame of a-MPDU aggregated data in a RAM (Random Access Memory) through a designated interface (i.e., an interface between the LMAC layer and the UMAC layer), and then the LMAC transfers the next frame of a-MPDU aggregated data from the RAM to a FiFo (First in First out, first in First out register) of the LMAC.
In a specific implementation process, when the LMAC transports the next frame a-MPDU aggregated data from the RAM to the FiFo, the LMAC may complete configuration of DMA (Direct Memory Access) through the CPU, and then transport the next frame a-MPDU aggregated data from the RAM to the FiFo through the DMA.
Step S102: and when the transmitting end receives Block ACK corresponding to the previous frame of A-MPDU aggregation data, the transmitting end transmits the next frame of A-MPDU aggregation data. Wherein, the blockACK comes from the receiving end.
In a specific implementation process, after the receiving end receives the previous frame of a-MPDU aggregated data, a BlockACK (block acknowledgement Character) is replied immediately after a Short Inter Frame Space (SIFS) period, where the BlockACK is used to confirm the receiving condition of each subframe in the previous frame of a-MPDU aggregated data. The BlockACK comprises two sub-fields, a BlockACK information sub-field and a Bitmap sub-field. The Bitmap subdomain has 64 bits in total, and the Bitmap subdomain can be used for identifying the receiving condition of 64 subframes. If the nth bit of the Bitmap subfield is set to 1, it represents that the subframe with the sequence number of BlockACK initial sequence number + n is correctly received. On the contrary, if the nth bit is set to 0, the subframe with the sequence number of BlockACK initial sequence number + n is lost in transmission, and retransmission is needed.
When non-aggregated ordinary data frame transmission is carried out, the subframe lost by a sending end is directly retransmitted by hardware. However, for the embedded WLAN chip with limited resources, all subframes of the aggregated data cannot be saved in the RAM, and therefore, the retransmission of the aggregated data can only be performed in the UMAC layer.
In the specific implementation process, when the sender receives a BlockACK corresponding to the a-MPDU aggregated data of the previous frame, the sender immediately sends the a-MPDU aggregated data of the next frame.
In the embodiment of the application, before the sending end receives the blockACK corresponding to the previous frame of A-MPDU aggregation data, the LMAC stores the next frame of A-MPDU aggregation data into the hardware queue in advance, so that the sending end can immediately send the next frame of A-MPDU aggregation data when receiving the blockACK, hardware delay is reduced, and system throughput rate is improved.
The invention is suitable for the mobile WLAN equipment with poor CPU performance and long interface delay, the throughput rate is greatly improved compared with the traditional scheduling method, and the throughput rate is obviously improved under different aggregation lengths and aggregation packet numbers.
As an optional embodiment, the transmitting end transmits next frame a-MPDU aggregated data, including:
and when the transmitting end receives Block ACK, the LMAC accesses the channel and transmits the next frame of A-MPDU aggregated data to the receiving end through the channel.
As an optional embodiment, after the sender receives a block ack corresponding to the aggregated data of the previous frame of a-MPDU, the method further includes:
the LMAC transports the BlockACK to the RAM and sends a notification message to the UMAC, wherein the notification message is used for notifying the UMAC to acquire the BlockACK; after the UMAC acquires the blockACK, the UMAC judges whether a data frame needs to be retransmitted or not according to a Bitmap sub-field in the blockACK (namely, whether frame loss occurs in the previous frame of A-MPDU aggregated data or not is judged); if the retransmission frame is needed (i.e., a frame loss occurs), the transmitting end acquires the retransmission frame, wherein the retransmission frame is a lost data frame in the last frame of the a-MPDU aggregated data, and transmits the retransmission frame (i.e., "retransmission aggregated frame" in fig. 2) to the receiving end.
As an optional embodiment, the sending end sends the retransmission frame to the receiving end, including:
the sending end judges whether the number of the aggregation packets is less than or equal to a specific value, wherein the specific value is the size of a reordering window WinSize B Wherein the number of aggregation packets refers to the number of data subframes contained in a frame of a-MPDU aggregated data; if yes, the sending end sends the retransmission frame to the receiving end based on the reordering window (namely: the reordering buffer area); if not, the sending end adds a specific frame at the end of the retransmission frame, and sends the retransmission frame to the receiving end based on the reordering window, wherein the specific frame is used for adjusting the initial position of the reordering window.
In the specific implementation process, after the receiving end receives the next frame A-MPDU aggregation data, the SN (sequence number) of the current aggregation frame is judged, and if the sequence number exceeds the reordering window WinStart B ,WinEnd B ]Will result in window sliding, winStart B And (4) increasing. When the block ack of the previous frame of aggregated data is not received, the UMAC sends the next frame of a-MPDU aggregated data first, so that the SN of the retransmission of the previous frame may be smaller than WinStart B Packet loss occurs, so that the following operation is requiredThe following steps are carried out:
aggregation of packet numbers A at the transmitting end l ≤WinSize B In time 2, even if the data frame in the last transmission is lost, the SN of the pre-stored next frame A-MPDU aggregation data does not exceed WinEnd B Therefore, the Bitmap subdomain in the Block ACK can still normally identify the subframe state in current transmission, and the sending end can directly send the retransmission frame to the receiving end.
And at A l >WinSize B At time/2, the SN of the pre-stored next frame a-MPDU aggregate data may exceed the window range, resulting in window sliding. Therefore, if a packet is lost during the transmission of the aggregated data of the previous frame of a-MPDU, a specific frame (e.g., a BlockACK Request frame) needs to be added at the end of the retransmission frame to adjust WinStart B Position of (1), winStart B Is moved forward. Thus, window slippage can be avoided.
Here, during retransmission, different ways are adopted for sending different aggregation packet numbers, so that protocol compatibility is ensured.
The technical scheme in the embodiment of the application at least has the following technical effects or advantages:
in the embodiment of the present application, a method for aggregate scheduling is disclosed, which is applied to a sending end, and includes: after the transmitting end finishes transmitting the last frame of A-MPDU aggregation data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregation data in a hardware queue in advance; and when the sender receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregated data, the sender sends the next frame of A-MPDU aggregated data, wherein the Block ACK is from a receiver. The LMAC stores the next frame of A-MPDU aggregation data into the hardware queue in advance before the sender receives the Block ACK, so that the sender can immediately send the next frame of A-MPDU aggregation data when the sender receives the Block ACK, thus the frame interval between the sending of the A-MPDU is reduced, the channel utilization rate is improved, and the system throughput rate is improved, and the technical problems of low channel utilization rate and system throughput rate loss of the portable WLAN equipment in the prior art are solved.
Example two
Based on the same inventive concept, as shown in fig. 3, this embodiment provides a transmitting end 300, which includes a memory 310, a processor 320, and a computer program 311 stored in the memory 310 and running on the processor 320, where the processor 320 executes the program 311 to implement the following method steps:
after the sending end sends the last frame of A-MPDU aggregated data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregated data into a hardware queue in advance; and when the sending end receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregation data, the sending end sends the next frame of A-MPDU aggregation data, wherein the Block ACK is from a receiving end.
In a specific implementation process, when the processor 320 executes the program 311, any manner steps in the first embodiment may also be implemented.
EXAMPLE III
Based on the same inventive concept, as shown in fig. 4, the present embodiment provides a computer-readable storage medium 400, on which a computer program 411 is stored, the computer program 411 implementing the following steps when being executed by a processor:
after the sending end sends the last frame of A-MPDU aggregated data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregated data into a hardware queue in advance; and when the sender receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregated data, the sender sends the next frame of A-MPDU aggregated data, wherein the Block ACK is from a receiver.
In a specific implementation, the computer program 411 may implement any method step in the first embodiment described above when executed by a processor.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (7)

1. An aggregation scheduling method applied to a transmitting end is characterized by comprising the following steps:
after the sending end sends the last frame of A-MPDU aggregation data, the bottom medium access control layer LMAC stores the next frame of A-MPDU aggregation data in a hardware queue in advance, and the method comprises the following steps:
the LMAC stores the next frame A-MPDU aggregation data in a Random Access Memory (RAM) through a designated interface;
the LMAC carries the next frame of A-MPDU aggregation data from the RAM to a first-in first-out register, and the method comprises the following steps: the LMAC completes direct memory access DMA configuration, and the next frame of A-MPDU aggregation data is carried to the first-in first-out register from the RAM through the DMA;
and after the sending end receives a block acknowledgement character (Block ACK) corresponding to the previous frame of A-MPDU aggregation data, the sending end sends the next frame of A-MPDU aggregation data, wherein the Block ACK is from a receiving end.
2. The aggregation scheduling method of claim 1, wherein the underlying medium access control layer LMAC further comprises, before storing the next frame a-MPDU aggregation data in advance in a hardware queue:
after an upper medium access control layer UMAC receives a plurality of data subframes to be sent by a network layer, the UMAC packages the data subframes to be sent to obtain the next frame of A-MPDU aggregation data.
3. The aggregate scheduling method of claim 2, wherein the transmitting end transmitting the next frame of a-MPDU aggregate data comprises:
and when the sender receives the Block ACK, the LMAC accesses a channel and sends the next frame of A-MPDU aggregation data to the receiver through the channel.
4. The aggregation scheduling method of claim 3, wherein after the sender receives a block ack corresponding to the A-MPDU aggregated data of the previous frame, further comprising:
the LMAC carries the Block ACK to the RAM and sends a notification message to the UMAC, wherein the notification message is used for notifying the UMAC to acquire the Block ACK;
after the UMAC acquires the Block ACK, the UMAC judges whether a data frame needs to be retransmitted or not according to a Bitmap sub-field in the Block ACK;
and if so, the sending end acquires a retransmission frame, wherein the retransmission frame is a lost data frame in the last frame of A-MPDU aggregated data, and the sending end sends the retransmission frame to the receiving end.
5. The aggregation scheduling method of claim 4, wherein the transmitting end transmitting the retransmission frame to the receiving end comprises:
the sending end judges whether the number of the aggregation packets is less than or equal to a specific numerical value, wherein the specific numerical value is one half of the size of a reordering window, and the number of the aggregation packets is the number of data subframes contained in a frame of A-MPDU aggregation data;
if so, the sending end sends the retransmission frame to the receiving end based on the reordering window;
if not, the sending end adds a specific frame at the end of the retransmission frame, and sends the retransmission frame to the receiving end based on the reordering window, wherein the specific frame is used for adjusting the starting position of the reordering window.
6. A transmitting end comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the program, is adapted to carry out the method steps of any of claims 1 to 5.
7. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, is adapted to carry out the method steps of any of claims 1 to 5.
CN201910924316.2A 2019-09-27 2019-09-27 Aggregation scheduling method, sending end and computer readable storage medium Active CN110730141B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910924316.2A CN110730141B (en) 2019-09-27 2019-09-27 Aggregation scheduling method, sending end and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910924316.2A CN110730141B (en) 2019-09-27 2019-09-27 Aggregation scheduling method, sending end and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN110730141A CN110730141A (en) 2020-01-24
CN110730141B true CN110730141B (en) 2023-03-28

Family

ID=69218477

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910924316.2A Active CN110730141B (en) 2019-09-27 2019-09-27 Aggregation scheduling method, sending end and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN110730141B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115314161A (en) * 2022-08-05 2022-11-08 北京天融信网络安全技术有限公司 Message processing method and device, electronic equipment and storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7817593B2 (en) * 2006-03-31 2010-10-19 Intel Corporation Method for aggregation of a number of media access control (MAC) frames into a single phyical layer frame in a distributed MAC layer
CN101657029B (en) * 2009-09-15 2011-12-07 杭州华三通信技术有限公司 Method and terminal for sending terminal polymerization media access control protocol data unit frames
CN105471549B (en) * 2015-11-17 2018-09-11 西安电子科技大学 Block based on the control of A-MPDU subframe position information confirms system and method

Also Published As

Publication number Publication date
CN110730141A (en) 2020-01-24

Similar Documents

Publication Publication Date Title
CN113498218B (en) Synchronous multilink radio transmission opportunity procedure
US12052729B2 (en) Transmission pre-emption
US8274992B2 (en) Communication method for wireless lans
US7489629B2 (en) Methods and media access controller for broadband wireless communications with variable data unit size and delayed data unit construction
US20100315999A1 (en) Use of block acknowledgement policy for wireless networks
CN107005560A (en) A kind of data transmission method for uplink, data receiver method and relevant device
US20210144589A1 (en) Apparatus and methods for eht multi-band a-msdu operation
CN109996261B (en) Data transmission method and device based on MAC layer data packet replication
CN108847919B (en) Data transmission method, base station and wireless communication equipment
CN110100494B (en) Data transmission method and equipment
WO2014176889A1 (en) Data transmission method, device and system
CN110730141B (en) Aggregation scheduling method, sending end and computer readable storage medium
US20130250837A1 (en) Wireless communication method and wireless communication system
CN108401291A (en) The method and apparatus of data transmission
WO2019095971A1 (en) Communication method and device
CN110636546A (en) Method and system for transmitting data frame of wireless local area network
WO2021035450A1 (en) Data transmission method and communication device
US10440736B2 (en) System and method for increased throughput using queue size based intelligent proportion calculation reverse direction grants
US10582533B2 (en) System and method for increased throughput using queue size based intelligent reverse direction grants
CN111601343A (en) Frame aggregation method, terminal device and computer storage medium
US20230133896A1 (en) Data Transmission Method, Primary Apparatus, Wireless Network Communication Technology Chip
CN114079544B (en) RLC data retransmission method and device
WO2023246745A1 (en) Communication method and apparatus
WO2023231910A1 (en) Feedback information sending method, feedback information receiving method, terminal, and storage medium
WO2016041337A1 (en) Method and device for sending pending block, and computer readable 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
TA01 Transfer of patent application right

Effective date of registration: 20220513

Address after: 310051 Room 502, 5 / F, building 9, No. 19, Jugong Road, Xixing street, Binjiang District, Hangzhou, Zhejiang Province

Applicant after: Zhejiang Kerui Microelectronics Technology Co.,Ltd.

Address before: Room 210-045, 2 / F, building 003, 750 Chuangyuan Road, high tech Zone, Ningbo, Zhejiang 315000

Applicant before: Zhongke Rui micro (Ningbo) Electronic Technology Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant