CN115208531A - Data transmission method and equipment - Google Patents

Data transmission method and equipment Download PDF

Info

Publication number
CN115208531A
CN115208531A CN202110394783.6A CN202110394783A CN115208531A CN 115208531 A CN115208531 A CN 115208531A CN 202110394783 A CN202110394783 A CN 202110394783A CN 115208531 A CN115208531 A CN 115208531A
Authority
CN
China
Prior art keywords
terminal
data frame
frame
data
time point
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
CN202110394783.6A
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.)
Qingdao Haier Washing Machine Co Ltd
Haier Smart Home Co Ltd
Original Assignee
Qingdao Haier Washing Machine Co Ltd
Haier Smart Home 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 Qingdao Haier Washing Machine Co Ltd, Haier Smart Home Co Ltd filed Critical Qingdao Haier Washing Machine Co Ltd
Priority to CN202110394783.6A priority Critical patent/CN115208531A/en
Publication of CN115208531A publication Critical patent/CN115208531A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • H04L5/0055—Physical resource allocation for ACK/NACK
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0064—Rate requirement of the data, e.g. scalable bandwidth, data priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078—Timing of allocation

Abstract

The application provides a data transmission method and equipment. The method comprises the following steps: when a first terminal sends different data frames to a plurality of second terminals, determining the sending time point of each data frame according to the length of each data frame in a plurality of data frames to be sent; and sending the data frame to the corresponding second terminal according to the sending time point of each data frame. The time points of receiving the data frames by the second terminals are the same, and the time points of sending the ACK frames to the first terminal by the second terminals are also the same, so that the problem of data frame and ACK frame collision is avoided.

Description

