WO2015042896A1 - 一种数据传输的方法及设备 - Google Patents

一种数据传输的方法及设备 Download PDF

Info

Publication number
WO2015042896A1
WO2015042896A1 PCT/CN2013/084556 CN2013084556W WO2015042896A1 WO 2015042896 A1 WO2015042896 A1 WO 2015042896A1 CN 2013084556 W CN2013084556 W CN 2013084556W WO 2015042896 A1 WO2015042896 A1 WO 2015042896A1
Authority
WO
WIPO (PCT)
Prior art keywords
channel
sending
receiving
data
transmitting
Prior art date
Application number
PCT/CN2013/084556
Other languages
English (en)
French (fr)
Inventor
杨讯
伍天宇
李云波
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201380078327.4A priority Critical patent/CN105393589B/zh
Priority to PCT/CN2013/084556 priority patent/WO2015042896A1/zh
Priority to EP13894722.1A priority patent/EP3051870B1/en
Priority to CN201910464397.2A priority patent/CN110190937B/zh
Priority to EP19178681.3A priority patent/EP3629620B1/en
Publication of WO2015042896A1 publication Critical patent/WO2015042896A1/zh
Priority to US15/082,906 priority patent/US10129881B2/en
Priority to US16/165,728 priority patent/US10631298B2/en
Priority to US16/825,749 priority patent/US11006420B2/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453Resources in frequency domain, e.g. a carrier in FDMA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829Arrangements specially adapted for the receiver end
    • H04L1/1854Scheduling and prioritising arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1874Buffer management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1896ARQ related signaling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053Allocation of signaling, i.e. of overhead other than pilot signals
    • H04L5/0055Physical resource allocation for ACK/NACK
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0808Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance

Definitions

  • the invention belongs to the field of communications, and in particular relates to a method and a device for data transmission.
  • the reliability of the wireless channel is a key factor affecting the performance of the wireless communication system.
  • There are various methods for improving the reliability of wireless communication including a method of channel coding with excellent performance, or a method of combining channel coding and modulation, or using the diversity gain.
  • the method of using the channel time-denatured hybrid retransmission is to retransmit the signal in the time-varying channel by using different coding and mapping methods, and the receiving end combines the signal before retransmission and the signal after retransmission. That is, combining multiple independent signals, using diversity to combat the weakness of the wireless channel, and improving the reliability of wireless channel transmission.
  • Different wireless communication systems have different methods for hybrid retransmission using channel time-varying. For example, in a cellular network, each retransmission is recombined, and the diversity gain in the time dimension can be obtained, and the wireless local area network (Wireless local area network) Local Area Networks,
  • the WLAN system adopts a simple retransmission method, that is, the method of repeating transmission in multiple times by the same method. Since the wireless channel is quasi-static, simple retransmission can improve the reliability of transmission, and at the same time, the simplicity of the wireless communication system is ensured.
  • the retransmission mode adopted by the WLAN system is that if the user is in the case of a single user, the transmitting end sends data, and waits for and receives the ACK/block acknowledgment fed back by the receiving end (Block).
  • Ack, BA after receiving the ACK of the data, the sender clears the data in the buffer, and the sender needs to resend the data that is not correctly received by the receiver; if it is in the case of multiple users, the sender Send data and block acknowledgment requests separately for each user (Block Ack Request, BAR), the requesting receiver sends the BA. If the length of the packet exceeds the buffer length, the cache will overflow, resulting in unrecoverable data loss. When multi-user transmission, BAR and BA are sent separately by each user, which brings a large overhead. MAC efficiency is low.
  • a method of data transmission comprising:
  • the transmitting end reserves a first channel for transmitting data, and the second channel is for transmitting an acknowledgement ACK;
  • the sending, by the sending end, the first channel and the second channel including:
  • the transmitting end sends a first channel reserved frame to the receiving end on the first channel, and sends a second channel reserved frame to the receiving end on the second channel, where the first channel reserved frame is used to reserve the first channel a channel, and carrying a time for reserving the first channel, where the second channel reserved frame is used to reserve the second channel, and carries a time for reserving the second channel;
  • Determining, by the transmitting end, whether the first channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end The transmitting end determines whether the second channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end.
  • the method further includes:
  • the transmitting end carries the maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or carries the maximum buffer capacity in the preamble, or carries the maximum in the capability domain a buffer capacity, where the maximum buffer size is used by the receiving end to determine the latest time to send an ACK corresponding to the data to the sending end.
  • the sending by using the first channel, the data to the receiving end, including:
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • the receiving end is after the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and the maximum buffer is sent to the sending end. Sending an ACK to the sending end before the time of the capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • the data is sent to the receiving end on the reserved first channel, and the number of the receiving ends is increased. , including:
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple The receiving end does not support the uplink multi-user transmission, and after receiving the response request frame, the multiple receiving ends respectively send the sending end to the multiple receiving ends according to the sending end carried by the preamble
  • the rate value of the data is used to calculate the time that the multiple receiving ends correspond to the maximum buffer capacity of the sending end, and the plurality of receiving ends are the largest cache of the arriving transmitting end corresponding to the multiple receiving ends.
  • the transmitting end receives an ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the data is sent to the receiving end on the reserved first channel, and the number of the sending ends is increased. , including:
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • Late time The receiving end simultaneously sends an acknowledgement ACK to the multiple sending ends by means of downlink multi-user transmission before the minimum time of reaching the maximum buffer capacity of the multiple sending ends; or, the multiple sending ends respectively Sending, to the receiving end, a latest time corresponding to each transmitting end, the receiving end receiving the latest time, and the receiving end is to the minimum before the time of reaching the maximum buffer capacity of the multiple sending ends
  • the plurality of transmitting ends simultaneously send the acknowledgement ACK by means of the downlink multi-user transmission; or the receiving end separately calculates the rate value according to the rate at which the plurality of transmitting ends carried by the preamble send the data to the receiving end a time corresponding to a maximum buffer capacity of the plurality of transmitting ends corresponding to the multiple sending ends, and the receiving end sends an acknowledgement
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • the data is sent to the receiving end on the reserved first channel, and the number of the sending ends is increased.
  • the number of the receiving ends is plural, including:
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • a method of data transmission comprising:
  • the sending end sends data and a maximum buffer capacity to the receiving end, where the maximum buffering capacity is a latest time for the receiving end to determine to send an acknowledgement ACK corresponding to the data to the sending end;
  • the sending end receives an ACK sent by the receiving end according to the maximum buffer capacity.
  • a third aspect is a method of data transmission, the method comprising:
  • the receiving end reserves a first channel for transmitting data, and the second channel is for transmitting an acknowledgement ACK;
  • the receiving end reserving the first channel and the second channel including:
  • the method further includes:
  • the transmitting end carries the maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or carries the maximum buffer capacity in the preamble, or carries the maximum in the capability domain a buffer capacity, where the maximum buffer size is used by the receiving end to determine the latest time to send an ACK corresponding to the data to the sending end.
  • the data that is sent by the receiving and sending end on the first channel includes:
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • the receiving end is after the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and the maximum buffer is sent to the sending end. Sending an ACK to the sending end before the time of the capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • the receiving the data sent by the sending end on the first channel, the number of the receiving end is , including:
  • the transmitting end sends the data to the plurality of receiving ends by using a downlink multi-user transmission manner on the reserved first channel;
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple The receiving end does not support the uplink multi-user transmission, and after receiving the response request frame, the multiple receiving ends respectively send the sending end to the multiple receiving ends according to the sending end carried by the preamble
  • the rate value of the data is used to calculate the time that the multiple receiving ends correspond to the maximum buffer capacity of the sending end, and the plurality of receiving ends are the largest cache of the arriving transmitting end corresponding to the multiple receiving ends.
  • the transmitting end receives an ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the receiving the data sent by the sending end on the first channel, the number of the sending end is , including:
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • Late time The receiving end simultaneously sends an acknowledgement ACK to the multiple sending ends by means of downlink multi-user transmission before the minimum time of reaching the maximum buffer capacity of the multiple sending ends; or, the multiple sending ends respectively Sending, to the receiving end, a latest time corresponding to each transmitting end, the receiving end receiving the latest time, and the receiving end is to the minimum before the time of reaching the maximum buffer capacity of the multiple sending ends
  • the plurality of transmitting ends simultaneously send the acknowledgement ACK by means of the downlink multi-user transmission; or the receiving end separately calculates the rate value according to the rate at which the plurality of transmitting ends carried by the preamble send the data to the receiving end a time corresponding to the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends, and the receiving end sends an acknowledgement ACK to the
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • the receiving the data sent by the sending end on the first channel is The number of the receiving ends is plural, including:
  • the plurality of transmitting ends send data to the plurality of receiving ends by means of cooperative transmission on the first channel;
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • a fourth aspect is a method of data transmission, the method comprising:
  • the receiving end receives the sending data from the transmitting end, and receives the maximum buffer capacity sent by the sending end, where the maximum buffering capacity is the latest time for the receiving end to determine to send the ACK corresponding to the data to the sending end.
  • a fifth aspect a sending end, where the sending end includes:
  • a reservation unit configured to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an acknowledgement ACK;
  • a sending unit configured to send data to the receiving end on the reserved first channel
  • a receiving unit configured to receive, on the reserved second channel, an ACK corresponding to the data sent by the receiving end.
  • the reserved unit is specifically configured to:
  • Determining whether the first channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end where the sending end is configured according to At least one of the response frame of the first channel reserved frame and the response frame of the second channel reserved frame sent by the receiving end determines whether the second channel is successfully reserved.
  • the sending end further includes a carrying unit, where the carrying unit is specifically configured to:
  • the maximum buffer capacity is a latest time for the receiving end to determine to send an ACK corresponding to the data to the sending end.
  • the sending unit is specifically configured to:
  • the receiving unit is specifically configured to:
  • the sending end After the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and before the time of reaching the maximum buffer capacity of the transmitting end Sending an ACK to the sending end; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the sending unit is specifically configured to:
  • the receiving unit is specifically configured to:
  • the transmitting end sends the response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response request frame.
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple receivers
  • the uplink multi-user transmission is not supported, and after the multiple receiving ends receive the response request frame, the multiple receiving ends respectively send the foregoing to the multiple receiving ends according to the sending end that is carried by the preamble
  • the rate value of the data is used to calculate the maximum buffer capacity of the sending end corresponding to the multiple receiving ends, and the plurality of receiving ends correspond to the maximum buffer capacity of the sending end corresponding to the multiple receiving ends.
  • the sending unit, the number of the sending ends is multiple, specifically for:
  • the receiving unit is specifically configured to:
  • the receiving end simultaneously sends an acknowledgement ACK to the multiple sending ends by means of downlink multi-user transmission before the minimum time of reaching the maximum buffer capacity of the multiple sending ends; or, the multiple sending ends respectively Sending, to the receiving end, a latest time corresponding to each transmitting end, the receiving end receiving the latest time, and the receiving end is to the minimum before the time of reaching the maximum buffer capacity of the multiple sending ends
  • the plurality of transmitting ends simultaneously send the acknowledgement ACK by means of the downlink multi-user transmission; or the receiving end separately calculates the rate value according to the rate at which the plurality of transmitting ends carried by the preamble send the data to the receiving end a time corresponding to the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends, and the receiving end sends an acknowledgement ACK to the multiple sending ends before the time
  • the number of the sending ends is multiple, and the number of the receiving ends is multiple, the sending unit, Specifically used for:
  • the receiving unit is specifically configured to:
  • the multiple receiving ends sending, by the polling method, the response request frame corresponding to the data on the reserved second channel, the multiple receiving ends receiving the response request frame and after the SIFS to the multiple sending ends Sending an ACK; or, the multiple transmitting ends request to send an ACK to the receiving end in a limited free contention manner in the second channel; or, the multiple receiving ends respectively use a limited free competition manner
  • the sending end sends an ACK;
  • the carrying unit is further configured to:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • the sending unit is further configured to:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • the sixth aspect is a transmitting end, where the sending end includes:
  • a sending unit configured to send data and a maximum buffer capacity to the receiving end, where the maximum buffer capacity is a latest time for the receiving end to determine to send an acknowledgement ACK corresponding to the data to the sending end;
  • a receiving unit configured to receive an ACK sent by the receiving end according to the maximum buffer capacity.
  • the receiving end includes:
  • a reservation unit configured to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an acknowledgement ACK;
  • a receiving unit configured to receive data sent by the sending end on the first channel
  • a sending unit configured to send an ACK corresponding to the data to the sending end on the reserved second channel.
  • the reserved unit is specifically configured to:
  • the reserved unit is specifically configured to:
  • the maximum buffer capacity is a latest time for the receiving end to determine to send an ACK corresponding to the data to the sending end.
  • the sending unit is specifically configured to:
  • the transmitting end After the second channel idle PCF frame interval PIFS time, or after the preamble short frame interval SIFS time, or after the transmitting end sends the response request frame corresponding to the data, and at the arrival transmitting end Sending an ACK to the sending end before the time of the maximum buffer capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or carrier sense multiple access CSMA;
  • the sending unit, the number of the receiving end is multiple, specifically for:
  • the multiple receiving ends support uplink multi-user transmission, sending a response request frame corresponding to the data on the reserved second channel, after receiving the response request frame, in the multiple receiving Sending an acknowledgment ACK to the sending end by the method of uplink multi-user transmission before the time of reaching the maximum buffer capacity of the transmitting end in the end; or if the multiple receiving ends do not support uplink multi-user transmission,
  • the plurality of receiving ends respectively calculate, according to the rate value of the data sent by the sending end of the preamble to the multiple receiving ends, the corresponding locations of the multiple receiving ends.
  • the time of reaching the maximum buffer capacity of the sending end respectively, sending an acknowledgement ACK to the sending end before the time corresponding to the maximum buffer capacity of the sending end corresponding to the multiple receiving ends; or, in the second channel Sending an ACK to the sender in a limited free competition manner;
  • the sending unit, the number of the sending ends is multiple, specifically:
  • the method further sends an acknowledgement ACK; or the receiving end calculates, according to the rate value of the data sent by the multiple sending ends that are sent by the preamble to the receiving end, respectively, that the multiple sending ends correspond to the multiple The time at which the sender has the maximum buffer capacity, and the receiving end sends an acknowledgement ACK to the plurality of senders before the
  • the number of the sending ends is multiple, and the number of the receiving ends is multiple, and the sending unit is specific. Used for:
  • the polling method Sending, by the polling method, the response request frame corresponding to the data on the reserved second channel, the multiple receiving ends receiving the response request frame and after the SIFS to the multiple sending ends Sending an ACK; or, the plurality of transmitting ends request to send the ACK to the multiple receiving ends in a limited free contention manner in the second channel; or, the multiple receiving ends respectively pass the limited free competition Transmitting an ACK to the multiple sending ends;
  • the receiving end further includes a carrying unit, where the carrying unit is specifically configured to:
  • a receiving end the receiving end includes:
  • the receiving unit is configured to receive the sending data by the sending end, and receive the maximum buffer capacity sent by the sending end, where the maximum buffering capacity is used by the receiving end to determine to send the ACK corresponding to the data to the sending end at the latest. time.
  • a ninth aspect is a communication system comprising the transmitting end according to claims 21-29 and the receiving end according to claims 31-39.
  • a tenth aspect is a communication system comprising the transmitting end according to claim 30 and the receiving end according to claim 40.
  • the method in the embodiment of the present invention reserves the first channel and the second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting ACK; Sending data to the receiving end on a channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining whether the data needs to be cached according to the information carried in the ACK; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end provides the limited buffer capacity.
  • FIG. 1 is a flowchart of a method for data transmission according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a method for reserving a channel according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of efficiency for providing communication efficiency according to an embodiment of the present invention.
  • FIG. 10 is a flow chart of a method for providing communication efficiency provided by the present invention.
  • FIG. 11 is a structural diagram of a device at a transmitting end according to an embodiment of the present invention.
  • FIG. 12 is a structural diagram of a device at a receiving end according to an embodiment of the present invention.
  • FIG. 13 is a structural diagram of a device at a transmitting end according to an embodiment of the present invention.
  • FIG. 14 is a structural diagram of a device at a receiving end according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a method for data transmission according to an embodiment of the present invention. As shown in FIG. 1, the method includes:
  • Step 101 The transmitting end reserves a first channel for transmitting data, and the second channel is used for transmitting an acknowledgement ACK.
  • the specific channel may be a single channel in a specific implementation, or may be multiple consecutive or discrete channels; the second channel may be the basic service group in a specific implementation (Basic) Service Set (BSS) A fixed channel dedicated to transmitting ACKs; it may also be a fixed channel used by the BSS to transmit control frames or management frames (primary) Channel, primary channel, ); may also be a temporary channel, which is known to be available through the channel reservation frame before transmitting data. The channel is released after use.
  • BSS Basic Service Set
  • a fixed channel dedicated to transmitting ACKs it may also be a fixed channel used by the BSS to transmit control frames or management frames (primary) Channel, primary channel, ); may also be a temporary channel, which is known to be available through the channel reservation frame before transmitting data. The channel is released after use.
  • the second channel can be shared by multiple BSSs to further reduce system efficiency.
  • the sender reserves (reserve the Channel) the first channel and the second channel, including:
  • the transmitting end simultaneously sends a first channel reserved frame to the receiver on the first channel, and sends a second channel reserved frame to the receiving end on the second channel, where the first channel reserved frame is used for reservation
  • the first channel carries a time for reserving the first channel
  • the second channel reserved frame is used to reserve the second channel and carries a time for reserving the second channel
  • Determining, by the transmitting end, whether the first channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end The transmitting end determines whether the second channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end.
  • the sending end receives the response frame of the first channel reserved frame sent by the receiving end on the first channel
  • the sending end successfully reserves the first channel
  • the transmitting end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel, and the transmitting end successfully reserves the second channel.
  • the sending end indicates, in the response frame of the first channel reserved frame that is sent by the receiving end, that the receiving end sends the response frame in the second channel
  • the transmitting end successfully reserves the first channel and the second channel; if the sending end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel
  • the receiving end indicates that the receiving end also sends a response frame in the first channel, and the transmitting end successfully reserves the second channel and the first channel.
  • FIG. 2 is a schematic diagram of a method for reserving a channel according to an embodiment of the present invention.
  • a station (Station, STA) 1 is a transmitting end
  • STA2 is a receiving end
  • Channel 1 is a first channel for transmitting data
  • Channel 2 is a second channel for transmitting an ACK.
  • STA1 sends channel reservation frame RTS on Channel1 and Channel2 simultaneously, and requests are sent on different channels (Request to Send, RTS) may be the same or different. If the first RTS is sent on Channel1, the first RTS carries the time of reserving Channel1, and if the second RTS is sent on Channel2, the second RTS carries the reserved Channel2. time. In addition, the RTS also carries the subchannel identifiers in which the other RTSs are transmitted at the same time, so that the receiving end of the RTS can more reliably know all the subchannels transmitting the RTS. If the first channel and the second channel are successfully reserved, STA2 sends a CTS to STA1 through Channel1 and/or Channel2, and the time reserved for the channel may be carried in RTS or CTS or Data or ACK.
  • RTS Resource to Send
  • STA1 If STA2 sends the response frame of RTS on Channel1 and Channel2 at the same time, STA1 successfully reserves Channel1 and Channel2; if STA2 responds only on Channel1 or Channel2, only Channel1 or Channel2 is successfully reserved; if STA2 does not reply any response, then STA1 failed to reserve any channel successfully.
  • the method further includes:
  • the transmitting end carries a maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or in a capability domain (Capability)
  • the maximum buffer capacity is carried in the field, and the maximum buffer capacity is a latest time for the receiving end to determine to send an ACK corresponding to the data to the sending end.
  • the interaction of the capability domain can be done before the data is sent and between the transmitting STA and the receiving STA.
  • the sending end sends data to the receiving end, and sends a maximum buffer capacity to the receiving end, where the maximum buffer capacity is determined by the receiving end.
  • Step 102 The sending end sends data to the receiving end on the reserved first channel.
  • Step 103 The transmitting end receives an ACK corresponding to the data sent by the receiving end on the reserved second channel.
  • the sending, on the first channel reserved, data to the receiving end including:
  • STA1 successfully reserves Channel1 and Channel2, STA1 sends data Data to STA2 on Channel1.
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • STA1 calculates the time when the STA1 carries the data rate value of STA1 and the maximum buffer capacity of STA1 according to the preamble.
  • the maximum buffer capacity carried by STA1 is in the form of the latest time T, STA2 directly receives the T sent by the STA1.
  • the receiving end is in the second channel idle PCF frame interval (PCF Inter-frame) Space, PIFS) time, or at the leading short frame interval (Short Inter-frame) After the time of the Space, SIFS), or after the sending end sends the response request frame corresponding to the data, and sends an ACK to the sending end before the time of reaching the maximum buffer capacity of the transmitting end; or, the receiving End sending an ACK to the sender through a limited free contention or CSMA;
  • PCF Inter-frame PCF Inter-frame Space
  • SIFS leading short frame interval
  • the limited free contention manner is that the designated STA passes the carrier sense multiple access (Carrier Sense Multiple) in the second channel in a certain time range.
  • Carrier Sense Multiple Carrier Sense Multiple
  • the way with Collision Avoidance, CSMA occupies the channel and sends.
  • the CSMA/CA is a method for contending for a channel
  • the STA2 monitors whether the second channel is idle, and the STA2 waits for the second channel to be idle for a distributed frame interval (Distributed) Interframe Space, DIFS), when the STA2 detects that the second channel is not occupied, randomly generates a time value, the time value is a backoff time, and the STA2 is on the second channel.
  • DIFS distributed frame interval
  • the time value is a backoff time
  • STA2 is on the second channel.
  • STA1 sends an ACK corresponding to the data.
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • the sending, on the first channel reserved, data to the receiving end including:
  • the transmitting end sends the data to the plurality of receiving ends by using a downlink multi-user transmission manner on the reserved first channel;
  • FIG. 3 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 simultaneously transmits data Data(2) and Data(3) to STA2 and STA3 by means of downlink multi-user transmission.
  • the multi-user transmission manner may be a downlink multi-user (Multiple) Input Multiple Output (MIMO), or Orthogonal Frequency Division Multiple Access (Orthogonal Frequency Division) Multiplexing Access (OFDMA), the present invention does not limit the transmission mode of a specific multi-user.
  • MIMO Multiple Input Multiple Output
  • OFDMA Orthogonal Frequency Division Multiple Access
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response After requesting the frame, And simultaneously sending an acknowledgement ACK to the sender by using an uplink multi-user transmission method before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or
  • the multiple receiving ends send the data rate to the multiple receiving ends according to the sending end carried by the preamble Calculating, by the value, the time that the plurality of receiving ends correspond to the maximum buffer capacity of the sending end; or if the sending end sends the multiple receiving ends, the multiple receiving ends respectively send the sending end to the sending end The latest time of the ACK corresponding to the data, the multiple receiving ends respectively receiving the corresponding latest time;
  • STA2 calculates the maximum buffer capacity of STA1 according to the rate value R(2) of the data Data(2) sent by STA1 to STA2 and the capacity C(2) of STA1 maximum cache STA2.
  • Time T3 C(3)/R(3), compare T2 and T3, if T2 is smaller than T3, STA2 and STA3 simultaneously send Data(2) and Data(3) responses to STA1 on the second channel before T2.
  • T2 if T2 is greater than T3, STA2 and STA3 simultaneously send Data(2) and Data(3) response frames to STA1 on the second channel before T3.
  • C the maximum buffer capacity
  • STA2 and STA3 calculate the maximum buffer capacity based on the rate value R(2) of the STA1 transmission data Data(2) and the rate value R(3) of the data Data(3).
  • Time T C / (R (2) + R (3)).
  • the multiple receiving ends respectively perform the foregoing according to the transmitting end carried by the preamble Calculating, by the plurality of receiving ends, the rate value of the data, where the multiple receiving ends correspond to the maximum buffer capacity of the sending end, where the multiple receiving ends are corresponding to the multiple receiving ends Sending an acknowledgement ACK to the sender before reaching the maximum buffer capacity of the sender; or
  • STA2 and STA3 calculate T2 and T3, respectively, and STA2 sends an ACK to STA1 before T2, and STA3 sends an ACK to STA1 before T3.
  • the limited free contention manner is that the designated STA passes the carrier sense multiple access (Carrier Sense Multiple) in the second channel in a certain time range.
  • Carrier Sense Multiple Carrier Sense Multiple
  • CSMA Collision Avoidance
  • the specified STA refers to multiple receiving ends of the downlink multi-user transmission; the certain time range refers to the length of time for the second channel reserved by the transmitting end.
  • the STA2 and the STA3 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA2 detects that the second channel is not occupied. A.
  • the second random number B is decremented. If the first random number A is reduced to 0, the STA2 sends an acknowledgement ACK to the STA1, if the second random number B is subtracted. When it reaches 0, STA3 sends an acknowledgement ACK to STA1.
  • the transmitting end receives an ACK corresponding to the data sent by the receiving end on the second channel.
  • the sending, on the first channel reserved, data to the receiving end including:
  • the plurality of transmitting ends send data to the same receiving end by using an uplink multi-user transmission method on the first channel;
  • FIG. 4 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA2 and STA3 are transmitting ends, and STA1 is a receiving end.
  • STA2 sends Data(2) to STA1, and STA3 sends Data(3) to STA1.
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • Late time Simultaneously transmitting an acknowledgement ACK to the multiple senders by means of downlink multi-user transmission before the time of reaching the maximum buffer capacity of the multiple senders; or, the multiple senders respectively send the acknowledgement to the receiver Corresponding to the latest time of each transmitting end, the receiving end receives the latest time; or the receiving end sends the data rate rate to the receiving end according to the plurality of sending ends carried by the preamble respectively Calculating, by the plurality of sending ends, a time that reaches a maximum buffer capacity of the multiple sending ends, where the receiving end sends the multiple sending ends to the multiple sending ends before the time of reaching the maximum buffering capacity of the multiple sending ends Confirm ACK;
  • the STA1 calculates the time T2 to reach the maximum buffer capacity of the STA2 according to the rate value of the STA2 and the maximum buffer capacity of the STA2, and the STA1 calculates the arrival rate of the data according to the rate value of the STA3 and the maximum buffer capacity of the STA3.
  • STA1 sends an ACK to STA2 before T2
  • STA1 sends an ACK to STA3 before T3.
  • the receiving end sends an ACK to the sending end in a limited free contention manner or CSMA in the second channel;
  • the second channel may be used in conjunction with other devices, so the receiving end needs to send an ACK to the transmitting end in a limited free contention manner.
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • the sending, on the first channel reserved, data to the receiving end including:
  • Cooperative Transmission method sends data to multiple receiving ends
  • the method for cooperative transmission may be a joint transmission of sharing all data information and channel information (Joint Transmission, JT), can also be coordinated transmission of only sharing channel information without sharing data information (coordinated Transmission) or interference alignment, the present invention does not limit the specific transmission mode.
  • FIG. 5 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 transmits data Data(1) to STA3, and STA2 transmits data Data(2) to STA4.
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • STA1 sends a response request frame corresponding to Data(1) to STA3 on the second channel
  • STA2 sends a response request frame corresponding to Data(2) to STA4 on the second channel
  • STA3 receives the Data (1).
  • STA4 receives the response request frame corresponding to Data(2) and sends an ACK to STA2 after SIFS.
  • the plurality of transmitting ends determine the order of sending polls by mutually interacting maximum buffer capacity information.
  • the plurality of sending ends request to send an ACK to the receiving end in a limited free contention manner in the second channel, respectively;
  • the STA1 and the STA2 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA1 detects that the second channel is not occupied.
  • A when the STA2 detects that the second channel is not occupied, then decrements the second random number B. If the first random number A is reduced to 0, the STA1 sends a response request frame to the STA3, if the second random number B When it is reduced to 0, STA2 sends a response request frame to STA4.
  • the plurality of receiving ends respectively send an ACK to the sending end in a limited free contention manner
  • the limited free contention mode means that the designated STA occupies and transmits the channel in the CSMA/CA manner in a certain time range in the second channel.
  • the specified STA refers to multiple receiving ends of the cooperative transmission; the certain time range refers to a length of time for the second channel reserved by the transmitting end.
  • the STA3 and the STA4 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA3 detects that the second channel is not occupied. A.
  • the second random number B is decremented. If the first random number A is reduced to 0, the STA3 sends an acknowledgement ACK to the STA1, if the second random number B is subtracted. When it reaches 0, STA4 sends an acknowledgement ACK to STA2.
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the sending end After receiving the ACK corresponding to the data sent by the receiving end, the sending end determines whether it is necessary to clear the data buffered by the sending end according to the content of the ACK. If the content of the ACK is that the receiving end has correctly received the data, the transmitting end clears the data that has been correctly received. If the content of the ACK is that the receiving end does not correctly receive the data, the transmitting end resends the data.
  • the receiving end transmits data in the first channel, and continues to request or wait for receiving ACK in the second channel until all data acknowledgement frames are received or the time for channel reservation ends; the transmitting end is in the first A data acknowledgement frame is sent in the two channels until all data acknowledgement frames have been transmitted or the reserved time has elapsed.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • FIG. 6 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • the sender STA1 is at the MAC.
  • Header carries STA1 plan to start to reserve MAC
  • the time information of the channel where the header is located and the reserved time length information, STA1 receives the data response frame from the receiving STA in the channel and the time; the receiving end STA2 starts to reserve the channel according to the plan and starts again.
  • the ACK is transmitted using the second channel; the second channel can be used by other STAs for data transmission or the like before the time when the plan starts to reserve the channel.
  • STA1 reserves the channel after the time when the plan starts to reserve the channel, all STAs except the transmitting STA and the receiving STA are set with a non-zero network allocation vector (Network). Allocation Vector, NAV) value, the other STAs can no longer initiate data transmission in the channel within the length of time indicated by the NAV value.
  • Network Non-zero network allocation vector
  • the sending STA plans to start to reserve the MAC
  • the time information of the channel on which the header is located and the reserved time length information may also be carried in the channel reserved frame or the preamble sent by the sending STA.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • the transmitting end does not successfully reserve a channel in the second channel when reserving the channel or starting data transmission, for example, the channel is not obtained in a fixed time after the channel reservation frame is sent in the second channel.
  • the sender must instruct the receiver to return to the existing mode of operation.
  • the method for indicating that the receiving end returns to the existing working mode may be to indicate that the second channel is no longer used in the subsequent data transmission.
  • the existing working mode refers to that the transmitting end receives the response of the receiving end to the data in the first channel after transmitting the SIFS of the data in the first channel.
  • FIG. 7 is a schematic diagram of efficiency of transmitting data provided by the prior art.
  • FIG. 8 is a schematic diagram of efficiency for providing communication efficiency according to an embodiment of the present invention.
  • the prior art data channel is 320 MHz.
  • the overhead brought by the present invention is slightly increased compared to the conventional method; but for the case of multiple users, the present invention brings about an obvious improvement in MAC layer efficiency.
  • the data channel of the present invention is 300 MHz and the ACK channel is 20 MHz. In the case of a single user, the transmission time is increased by 8 ⁇ s.
  • the time required for the conventional mode is increased by at least 552 ⁇ s, and if the present invention uses the multi-user transmission mode to feedback the response frame, the time required is still 484 ⁇ s, compared with the conventional method. At least 12.3% of the time overhead is saved, which improves the efficiency of the MAC layer.
  • FIG. 9 is a schematic diagram of efficiency of transmitting data provided by the prior art.
  • AP sender access points
  • AP2 sender access points
  • STA3 is associated with AP2, that is, AP1 does not send a signal to STA3.
  • STA3 has the capability of interference cancellation, can demodulate the interference signal and subtract it from the received signal, and then demodulate the signal received by STA3.
  • the channel of AP1 is Channel. 1 and Channel 2, AP2 channels are Channel 1, Channel 2 and Channel 3.
  • AP1 occupies Channel 1 and Channel 2, but all channels of AP2 are idle.
  • AP2 sends a data signal to STA3 in the data channel.
  • STA3 listens to Channel 1 and Channel. 2 When both are occupied, the signal from AP2 cannot be correctly demodulated, and even if it can be correctly demodulated, the acknowledgment response cannot be sent to AP2.
  • STA3 can pass the channel in the case of being able to cancel based on interference and correct demodulation. 3 returns an acknowledgment ACK response frame to AP2, thereby continuing to effectively utilize channels 1, 2 and 3 to transmit data on the premise that AP1 has utilized Channel 1 and Channel 2.
  • An embodiment of the present invention provides a data transmission method, where the method is to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an ACK; Sending data to the receiving end on the first channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining, according to the information carried in the ACK, whether the data needs to be cached; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end has a limited buffer capacity. Provides the issue of MAC efficiency in wireless systems.
  • FIG. 10 is a flow chart of a method for providing communication efficiency provided by the present invention. As shown in FIG. 10, the method includes:
  • Step 1001 The receiving end reserves a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an acknowledgement ACK.
  • the specific channel may be a single channel or multiple consecutive or discrete channels in a specific implementation; the second channel may be a fixed channel of the BSS dedicated to transmitting ACK in a specific implementation; It may also be a channel fixed by the BSS for transmitting a control frame or a management frame (primary Channel, primary channel, ); may also be a temporary channel, which is known to be available through the channel reservation frame before transmitting data. The channel is released after use.
  • the second channel can be shared by multiple BSSs to further reduce system efficiency.
  • the receiving end reserves the first channel and the second channel, including:
  • the sending end receives the response frame of the first channel reserved frame sent by the receiving end on the first channel
  • the sending end successfully reserves the first channel
  • the transmitting end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel, and the transmitting end successfully reserves the second channel.
  • the sending end indicates, in the response frame of the first channel reserved frame that is sent by the receiving end, that the receiving end sends the response frame in the second channel
  • the transmitting end successfully reserves the first channel and the second channel; if the sending end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel
  • the receiving end indicates that the receiving end also sends a response frame in the first channel, and the transmitting end successfully reserves the second channel and the first channel.
  • FIG. 2 is a schematic diagram of a method for reserving a channel according to an embodiment of the present invention.
  • STA1 is a transmitting end
  • STA2 is a receiving end
  • Channel1 is a first channel for transmitting data
  • Channel2 is a second channel for transmitting an ACK.
  • STA1 sends channel reservation frame RTS on Channel1 and Channel2 at the same time.
  • the RTS on different channels may be the same or different. If the first RTS is sent on Channel1, the first RTS carries the time of reserved Channel1, if it is in Channel2. The second RTS is sent, and the second RTS carries the time reserved for Channel2.
  • the RTS also carries the subchannel identifiers in which the other RTSs are transmitted at the same time, so that the receiving end of the RTS can more reliably know all the subchannels transmitting the RTS. If the first channel and the second channel are successfully reserved, STA2 sends a CTS to STA1 through Channel1 and/or Channel2, and the time reserved for the channel may be carried in RTS or CTS or Data or ACK.
  • STA1 If STA2 sends the response frame of RTS on Channel1 and Channel2 at the same time, STA1 successfully reserves Channel1 and Channel2; if STA2 responds only on Channel1 or Channel2, only Channel1 or Channel2 is successfully reserved; if STA2 does not reply any response, then STA1 failed to reserve any channel successfully.
  • the method further includes:
  • the transmitting end carries a maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or carries the maximum buffer capacity in a capability domain, where the maximum buffer capacity is used for
  • the receiving end determines a latest time when the ACK corresponding to the data is sent to the sending end.
  • the interaction of the capability domain can be done before the data is sent and between the transmitting STA and the receiving STA.
  • the receiving end receives the sending data, and receives the maximum buffer capacity sent by the sending end, where the maximum buffer capacity is determined by the receiving end. Sending the ACK of the ACK corresponding to the data to the sending end, before the latest time, the receiving end may send an ACK to the sending end, thereby solving the problem of losing data due to insufficient buffer in the prior art. .
  • Step 1002 Receive data sent by the sending end on the first channel.
  • Step 1003 Send an ACK corresponding to the data to the sending end on the reserved second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • STA1 successfully reserves Channel1 and Channel2, STA1 sends data Data to STA2 on Channel1.
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • STA1 calculates the time when the STA1 carries the data rate value of STA1 and the maximum buffer capacity of STA1 according to the preamble.
  • the maximum buffer capacity carried by the STA1 is in the form of the latest time when the sending end sends the ACK corresponding to the data, the STA2 directly receives the T sent by the STA1.
  • the receiving end is after the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and the maximum buffer is sent to the sending end. Sending an ACK to the sending end before the time of the capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the limited free contention manner is that the designated STA passes the carrier sense multiple access (Carrier Sense Multiple) in the second channel in a certain time range.
  • Carrier Sense Multiple Carrier Sense Multiple
  • the way with Collision Avoidance, CSMA occupies the channel and sends.
  • the CSMA/CA is a method for contending for a channel, the STA2 monitors whether the second channel is idle, and the STA2 waits for the second channel to be idle for DIFS, when the STA2 listens to the When the two channels are not occupied, a time value is randomly generated, and the time value is a backoff time, and the STA2 sends an ACK corresponding to the data to the STA1 on the second channel.
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the transmitting end sends the data to the plurality of receiving ends by using a downlink multi-user transmission manner on the reserved first channel;
  • FIG. 3 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 simultaneously transmits data Data(2) and Data(3) to STA2 and STA3 by means of downlink multi-user transmission.
  • the multi-user transmission manner may be downlink multi-user MIMO (DL) MU-MIMO) may also be downlink orthogonal frequency division multiple access (OFDMA).
  • DL downlink multi-user MIMO
  • OFDMA orthogonal frequency division multiple access
  • the present invention does not limit the transmission mode of a specific multi-user.
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response After the request frame, the acknowledgement ACK is simultaneously sent to the sender by the uplink multi-user transmission method before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or
  • the multiple receiving ends send the data rate to the multiple receiving ends according to the sending end carried by the preamble Calculating, by the value, the time that the plurality of receiving ends correspond to the maximum buffer capacity of the sending end; or if the sending end sends the multiple receiving ends, the multiple receiving ends respectively send the sending end to the sending end The latest time of the ACK corresponding to the data, the multiple receiving ends respectively receiving the corresponding latest time;
  • STA2 calculates the maximum buffer capacity of STA1 according to the rate value R(2) of the data Data(2) sent by STA1 to STA2 and the capacity C(2) of STA1 maximum cache STA2.
  • Time T3 C(3)/R(3), compare T2 and T3, if T2 is smaller than T3, STA2 and STA3 simultaneously send Data(2) and Data(3) responses to STA1 on the second channel before T2.
  • T2 if T2 is greater than T3, STA2 and STA3 simultaneously send Data(2) and Data(3) response frames to STA1 on the second channel before T3.
  • C the maximum buffer capacity
  • STA2 and STA3 calculate the maximum buffer capacity based on the rate value R(2) of the STA1 transmission data Data(2) and the rate value R(3) of the data Data(3).
  • Time T C / (R (2) + R (3)).
  • the multiple receiving ends respectively perform the foregoing according to the transmitting end carried by the preamble Calculating, by the plurality of receiving ends, the rate value of the data, where the multiple receiving ends correspond to the maximum buffer capacity of the sending end, where the multiple receiving ends are corresponding to the multiple receiving ends Sending an acknowledgement ACK to the sender before reaching the maximum buffer capacity of the sender; or
  • STA2 and STA3 calculate T2 and T3, respectively, and STA2 sends an ACK to STA1 before T2, and STA3 sends an ACK to STA1 before T3.
  • the plurality of receiving ends send an ACK to the sending end in a limited free contention manner in the second channel;
  • the limited free contention manner is that the designated STA passes the carrier sense multiple access (Carrier Sense Multiple) in the second channel in a certain time range.
  • Carrier Sense Multiple Carrier Sense Multiple
  • CSMA Collision Avoidance
  • the specified STA refers to multiple receiving ends of the downlink multi-user transmission; the certain time range refers to the length of time for the second channel reserved by the transmitting end.
  • the STA2 and the STA3 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA2 detects that the second channel is not occupied. A.
  • the second random number B is decremented. If the first random number A is reduced to 0, the STA2 sends an acknowledgement ACK to the STA1, if the second random number B is subtracted. When it reaches 0, STA3 sends an acknowledgement ACK to STA1.
  • the transmitting end receives an ACK corresponding to the data sent by the receiving end on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the plurality of transmitting ends send data to the same receiving end by using an uplink multi-user transmission method on the first channel;
  • FIG. 4 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA2 and STA3 are transmitting ends, and STA1 is a receiving end.
  • STA2 sends Data(2) to STA1, and STA3 sends Data(3) to STA1.
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends. Late time, Simultaneously transmitting an acknowledgement ACK to the multiple senders by means of downlink multi-user transmission before the time of reaching the maximum buffer capacity of the multiple senders; or, the multiple senders respectively send the acknowledgement to the receiver Corresponding to the latest time of each transmitting end, the receiving end receives the latest time; or
  • the receiving end calculates, according to the rate value of the data sent by the multiple sending ends of the preamble to the receiving end, the time of reaching the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • the receiving end sends an acknowledgement ACK to the multiple senders before the time of reaching the maximum buffer capacity of the multiple senders;
  • the STA1 calculates the time T2 to reach the maximum buffer capacity of the STA2 according to the rate value of the STA2 and the maximum buffer capacity of the STA2, and the STA1 calculates the arrival rate of the data according to the rate value of the STA3 and the maximum buffer capacity of the STA3.
  • STA1 sends an ACK to STA2 before T2
  • STA1 sends an ACK to STA3 before T3.
  • the receiving end sends an ACK to the sending end in a manner of limited free contention or CSMA in the second channel;
  • the second channel may be used in conjunction with other devices, so the receiving end needs to send an ACK to the transmitting end in a limited free contention manner.
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the plurality of transmitting ends send data to the plurality of receiving ends by means of cooperative transmission on the first channel;
  • the method for cooperative transmission may be a joint transmission of sharing all data information and channel information (Joint Transmission), which can also be coordinated transmission of only sharing channel information without sharing data information (coordinated) Transmission) or interference alignment, the present invention does not limit the specific transmission mode.
  • FIG. 5 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 transmits data Data(1) to STA3, and STA2 transmits data Data(2) to STA4.
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • STA1 sends a response request frame corresponding to Data(1) to STA3 on the second channel
  • STA2 sends a response request frame corresponding to Data(2) to STA4 on the second channel
  • STA3 receives the Data (1).
  • STA4 receives the response request frame corresponding to Data(2) and sends an ACK to STA2 after SIFS.
  • the plurality of transmitting ends determine the order of sending polls by mutually interacting maximum buffer capacity information.
  • the plurality of transmitting ends request to send an ACK to the receiving end in a limited free contention manner in the second channel;
  • the STA1 and the STA2 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA1 detects that the second channel is not occupied.
  • A when the STA2 detects that the second channel is not occupied, then decrements the second random number B. If the first random number A is reduced to 0, the STA1 sends a response request frame to the STA3, if the second random number B When it is reduced to 0, STA2 sends a response request frame to STA4.
  • the plurality of receiving ends respectively send an ACK to the sending end in a limited free contention manner
  • the limited free contention mode means that the designated STA occupies and transmits the channel in the CSMA/CA manner in a certain time range in the second channel.
  • the specified STA refers to multiple receiving ends of the cooperative transmission; the certain time range refers to a length of time for the second channel reserved by the transmitting end.
  • the STA3 and the STA4 listen to the second channel and respectively generate a first random number A and a second random number B, and decrement the first random number when the STA3 detects that the second channel is not occupied. A.
  • the second random number B is decremented. If the first random number A is reduced to 0, the STA3 sends an acknowledgement ACK to the STA1, if the second random number B is subtracted. When it reaches 0, STA4 sends an acknowledgement ACK to STA2.
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the sending end receives the ACK corresponding to the data sent by the receiving end, it is determined according to the content of the ACK whether the data buffered by the sending end needs to be cleared. If the content of the ACK is that the receiving end has correctly received the data, the transmitting end clears the data that has been correctly received. If the content of the ACK is that the receiving end does not correctly receive the data, the transmitting end resends the data.
  • the receiving end transmits the data in the first channel, and continues to request or wait for receiving the ACK in the second channel until all the data acknowledgement frames are received or the channel reservation time ends; the transmitting end sends the data in the second channel.
  • the frame is acknowledged until all data acknowledgement frames have been sent or the reserved time has elapsed.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • FIG. 6 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • the sender STA1 is at the MAC.
  • Header carries STA1 plan to start to reserve MAC
  • the time information of the channel where the header is located and the reserved time length information, STA1 receives the data response frame from the receiving STA in the channel and the time; the receiving end STA2 starts to reserve the channel according to the plan and starts again.
  • the ACK is transmitted using the second channel; the second channel can be used by other STAs for data transmission or the like before the time when the plan starts to reserve the channel.
  • STA1 reserves the channel after the time when the plan starts to reserve the channel, all STAs except the transmitting STA and the receiving STA are set with a non-zero NAV value within the length of time indicated by the NAV value. The other STAs can no longer initiate data transmission in the channel.
  • the sending STA plans to start to reserve the MAC
  • the time information of the channel on which the header is located and the reserved time length information may also be carried in the channel reserved frame or the preamble sent by the sending STA.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • the transmitting end does not successfully reserve a channel in the second channel when reserving the channel or starting data transmission, for example, the channel is not obtained in a fixed time after the channel reservation frame is sent in the second channel.
  • the sender must instruct the receiver to return to the existing mode of operation.
  • the method for indicating that the receiving end returns to the existing working mode may be to indicate that the second channel is no longer used in the subsequent data transmission.
  • the existing working mode refers to that the transmitting end receives the response of the receiving end to the data in the first channel after transmitting the SIFS of the data in the first channel.
  • FIG. 9 is a schematic diagram of efficiency of transmitting data provided by the prior art.
  • STA3 is associated with AP2, that is, AP1 does not send a signal to STA3.
  • STA3 has the capability of interference cancellation, can demodulate the interference signal and subtract it from the received signal, and then demodulate the signal received by STA3.
  • the channel of AP1 is Channel. 1 and Channel 2, AP2 channels are Channel 1, Channel 2 and Channel 3.
  • AP1 occupies Channel 1 and Channel 2, but all channels of AP2 are idle.
  • AP2 sends a data signal to STA3 in the data channel.
  • STA3 listens to Channel 1 and Channel. 2 When both are occupied, the signal from AP2 cannot be correctly demodulated, and even if it can be correctly demodulated, the acknowledgment response cannot be sent to AP2.
  • STA3 can pass the channel in the case of being able to cancel based on interference and correct demodulation. 3 returns an acknowledgment ACK response frame to AP2, thereby continuing to effectively utilize channels 1, 2 and 3 to transmit data on the premise that AP1 has utilized Channel 1 and Channel 2.
  • An embodiment of the present invention provides a data transmission method, where the method is to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an ACK; Sending data to the receiving end on the first channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining, according to the information carried in the ACK, whether the data needs to be cached; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end has a limited buffer capacity. Provides the issue of MAC efficiency in wireless systems.
  • FIG. 11 is a structural diagram of a device at a transmitting end according to an embodiment of the present invention.
  • the sending end includes:
  • a reservation unit 1101 configured to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an acknowledgement ACK;
  • the specific channel may be a single channel or multiple consecutive or discrete channels in a specific implementation; the second channel may be a fixed channel of the BSS dedicated to transmitting ACK in a specific implementation; It may also be a channel fixed by the BSS for transmitting a control frame or a management frame (primary Channel, primary channel, ); may also be a temporary channel, which is known to be available through the channel reservation frame before transmitting data. The channel is released after use.
  • the second channel can be shared by multiple BSSs to further reduce system efficiency.
  • the reservation unit 1101 is specifically configured to:
  • Determining whether the first channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end where the sending end is configured according to At least one of the response frame of the first channel reserved frame and the response frame of the second channel reserved frame sent by the receiving end determines whether the second channel is successfully reserved.
  • the sending end receives the response frame of the first channel reserved frame sent by the receiving end on the first channel
  • the sending end successfully reserves the first channel
  • the transmitting end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel, and the transmitting end successfully reserves the second channel.
  • the sending end indicates, in the response frame of the first channel reserved frame that is sent by the receiving end, that the receiving end sends the response frame in the second channel
  • the transmitting end successfully reserves the first channel and the second channel; if the sending end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel
  • the receiving end indicates that the receiving end also sends a response frame in the first channel, and the transmitting end successfully reserves the second channel and the first channel.
  • FIG. 2 is a schematic diagram of a method for reserving a channel according to an embodiment of the present invention.
  • STA1 is a transmitting end
  • STA2 is a receiving end
  • Channel1 is a first channel for transmitting data
  • Channel2 is a second channel for transmitting an ACK.
  • STA1 sends channel reservation frame RTS on Channel1 and Channel2 at the same time.
  • the RTS on different channels may be the same or different. If the first RTS is sent on Channel1, the first RTS carries the time of reserved Channel1, if it is in Channel2. The second RTS is sent, and the second RTS carries the time reserved for Channel2.
  • the RTS also carries the subchannel identifiers in which the other RTSs are transmitted at the same time, so that the receiving end of the RTS can more reliably know all the subchannels transmitting the RTS. If the first channel and the second channel are successfully reserved, STA2 sends a CTS to STA1 through Channel1 and/or Channel2, and the time reserved for the channel may be carried in RTS or CTS or Data or ACK.
  • STA1 If STA2 sends the response frame of RTS on Channel1 and Channel2 at the same time, STA1 successfully reserves Channel1 and Channel2; if STA2 responds only on Channel1 or Channel2, only Channel1 or Channel2 is successfully reserved; if STA2 does not reply any response, then STA1 failed to reserve any channel successfully.
  • the sending end further includes a carrying unit, where the carrying unit is specifically configured to:
  • the maximum buffer capacity is a latest time for the receiving end to determine to send an ACK corresponding to the data to the sending end.
  • the interaction of the capability domain can be done before the data is sent and between the transmitting STA and the receiving STA.
  • the sending unit 1102 is configured to send data to the receiving end on the reserved first channel
  • the receiving unit 1103 is configured to receive, on the reserved second channel, an ACK corresponding to the data sent by the receiving end.
  • the sending unit 1102 is specifically configured to:
  • the receiving unit 1103 is specifically configured to:
  • the sending end After the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and before the time of reaching the maximum buffer capacity of the transmitting end Sending an ACK to the sending end; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • STA1 successfully reserves Channel1 and Channel2, STA1 sends data Data to STA2 on Channel1.
  • the STA1 calculates the time T when the STA1 carries the data rate value of the STA1 and the maximum buffer capacity of the STA1, and calculates the time T when the STA1 maximum buffer capacity is reached.
  • the CSMA/CA is a method for contending for a channel, the STA2 monitors whether the second channel is idle, and the STA2 waits for the second channel to idle for a time of DIFS, when the STA2 listens to the second channel. When occupied, a time value is randomly generated, and the time value is a backoff time, and the STA2 sends an ACK corresponding to the data to the STA1 on the second channel.
  • the sending unit 1102 is specifically configured to:
  • the receiving unit 1103 is specifically configured to:
  • the transmitting end sends the response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response request frame.
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple receivers
  • the uplink multi-user transmission is not supported, and after the multiple receiving ends receive the response request frame, the multiple receiving ends respectively send the foregoing to the multiple receiving ends according to the sending end that is carried by the preamble
  • the rate value of the data is used to calculate the maximum buffer capacity of the sending end corresponding to the multiple receiving ends, and the plurality of receiving ends correspond to the maximum buffer capacity of the sending end corresponding to the multiple receiving ends.
  • FIG. 3 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 simultaneously transmits data Data(2) and Data(3) to STA2 and STA3 by means of downlink multi-user transmission.
  • the multi-user transmission manner may be downlink multi-user MIMO (DL) MU-MIMO) may also be downlink orthogonal frequency division multiple access (OFDMA).
  • DL downlink multi-user MIMO
  • OFDMA orthogonal frequency division multiple access
  • the present invention does not limit the transmission mode of a specific multi-user.
  • the multiple receiving ends respectively send the data rate value calculation manner to the multiple receiving ends according to the sending end carried by the preamble The time at which the plurality of receiving ends correspond to the maximum buffer capacity of the transmitting end; or if the sending end sends the multiple receiving ends to the plurality of receiving ends, respectively, sending the data to the sending end At the latest time of the corresponding ACK, the plurality of receiving ends respectively receive the corresponding latest time;
  • the STA2 and STA3 calculate T2 and T3, respectively, and the STA2 sends an ACK to STA1 before T2, and the STA3 sends an ACK to STA1 before T3.
  • the STA2 and the STA3 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA2 detects that the second channel is not occupied, decrement the first random number A, when The STA3 decrements the second random number B when the second channel is not occupied, and if the first random number A is reduced to 0, the STA2 sends an acknowledgement ACK to the STA1, if the second random number B is reduced to 0. Then STA3 sends an acknowledgement ACK to STA1.
  • the sending unit 1102 is specifically configured to:
  • the receiving unit 1103 is specifically configured to:
  • FIG. 4 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA2 and STA3 are transmitting ends, and STA1 is a receiving end.
  • STA2 sends Data(2) to STA1, and STA3 sends Data(3) to STA1.
  • the STA1 calculates the time T2 to reach the STA2 maximum buffer capacity according to the rate value of the STA2 sending the data and the maximum buffer capacity of the STA2, and the STA1 calculates the maximum buffer capacity of the STA3 according to the rate value of the STA3 sending the data and the maximum buffer capacity of the STA3.
  • STA1 sends an ACK to STA2 before T2
  • STA1 sends an ACK to STA3 before T3.
  • the receiving end sends an ACK to the sending end in a manner of limited free contention or CSMA in the second channel;
  • the second channel may be used in conjunction with other devices, so the receiving end needs to send an ACK to the transmitting end in a limited free contention manner.
  • the sending unit 1102 is specifically configured to:
  • the receiving unit 1103 is specifically configured to:
  • the multiple receiving ends sending, by the polling method, the response request frame corresponding to the data on the reserved second channel, the multiple receiving ends receiving the response request frame and after the SIFS to the multiple sending ends Sending an ACK; or, the multiple transmitting ends request to send an ACK to the receiving end in a limited free contention manner in the second channel; or, the multiple receiving ends respectively use a limited free competition manner
  • the sending end sends an ACK;
  • the method for cooperative transmission may be a joint transmission of sharing all data information and channel information (Joint Transmission), which can also be coordinated transmission of only sharing channel information without sharing data information (coordinated) Transmission) or interference alignment, the present invention does not limit the specific transmission mode.
  • FIG. 5 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 transmits data Data(1) to STA3, and STA2 transmits data Data(2) to STA4.
  • STA1 sends a response request frame corresponding to Data(1) to STA3 on the second channel
  • STA2 sends a response request frame corresponding to Data(2) to STA4 on the second channel
  • STA3 receives the corresponding data(1) corresponding to Data(1).
  • STA4 receives the response request frame corresponding to Data(2) and sends an ACK to STA2 after SIFS.
  • the STA1 and the STA2 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA1 detects that the second channel is not occupied, the first random number A is decremented.
  • the STA2 decrements the second random number B when the second channel is not occupied. If the first random number A is reduced to 0, the STA1 sends a response request frame to the STA3, and if the second random number B is reduced to 0. When STA2 sends a response request frame to STA4.
  • the limited free contention mode means that the designated STA occupies and transmits the channel in the CSMA/CA manner in a certain time range in the second channel.
  • the specified STA refers to multiple receiving ends of the cooperative transmission; the certain time range refers to a length of time for the second channel reserved by the transmitting end.
  • the STA3 and the STA4 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA3 detects that the second channel is not occupied, decrement the first random number A, when The STA4 decrements the second random number B when the second channel is not occupied, and if the first random number A is reduced to 0, the STA3 sends an acknowledgement ACK to the STA1, if the second random number B is reduced to 0. Then STA4 sends an acknowledgement ACK to STA2.
  • the sending end After receiving the ACK corresponding to the data sent by the receiving end, the sending end determines whether it is necessary to clear the data buffered by the sending end according to the content of the ACK. If the content of the ACK is that the receiving end has correctly received the data, the transmitting end clears the data that has been correctly received. If the content of the ACK is that the receiving end does not correctly receive the data, the transmitting end resends the data.
  • the receiving end transmits the data in the first channel, and continues to request or wait for receiving the ACK in the second channel until all the data acknowledgement frames are received or the channel reservation time ends; the transmitting end sends the data in the second channel.
  • the frame is acknowledged until all data acknowledgement frames have been sent or the reserved time has elapsed.
  • the carrying unit is further configured to:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • FIG. 6 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • the sender STA1 is at the MAC.
  • Header carries STA1 plan to start to reserve MAC
  • the time information of the channel where the header is located and the reserved time length information, STA1 receives the data response frame from the receiving STA in the channel and the time; the receiving end STA2 starts to reserve the channel according to the plan and starts again.
  • the ACK is transmitted using the second channel; the second channel can be used by other STAs for data transmission or the like before the time when the plan starts to reserve the channel.
  • STA1 reserves the channel after the time when the plan starts to reserve the channel, all STAs except the transmitting STA and the receiving STA are set with a non-zero NAV value within the length of time indicated by the NAV value. The other STAs can no longer initiate data transmission in the channel.
  • the sending STA plans to start to reserve the MAC
  • the time information of the channel on which the header is located and the reserved time length information may also be carried in the channel reserved frame or the preamble sent by the sending STA.
  • the sending unit 1102 is further configured to:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • the transmitting end does not successfully reserve a channel in the second channel when reserving the channel or starting data transmission, for example, the channel is not obtained in a fixed time after the channel reservation frame is sent in the second channel.
  • the sender must instruct the receiver to return to the existing mode of operation.
  • the method for indicating that the receiving end returns to the existing working mode may be to indicate that the second channel is no longer used in the subsequent data transmission.
  • the existing working mode refers to that the transmitting end receives the response of the receiving end to the data in the first channel after transmitting the SIFS of the data in the first channel.
  • FIG. 9 is a schematic diagram of efficiency of transmitting data provided by the prior art.
  • STA3 is associated with AP2, that is, AP1 does not send a signal to STA3.
  • STA3 has the capability of interference cancellation, can demodulate the interference signal and subtract it from the received signal, and then demodulate the signal received by STA3.
  • the channel of AP1 is Channel. 1 and Channel 2, AP2 channels are Channel 1, Channel 2 and Channel 3.
  • AP1 occupies Channel 1 and Channel 2, but all channels of AP2 are idle.
  • AP2 sends a data signal to STA3 in the data channel.
  • STA3 listens to Channel 1 and Channel. 2 When both are occupied, the signal from AP2 cannot be correctly demodulated, and even if it can be correctly demodulated, the acknowledgment response cannot be sent to AP2.
  • STA3 can pass the channel in the case of being able to cancel based on interference and correct demodulation. 3 returns an acknowledgment ACK response frame to AP2, thereby continuing to effectively utilize channels 1, 2 and 3 to transmit data on the premise that AP1 has utilized Channel 1 and Channel 2.
  • An embodiment of the present invention provides a transmitting end, where the sending end reserves a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting ACK; Sending data to the receiving end on a channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining whether the data needs to be cached according to the information carried in the ACK; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end provides the limited buffer capacity.
  • FIG. 12 is a structural diagram of a device at a receiving end according to an embodiment of the present invention. As shown in FIG. 12, the receiving end includes:
  • a reservation unit 1201 configured to reserve a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting an acknowledgement ACK;
  • the specific channel may be a single channel or multiple consecutive or discrete channels in a specific implementation; the second channel may be a fixed channel of the BSS dedicated to transmitting ACK in a specific implementation; It may also be a channel fixed by the BSS for transmitting a control frame or a management frame (primary Channel, primary channel, ); may also be a temporary channel, which is known to be available through the channel reservation frame before transmitting data. The channel is released after use.
  • the second channel can be shared by multiple BSSs to further reduce system efficiency.
  • the reservation unit 1201 is specifically configured to:
  • the sending end receives the response frame of the first channel reserved frame sent by the receiving end on the first channel
  • the sending end successfully reserves the first channel
  • the transmitting end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel, and the transmitting end successfully reserves the second channel.
  • the sending end indicates, in the response frame of the first channel reserved frame that is sent by the receiving end, that the receiving end sends the response frame in the second channel
  • the transmitting end successfully reserves the first channel and the second channel; if the sending end receives the response frame of the second channel reserved frame sent by the receiving end on the second channel
  • the receiving end indicates that the receiving end also sends a response frame in the first channel, and the transmitting end successfully reserves the second channel and the first channel.
  • FIG. 2 is a schematic diagram of a method for reserving a channel according to an embodiment of the present invention.
  • STA1 is a transmitting end
  • STA2 is a receiving end
  • Channel1 is a first channel for transmitting data
  • Channel2 is a second channel for transmitting an ACK.
  • STA1 sends channel reservation frame RTS on Channel1 and Channel2 at the same time.
  • the RTS on different channels may be the same or different. If the first RTS is sent on Channel1, the first RTS carries the time of reserved Channel1, if it is in Channel2. The second RTS is sent, and the second RTS carries the time reserved for Channel2.
  • the RTS also carries the subchannel identifiers in which the other RTSs are transmitted at the same time, so that the receiving end of the RTS can more reliably know all the subchannels transmitting the RTS. If the first channel and the second channel are successfully reserved, STA2 sends a CTS to STA1 through Channel1 and/or Channel2, and the time reserved for the channel may be carried in RTS or CTS or Data or ACK.
  • STA1 If STA2 sends the response frame of RTS on Channel1 and Channel2 at the same time, STA1 successfully reserves Channel1 and Channel2; if STA2 responds only on Channel1 or Channel2, only Channel1 or Channel2 is successfully reserved; if STA2 does not reply any response, then STA1 failed to reserve any channel successfully.
  • the receiving end further includes a carrying unit, where the carrying unit is specifically configured to:
  • the maximum buffer capacity is a latest time for the receiving end to determine to send an ACK corresponding to the data to the sending end.
  • the interaction of the capability domain can be done before the data is sent and between the transmitting STA and the receiving STA.
  • the receiving unit 1202 is configured to receive data sent by the sending end on the first channel
  • the sending unit 1203 is configured to send an ACK corresponding to the data to the sending end on the reserved second channel.
  • the sending unit 1203 is specifically configured to:
  • the sending end After the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and before the time of reaching the maximum buffer capacity of the transmitting end Sending an ACK to the sending end; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • STA1 successfully reserves Channel1 and Channel2, STA1 sends data Data to STA2 on Channel1.
  • the STA1 calculates the time T when the STA1 carries the data rate value of the STA1 and the maximum buffer capacity of the STA1, and calculates the time T when the STA1 maximum buffer capacity is reached.
  • the CSMA/CA is a method for contending for a channel, the STA2 monitors whether the second channel is idle, and the STA2 waits for the second channel to idle for a time of DIFS, when the STA2 listens to the second channel. When occupied, a time value is randomly generated, and the time value is a backoff time, and the STA2 sends an ACK corresponding to the data to the STA1 on the second channel.
  • the sending unit 1203 is specifically configured to:
  • the response request frame corresponding to the data is sent on the reserved second channel, after the multiple receiving ends receive the response request frame, Simultaneously transmitting an acknowledgement ACK to the sender by using an uplink multi-user transmission method before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or if the multiple receivers do not support Uplink multi-user transmission, after receiving the response request frame, the plurality of receiving ends calculate the rate value of the data according to the sending end of the preamble to the plurality of receiving ends respectively The time at which the receiving end corresponds to the maximum buffer capacity of the transmitting end, respectively, sending an acknowledgement ACK to the sending end before the time corresponding to the maximum buffer capacity of the transmitting end corresponding to the multiple receiving ends; or Transmitting an ACK to the transmitting end in a limited free contention manner in the second channel;
  • FIG. 3 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 simultaneously transmits data Data(2) and Data(3) to STA2 and STA3 by means of downlink multi-user transmission.
  • the multi-user transmission manner may be downlink multi-user MIMO (DL) MU-MIMO) may also be downlink orthogonal frequency division multiple access (OFDMA).
  • DL downlink multi-user MIMO
  • OFDMA orthogonal frequency division multiple access
  • the present invention does not limit the transmission mode of a specific multi-user.
  • the multiple receiving ends respectively send the data rate value calculation manner to the multiple receiving ends according to the sending end carried by the preamble The time at which the plurality of receiving ends correspond to the maximum buffer capacity of the transmitting end; or if the sending end sends the multiple receiving ends to the plurality of receiving ends, respectively, sending the data to the sending end At the latest time of the corresponding ACK, the plurality of receiving ends respectively receive the corresponding latest time;
  • the STA2 and STA3 calculate T2 and T3, respectively, and the STA2 sends an ACK to STA1 before T2, and the STA3 sends an ACK to STA1 before T3.
  • the STA2 and the STA3 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA2 detects that the second channel is not occupied, decrement the first random number A, when The STA3 decrements the second random number B when the second channel is not occupied, and if the first random number A is reduced to 0, the STA2 sends an acknowledgement ACK to the STA1, if the second random number B is reduced to 0. Then STA3 sends an acknowledgement ACK to STA1.
  • the sending unit 1203 is specifically configured to:
  • FIG. 4 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA2 and STA3 are transmitting ends, and STA1 is a receiving end.
  • STA2 sends Data(2) to STA1, and STA3 sends Data(3) to STA1.
  • the STA1 calculates the time T2 to reach the STA2 maximum buffer capacity according to the rate value of the STA2 sending the data and the maximum buffer capacity of the STA2, and the STA1 calculates the maximum buffer capacity of the STA3 according to the rate value of the STA3 sending the data and the maximum buffer capacity of the STA3.
  • STA1 sends an ACK to STA2 before T2
  • STA1 sends an ACK to STA3 before T3.
  • the receiving end sends an ACK to the sending end in a manner of limited free contention or CSMA in the second channel;
  • the second channel may be used in conjunction with other devices, so the receiving end needs to send an ACK to the transmitting end in a limited free contention manner.
  • the sending unit 1203 is specifically configured to:
  • the multiple receiving ends sending, by the polling method, the response request frame corresponding to the data on the reserved second channel, the multiple receiving ends receiving the response request frame and after the SIFS to the multiple sending ends Sending an ACK; or, the multiple transmitting ends request to send an ACK to the receiving end in a limited free contention manner in the second channel; or, the multiple receiving ends respectively use a limited free competition manner
  • the sending end sends an ACK;
  • the method for cooperative transmission may be a joint transmission of sharing all data information and channel information (Joint Transmission), which can also be coordinated transmission of only sharing channel information without sharing data information (coordinated) Transmission) or interference alignment, the present invention does not limit the specific transmission mode.
  • FIG. 5 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • STA1 transmits data Data(1) to STA3, and STA2 transmits data Data(2) to STA4.
  • STA1 sends a response request frame corresponding to Data(1) to STA3 on the second channel
  • STA2 sends a response request frame corresponding to Data(2) to STA4 on the second channel
  • STA3 receives the corresponding data(1) corresponding to Data(1).
  • STA4 receives the response request frame corresponding to Data(2) and sends an ACK to STA2 after SIFS.
  • the STA1 and the STA2 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA1 detects that the second channel is not occupied, the first random number A is decremented.
  • the STA2 decrements the second random number B when the second channel is not occupied. If the first random number A is reduced to 0, the STA1 sends a response request frame to the STA3, and if the second random number B is reduced to 0. When STA2 sends a response request frame to STA4.
  • the limited free contention mode means that the designated STA occupies and transmits the channel in the CSMA/CA manner in a certain time range in the second channel.
  • the specified STA refers to multiple receiving ends of the cooperative transmission; the certain time range refers to a length of time for the second channel reserved by the transmitting end.
  • the STA3 and the STA4 listen to the second channel and respectively generate a first random number A and a second random number B, and when the STA3 detects that the second channel is not occupied, decrement the first random number A, when The STA4 decrements the second random number B when the second channel is not occupied, and if the first random number A is reduced to 0, the STA3 sends an acknowledgement ACK to the STA1, if the second random number B is reduced to 0. Then STA4 sends an acknowledgement ACK to STA2.
  • the sending end After receiving the ACK corresponding to the data sent by the receiving end, the sending end determines whether it is necessary to clear the data buffered by the sending end according to the content of the ACK. If the content of the ACK is that the receiving end has correctly received the data, the transmitting end clears the data that has been correctly received. If the content of the ACK is that the receiving end does not correctly receive the data, the transmitting end resends the data.
  • the receiving end transmits the data in the first channel, and continues to request or wait for receiving the ACK in the second channel until all the data acknowledgement frames are received or the channel reservation time ends; the transmitting end sends the data in the second channel.
  • the frame is acknowledged until all data acknowledgement frames have been sent or the reserved time has elapsed.
  • the receiving end further includes a carrying unit, where the carrying unit is specifically configured to:
  • FIG. 6 is a schematic diagram of a method for data transmission according to an embodiment of the present invention.
  • the sender STA1 is at the MAC.
  • Header carries STA1 plan to start to reserve MAC
  • the time information of the channel where the header is located and the reserved time length information, STA1 receives the data response frame from the receiving STA in the channel and the time; the receiving end STA2 starts to reserve the channel according to the plan and starts again.
  • the ACK is transmitted using the second channel; the second channel can be used by other STAs for data transmission or the like before the time when the plan starts to reserve the channel.
  • STA1 reserves the channel after the time when the plan starts to reserve the channel, all STAs except the transmitting STA and the receiving STA are set with a non-zero NAV value within the length of time indicated by the NAV value. The other STAs can no longer initiate data transmission in the channel.
  • the sending STA plans to start to reserve the MAC
  • the time information of the channel on which the header is located and the reserved time length information may also be carried in the channel reserved frame or the preamble sent by the sending STA.
  • the sending unit 1203 is specifically configured to:
  • the transmitting end does not successfully reserve a channel in the second channel when reserving the channel or starting data transmission, for example, the channel is not obtained in a fixed time after the channel reservation frame is sent in the second channel.
  • the sender must instruct the receiver to return to the existing mode of operation.
  • the method for indicating that the receiving end returns to the existing working mode may be to indicate that the second channel is no longer used in the subsequent data transmission.
  • the existing working mode refers to that the transmitting end receives the response of the receiving end to the data in the first channel after transmitting the SIFS of the data in the first channel.
  • FIG. 9 is a schematic diagram of efficiency of transmitting data provided by the prior art.
  • STA3 is associated with AP2, that is, AP1 does not send a signal to STA3.
  • STA3 has the capability of interference cancellation, can demodulate the interference signal and subtract it from the received signal, and then demodulate the signal received by STA3.
  • the channel of AP1 is Channel. 1 and Channel 2, AP2 channels are Channel 1, Channel 2 and Channel 3.
  • AP1 occupies Channel 1 and Channel 2, but all channels of AP2 are idle.
  • AP2 sends a data signal to STA3 in the data channel.
  • STA3 listens to Channel 1 and Channel. 2 When both are occupied, the signal from AP2 cannot be correctly demodulated, and even if it can be correctly demodulated, the acknowledgment response cannot be sent to AP2.
  • STA3 can pass the channel in the case of being able to cancel based on interference and correct demodulation. 3 returns an acknowledgment ACK response frame to AP2, thereby continuing to effectively utilize channels 1, 2 and 3 to transmit data on the premise that AP1 has utilized Channel 1 and Channel 2.
  • An embodiment of the present invention provides a receiving end, where the receiving end reserves a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting ACK; Sending data to the receiving end on a channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining whether the data needs to be cached according to the information carried in the ACK; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end provides the limited buffer capacity.
  • FIG. 13 is a structural diagram of a device at a transmitting end according to an embodiment of the present invention.
  • FIG. 13 is a transmitting end 1300 according to an embodiment of the present invention.
  • the specific implementation of the sending end 1300 is not limited in the specific embodiment of the present invention.
  • the sending end 1300 includes:
  • Processor 1301 communication interface (Communications) Interface) 1302, memory 1303, bus 1304.
  • the processor 1301, the communication interface 1302, and the memory 1303 complete communication with each other via the bus 1304.
  • the processor 1301 is configured to execute a program.
  • the program can include program code, the program code including computer operating instructions.
  • the processor 1301 may be a central processing unit CPU or a specific integrated circuit ASIC (Application) Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention.
  • ASIC Application Specific Integrated Circuit
  • the memory 1303 is configured to store a program.
  • the memory 1303 may include a high speed RAM memory and may also include a non-volatile memory (non-volatile memory) Memory), such as at least one disk storage.
  • the program specific can include:
  • the transmitting end reserves a first channel for transmitting data, and the second channel is for transmitting an acknowledgement ACK;
  • the transmitting end reserves the first channel and the second channel, including:
  • the transmitting end sends a first channel reserved frame to the receiving end on the first channel, and sends a second channel reserved frame to the receiving end on the second channel, where the first channel reserved frame is used to reserve the first channel a channel, and carrying a time for reserving the first channel, where the second channel reserved frame is used to reserve the second channel, and carries a time for reserving the second channel;
  • Determining, by the transmitting end, whether the first channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end The transmitting end determines whether the second channel is successfully reserved according to at least one of a response frame of the first channel reserved frame and a response frame of the second channel reserved frame sent by the receiving end.
  • the method further includes:
  • the transmitting end carries the maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or carries the maximum buffer capacity in the preamble, or carries the maximum in the capability domain a buffer capacity, where the maximum buffer size is used by the receiving end to determine the latest time to send an ACK corresponding to the data to the sending end.
  • Transmitting the data to the receiving end on the reserved first channel including:
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • the receiving end is after the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and the maximum buffer is sent to the sending end. Sending an ACK to the sending end before the time of the capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • Transmitting the data to the receiving end on the reserved first channel including:
  • the transmitting end sends the data to the plurality of receiving ends by using a downlink multi-user transmission manner on the reserved first channel;
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple The receiving end does not support the uplink multi-user transmission, and after receiving the response request frame, the multiple receiving ends respectively send the sending end to the multiple receiving ends according to the sending end carried by the preamble
  • the rate value of the data is used to calculate the time that the multiple receiving ends correspond to the maximum buffer capacity of the sending end, and the plurality of receiving ends are the largest cache of the arriving transmitting end corresponding to the multiple receiving ends.
  • the transmitting end receives an ACK corresponding to the data sent by the receiving end on the second channel.
  • Transmitting the data to the receiving end on the reserved first channel including:
  • the plurality of transmitting ends send data to the same receiving end by using an uplink multi-user transmission method on the first channel;
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • Late time Simultaneously transmitting an acknowledgement ACK to the multiple senders by means of downlink multi-user transmission before the time of reaching the maximum buffer capacity of the multiple senders; or, the multiple senders respectively send the acknowledgement to the receiver Corresponding to the latest time of each transmitting end, the receiving end receives the latest time; or the receiving end sends the data rate rate to the receiving end according to the plurality of sending ends carried by the preamble respectively Calculating, by the plurality of sending ends, a time that reaches a maximum buffer capacity of the multiple sending ends, where the receiving end sends the multiple sending ends to the multiple sending ends before the time of reaching the maximum buffering capacity of the multiple sending ends Confirm ACK;
  • the receiving end sends an ACK to the sending end in a manner of limited free contention or CSMA in the second channel;
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • Transmitting the data to the receiving end on the reserved first channel including:
  • the plurality of transmitting ends send data to the plurality of receiving ends by means of cooperative transmission on the first channel;
  • Receiving, by the reserved second channel, the ACK corresponding to the data sent by the receiving end including:
  • the plurality of transmitting ends Transmitting, by the plurality of transmitting ends, the response request frame corresponding to the data on the reserved second channel by using a polling method, where the multiple receiving ends receive the response request frame and after the SIFS
  • the plurality of transmitting ends send an ACK in a manner of limited free contention in the second channel, or the plurality of receiving ends respectively pass the ACK; a method of limited free competition to send an ACK to the sender;
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • An embodiment of the present invention provides a transmitting end, where the sending end reserves a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting ACK; Sending data to the receiving end on a channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining whether the data needs to be cached according to the information carried in the ACK; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end provides the limited buffer capacity.
  • FIG. 14 is a structural diagram of a device at a receiving end according to an embodiment of the present invention.
  • FIG. 14 is a receiving end 1400 according to an embodiment of the present invention.
  • the specific implementation of the receiving end 1400 is not limited.
  • the receiving end 1400 includes:
  • Processor 1401 communication interface (Communications) Interface) 1402, memory 1403, bus 1404.
  • the processor 1401, the communication interface 1402, and the memory 1403 complete communication with each other through the bus 1404.
  • a communication interface 1402 configured to communicate with the sending end
  • the processor 1401 is configured to execute a program.
  • the program can include program code, the program code including computer operating instructions.
  • the processor 1401 may be a central processing unit CPU or a specific integrated circuit ASIC (Application) Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention.
  • ASIC Application Specific Integrated Circuit
  • the memory 1403 is configured to store a program.
  • the memory 1403 may include a high speed RAM memory and may also include a non-volatile memory (non-volatile memory) Memory), such as at least one disk storage.
  • the program specific can include:
  • the receiving end reserves a first channel for transmitting data, and the second channel is for transmitting an acknowledgement ACK;
  • the receiving end reserves the first channel and the second channel, including:
  • the method further includes:
  • the transmitting end carries the maximum buffer capacity in at least one of the first channel reserved frame and the second channel reserved frame, or carries the maximum buffer capacity in the preamble, or carries the maximum in the capability domain a buffer capacity, where the maximum buffer size is used by the receiving end to determine the latest time to send an ACK corresponding to the data to the sending end.
  • the data sent by the receiving and sending end on the first channel includes:
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates the time to reach the maximum buffer capacity of the sending end according to the rate value of the data sent by the sending end of the preamble, or the receiving end receives the maximum buffer of the sending end sent by the sending end. Time of capacity;
  • the receiving end is after the second channel idle PIFS time, or after the preamble SIFS time, or after the sending end sends the response request frame corresponding to the data, and the maximum buffer is sent to the sending end. Sending an ACK to the sending end before the time of the capacity; or, the receiving end sends an ACK to the sending end by means of limited free contention or CSMA;
  • the transmitting end receives an ACK corresponding to the data on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the transmitting end sends data to multiple receiving ends by using a downlink multi-user transmission manner on the reserved first channel;
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the plurality of receiving ends receive the data on the first channel
  • the transmitting end sends a response request frame corresponding to the data on the reserved second channel, and the multiple receiving ends receive the response
  • the acknowledgement ACK is simultaneously sent to the sender by the method of uplink multi-user transmission before the minimum of the plurality of receivers reaches the maximum buffer capacity of the sender; or, if the multiple The receiving end does not support the uplink multi-user transmission, and after receiving the response request frame, the multiple receiving ends respectively send the sending end to the multiple receiving ends according to the sending end carried by the preamble
  • the rate value of the data is used to calculate the time that the multiple receiving ends correspond to the maximum buffer capacity of the sending end, and the plurality of receiving ends are the largest cache of the arriving transmitting end corresponding to the multiple receiving ends.
  • the transmitting end receives an ACK corresponding to the data sent by the receiving end on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the plurality of transmitting ends send data to the same receiving end by using an uplink multi-user transmission method on the first channel;
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the receiving end calculates, according to a rate value of the data sent by the multiple sending ends of the preamble to the receiving end, a maximum value of the maximum buffer capacity of the multiple sending ends corresponding to the multiple sending ends.
  • Late time Simultaneously transmitting an acknowledgement ACK to the multiple senders by means of downlink multi-user transmission before the time of reaching the maximum buffer capacity of the multiple senders; or, the multiple senders respectively send the acknowledgement to the receiver Corresponding to the latest time of each transmitting end, the receiving end receives the latest time; or the receiving end sends the data rate rate to the receiving end according to the plurality of sending ends carried by the preamble respectively Calculating, by the plurality of sending ends, a time that reaches a maximum buffer capacity of the multiple sending ends, where the receiving end sends the multiple sending ends to the multiple sending ends before the time of reaching the maximum buffering capacity of the multiple sending ends Confirm ACK;
  • the receiving end sends an ACK to the sending end in a manner of limited free contention or CSMA in the second channel;
  • the plurality of transmitting ends receive an ACK corresponding to the data sent by the receiving end on the second channel.
  • the data sent by the receiving and sending end on the first channel includes:
  • the plurality of transmitting ends send data to the plurality of receiving ends by means of cooperative transmission on the first channel;
  • Sending the ACK corresponding to the data to the sending end on the reserved second channel including:
  • the plurality of transmitting ends Transmitting, by the plurality of transmitting ends, the response request frame corresponding to the data on the reserved second channel by using a polling method, where the multiple receiving ends receive the response request frame and after the SIFS
  • the plurality of transmitting ends send an ACK in a manner of limited free contention in the second channel, or the plurality of receiving ends respectively pass the ACK; a method of limited free competition to send an ACK to the sender;
  • the plurality of transmitting ends receive the ACK corresponding to the data sent by the multiple receiving ends on the second channel.
  • the method further includes:
  • the transmitting end carries a time when the reserved channel starts in at least one of the first channel reserved frame and the second channel reserved frame or the data or the preamble.
  • the method further includes:
  • the transmitting end If the transmitting end does not successfully reserve at least one of the first channel and the second channel, the transmitting end sends an instruction to the receiving end to return to a preset working mode.
  • An embodiment of the present invention provides a receiving end, where the receiving end reserves a first channel and a second channel, where the first channel is used for transmitting data, and the second channel is used for transmitting ACK; Sending data to the receiving end on a channel; receiving an ACK corresponding to the data sent by the receiving end on the reserved second channel, and determining whether the data needs to be cached according to the information carried in the ACK; When the information carried in the ACK is that the receiving end has correctly received the data, the data buffered by the sending end is cleared, and the data is transmitted separately from the ACK to solve the problem that the sending end provides the limited buffer capacity.

