IP Library › Granted Patent US 12,207,316
Granted Patent B2
US 12,207,316 · App. 17/146,990 · Granted Jan 21, 2025

Channel access method and apparatus

Inventors: Ying Wang (Shenzhen, CN); Yunbo Li (Shenzhen, CN); Shimon Shilo (Hod Hasharon, IL); Genadiy Tsodik (Hod Hasharon, IL); Leonid Epstein (Hod Hasharon, IL)
Assignee: HUAWEI TECHNOLOGIES CO., LTD.
H04W74/085H04L1/0008H04W74/002H04W80/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,207,316
App. No.
17/146,990
Granted
Jan 21, 2025
Kind
B2
Abstract

A channel access method and apparatus, where the method includes: determining, by a station, backoff duration based on a current first contention window; determining random padding duration based on a current second contention window when the backoff duration is reached; sending, on a channel, padding data whose duration is the random padding duration; detecting a state of the channel after the padding data is sent; and sending data on the channel if the state of the channel is an idle state.

Claims (49)

1. A channel access method, comprising:

determining, by a station, a backoff duration based on a first contention window, wherein the first contention window represents a first range of time slots during which the station waits before starting to send data;

determining a random padding duration based on a second contention window when the backoff duration is reached, wherein the second contention window represents a second range of time slots during which the station waits before starting to send the data;

sending, on a channel, padding data whose duration is the random padding duration;

detecting a state of the channel after the padding data is sent;

sending the data on the channel when the state of the channel is an idle state; and

when the state of the channel is a busy state:

skipping sending the data on the channel;

updating the first contention window based on a first update policy wherein the first update policy comprises multiplying the first contention window by a first coefficient; and

updating the second contention window based on a second update policy, wherein the second update policy comprises multiplying the second contention window by a second coefficient.

2. The channel access method of claim 1 , further comprising updating at least one of the first contention window or the second contention window when the state of the channel is the idle state.

3. The channel access method of claim 2 , wherein updating at least one of the first contention window or the second contention window comprises modifying the first contention window to a first initial contention window when the state of the channel is the idle state.

4. The channel access method of claim 2 , wherein updating at least one of the first contention window or the second contention window comprises modifying the second contention window to a second initial contention window when the state of the channel is the idle state.

5. The channel access method of claim 1 , wherein before sending the padding data, the channel access method further comprises sending a legacy preamble (L-preamble) on the channel, and wherein a value of a length indication field in legacy signaling in the L-preamble is a sum of a length of a data packet that carries the L-preamble and a length of the padding data.

6. The channel access method of claim 5 , wherein the data packet is a physical layer protocol data unit (PPDU), and wherein a data field of the PPDU is empty.

7. The channel access method of claim 5 , wherein the data packet is a physical layer protocol data unit (PPDU), wherein a media access control (MAC) header in a data field of the PPDU comprises a duration field, and wherein a value of the duration field is a sum of the length of the padding data, a short interframe space (SIFS), and a length of the data.

8. The channel access method of claim 5 , wherein the data packet is a null data packet (NDP).

9. A channel access apparatus, comprising:

a memory having a storage medium configured to store a program; and

a processor in communication with the memory and configured to execute the program to cause the channel access apparatus to:

determine a backoff duration based on a first contention window, wherein the first contention window represents a first range of time slots during which the station waits before starting to send data;

determine a random padding duration based on a second contention window when the backoff duration is reached, wherein the second contention window represents a second range of time slots during which the station waits before starting to send the data;

send, on a channel, padding data whose duration is the random padding duration;

detect a state of the channel after the padding data is sent;

send data on the channel when the state of the channel is an idle state; and

when the state of the channel is a busy state:

skip sending the data on the channel;

update the first contention window based on a first update policy wherein the first update policy comprises multiplying the first contention window by a first coefficient; and

update the second contention window based on a second update policy, wherein the second update policy comprises multiplying the second contention window by a second coefficient.

10. The channel access apparatus of claim 9 , wherein the processor is configured to execute the program to cause the channel access apparatus to update at least one of the first contention window or the second contention window when the state of the channel is the idle state.

11. The channel access apparatus of claim 10 , wherein the processor is configured to execute the program to cause the channel access apparatus to modify the first contention window to a first initial contention window when the state of the channel is the idle state.

12. The channel access apparatus of claim 10 , wherein the processor is configured to execute the program to cause the channel access apparatus to modify the second contention window to a second initial contention window when the state of the channel is the idle state.

13. The channel access apparatus of claim 9 , wherein before sending the padding data, the processor is further configured to execute the program to cause the channel access apparatus to send a legacy preamble (L-preamble) on the channel, and wherein a value of a length indication field in legacy signaling in the L-preamble is a sum of a length of a data packet that carries the L-preamble and a length of the padding data.