Data transmission method and equipment
Technical Field
The present application relates to the field of communications, and in particular, to a data transmission method and device.
Background
The improvement of data throughput of a single Basic Service Set (BSS) is an urgent problem to be solved at present, and technologies for improving data throughput of a BSS include a multi-user multiple input and output (MU-Mnro) technology and a multi-frequency channel technology. With these techniques, a first terminal may simultaneously communicate with a plurality of second terminals using multiple channels/multipaths, and thus, data throughput of a BSS may be significantly increased.
However, when the lengths of the data frames transmitted by the first terminal to the plurality of second terminals are different, the data frame transmitted by the first terminal to a certain second terminal and the ACK frame returned by another second terminal to the first terminal may collide, so that the first device may not receive the ACK frame returned by the second device.
Disclosure of Invention
The application provides a data transmission method and equipment, which are used for solving the problem of collision between a data frame and an ACK frame.
In a first aspect, the present application provides a data transmission method, applied to a first terminal, including: when the first terminal sends different data frames to a plurality of second terminals, determining the sending time point of each data frame according to the length of each data frame in a plurality of data frames to be sent; and sending the data frame to the corresponding second terminal according to the sending time point of each data frame.
Optionally, the determining a sending time point of each data frame according to a length of each data frame in a plurality of data frames to be sent includes: acquiring a data frame with the longest length from the plurality of data frames to be transmitted; acquiring the sending time difference between the data frame with the longest length and a first data frame, wherein the first data frame is any data frame except the data frame with the longest length in the multiple data frames to be sent; and determining the sending time point of the first data frame according to the sending time point of the data frame with the longest length and the sending time difference.
Optionally, the obtaining a sending time difference between the data frame with the longest length and the first data frame includes: acquiring the length difference between the data frame with the longest length and the first data frame; and determining the sending time difference according to the length difference and the data transmission rate.
In a second aspect, the present application provides a data transmission method, applied to a first terminal, including: when the first terminal sends different data frames to a plurality of second terminals, determining the time point of each second terminal for returning an acknowledgement frame according to the length of each data frame in the plurality of data frames to be sent; adding the time point of each second terminal returning the acknowledgement frame into the corresponding data frame; and sending corresponding data frames to the plurality of second terminals.
Optionally, the determining, according to the length of each data frame in the multiple data frames to be sent, a time point at which each second terminal returns an acknowledgement frame includes: acquiring a data frame with the longest length from the plurality of data frames to be transmitted, wherein a second terminal corresponding to the data frame with the longest length is a target terminal; determining the time point of the target terminal returning an acknowledgement frame according to the length of the data frame with the longest length; acquiring the time difference of acknowledgement frames returned by a third terminal and the target terminal, wherein the third terminal is any one of the plurality of second terminals; and determining the time point of the third terminal for returning the acknowledgement frame according to the time difference between the time point of the target terminal for returning the acknowledgement frame and the time difference of the returned acknowledgement frame.
Optionally, the obtaining a time difference between the third terminal and the target terminal to return the acknowledgement frame includes: acquiring the length difference between the data frame with the longest length and a first data frame, wherein the first data frame is a data frame corresponding to the third terminal; and determining the time difference of the returned acknowledgement frame according to the length difference and the data transmission rate.
Optionally, the adding the time point of the acknowledgement frame returned by each second terminal to the corresponding data frame includes: and adding the time point of each second terminal returning the acknowledgement frame into the filling field of the corresponding data frame.
In a third aspect, the present application provides a data transmission method, applied to a second terminal, including: receiving a data frame from a first terminal; reading a time point of a return acknowledgement frame from the data frame; and sending an acknowledgement frame to the first terminal according to the time point of the return acknowledgement frame.
Optionally, the reading a time point of a return acknowledgement frame from the data frame includes: and reading the time point of the return acknowledgement frame from the filling field of the data frame.
In a fourth aspect, the present application provides a terminal device, including: a determining module, configured to determine a sending time point of each data frame according to a length of each data frame in a plurality of data frames to be sent when the first terminal sends different data frames to a plurality of second terminals; and the sending module is used for sending the data frames to the corresponding second terminal according to the sending time point of each data frame.
In a fifth aspect, the present application provides a terminal device, including: a determining module, configured to determine, when the first terminal sends different data frames to multiple second terminals, a time point at which each second terminal returns an acknowledgement frame according to a length of each data frame in the multiple data frames to be sent; the adding module is used for adding the time point of each second terminal returning the acknowledgement frame into the corresponding data frame; and the sending module is used for sending the corresponding data frames to the plurality of second terminals.
In a sixth aspect, the present application provides a terminal device, including: a receiving module, configured to receive a data frame from a first terminal; a reading module, configured to read a time point of a return acknowledgement frame from the data frame; and the sending module is used for sending the acknowledgement frame to the first terminal according to the time point of the return acknowledgement frame.
In a seventh aspect, the present application provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of the first, second or third aspect.
In an eighth aspect, the present application provides a terminal device, including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to implement the method of the first, second or third aspect via execution of the executable instructions.
The data transmission method and device provided by the application provide two schemes for solving the conflict between the data frame and the ACK frame, and specifically, the first scheme is as follows: the first terminal obtains the lengths of a plurality of data frames to be sent, and because the receiving time corresponding to the data frame with the longest length is the longest, the sending time points of other data frames are delayed by taking the data frame with the longest length as a reference, so that the time points of the second terminals for receiving the data frames are the same, and the time points of the second terminals for sending the ACK frames to the first terminal are also the same, thereby avoiding the problem of collision between the data frames and the ACK frames. The second scheme is as follows: and delaying the time point of sending the ACK frame to the first terminal by other second terminals by taking the time point of sending the ACK frame to the first terminal by the target terminal as a reference, so that the time points of sending the ACK frame to the first terminal by each second terminal are the same, and the problem of collision between the data frame and the ACK frame is avoided.
Drawings
Fig. 1 is a schematic structural diagram of a data frame provided in the present application;
fig. 2 is a schematic diagram of a feedback Acknowledgement (ACK) frame after a second terminal receives a data frame sent by a first terminal according to the present disclosure;
fig. 3 is a schematic diagram of a data frame and ACK frame collision provided in the present application;
fig. 4 is a schematic flowchart of a first embodiment of a data transmission method provided in the present application;
fig. 5 is a first schematic diagram of a plurality of second terminals returning ACK frames at the same time point according to the present application;
fig. 6 is a flowchart illustrating a second embodiment of a data transmission method provided in the present application;
fig. 7 is a schematic diagram of a plurality of second terminals returning ACK frames at the same time point according to the present application;
fig. 8 is a first schematic structural diagram of a first terminal provided in the present application;
fig. 9 is a second schematic structural diagram of the first terminal provided in the present application;
fig. 10 is a schematic structural diagram of a second terminal provided in the present application;
fig. 11 is a schematic structural diagram of a terminal provided in the present application.
Detailed Description
To make the purpose, technical solutions and advantages of the present application clearer, the technical solutions in the present application will be clearly and completely described below with reference to the drawings in the present application, and it is obvious that the described embodiments are some, but not all embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In this application, it should be understood that the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Further, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. The character "is a relationship generally indicating that the former and latter associated objects are an" or ". "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a alone, b alone, c alone, a and b combination, a and c combination, b and c combination, or a, b and c combination, wherein a, b and c can be single or multiple.
Fig. 1 is a schematic structural diagram of a data frame provided in the present application. The data frame referred to herein may be an aggregated MAC layer protocol data unit (a-MPDU). Referring to fig. 1, a data frame includes a plurality of subframes. Each subframe includes: a delimiter, an MPDU, and a padding field. The delimiter is located in front of the MPDU to identify the MPDU. The delimiter includes MPDU length information, cyclic Redundancy Check (CRC) for ensuring the integrity of the delimiter, and an identification flag characterizing the delimiter. The standard specifies that the gap between two start positions of two consecutive subframes is an integer multiple of 32 bits (i.e., 4 bytes). Here, the design of the padding field may satisfy the specification. Therefore, as shown in fig. 1, the last subframe does not include a padding field. The padding field may have a size of 0 to 3 bytes.
Fig. 2 is a schematic diagram of a feedback Acknowledgement (ACK) frame after a second terminal receives a data frame sent by a first terminal according to the present application. Referring to fig. 2, after receiving a data frame 201 having the structure shown in fig. 1 and transmitted by a first terminal, a second terminal transmits an ACK frame 202 to the first terminal after a Short interframe space (SIFS).
The improvement of data throughput of a single Basic Service Set (BSS) is an urgent problem to be solved at present, and technologies for improving data throughput of a BSS include a multi-user multiple input and output (MU-Mnro) technology and a multi-frequency channel technology. With these techniques, a first terminal may simultaneously communicate with a plurality of second terminals using multi-channel/multi-path, and thus, data throughput of a BSS may be significantly increased.
However, when the multi-channel is used for communication, the first terminal can perform only one of transmission and reception simultaneously through the multi-channel. For example: when the first terminal uses the first channel and the second channel for communication, the first terminal cannot transmit data on the first channel and receive data on the second channel at the same time, that is, the first terminal can only transmit data on the first channel and the second channel or receive data on the first channel and the second channel at the same time.
Under the above limitation, referring to fig. 3, both the terminal a and the terminal B are the second terminals, and since the time length of the data frame 301 transmitted to the terminal a by the first terminal is shorter than the time length of the data frame 303 transmitted to the terminal B by the first terminal, a collision may occur between the data frame 303 and the ACK frame 302. That is, since the first terminal transmits the data frame 303 to the terminal B while the terminal a transmits the ACK frame 302 to the first terminal, the first terminal may not receive the ACK frame 302 transmitted by the terminal a as described above since the first terminal does not support the simultaneous transceiving behavior.
Because the problem that the data frame and the ACK frame collide when the lengths of the data frames sent by the first terminal to the plurality of second terminals are different, if the situation that after the data frames are received by the second terminals, the ACK frames are sent to the first terminal at the same time point is guaranteed, the problem that the ACK frames cannot be received due to the collision of the data frames and the ACK frames cannot occur. With this as the entry point, this application proposes two kinds of solutions thinking:
the first solution idea is as follows: the first terminal obtains the lengths of a plurality of data frames to be sent, because the receiving time corresponding to the data frame with the longest length is the longest, and the time point when the target terminal returns the ACK frame is the latest, for convenience of description, the second terminal corresponding to the data frame with the longest length is called the target terminal, so that the sending time points of other data frames can be delayed by taking the data frame with the longest length as a reference, so that the time points when the other second terminals receive the data frame are the same as the time points when the target terminal receives the data frame, as shown in fig. 2, after each second terminal receives the data frame, the ACK frame is sent to the first terminal after SIFS, and therefore, the time points when each second terminal sends the ACK frame to the first terminal are the same, and the problem of collision between the data frame and the ACK frame as shown in fig. 3 cannot occur.
The second solution idea is as follows: when the lengths of the data frames transmitted by the first terminal to the plurality of second terminals are different, although the time points at which the data frames are received by the respective second terminals are different, the respective second terminals may transmit the ACK frames to the first terminal at the same time point. Specifically, as described above, the data frame received by the target terminal is the data frame with the longest length, so that the time point when the target terminal receives the data frame is the latest, and the time point when the target terminal sends the ACK frame to the first terminal is also the latest, and the time point when other second terminals send the ACK frame to the first terminal may be delayed with the time point when the target terminal sends the ACK frame to the first terminal as a reference, so that the time points when the second terminals send the ACK frame to the first terminal are the same, thereby avoiding the problem of collision between the data frame and the ACK frame as shown in fig. 3.
The first terminal in the present application may be an Access Point (AP) and the second terminal may be a Station (STA).
The following describes in detail specific implementations corresponding to the above two solutions according to specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.
Example one
Fig. 4 is a flowchart illustrating a first embodiment of a data transmission method provided in the present application. As shown in fig. 4, the data transmission method provided in this embodiment includes:
s401, the first terminal determines the sending time point of each data frame according to the length of each data frame in a plurality of data frames to be sent.
As described above, the multiple frequency channel technique supports a first terminal to communicate with multiple second terminals simultaneously using multiple channels. After the first terminal acquires a plurality of data frames to be transmitted to a plurality of second terminals, the transmission time point of each data frame can be determined in the following way:
firstly, acquiring a data frame with the longest length from a plurality of data frames to be transmitted, and then acquiring the transmission time difference between the data frame with the longest length and a first data frame, wherein the first data frame is any data frame except the data frame with the longest length in the plurality of data frames to be transmitted; and determining the transmission time point of the first data frame according to the transmission time point of the data frame with the longest length and the transmission time difference.
It should be noted that: the sending time point of the data frame with the longest length may be specified, for example, the Xs after the first terminal receives all the data frames to be sent may be specified as the sending time point of the data frame with the longest length.
In a possible implementation manner, the first terminal may obtain a length difference between the data frame with the longest length and the first data frame, and determine the sending time difference according to the length difference and the data transmission rate.
S402, according to the sending time point of each data frame, sending the data frame to the corresponding second terminal.
And S403, the second terminal sends the ACK frame to the first terminal.
The following illustrates the above-described S401-S403 processes:
referring to fig. 5, both terminal a and terminal B are the second terminals, and the first terminal is about to send data frame 301 to terminal a, and the first terminal is about to send data frame 303 to terminal B. The first terminal finds the data frame 303 with the longest length from the data frame 301 and the data frame 303, specifies a time point a in fig. 5 as a point of time when the first terminal sends the data frame 303, calculates a length difference between the data frame 303 and the data frame 301, divides the length difference by a data transmission rate to obtain a sending time difference between the data frame 303 and the data frame 301, uses a time point B corresponding to the time point a delayed by the sending time difference as a time point when the first terminal sends the data frame 301, because the first terminal delays the sending time point of the data frame 301, a time point when the terminal a receives the data frame 301 and a time point when the terminal B receives the data frame 303 are the same, because the terminal a sends the ACK frame 302 to the first terminal after SIFS after receiving the data frame 301, the terminal B sends the ACK frame 304 to the first terminal after SIFS, that is, the ACK frame a and the terminal B send the ACK frame 302 and the ACK frame 304 to the first terminal simultaneously, and the problem that the ACK frame 304 cannot be collided with the ACK frame in fig. 3 is avoided.
In the data transmission method provided in this embodiment, the first terminal obtains the lengths of multiple data frames to be transmitted, and because the receiving time corresponding to the data frame with the longest length is longest, the sending time points of other data frames are delayed based on the data frame with the longest length, so that the time points at which the second terminals receive the data frames are the same, and the time points at which the second terminals send ACK frames to the first terminal are also the same, thereby avoiding the problem of collision between the data frames and the ACK frames as shown in fig. 3.
Example two
Fig. 6 is a flowchart illustrating a second embodiment of a data transmission method provided in the present application. As shown in fig. 6, the data transmission method provided in this embodiment includes:
s601, the first terminal determines the time point of each second terminal returning the ACK frame according to the length of each data frame in a plurality of data frames to be sent.
After the first terminal acquires a plurality of data frames to be sent to a plurality of second terminals, the time point of each second terminal returning the ACK frame can be determined in the following way:
acquiring a data frame with the longest length from a plurality of data frames to be transmitted, and for convenience of description, a second terminal corresponding to the data frame with the longest length is called a target terminal in the application; determining the time point of the target terminal for returning the ACK frame according to the length of the data frame with the longest length; acquiring the time difference of ACK frames returned by a third terminal and a target terminal, wherein the third terminal is any one of a plurality of second terminals except the target terminal; and determining the time point of the third terminal for returning the ACK frame according to the time difference between the time point of the target terminal for returning the ACK frame and the time point of the ACK frame.
Optionally, the time point when the target terminal returns the ACK frame may be after SIFS is started when the target terminal receives the data frame.
In a possible implementation manner, the first terminal may obtain a length difference between a data frame with the longest length and a first data frame, where the first data frame is a data frame corresponding to the third terminal; and determining the time difference of the returned acknowledgement frame according to the length difference and the data transmission rate.
S602, the first terminal adds the time point of each second terminal returning the ACK frame into the corresponding data frame.
In one possible implementation, the first terminal may add a time point at which each second terminal returns an acknowledgement frame to the padding field of the corresponding data frame.
S603, the first terminal sends corresponding data frames to a plurality of second terminals.
S604, the second terminal reads the time point of the return acknowledgement frame from the received data frame.
And S605, the second terminal sends the ACK frame to the first terminal according to the read time point of the returned acknowledgement frame.
The following exemplifies the procedure of S601 to S605 described above:
referring to fig. 7, a first terminal is about to transmit a data frame 301 to a terminal a, and a first terminal is about to transmit a data frame 303 to a terminal B. The first terminal finds the data frame 303 with the longest length from the data frame 301 and the data frame 303, takes the time point A after the SIFS is received by the terminal B from the data frame 303 as the time point when the ACK frame is returned by the terminal B, calculates the length difference between the data frame 303 and the data frame 301, divides the length difference by the data transmission rate to obtain the time difference when the ACK frame is returned by the terminal A and the terminal B, and takes the time point after the SISF is added with the time difference from the time point B when the data frame 301 is received by the terminal A as the time point when the ACK frame is returned by the terminal A equipment. Referring to fig. 7, from time point B, the time point after SISF adds the time difference is exactly time point a, that is, terminal a and terminal B simultaneously transmit ACK frame 302 and ACK frame 304 to the first terminal, so as to avoid the problem that the ACK frame cannot be received by the first terminal due to collision between the data frame and the ACK frame in fig. 3.
According to the data transmission method provided by the embodiment of the application, the time point of sending the ACK frame to the first terminal by the target terminal is taken as a reference, the time points of sending the ACK frame to the first terminal by other second terminals are delayed, so that the time points of sending the ACK frame to the first terminal by each second terminal are the same, and the problem of collision between the data frame and the ACK frame shown in fig. 3 is avoided.
Fig. 8 is a first schematic structural diagram of a first terminal provided in the present application. As shown in fig. 8, the first terminal provided by the present application may include:
a determining module 801, configured to determine a sending time point of each data frame according to a length of each data frame in multiple data frames to be sent when the first terminal sends different data frames to multiple second terminals;
a sending module 802, configured to send the data frame to the corresponding second terminal according to the sending time point of each data frame.
Optionally, the determining module 801 is specifically configured to:
acquiring a data frame with the longest length from the plurality of data frames to be transmitted;
acquiring the sending time difference between the data frame with the longest length and a first data frame, wherein the first data frame is any one of the plurality of data frames to be sent except the data frame with the longest length;
and determining the sending time point of the first data frame according to the sending time point of the data frame with the longest length and the sending time difference.
Optionally, the determining module 801 is specifically configured to:
acquiring the length difference between the data frame with the longest length and the first data frame;
and determining the sending time difference according to the length difference and the data transmission rate.
The first terminal shown in fig. 8 may be used to perform the steps performed by the first terminal in the first embodiment. The implementation principle and the technical effect are similar, and are not described in detail herein.
Fig. 9 is a second schematic structural diagram of the first terminal provided in the present application. As shown in fig. 8, the first terminal provided by the present application may include:
a determining module 901, configured to determine, when the first terminal sends different data frames to multiple second terminals, a time point at which each second terminal returns an acknowledgement frame according to a length of each data frame in the multiple data frames to be sent;
an adding module 902, configured to add, to a corresponding data frame, a time point at which each second terminal returns an acknowledgement frame;
a sending module 903, configured to send corresponding data frames to the multiple second terminals.
Optionally, the determining module 901 is specifically configured to:
acquiring a data frame with the longest length from the plurality of data frames to be sent, wherein a second terminal corresponding to the data frame with the longest length is a target terminal;
determining the time point of the target terminal returning an acknowledgement frame according to the length of the data frame with the longest length;
acquiring a time difference between a third terminal and an acknowledgement frame returned by the target terminal, wherein the third terminal is any one of the plurality of second terminals;
and determining the time point of the third terminal for returning the acknowledgement frame according to the time difference between the time point of the target terminal for returning the acknowledgement frame and the time difference of the returned acknowledgement frame.
Optionally, the determining module 901 is specifically configured to:
acquiring the length difference between the data frame with the longest length and a first data frame, wherein the first data frame is a data frame corresponding to the third terminal;
and determining the time difference of the returned acknowledgement frame according to the length difference and the data transmission rate.
Optionally, the adding module 902 is specifically configured to:
and adding the time point of each second terminal returning the acknowledgement frame into the filling field of the corresponding data frame.
The first terminal shown in fig. 9 may be used to perform the steps performed by the first terminal in the second embodiment. The implementation principle and the technical effect are similar, and are not described in detail herein.
Fig. 10 is a schematic structural diagram of a second terminal provided in the present application. As shown in fig. 10, the second terminal provided in the present application may include:
a receiving module 1001, configured to receive a data frame from a first terminal;
a reading module 1002, configured to read a time point of a return acknowledgement frame from the data frame;
a sending module 1003, configured to send an acknowledgement frame to the first terminal according to the time point of the return acknowledgement frame.
Optionally, the reading module 1002 is specifically configured to:
and reading the time point of the return acknowledgement frame from the filling field of the data frame.
The first terminal shown in fig. 10 may be used to perform the steps performed by the second terminal in the second embodiment. The implementation principle and the technical effect are similar, and are not described in detail herein.
Fig. 11 is a schematic structural diagram of a terminal provided in the present application. As shown in fig. 11, the terminal of this embodiment may include:
a memory 1101 for storing program instructions.
A processor 1102 configured to implement the steps performed by the first terminal in the first embodiment, or implement the steps performed by the first terminal in the second embodiment, or implement the steps performed by the second terminal in the second embodiment, when the program instructions are executed. For a specific implementation principle, reference may be made to the above embodiments, which are not described herein again.
The present application provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps performed by the first terminal in embodiment one, or implements the steps performed by the first terminal in embodiment two, or implements the steps performed by the second terminal in embodiment two. For a specific implementation principle, reference may be made to the above embodiments, which are not described herein again.
The present application further provides a program product, which includes a computer program stored in a readable storage medium, from which the computer program can be read by at least one processor, and the at least one processor executes the computer program to enable the terminal to implement the steps performed by the first terminal in the first embodiment, or to implement the steps performed by the first terminal in the second embodiment, or to implement the steps performed by the second terminal in the second embodiment. For a specific implementation principle, reference may be made to the above embodiments, which are not described herein again.
A terminal in the present application may also be referred to as a terminal device or a user equipment.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to perform some steps of the methods according to the embodiments of the present application. And the aforementioned storage medium includes: a U disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should be understood that the Processor described herein may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present application may be embodied directly in a hardware processor, or in a combination of the hardware and software modules in the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.