Landscapes

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

Abstract

本发明公开了一种数据传输的方法,所述方法通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。

Description

一种数据传输的方法及设备 技术领域
本发明属于通信领域,尤其涉及一种数据传输的方法及设备。
背景技术
无线信道的可靠性是影响无线通信***性能的关键因素,提高无线通信的可靠性有多种方法,包括性能优异的信道编码的方法,或者信道编码和调制联合的方法,或者利用分集增益的空时编码和多天线的接收分集的方法,或者利用信道时变性的混合重传的方法等。其中,利用信道时变性的混合重传的方法是在时变信道中通过对错误部分的信号通过不同的编码和映射方式重传,而接收端将重传前的信号和重传后的信号合并,即合并多个的独立信号,利用分集对抗无线信道的衰弱,提高了无线信道传输的可靠性。
   不同的无线通信***对于利用信道时变性的混合重传有不同的方法,比如蜂窝网络中采用每次重传都重新组合的方法,可以获得时间维度上的分集增益,而无线局域网络(Wireless Local Area Networks, WLAN)***是采用简单重传,即采用同样的方法多次重复传输的方法,由于无线信道为准静态,简单重传就可以提高传输的可靠性,同时也保证了无线通信***的简单性。
   随着用户需求的增加需要不断提高无线通信***可以支撑的吞吐量。由于传输的开销占用时间固定,而提高吞吐量并不能减小开销所占用的时间,因此从时间维度上看,对于固定长度的数据包,***吞吐量的提高会导致媒体接入控制层(Media Access Control,MAC)效率的下降。为了提高吞吐量且保持MAC效率不变,MAC层数据包的长度必须同比例的增大。
   通常的,WLAN***所采用的重传方式是如果是在单用户的情况下,发送端发送数据,等待并接收接收端反馈的ACK/块确认(Block Ack,BA),接收到该数据的ACK之后,发送端清除缓存中的该数据,而对于接收端未正确接收的数据,发送端需要重新发送;如果是在多用户的情况下,则发送端对每个用户单独发送数据和块确认请求(Block Ack Request,BAR),请求接收端发送BA,如果数据包的长度超过缓存长度,缓存就会溢出,造成不可恢复的数据丢失。多用户传输时,BAR和BA是每个用户单独发送,带来的开销大, MAC效率低。
