WO2024055852A1 - 一种数据传输方法和装置 - Google Patents

一种数据传输方法和装置 Download PDF

Info

Publication number
WO2024055852A1
WO2024055852A1 PCT/CN2023/116574 CN2023116574W WO2024055852A1 WO 2024055852 A1 WO2024055852 A1 WO 2024055852A1 CN 2023116574 W CN2023116574 W CN 2023116574W WO 2024055852 A1 WO2024055852 A1 WO 2024055852A1
Authority
WO
WIPO (PCT)
Prior art keywords
frame
channel
send
duration
background
Prior art date
Application number
PCT/CN2023/116574
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 华为技术有限公司
Publication of WO2024055852A1 publication Critical patent/WO2024055852A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access

Definitions

  • the present application relates to the field of wireless communication technology, and in particular, to a data transmission method and device.
  • CSMA carrier sense multiple access
  • LBT listen before talk
  • CSMA CSMA
  • nodes In CSMA, nodes also need to perform a random backoff process before sending data each time.
  • the channel access method based on CSMA random backoff has a certain probability of collision, and every time a conflict occurs, the backoff window will increase exponentially. Not only that, the more concurrent users there are, the higher the probability of conflict and the greater the access delay.
  • the average delay of WiFi communication has good performance, due to the possibility of collision during access, the delay of WiFi communication is extended and tailed.
  • Embodiments of the present application provide a data transmission method and device to reduce the possibility of collision during a single transmission and reduce communication delay.
  • a data transmission method is provided.
  • the method may be performed by the first device, or by a chip/chip system.
  • the first device sends a first frame to the second device.
  • the first device does not need to perform channel monitoring when sending the first frame.
  • the first device detects that the channel status is idle, it waits for the first period of time to send the second frame.
  • the first device can send the first frame without monitoring the channel.
  • the first device can access the channel through the first frame.
  • it can seize the channel through the first frame.
  • the first frame can interrupt the data. transmission.
  • the first device can wait for a first period of time to send the second frame, which can reduce or avoid frame loss caused by collision of the second frame.
  • the first duration is less than or equal to (point interframe spacing, PIFS).
  • PIFS point interframe spacing
  • the PIFS may be a PIFS in the existing technology, such as 25 microseconds, or may be an evolution of the existing technology. Based on the above solution, if the first duration is less than or equal to PIFS, the waiting duration of the second device can be reduced to reduce the delay of the second frame.
  • the first frame includes a first duration field
  • the first duration field is used to indicate a second duration
  • the second frame is sent within the second duration.
  • the start time of the second duration may be the end time of the first frame
  • the end time of the second duration may be the start time of the second frame.
  • the destination address in the first frame is the address of the second device.
  • the duration field is used to indicate a certain period of time that the channel is occupied. Therefore, after other devices receive and parse the duration field in the frame, they will not transmit data within a certain period of time indicated by the duration field. Therefore, based on the above solution, by setting the duration field to the second duration, the purpose of occupying the channel for the second duration can be achieved. During the second duration, other devices will not access the channel to send data, which can improve the reliability of the second frame. Reduces the chance of frame loss in the second frame due to a collision.
  • the first device receives the third frame from the third device.
  • the first device does not send an acknowledgment frame for the third frame.
  • the first device may receive a third frame from the third device. If the first device does not send the acknowledgment frame of the third frame, the sending end of the third frame will consider that the third frame is lost, and will reconnect to the channel after waiting for the acknowledgment frame to time out. Therefore, the second frame can be given a chance to be sent.
  • the above solution can interrupt the burst sequence of greedy terminals.
  • the first frame may not require a reply acknowledgment frame.
  • the acknowledgment frame indication field indicates that the first frame does not require a reply acknowledgment frame.
  • the first frame includes a control frame, such as a clear to send (CTS) frame, or the first frame includes a data frame.
  • CTS clear to send
  • the destination address in the first frame is the address of the first device. Based on this solution, since the destination address of the first frame is the address of the first device, other devices will not reply with an acknowledgment frame after receiving the first frame, so that the first frame will not be replied with an acknowledgment frame.
  • the first device after the first device sends the second frame, the first device receives an acknowledgment frame for the second frame sent by the second device.
  • the first device receives the fourth frame sent by the second device.
  • the second frame includes a second duration field, the second duration field is used to indicate a third duration, and the fourth frame is sent within the third duration.
  • the duration field is used to indicate a certain period of time that the channel is occupied. Therefore, after other devices receive and parse the duration field in the frame, they will not transmit data within a certain period of time indicated by the duration field. Therefore, based on the above solution, by setting the duration field to the third duration, other devices except the first device and/or the receiving end of the second frame, that is, the second device, cannot access the channel to send within the third duration. data to achieve the purpose of channel reservation.
  • a communication device including: a processing unit and a transceiver unit.
  • a transceiver unit configured to send the first frame to the second device.
  • the first device does not need to perform channel monitoring when sending the first frame.
  • Processing unit used to detect channel status.
  • the transceiver unit is also used to wait for a first period of time to send the second frame when detecting that the channel status is idle.
  • the first duration is less than or equal to PIFS.
  • the PIFS may be a PIFS in the existing technology, such as 25 microseconds, or may be an evolution of the existing technology.
  • the first frame includes a first duration field
  • the first duration field is used to indicate a second duration
  • the second frame is sent within the second duration.
  • the start time of the second duration may be the end time of the first frame
  • the end time of the second duration may be the start time of the second frame.
  • the destination address in the first frame is the address of the second device.
  • the transceiver unit is also configured to receive the third frame from the third device.
  • the processing unit is also configured to determine not to send the acknowledgment frame of the third frame.
  • the first frame may not require a reply acknowledgment frame.
  • the acknowledgment frame indication field indicates that the first frame does not require a reply acknowledgment frame.
  • the first frame includes a control frame, such as a clear to send (CTS) frame, or the first frame includes a data frame.
  • CTS clear to send
  • the destination address in the first frame is the address of the first device.
  • the transceiver unit is also configured to receive an acknowledgment frame for the second frame sent by the second device.
  • the transceiver unit is also used to receive the fourth frame sent by the second device.
  • the second frame includes a second duration field, the second duration field is used to indicate a third duration, and the fourth frame is sent within the third duration.
  • a communication device in a third aspect, can be a communication device in any possible implementation of the second aspect in the above embodiments, or a communication device provided in any of the second aspects. in the chip.
  • the communication device includes a communication interface and a processor, and optionally, a memory.
  • the memory is used to store computer programs or instructions or data
  • the processor is coupled to the memory and the communication interface.
  • the processor reads the computer program, instructions or data
  • the communication device is caused to execute any one of the above first aspects. A method executed by the first device in a possible implementation.
  • the communication interface can be implemented through antennas, feeders, codecs, etc. in the communication device, or if the communication device is a chip provided in network equipment or terminal equipment, the communication interface can be the input of the chip /Output interface, such as input/output pins, etc.
  • the communication device may also include a transceiver for communicating with other devices.
  • embodiments of the present application provide a chip system, which includes a processor and may also include a memory, for implementing the method executed by the communication device in any possible implementation manner of the first aspect.
  • the chip system further includes a memory for storing program instructions and/or data.
  • the chip system can be composed of chips or include chips and other discrete devices.
  • the present application provides a computer-readable storage medium that stores a computer program or instructions.
  • the steps executed by the first device in the above aspects are implemented. method.
  • a computer program product includes: computer program code or instructions.
  • the methods performed by the first device node in the above aspects are executed.
  • a communication device in a seventh aspect, includes a unit or module that performs the methods of the above aspects.
  • a chip system including a logic circuit and an input-output unit.
  • a logic circuit configured to execute the method executed by the first device in any possible implementation manner of the first aspect.
  • the input and output unit is used for the first device to communicate with other devices, such as the second device.
  • Figure 1 is a schematic diagram of a network architecture provided by an embodiment of the present application.
  • Figure 2A is a schematic diagram of time delay based on random backoff
  • Figure 2B is a schematic diagram of the delay tail of the WiFi system
  • Figure 3 is a schematic diagram of a time-sliced data transmission method
  • Figure 4A is a schematic diagram of each service package in EDCA
  • Figure 4B is a schematic diagram of a scenario in which PIFS seizes a channel
  • Figure 5 is a schematic diagram of a data collision
  • Figure 6A is a schematic diagram of the transmission characteristics of a greedy terminal
  • Figure 6B is a schematic diagram of a greedy terminal burst and business packet collision
  • Figure 7 is an exemplary flow chart of a data transmission method provided by an embodiment of the present application.
  • Figure 8 is a schematic structural diagram of a possible first frame provided by an embodiment of the present application.
  • Figure 9 is a schematic structural diagram of another possible first frame provided by an embodiment of the present application.
  • Figure 10A is a schematic scenario diagram of a data transmission method provided by an embodiment of the present application.
  • Figure 10B is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 11A is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 11B is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 12 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 13 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 14 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 15A is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 15B is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 15C is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 16 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 17 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 18 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 19 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 20 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 21 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 22 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 23 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 24 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 25 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 26 is a schematic diagram of a scenario of another data transmission method provided by an embodiment of the present application.
  • Figure 27 is a schematic diagram of a communication device provided by an embodiment of the present application.
  • Figure 28 is a schematic diagram of another communication device provided by an embodiment of the present application.
  • Figure 29 is a schematic diagram of another communication device provided by an embodiment of the present application.
  • Figure 30 is a schematic diagram of yet another communication device provided by an embodiment of the present application.
  • the "after” and "before” mentioned in the embodiments of this application can be understood as the sequence of sending time or the sequence of receiving time.
  • the sending time of the first information is later than the first field, or the receiving time of the first information is later than the second field.
  • the first information precedes the second field it can be understood that the sending time of the first information is earlier than the second field, or the receiving time of the first information is earlier than the second field.
  • the embodiments of the present application may be applicable to WLAN scenarios, for example, may be applicable to Institute of Electrical and Electronics Engineers (IEEE) 802.11 system standards, such as 802.11a/b/g, 802.11n, 802.11ac, 802.11 ax standard, or its next generation, such as 802.11be standard, Wi-Fi 7 or extremely high throughput (EHT), 802.11ad, 802.11ay, 802.11bf, and the next generation of 802.11be, such as Wi-Fi 8 or next generation standards.
  • IEEE Institute of Electrical and Electronics Engineers
  • 802.11 system standards such as 802.11a/b/g, 802.11n, 802.11ac, 802.11 ax standard
  • 802.11be standard such as 802.11be standard, Wi-Fi 7 or extremely high throughput (EHT)
  • 802.11ad 802.11ay
  • 802.11bf extremely high throughput
  • Wi-Fi 8 or next generation standards such as Wi-Fi 8 or next generation standards.
  • WLAN starts with the 802.11a/g standard and proceeds through 802.11n, 802.11ac, 802.11ax and now the 802.11be being discussed.
  • 802.11n can also be called high throughput (HT); 802.11ac can also be called very high throughput (VHT); 802.11ax can also be called high efficiency (HE) or Wi -Fi 6; 802.11be can also be called EHT or Wi-Fi 7, and standards before HT, such as 802.11a/b/g, can be collectively called non-high throughput (Non-HT).
  • HT high throughput
  • VHT very high throughput
  • 802.11ax can also be called high efficiency (HE) or Wi -Fi 6
  • 802.11be can also be called EHT or Wi-Fi 7
  • standards before HT such as 802.11a/b/g, can be collectively called non-high throughput (Non-HT).
  • FIG. 1 a network architecture diagram of a WLAN applicable to an embodiment of the present application is shown.
  • FIG. 1 takes the WLAN including 1 wireless access point (AP) and 2 stations (STA) as an example.
  • STA can receive wireless frames sent by the AP and can also send wireless frames to the AP.
  • the embodiment of the present application is also applicable to communication between APs.
  • each AP can communicate with each other through a distributed system (DS), and the embodiment of the present application is also applicable to communication between STAs.
  • DS distributed system
  • the number of APs and STAs in FIG. 1 is only an example, and can be more or less.
  • the access point can be an access point for terminal devices (such as mobile phones) to enter the wired (or wireless) network. It is mainly deployed inside homes, buildings and campuses. The typical coverage radius is tens of meters to hundreds of meters. Of course, it can also Can be deployed outdoors.
  • the access point is equivalent to a bridge connecting the wired network and the wireless network. Its main function is to connect various wireless network clients together, and then connect the wireless network to the Ethernet.
  • the access point can be a terminal device (such as a mobile phone) or a network device (such as a router) with a Wi-Fi chip.
  • the access point can be a device that supports the 802.11be standard.
  • the access point can also support various wireless local area networks (WLAN) of the 802.11 family such as 802.11ax, 802.11ac, 802.11ad, 802.11ay, 802.11n, 802.11g, 802.11b, 802.11a and 802.11be next generation. ) standard equipment.
  • WLAN wireless local area networks
  • the site can be a wireless communication chip, wireless sensor or wireless communication terminal, etc., and can also be called a user.
  • the site can be a mobile phone that supports Wi-Fi communication function, a tablet computer that supports Wi-Fi communication function, a set-top box that supports Wi-Fi communication function, a smart TV that supports Wi-Fi communication function, or a smart TV that supports Wi-Fi communication function.
  • the site can support the 802.11be standard.
  • the site can also support multiple wireless local area networks (WLAN) standards of the 802.11 family such as 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, 802.11a, 802.11be next generation.
  • WLAN wireless local area networks
  • access points and sites can be devices used in the Internet of Vehicles, IoT nodes, sensors, etc. in the Internet of Things (IoT), smart cameras, smart remote controls, smart water meters and electricity meters in smart homes, and sensors in smart cities, etc.
  • IoT Internet of Things
  • smart cameras smart remote controls
  • smart water meters and electricity meters in smart homes and sensors in smart cities, etc.
  • the APs and STAs involved in the embodiments of this application may be APs and STAs applicable to the IEEE 802.11 system standard.
  • AP is a device deployed in a wireless communication network to provide wireless communication functions for its associated STAs.
  • the AP can be used as the hub of the communication system. It is usually a network-side product that supports the MAC and PHY of the 802.11 system standard, such as a router. , gateways, repeaters, communication servers, switches or bridges and other communication equipment.
  • APs STA is usually a terminal product that supports the media access control (MAC) and physical layer (physical, PHY) of the 802.11 system standard, such as mobile phones, laptops, etc.
  • MAC media access control
  • PHY physical layer
  • the first device involved in the embodiment of this application may be an AP or a STA.
  • the second device involved in the embodiment of this application may be an AP or a STA.
  • CSMA carrier sense multiple access
  • CCA clear channel assessment
  • nodes also need to perform a random backoff process before sending data each time. Specifically, before sending data, the node can randomly generate a random backoff count value according to the set parameters. The node can monitor the channel in each time slot. If the channel status is idle, the node can perform random backoff, that is, the random backoff count value is decremented by 1. If the channel status is not idle, the random backoff count value is not. minus 1. Only when the random backoff count value is 0, the node can send data.
  • the channel access method based on CSMA random backoff has a certain probability of collision, and every time a conflict occurs, the backoff window will increase exponentially, as shown in Figure 2A. Not only that, the more concurrent users there are, the higher the probability of conflict and the greater the access delay. Although the average delay of WiFi communication has good performance, due to the possibility of collision during access, the duration of WiFi communication is extended and tailed, as shown in Figure 2B.
  • WiFi communication cannot guarantee the success rate of a single transmission. That is, when the link layer is reliable, collisions of a single transmission cannot be avoided, which requires retransmission, resulting in tail delays. Therefore, how to reduce the tail delay of WiFi communication, that is, how to ensure the reliability of a single transmission, has become particularly important.
  • data can currently be transmitted in the following two ways.
  • Method 1 The data transmission of all nodes is managed and directed by the AP to avoid collisions and air interface competition.
  • the AP allocates time slices to each node, and each node transmits data according to the time allocation.
  • the AP can allocate time slots to 5 nodes.
  • node 1 corresponds to slot 1
  • node 2 corresponds to slot 2
  • node 3 corresponds to slot 3
  • node 4 corresponds to slot 4
  • node 5 corresponds to slot 1.
  • Time slot 5 corresponds to slot 1.
  • Time slot 5 corresponds to slot 1.
  • Time slot 5 corresponds to slot 1.
  • 802.11e introduces the concept of enhanced distributed channel access (EDCA).
  • EDCA enhanced distributed channel access
  • the packets coming down from the upper layer will be divided into four types of business packets by EDCA: background (BK), best effort transmission (best effort, BE), video (video, VI), and voice (voice, VO).
  • BK background
  • best effort transmission best effort, BE
  • video video
  • VI video
  • voice voice
  • VO voice
  • the EDCA parameter determines the probability of each service packet occupying the channel, ensuring that high-priority service packets have a greater chance of occupying the channel than low-priority service packets.
  • the channel competition priority of various service packages can be adjusted by adjusting the EDCA parameters that control each service package, thereby adjusting the delay and throughput performance of different services.
  • DIFS distributed inter frame spacing
  • the extreme configuration of EDCA is to configure AIFSN to 1, and the node does not perform random backoff. That is, when the node determines that the channel is idle for a period of time reaching the point coordination function inter-frame interval PIFS, the service packet is sent.
  • PIFS preemption is to seize the channel faster than other nodes and reduce the impact of access delay.
  • the AP monitors the channel. Since the background STA is sending background service packets, the channel status is "busy". The AP continues to monitor the channel. After determining that the channel is idle for PIFS, the AP can send service packets for low-latency services. It can be understood that when the background STA sends the background service packet again, it needs to wait for the channel to be idle for DIFS before proceeding. Machine to retreat. After the random backoff ends, the background service packet can be sent. However, since PIFS ⁇ DIFS, that is, the waiting time of the AP is less than the waiting time of the background STA, the AP can seize the channel as soon as possible and send low-latency service data packets without collision.
  • the backoff duration remains 3 time slots close to PIFS.
  • the background STA's random backoff ends and the background service packet is sent. It can be seen from Figure 5 that the data packets of the low-latency service collide with the background service packets, so the data packets of the low-latency service and the background service packets may be lost.
  • TXOP transmission opportunity
  • These terminals will continue to occupy the air interface when sending service packets, so they are called greedy terminals.
  • the greedy terminal has the characteristic of continuous bursts, and each burst often lasts for 10ms or even higher.
  • Each business packet in the burst is sent at SIFS intervals. The interval between bursts is sometimes PIFS.
  • the AP sends high-priority extreme configuration services, such as low-latency service packets, which can easily collide with the burst of greedy terminals.
  • high-priority extreme configuration services such as low-latency service packets
  • the service packets of low-latency services cannot seize the channel.
  • the next burst will be sent again at intervals of PIFS.
  • the AP also uses PIFS to preempt, and a collision will occur.
  • the first device may send the first frame without performing channel monitoring.
  • the first device may wait for the first period of time to send the second frame when detecting that the channel status is idle.
  • the channel can be detected or preempted through the first frame.
  • the first frame can interrupt the data transmission and protect the second frame of the low-latency service, reducing the Or avoid collision in the second frame, causing frame loss.
  • an exemplary flow chart of a data transmission method may include the following operations.
  • S701 The first device sends the first frame to the second device.
  • the first device does not need to perform channel monitoring when sending the first frame. That is to say, the first device can send the first frame without being sure whether the channel is idle.
  • the first device may monitor the channel when sending the first frame. For example, the first device may use CCA to detect whether the channel status is idle.
  • the first device may send the first frame when the channel status is idle.
  • the first device may send the first frame when the channel is idle for a set time period.
  • the set duration can be set to be less than PIFS, such as less than or equal to 25 microseconds, or the set duration can be set to SIFS, such as 16 microseconds.
  • the first device may not send the first frame when the channel status is not idle.
  • the first frame may not require a reply acknowledgment frame.
  • the first frame may be a control frame, such as a clear to send (CTS) frame.
  • CTS clear to send
  • FIG. 8 is a schematic structural diagram of a possible first frame provided by an embodiment of the present application.
  • the first frame may be a CTS frame.
  • the first frame may include a frame control (frame control) field, a duration (duration) field, a destination address (received address, RA) field, and a frame check sequence (frame check sequence, FCS) field.
  • the first frame may not need to reply with an acknowledgment frame. Therefore, the first device can seize the channel by sending a control frame to the second device.
  • the destination address in the first frame may indicate the address of the first device, such as the MAC address of the first device, or the address of the second device, such as the MAC address of the second device.
  • the RA field in Figure 8 may indicate the address of the first device or the address of the second device.
  • the CTS frame shown in FIG. 8 is only used as an implementation method of the first frame and is not used as a limitation on the first frame.
  • the first frame can also be other control frames that do not require a reply acknowledgment frame.
  • the first frame may be a data frame.
  • the data frame may include an acknowledgment frame indication field (ACK policy), and the acknowledgment frame indication field may indicate that no reply to an acknowledgment frame is required.
  • ACK policy acknowledgment frame indication field
  • FIG. 9 is a schematic structural diagram of a possible first frame provided by an embodiment of the present application.
  • the first frame may include a frame control field, a duration field, an address 1 (address1) field, an address 2 (address 2) field, an address 3 (address 4) field, a sequence control (sequence control) field, an address 4 ( address4) field, quality of service (QoS) (control) field, high throughput control (HT control) field, frame body (frame body) field and FCS field.
  • QoS quality of service
  • the QoS control field may include an acknowledgment frame indication field, which may indicate that the first frame does not need to reply to an acknowledgment frame.
  • the acknowledgment frame indication field may be 1-bit information. When the acknowledgment frame indication field has a value of 1, it indicates that the first frame needs to reply with an acknowledgment frame. When the acknowledgment frame indication field has a value of 0, it indicates that the first frame does not need to reply. Acknowledgment frame.
  • the value of the confirmation frame indication field is 0, it indicates that the first frame needs to reply to the confirmation frame; when the value of the confirmation frame indication field is 1, it indicates that the first frame does not need to reply to the confirmation frame.
  • the destination address in the first frame may indicate the address of the first device, such as the MAC address of the first device, or the address of the second device, such as the MAC address of the second device.
  • the address 4 field in Figure 9 may indicate the address of the first device or the address of the second device.
  • the data frame shown in FIG. 9 is only used as an implementation method of the first frame and is not used as a limitation on the first frame.
  • the first frame can also be other data frames that do not require a reply acknowledgment frame.
  • the first frame involved in the embodiment of this application may be a frame, or may be a sequence of frames. Multiple frames may be included in the frame sequence.
  • the second frame involved in the embodiment of this application may be a frame, or may be a sequence of frames. Multiple frames may be included in the frame sequence.
  • the first device can detect whether the channel status is idle through CCA.
  • the second frame may be a data frame, that is, a data frame of a service of the first device, such as a data frame of a low-latency service.
  • the first duration may be predefined by the protocol or preconfigured, and is not specifically limited in this application.
  • the first duration may be set to be less than or equal to PIFS, such as less than or equal to 25 microseconds, or the first duration may be set to SIFS, such as 16 microseconds.
  • the first device may monitor the channel and send the second frame after confirming that the channel is idle for the first time period. It can be understood that the embodiment of the present application does not limit the manner in which the first device performs channel monitoring.
  • FIG. 10A is a schematic diagram of a data transmission method provided by an embodiment of the present application.
  • the AP can send the first frame without monitoring the channel. After the first frame is sent, the AP can monitor the channel and send the second frame after the channel is idle for the first length of time.
  • the AP can wait for a specified period of time before sending the first frame, as shown in Figure 10A.
  • the specified duration can be predefined by the protocol or pre-configured.
  • the specified duration can be set to be less than or equal to PIFS, such as less than or equal to 25 microseconds, or the specified duration can be set to SIFS, such as 16 microseconds. , or the specified duration can be set to 0 microseconds.
  • the first device does not need to monitor the channel when sending the first frame, so the first device can seize the channel.
  • the first device may wait for the first period of time to send the second frame when the channel status is idle. Therefore, the first device can avoid collision of the second frame and reduce or avoid loss of the second frame.
  • the first frame can interrupt the data transmission and protect the second frame of the low-latency service, reducing or avoiding the frame loss caused by the collision of the second frame.
  • FIG. 10B is a schematic diagram of a data transmission method provided by an embodiment of the present application.
  • the AP can monitor the channel and send the first frame after the channel is idle for a set period of time. After the first frame is sent, the AP can monitor the channel and send the second frame after the channel is idle for the first length of time.
  • the AP can wait for a specified period of time before sending the first frame, as shown in Figure 10B.
  • the specified duration can be predefined by the protocol or pre-configured.
  • the specified duration can be set to be less than or equal to PIFS, such as less than or equal to 25 microseconds, or the specified duration can be set to SIFS, such as 16 microseconds. , or the specified duration can be set to 0 microseconds.
  • the first device sends the first frame when the channel status is idle, so it can seize the idle channel.
  • the first device may wait for the first period of time to send the second frame when the channel status is idle. In this way, the first device can avoid collision of the second frame and reduce or avoid loss of the second frame.
  • the first frame can interrupt the data transmission and protect the second frame of the low-latency service, reducing or avoiding the frame loss caused by the collision of the second frame.
  • the above-mentioned first frame can realize rapid preemption of the channel.
  • the AP can send the first frame.
  • the AP can send the first frame.
  • the AP can wait for a specified length of time (XIFS) to send the first frame.
  • XIFS specified length of time
  • the AP can monitor the channel after sending the first frame.
  • the AP can detect that the channel status is idle and wait for the first time to send the second frame, such as a service packet for a low-latency service.
  • STA1 can receive the second frame from the AP and send an acknowledgment frame (ACK) of the second frame to the AP after a SIFS interval.
  • ACK acknowledgment frame
  • the AP can send the first frame.
  • the AP may determine to send the first frame when the channel status is idle.
  • the AP can send the first frame when the channel is idle for a set time.
  • the AP can Perform channel monitoring.
  • the AP can detect that the channel status is idle and wait for the first time to send the second frame, such as a service packet for a low-latency service.
  • STA1 can receive the second frame from the AP and send an ACK of the second frame to the AP after a SIFS interval.
  • the background STA1 since the background STA1 determines that the channel status is busy when the AP sends the first frame, the background STA1 does not perform random backoff and waits for the channel status to be idle before performing random backoff. For example, background STA1 detects that the channel status is idle at time t1, so the background STA can wait for the channel to be idle for DIFS and then perform random backoff. At time t2, background STA1 completes random backoff, the random backoff count value is 0, and background STA1 can send background service packets. Background STA2 can receive the background service packet from background STA1, and send an acknowledgment frame of the background service packet to background STA2 after an SIF interval.
  • the AP can send the first frame without channel monitoring, and can seize the channel at the first time when the channel is idle.
  • the AP detects that the channel state is idle, it can wait for the second time length to send the second frame, thereby reducing or avoiding the collision of the second frame and achieving reliable transmission of the second frame.
  • the AP can send the first frame when the channel status is idle, and can seize the channel as soon as the channel is idle.
  • the AP can wait for a second period of time to send the second frame, thereby reducing or avoiding collisions of the second frame and achieving reliable transmission of the second frame.
  • the first frame may include a first duration field.
  • the first duration field may indicate a second duration
  • the second frame may be sent within the second duration.
  • a second duration may be indicated in the duration field.
  • the start time of the second duration may be the start time of the first frame
  • the end time of the second duration may be the start time of the second frame. start time.
  • the AP can send the first frame. For example, when the low-latency service reaches the AP, the AP can send the first frame. Optionally, the AP can wait for a specified length of time (XIFS) to send the first frame. For another example, the AP may determine to send the first frame when the channel status is idle. Optionally, the AP can send the first frame when the channel is idle for a set time.
  • the first frame may include a duration field, and the duration field indicates a second duration, such as the duration between tA and tB as shown in FIG. 12 .
  • the background STA1 receives the first frame and determines that the destination address in the first frame is not the destination address of the background STA1, and the duration field in the first frame indicates the second duration, that is, between tA and tB. duration. Therefore, the background STA1 cannot access the channel within the second time period, that is, the background STA1 cannot send the service packet within the second time period. Similarly, background STA2 cannot access the channel within the second time period.
  • the AP can detect that the channel status is idle and wait for the first time to send the second frame at time tB, such as a service packet for a low-latency service.
  • the first frame can indicate the second duration through the first duration field.
  • the second duration except for the node indicated by the destination address, other nodes cannot access the channel, so it can improve Reliability of the second frame, reducing the possibility of collisions in the second frame.
  • the first frame can interrupt the transmission of service packets on the air interface. Take the greedy terminal as an example to illustrate.
  • FIG 13 is a schematic diagram of a data transmission method provided by an embodiment of the present application.
  • the background STA1 can send frames with the characteristics of burst sequence.
  • the AP can send the first frame.
  • the AP can wait for a specified length of time (XIFS) to send the first frame. Since the AP does not need to monitor the channel when sending the first frame.
  • XIFS specified length of time
  • the first frame collides with the frame of background STA1. Therefore, background STA2 cannot receive the frame from background STA1, so background STA2 will not send an acknowledgment frame to background STA1. Therefore, the background STA1 will not receive the acknowledgment frame from the AP.
  • the background STA does not receive an acknowledgment frame within the preset time period, it will consider that waiting for the acknowledgment frame has timed out, so the background STA will perform random backoff again and retransmit the colliding frame.
  • the AP detects that the channel status will be idle, so the AP can wait for the channel to be idle for a first period of time before sending the second frame.
  • the above-mentioned preset time period may be predefined by the protocol or preconfigured.
  • the preset time period may be configured as 50 microseconds. It can be understood that when the AP sends the first frame without monitoring the channel, the transmission of service packets on the air interface can be interrupted as shown in Figure 13. If the AP monitors the channel and sends the first frame when the channel status is idle, the first frame cannot interrupt the transmission of service packets on the air interface.
  • the embodiment shown in Figure 13 takes the first frame interrupting the service packet of the greedy terminal as an example.
  • the first frame provided by the embodiment of the present application can not only interrupt the service packets of greedy terminals, but also interrupt the service packets of other nodes.
  • Figure 14 which is a schematic diagram of a data transmission method provided by an embodiment of the present application.
  • Background STA1 monitors the channel and determines that the channel status is idle. Therefore, the background STA1 can reach After DIFS, at time t1, after random backoff, the background service packet is sent at time t2.
  • the AP sends the first frame at time t2. That is, the first frame collides with the background service packet sent by the background STA1. Therefore, background STA2 cannot accurately receive the background service packet from background STA1 and does not send an acknowledgment frame to background STA1. Therefore, when the background STA1 times out while waiting for the acknowledgment frame, it will perform random backoff to access the channel again.
  • the background STA1 While the background STA1 is waiting for the acknowledgment frame, the AP can monitor the channel. Since there is no data transmission on the channel, the AP can determine that the channel status is idle. The AP can wait the first period of time to send the second frame.
  • STA3 can receive the second frame from the AP and send an acknowledgment frame of the second frame to the AP after a SIFS interval.
  • background STA1 can detect that the channel status is idle. Therefore, background STA1 can perform random backoff after the channel is idle for DIFS. And complete random backoff at time t3, and retransmit the interrupted background service packet.
  • the first device regardless of whether the first device monitors the channel before sending the first frame, it can interrupt the transmission of service packets on the air interface and seize the channel.
  • the AP can interrupt the transmission of the service packet on the air interface through the first frame.
  • the sender and the receiver will think that the frame is currently being interacted with. is lost, so the sender will perform random backoff again and access the channel, so the AP can win the opportunity to send the subsequent second frame through the first frame.
  • the second device may send an acknowledgment frame of the second frame to the first device.
  • the second device may also send the fourth frame to the first device.
  • the second frame may include a second duration field (the duration field shown in Figure 9).
  • the second duration field may indicate a third duration, and the fourth frame may be sent within the third duration.
  • the fourth frame can be understood as a service packet sent by the second device to the second device.
  • the AP can send the first frame. For example, when the low-latency service reaches the AP, the AP can send the first frame.
  • the AP can wait for a specified length of time (XIFS) to send the first frame.
  • XIFS specified length of time
  • the AP can monitor the channel after sending the first frame.
  • the AP can detect that the channel status is idle and wait for the first time to send the second frame, such as a service packet for a low-latency service.
  • the second frame may include a second duration field.
  • the second duration field may indicate a third duration.
  • the background STA1 receives the second frame and determines that the destination address in the second frame is not the destination address of the background STA1, and the duration field in the second frame indicates a third duration. Therefore, the background STA1 cannot access the channel within the third time period, that is, the background STA1 cannot send the service packet within the third time period.
  • STA3 can send the fourth frame, such as the service packet of the uplink service, to the AP within the third time period.
  • STA3 can also send an acknowledgment frame to the AP within the third time period.
  • the AP can send the first frame. For example, when low-latency services arrive at the AP, the AP can monitor the channel and send the first frame when the channel status is idle. Optionally, the AP can send the first frame when the channel is idle for a set time. The AP can monitor the channel after sending the first frame. The AP can detect that the channel status is idle and wait for the first time to send the second frame, such as a service packet for a low-latency service.
  • the second frame may include a second duration field. The second duration field may indicate a third duration.
  • the background STA1 receives the second frame and determines that the destination address in the second frame is not the destination address of the background STA1, and the duration field in the second frame indicates a third duration. Therefore, the background STA1 cannot access the channel within the third time period, that is, the background STA1 cannot send the service packet within the third time period.
  • STA3 can send the fourth frame, such as the service packet of the uplink service, to the AP within the third time period.
  • STA3 can also send an acknowledgment frame to the AP within the third time period.
  • the second duration field in the second frame can indicate a third duration.
  • STA3 can send a service packet to the AP to achieve channel reservation and reduce the possibility of collision in the fourth frame. possibility.
  • the STAs in Figures 10A to 15C may be STAs associated with the AP of the current cell, or may be STAs associated with the AP of the adjacent cell on the same frequency.
  • the AP, STA, and background STAs shown in FIGS. 10A to 15C are only shown as examples. Without loss of generality, the data transmission method provided by the embodiment of the present application can be applied to any WiFi device.
  • FIG. 16 there is an AP in this cell, and the AP is associated with a low-latency service receiving end (low-latency STA) and a background STA.
  • the first duration is used as PIFS and the index
  • the timing length is PIFS as an example for explanation.
  • both the background STA and the low-latency STA are associated with the AP of this cell.
  • the background STA1 there is a background STA1 on the channel that is sending background service packets.
  • the service packets of the AP and the background STA need to wait for the end of the transmission of the current background service packet, that is, the AP sends the ACK frame of the background service packet to the background STA before the timing can start.
  • the background STA can determine that the channel idle time reaches the DIFS time and then send the frame without random backoff.
  • the AP can wait for PIFS before sending the first frame, or the AP can monitor the channel and send the first frame after the channel is idle for PIFS, PIFS ⁇ DIFS, so the waiting time of the AP is less than the waiting time of the background STA. Therefore, the AP can send the first frame before the background STA.
  • the first frame may include a first duration field, and the first duration field indicates the second duration.
  • the AP can detect that the channel status is idle and wait for PIFS to send the second frame.
  • the AP may not send ACK to the background STA.
  • the AP does not send an ACK to the background STA, and waits for PIFS before sending the first frame or monitoring the channel, and sends the first frame after the channel is idle for PIFS. Since the background STA does not receive an ACK from the AP, it can be considered that the frame is lost, so it will wait for the ACK to time out and then perform random backoff to access the channel again.
  • the AP can seize the channel through the first frame and reserve a time window for the second frame through the first duration field to reduce the possibility of collision in the second frame.
  • the AP sends the first frame. If the background STA has just completed random backoff at this time, or the background STA1 determines that the idle time of the message reaches DIFS, the background STA will send the frame. Therefore, the first frame is sent colliding with the frame sent by the background STA. Since WiFi is a time division duplexing (TDD) system, the transceiver mode is not turned on at the same time, so the AP cannot receive frames from the background STA when sending the first frame, and thus does not send ACK to the background STA. The background STA will perform random backoff and retransmit the above-mentioned colliding frames after waiting for the ACK timeout.
  • TDD time division duplexing
  • the AP can wait for PIFS to send the second frame of the low-latency service after detecting that the channel is idle. Based on the embodiments shown in Figures 17 to 19, the AP can reduce the collision probability of a single transmission through the first frame, and can implement the second frame through the sacrifice of the first frame or the first duration field in the first frame.
  • the purpose of protection is to ensure the transmission of low-latency services.
  • FIGS 17 to 19 show the scenario where the background STA standard associated with the AP of this cell complies with the protocol.
  • the following describes the scenario in which the AP interrupts the burst of the greedy terminal based on the first frame when the background STA associated with the AP in this cell is a greedy terminal.
  • the AP can send an ACK to the background STA.
  • the AP can wait for PIFS before sending the first frame.
  • the background STA waits for SIFS for the channel to be idle before sending the background service packet. Since SIFS ⁇ PIFS, the first frame collides with the background service packet of the background STA. Since WiFi is a TDD system, the transceiver mode is not turned on at the same time. At this time, the AP is already in the sending state, so it cannot receive the background service packet, so no ACK will be sent to the background STA. In this way, the background STA times out when waiting for ACK, thinks that the background service packet is lost, and retransmits it. The background STA can perform random backoff and retransmit the background service packet after the channel is idle AIFS.
  • the AP After sending the first frame, the AP monitors the channel. And send the second frame after the channel is idle PIFS. Since PIFS is less than the preset waiting time of the background STA, and the waiting time of other devices is DIFS > PIFS, collision-free transmission of the second frame can be guaranteed. It can be understood that when the AP sends the first frame without monitoring the channel, the transmission of service packets on the air interface can be interrupted as shown in Figure 20. If the AP monitors the channel and sends the first frame when the channel status is idle, the first frame cannot interrupt the transmission of the greedy terminal.
  • the AP may not send an ACK of the burst sequence.
  • the AP after receiving the background service packet from the background STA, the AP does not send an ACK to the background STA.
  • the AP can wait for PIFS before sending the first frame. Therefore, the AP can seize the channel through the first frame. Since the AP does not send an ACK to the background STA, the background STA will consider that the background service packet is lost when waiting for the ACK and times out, and retransmit it.
  • the first duration field indicates the second duration. Therefore, after receiving the first frame, the background STA remains silent for the second duration and does not access the channel.
  • the AP sends the second frame after PIFS when the channel is idle. Since devices other than the AP do not access the channel during the second time period, collision-free transmission of the second frame can be guaranteed.
  • the AP can reduce the collision probability of a single transmission through the first frame, and can protect the second frame through the sacrifice of the first frame or the first duration field in the first frame.
  • the purpose is to ensure the transmission of low-latency services.
  • the problem of greedy terminals occupying the air interface for a long time and not releasing it is avoided.
  • the burst sequence is interrupted by the first frame, so that low-latency services can be sent in time and the delay is reduced. It can be understood that, compared with the solution shown in FIG. 20 , the solution shown in FIG. 21 has a waiting time one frame shorter and a lower delay.
  • Figures 16 to 21 illustrate using the background STA associated with the AP of this cell as an example.
  • the following describes a scenario in which a background STA is associated with an AP in a same-frequency cell with reference to Figures 22 to 26.
  • AP1 there is an AP1 in this cell, and AP1 is associated with a low-latency STA at the service receiving end.
  • AP1 is associated with a low-latency STA at the service receiving end.
  • the background STA is associated with AP2 of the same-frequency cell.
  • the first duration is PIFS and the specified duration is PIFS as an example.
  • the background STAs are all associated with AP2 of the same frequency cell.
  • AP1's service packet needs to wait for the end of the transmission of the current background service packet, that is, AP2 sends the ACK frame of the background service packet to the background STA before it can start timing.
  • the background STA can determine that the channel idle time reaches the DIFS time and then send the frame without random backoff.
  • AP1 can wait for PIFS before sending the first frame or monitor the channel, it will send the first frame after the channel is idle for PIFS.
  • PIFS ⁇ DIFS, so AP1's waiting time is shorter than the waiting time of the background STA. Therefore, AP1 can send the first frame before the background STA.
  • the first frame may include a first duration field, and the first duration field indicates the second duration.
  • the AP can detect that the channel status is idle and wait for PIFS to send the second frame.
  • AP1 sends the first frame at time t1. If the background STA has just completed random backoff at this time, or the background STA determines that the length of the message idle period has just reached DIFS, the background STA will send the frame. Therefore, the first frame collides with the frame sent by the background STA, which affects the channel estimation, scrambling seed acquisition, and data equalization of the frame sent by the background STA. As a result, AP2 fails to decode the frame of the background STA and the frame is lost. Therefore AP2 will not send ACK to the background STA. The background STA will perform random backoff and retransmit the above-mentioned colliding frames after waiting for the ACK timeout. AP1 can wait for PIFS to send the second frame of the low-latency service after detecting that the channel is idle.
  • AP1 can reduce the collision probability of a single transmission through the first frame, and can protect the second frame through the sacrifice of the first frame or the first duration field in the first frame.
  • the purpose is to ensure the transmission of low-latency services.
  • the background STA is a standard-compliant STA.
  • the following describes the situation in which the AP interrupts the burst of the greedy terminal based on the first frame when the background STA associated with the AP in the same frequency neighbor cell is a greedy terminal.
  • AP1 monitors the channel.
  • the background STA sends a background service packet to AP2.
  • AP1 can wait for AP2 to send an ACK to the background STA and then wait for PIFS to send the first frame. Because after receiving the ACK from the background STA, it waits for the channel to be idle for SIFS before sending the background service packet. Therefore, the first frame collides with the background service packet, which affects AP2's channel estimation, scrambling seed acquisition, and data equalization of the background service packet. As a result, AP2 fails to decode the background service packet and therefore does not send ACK to the background STA. In this way, the background STA times out when waiting for ACK, thinks that the background service packet is lost, and retransmits it. The background STA can perform random backoff and retransmit the background service packet after the channel is idle AIFS.
  • AP1 After AP1 sends the first frame, it monitors the channel. And send the second frame after the channel is idle PIFS. Since PIFS is less than the preset waiting time of the background STA, and the waiting time of other devices is DIFS > PIFS, collision-free transmission of the second frame can be guaranteed.
  • AP1 can wait for the background STA to send the background service packet before sending the first frame.
  • AP1 monitors the channel.
  • the background STA sends a background service packet to AP2.
  • AP1 can wait for the background STA to send the background service packet and then wait for the PIFS to send the first frame.
  • AP2 After receiving the background service packet from the background STA, AP2 will send an ACK to the background STA. Therefore, the ACK collides with the background service packet, which affects the background STA's channel estimation, scrambling seed acquisition, and data equalization of the ACK, causing the background STA to fail to decode the ACK.
  • the background STA will fail to receive ACK, which will cause the background STA to wait for ACK to time out.
  • the background STA will think that the background service packet is lost and retransmit it.
  • the background STA can perform random backoff and retransmit the background service packet after the channel is idle AIFS.
  • AP1 After AP1 sends the first frame, it monitors the channel. And send the second frame after the channel is idle PIFS. Since PIFS is less than the preset waiting time of the background STA, and the waiting time of other devices is DIFS > PIFS, collision-free transmission of the second frame can be guaranteed.
  • the problem of greedy terminals in co-frequency neighboring cells occupying the air interface for a long time and not releasing it is avoided.
  • the transmission of the burst sequence is interrupted by the first frame, so that low-latency services can be sent in time, reducing the time delay.
  • the first frame will interrupt the ACK sent by AP2, so compared with the embodiment shown in Figure 25, the delay is lower.
  • the AP sends the first frame without monitoring the channel, the transmission of service packets on the air interface can be interrupted as shown in Figure 25 and Figure 26. If the AP monitors the channel and sends the first frame when the channel status is idle, the first frame cannot interrupt the transmission of the greedy terminal.
  • FIG. 27 is a schematic block diagram of a communication device 2700 provided by an embodiment of the present application.
  • the communication device 2700 can correspondingly implement the functions or steps implemented by the first device in each of the above method embodiments.
  • the communication device may include a processing unit 2710 and a transceiver unit 2720.
  • a storage unit may also be included, which may be used to store instructions (code or programs) and/or data.
  • processing unit 2710 and the transceiver unit 2720 can be coupled with the storage unit.
  • the processing unit 2710 can read the instructions (code or program) and/or data in the storage unit to implement the corresponding method.
  • Each of the above units can be set up independently or partially or fully integrated.
  • the communication device 2700 can correspondingly implement the behaviors and functions of the first device in the above method embodiment.
  • the communication device 2700 may be the first device, or may be a component (such as a chip or circuit) used in the first device.
  • the transceiver unit 2720 may be used to perform all receiving or sending operations performed by the first device in the embodiment shown in FIG. 7 .
  • Transceiver unit 2720 configured to send the first frame to the second device.
  • the first device does not need to perform channel monitoring when sending the first frame.
  • Processing unit 2710 used to detect channel status.
  • the transceiver unit 2720 is also configured to wait for a first period of time to send the second frame when detecting that the channel status is idle.
  • processing unit 2710 and the transceiver unit 2720 For operations performed by the processing unit 2710 and the transceiver unit 2720, please refer to the relevant descriptions of the foregoing method embodiments.
  • processing unit 2710 in the embodiment of the present application can be implemented by a processor or processor-related circuit components
  • transceiver unit 2720 can be implemented by a transceiver or transceiver-related circuit components or a communication interface.
  • an embodiment of the present application provides a communication device 2800.
  • the communication device 2800 includes a processor 2810.
  • the communication device 2800 may also include a memory 2820 for storing instructions executed by the processor 2810 or input data required for the processor 2810 to run the instructions or data generated after the processor 2810 executes the instructions.
  • the processor 2810 can implement the method shown in the above method embodiment through instructions stored in the memory 2820.
  • an embodiment of the present application provides a communication device 2900.
  • the communication device 2900 may be a chip or a chip system.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • the communication device 2900 may include at least one processor 2910 coupled to a memory.
  • the memory may be located within the device or outside the device.
  • communication device 2900 may also include at least one memory 2920.
  • the memory 2920 stores the computer programs, configuration information, computer programs or instructions and/or data necessary to implement any of the above embodiments; the processor 2910 may execute the computer program stored in the memory 2920 to complete the method in any of the above embodiments.
  • the coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules.
  • Processor 2910 may cooperate with memory 2920.
  • the specific connection medium between the above-mentioned transceiver 2930, processor 2910 and memory 2920 is not limited in the embodiment of the present application.
  • the communication device 2900 may also include a transceiver 2930, and the communication device 2900 may interact with other devices through the transceiver 2930.
  • the transceiver 2930 can be a circuit, a bus, a transceiver, or any other device that can be used for information exchange, or is also called a signal transceiver unit. As shown in Figure 29, the transceiver 2930 includes a transmitter 2931, a receiver 2932 and an antenna 2933.
  • the transceiver in the communication device 2900 can also be an input-output circuit and/or a communication interface, which can input data (or receive data) and output data ( Or, sending data),
  • the processor is an integrated processor or microprocessor or integrated circuit, and the processor can determine the output data according to the input data.
  • the communication device 2900 can be applied to the first device.
  • the communication device 2900 can be the first device, or can be a first device that can support the first device to implement any of the above-mentioned embodiments.
  • functional device The memory 2920 stores the necessary computer programs, computer programs or instructions and/or data to implement the functions of the first device in any of the above embodiments.
  • the processor 2910 can execute the computer program stored in the memory 2920 to complete the method executed by the first device in any of the above embodiments.
  • the communication device 2900 provided in this embodiment can be applied to the first device, the method performed by the first device is completed. Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.
  • the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or Execute each method, step and logical block diagram disclosed in the embodiment of this application.
  • a general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor for execution, or can be executed by a combination of hardware and software modules in the processor.
  • the memory may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or it may be a volatile memory (volatile memory), such as Random-access memory (RAM).
  • the memory may also be capable of carrying or storing instructions in the form of instructions or data structures. Any other medium that contains the desired program code and can be accessed by a computer, without limitation.
  • the memory in the embodiment of the present application can also be a circuit or any other device capable of performing a storage function, used to store computer programs, computer programs or instructions and/or data.
  • the embodiment of the present application also provides another communication device 3000, including: an input and output interface 3010 and a logic circuit 3020; the input and output interface 3010 is used to receive code instructions and transmit them to the logic circuit 3020; Logic circuit 3020 is used to run code instructions to perform the method performed by the first device in any of the above embodiments.
  • the communication device 3000 can be applied to a first device to perform the method performed by the first device, specifically, for example, the method performed by the first device in the embodiment shown in FIG. 7 .
  • the input and output interface 3010 is used to send first information to the second device, where the first information indicates the dimensions of the first state information, and the first state information is the input information of the first model.
  • the first model includes a neural network for assisting the second device in making predictions or decisions.
  • the input and output interface 3010 is also used to receive second information from the second device.
  • the second information includes the first status information, and the dimensions of the first status information conform to the dimensions indicated by the first information.
  • Logic circuit 3020 is used to determine the first model according to the first status information.
  • the input and output interface 3010 is also used to send third information to the second device, where the third information includes parameters of the first model, and the parameters of the first model include at least one of bias and weight.
  • the communication device 3000 provided in this embodiment can be applied to the first device, the method performed by the first device is completed. Therefore, the technical effects that can be obtained can be referred to the above method embodiments, and will not be described again here.
  • embodiments of the present application also provide a communication system.
  • the communication system includes at least one communication device applied to a first device and at least one communication device applied to a second device.
  • the technical effects that can be obtained may refer to the above method embodiments and will not be described again here.
  • embodiments of the present application also provide a computer-readable storage medium that stores computer programs or instructions.
  • the instructions When the instructions are executed, the first device in any of the above embodiments is executed. The method is performed or the method performed by the second device is performed.
  • the computer-readable storage medium may include: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk and other various media that can store program codes.
  • an embodiment of the present application also provides a chip, including a processor, to support the communication device to implement the functions involved in the first device or the second device in the above method embodiment.
  • the chip is connected to a memory or the chip includes a memory, which is used to store computer programs or instructions and data necessary for the communication device.
  • embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer programs or instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture that includes the instruction means,
  • the instruction means implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.
  • These computer programs or instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in a process or processes in the flow diagram and/or in a block or blocks in the block diagram.