Claims (14)

1. A data transmission method is applied to a first terminal, and is characterized by comprising the following steps:
when the first terminal sends different data frames to a plurality of second terminals, determining the sending time point of each data frame according to the length of each data frame in a plurality of data frames to be sent;
and sending the data frame to the corresponding second terminal according to the sending time point of each data frame.
2. The method of claim 1, wherein determining a transmission time point of each data frame according to a length of each data frame in a plurality of data frames to be transmitted comprises:
acquiring a data frame with the longest length from the plurality of data frames to be transmitted;
acquiring the sending time difference between the data frame with the longest length and a first data frame, wherein the first data frame is any data frame except the data frame with the longest length in the multiple data frames to be sent;
and determining the sending time point of the first data frame according to the sending time point of the data frame with the longest length and the sending time difference.
3. The method of claim 2, wherein obtaining the transmission time difference between the longest data frame and the first data frame comprises:
acquiring the length difference between the data frame with the longest length and the first data frame;
and determining the sending time difference according to the length difference and the data transmission rate.
4. A data transmission method is applied to a first terminal, and is characterized by comprising the following steps:
when the first terminal sends different data frames to a plurality of second terminals, determining the time point of each second terminal for returning an acknowledgement frame according to the length of each data frame in the plurality of data frames to be sent;
adding the time point of each second terminal returning acknowledgement frame into the corresponding data frame;
and sending corresponding data frames to the plurality of second terminals.
5. The method of claim 4, wherein determining a time point when each second terminal returns an acknowledgement frame according to a length of each of a plurality of data frames to be transmitted comprises:
acquiring a data frame with the longest length from the plurality of data frames to be sent, wherein a second terminal corresponding to the data frame with the longest length is a target terminal;
determining the time point of the target terminal returning an acknowledgement frame according to the length of the data frame with the longest length;
acquiring a time difference between a third terminal and an acknowledgement frame returned by the target terminal, wherein the third terminal is any one of the plurality of second terminals;
and determining the time point of the third terminal for returning the acknowledgement frame according to the time difference between the time point of the target terminal for returning the acknowledgement frame and the time difference of the returned acknowledgement frame.
6. The method of claim 5, wherein obtaining the time difference between the third terminal and the target terminal returning the acknowledgement frame comprises:
acquiring the length difference between the data frame with the longest length and a first data frame, wherein the first data frame is a data frame corresponding to the third terminal;
and determining the time difference of the returned acknowledgement frame according to the length difference and the data transmission rate.
7. The method according to any of claims 4-6, wherein the adding the time point of each second terminal returning acknowledgement frame in the corresponding data frame comprises:
and adding the time point of each second terminal returning the acknowledgement frame into the filling field of the corresponding data frame.
8. A data transmission method is applied to a second terminal, and is characterized by comprising the following steps:
receiving a data frame from a first terminal;
reading a time point of a return acknowledgement frame from the data frame;
and sending an acknowledgement frame to the first terminal according to the time point of the returned acknowledgement frame.
9. The method of claim 8, wherein reading a point in time of a return acknowledgement frame from the data frame comprises:
and reading the time point of the return acknowledgement frame from the filling field of the data frame.
10. A terminal device, comprising:
the determining module is used for determining the sending time point of each data frame according to the length of each data frame in a plurality of data frames to be sent when the first terminal sends different data frames to a plurality of second terminals;
and the sending module is used for sending the data frames to the corresponding second terminal according to the sending time point of each data frame.
11. A terminal device, comprising:
the determining module is used for determining a time point when each second terminal returns an acknowledgement frame according to the length of each data frame in a plurality of data frames to be sent when the first terminal sends different data frames to the plurality of second terminals;
the adding module is used for adding the time point of each second terminal returning the acknowledgement frame into the corresponding data frame;
and the sending module is used for sending the corresponding data frames to the plurality of second terminals.
12. A terminal device, comprising:
a receiving module, configured to receive a data frame from a first terminal;
the reading module is used for reading the time point of the returned acknowledgement frame from the data frame;
and the sending module is used for sending the acknowledgement frame to the first terminal according to the time point of the returned acknowledgement frame.
13. A computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, carries out the method of claim 1, claim 4 or claim 8.
14. A terminal device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to implement the method of claim 1, claim 4 or claim 8 via execution of the executable instructions.
CN202110394783.6A 2021-04-13 2021-04-13 Data transmission method and equipment Pending CN115208531A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110394783.6A CN115208531A (en) 2021-04-13 2021-04-13 Data transmission method and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110394783.6A CN115208531A (en) 2021-04-13 2021-04-13 Data transmission method and equipment