技术问题
本发明的目的在于提供一种数据传输的方法,旨在解决如何在有限的缓存容量情况下提高无线***中MAC效率的问题。
技术解决方案
第一方面,一种数据传输的方法,所述方法包括:
   发送端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   在预留的第一信道上向接收端发送数据;
   在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第一方面,在第一方面的第一种可能的实现方式中,所述发送端预留第一信道和第二信道,包括:
   发送端在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   结合第一方面的第一种可能的实现方式,在第一方面的第二种可能的实现方式中,所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   结合第一方面的第二种可能的实现方式,在第一方面的第三种可能的实现方式中,所述在预留的第一信道上向接收端发送数据,包括:
   所述发送端在预留的第一信道上向接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   所述接收端在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   结合第一方面的第二种可能的实现方式,在第一方面的第四种可能的实现方式中,所述在预留的第一信道上向接收端发送数据,所述接收端的数量有多个,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向所述多个接收端发送据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第一方面的第二种可能的实现方式,在第一方面的第五种可能的实现方式中,所述在预留的第一信道上向接收端发送数据,所述发送端的数量有多个,包括:
   所述多个发送端在第一信道上通过上行多用户传输的方法向接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达所述多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第一方面的第二种可能的实现方式,在第一方面的第六种可能的实现方式中,所述在预留的第一信道上向接收端发送数据,所述发送端的数量有多个,所述接收端的数量有多个,包括:
   所述多个发送端在第一信道上通过协作传输的方法向所述多个接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第一方面的第三种可能的实现方式或者第一方面的第四种可能的实现方式或者第一方面的第五种可能的实现方式或者第一方面的第六种可能的实现方式,在第一方面的第七种可能的实现方式中,所述方法还包括:
   所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   结合第一方面或这第一方面的第一种可能的实现方式或者第一方面的第二种可能的实现方式或者第一方面的第三种可能的实现方式或者第一方面的第四种可能的实现方式或者第一方面的第五种可能的实现方式或者第一方面的第六种可能的实现方式或者第一方面的第七种可能的实现方式,在第一方面的第八种可能的实现方式中,所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   第二方面,一种数据传输的方法,所述方法包括:
   发送端向接收端发送数据和最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的确认ACK的最迟时间;
   所述发送端接收所述接收端根据所述最大缓存容量发送的ACK。
   第三方面,一种数据传输的方法,所述方法包括:
   接收端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   接收发送端在所述第一信道上发送的数据;
   在预留的第二信道上向发送端发送所述数据对应的ACK。
   结合第三方面,在第三方面的第一种可能的实现方式中,所述接收端预留第一信道和第二信道,包括:
   所述接收端在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述接收端向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   结合第三方面的第一种可能的实现方式,在第三方面的第二种可能的实现方式中,所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   结合第三方面的第二种可能的实现方式,在第三方面的第三种可能的实现方式中,所述接收发送端在所述第一信道上发送的数据,包括:
   接收单个发送端在所述第一信道上发送的数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   所述接收端在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   结合第三方面的第二种可能的实现方式,在第三方面的第四种可能的实现方式中,所述接收发送端在所述第一信道上发送的数据,所述接收端的数量有多个,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向多个接收端发送据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第三方面的第二种可能的实现方式,在第三方面的第五种可能的实现方式中,所述接收发送端在所述第一信道上发送的数据,所述发送端的数量有多个,包括:
   所述多个发送端在第一信道上通过上行多用户传输的方法向接收端发送数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第三方面的第二种可能的实现方式,在第三方面的第六种可能的实现方式中,所述接收发送端在所述第一信道上发送的数据,所述发送端的数量有多个,所述接收端的数量有多个,包括:
   多个发送端在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第三方面的第三种可能的实现方式或者第三方面的第四种可能的实现方式或者第三方面的第五种可能的实现方式或者第三方面的第六种可能的实现方式,在第三方面的第七种可能的实现方式中,所述方法还包括:
   所述发送端在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   结合第三方面或这第三方面的第一种可能的实现方式或者第三方面的第二种可能的实现方式或者第三方面的第三种可能的实现方式或者第三方面的第四种可能的实现方式或者第三方面的第五种可能的实现方式或者第三方面的第六种可能的实现方式或者第三方面的第七种可能的实现方式,在第三方面的第八种可能的实现方式中,所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   第四方面,一种数据传输的方法,所述方法包括:
   接收端接收发送端发送数据,并接收所述发送端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   第五方面,一种发送端,所述发送端包括:
   预留单元,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   发送单元,用于在预留的第一信道上向接收端发送数据;
   接收单元,用于在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第五方面,在第五方面的第一种可能的实现方式中,所述预留单元,具体用于:
   在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   结合第五方面的第一种可能的实现方式,在第五方面的第二种可能的实现方式中,所述发送端还包括携带单元,所述携带单元具体用于:
   在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   结合第五方面的第二种可能的实现方式,在第五方面的第三种可能的实现方式中,所述发送单元,具体用于:
   所述发送端在预留的第一信道上向接收端发送数据;
   所述接收单元,具体用于:
   根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   在所述第二信道上接收所述数据对应的ACK。
   结合第五方面的第二种可能的实现方式,在第五方面的第四种可能的实现方式中,所述发送单元,具体用于:
   在预留的第一信道上利用下行多用户传输的方式向所述多个接收端发送据;
   所述接收单元,具体用于:
   在所述第一信道上接收所述数据;
   如果多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第三方面的第二种可能的实现方式,在第三方面的第五种可能的实现方式中,所述发送单元,所述发送端的数量有多个,具体用于:
   在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   所述接收单元,具体用于:
   根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第五方面的第二种可能的实现方式,在第五方面的第六种可能的实现方式中,所述发送端的数量有多个,所述接收端的数量有多个,所述发送单元,具体用于:
   在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述接收单元,具体用于:
   通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第五方面的第三种可能的实现方式或者第五方面的第四种可能的实现方式或者第五方面的第五种可能的实现方式或者第五方面的第六种可能的实现方式,在第五方面的第七种可能的实现方式中,所述携带单元还用于:
   所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   结合第五方面或第五方面的第一种可能的实现方式或者第五方面的第二种可能的实现方式或者第五方面的第三种可能的实现方式或者第五方面的第四种可能的实现方式或者第五方面的第五种可能的实现方式或者第五方面的第六种可能的实现方式或者第五方面的第七种可能的实现方式,在第五方面的第八种可能的实现方式中,所述发送单元还用于:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   第六方面,一种发送端,其特征在于,所述发送端包括:
   发送单元,用于向接收端发送数据和最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的确认ACK的最迟时间;
   接收单元,用于接收所述接收端根据所述最大缓存容量发送的ACK。
   第七方面,所述接收端包括:
   预留单元,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   接收单元,用于接收发送端在所述第一信道上发送的数据;
   发送单元,用于在预留的第二信道上向发送端发送所述数据对应的ACK。
   结合第七方面,在第七方面的第一种可能的实现方式中,所述预留单元,具体用于:
   在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   结合第七方面的第一种可能的实现方式,在第七方面的第二种可能的实现方式中,所述预留单元,具体用于:
   在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   结合第七方面的第二种可能的实现方式,在第七方面的第三种可能的实现方式中,所述发送单元,具体用于:
   根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   在所述第二信道空闲PCF帧间隔PIFS时间之后,或者在所述前导短帧间隔SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者载波监听多址CSMA的方式向所述发送端发送ACK;
   在所述第二信道上接收所述数据对应的ACK。
   结合第七方面的第二种可能的实现方式,在第七方面的第四种可能的实现方式中,所述发送单元,所述接收端的数量有多个,具体用于:
   如果所述多个接收端都支持上行多用户传输,在所述预留的第二信道上发送所述数据对应的响应请求帧,在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第七方面的第二种可能的实现方式,在第七方面的第五种可能的实现方式中,所述发送单元,所述发送端的数量有多个,具体用于:
   根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   结合第七方面的第二种可能的实现方式,在第七方面的第六种可能的实现方式中,所述发送端的数量有多个,所述接收端的数量有多个,所述发送单元具体用于:
   通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   结合第七方面的第三种可能的实现方式或者第七方面的第四种可能的实现方式或者第七方面的第五种可能的实现方式或者第七方面的第六种可能的实现方式,在第七方面的第七种可能的实现方式中,所述接收端还包括携带单元,所述携带单元具体用于:
   在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   结合第七方面或第七方面的第一种可能的实现方式或者第七方面的第二种可能的实现方式或者第七方面的第三种可能的实现方式或者第七方面的第四种可能的实现方式或者第七方面的第五种可能的实现方式或者第七方面的第六种可能的实现方式或者第七方面的第七种可能的实现方式,在第七方面的第八种可能的实现方式中,
   如果发送端未成功预留第一信道和第二信道中的至少一个,则向所述接收端发送返回预先设置的工作模式的指令。
   第八方面,一种接收端,所述接收端包括:
   接收单元,用于接收发送端发送数据,并接收所述发送端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   第九方面,一种通信***,所述通信***包括权利要求21-29所述的发送端和权利要求31-39所述的接收端。
   第十方面,一种通信***,所述通信***包括权利要求30所述的发送端和权利要求40所述的接收端。
