# US 2023/0069610 A1 · Methods and devices for managing scheduling service, and storage medium

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

- Number: US 2023/0069610 A1
- Document ID: US20230069610A1
- Status: Published application
- Kind: A1
- Application number: 18/046,799
- Filed: 2022-10-14
- Published: 2023-03-02
- Earliest claimed: 2020-04-14
- Assignees: Zeku, Inc.
- Applicants: Zeku, Inc.
- Inventors: Su-Lin LOW; Chun-I LEE; Tianan Tim MA; Hong Kui YANG; Hausting HONG
- Web page: https://patentgrep.com/patent/US20230069610A1

## CPC

- H04L 1/1854: {Scheduling and prioritising arrangements}
- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network
- H04W 72/566: of the information or information source or recipient
- H04W 72/569: {of the traffic information}
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04W 72/1268: of uplink data flows
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Methods for managing a scheduling service includes (i) determining a score for each of multiple service grants from multiple cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the multiple service grants; (ii) prioritizing the multiple service grants based on the determined scores; and (iii) assigning scheduling opportunities to the multiple service grants based on the determined scores of the multiple grant services from the multiple cells in a geometric decreasing manner. In the geometric decreasing manner, packets of a low priority service grant of the multiple service grants are transmitted once every two packets of a high priority service grant of the multiple service grants.

## Claims

### Claim 1

A method for managing a scheduling service, the method comprising:
determining a score for each of multiple service grants based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the multiple service grants;
prioritizing the multiple service grants based on the determined scores; and
assigning scheduling opportunities to the multiple service grants based on the determined scores of the multiple service grants in a geometric decreasing manner,
wherein, in the geometric decreasing manner, packets of a low priority service grant of the multiple service grants are transmitted once every two packets of a high priority service grant of the multiple service grants.

### Claim 2 (depends on 1)

The method of claim 1, wherein the scheduling service is an uplink medium access control (MAC) grant scheduling service.

### Claim 3 (depends on 1)

The method of claim 1, wherein the one or more radio channel conditions of the scoring function includes one or more of:
a latency indicator (K2);
a start symbol (S) of a slot transmit boundary;
a Physical Uplink Shared Channel (PUSCH) slot transmission time duration (T);
a received power (P);
a SubCarrier Spacing (SCS);
a grant size (G);
an interference level (I); or
a spectral efficiency (M).

### Claim 4 (depends on 1)

The method of claim 1, wherein the scoring function includes the following equation:
Grant_Score=Function(K2,S,T,P,C,G,I,M), wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SCS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 5 (depends on 1)

The method of claim 1, wherein each of the one or more radio channel conditions of the scoring function has a weighting factor (f).

### Claim 6 (depends on 5)

The method of claim 5, wherein the scoring function includes the following equation:
Grant_Score=[(f4)(P)+(f5)(C)−(f2)(S)−(f6)(G)−(f7)(I)−(f8)(M)]/[(f1)(K2)+(f3)(T)], wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SCS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 7 (depends on 6)

The method of claim 6, wherein the latency indicator K2 is a slot offset value, and wherein the slot offset value is greater than or equal to 1.

### Claim 8 (depends on 5)

The method of claim 5, wherein the scoring function includes the following equation:
Grant_Score=[(f4)(P)+(f5)(C)−(f6)(G)−(f7)(I)−(f8)(M)]/[(f1)(K2)+(f2)(S)+(f3)(T)], wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SCS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 9 (depends on 8)

The method of claim 8, wherein the latency indicator K2 is a slot offset value, and wherein the slot offset value is less than 1.

### Claim 10

A method for managing a scheduling service, the method comprising:
determining a score for each of multiple service grants from multiple cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the multiple service grants;
determining a low priority service grant and a high priority service grant of the multiple service grants based on the determined scores; and
transmitting packets of a low priority service grant once every two packets of the high priority service grant.

### Claim 11 (depends on 10)

The method of claim 10, wherein the scheduling service is an uplink medium access control (MAC) grant scheduling service.

### Claim 12 (depends on 10)

The method of claim 10, wherein the one or more radio channel conditions of the scoring function includes one or more of:
a latency indicator (K2);
a start symbol (S) of a slot transmit boundary;
a Physical Uplink Shared Channel (PUSCH) slot transmission time duration (T);
a received power (P);
a SubCarrier Spacing (SCS);
a grant size (G);
an interference level (I); or
a spectral efficiency (M).

### Claim 13 (depends on 10)

The method of claim 10, wherein the scoring function includes the following equation:
Grant_Score=Function(K2,S,T,P,C,G,I,M), wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SCS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 14 (depends on 10)

The method of claim 10, wherein each of the one or more radio channel conditions of the scoring function has a weighting factor (f).

### Claim 15 (depends on 14)

The method of claim 14, wherein the scoring function includes the following equation:
Grant_Score=[(f4)(P)+(f5)(C)−(f2)(S)−(f6)(G)−(f7)(I)−(f8)(M)]/[(f1)(K2)+(f3)(T)], wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SOS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 16 (depends on 15)

The method of claim 15, wherein the latency indicator K2 is a slot offset value, and wherein the slot offset value is greater than or equal to 1.

### Claim 17 (depends on 14)

The method of claim 14, wherein the scoring function includes the following equation:
Grant_Score=[(f4)(P)+(f5)(C)−(f6)(G)−(f7)(I)−(f8)(M)]/[(f1)(K2)+(f2)(S)+(f3)(T)], wherein,
K2 refers to a latency indicator;
S refers to a start symbol of a slot transmit boundary;
T refers to a Physical Uplink Shared Channel (PUSCH) slot transmission time duration;
P refers to a received power;
C refers to a SubCarrier Spacing (SOS);
G refers to a grant size;
I refers to an interference level; and
M refers to a spectral efficiency.

### Claim 18 (depends on 17)

The method of claim 17, wherein the latency indicator K2 is a slot offset value, and wherein the slot offset value is less than 1.

### Claim 19

A non-transitory computer-readable storage medium having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to implement the instructions so as to perform a method, the method comprising:
determining a score for each of multiple service grants from multiple cells based on a scoring function, wherein the scoring function includes one or more radio channel conditions associated with the multiple service grants;
prioritizing the multiple service grants based on the determined scores; and
assigning scheduling opportunities to the multiple service grants based on the determined scores of the multiple services grants in a geometric decreasing manner,
wherein, in the geometric decreasing manner, packets of a low priority service grant of the multiple service grants are transmitted intermittently between packets of a high priority service grant of the multiple service grants.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium of claim 19, wherein the packets of the low priority service grant are transmitted once every two packets of the high priority service grant of the multiple service grants.