14. The channel access apparatus of claim 13 , wherein the data packet is a physical layer protocol data unit (PPDU), wherein a media access control (MAC) header in a data field of the PPDU comprises a duration field, and wherein a value of the duration field is a sum of the length of the padding data, a short interframe space (SIFS), and a length of the data.

15. A computer program product comprising computer-executable instructions stored on a non-transitory computer-readable storage medium that, when executed by a processor, cause a channel access apparatus to:

determine a backoff duration based on a first contention window, wherein the first contention window represents a first range of time slots during which the station waits before starting to send data;

determine a random padding duration based on a second contention window when the backoff duration is reached, wherein the second contention window represents a second range of time slots during which the station waits before starting to send the data;

send, on a channel, padding data whose duration is the random padding duration;

detect a state of the channel after the padding data is sent;

send the data on the channel when the state of the channel is an idle state; and

when the state of the channel is a busy state:

skip sending the data on the channel;

update the first contention window based on a first update policy wherein the first update policy comprises multiplying the first contention window by a first coefficient; and

update the second contention window based on a second update policy, wherein the second update policy comprises multiplying the second contention window by a second coefficient.

16. The computer program product of claim 15 , wherein the computer-executable instructions, when executed by the processor, cause the channel access apparatus to send a legacy preamble (L-preamble) on the channel.

17. The computer program product of claim 16 , wherein the value of a length indication field in legacy signaling in the L-preamble is a sum of a length of a data packet that carries the L-preamble and a length of the padding data.

18. The computer program product of claim 17 , wherein the data packet is a physical layer protocol data unit (PPDU).

19. The computer program product of claim 18 , wherein a media access control (MAC) header in a data field of the PPDU comprises a duration field.

20. The computer program product of claim 19 , wherein a value of the duration field is a sum of the length of the padding data, a short interframe space (SIFS), and a length of the data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 4, 2022
From: WANG, YING; LI, YUNBO; SHILO, SHIMON; TSODIK, GENADIY; EPSTEIN, LEONID
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 058543/0397 →
Priority Claims (1)
CN 201810764316.6 · Jul 12, 2018 · national
Continuity (2)
Continuation PCTCN2019091921 · Jun 19, 2019
Related Publication 20210136817A1 · May 6, 2021
References Cited (31)
US 6965942B1 · Young et al. · 2005 [cited by applicant]
US 20020188750A1 · Li · 2002 [cited by examiner]
US 20130294394A1 · Kneckt · 2013 [cited by examiner]
US 20140247777A1 · Cariou et al. · 2014 [cited by applicant]
US 20150250002A1 · Sun · 2015 [cited by examiner]
US 20150351128A1 · Kim · 2015 [cited by examiner]
US 20160128024A1 · Frederiks · 2016 [cited by examiner]
US 20160192363A1 · Kasher · 2016 [cited by examiner]
US 20160302226A1 · Kim · 2016 [cited by examiner]
US 20170111931A1 · Damnjanovic et al. · 2017 [cited by applicant]
US 20170127404A1 · Merlin · 2017 [cited by examiner]
US 20170257854A1 · Yerramalli · 2017 [cited by examiner]
US 20170311225A1 · Li et al. · 2017 [cited by applicant]
US 20180084574A1 · Wong · 2018 [cited by examiner]
US 20180110057A1 · Park · 2018 [cited by examiner]
US 20180139781A1 · Park · 2018 [cited by examiner]
US 20180199375A1 · Nezou · 2018 [cited by examiner]
US 20180376418A1 · Li et al. · 2018 [cited by applicant]
US 20190014596A1 · Yang · 2019 [cited by examiner]
US 20190082474A1 · Jung · 2019 [cited by examiner]
US 20190274171A1 · Viger · 2019 [cited by examiner]
US 20190289615A1 · Lee · 2019 [cited by examiner]
US 20190289633A1 · Fang · 2019 [cited by examiner]
US 20200374933A1 · Lou · 2020 [cited by examiner]
US 20210266966A1 · Baron · 2021 [cited by examiner]
CN 103415082A · 2013 [cited by applicant]
CN 103797885A · 2014 [cited by applicant]
CN 104581979A · 2015 [cited by applicant]
CN 104640230A · 2015 [cited by applicant]
CN 107027161A · 2017 [cited by applicant]
Yoon et al., COTA: Channel occupancy time adaptation for LTE in unlicensed spectrum, Mar. 2017, 2017 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), whole document (Year: 2017). [cited by examiner]