有益效果
与现有技术相比,本发明实施例所述方法通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
附图说明
为了更清楚地说明本发明实施例中的技术方案,下面将对实施例中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动性的前提下,还可以根据这些附图获得其他的附图。
   图1是本发明实施例提供的一种数据传输的方法流程图;
   图2是本发明实施例提供的一种预留信道的方法示意图;
   图3是本发明实施例提供的一种数据传输的方法示意图;
   图4是本发明实施例提供的一种数据传输的方法示意图;
   图5是本发明实施例提供的一种数据传输的方法示意图;
   图6是本发明实施例提供的一种数据传输的方法示意图;
   图7是现有技术提供的传输数据的效率示意图;
   图8是本发明实施例提供的一种用于提供通信效率的效率示意图;
   图10是本发明提供的一种用于提供通信效率的方法流程图;
   图11是本发明实施例提供的一种发送端的装置结构图;
   图12是本发明实施例提供的一种接收端的装置结构图;
   图13是本发明实施例提供的一种发送端的装置结构图;
   图14是本发明实施例提供的一种接收端的装置结构图。
本发明的实施方式
为了使本发明的目的、技术方案及优点更加清楚明白,以下结合附图及实施例,对本发明进行进一步详细说明。应当理解,此处所描述的具体实施例仅仅用以解释本发明,并不用于限定本发明。
   以下所述仅为本发明的较佳实施例而已,并不用以限制本发明,凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等,均应包含在本发明的保护范围之内。
   参考图1,图1是本发明实施例提供的一种数据传输的方法流程图。如图1所示,所述方法包括:
   步骤101,发送端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   所述第一信道在具体实现中可以是一个单独的信道,也可以是多个连续或者离散的信道;所述第二信道在具体实现中可以是本基本服务组(Basic Service Set,BSS)固定的专门用于传输ACK的信道;也可以是本BSS固定的用于传输控制帧或管理帧的信道(primary channel,主信道,);也可以是临时信道,在发送数据之前通过信道预留帧才获知该信道可用。使用完毕后即释放该信道。在OBSS的情况下,第二信道可以是多个BSS共用,以进一步降低***效率。
   可选地,所述发送端(transmitter)预留(reserve the channel)第一信道和第二信道,包括:
   发送端同时在第一信道上向接收端(receiver)发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   具体的,若所述发送端在所述第一信道接收到所述接收端发送的所述第一信道预留帧的响应帧,则所述发送端成功预留所述第一信道;若所述发送端在所述第二信道接收到所述接收端发送的所述第二信道预留帧的响应帧,则所述发送端成功预留所述第二信道。若所述发送端在所述第一信道接收到的所述接收端发送的所述第一信道预留帧的响应帧中指示所述接收端也在所述第二信道中发送了响应帧,则所述发送端成功预留了所述第一信道和第二信道;若所述发送端在所述第二信道接收到的所述接收端发送的所述第二信道预留帧的响应帧中指示所述接收端也在所述第一信道中发送了响应帧,则所述发送端成功预留了所述第二信道和第一信道。
   具体的,参考图2,图2是本发明实施例提供的一种预留信道的方法示意图。如图2所示,站台(Station,STA)1是发送端,STA2是接收端,Channel1是第一信道,用于传输数据,Channel2是第二信道,用于传输ACK。
   STA1同时在Channel1和Channel2上发送信道预留帧RTS,在不同信道上的请求发送帧(Request to Send,RTS)可以相同也可以不同,若是在Channel1上发送第一RTS,则该第一RTS携带预留Channel1的时间,若是在Channel2上发送第二RTS,则该第二RTS携带预留Channel2的时间。此外,RTS也要携带同时发送其他RTS所在的子信道标识,令RTS的接收端更可靠的获知发送RTS的所有子信道。若成功预留所述第一信道和所述第二信道则STA2通过Channel1和/或Channel2向STA1发送CTS,所述信道预留的时间可以在RTS或者CTS或者Data或者ACK中携带。
   若STA2同时在Channel1和Channel2上发送RTS的响应帧,则STA1成功预留Channel1和Channel2;若STA2仅在Channel1或者Channel2上响应,则仅成功预留Channel1或者Channel2;若STA2不回复任何响应,则STA1未能成功预留任何信道。
   所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在能力域(Capability Field)中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述能力域的交互可以在数据发送之前,并在发送STA和接收STA之间完成。
   在现有技术中,为了支持数据包的可靠传输,必须具有重传机制。而重传需要发送端在尚未确知数据的接收端正确接收到信号的时候,必须缓存该部分数据内容,导致在数据包的长度增大时,发射端和接收端都必须有足够大的缓存,以确保发送端在发送数据后到正确接收该数据的确认(Acknowledge,ACK)前需要缓存该数据,但是,常为了保证芯片的尺寸,缓存的容量都比较有限,因此,如何避免数据因为缓存不够而丢失的问题有待解决。
   作为另一种可能的实现方式,在现有技术方案的基础上,发送端向接收端发送数据,并向所述接收端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间,在所述最迟时间之前,接收端可以向发送端发送ACK,从而解决现有技术中存在的因为缓存不够而丢失数据的问题。
   步骤102,所述发送端在预留的第一信道上向接收端发送数据;
   步骤103,所述发送端在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述在预留的第一信道上向接收端发送数据,包括:
   所述发送端在预留的第一信道上向接收端发送数据;
   具体的,参考图2,若STA1成功预留Channel1和Channel2,则STA1在Channel1上向STA2发送数据Data。
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
具体的,如果所述发送端携带的最大缓存容量形式为缓存容量值,则STA1根据所述前导携带的STA1向STA2发送数据的速率值和STA1的最大缓存容量计算到达STA1最大缓存容量时的时间T,其方式为若接收端的最大缓存容量为C比特,所述前导携带的速率值为R比特/秒,则所述接收端根据最大缓存容量计算得到的最迟时间为T=C/R。或者如果STA1携带的最大缓存容量的形式为最迟时间T,STA2就直接接收所述STA1发送的所述T。
   所述接收端在所述第二信道空闲PCF帧间隔(PCF Inter-frame Space,PIFS)时间之后,或者在所述前导短帧间隔(Short Inter-frame Space,SIFS)时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   所述有限自由竞争的方式是指定的STA在第二信道中在一定的时间范围内通过载波监听多址(Carrier Sense Multiple with Collision Avoidance,CSMA)的方式占有信道并发送。
   具体的,所述CSMA/CA是竞争信道的方法,所述STA2监听所述第二信道是否空闲,所述STA2等待所述第二信道空闲的时间为分布式帧间隔(Distributed Interframe Space,DIFS),当所述STA2监听到所述第二信道未被占用时,随机生成一个时间值,该时间值为回退时间(backofftime),所述STA2在所述第二信道上向所述STA1发送所述数据对应的ACK。
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   可选地,所述在预留的第一信道上向接收端发送数据,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向多个接收端发送据;
   具体的,参考图3,图3是本发明实施例提供的一种数据传输的方法示意图。如图3所示,假设STA1利用下行多用户传输的方式分别向STA2和STA3同时发送数据Data(2)和Data(3)。所述多用户传输的方式可以是下行多用户(Multiple Input Multiple Output,MIMO),也可以是下行正交频分多址(Orthogonal Frequency Division Multiplexing Access,OFDMA),本发明对具体多用户的传输方式不作限制。
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后, 在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,
   具体的,如果所述发送端携带的最大缓存容量形式为缓存容量值,则所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达发送端最大缓存容量的时间;或者如果所述发送端向所述多个接收端发送的是所述多个接收端分别向所述发送端发送所述数据对应的ACK的最迟时间,则所述多个接收端分别接收各自对应的所述最迟时间;
   具体的,如果最大缓存容量是针对各个用户分别指示,则STA2根据STA1向STA2发送数据Data(2)的速率值R(2)和STA1最大缓存STA2的容量C(2)计算到达STA1最大缓存容量的时间T2=C(2)/R(2),STA2根据STA1向STA3发送数据Data(3)的速率值R(3)和STA1最大缓存STA3的容量C(3)计算到达STA1最大缓存容量的时间T3=C(3)/R(3),比较T2和T3,若T2小于T3,则在T2之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧,若T2大于T3,则在T3之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧。如果最大缓存容量C是对所有用户总体指示,则STA2和STA3根据STA1发送数据Data(2)的速率值R(2)和数据Data(3)的速率值R(3)计算到达最大缓存容量的时间T=C/(R(2)+R(3))。
   如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,
   具体的,若STA2和STA3不支持上行多用户传输,则所述STA2和STA3分别计算T2和T3,所述STA2在T2之前向STA1发送ACK,所述STA3在T3之前向STA1发送ACK。
   所述多个接收端在第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述有限自由竞争的方式是指定的STA在第二信道中在一定的时间范围内通过载波监听多址(Carrier Sense Multiple with Collision Avoidance,CSMA)的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述下行多用户传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   具体的,所述STA2和STA3监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA2监听到所述第二信道未被占用时则递减第一随机数A,当所述STA3监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA2向STA1发送确认ACK,若第二随机数B减到0时则STA3向STA1发送确认ACK。
   所述发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述在预留的第一信道上向接收端发送数据,包括:
   多个发送端在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   具体的,参考图4,图4是本发明实施例提供的一种数据传输的方法示意图。在图4中,STA2和STA3是发送端,STA1是接收端。STA2向STA1发送Data(2),STA3向STA1发送Data(3)。
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   具体的,STA1根据STA2发送所述数据的速率值R(2)和STA2的最大缓存容量计算C(2)到达STA2最大缓存容量的时间T2=C(2)/R(2),STA1根据STA3发送所述所述数据的速率值R(3)和STA3的最大缓冲容量C(3)计算到达STA3最大缓存容量的时间T3=C(3)/R(3),STA1比较T2和T3,若T2小于T3,则STA1在T2之前向STA2和STA3发送ACK,若T3小于T2,则STA1在T3之前向STA2和STA3发送ACK。
   具体的,STA1根据STA2发送所述数据的速率值和STA2的最大缓存容量计算到达STA2最大缓存容量的时间T2,STA1根据STA3发送所述所述数据的速率值和STA3的最大缓冲容量计算到达STA3最大缓存容量的时间T3,STA1在T2之前向STA2发送ACK,STA1在T3之前向STA3发送ACK。
   所述接收端在所述第二信道中通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   因为在实际的应用场景中,使用第二信道的可能会有其他设备,在此种实施例的情况下,尽管只有一个所述接收端在使用第二信道向所述发送端ACK,但是为了避免和其他设备共同使用第二信道,所以,所述接收端需要通过有限自由竞争的方式向所述发送端发送ACK。
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述在预留的第一信道上向接收端发送数据,包括:
   多个发送端在第一信道上通过协作传输(Cooperative Transmission)的方法向多个接收端发送数据;
   所述协作传输的方法,可以是共享全部数据信息和信道信息的联合发送(Joint Transmission,JT),也可以是只共享信道信息而不共享数据信息的协调传输(coordinated transmission)或者是干扰对齐(interference alignment),本发明不对具体的传输方式作限制。
   具体的,参考图5,图5是本发明实施例提供的一种数据传输的方法示意图。STA1向STA3发送数据Data(1),STA2向STA4发送数据Data(2)。
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;
   具体的,STA1在第二信道上向STA3发送Data(1)对应的响应请求帧,STA2在第二信道上向STA4发送Data(2)对应的响应请求帧,STA3在接收到所述Data(1)对应的响应请求帧并在SIFS之后向STA1发送ACK,STA4在接收到所述Data(2)对应的响应请求帧并在SIFS之后向STA2发送ACK。
   所述多个发送端通过相互之间的交互最大缓存容量信息决定发送轮询的顺序。
   或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;
   具体的,所述STA1和STA2监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA1监听到所述第二信道未被占用时则递减第一随机数A,当所述STA2监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA1向STA3发送响应请求帧,若第二随机数B减到0时则STA2向STA4发送响应请求帧。
   或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述有限自由竞争的方式是指指定的STA在第二信道中在一定的时间范围内通过CSMA/CA的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述协作传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   具体的,所述STA3和STA4监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA3监听到所述第二信道未被占用时则递减第一随机数A,当所述STA4监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA3向STA1发送确认ACK,若第二随机数B减到0时则STA4向STA2发送确认ACK。
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   若发送端接收到接收端发送的数据对应的ACK之后,根据所述ACK的内容判断是否需要清除所述发送端缓存的数据。若所述ACK的内容是接收端已正确接收所述数据,则发送端清除已经正确接收的数据,若所述ACK的内容是接收端未正确接收所述数据,则发送端重新发送该数据。
   在步骤104之后,接收端在第一信道中发送完数据,并继续在第二信道中请求或者等待接收ACK,直到接收完所有的数据确认帧或者信道预留的时间结束为止;发送端在第二信道中发送数据确认帧,直到发送完所有的数据确认帧或者预留的时间结束为止。
   作为一种可选的实施例,所述方法还包括:
   所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   具体的,参考图6,图6是本发明实施例提供的一种数据传输的方法示意图。如图6所示,发送端STA1在MAC Header中携带STA1计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息,STA1在所述信道和所述时间内接收来自接收STA的数据响应帧;接收端STA2根据所述计划开始预留该信道的时间再开始使用第二信道发送ACK;在所述计划开始预留该信道的时间之前第二信道可以被其他STA用于数据传输等。由于STA1在所述计划开始预留该信道的时间之后预留了所述信道,除发送STA和接收STA以外其他STA都被设置了非零的网络分配向量(Network Allocation Vector,NAV)值,在所述NAV值指示的时间长度内,所述其他STA不能再在所述信道中发起数据传输。
   所述发送STA计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息也可以在所述发送STA发送的信道预留帧或者是前导中携带。
   作为一种可选的实施例,所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   具体的,若所述发送端在预留信道或者开始数据发送的时候在第二信道中没有成功预留信道,比如在第二信道中发送信道预留帧后没有在固定时间内获得所述信道预留帧的响应,发送端必须指示接收端回到现有的工作方式。
   所述指示接收端回到现有的工作方式的方法可以是在后续的数据发送中指示当前不再使用第二信道。
   所述现有的工作方式是指,发送端在第一信道中发送数据的SIFS之后在第一信道中接收接收端对数据的响应。
   参考图7,图7是现有技术提供的传输数据的效率示意图。参考图8,图8是本发明实施例提供的一种用于提供通信效率的效率示意图。对于单用户而言,假设现有技术的数据信道为320MHz。采用本发明所带来的开销相对于传统方式略有增加;但对于多用户的情况,本发明带来明显的MAC层效率提升。本发明的数据信道为300MHz,ACK信道为20MHz。单用户情况下增加了传输时长8μs。假设传输为两个用户的多用户传输,则传统方式所需时间至少增加为552μs,而本发明如果采用多用户传输方式反馈确认响应帧,则所需时间仍为484μs,与传统方式相比,至少节省了12.3%的时间开销,从而提升了MAC层效率。
   参考图9,图9是现有技术提供的传输数据的效率示意图。如图9所示,,OBSS场景下,至少有两个发送端接入点(Access Point,AP)1和AP2,一个处于OBSS区域的接收端为STA3。STA3与AP2关联,即AP1不会发送信号给STA3。另一方面,STA3具有干扰消除的能力,能解调出干扰信号并将其从接收信号中减去,然后再解调STA3接收到的信号。此外,AP1的信道为Channel 1和Channel 2,AP2的信道为Channel 1、Channel 2和Channel 3。AP1占用Channel 1和Channel 2,但AP2的所有信道皆空闲。在此前提下,AP2在数据信道中发送数据信号给STA3,现有技术的传统模式下,STA3因为监听到Channel 1和Channel 2均被占用就无法正确解调来自AP2的信号,即便能正确解调也无法发送确认响应给AP2。而基于本发明,STA3在能够基于干扰消除并正确解调的情况下,可以通过Channel 3返回确认ACK响应帧给AP2,从而在AP1已经利用Channel 1和Channel 2的前提下继续有效利用信道1、2和3发送数据。
   本发明实施例提供一种数据传输的方法,所述方法通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   参考图10,图10是本发明提供的一种用于提供通信效率的方法流程图。如图10所示,所述方法包括:
   步骤1001,接收端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   所述第一信道在具体实现中可以是一个单独的信道,也可以是多个连续或者离散的信道;所述第二信道在具体实现中可以是本BSS固定的专门用于传输ACK的信道;也可以是本BSS固定的用于传输控制帧或管理帧的信道(primary channel,主信道,);也可以是临时信道,在发送数据之前通过信道预留帧才获知该信道可用。使用完毕后即释放该信道。在OBSS的情况下,第二信道可以是多个BSS共用,以进一步降低***效率。
   可选地,所述接收端预留第一信道和第二信道,包括:
   所述接收端在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述接收端向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   具体的,若所述发送端在所述第一信道接收到所述接收端发送的所述第一信道预留帧的响应帧,则所述发送端成功预留所述第一信道;若所述发送端在所述第二信道接收到所述接收端发送的所述第二信道预留帧的响应帧,则所述发送端成功预留所述第二信道。若所述发送端在所述第一信道接收到的所述接收端发送的所述第一信道预留帧的响应帧中指示所述接收端也在所述第二信道中发送了响应帧,则所述发送端成功预留了所述第一信道和第二信道;若所述发送端在所述第二信道接收到的所述接收端发送的所述第二信道预留帧的响应帧中指示所述接收端也在所述第一信道中发送了响应帧,则所述发送端成功预留了所述第二信道和第一信道。
   具体的,参考图2,图2是本发明实施例提供的一种预留信道的方法示意图。如图2所示,STA1是发送端,STA2是接收端,Channel1是第一信道,用于传输数据,Channel2是第二信道,用于传输ACK。
   STA1同时在Channel1和Channel2上发送信道预留帧RTS,在不同信道上的RTS可以相同也可以不同,若是在Channel1上发送第一RTS,则该第一RTS携带预留Channel1的时间,若是在Channel2上发送第二RTS,则该第二RTS携带预留Channel2的时间。此外,RTS也要携带同时发送其他RTS所在的子信道标识,令RTS的接收端更可靠的获知发送RTS的所有子信道。若成功预留所述第一信道和所述第二信道则STA2通过Channel1和/或Channel2向STA1发送CTS,所述信道预留的时间可以在RTS或者CTS或者Data或者ACK中携带。
   若STA2同时在Channel1和Channel2上发送RTS的响应帧,则STA1成功预留Channel1和Channel2;若STA2仅在Channel1或者Channel2上响应,则仅成功预留Channel1或者Channel2;若STA2不回复任何响应,则STA1未能成功预留任何信道。
   所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述能力域的交互可以在数据发送之前,并在发送STA和接收STA之间完成。
   在现有技术中,为了支持数据包的可靠传输,必须具有重传机制。而重传需要发送端在尚未确知数据的接收端正确接收到信号的时候,必须缓存该部分数据内容,导致在数据包的长度增大时,发射端和接收端都必须有足够大的缓存,以确保发送端在发送数据后到正确接收该数据的确认(Acknowledge,ACK)前需要缓存该数据,但是,常为了保证芯片的尺寸,缓存的容量都比较有限,因此,如何避免数据因为缓存不够而丢失的问题有待解决。
   作为另一种可能的实现方式,在现有技术方案的基础上,接收端接收发送端发送数据,并接收所述发送端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间,在所述最迟时间之前,接收端可以向发送端发送ACK,从而解决现有技术中存在的因为缓存不够而丢失数据的问题。
   步骤1002,接收发送端在所述第一信道上发送的数据;
   步骤1003,在预留的第二信道上向发送端发送所述数据对应的ACK。
   可选地,所述接收发送端在所述第一信道上发送的数据,包括:
   接收单个发送端在所述第一信道上发送的数据;
   具体的,参考图2,若STA1成功预留Channel1和Channel2,则STA1在Channel1上向STA2发送数据Data。
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
具体的,如果所述发送端携带的最大缓存容量形式为缓存容量值,则STA1根据所述前导携带的STA1向STA2发送数据的速率值和STA1的最大缓存容量计算到达STA1最大缓存容量时的时间T,其方式为若接收端的最大缓存容量为C比特,所述前导携带的速率值为R比特/秒,则所述接收端根据最大缓存容量计算得到的最迟时间为T=C/R。或者如果STA1携带的最大缓存容量的形式为所述发送端发送所述数据对应的ACK的最迟时间,STA2就直接接收所述STA1发送的所述T。
   所述接收端在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   所述有限自由竞争的方式是指定的STA在第二信道中在一定的时间范围内通过载波监听多址(Carrier Sense Multiple with Collision Avoidance,CSMA)的方式占有信道并发送。
   具体的,所述CSMA/CA是竞争信道的方法,所述STA2监听所述第二信道是否空闲,所述STA2等待所述第二信道空闲的时间为DIFS,当所述STA2监听到所述第二信道未被占用时,随机生成一个时间值,该时间值为回退时间(backofftime),所述STA2在所述第二信道上向所述STA1发送所述数据对应的ACK。
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   可选地,所述接收发送端在所述第一信道上发送的数据,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向多个接收端发送据;
   具体的,参考图3,图3是本发明实施例提供的一种数据传输的方法示意图。如图3所示,假设STA1利用下行多用户传输的方式分别向STA2和STA3同时发送数据Data(2)和Data(3)。所述多用户传输的方式可以是下行多用户MIMO(DL MU-MIMO),也可以是下行正交频分多址(OFDMA),本发明对具体多用户的传输方式不作限制。
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,
   具体的,如果所述发送端携带的最大缓存容量形式为缓存容量值,则所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达发送端最大缓存容量的时间;或者如果所述发送端向所述多个接收端发送的是所述多个接收端分别向所述发送端发送所述数据对应的ACK的最迟时间,则所述多个接收端分别接收各自对应的所述最迟时间;
   具体的,如果最大缓存容量是针对各个用户分别指示,则STA2根据STA1向STA2发送数据Data(2)的速率值R(2)和STA1最大缓存STA2的容量C(2)计算到达STA1最大缓存容量的时间T2=C(2)/R(2),STA2根据STA1向STA3发送数据Data(3)的速率值R(3)和STA1最大缓存STA3的容量C(3)计算到达STA1最大缓存容量的时间T3=C(3)/R(3),比较T2和T3,若T2小于T3,则在T2之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧,若T2大于T3,则在T3之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧。如果最大缓存容量C是对所有用户总体指示,则STA2和STA3根据STA1发送数据Data(2)的速率值R(2)和数据Data(3)的速率值R(3)计算到达最大缓存容量的时间T=C/(R(2)+R(3))。
   如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,
   具体的,若STA2和STA3不支持上行多用户传输,则所述STA2和STA3分别计算T2和T3,所述STA2在T2之前向STA1发送ACK,所述STA3在T3之前向STA1发送ACK。
   所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述有限自由竞争的方式是指定的STA在第二信道中在一定的时间范围内通过载波监听多址(Carrier Sense Multiple with Collision Avoidance,CSMA)的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述下行多用户传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   具体的,所述STA2和STA3监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA2监听到所述第二信道未被占用时则递减第一随机数A,当所述STA3监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA2向STA1发送确认ACK,若第二随机数B减到0时则STA3向STA1发送确认ACK。
   所述发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述接收发送端在所述第一信道上发送的数据,包括:
   多个发送端在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   具体的,参考图4,图4是本发明实施例提供的一种数据传输的方法示意图。在图4中,STA2和STA3是发送端,STA1是接收端。STA2向STA1发送Data(2),STA3向STA1发送Data(3)。
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,
   具体的,STA1根据STA2发送所述数据的速率值R(2)和STA2的最大缓存容量计算C(2)到达STA2最大缓存容量的时间T2=C(2)/R(2),STA1根据STA3发送所述所述数据的速率值R(3)和STA3的最大缓冲容量C(3)计算到达STA3最大缓存容量的时间T3=C(3)/R(3),STA1比较T2和T3,若T2小于T3,则STA1在T2之前向STA2和STA3发送ACK,若T3小于T2,则STA1在T3之前向STA2和STA3发送ACK。
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   具体的,STA1根据STA2发送所述数据的速率值和STA2的最大缓存容量计算到达STA2最大缓存容量的时间T2,STA1根据STA3发送所述所述数据的速率值和STA3的最大缓冲容量计算到达STA3最大缓存容量的时间T3,STA1在T2之前向STA2发送ACK,STA1在T3之前向STA3发送ACK。
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   因为在实际的应用场景中,使用第二信道的可能会有其他设备,在此种实施例的情况下,尽管只有一个所述接收端在使用第二信道向所述发送端ACK,但是为了避免和其他设备共同使用第二信道,所以,所述接收端需要通过有限自由竞争的方式向所述发送端发送ACK。
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述接收发送端在所述第一信道上发送的数据,包括:
   多个发送端在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述协作传输的方法,可以是共享全部数据信息和信道信息的联合发送(Joint Transmission),也可以是只共享信道信息而不共享数据信息的协调传输(coordinated transmission)或者是干扰对齐(interference alignment),本发明不对具体的传输方式作限制。
   具体的,参考图5,图5是本发明实施例提供的一种数据传输的方法示意图。STA1向STA3发送数据Data(1),STA2向STA4发送数据Data(2)。
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,
   具体的,STA1在第二信道上向STA3发送Data(1)对应的响应请求帧,STA2在第二信道上向STA4发送Data(2)对应的响应请求帧,STA3在接收到所述Data(1)对应的响应请求帧并在SIFS之后向STA1发送ACK,STA4在接收到所述Data(2)对应的响应请求帧并在SIFS之后向STA2发送ACK。
   所述多个发送端通过相互之间的交互最大缓存容量信息决定发送轮询的顺序。
   所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,
   具体的,所述STA1和STA2监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA1监听到所述第二信道未被占用时则递减第一随机数A,当所述STA2监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA1向STA3发送响应请求帧,若第二随机数B减到0时则STA2向STA4发送响应请求帧。
   所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述有限自由竞争的方式是指指定的STA在第二信道中在一定的时间范围内通过CSMA/CA的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述协作传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   具体的,所述STA3和STA4监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA3监听到所述第二信道未被占用时则递减第一随机数A,当所述STA4监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA3向STA1发送确认ACK,若第二随机数B减到0时则STA4向STA2发送确认ACK。
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   具体的,若发送端接收到接收端发送的数据对应的ACK之后,根据所述ACK的内容判断是否需要清除所述发送端缓存的数据。若所述ACK的内容是接收端已正确接收所述数据,则发送端清除已经正确接收的数据,若所述ACK的内容是接收端未正确接收所述数据,则发送端重新发送该数据。
   接收端在第一信道中发送完数据,并继续在第二信道中请求或者等待接收ACK,直到接收完所有的数据确认帧或者信道预留的时间结束为止;发送端在第二信道中发送数据确认帧,直到发送完所有的数据确认帧或者预留的时间结束为止。
   作为一种可选的实施例,所述方法还包括:
   所述发送端在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   具体的,参考图6,图6是本发明实施例提供的一种数据传输的方法示意图。如图6所示,发送端STA1在MAC Header中携带STA1计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息,STA1在所述信道和所述时间内接收来自接收STA的数据响应帧;接收端STA2根据所述计划开始预留该信道的时间再开始使用第二信道发送ACK;在所述计划开始预留该信道的时间之前第二信道可以被其他STA用于数据传输等。由于STA1在所述计划开始预留该信道的时间之后预留了所述信道,除发送STA和接收STA以外其他STA都被设置了非零的NAV值,在所述NAV值指示的时间长度内,所述其他STA不能再在所述信道中发起数据传输。
   所述发送STA计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息也可以在所述发送STA发送的信道预留帧或者是前导中携带。
   作为另一种可选的实施例,所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   具体的,若所述发送端在预留信道或者开始数据发送的时候在第二信道中没有成功预留信道,比如在第二信道中发送信道预留帧后没有在固定时间内获得所述信道预留帧的响应,发送端必须指示接收端回到现有的工作方式。
   所述指示接收端回到现有的工作方式的方法可以是在后续的数据发送中指示当前不再使用第二信道。
   所述现有的工作方式是指,发送端在第一信道中发送数据的SIFS之后在第一信道中接收接收端对数据的响应。
   参考图9,图9是现有技术提供的传输数据的效率示意图。如图9所示,,OBSS场景下,至少有两个发送端AP1和AP2,一个处于OBSS区域的接收端为STA3。STA3与AP2关联,即AP1不会发送信号给STA3。另一方面,STA3具有干扰消除的能力,能解调出干扰信号并将其从接收信号中减去,然后再解调STA3接收到的信号。此外,AP1的信道为Channel 1和Channel 2,AP2的信道为Channel 1、Channel 2和Channel 3。AP1占用Channel 1和Channel 2,但AP2的所有信道皆空闲。在此前提下,AP2在数据信道中发送数据信号给STA3,现有技术的传统模式下,STA3因为监听到Channel 1和Channel 2均被占用就无法正确解调来自AP2的信号,即便能正确解调也无法发送确认响应给AP2。而基于本发明,STA3在能够基于干扰消除并正确解调的情况下,可以通过Channel 3返回确认ACK响应帧给AP2,从而在AP1已经利用Channel 1和Channel 2的前提下继续有效利用信道1、2和3发送数据。
   本发明实施例提供一种数据传输的方法,所述方法通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   参考图11,图11是本发明实施例提供的一种发送端的装置结构图。如图11所示,所述发送端包括:
   预留单元1101,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   所述第一信道在具体实现中可以是一个单独的信道,也可以是多个连续或者离散的信道;所述第二信道在具体实现中可以是本BSS固定的专门用于传输ACK的信道;也可以是本BSS固定的用于传输控制帧或管理帧的信道(primary channel,主信道,);也可以是临时信道,在发送数据之前通过信道预留帧才获知该信道可用。使用完毕后即释放该信道。在OBSS的情况下,第二信道可以是多个BSS共用,以进一步降低***效率。
   可选地,所述预留单元1101,具体用于:
   在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   具体的,若所述发送端在所述第一信道接收到所述接收端发送的所述第一信道预留帧的响应帧,则所述发送端成功预留所述第一信道;若所述发送端在所述第二信道接收到所述接收端发送的所述第二信道预留帧的响应帧,则所述发送端成功预留所述第二信道。若所述发送端在所述第一信道接收到的所述接收端发送的所述第一信道预留帧的响应帧中指示所述接收端也在所述第二信道中发送了响应帧,则所述发送端成功预留了所述第一信道和第二信道;若所述发送端在所述第二信道接收到的所述接收端发送的所述第二信道预留帧的响应帧中指示所述接收端也在所述第一信道中发送了响应帧,则所述发送端成功预留了所述第二信道和第一信道。
   具体的,参考图2,图2是本发明实施例提供的一种预留信道的方法示意图。如图2所示,STA1是发送端,STA2是接收端,Channel1是第一信道,用于传输数据,Channel2是第二信道,用于传输ACK。
   STA1同时在Channel1和Channel2上发送信道预留帧RTS,在不同信道上的RTS可以相同也可以不同,若是在Channel1上发送第一RTS,则该第一RTS携带预留Channel1的时间,若是在Channel2上发送第二RTS,则该第二RTS携带预留Channel2的时间。此外,RTS也要携带同时发送其他RTS所在的子信道标识,令RTS的接收端更可靠的获知发送RTS的所有子信道。若成功预留所述第一信道和所述第二信道则STA2通过Channel1和/或Channel2向STA1发送CTS,所述信道预留的时间可以在RTS或者CTS或者Data或者ACK中携带。
   若STA2同时在Channel1和Channel2上发送RTS的响应帧,则STA1成功预留Channel1和Channel2;若STA2仅在Channel1或者Channel2上响应,则仅成功预留Channel1或者Channel2;若STA2不回复任何响应,则STA1未能成功预留任何信道。
   可选地,所述发送端还包括携带单元,所述携带单元具体用于:
   在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述能力域的交互可以在数据发送之前,并在发送STA和接收STA之间完成。
   发送单元1102,用于在预留的第一信道上向接收端发送数据;
   接收单元1103,用于在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
   可选地,所述发送单元1102,具体用于:
   所述发送端在预留的第一信道上向接收端发送数据;
   所述接收单元1103,具体用于:
   根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   在所述第二信道上接收所述数据对应的ACK。
   具体的,参考图2,若STA1成功预留Channel1和Channel2,则STA1在Channel1上向STA2发送数据Data。
   如果所述发送端携带的最大缓存容量形式为缓存容量值,则STA1根据所述前导携带的STA1向STA2发送数据的速率值和STA1的最大缓存容量计算到达STA1最大缓存容量时的时间T,其方式为若接收端的最大缓存容量为C比特,所述前导携带的速率值为R比特/秒,则所述接收端根据最大缓存容量计算得到的最迟时间为T=C/R。或者如果STA1携带的最大缓存容量的形式为所述发送端发送所述数据对应的ACK的最迟时间,STA2就直接接收所述STA1发送的所述T。
   所述CSMA/CA是竞争信道的方法,所述STA2监听所述第二信道是否空闲,所述STA2等待所述第二信道空闲的时间为DIFS,当所述STA2监听到所述第二信道未被占用时,随机生成一个时间值,该时间值为回退时间(backofftime),所述STA2在所述第二信道上向所述STA1发送所述数据对应的ACK。
   可选地,所述发送单元1102,具体用于:
   在预留的第一信道上利用下行多用户传输的方式向多个接收端发送据;
   所述接收单元1103,具体用于:
   在所述第一信道上接收所述数据;
   如果多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   具体的,参考图3,图3是本发明实施例提供的一种数据传输的方法示意图。如图3所示,假设STA1利用下行多用户传输的方式分别向STA2和STA3同时发送数据Data(2)和Data(3)。所述多用户传输的方式可以是下行多用户MIMO(DL MU-MIMO),也可以是下行正交频分多址(OFDMA),本发明对具体多用户的传输方式不作限制。
   如果所述发送端携带的最大缓存容量形式为缓存容量值,则所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达发送端最大缓存容量的时间;或者如果所述发送端向所述多个接收端发送的是所述多个接收端分别向所述发送端发送所述数据对应的ACK的最迟时间,则所述多个接收端分别接收各自对应的所述最迟时间;
   如果最大缓存容量是针对各个用户分别指示,则STA2根据STA1向STA2发送数据Data(2)的速率值R(2)和STA1最大缓存STA2的容量C(2)计算到达STA1最大缓存容量的时间T2=C(2)/R(2),STA2根据STA1向STA3发送数据Data(3)的速率值R(3)和STA1最大缓存STA3的容量C(3)计算到达STA1最大缓存容量的时间T3=C(3)/R(3),比较T2和T3,若T2小于T3,则在T2之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧,若T2大于T3,则在T3之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧。如果最大缓存容量C是对所有用户总体指示,则STA2和STA3根据STA1发送数据Data(2)的速率值R(2)和数据Data(3)的速率值R(3)计算到达最大缓存容量的时间T=C/(R(2)+R(3))。
   若STA2和STA3不支持上行多用户传输,则所述STA2和STA3分别计算T2和T3,所述STA2在T2之前向STA1发送ACK,所述STA3在T3之前向STA1发送ACK。
   所述STA2和STA3监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA2监听到所述第二信道未被占用时则递减第一随机数A,当所述STA3监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA2向STA1发送确认ACK,若第二随机数B减到0时则STA3向STA1发送确认ACK。
   可选地,所述发送单元1102,具体用于:
   在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   所述接收单元1103,具体用于:
   根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   具体的,参考图4,图4是本发明实施例提供的一种数据传输的方法示意图。在图4中,STA2和STA3是发送端,STA1是接收端。STA2向STA1发送Data(2),STA3向STA1发送Data(3)。
   STA1根据STA2发送所述数据的速率值R(2)和STA2的最大缓存容量计算C(2)到达STA2最大缓存容量的时间T2=C(2)/R(2),STA1根据STA3发送所述所述数据的速率值R(3)和STA3的最大缓冲容量C(3)计算到达STA3最大缓存容量的时间T3=C(3)/R(3),STA1比较T2和T3,若T2小于T3,则STA1在T2之前向STA2和STA3发送ACK,若T3小于T2,则STA1在T3之前向STA2和STA3发送ACK。
   STA1根据STA2发送所述数据的速率值和STA2的最大缓存容量计算到达STA2最大缓存容量的时间T2,STA1根据STA3发送所述所述数据的速率值和STA3的最大缓冲容量计算到达STA3最大缓存容量的时间T3,STA1在T2之前向STA2发送ACK,STA1在T3之前向STA3发送ACK。
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   因为在实际的应用场景中,使用第二信道的可能会有其他设备,在此种实施例的情况下,尽管只有一个所述接收端在使用第二信道向所述发送端ACK,但是为了避免和其他设备共同使用第二信道,所以,所述接收端需要通过有限自由竞争的方式向所述发送端发送ACK。
   可选地,所述发送单元1102,具体用于:
   在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述接收单元1103,具体用于:
   通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   所述协作传输的方法,可以是共享全部数据信息和信道信息的联合发送(Joint Transmission),也可以是只共享信道信息而不共享数据信息的协调传输(coordinated transmission)或者是干扰对齐(interference alignment),本发明不对具体的传输方式作限制。
   具体的,参考图5,图5是本发明实施例提供的一种数据传输的方法示意图。STA1向STA3发送数据Data(1),STA2向STA4发送数据Data(2)。
   STA1在第二信道上向STA3发送Data(1)对应的响应请求帧,STA2在第二信道上向STA4发送Data(2)对应的响应请求帧,STA3在接收到所述Data(1)对应的响应请求帧并在SIFS之后向STA1发送ACK,STA4在接收到所述Data(2)对应的响应请求帧并在SIFS之后向STA2发送ACK。
   所述STA1和STA2监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA1监听到所述第二信道未被占用时则递减第一随机数A,当所述STA2监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA1向STA3发送响应请求帧,若第二随机数B减到0时则STA2向STA4发送响应请求帧。
   所述有限自由竞争的方式是指指定的STA在第二信道中在一定的时间范围内通过CSMA/CA的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述协作传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   所述STA3和STA4监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA3监听到所述第二信道未被占用时则递减第一随机数A,当所述STA4监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA3向STA1发送确认ACK,若第二随机数B减到0时则STA4向STA2发送确认ACK。
   若发送端接收到接收端发送的数据对应的ACK之后,根据所述ACK的内容判断是否需要清除所述发送端缓存的数据。若所述ACK的内容是接收端已正确接收所述数据,则发送端清除已经正确接收的数据,若所述ACK的内容是接收端未正确接收所述数据,则发送端重新发送该数据。
   接收端在第一信道中发送完数据,并继续在第二信道中请求或者等待接收ACK,直到接收完所有的数据确认帧或者信道预留的时间结束为止;发送端在第二信道中发送数据确认帧,直到发送完所有的数据确认帧或者预留的时间结束为止。
   可选地,所述携带单元还用于:
   所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   具体的,参考图6,图6是本发明实施例提供的一种数据传输的方法示意图。如图6所示,发送端STA1在MAC Header中携带STA1计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息,STA1在所述信道和所述时间内接收来自接收STA的数据响应帧;接收端STA2根据所述计划开始预留该信道的时间再开始使用第二信道发送ACK;在所述计划开始预留该信道的时间之前第二信道可以被其他STA用于数据传输等。由于STA1在所述计划开始预留该信道的时间之后预留了所述信道,除发送STA和接收STA以外其他STA都被设置了非零的NAV值,在所述NAV值指示的时间长度内,所述其他STA不能再在所述信道中发起数据传输。
   所述发送STA计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息也可以在所述发送STA发送的信道预留帧或者是前导中携带。
   可选地,所述发送单元1102还用于:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   具体的,若所述发送端在预留信道或者开始数据发送的时候在第二信道中没有成功预留信道,比如在第二信道中发送信道预留帧后没有在固定时间内获得所述信道预留帧的响应,发送端必须指示接收端回到现有的工作方式。
   所述指示接收端回到现有的工作方式的方法可以是在后续的数据发送中指示当前不再使用第二信道。
   所述现有的工作方式是指,发送端在第一信道中发送数据的SIFS之后在第一信道中接收接收端对数据的响应。
   参考图9,图9是现有技术提供的传输数据的效率示意图。如图9所示,,OBSS场景下,至少有两个发送端AP1和AP2,一个处于OBSS区域的接收端为STA3。STA3与AP2关联,即AP1不会发送信号给STA3。另一方面,STA3具有干扰消除的能力,能解调出干扰信号并将其从接收信号中减去,然后再解调STA3接收到的信号。此外,AP1的信道为Channel 1和Channel 2,AP2的信道为Channel 1、Channel 2和Channel 3。AP1占用Channel 1和Channel 2,但AP2的所有信道皆空闲。在此前提下,AP2在数据信道中发送数据信号给STA3,现有技术的传统模式下,STA3因为监听到Channel 1和Channel 2均被占用就无法正确解调来自AP2的信号,即便能正确解调也无法发送确认响应给AP2。而基于本发明,STA3在能够基于干扰消除并正确解调的情况下,可以通过Channel 3返回确认ACK响应帧给AP2,从而在AP1已经利用Channel 1和Channel 2的前提下继续有效利用信道1、2和3发送数据。
   本发明实施例提供一种发送端,所述发送端通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   参考图12,图12是本发明实施例提供的一种接收端的装置结构图。如图12所示,所述接收端包括:
   预留单元1201,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   所述第一信道在具体实现中可以是一个单独的信道,也可以是多个连续或者离散的信道;所述第二信道在具体实现中可以是本BSS固定的专门用于传输ACK的信道;也可以是本BSS固定的用于传输控制帧或管理帧的信道(primary channel,主信道,);也可以是临时信道,在发送数据之前通过信道预留帧才获知该信道可用。使用完毕后即释放该信道。在OBSS的情况下,第二信道可以是多个BSS共用,以进一步降低***效率。
   可选地,所述预留单元1201,具体用于:
   在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   具体的,若所述发送端在所述第一信道接收到所述接收端发送的所述第一信道预留帧的响应帧,则所述发送端成功预留所述第一信道;若所述发送端在所述第二信道接收到所述接收端发送的所述第二信道预留帧的响应帧,则所述发送端成功预留所述第二信道。若所述发送端在所述第一信道接收到的所述接收端发送的所述第一信道预留帧的响应帧中指示所述接收端也在所述第二信道中发送了响应帧,则所述发送端成功预留了所述第一信道和第二信道;若所述发送端在所述第二信道接收到的所述接收端发送的所述第二信道预留帧的响应帧中指示所述接收端也在所述第一信道中发送了响应帧,则所述发送端成功预留了所述第二信道和第一信道。
   具体的,参考图2,图2是本发明实施例提供的一种预留信道的方法示意图。如图2所示,STA1是发送端,STA2是接收端,Channel1是第一信道,用于传输数据,Channel2是第二信道,用于传输ACK。
   STA1同时在Channel1和Channel2上发送信道预留帧RTS,在不同信道上的RTS可以相同也可以不同,若是在Channel1上发送第一RTS,则该第一RTS携带预留Channel1的时间,若是在Channel2上发送第二RTS,则该第二RTS携带预留Channel2的时间。此外,RTS也要携带同时发送其他RTS所在的子信道标识,令RTS的接收端更可靠的获知发送RTS的所有子信道。若成功预留所述第一信道和所述第二信道则STA2通过Channel1和/或Channel2向STA1发送CTS,所述信道预留的时间可以在RTS或者CTS或者Data或者ACK中携带。
   若STA2同时在Channel1和Channel2上发送RTS的响应帧,则STA1成功预留Channel1和Channel2;若STA2仅在Channel1或者Channel2上响应,则仅成功预留Channel1或者Channel2;若STA2不回复任何响应,则STA1未能成功预留任何信道。
   可选地,所述接收端还包括携带单元,所述携带单元具体用于:
   在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述能力域的交互可以在数据发送之前,并在发送STA和接收STA之间完成。
