Communication method and apparatus

Abstract

The application provides a communication method and device, relates to the technical field of communication, and is used for guaranteeing the fairness of ML entities and SL entities in channel competition. The communication method is applied to an ML entity, the ML entity supports a main link and at least one slave link, a backoff counter is arranged on the main link, and no backoff counter is arranged on the slave link; the communication method comprises the following steps: the ML entity performs a backoff process of the main link based on the backoff counter of the main link; when the counting value of the backoff counter is 0, the ML entity respectively sends a first PPDU on each of K first links, the K first links comprise the main link and K-1 first slave links, and the first slave link is in an idle state within a first interframe interval before the counting value of the backoff counter is reduced to 0. The application is suitable for a channel access process of multiple links.

Description

[0001] This application is a divisional application of the original application with the application number 201910606607.7 and the original filing date of July 5, 2019, and the entire contents of the original application are incorporated herein by reference. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and in particular to a communication method and device. BACKGROUND

[0003] In order to achieve the technical goal of extremely high throughput, the institute of electrical and electronics engineers (IEEE) 802.11be standard takes multi-link (ML) as one of the key technologies. The ML entity supporting the ML technology has the ability to transmit and receive in multiple frequency bands, so that the ML entity can use a larger bandwidth for data transmission, which is beneficial to significantly improve the throughput. Among them, the spatial path of the ML entity for data transmission in one frequency band can be referred to as one link.

[0004] Currently, for any one of the multiple links supported by the ML entity, the ML entity can have two channel access modes on one link. Mode one, when the count value of the backoff counter of the link decreases to 0, the ML entity can perform channel access on the link. Mode two, when the backoff counter of the other link decreases to 0, if the link is in an idle state within the previous PIFS, the ML entity can perform channel access on the link.

[0005] Since the single link (SL) entity only supports data transmission on one link, the SL entity can only perform channel access on the link when the count value of the backoff counter of the link decreases to 0.

[0006] Therefore, for one link, the possibility of the ML entity competing for the channel is greater than that of the SL entity. That is, when the ML entity and the SL entity are deployed in the WLAN at the same time, the SL entity is at a disadvantage in channel competition, thereby affecting the normal communication of the SL entity. SUMMARY

[0007] The present application provides a communication method and device for ensuring the fairness of the SL entity in channel competition.

[0008] In a first aspect, a communication method is provided. The method is applied to an ML entity. The ML entity supports a master link and at least one slave link. A backoff counter is configured on the master link, and no backoff counter is configured on the slave link. The method comprises: performing, by the ML entity, a backoff procedure of the master link based on the backoff counter; and transmitting, by the ML entity, a first physical layer protocol data unit (PPDU) on each of K first links when a count value of the backoff counter is reduced to 0, wherein the K first links include the master link and K-1 first slave links, the first slave link is in an idle state within a first inter-frame space before the time when the count value of the backoff counter is reduced to 0, and K is a positive integer.

[0009] Based on the above technical solution, since the ML entity only configures the backoff counter on the master link, the ML entity only performs the backoff procedure on the master link when performing channel access. In this way, the ML entity cannot compete for the channel before the end of the backoff procedure of the master link, thereby ensuring that the probability of the ML entity competing for the channel on the master channel is equal to the probability of the SL entity competing for the channel on the link supported by the SL entity. Therefore, the technical solution provided by the present application can ensure the fairness of the SL entity in channel competition, thereby ensuring that the SL entity can normally communicate.

[0010] In addition, based on the above technical solution, in the case that the link supported by the SL entity and the master link of the ML entity are the same link, the SL entity and the ML entity actually perform channel competition on the same link. In this way, in the case that the ML entity successfully competes for the channel on the master link, the SL entity will not transmit a PPDU on the master link, thereby ensuring that the ML entity will not have the problem of asynchronization in receiving and transmitting on multiple links. For example, taking link #1 as the master link, when the count value of the backoff counter of the ML AP entity on link #1 is 0, the ML AP entity transmits a PPDU on link #1 and link #2, and the SL entity will not transmit a PPDU to the ML AP entity on link #1. Therefore, the ML AP entity can synchronously receive signals or synchronously transmit signals on link #1 and link #2.

[0011] In a possible design, the ML entity transmits the first PPDU on each of the K first links comprises: the ML entity transmits the first PPDU on an available channel of each of the K first links, wherein the available channel of the master link includes a master channel of the master link, and the available channel of the first slave link includes a master channel of the first slave link.

[0012] In a possible design, the ML entity performs a backoff procedure of the primary link based on a backoff counter, including: the ML entity waiting for an idle time of a primary channel of the primary link to reach a second inter-frame space; after the idle time of the primary channel of the primary link reaches the second inter-frame space, the ML entity decreasing a count value of the backoff counter by 1 each time the primary channel of the primary link is idle for a time slot; and the ML entity ending the backoff procedure of the primary link when the count value of the backoff counter decreases to 0.

[0013] In a possible design, the first slave link is idle within a first inter-frame space before an ending moment of the backoff procedure of the primary link, including: a primary channel of the first slave link being idle within a first inter-frame space before a moment when the count value of the backoff counter decreases to 0.

[0014] In a possible design, the primary channel of the first slave link is a 20 MHz subchannel with a lowest frequency in a frequency band corresponding to the first slave link; or the primary channel of the first slave link is a 20 MHz subchannel with a highest frequency in the frequency band corresponding to the first slave link. That is, the primary channel of the first slave link is configured in an implicit manner, which is beneficial for saving signaling overhead.

[0015] In a possible design, the first PPDU includes a first type of media access control (MAC) frame, and the first type of MAC frame does not require a response.

[0016] In a possible design, the first PPDU includes a second type of MAC frame, and the second type of MAC frame requires a response. The method further includes: receiving, by the ML entity, a response frame of the second type of MAC frame on one or more first links; determining, by the ML entity, that a transmission opportunity (TXOP) establishment fails if the one or more first links do not include the primary link; and determining, by the ML entity, that the TXOP establishment succeeds if the one or more first links include the primary link.

[0017] In a possible design, the method further includes: determining, by the ML entity, N second links corresponding to the TXOP, the N second links including the primary link and N-1 second slave links, and the second slave link being a first slave link that meets a preset condition, and the preset condition including: transmitting, by the ML entity, a first PPDU including the first type of MAC frame on the first slave link; or transmitting, by the ML entity, a first PPDU including the second type of MAC frame on the first slave link, and receiving, by the ML entity, a response frame of the second type of MAC frame on the first slave link. The ML entity transmits a second PPDU on each of the N second links.

[0018] In a possible design, the method further includes: if the transmission of the second PPDU on one or more of the second links fails, the ML entity stops sending the second PPDU on the second link on which the transmission of the second PPDU fails, and continues to send the second PPDU on the second link on which the transmission of the second PPDU succeeds until the end of the TXOP.

[0019] In a possible design, the method further includes: if the transmission of the second PPDU on one or more of the second links fails, the ML entity stops sending the second PPDU on the N second links; the ML entity waits for the idle time of the primary link to reach a first inter-frame interval; and after the idle time of the primary link reaches the first inter-frame interval, the ML entity sends the second PPDU on each of P third links, where the P third links include the primary link and P-1 third slave links, a third slave link is a second slave link that is in an idle state within the first inter-frame interval before a first time, the first time is the time when the idle time of the primary link reaches the first inter-frame interval, and P is a positive integer less than or equal to N.

[0020] In a possible design, the method further includes: if the transmission of the second PPDU on one or more of the second links fails, the ML entity stops sending the second PPDU on the N second links; the ML entity performs a backoff procedure on the primary link; and after the backoff procedure on the primary link ends, the ML entity sends the second PPDU on each of P third links, where the P third links include the primary link and P-1 third slave links, a third slave link is a second slave link that is in an idle state within a first inter-frame interval before an end time of the backoff procedure on the primary link, and P is a positive integer less than or equal to N.

[0021] In a second aspect, a communication method is provided. The method is applied to an ML entity, and the ML entity supports K first links. The method includes: the ML entity performs a backoff procedure on each of the K first links, where K is a positive integer greater than or equal to 2; when a backoff procedure on a target link ends, the ML entity sends a first PPDU on each of N second links, a second link is a first link that is in an idle state within a first inter-frame interval before an end time of the backoff procedure on the target link, the target link is a first link among the K first links on which the backoff procedure ends first, and N is a positive integer less than or equal to K; and if the transmission of the first PPDU on one or more of the second links fails, the ML entity does not send a second PPDU on the second link on which the transmission of the first PPDU fails within a preset time, or the ML entity does not send the second PPDU on the N second links within the preset time.

[0022] Based on the technical solution, in the case that the ML entity fails to transmit the first PPDU on one or more second links, the ML entity is prohibited from transmitting the second PPDU on the second link on which the transmission of the PPDU fails within a preset time, or the ML entity is prohibited from transmitting the second PPDU on N second links within the preset time. In this way, within the preset time, the ML entity cannot use multiple links. If the ML entity cannot use a certain one of the multiple links is supported by the SL entity, within the preset time, since the ML entity cannot perform channel contention on the link supported by the SL entity, the probability that the SL entity contends for the channel increases, thereby ensuring the fairness of the SL entity in channel contention, and thereby ensuring the normal communication of the SL entity.

[0023] In a third aspect, a communication method is provided, which is applied to an ML entity, and the ML entity supports K first links. The method further includes: performing, by the ML entity, a backoff procedure on each of the K first links, K being a positive integer greater than or equal to 2; and transmitting, by the ML entity, a first PPDU on each of N second links, the second link being a first link on which the backoff procedure has ended and which is in an idle state within a first interframe interval before a first time, N being a positive integer less than or equal to M.

[0024] Based on the technical solution, although the ML performs the backoff procedure on the K first links, the second link used to transmit the first PPDU needs to meet the condition that the backoff procedure has ended. That is, on a link, the ML entity needs to end the backoff on the link at least, and then it is possible to contend for the channel. Compared with the prior art in which the ML entity can contend for the channel on a link even if the backoff procedure is not completed, the technical solution reduces the probability that the ML entity contends for the channel on a link, thereby ensuring the fairness of the SL entity in channel contention, and thereby ensuring the normal communication of the SL entity.