Landscapes

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

Abstract

提供一种数据传输方法和装置，用以减少传输时碰撞的可能性，降低通信时延，涉及无线通信技术领域。该方法中，第一设备可以在不进行信道监听的情况下，发送第一帧。第一设备可以通过该第一帧接入信道，在信道中无数据传输的情况下，可以通过第一帧抢占信道，在信道中有数据传输的情况下，该第一帧可以打断数据传输。另外，第一设备在检测到信道状态为空闲时，等待第一时长发送第二帧，可以避免第二帧发生碰撞。该方法和装置可应用于支持IEEE 802.11ax下一代WiFi协议，如802.11be，Wi-Fi 7或EHT，802.11be下一代，Wi-Fi 8等802.11系列协议的无线局域网系统。

Description

一种数据传输方法和装置
相关申请的交叉引用
本申请要求在2022年09月16日提交中国专利局、申请号为202211132100.0、申请名称为“一种数据传输方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信技术领域，尤其涉及一种数据传输方法和装置。
背景技术
目前，在WiFi通信系统中，节点需要基于载波监听多路访问(carrier sense multiple access，CSMA)协议的传输数据。在CSMA中，引入了先听后说(listen before talk，LBT)机制。在LBT机制下CSMA的思想就是：“节点在每一次发送数据之前，先监听信道是否空闲，如果信道不是空闲的话，那么就不发送数据。只有信道是空闲的情况下，节点才可以发送数据，从而避免打断其他设备正在进行的传输过程"。
在CSMA中，节点在每一次发送数据之前还需要进行随机退避(backoff)过程。然而，基于CSMA随机退避的信道接入方式存在一定的冲突概率，且每次发生冲突后，会以指数级增大退避窗口。不仅如此，并发用户越多，冲突概率越高，接入时延越大。WiFi通信虽然平均时延有较好的性能，但是由于接入时有碰撞可能，导致WiFi通信的时延长拖尾。
发明内容
本申请实施例提供了一种数据传输方法和装置，用以减少单次传输时碰撞的可能性，降低通信时延。
第一方面，提供了一种数据传输方法。该方法可以由第一设备执行，或者芯片/芯片系统执行。该方法中，第一设备向第二设备发送第一帧。其中，第一设备发送第一帧不需要进行信道监听。第一设备检测到信道状态为空闲时，等待第一时长发送第二帧。
基于该方案，第一设备可以在不进行信道监听的情况下，发送第一帧。第一设备可以通过该第一帧可以接入信道，在信道中无数据传输的情况下，可以通过第一帧抢占信道，在信道中有数据传输的情况下，该第一帧可以打断数据传输。另外，第一设备可以在检测到信道状态为空闲时，等待第一时长发送第二帧，可以降低或者避免第二帧发生碰撞造成的帧丢失。
在一种可能的实现方式中，第一时长小于或等于(point interframe spacing，PIFS)。可以理解的是，该PIFS可以是现有技术中的PIFS，如25微秒，或者可以是现有技术的演进。基于上述方案，第一时长小于或等于PIFS，可以减少第二设备的等待时长，以减少第二帧的时延。
在一种可能的实现方式中，第一帧包括第一时长duration字段，第一时长字段用于指示第二时长，第二帧在第二时长内发送。例如，该第二时长的起始时间可以是第一帧的结束时间，该第二时长的结束时间可以是第二帧的起始时间。可选的，第一帧中的目的地址为第二设备的地址。
相关技术中，duration字段用于指示占用信道某一段时长，因此其他设备接收并解析帧中的duration字段后，在duration字段指示的某一段时长内是不会传输数据的。因此，基于上述方案，通过将duration字段设置成第二时长，可以达到占用信道第二时长的目的，在第二时长内其他设备不会接入信道发送数据，可以提高第二帧的可靠性，减少第二帧由于发生碰撞造成帧丢失的可能性。
在一种可能的实现方式中，第一设备接收来自第三设备的第三帧。第一设备不发送第三帧的确认帧。例如，在第一设备发送第一帧之前，第一设备可以接收到来自第三设备的第三帧。如果第一设备不发送该第三帧的确认帧，那么第三帧的发送端会认为第三帧丢失，会在等待确认帧超时后，重新接入信道。因此，可以为第二帧提供发送的机会。在一种可能的场景中，上述方案可以打断贪婪终端的爆发(burst)序列。
在一种可能的实现方式中，第一帧可以不需要回复确认帧。例如，确认帧指示域指示第一帧不需要回复确认帧。基于上述方案，通过不需要回复确认帧的第一帧，第一设备可以快速抢占信道，且由于第一帧不需要回复确认帧，因此第一帧与信道中正在传输的帧发生碰撞，对第一设备也不会造成影响。
在一种可能的实现方式中，第一帧包括控制帧，如清除发送(clear to send，CTS)帧，或者第一帧包括数据帧。
在一种可能的实现方式中，第一帧中目的地址为第一设备的地址。基于该方案，由于第一帧的目的地址为第一设备的地址，其他设备在接收到该第一帧后，不会回复确认帧，从而达到第一帧不会被回复确认帧的目的。
在一种可能的实现方式中，在第一设备发送第二帧之后，第一设备接收第二设备发送的对第二帧的确认帧。第一设备接收第二设备发送的第四帧。其中，第二帧包括第二时长duration字段，第二时长字段用于指示第三时长，第四帧在第三时长内发送。
相关技术中，duration字段用于指示占用信道某一段时长，因此其他设备接收并解析帧中的duration字段后，在duration字段指示的某一段时长内是不会传输数据的。因此，基于上述方案，通过将duration字段设置成第三时长，在第三时长内除第一设备和/或第二帧的接收端，也就是第二设备以外的其他设备不可以接入信道发送数据，实现信道预留的目的。
第二方面，提供了一种通信装置，包括：处理单元和收发单元。
收发单元，用于向第二设备发送第一帧。其中，第一设备发送第一帧不需要进行信道监听。处理单元，用于检测信道状态。收发单元，还用于检测到信道状态为空闲时，等待第一时长发送第二帧。
在一种可能的实现方式中，第一时长小于或等于PIFS。可以理解的是，该PIFS可以是现有技术中的PIFS，如25微秒，或者可以是现有技术的演进。
在一种可能的实现方式中，第一帧包括第一时长duration字段，第一时长字段用于指示第二时长，第二帧在第二时长内发送。例如，该第二时长的起始时间可以是第一帧的结束时间，该第二时长的结束时间可以是第二帧的起始时间。
可选的，第一帧中的目的地址为第二设备的地址。
在一种可能的实现方式中，收发单元，还用于接收来自第三设备的第三帧。处理单元，还用于确定不发送第三帧的确认帧。
在一种可能的实现方式中，第一帧可以不需要回复确认帧。例如，确认帧指示域指示第一帧不需要回复确认帧。
在一种可能的实现方式中，第一帧包括控制帧，如清除发送(clear to send，CTS)帧，或者第一帧包括数据帧。
在一种可能的实现方式中，第一帧中目的地址为第一设备的地址。
在一种可能的实现方式中，收发单元，还用于接收第二设备发送的对第二帧的确认帧。收发单元，还用于接收第二设备发送的第四帧。其中，第二帧包括第二时长duration字段，第二时长字段用于指示第三时长，第四帧在第三时长内发送。
第三方面，提供了一种通信装置，该通信装置可以为上述实施例中第二方面中任一种可能的实现方式中的通信装置，或者为设置在第二方面中任一方面的通信装置中的芯片。该通信装置包括通信接口以及处理器，可选的，还包括存储器。其中，该存储器用于存储计算机程序或指令或者数据，处理器与存储器、通信接口耦合，当处理器读取所述计算机程序或指令或数据时，使通信装置执行上述第一方面中任一种可能的实现方式中第一设备所执行的方法。
应理解，该通信接口可以通过所述通信装置中的天线、馈线和编解码器等实现，或者，如果通信装置为设置在网络设备或终端设备中的芯片，则通信接口可以是该芯片的输入/输出接口，例如输入/输出管脚等。所述通信装置还可以包括收发器，用于该通信装置与其它设备进行通信。
第四方面，本申请实施例提供了一种芯片系统，该芯片系统包括处理器，还可以包括存储器，用于实现第一方面中任一种可能的实现方式中的通信装置执行的方法。在一种可能的实现方式中，所述芯片系统还包括存储器，用于保存程序指令和/或数据。该芯片系统可以由芯片构成，也可以包含芯片和其他分立器件。
第五方面，本申请提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机程序或指令，当该计算机程序或指令被运行时，实现上述各方面中由第一设备执行的方法。
第六方面，提供了一种计算机程序产品，所述计算机程序产品包括：计算机程序代码或指令，当所 述计算机程序代码或指令被运行时，使得上述各方面中由第一设备节点执行的方法被执行。
第七方面，提供了一种通信装置，所述通信装置包括执行上述各方面方法的单元或模块。
第八方面，提供了一种芯片系统，包括逻辑电路和输入输出单元。逻辑电路，用于执行上述第一方面中任一种可能的实现方式中第一设备所执行的方法。输入输出单元，用于第一设备与其他装置，如第二设备进行通信。
上述第二方面至第八方面及其实现方式的有益效果可以参考对第一方面的方法及其实现方式的有益效果的描述。
附图说明
图1为本申请实施例提供的一种网络架构示意图；
图2A为一种基于随机退避的时延示意图；
图2B为WiFi系统的时延拖尾示意图；
图3为一种时间分片的数据传输方法的场景示意图；
图4A为一种EDCA中每种业务包的示意图；
图4B为一种PIFS抢占信道的场景示意图；
图5为一种数据碰撞的示意图；
图6A为一种贪婪终端的传输特性示意图；
图6B为一种贪婪终端的burst与业务包碰撞的示意图；
图7为本申请实施例提供的一种数据传输方法的示例性流程图；
图8为本申请实施例提供的一种可能的第一帧的结构示意图；
图9为本申请实施例提供的又一种可能的第一帧的结构示意图；
图10A为本申请实施例提供的一种数据传输方法的场景示意图；
图10B为本申请实施例提供的又一种数据传输方法的场景示意图；
图11A为本申请实施例提供的又一种数据传输方法的场景示意图；
图11B为本申请实施例提供的又一种数据传输方法的场景示意图；
图12为本申请实施例提供的又一种数据传输方法的场景示意图；
图13为本申请实施例提供的又一种数据传输方法的场景示意图；
图14为本申请实施例提供的又一种数据传输方法的场景示意图；
图15A为本申请实施例提供的又一种数据传输方法的场景示意图；
图15B为本申请实施例提供的又一种数据传输方法的场景示意图；
图15C为本申请实施例提供的又一种数据传输方法的场景示意图；
图16为本申请实施例提供的又一种数据传输方法的场景示意图；
图17为本申请实施例提供的又一种数据传输方法的场景示意图；
图18为本申请实施例提供的又一种数据传输方法的场景示意图；
图19为本申请实施例提供的又一种数据传输方法的场景示意图；
图20为本申请实施例提供的又一种数据传输方法的场景示意图；
图21为本申请实施例提供的又一种数据传输方法的场景示意图；
图22为本申请实施例提供的又一种数据传输方法的场景示意图；
图23为本申请实施例提供的又一种数据传输方法的场景示意图；
图24为本申请实施例提供的又一种数据传输方法的场景示意图；
图25为本申请实施例提供的又一种数据传输方法的场景示意图；
图26为本申请实施例提供的又一种数据传输方法的场景示意图；
图27为本申请实施例提供的一种通信装置的示意图；
图28为本申请实施例提供的又一种通信装置的示意图；
图29为本申请实施例提供的又一种通信装置的示意图；
图30为本申请实施例提供的又一种通信装置的示意图。
具体实施方式
本申请实施例涉及的在“之后”与“之前”，可以理解为发送时间的先后关系或者接收时间的先后关系。例如，第一信息在第一字段之后，可以理解为第一信息的发送时间晚于第一字段，或者第一信息的接收时间晚于第二字段。又例如，第一信息在第二字段之前，可以理解为第一信息的发送时间早于第二字段，或者第一信息的接收时间早于第二字段。
本申请实施例可以适用于WLAN的场景，例如，可以适用于电气与电子工程师协会(Institute of Electrical and Electronics Engineers，IEEE)802.11系统标准，例如802.11a/b/g、802.11n、802.11ac、802.11ax标准，或其下一代，例如802.11be标准，Wi-Fi 7或极高吞吐率(extremely high throughput，EHT)，802.11ad，802.11ay，802.11bf，再如802.11be下一代，例如Wi-Fi 8或更下一代的标准中。或者本申请实施例也可以适用于物联网(internet of things，IoT)网络或车联网(Vehicle to X，V2X)网络等无线局域网系统中。
下文以本申请实施例可以适用于WLAN的场景为例。应理解，WLAN从802.11a/g标准开始，历经802.11n、802.11ac、802.11ax和如今正在讨论的802.11be。其中802.11n也可称为高吞吐率(high throughput，HT)；802.11ac也可称为非常高吞吐率(very high throughput，VHT)；802.11ax也可称为高效(high efficiency，HE)或者Wi-Fi 6；802.11be也可称为EHT或者Wi-Fi 7，而对于HT之前的标准，如802.11a/b/g等可以统称为非高吞吐率(Non-HT)。
参阅图1，示出了本申请实施例适用的一种WLAN的网络架构图。图1以该WLAN包括1个无线接入点(access point，AP)和2个站点(station，STA)为例。STA，能够接收该AP发送的无线帧，也能够向该AP发送无线帧。另外，本申请实施例同样适用于AP与AP之间的通信，例如各个AP之间可通过分布式系统(distributed system，DS)相互通信，本申请实施例也适用于STA与STA之间的通信。应理解，图1中的AP和STA的数量仅是举例，还可以更多或者更少。
其中，接入点可以为终端设备(如手机)进入有线(或无线)网络的接入点，主要部署于家庭、大楼内部以及园区内部，典型覆盖半径为几十米至上百米，当然，也可以部署于户外。接入点相当于一个连接有线网和无线网的桥梁，主要作用是将各个无线网络客户端连接到一起，然后将无线网络接入以太网。具体的，接入点可以是带有Wi-Fi芯片的终端设备(如手机)或者网络设备(如路由器)。接入点可以为支持802.11be制式的设备。接入点也可以为支持802.11ax、802.11ac、802.11ad、802.11ay、802.11n、802.11g、802.11b、802.11a以及802.11be下一代等802.11家族的多种无线局域网(wireless local area networks，WLAN)制式的设备。
站点可以为无线通讯芯片、无线传感器或无线通信终端等，也可称为用户。例如，站点可以为支持Wi-Fi通讯功能的移动电话、支持Wi-Fi通讯功能的平板电脑、支持Wi-Fi通讯功能的机顶盒、支持Wi-Fi通讯功能的智能电视、支持Wi-Fi通讯功能的智能可穿戴设备、支持Wi-Fi通讯功能的车载通信设备和支持Wi-Fi通讯功能的计算机等等。可选地，站点可以支持802.11be制式。站点也可以支持802.11ax、802.11ac、802.11n、802.11g、802.11b、802.11a、802.11be下一代等802.11家族的多种无线局域网(wireless local area networks，WLAN)制式。
例如，接入点和站点可以是应用于车联网中的设备，物联网(IoT，internet of things)中的物联网节点、传感器等，智慧家居中的智能摄像头，智能遥控器，智能水表电表，以及智慧城市中的传感器等。
本申请实施例所涉及到的AP和STA可以为适用于IEEE 802.11系统标准的AP和STA。AP是部署在无线通信网络中为其关联的STA提供无线通信功能的装置，该AP可用作该通信系统的中枢，通常为支持802.11系统标准的MAC和PHY的网络侧产品，例如可以为路由器、网关、中继器，通信服务器，交换机或网桥等通信设备。在此，为了描述方便，上面提到的设备统称为AP。STA通常为支持802.11系统标准的介质访问控制(media access control，MAC)和物理层(physical，PHY)的终端产品，例如手机、笔记本电脑等。
可以理解的是，本申请实施例涉及的第一设备可以是AP或者STA。同样的，本申请实施例涉及的第二设备可以是AP或者STA。
目前，在WiFi通信系统中，节点(如AP或STA)需要基于载波监听多路访问(carrier sense multiple access，CSMA)协议的传输数据。在CSMA中，引入了先听后说(listen before talk，LBT)机制。在LBT机制下CSMA的思想就是：“节点在每一次发送数据之前，通过空频道检测技术(clear channel assessment，CCA)先监听信道是否空闲，如果信道不是空闲的话，那么就不发送数据。只有信道是空 闲的情况下，节点才可以发送数据，从而避免打断其他设备正在进行的传输过程"。
在CSMA中，节点在每一次发送数据之前还需要进行随机退避(backoff)过程。具体的，节点在发送数据之前，可以根据设定参数，随机生成一个随机退避计数值。节点可以在每一个时隙(slot)中对信道进行监听，若信道状态为空闲，那么节点可以进行随机退避，即随机退避计数值减1，若信道状态不是空闲的话，则随机退避计数值不减1。只有当该随机退避计数值为0时，节点才可以发送数据。
然而，基于CSMA随机退避的信道接入方式存在一定的冲突概率，且每次发生冲突后，会以指数级增大退避窗口，参阅图2A所示。不仅如此，并发用户越多，冲突概率越高，接入时延越大。WiFi通信虽然平均时延有较好的性能，但是由于接入时有碰撞可能，导致WiFi通信的时延长拖尾，参阅图2B所示。
现在低时延高可靠场景已成为WLAN产品的新机会增长点，对于现有的工业场景或者家庭游戏场景等，对于时延的要求越来越高。这类场景中，大家关注的就是拖尾时延。而WiFi通信难以保证单次传输的成功率，即在链路层可靠的情况下，无法避免单次传输的碰撞，从而需要重传导致拖尾时延。所以如何降低WiFi通信的拖尾时延，即如何保证单次传输的可靠性变得尤为重要。
为了提高单次传输的可靠性，减少或者避免数据碰撞，目前可以通过以下两种方式传输数据。
方式一：所有节点的数据传输都由AP管理和指挥，避免碰撞和空口竞争。AP为各个节点分配时间分片，各个节点按照时间分配传输数据。参阅图3，AP可以为5个节点分配时隙，如节点1对应时隙1(slot 1)、节点2对应时隙2、节点3对应时隙3、节点4对应时隙4以及节点5对应时隙5。这样，上述5个节点可以按照顺序，在每个周期上发送数据。可以理解的是，每个时隙仅允许对应的节点使用。例如，时隙1仅允许节点1使用，只有节点1可以在时隙1发送或者接收数据。
但是上述方式一，无法适用于大多数低时延场景，比如家庭网络，无法要求邻居使用设备也都是统一厂商的，因此所有设备统一厂商，因此实现较困难。
方式二：
参阅图4A，802.11e引入增强分布式信道接入(enhanced distributed channel access，EDCA)的概念。从上层下来的包会被EDCA分为背景(background，BK)、尽力而为传输(best effort，BE)、视频(video，VI)、语音(voice，VO)四种业务包。每个业务包分别定义了一套EDCA参数，如表1所示。
表1：EDCA参数示例
该EDCA参数决定了每种业务包占用信道的概率，可以保证高优先级的业务包占用机会大于低优先级的业务包。可以通过调整控制各个业务包的EDCA参数调整各种业务包的信道竞争优先级，从而调整不同业务的时延与吞吐性能。
标准情况下AIFSN都是大于等于2，即队列至少等待AIFSN＝分布式帧间间隙帧间隙(distributed inter frame spacing，DIFS)后，才能开始进行随机退避。其中DIFS＝2×一个时隙时长(9微秒)+一个短帧间间隔时长(16微秒)。当背景业务包到达背景STA时，此时空口上有业务包在发送，即当前信道状态为忙，则背景STA的发送需要等待当前业务包结束后，信道空闲时长至少达到DIFS＝34微秒(us)后，才能开始进行随机退避。在随机退避结束后，背景STA可以发送背景业务包。
由于正常帧序列间隔为短帧间间隔(short interframe space，SIFS)，所以一般不会设置AIFSN＝0，这样业务包始终会与帧序列碰撞。所以EDCA的极限配置是将AIFSN配置为1，且节点不进行随机退避。也即，当节点确定信道空闲的时长达到点协调功能帧间间隔PIFS发送业务包。PIFS抢占的目的是比其他在节点更快的抢占到信道，降低接入时延影响。
参阅图4B，当低时延业务达到AP时，AP进行信道监听，由于背景STA正在发送背景业务包，因此信道状态为“忙”。AP继续进行信道监听，在确定信道空闲的时长达到PIFS后，AP可以发送低时延业务的业务包。可以理解的是，背景STA再次发送背景业务包时，需要等待信道空闲DIFS后，进行随 机退避。在随机退避结束后，才能够发送背景业务包。但是，由于PIFS＜DIFS，也即AP等待的时长小于背景STA等待的时长，所以AP可以第一时间抢占到信道，并无碰撞发送低时延业务的数据包。
虽然PIFS等待时间短，可以优先接入信道，但是还是会发生如下两种可能的碰撞：
1)当低时延业务到达时，AP进行信道监听，确定信道状态为空闲，同时已经有其他节点正在进行随机退避，且退避时长恰好还剩接近于PIFS的3个时隙时，就会发生碰撞丢包。参阅图5，在t2时刻低时延业务到达AP，AP可以通过信道监听确定信道是空闲的。因此，AP可以确定信道空闲的时长达到PIFS后，在t3时刻发送低时延业务的数据包。但是，由于背景业务包在t1时刻到达背景STA，因此背景STA可以在信道空闲的时长达到DIFS后，进行随机退避。在t2时刻退避时长剩余接近PIFS的3个时隙，在t3时刻背景STA随机退避结束，发送背景业务包。由图5可以看出，低时延业务的数据包与背景业务包发生碰撞，因此可能会造成低时延业务的数据包以及背景业务包丢包。
2)某些终端，并不服从传输机会(transmission opportunity，TXOP)限制(limit)的约束。这些终端在发送业务包时会持续占用空口，因此称之为贪婪终端。参阅图6A，贪婪终端具有连续爆发(burst)的特性，往往每个burst内会持续10ms或者甚至更高。burst内每个业务包间隔SIFS发送。burst之间的间隔有时是PIFS。
AP发送高优先级极限配置业务，如低时延业务的业务包极易与贪婪终端的burst发生碰撞。参阅图6B，由于burst内每个业务包间隔是SIFS，且SIFS＜PIFS，因此低时延业务的业务包是抢占不到信道的。当贪婪终端的一个burst结束后，会再次间隔PIFS继续发下一个burst。此时，AP也以PIFS进行抢占，就会发生碰撞。
因此，可以看出即使是极限配置的PIFS抢占信道，碰撞和信道长时间被占用的问题还是无法避免。
鉴于此，本申请实施例提供了一种数据传输方法。该方法中，第一设备可以在不进行信道监听的情况下，发送第一帧。第一设备可以在检测到信道状态为空闲时，等待第一时长发送第二帧。该方案中，通过该第一帧可以探测或抢占信道，在信道中有数据传输的情况下，该第一帧可以打断数据传输，并且可以对低时延业务的第二帧进行保护，降低或者避免第二帧发生碰撞，造成的帧丢失。
参阅图7，为本申请实施例提供的一种数据传输方法的示例性流程图，可以包括以下操作。
S701：第一设备向第二设备发送第一帧。
在上文中，第一设备发送第一帧时不需要进行信道监听。也就是说，第一设备可以在不确定信道是否空闲的情况下，发送第一帧。可选的，第一设备发送第一帧时可以进行信道监听。例如，第一设备可以CCA，检测信道状态是否为空闲。第一设备可以在信道状态为空闲的情况下，发送第一帧。举例来说，第一设备可以在信道空闲的时长达到设定时长的情况下，发送第一帧。其中，设定时长可以设为小于PIFS，如小于或等于25微妙，或者设定时长可以为SIFS，如16微妙。
可以理解的是，第一设备在信道状态为非空闲的情况下，可以不发送第一帧。
在一种可能的实现方式中，第一帧可以不需要回复确认帧。例如，第一帧可以是控制帧，如清除发送(clear to send，CTS)帧。参阅图8，为本申请实施例提供的一种可能的第一帧的结构示意图。如图8所示，第一帧可以是CTS帧。第一帧可以包括帧控制(frame control)字段、时长(duration)字段、目的地址(received address，RA)字段和帧校验序列(frame check sequence，FCS)字段。在第一帧是控制帧的情况下，第一帧可以不需要回复确认帧。因此，第一设备可以通过向第二设备发送控制帧，实现对信道的抢占。
可选的，第一帧中的目的地址可以指示第一设备的地址，如第一设备的MAC地址，或者指示第二设备的地址，如第二设备的MAC地址。例如，图8中的RA字段，可以指示第一设备的地址或者第二设备的地址。
可以理解的是，图8示出的CTS帧仅作为一种第一帧的实现方式，并不作为对第一帧的限定。第一帧还可以是其他的不需要回复确认帧的控制帧。
又例如，第一帧可以是数据帧。在该数据帧中可以包含确认帧指示域(ACK policy)，该确认帧指示域可以指示不需要回复确认帧。参阅图9，为本申请实施例提供的一种可能的第一帧的结构示意图。如图9所示，第一帧可以包括帧控制字段、时长字段、地址1(address1)字段、地址2(address2)字段、地址3(address4)字段、序列控制(sequence control)字段、地址4(address4)字段、服务质量控制(quality of service，QoS)(control)字段、高吞吐量控制(HT control)字段，帧体(frame body)字段和FCS字段。
在图9示出的数据帧中，QoS control字段中可以包括确认帧指示域，可以指示第一帧不需要回复确认帧。例如，确认帧指示域可以是1比特信息，在确认帧指示域取值为1时，指示第一帧需要回复确认帧，在确认帧指示域取值为0时，指示第一帧不需要回复确认帧。反之亦可，在确认帧指示域取值为0时，指示第一帧需要回复确认帧，在确认帧指示域取值为1时，指示第一帧不需要回复确认帧。
可选的，第一帧中的目的地址可以指示第一设备的地址，如第一设备的MAC地址，或者指示第二设备的地址，如第二设备的MAC地址。例如，图9中的地址4(address4)字段，可以指示第一设备的地址或者第二设备的地址。
可以理解的是，图9示出的数据帧仅作为一种第一帧的实现方式，并不作为对第一帧的限定。第一帧还可以是其他的不需要回复确认帧的数据帧。
本申请实施例中涉及的第一帧可以是一个帧，或者可以是帧序列。该帧序列中可以包括多个帧。
S702：第一设备检测到信道状态为空闲时，等待第一时长发送第二帧。
本申请实施例中涉及的第二帧可以是一个帧，或者可以是帧序列。该帧序列中可以包括多个帧。可选的，第一设备可以通过CCA，检测信道状态是否为空闲。
上文中，第二帧可以是数据帧，也就是第一设备的业务的数据帧，如低时延业务的数据帧。其中，第一时长可以是协议预定义的或者预先配置的，本申请不做具体限定。例如，第一时长可以设置为小于或等于PIFS，如小于或等于25微秒，或者第一时长可以设置为SIFS，如16微秒。
在S702中，第一设备可以进行信道监听，并在确认信道空闲的时长达到第一时长后发送第二帧。可以理解的是，本申请实施例不对第一设备进行信道监听的方式进行限定。
参阅图10A，为本申请实施例提供的一种数据传输方法的场景示意图。如图10A所示，AP可以在不进行信道监听的情况下发送第一帧。在第一帧发送后，AP可以进行信道监听，并在信道空闲的时长达到第一时长后，发送第二帧。
可选的，在业务，如低时延业务到达AP后，AP可以等待指定时长后发送第一帧，如图10A所示。可以理解的是，该指定时长可以是协议预定义的或者预先配置的，如指定时长可以设置为小于或等于PIFS，如小于或等于25微秒，或者指定时长可以设置为SIFS，如16微秒，或者指定时长可以设置为0微秒。
基于上述方案，第一设备在发送第一帧时不需要进行信道监听，因此第一设备可以抢占信道。第一设备可以在信道状态为空闲的情况下，等待第一时长发送第二帧。因此，第一设备可以避免第二帧发生碰撞，减少或者避免第二帧丢失。在信道中有数据传输的情况下，该第一帧可以打断数据传输，并且可以对低时延业务的第二帧进行保护，降低或者避免第二帧发生碰撞，造成的帧丢失。
参阅图10B，为本申请实施例提供的一种数据传输方法的示意图。如图10B所示，AP可以进行信道监听，并在信道空闲达到设定时长后，发送第一帧。在第一帧发送后，AP可以进行信道监听，并在信道空闲的时长达到第一时长后，发送第二帧。
可选的，在业务，如低时延业务到达AP后，AP可以等待指定时长后发送第一帧，如图10B所示。可以理解的是，该指定时长可以是协议预定义的或者预先配置的，如指定时长可以设置为小于或等于PIFS，如小于或等于25微秒，或者指定时长可以设置为SIFS，如16微秒，或者指定时长可以设置为0微秒。
基于上述方案，第一设备在信道状态为空闲的情况下，发送第一帧，因此可以抢占空闲的信道。第一设备可以在信道状态为空闲的情况下，等待第一时长发送第二帧。这样，第一设备可以避免第二帧发生碰撞，减少或者避免第二帧丢失。在信道中有数据传输的情况下，该第一帧可以打断数据传输，并且可以对低时延业务的第二帧进行保护，降低或者避免第二帧发生碰撞，造成的帧丢失。
一种可能的情况中，上述第一帧可以实现对信道的快速抢占。参阅图11A，AP可以发送第一帧。例如，当低时延业务到达AP后，AP可以发送第一帧。可选的，AP可以等待指定时长(XIFS)发送第一帧。由图11A可以看出，除AP以外，其他节点并无数据传输，也即信道状态为空闲。AP可以在发送第一帧后，进行信道监听。AP可以检测到信道状态为空闲的情况下，等待第一时长发送第二帧，如低时延业务的业务包。可选的，STA1可以接收来自AP的第二帧，并间隔SIFS后向AP发送第二帧的确认帧(acknowledgement，ACK)。
参阅图11B，AP可以发送第一帧。例如，AP可以确定在信道状态为空闲的情况下，发送第一帧。可选的，AP可以在信道空闲的时长达到设定时长的情况下，发送第一帧。AP可以在发送第一帧后， 进行信道监听。AP可以检测到信道状态为空闲的情况下，等待第一时长发送第二帧，如低时延业务的业务包。可选的，STA1可以接收来自AP的第二帧，并间隔SIFS后向AP发送第二帧的ACK。
可以理解的是，图11A和图11B中由于在AP发送第一帧时，背景STA1确定信道状态为忙，因此背景STA1不进行随机退避，等待信道状态为空闲时，再进行随机退避。例如，背景STA1在t1时刻检测到信道状态为空闲，因此背景STA可以等待信道空闲DIFS后进行随机退避。在t2时刻，背景STA1完成随机退避，随机退避计数值为0，背景STA1可以发送背景业务包。背景STA2可以接收来自背景STA1的背景业务包，并间隔SIF后向背景STA2发送背景业务包的确认帧。
由图11A中可以看出，AP可以通过不进行信道监听，发送第一帧，可以在信道空闲时第一时间抢占信道。AP可以在检测到信道状态为空闲时，等待第二时长发送第二帧，因此可以减少或者避免第二帧发生碰撞，实现第二帧的可靠传输。
由图11B中可以看出，AP可以在信道状态为空闲时，发送第一帧，可以在信道空闲时第一时间抢占信道。AP可以在检测到信道状态为空闲时，等待第二时长发送第二帧，因此可以减少或者避免第二帧发生碰撞，实现第二帧的可靠传输。
可选的，为了保护第二帧的可靠传输，第一帧中可以包括第一时长(duration)字段。该第一时长字段可以指示第二时长，第二帧可以在第二时长内发送。例如，如图9所示，可以在duration字段中指示第二时长，该第二时长的起始时间可以是第一帧的起始时间，该第二时长的结束时间可以是第二帧的起始时间。
参阅图12，为本申请实施例提供的一种数据传输的场景示意图。AP可以发送第一帧。例如，当低时延业务到达AP后，AP可以发送第一帧。可选的，AP可以等待指定时长(XIFS)发送第一帧。又例如，AP可以确定在信道状态为空闲的情况下，发送第一帧。可选的，AP可以在信道空闲的时长达到设定时长的情况下，发送第一帧。该第一帧中可以包括时长(duration)字段，时长(duration)字段指示第二时长，如图12所示的tA至tB之间的时长。可以理解的是，由于第一帧中的目的地址为STA3的地址，因此除STA3以外的其他STA，如背景STA1和背景STA2在第二时长内不能够接入信道。例如，背景STA1接收到该第一帧，并确定第一帧中的目的地址并非背景STA1的目的地址，且第一帧中的时长(duration)字段指示第二时长，即tA至tB之间的时长。因此，背景STA1在该第二时长内不可以接入信道，也就是背景STA1不能够在第二时长内发送业务包。类似的，背景STA2在该第二时长内不可以接入信道。AP可以检测到信道状态为空闲的情况下，等待第一时长在tB时刻发送第二帧，如低时延业务的业务包。
由图12可以看出，第一帧可以通过第一时长(duration)字段指示第二时长，在该第二时长内除目的地址所指示的节点外，其他节点不可以接入信道，因此可以提高第二帧的可靠性，减少第二帧发生碰撞的可能性。
另一种可能的情况中，假设空口上有业务包传输，即信道状态为忙的情况下，第一帧可以打断空口上的业务包的传输。以贪婪终端为例进行说明。
参阅图13，为本申请实施例提供的一种数据传输方法的场景示意图。由图13可以看出，背景STA1可以burst序列的特性发送帧。AP可以发送第一帧。可选的，AP可以等待指定时长(XIFS)发送第一帧。由于AP在发送第一帧时，不需要进行信道监听。由图13可以看出，第一帧与背景STA1的帧发生碰撞。因此，背景STA2无法接收到来自背景STA1的帧，因此背景STA2不会向背景STA1发送确认帧。因此，背景STA1不会接收到来自AP的确认帧。如果背景STA在预设时长内没有接收到确认帧的情况下，会认为等待确认帧超时，因此背景STA会重新进行随机退避，并重传碰撞的帧。在背景STA等待确认帧时，AP检测信道状态就会是空闲的，因此AP可以等待信道空闲第一时长后发送第二帧。
需要说明的是，上述预设时长可以是协议预定义的，或者预先配置的，如预设时长可以被配置为50微秒。可以理解的是，在AP不进行信道监听的情况下发送第一帧，可以如图13所示，打断空口上业务包的传输。如果AP进行信道监听，并在信道状态为空闲的情况下发送第一帧，那么第一帧无法打断空口上业务包的传输。
图13所示的实施例，是以第一帧打断贪婪终端的业务包为例进行说明的。本申请实施例提供的第一帧，不仅可以打断贪婪终端的业务包，还可以打断其他节点的业务包。参阅图14，为本申请实施例提供的一种数据传输方法的场景示意图。
背景STA1进行信道监听，确定信道状态为空闲。因此，背景STA1可以在信道空闲的时长达到 DIFS后，在t1时刻，进行随机退避后，在t2时刻发送背景业务包。AP在t2时刻发送第一帧。也即，第一帧与背景STA1发送的背景业务包发生碰撞。因此，背景STA2无法准确接收到来自背景STA1的背景业务包，不会向背景STA1发送确认帧。因此，背景STA1等待确认帧超时，会重新进行随机退避接入信道。在背景STA1等待确认帧的时间里，AP可以进行信道监听。由于信道上无数据传输，因此AP可以确定信道状态为空闲。AP可以等待第一时长发送第二帧。可选的，STA3可以接收来自AP的第二帧，并间隔SIFS后向AP发送第二帧的确认帧。
在STA3向AP发送确认帧后，背景STA1可以检测到信道状态为空闲。因此，背景STA1可以在信道空闲的时长达到DIFS后，进行随机退避。并在t3时刻完成随机退避，重传被打断的背景业务包。图14所示的实施例中，无论第一设备在发送第一帧之前是否进行信道监听，均能达到打断空口上业务包的传输，抢占信道。
由图13和图14可知，AP可以通过第一帧打断空口上业务包的传输，当第一帧与空口上的业务包发生碰撞后，会让发送端与接收端认为当前正在交互的帧丢失，因此发送端会重新进行随机退避并接入信道，因此AP可以通过第一帧为后续第二帧的赢得发送机会。
在图7图8所示的实施例中，第二设备可以向第一设备发送第二帧的确认帧。可选的，第二设备也可以向第一设备发送第四帧。一种可能的情况中，第二帧中可以包括第二时长(duration)字段(如图9所示的duration字段)。该第二时长字段可以指示第三时长，第四帧可以在第三时长内发送。上文中，第四帧可以理解为第二设备向第二设备发送的业务包。
参阅图15A，为本申请实施例提供的一种数据传输方法的场景示意图。AP可以发送第一帧。例如，当低时延业务到达AP后，AP可以发送第一帧。可选的，AP可以等待指定时长(XIFS)发送第一帧。AP可以在发送第一帧后，进行信道监听。AP可以检测到信道状态为空闲的情况下，等待第一时长发送第二帧，如低时延业务的业务包。该第二帧中可以包括第二时长(duration)字段。该第二时长字段可以指示第三时长。可以理解的是，由于第二帧中的目的地址为第二帧的接收端，如STA2的地址，因此除STA2以外的其他节点，如背景STA在第三时长内不能够接入信道。例如，背景STA1接收到该第二帧，并确定第二帧中的目的地址并非背景STA1的目的地址，且第二帧中的时长(duration)字段指示第三时长。因此，背景STA1在该第三时长内不可以接入信道，也就是背景STA1不能够在第三时长内发送业务包。
STA3可以在该第三时长内向AP发送第四帧，如上行业务的业务包。可选的，在该第三时长内STA3也可以向AP发送确认帧。
参阅图15B，为本申请实施例提供的一种数据传输方法的场景示意图。AP可以发送第一帧。例如，当低时延业务到达AP后，AP可以进行信道监听，在信道状态为空闲的情况下发送第一帧。可选的，AP可以在信道空闲的时长达到设定时长的情况下，发送第一帧。AP可以在发送第一帧后，进行信道监听。AP可以检测到信道状态为空闲的情况下，等待第一时长发送第二帧，如低时延业务的业务包。该第二帧中可以包括第二时长(duration)字段。该第二时长字段可以指示第三时长。可以理解的是，由于第二帧中的目的地址为第二帧的接收端，如STA2的地址，因此除STA2以外的其他节点，如背景STA在第三时长内不能够接入信道。例如，背景STA1接收到该第二帧，并确定第二帧中的目的地址并非背景STA1的目的地址，且第二帧中的时长(duration)字段指示第三时长。因此，背景STA1在该第三时长内不可以接入信道，也就是背景STA1不能够在第三时长内发送业务包。
STA3可以在该第三时长内向AP发送第四帧，如上行业务的业务包。可选的，在该第三时长内STA3也可以向AP发送确认帧。
可以理解的是，第二帧也可以不需要回复确认帧，如图15C所示。
由图15A至图15C可知，第二帧中的第二时长字段可以指示第三时长，在该第三时长内STA3可以向AP发送业务包，实现信道的预留，减少第四帧发生碰撞的可能性。
需要说明的是，图10A至图15C中的STA，如背景STA1、背景STA2和STA3可以是本小区的AP关联的STA，也可以是同频邻区的AP关联的STA。另外，图10A至图15C中示出的AP，STA，背景STA仅作为示例性示出。不失一般性的，本申请实施例提供的数据传输方法可以应用于任意的WiFi设备。
以下，结合附图对本申请实施例提供的技术方案进行详细说明。参阅图16，本小区中有一个AP，同时AP关联有低时延业务接收端(低时延STA)，以及背景STA。下文中，以第一时长为PIFS以及指 定时长为PIFS为例进行说明。以下，图17至图21示出的实施例中，背景STA与低时延STA均与本小区AP关联的。
参阅图17，信道上有背景STA1正在发送背景业务包，则AP和背景STA的业务包需要等待当前背景业务包传输结束，即AP向背景STA发送背景业务包的ACK帧后，才能开始计时。背景STA根据标准至少等待空闲DIFS＝34us后，才能开始做随机退避，然后发送帧。可选的，背景STA可以确定信道空闲时长达到DIFS时长后，不进行随机退避发送帧。但是，由于AP可以等待PIFS后发送第一帧，或者AP可以进行信道监听，在信道空闲的时长达到PIFS后发送第一帧，PIFS<DIFS，因此AP的等待时长小于背景STA的等待时长。所以，AP可以先于背景STA发送第一帧。
在一个示例中，该第一帧中可以包括第一时长字段，该第一时长字段指示第二时长。AP可以检测信道状态为空闲时，等待PIFS发送第二帧。
可选的，在图17所示的实施例中AP可以不向背景STA发送ACK。参阅图18，AP在接收到来自背景STA的帧之后，不向背景STA发送ACK，并等待PIFS后发送第一帧或者进行信道监听，在信道空闲的时长达到PIFS后发送第一帧。由于背景STA未接收到来自AP的ACK，因此可以认为帧丢失，所以会等待ACK超时后，重新进行随机退避接入信道。而AP通过第一帧可以抢占信道，并通过第一时长字段为第二帧预留时间窗，以减少第二帧发生碰撞的可能性。
参阅图19，AP发送第一帧。如果背景STA此时刚好完成随机退避，或者背景STA1确定信达空闲的时长刚好达到DIFS，则背景STA会发送帧。因此，第一帧与背景STA发送的帧发送碰撞。由于WiFi是时分双工(time division duplexing，TDD)系统，收发模式不同时打开，因此AP在发送第一帧时无法接收到来自背景STA的帧，从而不会向背景STA发送ACK。背景STA会在等待ACK超时后，重新进行随机退避重传上述碰撞的帧。而AP可以在检测到信道空闲后，等待PIFS发送低时延业务的第二帧。基于图17至图19示出的实施例，AP通过第一帧可以降低单次传输的碰撞概率，通过第一帧的牺牲或者第一帧中第一时长字段，可以实现对第二帧的进行保护的目的，使低时延业务的传输得到了保障。
上述图17至图19示出了本小区AP关联的背景STA标准服从协议的STA的场景。以下结合图20和图21介绍本小区AP关联的背景STA为贪婪终端的情况下，AP根据第一帧打断贪婪终端的burst的场景。
参阅图20，AP接收来自背景STA的背景业务包后可以向背景STA发送ACK。AP可以等待PIFS后，发送第一帧。背景STA在接收到来自AP的ACK后，等待信道空闲SIFS后发送背景业务包。由于SIFS＜PIFS，因此第一帧与背景STA的背景业务包发生碰撞。由于WiFi是TDD系统，收发模式不同时打开，此时AP已处于发送状态，所以无法接收到背景业务包，因此不会向背景STA发送ACK。这样，背景STA等待ACK超时，认为背景业务包丢失，并进行重传。背景STA可以在信道空闲AIFS后进行随机退避，并重传背景业务包。
AP在发送第一帧后，进行信道监听。并在信道空闲PIFS后发送第二帧。由于PIFS小于背景STA等待的预设时长，且其他设备的等待时长DIFS＞PIFS，因此可以保证第二帧的无碰撞传输。可以理解的是，在AP不进行信道监听的情况下发送第一帧，可以如图20所示，打断空口上业务包的传输。如果AP进行信道监听，并在信道状态为空闲的情况下发送第一帧，那么第一帧无法打断贪婪终端的传输。
可选的，AP可以不发送burst序列的ACK。参阅图21，AP接收到来自背景STA的背景业务包后，不向背景STA发送ACK。AP可以等待PIFS后发送第一帧。因此，AP可以通过第一帧抢占信道。由于AP并未向背景STA发送ACK，因此背景STA等待ACK超时会认为背景业务包丢失，并进行重传。
由于第一帧中包含第一时长字段，该第一时长字段指示第二时长。因此，背景STA在接收到该第一帧后，在第二时长内保持静默，不接入信道。AP在信道空闲PIFS后发送第二帧。由于在第二时长内除AP外的其他设备不接入信道，因此可以保证第二帧无碰撞传输。
基于图20和21示出的实施例，AP通过第一帧可以降低单次传输的碰撞概率，通过第一帧的牺牲或者第一帧中第一时长字段，可以实现对第二帧的进行保护的目的，使低时延业务的传输得到了保障。
通过图20和图21示出的方案，避免了贪婪终端长期占用空口不释放的问题，通过第一帧打断burst序列，使低时延业务可以及时进行发送，降低时延。可以理解的是，图21示出的方案相较于图20示出的方案，等待时长少一个帧的长度，时延较低。
图16至图21是以背景STA关联在本小区的AP下为例进行说明的。以下，结合图22至图26对背景STA关联在同频小区的AP下的场景进行说明。
参阅图22，本小区中有一个AP1，AP1关联有低时延的业务接收端低时延STA。同时在本小区附近有同频小区，背景STA关联在同频小区的AP2下面。下文中，以第一时长为PIFS以及指定时长为PIFS为例进行说明。以下图23至图26示出的实施例中，背景STA均与同频小区的AP2关联的。
参阅图23，信道上有背景STA正在发送背景业务包，则AP1的业务包需要等待当前背景业务包传输结束，即AP2向背景STA发送背景业务包的ACK帧后，才能开始计时。背景STA根据标准至少等待空闲DIFS＝34us后，才能开始做随机退避，然后发送帧。可选的，背景STA可以确定信道空闲时长达到DIFS时长后，不进行随机退避发送帧。但是，由于AP1可以等待PIFS后发送第一帧或者进行信道监听，在信道空闲的时长达到PIFS后发送第一帧，PIFS<DIFS，因此AP1的等待时长小于背景STA的等待时长。所以，AP1可以先于背景STA发送第一帧。
在一个示例中，该第一帧中可以包括第一时长字段，该第一时长字段指示第二时长。AP可以检测信道状态为空闲时，等待PIFS发送第二帧。
需要说明的是，由于背景STA与AP2关联，因此AP1无法要求AP2不向背景STA发送ACK。
参阅图24，AP1在t1时刻发送第一帧。如果背景STA此时刚好完成随机退避，或者背景STA确定信达空闲的时长刚好达到DIFS，则背景STA会发送帧。因此，第一帧与背景STA发送的帧发送碰撞，影响了背景STA发送的帧的信道估计、扰码种子获取和数据均衡等，导致AP2对背景STA的帧译码失败，该帧丢失。因此AP2不会向背景STA发送ACK。背景STA会在等待ACK超时后，重新进行随机退避重传上述碰撞的帧。而AP1可以在检测到信道空闲后，等待PIFS发送低时延业务的第二帧。
基于图23和24示出的实施例，AP1通过第一帧可以降低单次传输的碰撞概率，通过第一帧的牺牲或者第一帧中第一时长字段，可以实现对第二帧的进行保护的目的，使低时延业务的传输得到了保障。
图23至图24示出的实施例中背景STA是标准服从协议的STA。以下，结合图25和图26介绍在同频邻区的AP关联的背景STA为贪婪终端的情况下，AP根据第一帧打断贪婪终端的burst的情况。
参阅图25，AP1进行信道监听，此时背景STA向AP2发送背景业务包。AP1可以等待AP2向背景STA发送ACK后，等待PIFS发送第一帧。由于背景STA在接收到来自ACK后，等待信道空闲SIFS后发送背景业务包。因此，第一帧与背景业务包发生碰撞，影响了AP2对背景业务包的信道估计、扰码种子获取和数据均衡等，导致AP2对背景业务包译码失败，因此不向背景STA发送ACK。这样，背景STA等待ACK超时，认为背景业务包丢失，并进行重传。背景STA可以在信道空闲AIFS后进行随机退避，并重传背景业务包。
AP1在发送第一帧后，进行信道监听。并在信道空闲PIFS后发送第二帧。由于PIFS小于背景STA等待的预设时长，且其他设备的等待时长DIFS＞PIFS，因此可以保证第二帧的无碰撞传输。
可选的，AP1可以等待背景STA发送背景业务包后，发送第一帧。参阅图26，AP1进行信道监听，此时背景STA向AP2发送背景业务包。AP1可以等待背景STA发送背景业务包后，等待PIFS发送第一帧。由于AP2在接收到来自背景STA的背景业务包后，会向背景STA发送ACK。因此，ACK与背景业务包发生碰撞，影响了背景STA对ACK的信道估计、扰码种子获取和数据均衡等，导致背景STA对ACK译码失败。这样背景STA会接收ACK失败，因此会导致背景STA等待ACK超时，背景STA认为背景业务包丢失，并进行重传。背景STA可以在信道空闲AIFS后进行随机退避，并重传背景业务包。
AP1在发送第一帧后，进行信道监听。并在信道空闲PIFS后发送第二帧。由于PIFS小于背景STA等待的预设时长，且其他设备的等待时长DIFS＞PIFS，因此可以保证第二帧的无碰撞传输。
基于图25和图26示出的实施例，避免了同频邻区贪婪终端长期占用空口不释放的问题，通过第一帧打断burst序列的传输，使低时延业务可以及时进行发送，降低时延。可以理解的是，图26示出的实施例中，第一帧会打断AP2发送的ACK，因此相较于图25示出的实施例，时延更低。可以理解的是，在AP不进行信道监听的情况下发送第一帧，可以如图25和图26所示，打断空口上业务包的传输。如果AP进行信道监听，并在信道状态为空闲的情况下发送第一帧，那么第一帧无法打断贪婪终端的传输。
下面结合附图介绍本申请实施例中用来实现上述方法的通信装置。因此，上文中的内容均可以用于后续实施例中，重复的内容不再赘述。
图27为本申请实施例提供的通信装置2700的示意性框图。该通信装置2700可以对应实现上述各个方法实施例中由第一设备实现的功能或者步骤。该通信装置可以包括处理单元2710和收发单元2720。可选的，还可以包括存储单元，该存储单元可以用于存储指令(代码或者程序)和/或数据。处理单元 2710和收发单元2720可以与该存储单元耦合，例如，处理单元2710可以读取存储单元中的指令(代码或者程序)和/或数据，以实现相应的方法。上述各个单元可以独立设置，也可以部分或者全部集成。
在一些可能的实施方式中，通信装置2700能够对应实现上述方法实施例中第一设备的行为和功能。例如通信装置2700可以为第一设备，也可以为应用于第一设备中的部件(例如芯片或者电路)。收发单元2720可以用于执行图7所示的实施例中由第一设备所执行的全部接收或发送操作。例如图7所示的实施例中的S701或S702，和/或用于支持本文所描述的技术的其它过程；其中，处理单元2710用于执行如图7所示的实施例中由第一设备所执行的除了收发操作之外的全部操作，和/或用于支持本文所描述的技术的其它过程。
收发单元2720，用于向第二设备发送第一帧。其中，第一设备发送第一帧不需要进行信道监听。处理单元2710，用于检测信道状态。收发单元2720，还用于检测到信道状态为空闲时，等待第一时长发送第二帧。
有关处理单元2710和收发单元2720所执行的操作，可以参见前述方法实施例的相关描述。
应理解，本申请实施例中的处理单元2710可以由处理器或处理器相关电路组件实现，收发单元2720可以由收发器或收发器相关电路组件或者通信接口实现。
基于同一构思，如图28所示，本申请实施例提供一种通信装置2800。该通信装置2800包括处理器2810。可选的，通信装置2800还可以包括存储器2820，用于存储处理器2810执行的指令或存储处理器2810运行指令所需要的输入数据或存储处理器2810运行指令后产生的数据。处理器2810可以通过存储器2820存储的指令实现上述方法实施例所示的方法。
基于同一构思，如图29所示，本申请实施例提供一种通信装置2900，该通信装置2900可以是芯片或者芯片系统。可选的，在本申请实施例中芯片系统可以由芯片构成，也可以包含芯片和其他分立器件。
通信装置2900可以包括至少一个处理器2910，该处理器2910与存储器耦合，可选的，存储器可以位于该装置之内，也可以位于该装置之外。例如，通信装置2900还可以包括至少一个存储器2920。存储器2920保存实施上述任一实施例中必要计算机程序、配置信息、计算机程序或指令和/或数据；处理器2910可能执行存储器2920中存储的计算机程序，完成上述任一实施例中的方法。
本申请实施例中的耦合是装置、单元或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、单元或模块之间的信息交互。处理器2910可能和存储器2920协同操作。本申请实施例中不限定上述收发器2930、处理器2910以及存储器2920之间的具体连接介质。
通信装置2900中还可以包括收发器2930，通信装置2900可以通过收发器2930和其它设备进行信息交互。收发器2930可以是电路、总线、收发器或者其它任意可以用于进行信息交互的装置，或称为信号收发单元。如图29所示，该收发器2930包括发射机2931、接收机2932和天线2933。此外，当该通信装置2900为芯片类的装置或者电路时，该通信装置2900中的收发器也可以是输入输出电路和/或通信接口，可以输入数据(或称，接收数据)和输出数据(或称，发送数据)，处理器为集成的处理器或者微处理器或者集成电路，处理器可以根据输入数据确定输出数据。
在一种可能的实施方式中，该通信装置2900可以应用于第一设备，具体通信装置2900可以是第一设备，也可以是能够支持第一设备实现上述涉及的任一实施例中第一设备的功能的装置。存储器2920保存实现上述任一实施例中的第一设备的功能的必要计算机程序、计算机程序或指令和/或数据。处理器2910可执行存储器2920存储的计算机程序，完成上述任一实施例中第一设备执行的方法。
由于本实施例提供的通信装置2900可应用于第一设备，完成上述第一设备执行的方法。因此其所能获得的技术效果可参考上述方法实施例，在此不再赘述。
在本申请实施例中，处理器可以是通用处理器、数字信号处理器、专用集成电路、现场可编程门阵列或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件，可以实施或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
在本申请实施例中，存储器可以是非易失性存储器，比如硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等，还可以是易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)。存储器还可以是能够用于携带或存储具有指令或数据结构形式的期 望的程序代码并能够由计算机存取的任何其他介质，但不限于此。本申请实施例中的存储器还可以是电路或者其它任意能够实施存储功能的装置，用于存储计算机程序、计算机程序或指令和/或数据。
基于以上实施例，参见图30，本申请实施例还提供另一种通信装置3000，包括：输入输出接口3010和逻辑电路3020；输入输出接口3010，用于接收代码指令并传输至逻辑电路3020；逻辑电路3020，用于运行代码指令以执行上述任一实施例中第一设备执行的方法。
以下，对该通信装置应用于第一设备或者第二设备所执行的操作进行详细说明。
一种可选的实施方式中，该通信装置3000可应用于第一设备，执行上述第一设备所执行的方法，具体的例如前述图7所示的实施例中第一设备所执行的方法。
输入输出接口3010，用于向第二设备发送第一信息，第一信息指示第一状态信息的维度，第一状态信息是第一模型的输入信息。第一模型包括用于辅助第二设备进行预测或决策的神经网络。输入输出接口3010，还用于接收来自第二设备的第二信息，第二信息包含第一状态信息，第一状态信息的维度符合第一信息指示的维度。逻辑电路3020，用于根据第一状态信息，确定第一模型。输入输出接口3010，还用于向第二设备发送第三信息，第三信息包括第一模型的参数，第一模型的参数包括偏置和权重中的至少一个。
由于本实施例提供的通信装置3000可应用于第一设备，完成上述第一设备执行的方法。因此其所能获得的技术效果可参考上述方法实施例，在此不再赘述。
基于以上实施例，本申请实施例还提供一种通信系统。该通信系统包括至少一个应用于第一设备的通信装置和至少一个应用于第二设备的通信装置。所能获得的技术效果可参考上述方法实施例，在此不再赘述。
基于以上实施例，本申请实施例还提供一种计算机可读存储介质，该计算机可读存储介质存储有计算机程序或指令，当指令被执行时，使上述任一实施例中第一设备执行的方法被实施或者第二设备执行的方法被实施。该计算机可读存储介质可以包括：U盘、移动硬盘、只读存储器、随机存取存储器、磁碟或者光盘等各种可以存储程序代码的介质。
为了实现上述图27～图30的通信装置的功能，本申请实施例还提供一种芯片，包括处理器，用于支持该通信装置实现上述方法实施例中第一设备或第二设备所涉及的功能。在一种可能的设计中，该芯片与存储器连接或者该芯片包括存储器，该存储器用于保存该通信装置必要的计算机程序或指令和数据。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序或指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序或指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序或指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序或指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (26)

  1. 一种数据传输方法，其特征在于，包括：
    第一设备向第二设备发送第一帧，所述第一设备发送所述第一帧不需要进行信道监听；
    所述第一设备检测到信道状态为空闲时，等待第一时长发送第二帧。
  2. 一种数据传输方法，其特征在于，包括：
    第一设备检测到信道状态为空闲时，发送所述第一帧；
    所述第一设备检测到信道状态为空闲时，等待第一时长发送第二帧。
  3. 根据权利要求2所述的方法，其特征在于，所述第一设备检测到信道状态为空闲时，发送所述第一帧，包括：
    所述第一设备检测到信道状态为空闲时，等待设定时长发送所述第一帧。
  4. 根据权利要求3所述的方法，其特征在于，所述设定时长小于或等于PFS。
  5. 根据权利要求1～4任一所述的方法，其特征在于，所述第一时长小于或等于PIFS。
  6. 根据权利要求1～5任一所述的方法，其特征在于，所述第一帧包括第一时长duration字段，所述第一时长字段用于指示第二时长，所述第二帧在所述第二时长内发送。
  7. 根据权利要求1～6任一所述的方法，其特征在于，所述第一设备向第二设备发送第一帧之前，还包括：
    所述第一设备接收来自第三设备的第三帧；
    所述第一设备不发送所述第三帧的确认帧。
  8. 根据权利要求1～7任一所述的方法，其特征在于，所述第一帧包括确认帧指示域，所述确认帧指示域指示所述第一帧不需要回复确认帧。
  9. 根据权利要求1～8任一所述的方法，其特征在于，所述第一帧包括控制帧，或者所述第一帧包括数据帧。
  10. 根据权利要求1～9任一所述的方法，其特征在于，所述第一帧中目的地址为所述第一设备的地址。
  11. 根据权利要求1～10任一所述的方法，其特征在于，在所述第一设备发送所述第二帧之后，所述方法还包括：
    所述第一设备接收所述第二设备发送的对所述第二帧的确认帧；
    所述第一设备接收所述第二设备发送的第四帧；其中，所述第二帧包括第二时长duration字段，所述第二时长字段用于指示第三时长，所述第四帧在所述第三时长内发送。
  12. 一种通信设备，其特征在于，包括：处理单元和收发单元；
    所述收发单元，用于向第二设备发送第一帧，所述第一设备发送所述第一帧不需要进行信道监听；
    所述处理单元，用于检测信道；
    所述收发单元，还用于在检测到信道状态为空闲时，等待第一时长发送第二帧。
  13. 一种通信设备，其特征在于，包括：处理单元和收发单元；
    所述处理单元，用于检测信道；
    所述收发单元，用于在检测到信道状态为空闲时，发送所述第一帧；
    所述收发单元，还用于在检测到信道状态为空闲时，等待第一时长发送第二帧。
  14. 根据权利要求13所述的设备，其特征在于，所述收发单元，具体用于
    在检测到信道状态为空闲时，等待设定时长发送所述第一帧。
  15. 根据权利要求14所述的设备，其特征在于，所述设定时长小于或等于PFS。
  16. 根据权利要求12～15任一所述的设备，其特征在于，所述第一时长小于或等于PIFS。
  17. 根据权利要求12～16任一所述的设备，其特征在于，所述第一帧包括第一时长duration字段，所述第一时长字段用于指示第二时长，所述第二帧在所述第二时长内发送。
  18. 根据权利要求12～17任一所述的设备，其特征在于，所述收发单元还用于：
    接收来自第三设备的第三帧；
    所述处理单元，还用于确定不发送所述第三帧的确认帧。
  19. 根据权利要求12～18任一所述的设备，其特征在于，所述第一帧包括确认帧指示域，所述确认帧指示域指示所述第一帧不需要回复确认帧。
  20. 根据权利要求12～19任一所述的设备，其特征在于，所述第一帧包括控制帧，或者所述第一帧包括数据帧。
  21. 根据权利要求12～20任一所述的设备，其特征在于，所述第一帧中目的地址为所述第一设备的地址。
  22. 根据权利要求12～21任一所述的设备，其特征在于，所述收发单元还用于：
    接收所述第二设备发送的对所述第二帧的确认帧；
    接收所述第二设备发送的第四帧；其中，所述第二帧包括第二时长duration字段，所述第二时长字段用于指示第三时长，所述第四帧在所述第三时长内发送。
  23. 一种通信装置，其特征在于，包括：处理器和存储器；
    所述存储器，用于存储计算机程序或指令；
    所述处理器，用于执行存储器中的计算机程序或指令，使所述装置执行如权利要求1或5～11中任一项所述的方法，或者使所述装置执行如权利要求2～11中任一项所述的方法。
  24. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令在被电子装置调用时，使所述电子装置执行如权利要求1或5～11中任一项所述的方法，或者使所述电子装置执行如权利要求2～11中任一项所述的方法。
  25. 一种计算机程序产品，其特征在于，包括计算机执行指令，当所述计算机执行指令在计算机上运行时，使得所述计算机执行如权利要求1～11中任一项所述的方法。
  26. 一种芯片系统，其特征在于，所述芯片系统包括：
    通信接口；
    处理器，用于通过所述通信接口调用并运行所述指令，使得安装有所述芯片系统的设备执行如权利要求1或5～11中任一项所述的方法，或使得安装有所述芯片系统的设备执行如权利要求2～11中任一项所述的方法。
PCT/CN2023/116574 2022-09-16 2023-09-01 一种数据传输方法和装置 WO2024055852A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211132100.0 2022-09-16
CN202211132100.0A CN117793938A (zh) 2022-09-16 2022-09-16 一种数据传输方法和装置

Publications (1)

Publication Number Publication Date
WO2024055852A1 true WO2024055852A1 (zh) 2024-03-21

Family

ID=90274203

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/116574 WO2024055852A1 (zh) 2022-09-16 2023-09-01 一种数据传输方法和装置

Country Status (2)

Country Link
CN (1) CN117793938A (zh)
WO (1) WO2024055852A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102215576A (zh) * 2010-04-09 2011-10-12 华为技术有限公司 占用信道时间的分配方法及接入点设备与接入网络系统
CN102468946A (zh) * 2010-11-08 2012-05-23 中兴通讯股份有限公司 一种多用户传输方法和接入点
US20160338106A1 (en) * 2014-01-27 2016-11-17 Huawei Technologies Co., Ltd. Channel Contention Method and Apparatus
CN106455107A (zh) * 2016-11-04 2017-02-22 武汉大学 一种抢占式Wi‑Fi TDMA接入控制方法
CN111031525A (zh) * 2019-12-17 2020-04-17 杭州迪普科技股份有限公司 Beacon帧的发送方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102215576A (zh) * 2010-04-09 2011-10-12 华为技术有限公司 占用信道时间的分配方法及接入点设备与接入网络系统
CN102468946A (zh) * 2010-11-08 2012-05-23 中兴通讯股份有限公司 一种多用户传输方法和接入点
US20160338106A1 (en) * 2014-01-27 2016-11-17 Huawei Technologies Co., Ltd. Channel Contention Method and Apparatus
CN106455107A (zh) * 2016-11-04 2017-02-22 武汉大学 一种抢占式Wi‑Fi TDMA接入控制方法
CN111031525A (zh) * 2019-12-17 2020-04-17 杭州迪普科技股份有限公司 Beacon帧的发送方法及装置

Also Published As

Publication number Publication date
CN117793938A (zh) 2024-03-29

Similar Documents

Publication Publication Date Title
US10917914B2 (en) Media access control for license-assisted access
US20210176770A1 (en) Wireless communication method for uplink multiple-user transmission schedule and wireless communication terminal using the method
US20050025131A1 (en) Medium access control in wireless local area network
US10128988B2 (en) Method and apparatus for reporting information about transmission failure frame
US20180014165A1 (en) Triggered wireless access protocol with grouped multi-user transmissions
WO2016072908A1 (en) Dynamic listen before talk in license-assisted access
WO2022143176A1 (zh) 业务传输方法、装置及系统
JP2023537151A (ja) チャネル競合方法及び関連機器
JP7485847B2 (ja) リンクエラーリカバリ方法及び装置
WO2023197782A1 (zh) 信道接入方法、装置、设备及存储介质
US20230217494A1 (en) Multi-link synchronous transmission method and apparatus
WO2024055852A1 (zh) 一种数据传输方法和装置
EP3005814A1 (en) Method and network node for coordination of channel resources between transmissions
EP3098995B1 (en) Data transmission method, sender device and receiver device
US9148873B1 (en) Method and apparatus for providing different types of physical layer devices access to a wireless medium
US20230199831A1 (en) Channel Access Method and Communication Apparatus
WO2024087994A1 (zh) 传输数据的方法及装置
WO2024125133A1 (zh) 一种通信方法及装置
EP4247048A1 (en) Trigger frame sending method and apparatus
WO2022073206A1 (zh) 无线通信方法和设备
US20240215066A1 (en) Channel access method and apparatus
EP4358583A1 (en) Channel access method and apparatus
US20240064810A1 (en) Method and device for transmitting/receiving data in communication system supporting multi-link
US20240188135A1 (en) Channel backoff in a wireless network
Benveniste A distributed QoS MAC protocol for wireless mesh

Legal Events

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

Ref document number: 23864584

Country of ref document: EP

Kind code of ref document: A1