# US 2017/0290044 A1 · Method for Obtaining Request of Station, Access Point, and Station

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0290044 A1
- Document ID: US20170290044A1
- Status: Published application
- Kind: A1
- Application number: 15/624,791
- Filed: 2017-06-16
- Published: 2017-10-05
- Earliest claimed: 2014-12-18
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Bo Li; Qiao Qu; Yunbo Li
- Web page: https://patentgrep.com/patent/US20170290044A1

## CPC

- H04W 72/1268: of uplink data flows
- H04W 24/02: Arrangements for optimising operational condition
- H04W 74/02: Hybrid access
- H04W 74/006: {in the downlink, i.e. towards the terminal}
- H04W 84/12: WLAN [Wireless Local Area Networks]
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Embodiments of the present invention disclose a method for obtaining a request of a station, an access point, and a station. The method includes sending, by an access point, a control frame to a station and receiving, by the access point, a request to send frame sent by each station according to the control frame. The method also includes performing, by the access point, resource scheduling on each station according to the received request to send frame.

## Claims

### Claim 1

A method, wherein the method comprises:
sending, by an access point to a station, a control frame, wherein the control frame comprises device indication information and allocation information of available channels, wherein the device indication information indicates a to-be-scheduled station of to-be-scheduled stations, and wherein the allocation information comprises information about a used-for-scheduling channel allocated to the to-be-scheduled station and information about a random competition channel allocated to a not-to-be-scheduled station; and
receiving, by the access point, a request to send frame sent by the station after sending the control frame.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising performing, by the access point, resource scheduling on the station according to the request to send frame.

### Claim 3 (depends on 1)

The method according to claim 1, the method further comprises using, by the access point, a portion of sub-channels of at least one idle channel as the used-for-scheduling channel, and using another portion of the sub-channels of the at least one idle channel as the random competition channel, before sending the control frame, wherein the available channels are the at least one idle channel.

### Claim 4 (depends on 1)

The method according to claim 1, the method further comprises using, by the access point, a portion of at least two idle channels as the used-for-scheduling channel, and another portion of the at least two idle channels as the random competition channel, before sending the control frame, wherein the available channels comprise the at least two idle channels.

### Claim 5 (depends on 4)

The method according to claim 4, wherein using the portion of the at least two idle channels as the used-for-scheduling channel and using the another portion of the idle channels as the random competition channel comprises using, by the access point, a preset primary channel as the used-for-scheduling channel, and using at least one secondary channel as the random competition channel, wherein the available channels comprise the preset primary channel and the at least one secondary channel.

### Claim 6 (depends on 1)

The method according to claim 1, the method further comprises using, by the access point, a portion of sub-channels of at least two idle channels as the used-for-scheduling channel, and using another portion of the sub-channels of at least two idle channels as the random competition channel, before sending the control frame, wherein the available channels comprise the at least two idle channels.

### Claim 7

A method, wherein the method comprises:
receiving, by a station from an access point, a control frame, wherein the control frame comprises device indication information and allocation information of available channels, wherein the device indication information indicates a to-be-scheduled station, and wherein the allocation information comprises information about a used-for-scheduling channel allocated to each to-be-scheduled station and information about a random competition channel allocated to a non-to-be-scheduled station;
determining, by the station according to the device indication information, whether the station is the to-be-scheduled station;
determining, by the station, a corresponding used-for-scheduling channel according to the allocation information of the available channels and sending a request to send frame using the used-for-scheduling channel, in response to determining that the station is the to-be-scheduled station; and
selecting, by the station, at least one idle channel or idle sub-channel from the random competition channel according to the allocation information of the available channels and sending a request to send frame using the at least one idle channel or idle sub-channel, in response to determining that the station is not the to-be-scheduled station.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the method further comprises:
determining, by the station, that there is cached data on the station, before determining the to-be-scheduled station, wherein the station is the to-be-scheduled station.

### Claim 9 (depends on 7)

The method according to claim 7, wherein, the method further comprises:
determining, by the station according to the device indication information, that the station is the non-to-be-scheduled station, before selecting the at least one idle channel or idle sub channel from the random competition channel, where the device indication information further indicates the non-to-be-scheduled station, and where the station is not the to-be-scheduled station.

### Claim 10 (depends on 7)

The method according to claim 7, wherein the method further comprises:
starting, by the station, waiting, in response to receiving the control frame; and
sending the request to send frame in response to a waiting duration being equal to a preset duration.

### Claim 11

An access point, wherein the access point comprises:
a processor; and
a non-transitory computer readable storage medium storing a program for execution by the processor, the program including instructions to:
construct a control frame, wherein the control frame comprises device indication information and allocation information of available channels, wherein the device indication information indicates a to-be-scheduled station of to-be-scheduled stations, and wherein the allocation information comprises information about a used-for-scheduling channel allocated to the to-be-scheduled station and information about a random competition channel allocated to a not-to-be-scheduled station; and
send the control frame to a station.

### Claim 12 (depends on 11)

The access point to claim 11, wherein the instructions further comprise instructions to:
receive a request to send frame sent from the station after transmitting the control frame; and
perform resource scheduling on the station according to the request to send frame.

### Claim 13 (depends on 11)

The access point according to claim 11, wherein the instructions further comprise to:
use a portion of sub-channels of one idle channel as the used-for-scheduling channel and use another portion of the sub-channels of the one idle channel as the random competition channel, wherein the available channels are the one idle channel.

### Claim 14 (depends on 11)

The access point according to claim 11, wherein the instructions further comprise instructions to:
use a portion of at least two idle channels as the used-for-scheduling channel and use another portion of the idle channels as the random competition channel, wherein the available channels comprise the at least two idle channels.

### Claim 15 (depends on 11)

The access point according to claim 11, wherein the instructions further comprise instructions to:
use a portion of sub-channels of at least two idle channels as the used-for-scheduling channel and use another portion of the sub-channels of the at least two idle channel as the random competition channel, wherein the available channels comprise the at least two idle channels.

### Claim 16 (depends on 11)

The access point according to claim 11, wherein the information about the random competition channel indicates the random competition channel, and wherein the random competition channel is obtained by removing the used-for-scheduling channel from the available channels.

### Claim 17

A station, wherein the station comprises:
a processor; and
a non-transitory computer readable storage medium storing a program for execution by the processor, the program including instructions to:
receive, from an access point, a control frame, wherein the control frame comprises device indication information and allocation information of available channels, wherein the device indication information indicates a to-be-scheduled station of to-be-scheduled stations, and wherein the allocation information comprises information about a used-for-scheduling channel allocated to the to-be-scheduled station and information about a random competition channel allocated to a non-to-be-scheduled station;
determine, according to device indication information, whether the station is the to-be-scheduled station;
determine a corresponding used-for-scheduling channel according to the allocation information of the available channels, in response to that the station is the to-be-scheduled station; and
select at least one idle channel or idle sub-channel from the random competition channel according to the allocation information of the available channels, in response to determining that the station is a not-to-be-scheduled station.

### Claim 18 (depends on 17)

The station according to claim 17, wherein the instructions further comprise instructions to:
send a request to send frame using the used-for-scheduling channel; and
send a request to send frame using the idle channel or idle sub-channel.

### Claim 19 (depends on 17)

The station according to claim 17, wherein the instructions further comprise instructions to:
detect whether there is cached data on the station, wherein the station is the to-be-scheduled station; and
trigger the processor to determine corresponding used-for-scheduling channel according to the allocation information of the available channels in response to detecting that there cached data on the station.

### Claim 20 (depends on 17)

The station according to claim 17, wherein the instructions further comprise instructions to:
determine, according to the device indication information, whether the station is the not-to-be-scheduled station, wherein the station is a not to-be-scheduled station, and wherein the device indication information further indicates the not-to-be-scheduled station; and
select the at least one idle channel or idle sub-channel from the random competition channel, in response to determining that the station is the not-to-be-scheduled station.