[0025] In a possible design, the first time is an ending time of the backoff procedure of a target link, and the target link is a second link on which the backoff procedure ends last among the N second links.

[0026] In a fourth aspect, a communication method is provided, which is applied to an ML entity, and the ML entity supports K first links. The method further includes: performing, by the ML entity, a backoff procedure on each of the K first links, K being a positive integer greater than or equal to 2; and transmitting, by the ML entity, a first PPDU on each of N second links in the case that the sum of the count values of the backoff counters of the K first links is less than or equal to 0, or the sum of the count values of the backoff counters of the N second links is less than or equal to 0, the second link being a first link that is in an idle state within a second interframe interval before a current time, N being a positive integer less than or equal to M.

[0027] Based on the above technical solution, although the ML entity performs the backoff procedure on each of the K first links, the ML entity can successfully contend for the channel only when the sum of the count values of the backoff counters of the K first links is less than or equal to 0, or the sum of the count values of the backoff counters of the N second links is less than or equal to 0. That is, the count value of the backoff counter of the ML entity on one or more first links needs to be less than 0. This requires a longer idle time of one or more first links, resulting in a lower probability of the ML entity contending for the channel. The lower probability of the ML entity contending for the channel weakens the advantage of the ML entity over the SL entity in channel contention, ensures the fairness of the SL entity in channel contention, and thus ensures that the SL entity can normally communicate.

[0028] In a possible design, the ML entity performs the backoff procedure on each of the K first links, including: for each of the K first links, the ML entity waits for the idle time of the first link to reach a second interframe spacing; and after the idle time of the first link reaches the second interframe spacing, each time the first link is in an idle state at a time slot, the ML entity decrements the count value of the backoff counter of the first link by 1.

[0029] In a possible design, the count value of the backoff counter of the first link includes a negative integer.

[0030] In a possible design, the method further includes: for each of the K first links, after the idle time of the first link reaches the second interframe spacing, each time the first link is in an idle state at a time slot, the ML entity decrements the count value of the target counter by 1, where the target counter is used to record the sum of the count values of the backoff counters of the K first links. In this way, the ML entity can directly obtain the sum of the count values of the backoff counters of the K first links through the target counter.

[0031] In a fifth aspect, a communication method is provided, which is applied to an ML entity. The ML entity supports multiple links, and the multiple links are arranged in a preset cyclic order to serve as first links in turn. The method further includes: the ML entity performs a backoff procedure on a first link; and after the backoff procedure on the first link ends, the ML entity sends a first PPDU on each of N second links in turn, where the N second links include the first link and N-1 available links, the available links are in an idle state within a first interframe spacing before the end of the backoff procedure on the first link, and N is a positive integer.

[0032] Based on the above technical solution, each time the channel is accessed, the ML entity only performs the backoff process on the first link. That is, the ML entity only competes for the channel on one link. The probability of the ML entity competing for the channel on one link is equal to the probability of the SL entity competing for the channel on one link. In this way, the fairness of the SL entity in channel competition is ensured, so that the SL entity can normally communicate.

[0033] In a sixth aspect, an ML entity is provided, which can include a module corresponding to each of the methods / operations / steps / actions described in any of the first to fifth aspects. The module can be a hardware circuit, or software, or a combination of hardware circuit and software.

[0034] In a seventh aspect, an ML entity is provided, which includes a processor and a transceiver. The processor is configured to perform the processing operations in the communication method according to any of the first to fifth aspects. The transceiver is configured to be controlled by the processor and perform the transceiving operations in the communication method according to any of the first to fifth aspects.

[0035] In an eighth aspect, a computer-readable storage medium is provided, which stores instructions for a computer to perform the communication method according to any of the first to fifth aspects when the instructions are read by the computer.

[0036] In a ninth aspect, a computer program product is provided, which includes instructions for a computer to perform the communication method according to any of the first to fifth aspects when the instructions are read by the computer.

[0037] In a tenth aspect, a chip is provided, which includes a processing circuit and a transceiver pin. The chip supports a master link and at least one slave link, and a backoff counter is arranged on the master link and not arranged on the slave link. The processing circuit is configured to cause the ML entity to perform a backoff process on the master link based on the backoff counter. The transceiver pin is configured to cause the ML entity to send a first PPDU on each of K first links when the count value of the backoff counter is reduced to 0, the K first links including the master link and K-1 first slave links, the first slave link being in an idle state within a first interframe spacing before the count value of the backoff counter is reduced to 0, and K being a positive integer.

[0038] In an eleventh aspect, a chip is provided. The chip includes processing circuitry and transceiving pins. The chip supports K first links. The processing circuitry is configured to perform a backoff procedure on each of the K first links, where K is a positive integer greater than or equal to 2. The transceiving pins are configured to transmit a first PPDU on each of N second links when the backoff procedure of a target link ends, where the second link is a first link that is idle in a first interframe space before a time when the backoff procedure of the target link ends, the target link is a first link that ends the backoff procedure first among the K first links, and N is a positive integer less than or equal to K. The transceiving pins are further configured to refrain from transmitting a second PPDU on the second link on which the transmission of the first PPDU fails within a predetermined time, or refrain from transmitting a second PPDU on the N second links within the predetermined time, if the transmission of the first PPDU fails on one or more second links.

[0039] In a twelfth aspect, a chip is provided. The chip includes processing circuitry and transceiving pins. The chip supports K first links. The processing circuitry is configured to perform a backoff procedure on each of the K first links, where K is a positive integer greater than or equal to 2. The transceiving pins are configured to transmit a first PPDU on each of N second links, where the second link is a first link that ends the backoff procedure and is idle in a first interframe space before a first time, and N is a positive integer less than or equal to M.

[0040] In a thirteenth aspect, a chip is provided. The chip includes processing circuitry and transceiving pins. The chip supports K first links. The processing circuitry is configured to perform a backoff procedure on each of the K first links, where K is a positive integer greater than or equal to 2. The transceiving pins are configured to transmit a first PPDU on each of N second links when a sum of count values of backoff counters of the K first links is less than or equal to 0, or a sum of count values of backoff counters of the N second links is less than or equal to 0, where the second link is a first link that is idle in a second interframe space before a current time, and N is a positive integer less than or equal to M.

[0041] In a fourteenth aspect, a chip is provided. The chip includes processing circuitry and transceiving pins. The chip supports a plurality of links that are taken as first links in a predetermined cyclic order. The processing circuitry is configured to perform a backoff procedure on the first link. The transceiving pins are configured to transmit a first PPDU on each of N second links after the backoff procedure of the first link ends, where the N second links include the first link and N-1 available links that are idle in a first interframe space before a time when the backoff procedure of the first link ends, and N is a positive integer.

[0042] The technical effects brought by any one of the sixth aspect to the fourteenth aspect can refer to the beneficial effects provided in the corresponding method above, and will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0043] Figure 1 A schematic diagram of a backoff procedure provided by an embodiment of the present application;

[0044] Figure 2 A schematic diagram of a PPDU frame structure provided by an embodiment of the present application;

[0045] Figure 3 A schematic diagram of an ML communication scenario provided by an embodiment of the present application;

[0046] Figure 4 A schematic diagram of another ML communication scenario provided by an embodiment of the present application;

[0047] Figure 5 A flowchart of a communication method provided by an embodiment of the present application;

[0048] Figure 6 A flowchart of another communication method provided by an embodiment of the present application;

[0049] Figure 7 A schematic diagram of another ML communication scenario provided by an embodiment of the present application;

[0050] Figure 8 A schematic diagram of another ML communication scenario provided by an embodiment of the present application;

[0051] FIG. 9(a) is a flowchart of another communication method provided by an embodiment of the present application;

[0052] FIG. 9(b) is a flowchart of another communication method provided by an embodiment of the present application;

[0053] Figure 10 A flowchart of another communication method provided by an embodiment of the present application;

[0054] FIG. 11(a) is a flowchart of another communication method provided by an embodiment of the present application;

[0055] FIG. 11(b) is a flowchart of another communication method provided by an embodiment of the present application;

[0056] Figure 12 A flowchart of another communication method provided by an embodiment of the present application;

[0057] Figure 13 A flowchart of another communication method provided by an embodiment of the present application;

[0058] Figure 14 A schematic diagram of the structure of an ML entity provided in an embodiment of this application;

[0059] Figure 15 This is a schematic diagram of the structure of an ML entity provided in an embodiment of this application. Detailed Implementation

[0060] In the description of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. The "and / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "multiple" means two or more. The terms "first," "second," etc., do not limit the quantity or order of execution, and "first," "second," etc., do not necessarily imply differences.

[0061] It should be noted that, in this application, the terms "exemplary" or "for example" are used to indicate that something is being described as an example, illustration, or illustration. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or design solutions. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0062] To facilitate understanding, the technical terms involved in the embodiments of this application will be briefly introduced below.

[0063] 1. Basic Service Set (BSS)

[0064] A Basic Service Set Identifier (BSS) is used to describe a group of devices in a wireless local area network (WLAN) that are able to communicate with each other. A WLAN can include multiple BSSs. Each BSS has a unique identifier called a Basic Service Set Identifier (BSSID).

[0065] A BSS can include multiple stations (STAs). A station can be an access point (AP) or a non-access point station (non-AP STA). Optionally, a BSS can include one AP and multiple non-AP STAs associated with that AP.

[0066] An AP, also known as a wireless access point or hotspot, can be a wireless router, wireless transceiver, wireless switch, etc.

[0067] The non-AP STA can have different names, such as user unit, access terminal, mobile station, mobile station, mobile device, terminal, user equipment, etc. In practical applications, the non-AP STA can be a cellular phone, a smart phone, a wireless local loop (WLL), and other handheld devices with wireless local area network communication functions, computer devices, etc.

[0068] 2. Backoff mechanism

[0069] The IEEE 802.11 standard supports multiple users sharing the same transmission medium, and the sender performs transmission medium availability detection before transmitting data. The IEEE 802.11 standard uses carrier sense multiple access / collision avoidance (CSMA / CA) to implement channel contention. In order to avoid collision, CSMA / CA uses a backoff mechanism.

[0070] The backoff mechanism on a single channel is described below. Before transmitting a message, a device can select a random number between 0 and a contention window (CW) and use the random number as the initial value of the backoff counter. After the channel is idle for an arbitration inter-frame space (AIFS), the backoff counter is decremented by 1 for each idle timeslot. Before the backoff counter reaches 0, if the channel is busy in a timeslot, the backoff counter is paused. Then, if the channel changes from busy to idle and the channel is idle for AIFS, the backoff counter resumes counting. When the backoff counter reaches 0, the backoff process ends, and the device can start data transmission.

[0071] Combination Figure 1 For example, assume that the initial value of the backoff counter is 5, and the backoff counter starts to back off after the channel is idle for AIFS. Each time the channel is idle for a timeslot, the backoff counter is decremented by 1 until the backoff counter reaches 0. After the backoff counter reaches 0, the device successfully contends for the channel, and the device can transmit a PPDU on the channel.

[0072] 3. PPDU

[0073] As Figure 2The figure shows a schematic diagram of the frame structure of a PPDU in the 802.11ax standard. The PPDU includes: a legacy-short training field (L-STF), a legacy-long training field (L-LTF), a legacy-signal field (L-SIG), a repeated legacy-signal field (RL-SIG), a high efficient-signal field A (HE-SIG A), a high efficient-signal field B (HE-SIG B), a high efficient-short training field (HE-STF), a high efficient-long training field (HE-LTF), data, and a packet extension (PE).

[0074] 4. TXOP

[0075] A TXOP is a basic unit of wireless channel access. A TXOP consists of an initial time and a maximum duration TXOP limit. A station that obtains a TXOP can use the channel continuously to transmit multiple data frames without re-contending for the channel within the TXOP limit.

[0076] 5. RTS / C TS mechanism

[0077] The RTS / C TS mechanism is used to solve the problem of hidden stations to avoid signal collision between multiple stations.

[0078] Before transmitting a data frame, the sending end first sends an RTS frame in a broadcast manner to indicate that the sending end will send a data frame to a specified receiving end within a specified time length. After receiving the RTS frame, the receiving end sends a CTS frame in a broadcast manner to confirm the sending of the sending end. Other stations that receive the RTS frame or the CTS frame do not send wireless frames until the specified time length ends.

[0079] 6. ML entity

[0080] The ML entity has the capability of transmitting and receiving on multiple frequency bands. Exemplarily, the multiple frequency bands include, but are not limited to, a 2.4 GHz frequency band, a 5 GHz frequency band, and a 6 GHz frequency band. A spatial path in which the ML entity transmits data on one frequency band can be referred to as a link. That is, the ML entity supports multi-link communication.

[0081] It should be understood that for the ML entity, each link supported by the ML entity corresponds to one frequency band.

[0082] The ML entity can also be referred to as an ML STA entity. The ML entity includes multiple STAs. The multiple STAs in the ML entity can have the same MAC address or different MAC addresses. The multiple STAs in the ML entity can be located at the same physical location or different physical locations.

[0083] Each STA in the ML entity can establish a link for communication. As shown in Figure 3 ML entity A includes stations A1-A N, and ML entity B includes stations B1-B N. Stations A1 and B1 communicate through link 1, stations A2 and B2 communicate through link 2, and so on, and stations AN and BN communicate through link N.

[0084] When the frequency interval between the multiple frequency bands supported by the ML entity is close, transmitting a signal on one frequency band by the ML entity can seriously affect receiving a signal on another frequency band. Therefore, in order to ensure normal communication, when the ML entity simultaneously uses multiple links for communication, the ML entity needs to simultaneously receive signals on the multiple links or simultaneously transmit signals on the multiple links. As shown in Figure 4 ML entity A simultaneously transmits PPDU on the first link and the second link, and then simultaneously receives block acknowledgement (BA) frames fed back by ML entity B on the first link and the second link.

[0085] In an embodiment of the present application, the PPDU simultaneously transmitted by the ML entity on different links can be the same or different.

[0086] In an embodiment of the present application, when the ML entity simultaneously uses multiple links for communication, the traffic identifiers (TIDs) corresponding to the multiple links can be the same or different.

[0087] If the STA in the ML entity is an AP, the ML entity can be referred to as an ML AP entity. If the STA in the ML entity is a non-AP STA, the ML entity can be referred to as an ML non-AP STA entity, or an ML non-AP entity. In the embodiments of the present application, if not specially specified, the ML entity can be either an ML AP entity or an ML non-AP entity.

[0088] The non-AP STA on one link in the ML non-AP entity can be associated with the AP on the same link in the ML AP entity, so that the non-AP STA on one link in the ML non-AP entity can communicate with the AP on the same link in the ML AP entity.

[0089] It should be understood that an association relationship can be established between the ML AP entity and the ML non-AP entity to ensure normal communication between the ML AP entity and the ML non-AP entity.

[0090] It should be noted that the association relationship between the ML AP entity and the ML non-AP entity includes the association relationship between the station of the ML AP entity on one link and the station of the ML non-AP entity on the same link.

[0091] The embodiments of the present application do not limit the implementation of the association relationship established between the ML non-AP entity and the ML AP entity. For example, the ML non-AP entity and the ML AP entity establish the association relationship on one link; or the ML non-AP entity and the ML AP entity establish the association relationship between the ML non-AP entity and the ML AP entity on multiple links on one link.

[0092] The specific implementation of the ML non-AP entity and the ML AP entity establishing the association relationship on one link can refer to the implementation of the association relationship established between the AP and the non-AP STA in the prior art, which will not be described herein.

[0093] 7、SL entity

[0094] The SL entity refers to a STA supporting only one link. The SL entity can be a legacy STA, that is, a STA supporting only the existing 802.11 standard, but not the next generation 802.11 standard.

[0095] The above is a brief introduction to the technical terms involved in the present application, which will not be described herein.

[0096] The technical solution of the present application is applied to a WLAN, and the WLAN can adopt an IEEE 802.11 standard, for example, an 802.11ax standard, and a next-generation 802.11 standard, and the like. The technical solution of the present application is applicable to a communication scenario between ML entities and a communication scenario between an ML entity and an SL entity.

[0097] For example, the communication scenario between ML entities can be a communication scenario between an ML non-AP entity and an ML AP entity, or a communication scenario between an ML non-AP entity and an ML non-AP entity, or a communication scenario between an ML AP entity and an ML AP entity.

[0098] For example, the communication scenario between an ML entity and an SL entity can be a communication scenario between an ML non-AP entity and a legacy AP, or a communication scenario between an ML AP entity and a legacy non-AP STA, or a communication scenario between an ML AP entity and a legacy AP, or a communication scenario between an ML non-AP entity and a legacy non-AP STA.

[0099] The technical solution provided by the embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0100] As shown in FIG. 1, a communication method provided by an embodiment of the present application includes the following steps. Figure 5

[0101] S101, an ML entity performs a backoff process of a primary link based on a backoff counter of the primary link.

[0102] It should be understood that, since the backoff counter is only set on the primary link, the ML entity can only perform the backoff process on the primary link.

[0103] It should be understood that, in the case where the ML entity supports the primary link and at least one secondary link, the ML entity supports two channel access modes, one of which is a single-link channel access mode, that is, the ML entity performs channel access only on the primary link, and the other of which is a multi-link channel access mode, that is, the ML entity performs channel access on the primary link and the secondary link. In actual application, the ML entity can select a channel access mode according to the channel condition, power, service load, and the like. For example, the ML entity adopts the single-link channel access mode for the purpose of saving power, and adopts the multi-link channel access mode for the purpose of improving the throughput rate. The embodiments of the present application mainly introduce the multi-link channel access mode. ​

[0104] Optionally, the master link of the ML entity can be configured in an explicit manner. It should be understood that the master link of the ML entity is configured in an explicit manner, which has higher flexibility.

[0105] For example, the ML AP entity can send indication information to the ML non-AP entity associated therewith to indicate the information of the master link. The information of the master link can include: the identification / index of the master link, the frequency band corresponding to the master link, and the like.

[0106] Optionally, the master link of the ML entity can be configured in an implicit manner. It should be understood that the master link of the ML entity is configured in an implicit manner, which is beneficial to save signaling overhead.

[0107] For example, the protocol can define a link corresponding to a specific frequency band as the master link. For example, the protocol defines the link corresponding to the 2.4 GHz frequency band as the master link.

[0108] For example, the protocol can define that, among the multiple links supported by the ML entity, the link corresponding to the frequency band with the lowest frequency is the master link, or the link corresponding to the frequency band with the highest frequency is the master link. For example, the ML entity supports the 2.4 GHz frequency band, the 5 GHz frequency band, and the 6 GHz frequency band. In the case of the link corresponding to the frequency band with the lowest frequency as the master link, the ML entity takes the link corresponding to the 2.4 GHz frequency band as the master link. In the case of the link corresponding to the frequency band with the highest frequency as the master link, the ML entity takes the link corresponding to the 6 GHz frequency band as the master link.

[0109] In the embodiment of the present application, the master link of the ML AP entity, the master link of the SL entity, and the master link of the ML non-AP entity in the same BSS are all the same link.

[0110] It can be understood that, for the ML entity, the links other than the master link among the multiple links supported by the ML entity are all slave links.

[0111] As an implementation manner, the ML entity waits for the idle time of the primary channel of the master link to reach a second interframe space. After the idle time of the primary channel of the master link reaches the second interframe space, the ML entity reduces the count value of the backoff counter by 1 every time the primary channel of the master link is in an idle state in a time slot. When the count value of the backoff counter is 0, the ML entity ends the backoff process of the master link.

[0112] It should be noted that, if the primary channel of the master link is in a busy state in a time slot, the ML entity freezes the backoff counter until the idle time of the primary channel reaches the second interframe space again.

[0113] Optionally, the second inter-frame space can be an AIFS, and the embodiments of the present application are not limited in this aspect.

[0114] Optionally, the primary channel can be a primary 20MHz channel, and the embodiments of the present application are not limited in this aspect.

[0115] Optionally, the primary channel of the primary link can be configured in an explicit manner. It should be understood that the primary channel of the primary link is configured in the explicit manner, and has higher flexibility.

[0116] Optionally, the ML entity can receive a MAC frame from another device, and the MAC frame is used to indicate the frequency domain position of the primary channel of the primary link in the frequency band corresponding to the primary link. Optionally, the MAC frame can be a beacon frame, an association response frame, or the like management frame.

[0117] Optionally, the primary channel of the primary link can be configured in an implicit manner. It should be understood that the primary channel of the primary link is configured in the implicit manner, and is beneficial to save signaling overhead.

[0118] Optionally, the protocol can define a preset frequency domain position of the primary channel of the primary link in the frequency band corresponding to the primary link. For example, the 20MHz subchannel with the highest frequency in the frequency band corresponding to the primary link is taken as the primary channel. For another example, the 20MHz subchannel with the lowest frequency in the frequency band corresponding to the primary link is taken as the primary channel.

[0119] S102, when the count value of the backoff counter is 0, the ML entity transmits a first PPDU on each of the K first links respectively.

[0120] Optionally, the K first links include the primary link and K-1 first slave links, and K is a positive integer.

[0121] In the embodiments of the present application, the first slave link is in an idle state in a first inter-frame space before the count value of the backoff counter of the primary link is reduced to 0. It should be understood that the count value of the backoff counter of the primary link is reduced to 0, which is equivalent to the end time of the backoff process of the primary link.

[0122] In other words, for any slave link, if the slave link is in an idle state in a first inter-frame space before the end time of the backoff process of the primary link, the slave link is the first slave link; otherwise, the slave link is not the first slave link. Optionally, the first inter-frame space is a PIFS, and the embodiments of the present application are not limited in this aspect.

[0123] Optionally, the busy-idle state of the slave link can be determined by the busy-idle state of the primary channel of the slave link. That is, if the primary channel of the slave link is in a busy state, it is indicated that the slave link is in a busy state. If the primary channel of the slave link is in an idle state, it is indicated that the slave link is in an idle state.

[0124] Optionally, the primary channel of the slave link is a primary 20MHz channel, and embodiments of the present application are not limited thereto.

[0125] It should be understood that, in the case of determining the busy state of the slave link from the busy state of the primary channel of the slave link, the primary channel of the first slave link is in an idle state within the first inter-frame space before the count value of the backoff counter is reduced to 0.

[0126] Optionally, the primary channel of the slave link can be configured in an explicit manner. It should be understood that configuring the primary channel of the slave link in an explicit manner has higher flexibility.

[0127] For example, the ML entity can receive a MAC frame from another device, and the MAC frame is used to indicate the frequency domain position of the primary channel of the slave link in the frequency band corresponding to the slave link. Optionally, the MAC frame can be a beacon frame, an association response frame, or the like management frame.

[0128] Optionally, the primary channel of the slave link can be configured in an implicit manner. It should be understood that configuring the primary channel of the slave link in an implicit manner is advantageous in saving signaling overhead.

[0129] For example, the protocol can define a preset frequency domain position of the primary channel of the slave link in the frequency band corresponding to the slave link. For example, the 20MHz subchannel with the highest frequency in the frequency band corresponding to the slave link is taken as the primary channel of the slave link. For another example, the 20MHz subchannel with the lowest frequency in the frequency band corresponding to the slave link is taken as the primary channel of the slave link.

[0130] As an optional implementation manner, the ML entity transmits a first PPDU on a first available channel of each of the K first links. The first available channel of the master link includes the primary channel of the master link. The first available channel of the first slave link includes the primary channel of the first slave link.

[0131] That is to say, for each of the K first links, before transmitting the first PPDU, the ML entity determines the first available bandwidth of the first link according to the idle state of each subchannel in the frequency band corresponding to the first link and the bandwidth requirement of the ML entity, so as to fully utilize the bandwidth resource of the first link.

[0132] It should be noted that the first PPDU refers to the first PPDU transmitted by the ML entity on the first link. The first PPDU can be used to establish a TXOP.

[0133] It should be understood that the first PPDUs transmitted on different first links can be different. That is to say, the ML entity can transmit different first PPDUs on different first links.

[0134] Optionally, the first PPDU includes one of the following two cases:

[0135] Case one, the first PPDU contains the first type of MAC frame and does not contain the second type of MAC frame.

[0136] In the embodiment of the application, the first type of MAC frame does not need the receiving end to feed back a response frame. In other words, the first type of MAC frame does not need a response.

[0137] For example, the first type of MAC frame is a CTS-to-self frame, and the embodiment of the application is not limited thereto.

[0138] In the embodiment of the application, the second type of MAC frame needs the receiving end to feed back a response frame. In other words, the second type of MAC frame needs a response.

[0139] For example, the second type of MAC frame can be an RTS frame. In the case where the second type of MAC frame is an RTS frame, the response frame of the second type of MAC frame is a CTS frame.

[0140] For example, the second type of MAC frame can be a data frame. In the case where the second type of MAC frame is a data frame, the response frame of the second type of MAC frame is an acknowledge (ACK) frame.

[0141] It should be understood that if the ML entity transmits the first PPDU corresponding to case one on the main link, the ML entity defaults that the TXOP is successfully established.

[0142] Case two, the first PPDU contains the second type of MAC frame and does not contain the first type of MAC frame.

[0143] Case three, the first PPDU contains the first type of MAC frame and the second type of MAC frame.

[0144] For case two or case three, if the ML entity transmits the first PPDU containing the second type of MAC frame on the main link. If the ML entity receives the response frame of the second type of MAC frame on the main link, the ML entity determines that the TXOP is successfully established. If the ML entity does not receive the response frame of the second type of MAC frame on the main link, the ML entity determines that the TXOP is unsuccessfully established.

[0145] The following will introduce the scenario in which the ML entity transmits the first PPDU on the K first links in combination with the various cases of the first PPDU.

[0146] Scenario one, the ML entity transmits the first PPDU containing the first type of MAC frame on the K first links.

[0147] Scenario two, the ML entity transmits the first PPDU containing the first type of MAC frame on the master link and a part of the first slave links, and transmits the PPDU containing the second type of MAC frame on another part of the first slave links.

[0148] Based on the scenario one or the scenario two, the ML entity determines that the TXOP establishment is successful by default.

[0149] Scenario three, the ML entity transmits the first PPDU containing the second type of MAC frame on the K first links.

[0150] Scenario four, the ML entity transmits the first PPDU containing the second type of MAC frame on the master link and a part of the first slave links, and transmits the PPDU containing the first type of MAC frame on another part of the first slave links.

[0151] Based on the scenario three or the scenario four, the ML entity receives the response frame of the second type of MAC frame on one or more first links. If the one or more first links do not include the master link, the ML entity determines that the TXOP establishment is unsuccessful. If the one or more first links include the master link, the ML entity determines that the TXOP establishment is successful.

[0152] In the embodiments of the present application, in the case of successful establishment of the TXOP, the maximum duration of the TXOP can be determined according to the duration field of the first PPDU transmitted on the master link.

[0153] Based on Figure 5 The technical solution shown in the figure, because the ML entity only sets the backoff counter on the master link, so when performing channel access, the ML entity only performs the backoff process on the master link. In this way, the ML entity cannot compete for the channel before the backoff process of the master link ends, thereby ensuring that the probability of the ML entity competing for the channel on the master channel is equal to the probability of the SL entity competing for the channel on the supported link. Therefore, the technical solution provided by the present application can ensure the fairness of the SL entity in channel competition, thereby ensuring that the SL entity can normally communicate.

[0154] In addition, based on Figure 5In the technical solution, in the case that the link supported by the SL entity is the same as the main link of the ML entity, the SL entity and the ML entity actually perform channel contention on the same link. In this way, in the case that the ML entity successfully contends for the channel on the main link, the SL entity does not send a PPDU on the main link, thereby ensuring that the ML entity does not have the problem of asynchronization in receiving and sending on multiple links. For example, taking link #1 as the main link, when the count value of the backoff counter of the ML AP entity on link #1 is 0, the ML AP entity sends a PPDU on link #1 and link #2, and the SL entity does not send a PPDU to the ML AP entity on link #1. Therefore, the ML AP entity can synchronously receive signals on link #1 and link #2, or synchronously send signals.

[0155] As an optional embodiment, the method comprises the following steps. Figure 5 The communication method shown in the technical solution comprises the following steps. Figure 6 In the case that the ML entity successfully establishes the TXOP, the communication method further comprises steps S103-S104.

[0156] S103, the ML entity determines N second links corresponding to the TXOP from K first links.

[0157] The N second links include a main link and N-1 second slave links, and N is a positive integer less than or equal to K.

[0158] In the embodiments of the present application, the second slave link is a first slave link that meets a preset condition.

[0159] Optionally, the preset condition comprises one of the following:

[0160] Condition one, the ML entity sends a first PPDU containing a first type of MAC frame on the first slave link.

[0161] Condition two, the ML entity sends a first PPDU containing a second type of MAC frame on the first slave link, and receives a response frame of the second type of MAC frame on the first slave link.

[0162] S104, the ML entity sends a second PPDU on each of the N second links.

[0163] The second PPDU is different from the first PPDU. Alternatively, the second PPDU is another PPDU other than the first PPDU.

[0164] It should be understood that the second PPDUs sent by the ML entity on different second links can be different PPDUs to achieve an extremely high throughput.

[0165] In the embodiments of the present application, the ML entity transmits a second PPDU on a second link; then, within a certain time length, the ML entity does not receive a response frame on the second link, which indicates that the transmission of the second PPDU on the second link fails. For example, the response frame can be a BA frame, and the embodiments of the present application are not limited to this.

[0166] It should be understood that in the case of the failure of the transmission of the second PPDU on the second link, if the ML entity does not perform corresponding processing on the second link on which the transmission of the second PPDU fails, but continues to transmit the second PPDU on the second link on which the transmission of the second PPDU fails, the second PPDU transmitted by the ML entity can always fail to be transmitted, thereby affecting the normal communication of the ML entity.

[0167] The processing manner adopted by the ML entity in the case of the failure of the transmission of the second PPDU on one or more second links is introduced below.

[0168] Processing manner one: if the transmission of the second PPDU on the primary link succeeds and the transmission of the second PPDU on one or more second links fails, the ML entity stops transmitting the second PPDU on the second link on which the transmission of the second PPDU fails, and continues to transmit the second PPDU on the second link on which the transmission of the second PPDU succeeds until the TXOP ends.

[0169] For example, the ML entity transmits the second PPDU on the slave link #1, the slave link #2, the slave link #3, and the primary link, respectively. If the transmission of the second PPDU on the slave link #2 fails, the ML entity stops transmitting the second PPDU on the slave link #2, and continues to transmit the second PPDU on the slave link #1, the slave link #3, and the primary link.

[0170] Processing manner two: if the transmission of the second PPDU on one or more second links fails, the ML entity stops transmitting the second PPDU on N second links. Then, the ML entity waits for the idle time of the primary link to reach a first interframe interval. When the idle time of the primary link reaches the first interframe interval, the ML entity transmits the second PPDU on each of P third links.

[0171] The P third links include the primary link and P-1 third slave links, and P is a positive integer less than or equal to N. The third slave link is a second slave link that is in an idle state within a first interframe interval before a first time, and the first time is the time when the idle time of the primary link reaches the first interframe interval.

[0172] In combination with Figure 7For example, the ML entity transmits the second PPDU#1 on the slave link #1, the slave link #2 and the master link respectively. Since the ML entity does not receive the BA frame on the slave link #1, the ML entity determines that the transmission of the second PPDU#1 on the slave link #1 fails. In this case, the ML entity suspends the transmission of the second PPDU on the slave link #1, the slave link #2 and the master link. After a PIFS, since the slave link #1 and the master link are in the idle state and the slave link #2 is in the busy state within the PIFS, the ML entity can determine that the slave link #1 and the master link are the third links. In this case, the ML entity transmits the second PPDU#2 on the slave link #1 and the master link respectively, and the ML entity does not transmit the second PPDU#2 on the slave link #2.

[0173] In the third processing manner, if the transmission of the second PPDU on one or more second links fails, the ML entity stops transmitting the second PPDU on N second links. Then, the ML entity performs a backoff procedure on the master link. When the backoff procedure on the master link ends, the ML entity transmits the second PPDU on each of P third links respectively.

[0174] In the third processing manner, if the transmission of the second PPDU on one or more second links fails, the ML entity stops transmitting the second PPDU on N second links. Then, the ML entity performs a backoff procedure on the master link. When the backoff procedure on the master link ends, the ML entity transmits the second PPDU on each of P third links respectively.

[0175] It should be understood that the ML entity performs the backoff procedure on the master link, which can refer to the description of step S101 above, and will not be described here again.

[0176] In combination with Figure 8 For example, the ML entity transmits the second PPDU#1 on the slave link #1, the slave link #2 and the master link respectively. Since the ML entity does not receive the BA frame on the slave link #1, the ML entity determines that the transmission of the second PPDU#1 on the slave link #1 fails. In this case, the ML entity suspends the transmission of the second PPDU on the slave link #1, the slave link #2 and the master link. The ML entity sets the count value of the backoff counter of the master link. Within a PIFS before the moment when the backoff counter of the master link decreases to 0, the slave link #1 and the master link are in the idle state and the slave link #2 is in the busy state. Therefore, the ML entity can determine that the slave link #1 and the master link are the third links. In this case, the ML entity transmits the second PPDU#2 on the slave link #1 and the master link respectively, and the ML entity does not transmit the second PPDU#2 on the slave link #2.

[0177] It should be understood that, in the above processing mode two or processing mode three, for each of the P third links, the ML entity transmits the second PPDU on the third link comprises: the ML entity transmits the second PPDU on a second available channel of the third link. For one link, the second available channel is a subset of the first available channel. The second available channel also includes the primary channel.

[0178] It should be understood that, in the above processing mode two or processing mode three, the transmission of the second PPDU on one or more second links fails, specifically: the transmission of the second PPDU on the primary link fails, and / or the transmission of the second PPDU on one or more second slave links fails.

[0179] Based on any one of the above processing modes, in the case of failure of the transmission of the second PPDU on one or more second links, the ML entity can ensure normal communication.

[0180] As shown in FIG. 9(a), a communication method provided by an embodiment of the present application includes the following steps:

[0181] S201, the ML entity performs a backoff process on each of the K first links respectively.

[0182] The ML entity supports K first links, and K is a positive integer greater than or equal to 2. Each of the K first links is provided with a backoff counter.

[0183] For each of the K first links, the backoff process of the first link includes the following steps: the ML entity waits for the idle time of the first link to reach a second interframe interval. After the idle time of the first link reaches the second interframe interval, each time the first link is in an idle state within a time slot, the ML entity decrements the count value of the backoff counter of the first link by 1. When the count value of the backoff counter of the first link is 0, the ML entity ends the backoff process of the first link.

[0184] In the embodiment of the present application, if the first link is in a busy state within a time slot, the ML entity freezes the backoff counter of the first link until the idle time of the first link reaches the second interframe interval again. It should be understood that, freezing the backoff counter of the first link is equivalent to suspending the backoff process of the first link.

[0185] The above-mentioned second interframe interval can be an AIFS, which is not limited in the embodiment of the present application.

[0186] The busy state of the first link can be determined by the busy state of the primary channel of the first link. That is, if the primary channel of the first link is in the busy state, it means that the first link is in the busy state. If the primary channel of the first link is in the idle state, it means that the first link is in the idle state.

[0187] Optionally, the primary channel of the first link can be a primary 20MHz channel.

[0188] Optionally, the primary channel of the first link can be configured in an explicit manner. It should be understood that the primary channel of the first link is configured in an explicit manner, which has higher flexibility.

[0189] For example, the ML entity can receive a MAC frame from another device, and the MAC frame is used to indicate the frequency domain position of the primary channel of the first link in the frequency band corresponding to the first link. Optionally, the MAC frame can be a beacon frame, an association response frame, or the like management frame.

[0190] Optionally, the primary channel of the first link can be configured in an implicit manner. It should be understood that the primary channel of the first link is configured in an implicit manner, which is beneficial to save signaling overhead.

[0191] For example, the protocol can define a preset frequency domain position of the primary channel of the first link in the frequency band corresponding to the first link. For example, the highest frequency 20MHz subchannel in the frequency band corresponding to the first link is taken as the primary channel of the first link. For another example, the lowest frequency 20MHz subchannel in the frequency band corresponding to the first link is taken as the primary channel of the first link.

[0192] In the embodiment of the present application, when the ML entity performs the backoff procedure of the K first links respectively, if the backoff procedure of a certain link ends first, the ML entity performs step S202.

[0193] S202, when the backoff procedure of the target link ends, the ML entity sends a first PPDU on each of the N second links.

[0194] The target link is the first link in which the backoff procedure ends first among the K first links. That is, the target link is the first link in which the count value of the backoff counter is reduced to 0 among the K first links.

[0195] The N second links include the target link and N-1 available links, and N is a positive integer less than or equal to K.

[0196] In the embodiments of the present application, the available link is the first link which is in the idle state in the first inter-frame interval before the end time of the backoff procedure of the target link. Or, the available link is the first link in which the primary channel is in the idle state in the first inter-frame interval before the end time of the backoff procedure of the target link.

[0197] It should be understood that if one first link (or the primary channel of the first link) is in the busy state in the first inter-frame interval before the end time of the backoff procedure of the target link, the first link is not an available link.

[0198] In the embodiments of the present application, after the end of the backoff procedure of the target link, the ML entity stops the backoff procedure of the other first links except the target link among the K first links until the end of the TXOP.

[0199] It should be understood that the first PPDU transmitted on different second links can be different. That is, the ML entity can send different first PPDUs on different second links.

[0200] S203, if the first PPDU fails to be transmitted on one or more second links, the ML entity does not send a second PPDU on the second link on which the first PPDU fails to be transmitted within a preset time.

[0201] Wherein, the second PPDU and the first PPDU are two different PPDUs. Or, the second PPDU is other PPDU than the first PPDU.

[0202] For example, the failure of the first PPDU to be transmitted on the second link can mean that the ML entity does not receive a response frame corresponding to the first PPDU on the second link. It should be understood that the response frame corresponding to the first PPDU is used to respond to the MAC frame carried in the first PPDU. For example, if the RTS frame is carried in the first PPDU, the response frame of the first PPDU can be the CTS frame.

[0203] Optionally, the preset time can be pre-configured or defined in the protocol, and the embodiments of the present application are not limited thereto.

[0204] For example, the ML entity transmits the first PPDU on link #1, link #3 and link #4 respectively, and if the ML entity does not receive the response frame corresponding to the first PPDU on link #1, the ML entity can determine that the first PPDU fails to be transmitted on link #1. Therefore, the ML entity does not send the second PPDU on link #1 within the preset time.

[0205] Optionally, as shown in FIG. 9(b), step S203 in FIG. 9(a) can be replaced by step S204.

[0206] S204, if the first PPDU fails to be transmitted on one or more second links, the ML entity does not transmit the second PPDU on the N second links within a preset time.

[0207] For example, the ML entity transmits the first PPDU on link #1, link #3 and link #4 respectively, if the ML entity does not receive the response frame corresponding to the first PPDU on link #1, the ML entity can determine that the first PPDU fails to be transmitted on link #1. Therefore, the ML entity does not transmit the second PPDU on link #1, link #3 and link #4 within a preset time.

[0208] Based on the technical solutions shown in FIG. 9(a) or FIG. 9(b), in the case that the ML entity fails to transmit the first PPDU on one or more second links, the ML entity is prohibited to transmit the second PPDU on the second link on which the first PPDU fails to be transmitted within a preset time, or the ML entity is prohibited to transmit the second PPDU on the N second links within a preset time. In this way, within the preset time, the ML entity cannot use multiple links (for example, the second link on which the first PPDU fails to be transmitted or the N second links). If the ML entity cannot use one of the multiple links is supported by the SL entity, within the preset time, since the ML entity cannot perform channel contention on the link supported by the SL entity, the probability that the SL entity contends for the channel increases, thereby ensuring the fairness of the SL entity in channel contention and ensuring the normal communication of the SL entity.

[0209] As shown in FIG. 9(c), a communication method provided by an embodiment of the present application includes the following steps: Figure 10

[0210] S301, the ML entity performs a backoff process on each of the K first links.

[0211] The ML entity supports K first links, and K is an integer greater than or equal to 2. Each of the K first links is provided with a backoff counter.

[0212] For each of the K first links, the backoff process of the first link includes the following steps: the ML entity waits for the idle time of the first link to reach a second interframe interval. After the idle time of the first link reaches the second interframe interval, each time the first link is in an idle state within a time slot, the ML entity decrements the count value of the backoff counter of the first link by 1. When the count value of the backoff counter of the first link is 0, the ML entity ends the backoff process of the first link.

[0213] ​In the embodiments of the present application, if the first link is in the busy state in a time slot, the ML entity freezes the backoff counter of the first link until the idle time of the first link re-reaches the second inter-frame interval. It should be understood that the backoff counter of the first link is frozen, which is equivalent to that the backoff process of the first link is suspended.

[0214] The second inter-frame interval described above can be the AIFS, and the embodiments of the present application do not limit this.

[0215] The busy-idle state of the first link can be determined by the busy-idle state of the primary channel of the first link. That is, if the primary channel of the first link is in the busy state, it means that the first link is in the busy state. If the primary channel of the first link is in the idle state, it means that the first link is in the idle state.

[0216] Optionally, the primary channel described above can be a primary 20MHz channel. For each first link, the configuration method of the primary channel of the first link can refer to the above, and will not be described here.

[0217] S302, the ML entity sends a first PPDU on each of the N second links respectively.

[0218] Among them, the N second links are a subset of the K first links, and N is a positive integer less than or equal to K.

[0219] In the embodiments of the present application, the second link is the first link whose backoff process has ended and which is in the idle state within the first inter-frame interval before the first time.

[0220] In other words, if a first link has not ended the backoff process before the first time, the first link is not the second link. Or, if a first link is in the busy state within the first inter-frame interval before the first time, the first link is not the second link.

[0221] For example, the ML entity performs the backoff process on link #1, link #2, link #3, and link #4 respectively. Before the first time, the backoff process of link #1 has ended, the backoff process of link #2 has ended, and the backoff process of link #4 has ended. And, within the first inter-frame interval before the first time, link #1 is in the idle state, link #2 is in the busy state, and link #4 is in the idle state. Therefore, the ML entity can determine that link #1 and link #4 are the second links.

[0222] Optionally, the first time can be pre-configured or defined in the protocol.

[0223] Optionally, the first time can be the end time of the backoff process of the target link.

[0224] For example, the target link can be the last of N second links to end the backoff process.

[0225] For example, the target link can be the kth first link among K first links that ends the backoff process, where k is an integer greater than 1 and less than or equal to K.

[0226] It should be understood that the first PPDU transmitted on different second links can be different. That is, the ML entity can send different first PPDUs on different second links.

[0227] based on Figure 10 The technical solution shown in this application, although the ML performs the backoff procedure on all K first links, requires the second link used to transmit the first PPDU to meet the condition that the backoff procedure has ended. In other words, on a single link, the ML entity must at least complete the backoff procedure on that link in order to potentially compete for the channel. Compared to existing technologies where the ML entity can compete for the channel even without completing the backoff procedure on a single link, the technical solution of this application reduces the probability of the ML entity competing for the channel on a single link, thereby ensuring fairness in channel competition for the SL entities and ensuring that the SL entities can communicate normally.

[0228] As shown in Figure 11(a), a communication method provided in an embodiment of this application is included in the following steps:

[0229] S401, the ML entity executes a backoff procedure on each of the K first links.

[0230] The ML entity supports K first links, where K is an integer greater than or equal to 2. Each of the K first links is equipped with a backoff counter.

[0231] For each of the K first links, the backoff procedure on the first link includes the following steps: The ML entity waits for the idle time of the first link to reach the second inter-frame interval. After the idle time of the first link reaches the second inter-frame interval, whenever the first link is idle within a time slot, the ML entity decrements the count value of the backoff counter of the first link by 1.

[0232] The aforementioned second inter-frame interval can be AI FS, and this application embodiment does not limit this.

[0233] In this embodiment, the backoff counter of the first link has a value range including negative integers. That is, after the ML entity reduces the count value of the backoff counter of the first link to 0, the ML entity does not end the backoff process of the first link, but continues to back off.

[0234] For example, the initial value of the backoff counter of link #1 is 5. After the idle time of link #1 reaches the second inter-frame space, link #1 is idle for 6 consecutive time slots, and thus the count value of the backoff counter of link #1 can be -1.

[0235] In the embodiments of the present application, if the first link is busy in a time slot, the ML entity freezes the backoff counter of the first link until the idle time of the first link reaches the second inter-frame space again. It should be understood that freezing the backoff counter of the first link is equivalent to suspending the backoff process of the first link.

[0236] The busy / idle state of the first link can be determined by the busy / idle state of the primary channel of the first link. That is, if the primary channel of the first link is busy, it means that the first link is busy. If the primary channel of the first link is idle, it means that the first link is idle.

[0237] Optionally, the primary channel mentioned above can be a primary 20 MHz channel. For each first link, the configuration method of the primary channel of the first link can refer to the above, and will not be described here again.

[0238] S402, when the sum of the count values of the backoff counters of the K first links is less than or equal to 0, the ML entity sends a first PPDU on each of the N second links.

[0239] Wherein, the N second links are a subset of the K first links, and N is a positive integer less than or equal to K.

[0240] In the embodiments of the present application, the second link is a first link that is idle in the second inter-frame space before the current time. Or in other words, the second link is a first link whose backoff counter is not frozen. Or in other words, the second link is a first link whose backoff process is not suspended.

[0241] In step S402, the current time mentioned above refers to the time when the sum of the count values of the backoff counters of the K first links is less than or equal to 0.

[0242] Optionally, in a time slot, the ML entity can count the sum of the count values of the backoff counters of the K first links to determine whether the sum of the count values of the backoff counters of the K first links is less than or equal to 0.

[0243] Optionally, the ML entity also configures a target counter, which is used to record the count values of the K first links after the backoff counters. In this way, in a time slot, the ML can determine whether the sum of the count values of the backoff counters of the K first links is less than or equal to 0 by judging whether the sum of the count values of the target counter is less than or equal to 0.

[0244] In a particular implementation, the ML entity configures a target counter, and an initial value of the target counter is equal to a sum of initial values of the backoff counters of the K first links. For each of the K first links, after an idle time of the first link reaches the second inter-frame space, the ML entity decrements a count value of the target counter by 1 each time a primary channel of the first link is idle for a time slot. That is, the ML entity decrements the count value of the target counter by 1 each time the ML entity decrements a backoff counter of a first link by 1.

[0245] Optionally, as shown in FIG. 11(b), step S402 in FIG. 11(a) can be replaced by step S403.

[0246] S403, when the sum of the count values of the backoff counters of the N second links is less than or equal to 0, the ML entity transmits a first PPDU on each of the N second links, respectively.

[0247] In an embodiment of the present application, the second link is a first link that is idle in the second inter-frame space before the current time. In other words, the second link is a first link whose backoff counter is not frozen. In yet other words, the second link is a first link whose backoff procedure is not suspended.

[0248] In step S403, the above-mentioned current time refers to a time when the sum of the count values of the backoff counters of the N second links is less than or equal to 0.

[0249] Optionally, in a time slot, the ML entity can count the sum of the count values of the backoff counters of the N second links to determine whether the sum of the count values of the backoff counters of the N second links is less than or equal to 0.

[0250] It should be understood that the first PPDUs transmitted on different second links in step S403 or step S402 can be different. That is, the ML entity can transmit different first PPDUs on different second links.

[0251] Based on the technical solutions shown in Figure 11(a) or Figure 11(b), although the ML entity executes a backoff procedure on each of the K first links, the ML entity can only successfully compete for the channel if the sum of the backoff counters on the K first links is less than or equal to 0, or the sum of the backoff counters on the N second links is less than or equal to 0. In other words, the backoff counter count of the ML entity on one or more first links needs to be less than 0. This requires a relatively long idle time on one or more first links, reducing the probability of the ML entity competing for the channel. This reduced probability weakens the ML entity's advantage over the SL entity in channel competition, ensuring fairness for the SL entity in channel competition and thus guaranteeing normal communication for the SL entity.

[0252] like Figure 12 The image shows a communication method provided in an embodiment of this application. The method includes the following steps:

[0253] S501, the ML entity executes the backoff procedure on the first link.

[0254] Among them, ML entities support multiple links.

[0255] In this embodiment, each of the multiple links can be configured with a backoff counter. However, each time the ML entity initiates channel access across multiple links, the ML entity only uses the backoff counter of one of the links (i.e., the first link) to perform a backoff.

[0256] Optionally, one of the multiple links may be randomly selected as the first link. Alternatively, multiple links may take turns being the first link in a preset cyclical order.

[0257] Optionally, the above-mentioned cyclic order can be: the sequence number of multiple links arranged from largest to smallest, or the sequence number of multiple links arranged from smallest to largest, or a pseudo-random order of the sequence number of multiple links. The embodiments of this application are not limited to these.

[0258] For example, an ML entity supports 7 links, numbered 0, 1, 2, 3, 4, 5, and 6. The default cyclic sequence is "01204465", where each number represents the link number. Thus, during the first channel access, the ML entity uses the link with number 0 as the first link. During the second channel access, it uses the link with number 1 as the first link, and so on, until the tenth channel access, when it uses the link with number 1 as the first link.

[0259] It should be understood that different ML entities can be set with different loop orders, and this application does not limit this.

[0260] In the embodiments of the present application, the ML entity performs a backoff procedure on the first link, including the following steps: the ML entity waits for the idle time of the first link to reach a second inter-frame spacing. After the idle time of the first link reaches the second inter-frame spacing, the ML entity decrements the count value of the backoff counter of the first link by 1 each time the first link is idle in a time slot. When the count value of the backoff counter of the first link is 0, the ML entity ends the backoff procedure of the first link.

[0261] In the embodiments of the present application, if the first link is busy in a time slot, the ML entity freezes the backoff counter of the first link until the idle time of the first link re-reaches the second inter-frame spacing. It should be understood that the freezing of the backoff counter of the first link is equivalent to the suspension of the backoff procedure of the first link.

[0262] The second inter-frame spacing can be an AIFS, which is not limited in the embodiments of the present application.

[0263] The busy / idle state of the first link can be determined by the busy / idle state of the primary channel of the first link. That is, if the primary channel of the first link is busy, it means that the first link is busy. If the primary channel of the first link is idle, it means that the first link is idle.

[0264] Optionally, the primary channel of the first link can be a primary 20MHz channel. The configuration method of the primary channel of the first link can refer to the above, which will not be described here.

[0265] S502, when the backoff procedure of the first link ends, the ML entity transmits a first PPDU on each of the N second links respectively.

[0266] The N available links include the first link and N-1 second links, and N is a positive integer.

[0267] It should be understood that the second link and the first link are two different links. The second link is idle in the first inter-frame spacing before the end time of the backoff procedure of the first link.

[0268] It should be understood that the first PPDUs transmitted on different second links can be different. That is, the ML entity can transmit different first PPDUs on different second links.

[0269] Based on Figure 12In the technical solutions shown, the ML entity only performs a backoff procedure on the first link each time channel access is performed. That is, the ML entity only competes for a channel on one link. The probability of the ML entity competing for a channel on one link is equal to the probability of the SL entity competing for a channel on one link. In this way, fairness of the SL entity in channel competition is ensured, thereby ensuring that the SL entity can normally communicate.

[0270] In the technical solutions shown in FIG. 9(a), FIG. 9(b), Figure 10 , FIG. 11(a), FIG. 11(b), or Figure 12 The first PPDU can include the following two cases:

[0271] Case one: The first PPDU contains the first type of MAC frame and does not contain the second type of MAC frame.

[0272] Case two: The first PPDU contains the second type of MAC frame and does not contain the first type of MAC frame.

[0273] Case three: The first PPDU contains the first type of MAC frame and the second type of MAC frame.

[0274] The detailed description of the first type of MAC frame and the second type of MAC frame can be referred to the description in step S102, and will not be described here.

[0275] The following describes scenarios in which the ML entity transmits the first PPDU on the N second links in combination with the various cases of the first PPDU.

[0276] Scenario one: The ML entity transmits the first PPDU containing only the first type of MAC frame on all the N second links.

[0277] Scenario two: The ML entity transmits the first PPDU containing only the first type of MAC frame on a part of the second links and transmits the first PPDU containing the second type of MAC frame on another part of the second links.

[0278] Based on scenario one or scenario two, the ML entity defaults that the TXOP is successfully established.

[0279] Scenario three: The ML entity transmits the first PPDU containing the second type of MAC frame on all the N second links.

[0280] Based on scenario three, if the ML entity does not receive a response frame of the second type of MAC frame on any one of the second links, the ML entity confirms that the TXOP is unsuccessfully established. If the ML entity receives a response frame of the second type of MAC frame on at least one of the second links, the ML entity confirms that the TXOP is successfully established.

[0281] As an optional embodiment, based on Figure 10 to Figure 12 the technical solution shown as Figure 13 In the case where the ML entity successfully establishes the TXOP, the communication method further includes steps S601-S602.

[0282] S601, the ML entity determines P third links corresponding to the TXOP from N second links.

[0283] Among them, the P third links are a subset of the N second links, and P is a positive integer less than or equal to N.

[0284] In the embodiments of the present application, the third link is a second link that meets the preset condition.

[0285] Optionally, the preset condition includes one of the following:

[0286] Condition one, the ML entity sends a first PPDU containing a first type of MAC frame on the second link.

[0287] Condition two, the ML entity sends a first PPDU containing a second type of MAC frame on the second link, and receives a response frame of the second type of MAC frame on the second link.

[0288] S602, the ML entity sends a second PPDU on each of the P third links respectively.

[0289] It should be understood that the second PPDUs transmitted on different third links can be different. That is, the ML entity can send different second PPDUs on different third links.

[0290] Optionally, in the case of failure to transmit a PPDU on one or more third links, the ML entity can adopt any of the following processing methods.

[0291] Processing method one, the ML entity stops sending the second PPDU on the third link where the transmission of the second PPDU fails, and continues to send the second PPDU on the third link where the transmission of the second PPDU succeeds until the TXOP ends.

[0292] Processing method two, the ML entity stops sending the second PPDU on the P third links. The ML entity waits until a preset time to determine L fourth links. And the ML entity sends a second PPDU on each of the L fourth links respectively.

[0293] Among them, the L fourth links are a subset of the P third links, and L is a positive integer less than or equal to P. The fourth link is a third link that is in an idle state within a first interframe interval before the preset time.

[0294] It should be understood that the preset time can be pre-configured or defined in a protocol.

[0295] In a third processing manner, the ML entity stops transmitting the second PPDU on the P third links. The ML entity performs a backoff procedure on each of the P third links. When the backoff procedure on a target third link ends, the ML entity determines L fourth links. And the ML entity transmits the second PPDU on each of the L fourth links.

[0296] The L fourth links are a subset of the P third links, and L is a positive integer less than or equal to P. The fourth link is a third link that is in an idle state within a first inter-frame space before the end of the backoff procedure on the target third link. The target third link can be a third link that ends the backoff procedure first among the P third links.

[0297] Based on any one of the above processing manners, in a scenario where the transmission of the second PPDU on one or more third links fails, the ML entity can ensure normal communication.

[0298] The above mainly introduces the scheme provided by the embodiments of the present application from the perspective of the ML entity. It can be understood that the ML entity includes the corresponding hardware structure and / or software module for executing each function in order to implement the above functions. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is driven by hardware or computer software to drive hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0299] The embodiments of the present application can divide the functional modules of the device according to the above method examples. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or software functional module. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical functional division. Actual implementation can have another division manner. The following takes dividing each functional module corresponding to each function as an example for description:

[0300] Figure 14 A structure schematic diagram of an ML entity provided by the embodiments of the present application is shown in FIG. 1. As shown in FIG. 1, the ML entity includes a processing unit 101 and a communication unit 102. Figure 14

[0301] ​Optionally, the ML entity can perform any of the following schemes:

[0302] Scheme 1

[0303] The ML entity supports a master link and at least one slave link, the master link is provided with a backoff counter, and the slave link is not provided with the backoff counter. The processing unit 101 is configured to perform a backoff procedure of the master link based on the backoff counter. The communication unit 102 is configured to send a first PPDU on each of K first links when a count value of the backoff counter is reduced to 0, the K first links include the master link and K-1 first slave links, the first slave link is in an idle state within a first inter-frame spacing before the count value of the backoff counter is reduced to 0, and K is a positive integer.

[0304] In a possible design, the communication unit 102 is specifically configured to send the first PPDU on an available channel of each of the K first links, the available channel of the master link includes a primary channel of the master link, and the available channel of the first slave link includes a primary channel of the first slave link.

[0305] In a possible design, the processing unit 101 is specifically configured to wait for an idle time of the primary channel of the master link to reach a second inter-frame spacing, and reduce the count value of the backoff counter by 1 each time the primary channel of the master link is in an idle state for a time slot after the idle time of the primary channel of the master link reaches the second inter-frame spacing, and end the backoff procedure of the master link when the count value of the backoff counter is reduced to 0.

[0306] In a possible design, the first slave link is in an idle state within a first inter-frame spacing before an ending time of the backoff procedure of the master link, including that the primary channel of the first slave link is in an idle state within a first inter-frame spacing before a time when the count value of the backoff counter is reduced to 0.

[0307] In a possible design, the primary channel of the first slave link is a 20 MHz sub-channel with the lowest frequency in a frequency band corresponding to the first slave link, or the primary channel of the first slave link is a 20 MHz sub-channel with the highest frequency in the frequency band corresponding to the first slave link.

[0308] In a possible design, the first PPDU includes a first type of MAC frame, and the first type of MAC frame does not require a response.

[0309] In a possible design, the first PPDU comprises a second type of MAC frame, and the second type of MAC frame requires a response. The communication unit 102 is further configured to receive a response frame of the second type of MAC frame on the one or more first links. The processing unit 101 is further configured to determine that the TXOP establishment fails if the one or more first links do not include the primary link, and determine that the TXOP establishment succeeds if the one or more first links include the primary link.

[0310] In a possible design, the processing unit 101 is further configured to determine N second links corresponding to the TXOP, where the N second links include the primary link and N-1 second slave links, and each second slave link is a first slave link that meets a preset condition, and the preset condition includes that the ML entity transmits, on the first slave link, the first PPDU including the first type of MAC frame, or the ML entity transmits, on the first slave link, the first PPDU including the second type of MAC frame, and receives, on the first slave link, a response frame of the second type of MAC frame. The communication unit 102 is further configured to transmit the second PPDU on each of the N second links.

[0311] In a possible design, the communication unit 102 is further configured to, if the transmission of the second PPDU on one or more second slave links fails, stop transmitting the second PPDU on the second link on which the transmission of the second PPDU fails, and continue transmitting the second PPDU on the second link on which the transmission of the second PPDU succeeds, until the TXOP ends.

[0312] In a possible design, the communication unit 102 is further configured to, if the transmission of the second PPDU on one or more second links fails, stop transmitting the second PPDU on the N second links. The processing unit 101 is further configured to wait until an idle time of the primary link reaches a first inter-frame interval. The communication unit 102 is further configured to, after the idle time of the primary link reaches the first inter-frame interval, transmit the second PPDU on each of P third links, where the P third links include the primary link and P-1 third slave links, each third slave link is a second slave link that is in an idle state within a first inter-frame interval before a first time, the first time is a time when the idle time of the primary link reaches the first inter-frame interval, and P is a positive integer less than or equal to N.

[0313] In a possible design, the communication unit 102 is further configured to stop sending the second PPDU on the N second links if the transmission of the second PPDU on one or more second links fails. The processing unit 101 is further configured to perform a backoff procedure on the primary link. The communication unit 102 is further configured to send the second PPDU on each of the P third links after the end of the backoff procedure on the primary link, the P third links including the primary link and P-1 third slave links, the third slave link being a second slave link that is idle in a first inter-frame space before the end time of the backoff procedure on the primary link, and P being a positive integer less than or equal to N.

[0314] Solution two

[0315] The ML entity supports K first links. The processing unit 101 is configured to perform a backoff procedure on each of the K first links, K being a positive integer greater than or equal to 2. The communication unit 102 is configured to send the first PPDU on each of the N second links when the backoff procedure on the target link ends, the second link being a first link that is idle in a first inter-frame space before the end time of the backoff procedure on the target link, the target link being a first link that ends the backoff procedure first among the K first links, and N being a positive integer less than or equal to K. The communication unit 102 is further configured to not send the second PPDU on the second link on which the transmission of the first PPDU fails within a preset time, or not send the second PPDU on the N second links within the preset time if the transmission of the first PPDU on one or more second links fails.

[0316] Solution three

[0317] The ML entity supports K first links. The processing unit 101 is configured to perform a backoff procedure on each of the K first links, K being a positive integer greater than or equal to 2. The communication unit 102 is configured to send the first PPDU on each of the N second links, the second link being a first link that ends the backoff procedure and is idle in a first inter-frame space before the first time, and N being a positive integer less than or equal to M.

[0318] In a possible design, the first time is the end time of the backoff procedure on the target link, and the target link is a second link that ends the backoff procedure last among the N second links.

[0319] Solution four

[0320] The ML entity supports K first links. The processing unit 101 is configured to perform a backoff procedure on each of the K first links, K being a positive integer greater than or equal to 2. The communication unit 102 is configured to send a first PPDU on each of N second links respectively, in a case that a sum of count values of backoff counters of the K first links is less than or equal to 0, or a sum of count values of backoff counters of the N second links is less than or equal to 0, the second link being a first link in an idle state within a second inter-frame space before a current time, N being a positive integer less than or equal to M.

[0321] In a possible design, the processing unit 101 is specifically configured to, for each of the K first links, wait for an idle time of the first link to reach a second inter-frame space; and after the idle time of the first link reaches the second inter-frame space, decrease a count value of a backoff counter of the first link by 1 each time the first link is in an idle state at a time slot.

[0322] In a possible design, the count value of the backoff counter of the first link includes a negative integer.

[0323] In a possible design, the processing unit 101 is further configured to, for each of the K first links, after the idle time of the first link reaches the second inter-frame space, decrease a count value of a target counter by 1 each time the first link is in an idle state at a time slot, the target counter being used to record a sum of count values of backoff counters of the K first links.

[0324] Scheme five

[0325] The ML entity supports a plurality of links, and the plurality of links are taken as first links in turn according to a preset cyclic order. The processing unit 101 is configured to perform a backoff procedure on a first link. The communication unit 102 is configured to send a first PPDU on each of N second links respectively after the backoff procedure on the first link ends, the N second links including the first link and N-1 available links, the available link being in an idle state within a first inter-frame space before an end time of the backoff procedure on the first link, N being a positive integer.

[0326] The ML entity provided in the above embodiments of this application can be implemented in various product forms. For example, the ML entity can be configured as a general-purpose processing system; for another example, the ML entity can be implemented using a general bus architecture; for yet another example, the ML entity can be implemented using an application-specific integrated circuit (ASIC), etc. Several possible product forms of the ML entity described in the embodiments of this application are provided below. It should be understood that the following product forms are merely examples and do not limit the possible product forms of the ML entity described in the embodiments of this application.

[0327] Figure 15 This is a result diagram of the possible product forms of the ML entity described in the embodiments of this application.

[0328] As one possible product form, the ML entity described in this application embodiment can be a communication device, which includes a processor 201 and a transceiver 202. Optionally, the communication device further includes a storage medium 203.

[0329] The processor 201 is used to execute Figure 5 Step S101 in the process, Figure 6 Step S103 in Figure 9(a), and step S201 in Figure 9(a) Figure 10 Step S301 in Figure 11(a), and step S401 in Figure 11(a) Figure 12 Step S501 in the process, Figure 13 Step S601 in the process. Transceiver 202 is used to perform... Figure 5 Step S102 in the process, Figure 6 Step S104 in Figure 9(a), steps S202 and S203 in Figure 9(a), and step S204 in Figure 9(b) Figure 10 Step S302 in Figure 11(a), step S402 in Figure 11(a), and step S403 in Figure 11(b) Figure 12 Step S502 in the process, Figure 13 Step S602 in the process.

[0330] As another possible product form, the ML entity described in this application embodiment can also be implemented by a general-purpose processor or a dedicated processor, that is, a chip. The chip includes a processing circuit 201 and transceiver pins 202. Optionally, the chip may also include a storage medium 203.

[0331] The processing circuit 201 is used to perform... Figure 5 Step S101 in the process, Figure 6 Step S103 in Figure 9(a), and step S201 in Figure 9(a) Figure 10step S301 in FIG. 8(a), step S401 in FIG. 11(a), Figure 12 step S501 in FIG. 8(b), Figure 13 step S601 in FIG. 9(a). The transceiver pin 202 is configured to perform Figure 5 step S102 in FIG. 8(a), Figure 6 step S104 in FIG. 8(b), step S202 and S203 in FIG. 9(a), step S204 in FIG. 9(b), Figure 10 step S302 in FIG. 8(b), step S402 in FIG. 11(a), step S403 in FIG. 11(b), Figure 12 step S502 in FIG. 8(b), Figure 13 step S602 in FIG. 9(b).

[0332] The embodiment of the present application further provides a computer readable storage medium, wherein computer instructions are stored in the computer readable storage medium; when the computer readable storage medium is run on an ML entity, the ML entity performs the method shown in Figure 5 , Figure 6 FIG. 8(a), FIG. 8(b), Figure 10 FIG. 9(a), FIG. 9(b), Figure 12 FIG. 11(a), FIG. 11(b), Figure 13 or The computer instructions can be stored in the computer readable storage medium, or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be transmitted from one website site, computer, server or data center to another website site, computer, server or data center through wired (for example, coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (for example, infrared, wireless, microwave, etc.). The computer readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as one or more servers, data centers, etc. integrated with one or more media. The available medium can be a magnetic medium (for example, floppy disk, hard disk, magnetic tape), optical medium, or semiconductor medium (for example, solid state disk (solid state disk, SSD)) and the like.

[0333] The embodiment of the present application further provides a computer program product containing computer instructions, when the computer program product is run on an ML entity, the ML entity can perform the method shown in Figure 5 , Figure 6 FIG. 8(a), FIG. 8(b), Figure 10 FIG. 9(a), FIG. 9(b), Figure 12 FIG. 11(a), FIG. 11(b), Figure 13 Figure 5 Figure 6 Figure 10 Figure 12 Figure 13 Figure 5 Figure 6 Figure 10 Figure 12 Figure 13 or

[0334] Although the application has been described in connection with the embodiments thereof with reference to the various drawings, it will be understood that other variations and modifications of the details, and specific embodiments disclosed can be effected without departing from the spirit and scope of the application as set forth in the claims. In the claims, the article "a," "an" and "the" are used expansively and do not exclude plural or multiple claims. A processor or other unit can implement one or more functions recited in the claims. The various measures described in the dependent claims are not mutually exclusive and can be combined in other configurations, to the extent that the measures are not mutually exclusive, the dependent claims are not mutually exclusive.

[0335] Although the application has been described in connection with specific embodiments thereof, it will be understood that it is capable of further modifications and this application is intended to cover any variations, uses or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. Accordingly, the description and drawings are to be regarded as illustrative in nature and not as restrictive.

Claims

1. A communication method characterized by comprising: The method is applied to a station STA in a multi-link ML entity, and the method comprises: The STA performs a backoff procedure on a first link; The STA transmits a first physical layer protocol data unit PPDU on a second link, the second link being the first link on which the backoff procedure has ended before a first time and on which a first interframe space before the first time is idle; The ML entity supports K first links, and the first link is one of the K first links, K being an integer greater than or equal to 2, and the backoff procedure being performed on each of the K first links; The second link is one of N second links, the N second links being a subset of the K first links, N being a positive integer smaller than K; The first time is an end time of the backoff procedure of a target link among the K first links.

2. The communication method of claim 1, wherein Each of the K first links is provided with a backoff counter.

3. The communication method of claim 1 or 2, wherein The first PPDU transmitted on different second links of the N second links is different.

4. The communication method according to claim 1 or 2, characterized by, The STA is an access point AP or a non-access point station non-AP STA.

5. The communication method according to claim 1 or 2, characterized by, If the STA is an AP, the ML entity is an ML AP entity; if the STA is a non-AP STA, the ML entity is an ML non-AP STA entity or an ML non-AP entity.

6. A station (STA) comprising: The STA comprises a processing unit and a communication unit; The processing unit is configured to perform a backoff procedure on a first link; The communication unit is configured to transmit a first physical layer protocol data unit PPDU on a second link, the second link being the first link on which the backoff procedure has ended before a first time and on which a first interframe space before the first time is idle; The ML entity supports K first links, and the first link is one of the K first links, K being an integer greater than or equal to 2, and the backoff procedure being performed on each of the K first links; The second link is one of N second links, the N second links being a subset of the K first links, N being a positive integer smaller than K; The first time is an end time of the backoff procedure of a target link among the K first links.

7. The STA of claim 6, wherein Each of the K first links is provided with a backoff counter.

8. The STA of claim 6 or 7, wherein The first PPDU transmitted on different second links of the N second links is different.

9. The STA according to claim 6 or 7, characterized in that, The STA is an access point AP or a non-access point station non-AP STA.

10. The STA of claim 6 or 7, wherein, If the STA is an AP, the ML entity including the STA is an ML AP entity; if the STA is a non-AP STA, the ML entity including the STA is an ML non-AP STA entity or an ML non-AP entity.

11. A chip, characterized by The chip comprises processing circuitry and a transceiver pin; the processing circuitry is configured to perform a backoff procedure on a first link; and the transceiver pin is configured to send a first physical layer protocol data unit (PPDU) on a second link, the second link being the first link on which the backoff procedure has ended before a first time point and being in an idle state within a first inter-frame space before the first time point; The ML entity supports K first links, and the first link is one of the K first links, K being an integer greater than or equal to 2, and a backoff procedure being performed on each of the K first links; The second link is one of N second links, the N second links being a subset of the K first links, N being a positive integer smaller than K; and the first time point being an end time point of the backoff procedure of a target link among the K first links.

12. A computer-readable storage medium, characterized in that, The computer readable storage medium comprises computer instructions, which, when executed on a computer, cause the computer to perform the communication method of any one of claims 1 to 5.

13. A computer program product, characterised in that, The computer program product comprises computer instructions, which, when executed on a computer, cause the computer to perform the communication method of any one of claims 1 to 5.

Images