接收单元1202,用于接收发送端在所述第一信道上发送的数据;
   发送单元1203,用于在预留的第二信道上向发送端发送所述数据对应的ACK。
   可选地,所述发送单元1203,具体用于:
   根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   在所述第二信道上接收所述数据对应的ACK。
   具体的,参考图2,若STA1成功预留Channel1和Channel2,则STA1在Channel1上向STA2发送数据Data。
   如果所述发送端携带的最大缓存容量形式为缓存容量值,则STA1根据所述前导携带的STA1向STA2发送数据的速率值和STA1的最大缓存容量计算到达STA1最大缓存容量时的时间T,其方式为若接收端的最大缓存容量为C比特,所述前导携带的速率值为R比特/秒,则所述接收端根据最大缓存容量计算得到的最迟时间为T=C/R。或者如果STA1携带的最大缓存容量的形式为所述发送端发送所述数据对应的ACK的最迟时间,STA2就直接接收所述STA1发送的所述T。
   所述CSMA/CA是竞争信道的方法,所述STA2监听所述第二信道是否空闲,所述STA2等待所述第二信道空闲的时间为DIFS,当所述STA2监听到所述第二信道未被占用时,随机生成一个时间值,该时间值为回退时间(backofftime),所述STA2在所述第二信道上向所述STA1发送所述数据对应的ACK。
   可选地,所述发送单元1203,具体用于:
   如果所述多个接收端都支持上行多用户传输,在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   具体的,参考图3,图3是本发明实施例提供的一种数据传输的方法示意图。如图3所示,假设STA1利用下行多用户传输的方式分别向STA2和STA3同时发送数据Data(2)和Data(3)。所述多用户传输的方式可以是下行多用户MIMO(DL MU-MIMO),也可以是下行正交频分多址(OFDMA),本发明对具体多用户的传输方式不作限制。
   如果所述发送端携带的最大缓存容量形式为缓存容量值,则所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达发送端最大缓存容量的时间;或者如果所述发送端向所述多个接收端发送的是所述多个接收端分别向所述发送端发送所述数据对应的ACK的最迟时间,则所述多个接收端分别接收各自对应的所述最迟时间;
   如果最大缓存容量是针对各个用户分别指示,则STA2根据STA1向STA2发送数据Data(2)的速率值R(2)和STA1最大缓存STA2的容量C(2)计算到达STA1最大缓存容量的时间T2=C(2)/R(2),STA2根据STA1向STA3发送数据Data(3)的速率值R(3)和STA1最大缓存STA3的容量C(3)计算到达STA1最大缓存容量的时间T3=C(3)/R(3),比较T2和T3,若T2小于T3,则在T2之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧,若T2大于T3,则在T3之前STA2和STA3同时在第二信道上向STA1发送Data(2)和Data(3)的响应帧。如果最大缓存容量C是对所有用户总体指示,则STA2和STA3根据STA1发送数据Data(2)的速率值R(2)和数据Data(3)的速率值R(3)计算到达最大缓存容量的时间T=C/(R(2)+R(3))。
   若STA2和STA3不支持上行多用户传输,则所述STA2和STA3分别计算T2和T3,所述STA2在T2之前向STA1发送ACK,所述STA3在T3之前向STA1发送ACK。
   所述STA2和STA3监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA2监听到所述第二信道未被占用时则递减第一随机数A,当所述STA3监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA2向STA1发送确认ACK,若第二随机数B减到0时则STA3向STA1发送确认ACK。
   可选地,所述发送单元1203,具体用于:
   根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   具体的,参考图4,图4是本发明实施例提供的一种数据传输的方法示意图。在图4中,STA2和STA3是发送端,STA1是接收端。STA2向STA1发送Data(2),STA3向STA1发送Data(3)。
   STA1根据STA2发送所述数据的速率值R(2)和STA2的最大缓存容量计算C(2)到达STA2最大缓存容量的时间T2=C(2)/R(2),STA1根据STA3发送所述所述数据的速率值R(3)和STA3的最大缓冲容量C(3)计算到达STA3最大缓存容量的时间T3=C(3)/R(3),STA1比较T2和T3,若T2小于T3,则STA1在T2之前向STA2和STA3发送ACK,若T3小于T2,则STA1在T3之前向STA2和STA3发送ACK。
   STA1根据STA2发送所述数据的速率值和STA2的最大缓存容量计算到达STA2最大缓存容量的时间T2,STA1根据STA3发送所述所述数据的速率值和STA3的最大缓冲容量计算到达STA3最大缓存容量的时间T3,STA1在T2之前向STA2发送ACK,STA1在T3之前向STA3发送ACK。
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   因为在实际的应用场景中,使用第二信道的可能会有其他设备,在此种实施例的情况下,尽管只有一个所述接收端在使用第二信道向所述发送端ACK,但是为了避免和其他设备共同使用第二信道,所以,所述接收端需要通过有限自由竞争的方式向所述发送端发送ACK。
   可选地,所述发送单元1203,具体用于:
   通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   所述协作传输的方法,可以是共享全部数据信息和信道信息的联合发送(Joint Transmission),也可以是只共享信道信息而不共享数据信息的协调传输(coordinated transmission)或者是干扰对齐(interference alignment),本发明不对具体的传输方式作限制。
   具体的,参考图5,图5是本发明实施例提供的一种数据传输的方法示意图。STA1向STA3发送数据Data(1),STA2向STA4发送数据Data(2)。
   STA1在第二信道上向STA3发送Data(1)对应的响应请求帧,STA2在第二信道上向STA4发送Data(2)对应的响应请求帧,STA3在接收到所述Data(1)对应的响应请求帧并在SIFS之后向STA1发送ACK,STA4在接收到所述Data(2)对应的响应请求帧并在SIFS之后向STA2发送ACK。
   所述STA1和STA2监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA1监听到所述第二信道未被占用时则递减第一随机数A,当所述STA2监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA1向STA3发送响应请求帧,若第二随机数B减到0时则STA2向STA4发送响应请求帧。
   所述有限自由竞争的方式是指指定的STA在第二信道中在一定的时间范围内通过CSMA/CA的方式占有信道并发送。本发明实施例中,所述指定的STA是指所述协作传输的多个接收端;所述一定的时间范围是指发送端所预留第二信道的时间长度。
   所述STA3和STA4监听所述第二信道并分别生成第一随机数A和第二随机数B,当所述STA3监听到所述第二信道未被占用时则递减第一随机数A,当所述STA4监听到所述第二信道未被占用时则递减第二随机数B,若第一随机数A减到0时则STA3向STA1发送确认ACK,若第二随机数B减到0时则STA4向STA2发送确认ACK。
   若发送端接收到接收端发送的数据对应的ACK之后,根据所述ACK的内容判断是否需要清除所述发送端缓存的数据。若所述ACK的内容是接收端已正确接收所述数据,则发送端清除已经正确接收的数据,若所述ACK的内容是接收端未正确接收所述数据,则发送端重新发送该数据。
   接收端在第一信道中发送完数据,并继续在第二信道中请求或者等待接收ACK,直到接收完所有的数据确认帧或者信道预留的时间结束为止;发送端在第二信道中发送数据确认帧,直到发送完所有的数据确认帧或者预留的时间结束为止。
   可选地,所述接收端还包括携带单元,所述携带单元具体用于:
   在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   具体的,参考图6,图6是本发明实施例提供的一种数据传输的方法示意图。如图6所示,发送端STA1在MAC Header中携带STA1计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息,STA1在所述信道和所述时间内接收来自接收STA的数据响应帧;接收端STA2根据所述计划开始预留该信道的时间再开始使用第二信道发送ACK;在所述计划开始预留该信道的时间之前第二信道可以被其他STA用于数据传输等。由于STA1在所述计划开始预留该信道的时间之后预留了所述信道,除发送STA和接收STA以外其他STA都被设置了非零的NAV值,在所述NAV值指示的时间长度内,所述其他STA不能再在所述信道中发起数据传输。
   所述发送STA计划开始预留MAC Header所在的信道的时间信息及预留的时间长度信息也可以在所述发送STA发送的信道预留帧或者是前导中携带。
   可选地,所述发送单元1203具体用于:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则向所述接收端发送返回预先设置的工作模式的指令。
   具体的,若所述发送端在预留信道或者开始数据发送的时候在第二信道中没有成功预留信道,比如在第二信道中发送信道预留帧后没有在固定时间内获得所述信道预留帧的响应,发送端必须指示接收端回到现有的工作方式。
   所述指示接收端回到现有的工作方式的方法可以是在后续的数据发送中指示当前不再使用第二信道。
   所述现有的工作方式是指,发送端在第一信道中发送数据的SIFS之后在第一信道中接收接收端对数据的响应。
   参考图9,图9是现有技术提供的传输数据的效率示意图。如图9所示,,OBSS场景下,至少有两个发送端AP1和AP2,一个处于OBSS区域的接收端为STA3。STA3与AP2关联,即AP1不会发送信号给STA3。另一方面,STA3具有干扰消除的能力,能解调出干扰信号并将其从接收信号中减去,然后再解调STA3接收到的信号。此外,AP1的信道为Channel 1和Channel 2,AP2的信道为Channel 1、Channel 2和Channel 3。AP1占用Channel 1和Channel 2,但AP2的所有信道皆空闲。在此前提下,AP2在数据信道中发送数据信号给STA3,现有技术的传统模式下,STA3因为监听到Channel 1和Channel 2均被占用就无法正确解调来自AP2的信号,即便能正确解调也无法发送确认响应给AP2。而基于本发明,STA3在能够基于干扰消除并正确解调的情况下,可以通过Channel 3返回确认ACK响应帧给AP2,从而在AP1已经利用Channel 1和Channel 2的前提下继续有效利用信道1、2和3发送数据。
   本发明实施例提供一种接收端,所述接收端通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   图13是本发明实施例提供的一种发送端的装置结构图。参考图13,图13是本发明实施例提供的一种发送端1300,本发明具体实施例并不对所述发送端1300的具体实现做限定。所述发送端1300包括:
   处理器(processor)1301,通信接口(Communications Interface)1302,存储器(memory)1303,总线1304。
   处理器1301,通信接口1302,存储器1303通过总线1304完成相互间的通信。
   通信接口1302,用于与接收端进行通信;
   处理器1301,用于执行程序。
   具体地,程序可以包括程序代码,所述程序代码包括计算机操作指令。
   处理器1301可能是一个中央处理器CPU,或者是特定集成电路ASIC(Application Specific Integrated Circuit),或者是被配置成实施本发明实施例的一个或多个集成电路。
   存储器1303,用于存放程序。存储器1303可能包含高速RAM存储器,也可能还包括非易失性存储器(non-volatile memory),例如至少一个磁盘存储器。程序具体可以包括:
   发送端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   在预留的第一信道上向接收端发送数据;
   在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
   所述发送端预留第一信道和第二信道,包括:
   发送端在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述在预留的第一信道上向接收端发送数据,包括:
   所述发送端在预留的第一信道上向接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   所述接收端在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者CSMA向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   所述在预留的第一信道上向接收端发送数据,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向多个接收端发送据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   所述在预留的第一信道上向接收端发送数据,包括:
   多个发送端在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   所述在预留的第一信道上向接收端发送数据,包括:
   多个发送端在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   所述方法还包括:
   所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   本发明实施例提供一种发送端,所述发送端通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   图14是本发明实施例提供的一种接收端的装置结构图。参考图14,图14是本发明实施例提供的一种接收端1400,本发明具体实施例并不对所述接收端1400的具体实现做限定。所述接收端1400包括:
   处理器(processor)1401,通信接口(Communications Interface)1402,存储器(memory)1403,总线1404。
   处理器1401,通信接口1402,存储器1403通过总线1404完成相互间的通信。
   通信接口1402,用于与发送端进行通信;
   处理器1401,用于执行程序。
   具体地,程序可以包括程序代码,所述程序代码包括计算机操作指令。
   处理器1401可能是一个中央处理器CPU,或者是特定集成电路ASIC(Application Specific Integrated Circuit),或者是被配置成实施本发明实施例的一个或多个集成电路。
   存储器1403,用于存放程序。存储器1403可能包含高速RAM存储器,也可能还包括非易失性存储器(non-volatile memory),例如至少一个磁盘存储器。程序具体可以包括:
   接收端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
   接收发送端在所述第一信道上发送的数据;
   在预留的第二信道上向发送端发送所述数据对应的ACK。
   所述接收端预留第一信道和第二信道,包括:
   所述接收端在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
   所述接收端向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
   所述方法还包括:
   发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
   所述接收发送端在所述第一信道上发送的数据,包括:
   接收单个发送端在所述第一信道上发送的数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
   所述接收端在所述第二信道空闲PIFS时间之后,或者在所述前导SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述数据对应的ACK。
   所述接收发送端在所述第一信道上发送的数据,包括:
   所述发送端在预留的第一信道上利用下行多用户传输的方式向多个接收端发送数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个接收端在所述第一信道上接收所述数据;
   如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   所述接收发送端在所述第一信道上发送的数据,包括:
   多个发送端在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
   所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
   所述接收发送端在所述第一信道上发送的数据,包括:
   多个发送端在第一信道上通过协作传输的方法向多个接收端发送数据;
   所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
   所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述发送端发送ACK;
   所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
   所述方法还包括:
   所述发送端在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
   所述方法还包括:
   如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
   本发明实施例提供一种接收端,所述接收端通过预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输ACK;在预留的第一信道上向接收端发送数据;在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,并根据所述ACK中携带的信息确定是否需要缓存所述数据;若所述ACK中携带的信息是所述接收端已正确接收所述数据时,则清除所述发送端缓存的所述数据,通过将数据和ACK分开传输,解决发送端在有限的缓存容量情况下提供无线***中MAC效率的问题。
   以上所述仅为本发明的优选实施方式,并不构成对本发明保护范围的限定。任何在本发明的精神和原则之内所作的任何修改、等同替换和改进等,均应包含在本发明要求包含范围之内。

Claims (42)

  1. 一种数据传输的方法,其特征在于,所述方法包括:
       发送端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
       在预留的第一信道上向接收端发送数据;
       在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
  2.    根据权利要求1所述的方法,其特征在于,所述发送端预留第一信道和第二信道,包括:
       发送端在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
       所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
  3.    根据权利要求2所述的方法,其特征在于,所述方法还包括:
       发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  4. 根据权利要求3所述的方法,其特征在于,所述在预留的第一信道上向接收端发送数据,包括:
       所述发送端在预留的第一信道上向接收端发送数据;
       所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
       所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
       所述接收端在所述第二信道空闲PCF帧间隔PIFS时间之后,或者在所述前导短帧间隔SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者载波监听多址CSMA向所述发送端发送ACK;
       所述发送端在所述第二信道上接收所述数据对应的ACK。
  5.    根据权利要求3所述的方法,其特征在于,所述接收端的数量有多个,所述在预留的第一信道上向接收端发送数据,包括:
       所述发送端在预留的第一信道上利用下行多用户传输的方式向所述多个接收端发送据;
       所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
       所述多个接收端在所述第一信道上接收所述数据;
       如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
       所述发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  6.    根据权利要求3所述的方法,其特征在于,所述发送端的数量有多个,所述在预留的第一信道上向接收端发送数据,包括:
       所述多个发送端在第一信道上通过上行多用户传输的方法向接收端发送数据;
       所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
       所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达所述多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
       所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
       所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
  7.    根据权利要求3所述的方法,其特征在于,所述发送端的数量有多个,所述接收端的数量有多个,所述在预留的第一信道上向接收端发送数据,包括:
       所述多个发送端在第一信道上通过协作传输的方法向所述多个接收端发送数据;
       所述在预留的第二信道上接收所述接收端发送的所述数据对应的ACK,包括:
       所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
       所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  8.    根据权利要求4-7任意一项所述的方法,其特征在于,所述方法还包括:
       所述发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
  9.    根据权利要求1-8任意一项所述的方法,其特征在于,所述方法还包括:
       如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
  10.    一种数据传输的方法,其特征在于,所述方法包括:
       发送端向接收端发送数据和最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的确认ACK的最迟时间;
       所述发送端接收所述接收端根据所述最大缓存容量发送的ACK。
  11. 一种数据传输的方法,其特征在于,所述方法包括:
       接收端预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
       接收发送端在所述第一信道上发送的数据;
       在预留的第二信道上向发送端发送所述数据对应的ACK。
  12.    根据权利要求11所述的方法,其特征在于,所述接收端预留第一信道和第二信道,包括:
       接收端在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
       所述接收端向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
  13.    根据权利要求12所述的方法,其特征在于,所述方法还包括:
       发送端在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  14.    根据权利要求13所述的方法,其特征在于,所述接收发送端在所述第一信道上发送的数据,包括:
       接收单个发送端在所述第一信道上发送的数据;
       所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
       所述接收端根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
       所述接收端在所述第二信道空闲PCF帧间隔PIFS时间之后,或者在所述前导短帧间隔SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者载波监听多址CSMA的方式向所述发送端发送ACK;
       所述发送端在所述第二信道上接收所述数据对应的ACK。
  15.    根据权利要求13所述的方法,其特征在于,所述接收端的数量有多个,所述接收发送端在所述第一信道上发送的数据,包括:
       所述发送端在预留的第一信道上利用下行多用户传输的方式向所述多个接收端发送数据;
       所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
       所述多个接收端在所述第一信道上接收所述数据;
       如果所述多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
       所述发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  16.    根据权利要求13所述的方法,其特征在于,所述发送端的数量有多个,所述接收发送端在所述第一信道上发送的数据,包括:
       所述多个发送端在第一信道上通过上行多用户传输的方法向接收端发送数据;
       所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
       所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
       所述接收端在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
       所述多个发送端在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
  17.    根据权利要求13所述的方法,其特征在于,所述发送端的数量有多个,所述接收端的数量有多个,所述接收发送端在所述第一信道上发送的数据,包括:
       所述多个发送端在第一信道上通过协作传输的方法向所述多个接收端发送数据;
       所述在预留的第二信道上向发送端发送所述数据对应的ACK,包括:
       所述多个发送端通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
       所述多个发送端在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  18.    根据权利要求14-17任意一项所述的方法,其特征在于,所述方法还包括:
       所述发送端在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
  19. 根据权利要求11-18任意一项所述的方法,其特征在于,所述方法还包括:
       如果发送端未成功预留第一信道和第二信道中的至少一个,则所述发送端向所述接收端发送返回预先设置的工作模式的指令。
  20.    一种数据传输的方法,其特征在于,所述方法包括:
       接收端接收发送端发送数据,并接收所述发送端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  21.    一种发送端,其特征在于,所述发送端包括:
       预留单元,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
       发送单元,用于在预留的第一信道上向接收端发送数据;
       接收单元,用于在预留的第二信道上接收所述接收端发送的所述数据对应的ACK。
  22.    根据权利要求21所述的发送端,其特征在于,所述预留单元,具体用于:
       在第一信道上向接收端发送第一信道预留帧,在第二信道上向接收端发送第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
       根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
  23.    根据权利要求22所述的发送端,其特征在于,所述发送端还包括携带单元,所述携带单元具体用于:
       在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  24.    根据权利要求23所述的发送端,其特征在于,所述发送单元,具体用于:
       所述发送端在预留的第一信道上向接收端发送数据;
       所述接收单元,具体用于:
       根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
       在所述第二信道空闲PCF帧间隔PIFS时间之后,或者在所述前导短帧间隔SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争的方式或者载波监听多址CSMA向所述发送端发送ACK;
       在所述第二信道上接收所述数据对应的ACK。
  25.    根据权利要求23所述的发送端,其特征在于,所述接收端的数量有多个,所述发送单元,具体用于:
       在预留的第一信道上利用下行多用户传输的方式向所述多个接收端发送据;
       所述接收单元,具体用于:
       在所述第一信道上接收所述数据;
       如果多个接收端都支持上行多用户传输,所述发送端在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,所述多个接收端在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,所述多个接收端在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,所述多个接收端在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
       在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  26.    根据权利要求23所述的发送端,其特征在于,所述发送端的数量有多个,所述发送单元具体用于:
       在第一信道上通过上行多用户传输的方法向同一个接收端发送数据;
       所述接收单元,具体用于:
       根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,所述接收端在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
       在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
       在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
  27.    根据权利要求23所述的发送端,其特征在于,所述发送端的数量有多个,所述接收端的数量有多个,所述发送单元,具体用于:
       在第一信道上通过协作传输的方法向多个接收端发送数据;
       所述接收单元,具体用于:
       通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
       在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  28. 根据权利要求24-27任意一项所述的发送端,其特征在于,所述携带单元还用于:
       在所述第一信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
  29.    根据权利要求21-28任意一项所述的发送端,其特征在于,所述发送单元还用于:
       如果发送端未成功预留第一信道和第二信道中的至少一个,则向所述接收端发送返回预先设置的工作模式的指令。
  30.    一种发送端,其特征在于,所述发送端包括:
       发送单元,用于向接收端发送数据和最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的确认ACK的最迟时间;
       接收单元,用于接收所述接收端根据所述最大缓存容量发送的ACK。
  31.    一种接收端,其特征在于,所述接收端包括:
       预留单元,用于预留第一信道和第二信道,所述第一信道用于传输数据,所述第二信道用于传输确认ACK;
       接收单元,用于接收发送端在所述第一信道上发送的数据;
       发送单元,用于在预留的第二信道上向发送端发送所述数据对应的ACK。
  32.    根据权利要求31所述的接收端,其特征在于,所述预留单元,具体用于:
       在所述第一信道上接收所述发送端发送的第一信道预留帧,在所述第二信道上接收所述发送端发送的第二信道预留帧,所述第一信道预留帧用于预留所述第一信道,并携带预留所述第一信道的时间,所述第二信道预留帧用于预留所述第二信道,并携带预留所述第二信道的时间;
       向所述发送端发送所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个,使得所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第一信道,所述发送端根据所述接收端发送的所述第一信道预留帧的响应帧和所述第二信道预留帧的响应帧中的至少一个确定是否成功预留所述第二信道。
  33.    根据权利要求32所述的接收端,其特征在于,所述接收端还包括携带单元,所述携带单元具体用于:
       在所述第一信道预留帧和所述第二信道预留帧中的至少一个中携带最大缓存容量,或者在前导中携带所述最大缓存容量,或者在能力域中携带所述最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  34.    根据权利要求33所述的接收端,其特征在于, 所述发送单元,具体用于:
       根据所述前导携带的所述发送端发送所述数据的速率值计算到达发送端所述最大缓存容量的时间,或者所述接收端接收所述发送端发送的到达发送端最大缓存容量的时间;
       在所述第二信道空闲PCF帧间隔PIFS时间之后,或者在所述前导短帧间隔SIFS时间之后,或者在所述发送端发送所述数据对应的响应请求帧之后,并在所述到达发送端最大缓存容量的时间之前向所述发送端发送ACK;或者,所述接收端通过有限自由竞争或者载波监听多址CSMA的方式向所述发送端发送ACK;
       在所述第二信道上接收所述数据对应的ACK。
  35.    根据权利要求33所述的接收端,其特征在于,所述接收端的数量有多个,所述发送单元,具体用于:
       如果所述多个接收端都支持上行多用户传输,在所述预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧之后,在所述多个接收端中的最小的所述到达发送端最大缓存容量的时间之前通过上行多用户传输的方法同时向所述发送端发送确认ACK;或者,如果所述多个接收端不支持上行多用户传输,在接收到所述响应请求帧之后,所述多个接收端根据所述前导携带的所述发送端分别向所述多个接收端发送所述数据的速率值计算所述多个接收端对应的所述到达所述发送端最大缓存容量的时间,在所述多个接收端对应的所述到达发送端最大缓存容量的时间之前分别向所述发送端发送确认ACK;或者,在所述第二信道中分别通过有限自由竞争的方式向所述发送端发送ACK;
       在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  36.    根据权利要求33所述的接收端,其特征在于,所述发送端的数量有多个,所述发送单元,具体用于:
       根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的最迟时间, 在最小的所述到达多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述多个发送端分别向所述接收端发送对应各个发送端的最迟时间,所述接收端接收所述最迟时间,在最小的所述到达所述多个发送端最大缓存容量的时间之前向所述多个发送端通过下行多用户传输的方式同时发送确认ACK;或者,所述接收端根据所述前导携带的所述多个发送端向所述接收端发送所述数据的速率值分别计算所述多个发送端对应的到达所述多个发送端最大缓存容量的时间,所述接收端分别在所述到达多个发送端最大缓存容量的时间之前,向所述多个发送端发送确认ACK;
       在所述第二信道中通过有限自由竞争或者CSMA的方式向所述多个发送端发送ACK;
       在所述第二信道上接收所述接收端发送的所述数据对应的ACK。
  37.    根据权利要求33所述的接收端,其特征在于,所述发送端的数量有多个,所述接收端的数量有多个,所述发送单元,具体用于:
       通过轮询Poll的方法分别在预留的第二信道上发送所述数据对应的响应请求帧,所述多个接收端在接收到所述响应请求帧并在SIFS之后向所述多个发送端发送ACK;或者,所述多个发送端在所述第二信道中分别通过有限自由竞争的方式向所述多个接收端请求发送ACK;或者,所述多个接收端分别通过有限自由竞争的方式向所述多个发送端发送ACK;
       在所述第二信道上接收所述多个接收端发送的所述数据对应的ACK。
  38.    根据权利要求34-37任意一项所述的接收端,其特征在于,所述接收端还包括携带单元,所述携带单元具体用于:
       在所述第一个信道预留帧和所述第二信道预留帧中的至少一个或者所述数据或者所述前导中携带预留信道开始的时间。
  39.    根据权利要求31-38任意一项所述的接收端,其特征在于,所述发送单元具体用于:
       如果发送端未成功预留第一信道和第二信道中的至少一个,则向所述接收端发送返回预先设置的工作模式的指令。
  40.    一种接收端,其特征在于,所述接收端包括:
       接收单元,用于接收发送端发送数据,并接收所述发送端发送最大缓存容量,所述最大缓存容量是用于所述接收端确定向所述发送端发送所述数据对应的ACK的最迟时间。
  41.    一种通信***,其特征在于,所述通信***包括权利要求21-29所述的发送端和权利要求31-39所述的接收端。
  42.    一种通信***,其特征在于,所述通信***包括权利要求30所述的发送端和权利要求40所述的接收端。
PCT/CN2013/084556 2013-09-29 2013-09-29 一种数据传输的方法及设备 WO2015042896A1 (zh)

Priority Applications (8)

Application Number Priority Date Filing Date Title
CN201380078327.4A CN105393589B (zh) 2013-09-29 2013-09-29 一种数据传输的方法及设备
PCT/CN2013/084556 WO2015042896A1 (zh) 2013-09-29 2013-09-29 一种数据传输的方法及设备
EP13894722.1A EP3051870B1 (en) 2013-09-29 2013-09-29 Data transmission method and device
CN201910464397.2A CN110190937B (zh) 2013-09-29 2013-09-29 一种数据传输的方法及设备
EP19178681.3A EP3629620B1 (en) 2013-09-29 2013-09-29 Data transmission device
US15/082,906 US10129881B2 (en) 2013-09-29 2016-03-28 Data transmission method and device
US16/165,728 US10631298B2 (en) 2013-09-29 2018-10-19 Data transmission method and device
US16/825,749 US11006420B2 (en) 2013-09-29 2020-03-20 Data transmission method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/084556 WO2015042896A1 (zh) 2013-09-29 2013-09-29 一种数据传输的方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/082,906 Continuation US10129881B2 (en) 2013-09-29 2016-03-28 Data transmission method and device

Publications (1)

Publication Number Publication Date
WO2015042896A1 true WO2015042896A1 (zh) 2015-04-02

Family

ID=52741838

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/084556 WO2015042896A1 (zh) 2013-09-29 2013-09-29 一种数据传输的方法及设备

Country Status (4)

Country Link
US (3) US10129881B2 (zh)
EP (2) EP3051870B1 (zh)
CN (2) CN105393589B (zh)
WO (1) WO2015042896A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107318168A (zh) * 2017-06-21 2017-11-03 深圳市盛路物联通讯技术有限公司 一种控制物联网终端设备通信的方法及***

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107534617B (zh) * 2015-05-06 2021-12-21 瑞典爱立信有限公司 在适于多径多跳的无线通信网络中处理数据分组传输的方法和设备
US10291299B2 (en) * 2015-09-07 2019-05-14 Kabushiki Kaisha Toshiba Wireless communication device
US10554368B2 (en) * 2015-10-07 2020-02-04 Microsoft Technology Licensing, Llc Wireless data-acknowledgement communication using frame aggregation
US10805051B2 (en) 2017-10-24 2020-10-13 Marvell Asia Pte, Ltd. WiFi channel aggregation
WO2019112726A1 (en) 2017-12-08 2019-06-13 Marvell World Trade Ltd. Wifi operation with channel aggregation
US11265927B1 (en) 2018-04-26 2022-03-01 Nxp Usa, Inc. Media access control for multi-band communication in WLAN
CN113170442A (zh) 2018-05-08 2021-07-23 马维尔亚洲私人有限公司 Wlan中的打孔操作信道
US10939476B1 (en) 2018-05-08 2021-03-02 Marvell Asia Pte., Ltd. WiFi backoff timer
US10666374B2 (en) 2018-05-11 2020-05-26 At&T Intellectual Property I, L.P. Non-orthogonal multiple access for uplink data transmission for 5G or other next generation network
US11646833B2 (en) * 2018-07-24 2023-05-09 Koninklijke Kpn N.V. Reliable communication over shared resources
WO2020028415A1 (en) 2018-07-30 2020-02-06 Marvell World Trade Ltd. Media access control for punctured/aggregated communication channels in wlan
US11296840B1 (en) 2018-10-31 2022-04-05 Marvell Asia Pte Ltd Media access control for frequency division full duplex in WLAN
CN113906698A (zh) 2019-01-11 2022-01-07 马维尔亚洲私人有限公司 Wifi多频带通信
WO2020191411A1 (en) 2019-03-21 2020-09-24 Marvell Asia Pte, Ltd. Coordinated multi-user transmissions with multiple access points
JP7315293B2 (ja) 2019-04-11 2023-07-26 マーベル アジア ピーティーイー、リミテッド 複数の周波数セグメントにおける同時伝送
US11363657B1 (en) 2019-05-16 2022-06-14 Marvell Asia Pte Ltd WiFi network operation with channel aggregation
WO2020243117A1 (en) 2019-05-24 2020-12-03 Marvell Asia Pte, Ltd. Power save and group-addressed frames in wlan using multiple communication links
US11818799B1 (en) 2019-05-30 2023-11-14 Marvell Asia Pte Ltd Data unit aggregation in a wireless network with multiple channel segments
US11611462B2 (en) 2019-06-19 2023-03-21 Marvell Asia Pte Ltd Padding and backoff operations when transmitting via multiple frequency segments in a WLAN
WO2022027563A1 (en) * 2020-08-07 2022-02-10 Qualcomm Incorporated Configuration of cross-carrier channel state information reporting

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101094047A (zh) * 2007-07-06 2007-12-26 中国人民解放军国防科学技术大学 基于网络状态测量的分阶段慢启动传输控制方法
CN101278529A (zh) * 2005-10-03 2008-10-01 松下电器产业株式会社 通信装置
CN102006630A (zh) * 2010-11-10 2011-04-06 北京航空航天大学 多信道协作数据传输方法及***

Family Cites Families (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7751370B2 (en) * 2001-07-13 2010-07-06 Qualcomm Incorporated Method and apparatus for forward link rate scheduling
US6505253B1 (en) * 1998-06-30 2003-01-07 Sun Microsystems Multiple ACK windows providing congestion control in reliable multicast protocol
EP1150456B1 (en) * 2000-04-25 2004-06-16 Nortel Networks S.A. Radio telecommunications system with reduced delays for data transmission
US20020172186A1 (en) * 2001-04-09 2002-11-21 Peter Larsson Instantaneous joint transmit power control and link adaptation for RTS/CTS based channel access
AU2003260446A1 (en) * 2003-08-21 2005-03-10 Docomo Communications Laboratories Europe Gmbh Resource reservation in a wireless network with distributed medium access control
US8842657B2 (en) * 2003-10-15 2014-09-23 Qualcomm Incorporated High speed media access control with legacy system interoperability
CN1894914B (zh) * 2003-10-15 2010-06-16 高通股份有限公司 具有与传统***互操作性的高速媒体接入控制
JP2006050519A (ja) * 2003-10-24 2006-02-16 Sony Corp 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
US7463642B2 (en) * 2004-04-07 2008-12-09 Cisco Technology, Inc. Multiple receiver aggregation
US20080144493A1 (en) * 2004-06-30 2008-06-19 Chi-Hsiang Yeh Method of interference management for interference/collision prevention/avoidance and spatial reuse enhancement
US7768988B2 (en) * 2005-02-22 2010-08-03 Intel Corporation Method and apparatus to perform network medium reservation in a wireless network
CN100484301C (zh) * 2006-01-18 2009-04-29 华为技术有限公司 高速上行分组接入业务重配置方法
KR100917888B1 (ko) * 2007-02-09 2009-09-16 삼성전자주식회사 무선 네트워크 시스템 및 상기 무선 네트워크상에서데이터를 송수신하는 방법
KR101371016B1 (ko) * 2007-03-16 2014-03-10 삼성전자주식회사 보조 채널을 이용한 방송 송수신 방법 및 장치
CN100596108C (zh) * 2007-04-20 2010-03-24 杭州华三通信技术有限公司 数据传输方法及装置
WO2009116789A1 (en) * 2008-03-17 2009-09-24 Lg Electronics Inc. Method of transmitting uplink data in wireless communication system
FR2940568A1 (fr) * 2008-12-22 2010-06-25 Thomson Licensing Procede de transmission dans un reseau sans-fil et procede de gestion de communication correspondant
US8045472B2 (en) * 2008-12-29 2011-10-25 Apple Inc. Credit management when resource granularity is larger than credit granularity
US8369257B2 (en) * 2008-12-31 2013-02-05 Stmicroelectronics, Inc. Reliable and deterministic communication protocol
US9493370B2 (en) * 2009-03-03 2016-11-15 Reliance Automation, Llc Wastewater treatment system
US8861495B2 (en) * 2009-11-24 2014-10-14 Electronics And Telecommunications Research Institute Method for protecting data in a MU-MIMO based wireless communication system
US9204337B2 (en) * 2010-03-09 2015-12-01 Broadcom Corporation Bandwidth mechanisms and successive channel reservation access within multiple user, multiple access, and/or MIMO wireless communications
US8259745B2 (en) * 2010-03-29 2012-09-04 Intel Corporation Enhanced carrier sensing for multi-channel operation
US8989066B2 (en) * 2010-03-31 2015-03-24 Qualcomm, Incorporated Protection mechanisms for multi-user MIMO transmissions
US9173234B2 (en) * 2010-03-31 2015-10-27 Qualcomm Incorporated Protection mechanisms for multi-user MIMO transmissions
US9031054B2 (en) * 2010-07-09 2015-05-12 Nokia Corporation Reservation response and multi-user transmissions
CN102469470B (zh) * 2010-11-04 2015-10-21 中兴通讯股份有限公司 无线局域网中的传输方法和装置
US8730905B2 (en) * 2010-11-04 2014-05-20 Nokia Corporation Transmission resource reservation scheme
CN103416017B (zh) * 2010-11-12 2016-11-16 交互数字专利控股公司 用于执行信道聚合和媒介访问控制重传的方法和设备
FI20115043A0 (fi) * 2011-01-17 2011-01-17 Nokia Corp Lähetysresurssien varaaminen
CN102684852A (zh) * 2011-03-31 2012-09-19 北京新岸线无线技术有限公司 一种用于帧确认的方法和装置
WO2013130793A1 (en) * 2012-03-01 2013-09-06 Interdigital Patent Holdings, Inc. Multi-user parallel channel access in wlan systems
US10182421B2 (en) * 2012-06-01 2019-01-15 Qualcomm Incorporated Authorized shared access carrier aggregation with sensing
JP6327114B2 (ja) * 2014-10-30 2018-05-23 三菱電機株式会社 電子部品搭載基板、電動機、空気調和機、及び電子部品搭載基板の製造方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101278529A (zh) * 2005-10-03 2008-10-01 松下电器产业株式会社 通信装置
CN101094047A (zh) * 2007-07-06 2007-12-26 中国人民解放军国防科学技术大学 基于网络状态测量的分阶段慢启动传输控制方法
CN102006630A (zh) * 2010-11-10 2011-04-06 北京航空航天大学 多信道协作数据传输方法及***

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107318168A (zh) * 2017-06-21 2017-11-03 深圳市盛路物联通讯技术有限公司 一种控制物联网终端设备通信的方法及***

Also Published As

Publication number Publication date
US20160212748A1 (en) 2016-07-21
US10129881B2 (en) 2018-11-13
CN110190937A (zh) 2019-08-30
CN105393589B (zh) 2019-08-02
US10631298B2 (en) 2020-04-21
US20200288476A1 (en) 2020-09-10
CN110190937B (zh) 2021-10-22
EP3629620B1 (en) 2021-08-04
EP3051870A4 (en) 2016-11-02
US11006420B2 (en) 2021-05-11
EP3051870B1 (en) 2019-07-03
EP3629620A1 (en) 2020-04-01
US20190090243A1 (en) 2019-03-21
CN105393589A (zh) 2016-03-09
EP3051870A1 (en) 2016-08-03

Similar Documents

Publication Publication Date Title
WO2015042896A1 (zh) 一种数据传输的方法及设备
WO2020167019A1 (en) Method, terminal device, base station, computer readable medium for measuring cross-link interference, and methods and apparatuses for random access preamble allocation, determination, and data transmission
WO2020032666A1 (ko) 원격 크로스 링크 간섭을 측정하는 방법 및 장치
WO2016028130A1 (en) Apparatus and method for operating resource in wireless local area network system supporting multi-user transmission scheme
WO2017171411A1 (en) Method and apparatus for transmitting and receiving data in a communication system
WO2017135674A1 (ko) 면허 및 비면허 대역을 지원하는 네트워크에서 통신 방법
EP3685619A1 (en) Method and network node for performing data transmission and measurements on multiple bandwidth parts
WO2014084638A1 (en) Method and apparatus for performing communication in a wireless communication system
WO2011136508A2 (en) Random access method and apparatus in wireless communication system
WO2019050316A1 (en) METHOD AND APPARATUS FOR RESOURCE DETERMINATION, RESOURCE CONFIGURATION, RANDOM ACCESS PREAMBLE TRANSMISSION, AND RANDOM ACCESS
WO2017135770A1 (ko) 무선랜 시스템에서 이진 시퀀스를 사용하여 stf 신호를 생성하는 방법 및 장치
WO2019212152A1 (ko) 무선랜 시스템에서의 신호 송수신 방법 및 이를 위한 장치
WO2019194664A1 (ko) 무선 통신 시스템에서 데이터를 송수신하기 위한 방법 및 이를 위한 장치
WO2017091034A1 (ko) 무선랜 시스템에서 피드백 프레임을 송신하는 방법 및 장치
WO2019199051A1 (ko) 통신 시스템에서 저지연 통신을 위한 방법 및 장치
WO2020067816A1 (ko) Nr v2x 시스템을 위한 harq 동작을 수행하는 방법 및 장치
WO2021091267A1 (en) Method and device for resource allocation
WO2019031856A1 (ko) 무선 통신 시스템에서 참조 신호를 송수신하기 위한 방법 및 이를 위한 장치
WO2018182366A1 (ko) Tcp/ip를 고려한 데이터 처리 방법
WO2019194663A1 (ko) 무선 통신 시스템에서 상향링크 제어 정보를 전송하는 방법 및 이를 위한 장치
WO2019240441A1 (ko) 무선랜 시스템에서 ppdu를 송신하는 방법 및 장치
WO2020222578A1 (ko) Nas 프로토콜을 이용한 세션 및 이동성 관리 방안
WO2018143728A1 (ko) 통신시스템에서의 데이터 처리 방법
WO2020060245A1 (en) Method and apparatus for identifying security key in next generation mobile communication system
WO2019013432A1 (ko) 무선랜 시스템에서 신호의 송수신 방법 및 이를 위한 장치

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201380078327.4

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13894722

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2013894722

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2013894722

Country of ref document: EP