IP Library Granted Patent US 12,425,138
Granted Patent B2
US 12,425,138 · App. 18/046,799 · Granted Sep 23, 2025

Methods and devices for managing scheduling service, and storage medium

Inventors: Su-Lin Low (San Diego, CA); Chun-I Lee (San Diego, CA); Tianan Tim Ma (San Diego, CA); Hong Kui Yang (San Diego, CA); Hausting Hong (San Diego, CA)
Assignee: GREATER SHINE LIMITED
H04L1/1854H04W72/21
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,425,138
App. No.
18/046,799
Granted
Sep 23, 2025
Kind
B2
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 (107)

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; 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);

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.

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

3. The method of claim 1 , wherein the scoring function includes the following equation:

Grant_Score=Function( K 2, S,T,P,C,G,I,M ), wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

5. The method of claim 4 , wherein the scoring function includes the following equation:

Grant_Score=[( f 4)( P )+( f 5)( C )−( f 2)( S )−( f 6)( G )−( f 7)( I )−( f 8)( M )]/[( f 1)( K 2)+( f 3)( T )], wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

7. The method of claim 4 , wherein the scoring function includes the following equation:

Grant_Score=[( f 4)( P )+( f 5)( C )−( f 6)( G )−( f 7)( I )−( f 8)( M )]/[( f 1)( K 2)+( f 2)( S )+( f 3)( T )], wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

9. 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; 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);

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.

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

11. The method of claim 9 , wherein the scoring function includes the following equation:

Grant_Score=Function( K 2, S,T,P,C,G,I,M ), wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

13. The method of claim 12 , wherein the scoring function includes the following equation:

Grant_Score=[( f 4)( P )+( f 5)( C )−( f 2)( S )−( f 6)( G )−( f 7)( I )−( f 8)( M )]/[( f 1)( K 2)+( f 3)( T )], wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

15. The method of claim 12 , wherein the scoring function includes the following equation:

Grant_Score=[( f 4)( P )+( f 5)( C )−( f 6)( G )−( f 7)( I )−( f 8)( M )]/[( f 1)( K 2)+( f 2)( S )+( f 3)( T )], wherein,

K2 refers to the latency indicator;

S refers to the start symbol of the slot transmit boundary;

T refers to the PUSCH slot transmission time duration;

P refers to the received power;

C refers to the SCS;

G refers to the grant size;

I refers to the interference level; and

M refers to the spectral efficiency.

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

17. 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; 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);

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.

18. The non-transitory computer-readable storage medium of claim 17 , 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.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2024
From: ZEKU TECHNOLOGY (SHANGHAI) CORP., LTD.
To: GREATER SHINE LIMITED
Reel/Frame 068431/0318 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 28, 2023
From: ZEKU, INC.
To: ZEKU TECHNOLOGY (SHANGHAI) CORP., LTD.
Reel/Frame 064426/0864 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 15, 2022
From: LOW, SU-LIN; LEE, CHUN-I; MA, TIANAN TIM; YANG, HONG KUI; HONG, HAUSTING
To: ZEKU, INC.
Reel/Frame 061435/0139 →
Continuity (3)
Continuation PCTUS2021014937 · Jan 25, 2021
Provisional Application 63009825 · Apr 14, 2020
Related Publication 20230069610A1 · Mar 2, 2023
References Cited (25)
US 8897237B2 · Cui · 2014 [cited by examiner]
US 9131525B2 · Kazmi · 2015 [cited by examiner]
US 10334598B2 · Loehr · 2019 [cited by examiner]
US 20110090806A1 · Ozturk · 2011 [cited by applicant]
US 20120275391A1 · Cui · 2012 [cited by examiner]
US 20120275403A1 · Zhang · 2012 [cited by applicant]
US 20170070965A1 · Marinier · 2017 [cited by examiner]
US 20170188391A1 · Rajagopal et al. · 2017 [cited by applicant]
US 20180310308A1 · Loehr · 2018 [cited by examiner]
US 20190274143A1 · Loehr · 2019 [cited by applicant]
US 20200314928A1 · Kang · 2020 [cited by examiner]
US 20200367246A1 · Loehr · 2020 [cited by examiner]
US 20220346098A1 · Loehr · 2022 [cited by applicant]
CN 102123512A · 2011 [cited by applicant]
EP 2343945A2 · 2017 [cited by examiner]
EP 3764721A1 · 2021 [cited by applicant]
WO 2018075828A1 · 2018 [cited by applicant]
WO 2019185014A1 · 2019 [cited by applicant]
Supplementary European Search Report in the European application No. 21722355.1, mailed on Jul. 4, 2023. 9 pages. [cited by applicant]
Andreozzi et al., “Effective scheduling of real-time traffic in HSUPA”. 2010 European Wireless Conference (EW). doi:10.1109/ew.2010.5483474. [cited by applicant]
International Search Report in the international application No. PCT/US2021/014937, mailed on Apr. 13, 2021. [cited by applicant]
Written Opinion of the International Search Authority in the international application No. PCT/US2021/014937, mailed on Apr. 13, 2021. [cited by applicant]
First Office Action of the European application No. 21722355.1, issued on Jun. 18, 2024. 9 pages. [cited by applicant]
First Office Action of the Chinese application No. 202180028725.X, issued on Feb. 27, 2025. 17 pages with English translation. [cited by applicant]
Second Office Action of the European application No. 21722355.1, issued on Mar. 11, 2025. 9 pages. [cited by applicant]