CN111601343B - Frame aggregation method, terminal device and computer storage medium - Google Patents
Frame aggregation method, terminal device and computer storage medium Download PDFInfo
- Publication number
- CN111601343B CN111601343B CN202010242584.9A CN202010242584A CN111601343B CN 111601343 B CN111601343 B CN 111601343B CN 202010242584 A CN202010242584 A CN 202010242584A CN 111601343 B CN111601343 B CN 111601343B
- Authority
- CN
- China
- Prior art keywords
- msdu
- analog
- length
- calculated
- time
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
-
- 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0079—Formats for control data
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
When judging that MSDUs meeting the A-MSDU aggregation conditions exist in a buffer queue of a transmitter, selecting proper MSDUs for aggregation by calculating and comparing expected transmission efficiency corresponding to analog A-MSDUs which are added with each MSDU in sequence, thereby realizing dynamic adjustment of the aggregation length of the A-MSDUs according to the network state, optimizing the transmission efficiency of the target A-MSDUs obtained by aggregation, and adjusting the aggregation time of the A-MSDUs according to the current QoS service class, thereby meeting the time delay requirement of the corresponding service class.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a frame aggregation method, a terminal device, and a computer storage medium.
Background
The IEEE 802.11n protocol starts and, in order to improve the medium access control (Medium Access Control, MAC) layer efficiency and throughput, aggregate MAC service data unit (Aggregate-MAC service data unit, a-MSDU) and Aggregate MAC protocol data unit (a-MPDU) techniques are introduced. The a-MSDU aggregation technique is a technique of receiving a plurality of MSDUs (MAC Service Data Unit, MAC service data units) from an LLC (Logical Link Control) layer at a MAC layer, and aggregating the received plurality of MSDUs having the same Receiver Address (RA), sender Address (TA), and service type into one large payload. The aggregated packets have only one common MAC frame header. When a plurality of frames are aggregated together, the load of the packet header, the propagation time and the acknowledgement packet are reduced, thereby improving the wireless transmission efficiency.
Currently, the length of an a-MSDU aggregation process is generally limited during transmission only according to the maximum aggregate packet length of the a-MSDU specified in the protocol. However, the inventor finds that, in the process of implementing the present invention, because the network environment is complex and changeable, the length in the process of aggregating the a-MSDUs is limited only according to the maximum aggregate packet length of the a-MSDUs specified in the protocol, and the change of the network environment cannot be well adapted, so that the transmission efficiency is affected to some extent, and the aggregate time of the a-MSDUs of different QoS Traffic Classes (TCs) is not specified by the protocol, while too short aggregate time affects the throughput of the system and too long aggregate time affects the user experience.
Disclosure of Invention
The embodiment of the invention provides a frame aggregation method, terminal equipment and a computer storage medium, which can select proper MSDUs for aggregation, thereby realizing dynamic adjustment of the aggregation length of A-MSDUs according to network states, optimizing the transmission efficiency of target A-MSDUs obtained by aggregation, and adjusting the aggregation time of A-MSDUs according to the current QoS service class, so as to meet the time delay requirement of the corresponding service class.
In order to achieve the above object, an embodiment of the present invention provides a frame aggregation method, including:
s11, judging whether an MSDU which meets the A-MSDU aggregation condition and is not selected exists in a buffer queue of the transmitter, if so, jumping to the step S12, and if not, jumping to the step S16;
s12, according to the MSDU ordering in the buffer queue, taking the first MSDU in all MSDUs which meet the A-MSDU aggregation condition and are not selected in the buffer queue as the currently selected MSDU, and starting a timer corresponding to the current QoS service class when judging that the currently selected MSDU is the first MSDU selected in the current aggregation process;
s13, after adding the currently selected MSDU to the analog A-MSDU, judging whether the length of the analog A-MSDU is smaller than or equal to the maximum A-MSDU length and whether the number of MSDUs aggregated in the analog A-MSDU is smaller than or equal to the maximum MSDU number, if both are, jumping to the step S14, otherwise jumping to the step S16;
s14, calculating expected transmission efficiency of the analog A-MSDU, judging whether the calculated expected transmission efficiency is larger than or equal to an optimal efficiency value, if so, modifying the optimal efficiency value to be equal to the expected transmission efficiency, taking the MSDU currently aggregated by the analog A-MSDU as the MSDU aggregated at the time, and jumping to the step S15, if not, directly jumping to the step S15;
s15, judging whether the timer reaches a preset time, if so, jumping to a step S16, and if not, jumping to a step S11;
s16, polymerizing the MSDU polymerized at the time to obtain the target A-MSDU in the polymerization process at the time.
As an improvement of the above scheme, the expected transmission efficiency of the analog a-MSDU is calculated by the following formula:
wherein γ is the expected transmission efficiency of the analog a-MSDU; t (T) put Valid transmission bits for the analog a-MSDU; t (T) exp Is the expected transmission time of the analog a-MSDU.
As an improvement of the above scheme, the effective transmission bit T of the analog A-MSDU put Calculated by the following formula:
wherein PER is the packet loss rate corresponding to the length grade of the analog A-MSDU calculated by using the exponentially weighted moving average;summing the lengths of the data portions of the respective ones of the simulated A-MSDUs.
As an improvement of the above scheme, the packet loss rate PER corresponding to the length class where the analog a-MSDU is located, which is calculated by using an exponentially weighted moving average, is calculated by the following formula:
PER＝α×R ΔT +(1-α)×R his
wherein Δt represents a preset time period before the current time; r is R ΔT The packet loss rate corresponding to the length grade of the simulation A-MSDU is represented within delta T; alpha represents R ΔT The weight of the vehicle is occupied; (1-alpha) represents R his The weight of the vehicle is occupied; r is R his Representing the loss corresponding to the length class at which the analog A-MSDU was located before DeltaTPacket rate.
As an improvement of the above scheme, the packet loss rate corresponding to the length class where the analog a-MSDU is located in a certain period of time is calculated by the following steps:
in the time period, recording the number of times of transmitting the length grade transmitting package of the analog A-MSDU as N T ；
Obtaining the number N of successful sending of the package sent in the length grade where the analog A-MSDU is located in the time period according to the received block acknowledgement frame S ；
According to the number N of successful sending times S And the number of times of transmission N T And calculating to obtain the packet loss rate corresponding to the length grade of the simulation A-MSDU.
As an improvement of the above scheme, the expected transmission time T of the analog A-MSDU exp Calculated by the following formula:
T exp ＝PER×T fail +(1-PER)×T succ
wherein T is fail A time penalty to be paid for a data failure representing the length of the MPDU in which the analog a-MSDU is transmitted; t (T) succ The time required for successful transmission of data representing the length of MPDU where the analog a-MSDU is located.
As an improvement of the scheme, T when RTS/CTS mode transmission is adopted succ Calculated by the following formula:
T succ ＝T RTS +T CTS +T data +3T SIFS +T BACK +T DIFS
t when RTS/CTS mode transmission is not employed succ Calculated by the following formula:
T succ ＝T data +T SIFS +T BACK +T DIFS
wherein T is RTS 、T CTS 、T BACK Respectively representing the transmission time of RTS, CTS and Block ACK; t (T) SIFS 、T DIFS Respectively representing the interval duration between short frames and the interval duration between distributed frames; t (T) data Representing the simulation A-a length of MPDU where the MSDU is located, a medium access control header of the analog a-MSDU, a physical layer preamble length and a transmission time to be occupied by a delimiter.
As an improvement of the scheme, T when RTS/CTS mode transmission is adopted fail Calculated by the following formula:
T fail ＝T RTS +T CTS +2T SIFS +T data +T EIFS
t when RTS/CTS mode transmission is not employed fail Calculated by the following formula:
T fail ＝T data +T EIFS
wherein T is EIFS Indicating the gap duration between extended frames.
The embodiment of the invention also provides a terminal device, which comprises a processor, a memory and a computer program stored in the memory and configured to be executed by the processor, wherein the processor realizes the frame aggregation method according to any one of the above when executing the computer program.
The embodiment of the invention also provides a computer readable storage medium, which comprises a stored computer program, wherein the computer program controls a device where the computer readable storage medium is located to execute the frame aggregation method according to any one of the above when running.
Compared with the prior art, when judging that the MSDU meeting the A-MSDU aggregation condition exists in the buffer queue of the transmitter, the frame aggregation method, the terminal equipment and the computer storage medium select the proper MSDU for aggregation by calculating and comparing the expected transmission efficiency corresponding to the analog A-MSDU after each MSDU is added in sequence, thereby realizing the dynamic adjustment of the aggregation length of the A-MSDU according to the network state, ensuring that the transmission efficiency of the target A-MSDU obtained by aggregation is optimal, and adjusting the aggregation time of the A-MSDU according to the current QoS service class, and further meeting the time delay requirement of the corresponding service class.
Drawings
Fig. 1 is a schematic flow chart of an embodiment of a frame aggregation method provided by the present invention.
Fig. 2 is a data transmission flow chart of an MPDU where a target a-MSDU is located according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of an embodiment of a terminal device provided by the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, a flow chart of an embodiment of a frame aggregation method provided by the present invention is shown.
The embodiment of the invention provides a frame aggregation method, which comprises the steps S11 to S16, and specifically comprises the following steps:
s11, judging whether the buffer queue of the transmitter has MSDUs which meet the A-MSDU aggregation condition and are not selected, if yes, jumping to the step S12, and if not, jumping to the step S16.
The A-MSDU aggregation conditions are the same receiver address, sender address and service type, namely, when a plurality of MSDUs with the same receiver address, sender address and service type exist in a buffer queue of the transmitter, the MSDUs are MSDUs meeting the A-MSDU aggregation conditions in the buffer queue of the transmitter. If not selected, i.e. the MSDU is not selected and added to the analog a-MSDU in the current aggregation process, it can be understood that, in the current aggregation process, when step S11 is performed for the first time, all MSDUs satisfying the a-MSDU aggregation condition in the buffer queue are not selected, and when step S11 is performed for the second time, the first MSDU satisfying the a-MSDU aggregation condition in the buffer queue is selected according to the order of the MSDUs in the buffer queue, and the second and subsequent MSDUs satisfying the a-MSDU aggregation condition in the buffer queue are not selected, and so on, when it is determined that the buffer queue of the transmitter does not satisfy the a-MSDU aggregation condition and the unselected MSDUs, it is indicated that all MSDUs satisfying the a-MSDU aggregation condition in the buffer queue have been selected.
S12, according to the MSDU ordering in the buffer queue, the first MSDU in all MSDUs which meet the A-MSDU aggregation condition and are not selected in the buffer queue is used as the currently selected MSDU, and when the currently selected MSDU is judged to be the first MSDU selected in the current aggregation process, a timer corresponding to the current QoS service class is started.
The method can be that different timers are set in advance according to different QoS service types, and when the currently selected MSDU is judged to be the first MSDU selected in the aggregation process, that is, the currently selected MSDU is judged to be the first MSDU of all MSDUs meeting the aggregation condition of the a-MSDU in the buffer queue, the timer corresponding to the current QoS service type is started to meet the time delay requirement of the corresponding service type. Alternatively, the timer may be a positive timer or a negative timer.
It can be understood that, in the present aggregation process, when step S12 is executed for the first time, all MSDUs satisfying the a-MSDU aggregation condition in the buffer queue are not selected, then the first MSDU in all MSDUs satisfying the a-MSDU aggregation condition in the buffer queue is ordered according to the MSDUs in the buffer queue, and is used as the currently selected MSDU, when step S12 is executed for the second time, the first MSDU in the buffer queue satisfying the a-MSDU aggregation condition is selected according to the MSDU ordering in the buffer queue, and the second and subsequent MSDUs in the buffer queue satisfying the a-MSDU aggregation condition are not selected, and then the second MSDU in all MSDUs satisfying the a-MSDU aggregation condition in the buffer queue is used as the currently selected MSDU, and so on.
And S13, after adding the currently selected MSDU into the simulation A-MSDU, judging whether the length of the simulation A-MSDU is smaller than or equal to the maximum A-MSDU length and whether the number of MSDUs aggregated in the simulation A-MSDU is smaller than or equal to the maximum MSDU number, if both, jumping to the step S14, otherwise jumping to the step S16.
In the process of adding the currently selected MSDU to the analog A-MSDU, two cases are handled. In the case that the currently selected MSDU is the first MSDU selected in the current aggregation process, no analog A-MSDU frame is currently aggregated, in which case a new A-MSDU frame needs to be newly created as an analog A-MSDU, and the currently selected MSDU is placed at the first position of the analog A-MSDU; another situation is that there is currently an analog a-MSDU frame that is being aggregated, in which case the currently selected MSDU needs to be aggregated at the end of the analog a-MSDU frame. It should be noted that adding the currently selected MSDU to the analog a-MSDU refers to obtaining the length information of the currently selected MSDU to calculate the analog a-MSDU, and the currently selected MSDU is still retained in the buffer queue.
Wherein, after adding the currently selected MSDU to the analog A-MSDU, the length of the analog A-MSDU needs to be smaller than or equal to the maximum A-MSDU length L indicated by HT Capabilities information (high throughput function information) in the association negotiation process amsdu,max And the number of aggregated MSDUs in the simulated a-MSDUs needs to be less than or equal to the maximum number of MSDUs N in the a-MSDUs that the receiver indicated by Max Number Of MSDUs In A-MSDUs (maximum number of MSDUs in a-MSDUs) field in receiver Extended Capabilities field (extended function field) in the association negotiation process can receive msdu,max . After adding the currently selected MSDU to the simulation A-MSDU, if the length of the simulation A-MSDU is greater than the maximum A-MSDU length or the number of the MSDUs aggregated in the simulation A-MSDU is greater than the maximum MSDU number, jumping to step S16 to generate the target A-MSDU in the current aggregation process, so that the target A-MSDU obtained by aggregation accords with the transmission condition.
S14, calculating expected transmission efficiency of the analog A-MSDU, judging whether the calculated expected transmission efficiency is larger than or equal to an optimal efficiency value, if so, modifying the optimal efficiency value to be equal to the expected transmission efficiency, taking the MSDU currently aggregated by the analog A-MSDU as the MSDU aggregated at the time, and jumping to the step S15, if not, jumping to the step S15 directly.
In an alternative embodiment, when the calculated expected transmission efficiency is greater than or equal to the optimal efficiency value, the optimal efficiency value is modified to be equal to the expected transmission efficiency, and the calculated expected transmission efficiency is considered to be the best efficiency value so far, and the actual aggregation is started, that is, the MSDU which is currently aggregated by the analog a-MSDU when the optimal efficiency value is reached is taken out from the buffer queue and used as the MSDU of the current aggregation, and the subsequent steps are continuously executed, so that the efficiency is higher. It will be appreciated that if the calculated expected transmission efficiency is not greater than the optimal efficiency value, then the actual aggregation is not performed at this time.
In an alternative embodiment, the optimal efficiency value may be preset to 0, and when the currently selected MSDU is the first MSDU selected in the current aggregation process, the optimal efficiency value is modified to simulate the expected transmission efficiency of the a-MSDU when only the first MSDU selected in the current aggregation process is aggregated, so as to be used for subsequent comparison.
And S15, judging whether the timer reaches the preset time, if so, jumping to the step S16, and if not, jumping to the step S11.
The preset time may be set according to a delay requirement of a QoS service class, which is not limited herein. For example, after the first MSDU of the aggregation queue of A-MSDUs enters, a timer is started, aggregation is stopped when the timer counts down to 0, otherwise the next MSDU is aggregated.
S16, polymerizing the MSDU polymerized at the time to obtain the target A-MSDU in the polymerization process at the time.
The MSDU polymerized at this time is polymerized to obtain a target A-MSDU in the polymerization process, the length of the target A-MSDU obtained by the polymerization is equal to the length of the simulation A-MSDU when the expected transmission efficiency is maximum, and the polymerization is ended.
According to the frame aggregation method provided by the embodiment of the invention, when judging that the MSDU meeting the A-MSDU aggregation condition exists in the buffer queue of the transmitter, the method selects the proper MSDU for aggregation by calculating and comparing the expected transmission efficiency corresponding to the analog A-MSDU after each MSDU is added in sequence, thereby realizing the dynamic adjustment of the aggregation length of the A-MSDU according to the network state, enabling the transmission efficiency of the target A-MSDU obtained by aggregation to be optimal, and adjusting the aggregation time of the A-MSDU according to the current QoS service class, thereby meeting the time delay requirement of the corresponding service class.
In a preferred embodiment, the expected transmission efficiency of the analog a-MSDU is calculated by the following formula:
wherein γ is the expected transmission efficiency of the analog a-MSDU; t (T) put Valid transmission bits for the analog a-MSDU; t (T) exp Is the expected transmission time of the analog a-MSDU.
Further, the effective transmission bit T of the analog A-MSDU put Calculated by the following formula:
wherein PER is the packet loss rate corresponding to the length grade of the analog A-MSDU calculated by using the exponentially weighted moving average;summing the lengths of the data portions of the respective ones of the simulated A-MSDUs.
Wherein the lengths of the a-MSDUs are ranked by a certain length range, and packet loss rates (Packet Error Radio, PER) of different a-MSDUs length ranks at each rate are counted and maintained using an exponentially weighted moving average (Exponentially Weighted Moving Average, EWMA). In this embodiment, the specific partitioning method of the length class of the a-MSDU is not mandatory.
As an example, a maximum transmission unit (Maximum Transmission Unit, MTU) L commonly used based on ethernet mtu Maximum length L of A-MSDU negotiated with transceiver amsdu,max = 3839bytes or 7935bytes, rank the a-MSDU lengths.
Such as L mtu Case=1500 bytes:
table 1A-MSDU Length division
Specifically, the packet loss rate PER corresponding to the length class where the analog a-MSDU is located, which is calculated by using an exponentially weighted moving average, is calculated by the following formula:
PER＝α×R ΔT +(1-α)×R his
wherein Δt represents a preset time period before the current time; r is R ΔT The packet loss rate corresponding to the length grade of the simulation A-MSDU is represented within delta T; alpha represents R ΔT The weight of the vehicle is occupied; (1-alpha) represents R his The weight of the vehicle is occupied; r is R his And representing the packet loss rate corresponding to the length grade where the analog A-MSDU is located before the delta T.
Optionally, the packet loss rate corresponding to the length class where the analog a-MSDU is located in a certain period of time is calculated by the following steps:
in the time period, recording the number of times of transmitting the length grade transmitting package of the analog A-MSDU as N T ；
Obtaining the number N of successful sending of the package sent in the length grade where the analog A-MSDU is located in the time period according to the received block acknowledgement frame S ；
According to the number N of successful sending times S And the number of times of transmission N T And calculating to obtain the packet loss rate corresponding to the length grade of the simulation A-MSDU.
Wherein, the number of times of sending the length grade package of the analog A-MSDU is N T Comprising the following steps: and when judging that the detection condition is met, carrying out the sending times in the detection process on the length grade of the analog A-MSDU and the sending times in the normal packet receiving and sending process.
In an alternative embodiment, the A-MSDU length class K for the analog A-MSDU is transmitted for a duration of ΔTNumber of times N T Transmission results obtained using compressed block acknowledgement (Compressed BlockACK) mechanism wherein the number of successes N S Packet loss rate R of A-MSDU length grade K ΔT ＝(N T -N S )/N T 。
Wherein for a given rate, a higher A-MSDU length level (corresponding level is denoted as K) is probed for updating PER K And detecting a better A-MSDU length, wherein the detection attempt needs to simultaneously meet the following conditions:
1. when the transmission time of the length class K of the A-MSDU is greater than T on the last distance prob ；
2. The transmitter transmits MSDUs which are to be transmitted to appointed STA and meet the aggregation condition (the same receiver address, the sender address and the service type) of the A-MSDUs, and the length of the A-MSDUs after the aggregation of the MSDUs accords with the length range of the A-MSDUs of the grade K;
3. the success rate of transmitting the A-MSDU length of the K-1 level within the latest delta T is higher than the set threshold R th 。
T prob 、R th The method can be customized according to the situation and is not mandatory.
Further, the expected transmission time T of the analog A-MSDU exp Calculated by the following formula:
T exp ＝PER×T fail +(1-PER)×T succ
the expected transmission efficiency of the analog a-MSDU is then:
the expected transmission time T of the analog A-MSDU in this embodiment exp Only the transmission condition of MPDUs where the analog A-MSDUs are positioned is considered in the calculation of (1), and the conditions of failure caused by RTS collision and failure caused by data transmission collision are not considered. Wherein T is fail A time penalty to be paid for a data failure representing the length of the MPDU in which the analog a-MSDU is transmitted; t (T) succ Data generation representing the length of MPDUs in which the analog A-MSDU is transmittedThe time required for work.
Referring to fig. 2, a data transmission flow chart of an MPDU where a target a-MSDU is located is provided in an embodiment of the present invention.
According to the data transmission flow chart shown in FIG. 2, T is determined according to the transmission flow prescribed by the protocol when RTS/CTS mode transmission is adopted succ Calculated by the following formula:
T succ ＝T RTS +T CTS +T data +3T SIFS +T BACK +T DIFS
t when RTS/CTS mode transmission is not employed succ Calculated by the following formula:
T succ ＝T data +T SIFS +T BACK +T DIFS
wherein T is RTS 、T CTS 、T BACK Respectively representing the transmission time of RTS, CTS and Block ACK; t (T) SIFS 、T DIFS Respectively representing the interval duration between short frames and the interval duration between distributed frames; t (T) data Representing the length of MPDU where the analog A-MSDU is located, the media access control header, the physical layer preamble length and the transmission time to be occupied by the delimiter of the analog A-MSDU.
T when RTS/CTS mode transmission is adopted fail Calculated by the following formula:
T fail ＝T RTS +T CTS +2T SIFS +T data +T EIFS
t when RTS/CTS mode transmission is not employed fail Calculated by the following formula:
T fail ＝T data +T EIFS
wherein T is EIFS Indicating the gap duration between extended frames.
In particular, the method comprises the steps of,
wherein a-MSDU length:
satisfy N is less than or equal to N msdu,max ,L amsdu ≤L amsdu,max 。
Wherein L is ppdu Represents the overhead of the physical layer protocol data unit (physical layer protocol data unit) transmitting the analog a-MSDU,is the overhead of the mac header of the analog A-MSDU,/and>for the overhead of the simulation A-MSDU subframe header (sub-frame header), L delimiter Delimiter length 4bytes, L for MPDU where the analog A-MSDU is located preamble For the physical layer preamble length, the padding byte pad length and the FCS length of the a-MSDU, etc. of each subframe are negligible, L, according to the protocol, which are all known constants data For the length of MSDU data packets, rate is the Rate selected in the current channel environment, and N is the number of MSDU aggregate packets.
Referring to fig. 3, a schematic structural diagram of an embodiment of a terminal device provided by the present invention is shown.
The terminal device provided by the embodiment of the invention comprises a processor 31, a memory 32 and a computer program stored in the memory 32 and configured to be executed by the processor 31, wherein the frame aggregation method described in any embodiment is realized when the processor 31 executes the computer program.
In addition, an embodiment of the present invention further provides a computer readable storage medium, where the computer readable storage medium includes a stored computer program, where when the computer program runs, the device where the computer readable storage medium is controlled to execute the frame aggregation method according to any one of the embodiments above.
The processor 31, when executing the computer program, implements the steps of the frame aggregation method embodiment described above, for example all the steps of the frame aggregation method shown in fig. 1.
The terminal device may include, but is not limited to, a processor 31, a memory 32. It will be appreciated by those skilled in the art that the schematic diagram is merely an example of a terminal device and does not constitute a limitation of the terminal device, and may include more or less components than illustrated, or may combine certain components, or different components, e.g., the terminal device may further include an input-output device, a network access device, a bus, etc.
The processor 31 may be a central processing unit (Central Processing Unit, CPU), other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, and the processor 31 is a control center of the terminal device, and connects various parts of the entire terminal device using various interfaces and lines.
The memory 32 may be used to store the computer program and/or module, and the processor 31 may implement various functions of the terminal device by running or executing the computer program and/or module stored in the memory 32 and invoking data stored in the memory 32. The memory 32 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the terminal device, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, plug-in hard disk, smart Media Card (SMC), secure Digital (SD) Card, flash Card (Flash Card), at least one disk storage device, flash memory device, or other volatile solid-state storage device.
Wherein the terminal device integrated modules/units may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as stand alone products. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth.
It should be noted that the above-described apparatus embodiments are merely illustrative, and the units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, in the drawings of the embodiment of the device provided by the invention, the connection relation between the modules represents that the modules have communication connection, and can be specifically implemented as one or more communication buses or signal lines. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The foregoing is merely a preferred embodiment of the present invention, and it should be noted that modifications and variations could be made by those skilled in the art without departing from the technical principles of the present invention, and such modifications and variations should also be regarded as being within the scope of the invention.
Claims (9)
1. A method of frame aggregation, comprising:
s11, judging whether an MSDU which meets the A-MSDU aggregation condition and is not selected exists in a buffer queue of the transmitter, if so, jumping to the step S12, and if not, jumping to the step S16;
s12, according to the MSDU ordering in the buffer queue, taking the first MSDU in all MSDUs which meet the A-MSDU aggregation condition and are not selected in the buffer queue as the currently selected MSDU, and starting a timer corresponding to the current QoS service class when judging that the currently selected MSDU is the first MSDU selected in the current aggregation process;
s13, after adding the currently selected MSDU to the analog A-MSDU, judging whether the length of the analog A-MSDU is smaller than or equal to the maximum A-MSDU length and whether the number of MSDUs aggregated in the analog A-MSDU is smaller than or equal to the maximum MSDU number, if both are, jumping to the step S14, otherwise jumping to the step S16;
s14, calculating expected transmission efficiency of the analog A-MSDU, judging whether the calculated expected transmission efficiency is larger than or equal to an optimal efficiency value, if so, modifying the optimal efficiency value to be equal to the expected transmission efficiency, taking the MSDU currently aggregated by the analog A-MSDU as the MSDU aggregated at the time, and jumping to the step S15, if not, directly jumping to the step S15;
s15, judging whether the timer reaches a preset time, if so, jumping to a step S16, and if not, jumping to a step S11;
s16, polymerizing the MSDU polymerized at the time to obtain a target A-MSDU in the polymerization process at the time;
wherein the expected transmission efficiency of the analog a-MSDU is calculated by the following formula:
wherein γ is the expected transmission efficiency of the analog a-MSDU; t (T) put For the simulation A-Valid transmission bits of the MSDU; t (T) exp Is the expected transmission time of the analog a-MSDU.
2. The frame aggregation method of claim 1, wherein the valid transmission bits T of the analog a-MSDU put Calculated by the following formula:
wherein PER is the packet loss rate corresponding to the length grade of the analog A-MSDU calculated by using the exponentially weighted moving average;summing the lengths of the data portions of the respective ones of the simulated A-MSDUs.
3. The frame aggregation method according to claim 2, wherein the packet loss rate PER corresponding to the length class in which the analog a-MSDU is located, which is calculated using an exponentially weighted moving average, is calculated by the following formula:
PER＝α×R ΔT +(1-α)×R his
wherein Δt represents a preset time period before the current time; r is R ΔT The packet loss rate corresponding to the length grade of the simulation A-MSDU is represented within delta T; alpha represents R ΔT The weight of the vehicle is occupied; (1-alpha) represents R his The weight of the vehicle is occupied; r is R his And representing the packet loss rate corresponding to the length grade where the analog A-MSDU is located before the delta T.
4. The frame aggregation method of claim 3, wherein the packet loss rate corresponding to the length class in which the analog a-MSDU is located in a certain period of time is calculated by:
in the time period, recording the number of times of transmitting the length grade transmitting package of the analog A-MSDU as N T ；
Obtaining the number N of successful sending of the package sent in the length grade where the analog A-MSDU is located in the time period according to the received block acknowledgement frame S ；
According to the number N of successful sending times S And the number of times of transmission N T And calculating to obtain the packet loss rate corresponding to the length grade of the simulation A-MSDU.
5. A frame aggregation method according to claim 2 or 3, wherein the expected transmission time T of the analog a-MSDU exp Calculated by the following formula:
T exp ＝PER×T fail +(1-PER)×T succ
wherein T is fail A time penalty to be paid for a data failure representing the length of the MPDU in which the analog a-MSDU is transmitted; t (T) succ The time required for successful transmission of data representing the length of MPDU where the analog a-MSDU is located.
6. The frame aggregation method of claim 5, wherein T is when RTS/CTS mode transmission is employed succ Calculated by the following formula:
T succ ＝T RTS +T CTS +T data +3T SIFS +T BACK +T DIFS
t when RTS/CTS mode transmission is not employed succ Calculated by the following formula:
T succ ＝T data +T SIFS +T BACK +T DIFS
wherein T is RTS 、T CTS 、T BACK Respectively representing the transmission time of RTS, CTS and Block ACK; t (T) SIFS 、T DIFS Respectively representing the interval duration between short frames and the interval duration between distributed frames; t (T) data Representing the length of MPDU where the analog A-MSDU is located, the media access control header, the physical layer preamble length and the transmission time to be occupied by the delimiter of the analog A-MSDU.
7. The frame aggregation method of claim 6, wherein T is when RTS/CTS mode transmission is employed fail Calculated by the following formula:
T fail ＝T RTS +T CTS +2T SIFS +T data +T EIFS
t when RTS/CTS mode transmission is not employed fail Calculated by the following formula:
T fail ＝T data +T EIFS
wherein T is EIFS Indicating the gap duration between extended frames.
8. A terminal device comprising a processor, a memory and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the frame aggregation method according to any one of claims 1-7 when executing the computer program.
9. A computer readable storage medium, characterized in that the computer readable storage medium comprises a stored computer program, wherein the computer program, when run, controls a device in which the computer readable storage medium is located to perform the frame aggregation method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010242584.9A CN111601343B (en) | 2020-03-31 | 2020-03-31 | Frame aggregation method, terminal device and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010242584.9A CN111601343B (en) | 2020-03-31 | 2020-03-31 | Frame aggregation method, terminal device and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111601343A CN111601343A (en) | 2020-08-28 |
| CN111601343B true CN111601343B (en) | 2023-10-03 |
Family
ID=72183386
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010242584.9A Active CN111601343B (en) | 2020-03-31 | 2020-03-31 | Frame aggregation method, terminal device and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111601343B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115174003B (en) * | 2022-07-20 | 2023-11-24 | 普联技术有限公司 | Block acknowledgement control method, device, computer readable storage medium and terminal equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006027964A1 (en) * | 2004-09-10 | 2006-03-16 | Mitsubishi Denki Kabushiki Kaisha | Method and system for aggregating frames to be transmitted over channel in wireless network |
| CN107864028A (en) * | 2017-09-29 | 2018-03-30 | 西安电子科技大学 | A kind of adaptive frame polymerization in vehicle self-organizing network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7729236B2 (en) * | 2005-11-10 | 2010-06-01 | Nokia Corporation | Use of timing information for handling aggregated frames in a wireless network |
| US20140254408A1 (en) * | 2013-03-08 | 2014-09-11 | Qualcomm Incorporated | Rate control associated with frame aggregation |
-
2020
- 2020-03-31 CN CN202010242584.9A patent/CN111601343B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006027964A1 (en) * | 2004-09-10 | 2006-03-16 | Mitsubishi Denki Kabushiki Kaisha | Method and system for aggregating frames to be transmitted over channel in wireless network |
| CN107864028A (en) * | 2017-09-29 | 2018-03-30 | 西安电子科技大学 | A kind of adaptive frame polymerization in vehicle self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111601343A (en) | 2020-08-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7586948B2 (en) | Packet sub-frame structure for selective acknowledgment | |
| US9985749B2 (en) | Method and system for improving wireless link efficiency | |
| US8284753B2 (en) | Wireless communication apparatus and wireless communication method | |
| EP1969752B1 (en) | A flexible segmentation scheme for communication systems | |
| US7697561B2 (en) | Communication apparatus, communication method, and communication system | |
| CN100469028C (en) | Method and system for aggregating frames to be transmitted over channel in wireless network | |
| EP2109954B1 (en) | Ack prioritization in wireless networks | |
| EP3713122B1 (en) | Method for replying with acknowledgement frame, apparatus, and data transmission system | |
| US20070127424A1 (en) | Method and apparatus to transmit and/or receive data via wireless network and wireless device | |
| US7865549B2 (en) | Method and apparatus for transmitting data frame efficiently in communication network | |
| WO2007087216A2 (en) | Providing collision avoidance instructions in wlan systems | |
| CN110506403B (en) | Method and apparatus for flow control of wireless devices | |
| US7688847B2 (en) | Expected channel occupancy time as a wireless link metric | |
| US8171365B2 (en) | Communication apparatus and method thereof | |
| WO2006034654A1 (en) | An adaptive multi rate transmission method in the wireless local area network | |
| WO2018027674A1 (en) | Transmission status report apparatus, method, and communication system | |
| US20140314060A1 (en) | Method and apparatus for efficient aggregation scheduling in wireless local area network (wlan) system | |
| US20070010290A1 (en) | Radio base station device, radio network control device, and transfer rate decision method | |
| CN111601343B (en) | Frame aggregation method, terminal device and computer storage medium | |
| WO2005029774A2 (en) | Method of data handling in a wlan | |
| CN102088715B (en) | Packet segmentation method and equipment | |
| Hajlaoui et al. | Analytical study of frame aggregation in error-prone channels | |
| KR100612654B1 (en) | Apparatus and method for generating frame for automatic repeat request | |
| CN110858794A (en) | Multi-frequency band transmission method and device | |
| CN116963175A (en) | Data transmission method, device and system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |