Granted Patent B2

US 12,389,463 · App. 18/067,355 · Granted Aug 12, 2025

Inventors: Yuchen Guo (Shenzhen, CN); Yunbo Li (Shenzhen, CN); Yiqing Li (Shenzhen, CN); Ming Gan (Shenzhen, CN)

Assignee: Huawei Technologies Co., Ltd.

H04W74/085

Abstract

Claims (49)

1. A channel access method, comprising:

performing first channel contention on a first link, wherein an initial value of a backoff counter in the first channel contention is determined based on a first value of a contention window;

performing channel contention on a second link;

detecting a state of the first link when a value of a backoff counter becomes 0 in the channel contention on the second link;

suspending the second link in response to determining that the state of the first link is a busy state;

when the state of the first link changes from the busy state to an idle state, triggering second channel contention on the first link; and

performing the second channel contention on the first link when a value of the backoff counter becomes 0 in the first channel contention and when transmission is not performed on the first link, wherein an initial value of the backoff counter in the second channel contention is determined based on a second value of the contention window, and the second value of the contention window is equal to the first value of the contention window, or the second value of the contention window is equal to a minimum value of the contention window.

2. The channel access method according to claim 1 , wherein the transmission is not performed on the first link when a state of the second link is a busy state, and wherein the state of the second link is the busy state when a time period for which the first link waits for channel contention on a second link exceeds a preset time period.

3. The channel access method according to claim 1 , wherein that transmission is not performed on the first link comprises:

after the value of the backoff counter becomes 0 in the first channel contention, a length of a data packet received on a second link exceeds a preset time period.

4. The channel access method according to claim 1 , wherein simultaneous transmit and receive (STR) is not supported between the first link and the second link.

5. The channel access method according to claim 1 , wherein before the performing second channel contention on the first link, the channel access method further comprises:

detecting a state of the first link in a first time period; and

in response to determining that the state of the first link in the first time period is an idle state, determining the first value of the contention window as the second value, or determining the second value of the contention window as the minimum value of the contention window.

6. The channel access method according to claim 1 , wherein after the performing second channel contention on the first link, the channel access method further comprises:

detecting a state of the second link when a value of the backoff counter becomes 0 in the second channel contention; and

transmitting data in parallel on the first link and the second link in response to determining that the state of the second link is an idle state.

7. An apparatus, comprising:

at least one processor; and

one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to:

perform first channel contention on a first link, wherein an initial value of a backoff counter in the first channel contention is determined based on a first value of a contention window;

perform channel contention on a second link;

detect a state of the first link when a value of a backoff counter becomes 0 in the channel contention on the second link;

suspend the second link in response to determining that the state of the first link is a busy state;

when the state of the first link changes from the busy state to an idle state, trigger second channel contention on the first link; and

perform the second channel contention on the first link when a value of the backoff counter becomes 0 in the first channel contention and when transmission is not performed on the first link, wherein an initial value of the backoff counter in the second channel contention is determined based on a second value of the contention window, and the second value of the contention window is equal to the first value of the contention window, or the second value of the contention window is equal to a minimum value of the contention window.

8. The apparatus according to claim 7 , wherein the transmission is not performed on the first link when a state of the second link is a busy state, and wherein the state of the second link is the busy state when a time period for which the first link waits for channel contention on a second link exceeds a preset time period.

9. The apparatus according to claim 7 , wherein after the value of the backoff counter becomes 0 in the first channel contention, a length of a data packet received on a second link exceeds a preset time period.

10. The apparatus according to claim 7 , wherein simultaneous transmit and receive (STR) is not supported between the first link and the second link.

11. The apparatus according to claim 7 , wherein the one or more memories store the programming instructions for execution by the at least one processor to:

detect a state of the first link in a first time period; and

in response to determining that the state of the first link in the first time period is an idle state, determine the first value of the contention window as the second value, or determine the second value of the contention window as the minimum value of the contention window.

12. The apparatus according to claim 7 , wherein the one or more memories store the programming instructions for execution by the at least one processor to:

detect a state of the second link when a value of the backoff counter becomes 0 in the second channel contention; and

transmit data in parallel on the first link and the second link in response to determining that the state of the second link is an idle state.

13. A non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores instructions for execution by at least one processor to:

perform first channel contention on a first link, wherein an initial value of a backoff counter in the first channel contention is determined based on a first value of a contention window;

performing channel contention on a second link;

detecting a state of the first link when a value of a backoff counter becomes 0 in the channel contention on the second link;

suspending the second link in response to determining that the state of the first link is a busy state;

when the state of the first link changes from the busy state to an idle state, triggering second channel contention on the first link; and

perform the second channel contention on the first link when a value of the backoff counter becomes 0 in the first channel contention and when transmission is not performed on the first link, wherein an initial value of the backoff counter in the second channel contention is determined based on a second value of the contention window, and the second value of the contention window is equal to the first value of the contention window, or the second value of the contention window is equal to a minimum value of the contention window.

14. The non-transitory computer-readable storage medium according to claim 13 , wherein simultaneous transmit and receive (STR) is not supported between the first link and the second link.

15. The non-transitory computer-readable storage medium according to claim 13 , wherein the non-transitory computer-readable storage medium stores the instructions for execution by the at least one processor to:

detect a state of the first link in a first time period; and

in response to determining that the state of the first link in the first time period is an idle state, determine the first value of the contention window as the second value, or determine the second value of the contention window as the minimum value of the contention window.

16. The non-transitory computer-readable storage medium according to claim 13 , wherein the non-transitory computer-readable storage medium stores the instructions for execution by the at least one processor to:

detect a state of the second link when a value of the backoff counter becomes 0 in the second channel contention; and

transmit data in parallel on the first link and the second link in response to determining that the state of the second link is an idle state.

Assignments (1)

Priority Claims (1)

Continuity (2)

References Cited (13)