Publications (1)

Publication Number Publication Date
CN115208531A true CN115208531A (en) 2022-10-18

Family

ID=83571313

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110394783.6A Pending CN115208531A (en) 2021-04-13 2021-04-13 Data transmission method and equipment

Country Status (1)

Country Link
CN (1) CN115208531A (en)

Similar Documents

Publication Publication Date Title
KR101853015B1 (en) Method and apparatus for wlan
EP3585089A1 (en) Resource mapping method and apparatus for uplink control channel
US10979992B2 (en) Transmission method and access point applied to a cooperative transmission
US20190238353A1 (en) Method for sending/receiving data in a wireless packet communication system in which there is simultaneous communication with various terminals
CN101102245B (en) Wireless communication system, device and method
US10231265B2 (en) Wireless communication apparatus, wireless communication method, wireless communication system, and processor
EP3713122B1 (en) Method for replying with acknowledgement frame, apparatus, and data transmission system
CN105075324A (en) Method and device for generating and transmitting an NDP CF_end control frame in a wireless communication system
EP3758269A2 (en) Physical layer protocol data unit transmission method and apparatus
WO2021158963A1 (en) Fronthaul interface for advanced split-radio access network (ran) systems
EP3934318A1 (en) Communication device, communication method and program
CN111698067A (en) Data transmission method and device
US20110200130A1 (en) Method and apparatus for transmitting/receiving data in mu-mimo system
CN106612159B (en) Confirmation method and device based on service type indication
WO2021134630A1 (en) Uplink delay scheduling method and system, and storage medium
CN110958084B (en) Method and communication equipment for transmitting acknowledgement message
CN115208531A (en) Data transmission method and equipment
US11882479B2 (en) Wireless LAN communication device and wireless LAN communication method
RU2804327C1 (en) Method for indicating ppdu uplink parameters and corresponding device
CN114158067B (en) Method and device for data transmission in private network
EP4354998A1 (en) Communication method and communication apparatus
KR100748693B1 (en) apparatus and method of processing timer in Wireless LAN
CN108604925B (en) Method and device for transmitting data
CN108631827B (en) Uplink data transmission method, terminal and network side equipment
CN115250387A (en) Data transmission method, device and network node

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