IP Library › Granted Patent US 11,711,800
Granted Patent B2
US 11,711,800 · App. 17/178,949 · Granted Jul 25, 2023

Enhanced scheduling request handling procedure

Inventors: Matha Deghel (Paris, FR); Dawid Koziol (Wroclaw, PL); Zexian Li (Espoo, FI)
Assignee: Nokia Technologies Oy
H04W72/1268H04W72/02H04W72/569
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 11,711,800
App. No.
17/178,949
Granted
Jul 25, 2023
Kind
B2
Abstract

The present disclosure inter alia relates to an apparatus configured for performing a method, the method comprising: delivering, from a higher layer to a lower layer, an instruction to transmit a scheduling request; and at least partially controlling, by the lower layer, a selection of one or more resources for transmitting the scheduling request.

Claims (46)

1. An apparatus comprising:

at least one processor; and

at least one memory including computer program code, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to:

deliver, from a higher layer to a lower layer, an instruction to transmit a scheduling request, wherein the instruction to transmit the scheduling request specifies one or more resources to be used for transmitting the scheduling request;

determine, by the lower layer, whether the scheduling request overlaps with a higher priority information to be transmitted over the one or more resources specified by the instruction; and

at least partially control, by the lower layer, a selection of one or more resources for transmitting the scheduling request, wherein the lower layer comprises a timer for controlling of the selection of the one or more resources for transmitting the scheduling request,

wherein the timer of the lower layer is defined based on at least a timer of the higher layer and the timer of the lower layer is started based on a determination that the scheduling request overlaps with the higher priority information to be transmitted over the one or more resources specified by the instruction.

2. The apparatus according to claim 1 , wherein one or more of

the higher layer is a data link layer;

the lower layer is a physical layer; or

the one or more resources for transmitting the scheduling request belong to a physical uplink channel.

3. The apparatus according to claim 1 , wherein one or more of

the apparatus is a user equipment or a part thereof; or

the scheduling request is directed to a network node.

4. The apparatus according to claim 1 , wherein the controlling of the selection of the one or more resources for transmitting the scheduling request allows for attempting, by the lower layer, to transmit the scheduling request on more than one resource.

5. The apparatus according to claim 1 , wherein the controlling of the selection of the one or more resources for transmitting the scheduling request comprises postponing or re-attempting, by the lower layer, the transmission of the scheduling request.

6. The apparatus according to claim 1 , wherein the timer of the lower layer is a repetition timer and wherein the controlling of the selection of the one or more resources for transmitting the scheduling request comprises attempting, by the lower layer, to transmit the scheduling request until an expiry of the repetition timer.

7. The apparatus according to claim 6 , wherein the timer of the higher layer is a prohibit timer for temporarily prohibiting re-delivering, from the higher layer to the lower layer, the instruction to transmit the scheduling request.

8. The apparatus according to claim 1 , further caused to:

refraining, by the higher layer, from incrementing a counter for counting the number of times of delivering the instruction for transmission of the scheduling request to the lower layer until it is reported, by the lower layer to the higher layer, that the scheduling request has been transmitted.

9. The apparatus according to claim 1 , further caused to:

in case it is reported, by the lower layer to the higher layer, that the scheduling request has not been transmitted, decrementing, by the higher layer, a counter for counting the number of times of delivering the instruction for transmission of the scheduling request to the lower layer.

10. A method, performed by at least one apparatus, the method comprising:

delivering, from a higher layer to a lower layer, an instruction to transmit a scheduling request, wherein the instruction to transmit the scheduling request specifies one or more resources to be used for transmitting the scheduling request;

determining, by the lower layer, whether the scheduling request overlaps with a higher priority information to be transmitted over the one or more resources specified by the instruction; and

at least partially controlling, by the lower layer, a selection of one or more resources for transmitting the scheduling request, wherein the lower layer comprises a timer for controlling of the selection of the one or more resources for transmitting the scheduling request,

wherein the timer of the lower layer is defined based on at least a timer of the higher layer and the timer of the lower layer is started based on a determination that the scheduling request overlaps with the higher priority information to be transmitted over the one or more resources specified by the instruction.

11. The method according to claim 10 , wherein the scheduling request is a scheduling request for allocating one or more resources for an uplink transmission.

12. The method according to claim 10 , wherein the controlling of the selection of the one or more resources for transmitting the scheduling request allows for attempting, by the lower layer, to transmit the scheduling request on more than one resource.

13. The method according to claim 10 , wherein the timer of the lower layer is a repetition timer and wherein the controlling of the selection of the one or more resources for transmitting the scheduling request comprises attempting, by the lower layer, to transmit the scheduling request until an expiry of the repetition timer.

14. The method according to claim 13 , wherein the timer of the higher layer is a prohibit timer for temporarily prohibiting re-delivering, from the higher layer to the lower layer, the instruction to transmit the scheduling request, and wherein one or more of

the repetition timer of the lower layer is substantially equal to the prohibit timer of the higher layer;

the repetition timer of the lower layer is shorter than the prohibit timer of the higher layer;

the repetition timer of the lower layer starts substantially at the same time as the prohibit timer of the higher layer; or

the repetition timer of the lower layer ends substantially at the same time as the prohibit timer of the higher layer.

15. The method according to claim 10 , further comprising:

refraining, by the higher layer, from incrementing a counter for counting the number of times of delivering the instruction for transmission of the scheduling request to the lower layer until it is reported, by the lower layer to the higher layer, that the scheduling request has been transmitted.

16. The method according to claim 10 , further comprising:

in case it is reported, by the lower layer to the higher layer, that the scheduling request has not been transmitted, decrementing, by the higher layer, a counter for counting the number of times of delivering the instruction for transmission of the scheduling request to the lower layer.

17. A non-transitory memory including a computer program, the computer program when executed by a processor of an apparatus causing said apparatus to:

deliver, from a higher layer to a lower layer, an instruction to transmit a scheduling request, wherein the instruction to transmit the scheduling request specifies one or more resources to be used for transmitting the scheduling request;

determine, by the lower layer, whether the scheduling request overlaps with a higher priority information to be transmitted over the one or more resources specified by the instruction; and

at least partially control, by the lower layer, a selection of one or more resources for transmitting the scheduling request, wherein the lower layer comprises a timer for controlling of the selection of the one or more resources for transmitting the scheduling request,

wherein the timer of the lower layer is defined based on at least a timer of the higher layer and the timer of the lower layer is started based on a determination that the scheduling request overlaps with the higher priority information to be transmitted over the one or more resources specified by the instruction.

18. The non-transitory memory including the computer program according to claim 17 , wherein the timer of the lower layer is a repetition timer and wherein the controlling of the selection of the one or more resources for transmitting the scheduling request comprises attempting, by the lower layer, to transmit the scheduling request until an expiry of the repetition timer.

19. The non-transitory memory including the computer program according to claim 18 , wherein the higher layer comprises a prohibit timer for temporarily prohibiting re-delivering, from the higher layer to the lower layer, the instruction to transmit the scheduling request, and wherein the repetition timer of the lower layer is defined at least based on the prohibit timer of the higher layer.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 16, 2022
From: DEGHEL, MATHA; KOZIOL, DAWID; LI, ZEXIAN
To: NOKIA TECHNOLOGIES OY
Reel/Frame 060224/0872 →
Priority Claims (1)
EP 20158805 · Feb 21, 2020 · regional
Continuity (1)
Related Publication 20210266934A1 · Aug 26, 2021