Contention-based scheduling request resources

Abstract

Methods, systems, and devices for wireless communication are described. A user equipment (UE) may receive a message indicating a plurality of contention-based resource sets dedicated to sending a scheduling request, wherein each contention-based resource set is associated with one or more respective contention. The one or more respective conditions may be associated with a packet delay threshold, a buffer size threshold, or a probability function. Based on satisfaction of the one or more respective conditions of the contention-based resource set, the UE may send a scheduling request to request uplink resources for the UE using resources of the contention-based resource set. In some examples, a remaining packet delay budget for uplink messages at the UE may satisfy the packet delay threshold for the contention resource set. Thus, the UE may randomly select the resource from the set of contention-based resources for transmitting the scheduling request.

Description

[0001] Cross-references

[0002] This patent application claims priority to U.S. patent application No. 18 / 152,099, entitled “CONTENTION-BASED SCHEDULING REQUEST RESOURCES,” filed by Maamari et al. on January 9, 2023, which is assigned to the assignee of this application and is expressly incorporated herein by reference. Technical Field

[0003] The following relates to wireless communications including contention-based scheduling for requesting resources. Background Art

[0004] Wireless communication systems are widely deployed to provide various types of communication content, such as voice, video, packet data, messaging, broadcast, and the like. These systems may be able to support communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple access systems include fourth generation (4G) systems (such as long term evolution (LTE) systems, advanced LTE (LTE-A) systems, or LTE-A Pro systems) and fifth generation (5G) systems (which may be referred to as new radio (NR) systems). These systems may employ techniques such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-S-OFDM). A wireless multiple access communication system may include one or more base stations, each of which supports wireless communication for communication devices, which may be referred to as user equipment (UE). Summary of the Invention

[0005] The described techniques relate to improved methods, systems, devices, and apparatuses for supporting contention-based scheduling request resources. For example, the described techniques allow a network entity to configure multiple user equipment (UEs) with multiple contention-based resource sets (e.g., shared resource sets) for sending scheduling requests. For example, the network entity may send a message to one or more UEs indicating multiple contention-based resource sets, where each contention-based resource set is associated with one or more corresponding conditions. Accordingly, based on satisfying one or more conditions associated with the contention-based resource set and successful completion of a contention-based process, UEs in the multiple UEs may use resources of the contention-based resource set to send scheduling requests.

[0006] A method for wireless communication at a UE is described. The method may include receiving a message indicating a set of a plurality of contention-based resource sets dedicated for scheduling requests, each contention-based resource set in the set of a plurality of contention-based resource sets being associated with one or more corresponding conditions; and sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of a plurality of contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0007] An apparatus for wireless communication at a UE is described. The apparatus may include: a processor; a memory coupled to the processor; and instructions stored in the memory. The instructions may be executable by the processor to cause the apparatus to: receive a message indicating a set of multiple contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions; and based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set, send a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of multiple contention-based resource sets.

[0008] Another apparatus for wireless communication at a UE is described. The apparatus may include: means for receiving a message indicating a set of a plurality of contention-based resource sets dedicated for scheduling requests, each contention-based resource set in the set of a plurality of contention-based resource sets being associated with one or more corresponding conditions; and means for sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of a plurality of contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0009] A non-transitory computer-readable medium storing code for wireless communication at a UE is described. The code may include instructions executable by a processor to: receive a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests, each of the multiple contention-based resource sets being associated with one or more corresponding conditions; and send a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of multiple contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0010] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for performing the following operations: sending the scheduling request using resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the packet delay threshold.

[0011] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for performing the following operations: sending the scheduling request using resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the first packet delay threshold and less than the second packet delay threshold.

[0012] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for performing the following operations: using resources of the contention-based resource set to send the scheduling request based on the UE's buffer size being greater than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being greater than the buffer size threshold.

[0013] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for performing the following operations: sending the scheduling request using resources of the contention-based resource set based on the UE's buffer size being less than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being less than the buffer size threshold.

[0014] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for performing the following operations: using resources of the contention-based resource set to send the scheduling request based on the UE's buffer size being greater than a first buffer size threshold and less than a second buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being greater than the first buffer size threshold and less than the second buffer size threshold.

[0015] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for receiving an indication of a probability function associated with the group of multiple contention-based resource sets, the probability function being associated with a packet delay time for the UE; and calculating a probability using the probability function and the packet delay time for the UE, wherein sending the scheduling request using resources of the contention-based resource set may satisfy a probability threshold for the contention-based resource set based on the probability.

[0016] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for receiving an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0017] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for receiving a radio resource control (RRC) message indicating the group of multiple contention-based resource sets; and receiving a layer 1 (L1) or layer 2 (L2) signal indicating activation of the group of multiple contention-based resource sets.

[0018] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for sending the scheduling request using a resource of the contention-based resource set based on randomly selecting the resource from the contention-based resource set, wherein a successful contention-based process includes randomly selecting the resource from the contention-based resource set.

[0019] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending a scheduling request may include operations, features, components, or instructions for sending the scheduling request using a cyclic shift that may be mapped to a radio network temporary identifier (RNTI) of the UE.

[0020] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the plurality of contention-based resource sets can be periodic.

[0021] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, each contention-based resource set in the set of the plurality of contention-based resource sets may be associated with a respective logical channel.

[0022] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, uplink resources may be used for uplink messages including virtual reality (XR) uplink messages or ultra-reliable low-latency communication (URLLC) uplink messages.

[0023] A method for wireless communication at a network entity is described. The method may include: sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions; and receiving a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of the one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0024] An apparatus for wireless communication at a network entity is described. The apparatus may include: a processor; a memory coupled to the processor; and instructions stored in the memory. The instructions may be executable by the processor to cause the apparatus to: send a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions; and receive a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of the one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0025] Another apparatus for wireless communication at a network entity is described. The apparatus may include: means for sending a message indicating a set of multiple contention-based resource sets dedicated for scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions; and means for receiving a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of the one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0026] A non-transitory computer-readable medium storing code for wireless communication at a network entity is described. The code may include instructions executable by a processor to: send a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions; and receive a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of the one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0027] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request via resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the packet delay threshold.

[0028] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request via resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the first packet delay threshold and less than the second packet delay threshold.

[0029] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request via resources of the contention-based resource set based on a buffer size of the first UE being greater than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being greater than the buffer size threshold.

[0030] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request via resources of the contention-based resource set based on a buffer size of the first UE being less than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being less than the buffer size threshold.

[0031] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request using resources of the contention-based resource set based on the buffer size of the first UE being greater than a first buffer size threshold and less than a second buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being greater than the first buffer size threshold and less than the second buffer size threshold.

[0032] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for sending an indication of a probability function associated with the group of multiple contention-based resource sets, the probability function being based on a packet delay time for each of the one or more UEs, wherein receiving the scheduling request via resources of the contention-based resource set may be based on a calculated probability of the first UE satisfying a probability threshold for the contention-based resource set.

[0033] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for sending an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0034] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, components, or instructions for sending an RRC message indicating the set of multiple contention-based resource sets; and sending an L1 or L2 signal indicating activation of the set of multiple contention-based resource sets.

[0035] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving the scheduling request based on randomly selecting resources from the contention-based resource set by the first UE via resources of the contention-based resource set, wherein a successful contention-based process includes randomly selecting resources from the contention-based resource set by the first UE.

[0036] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving a scheduling request may include operations, features, components, or instructions for performing the following operations: receiving a scheduling request that may be associated with a cyclic shift that may be mapped to the RNTI of the first UE.

[0037] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the plurality of contention-based resource sets can be periodic.

[0038] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, each contention-based resource set in the set of the plurality of contention-based resource sets may be associated with a respective logical channel.

[0039] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, uplink resources may be used for uplink messages including XR uplink messages or URLLC uplink messages. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 An example of a wireless communication system supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0041] Figure 2 An example of a network architecture supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated.

[0042] Figure 3 An example of a wireless communication system supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0043] Figure 4 An example of a timing diagram supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0044] Figure 5 An example of a process flow for requesting resources in support of contention-based scheduling according to one or more aspects of the present disclosure is illustrated.

[0045] Figure 6 and Figure 7 A block diagram illustrating an apparatus supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated.

[0046] Figure 8 A block diagram illustrating a communication manager supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0047] Figure 9A diagram illustrating a system including a device that supports contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0048] Figure 10 and Figure 11 A block diagram illustrating an apparatus supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated.

[0049] Figure 12 A block diagram illustrating a communication manager supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0050] Figure 13 A diagram illustrating a system including a device that supports contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated.

[0051] Figures 14 to 17 A flow chart illustrating a method of supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. DETAILED DESCRIPTION

[0052] In some wireless communication systems, a user equipment (UE) may send one or more scheduling requests to a network entity to request uplink resources for the UE. To send the scheduling request, the network entity may allocate periodic resources to the UE so that when the UE has an uplink message to send, the UE can use the periodic resources to send the scheduling request to the network entity. In response to receiving the scheduling request, the network entity may send an uplink grant to schedule uplink resources for the UE, and the UE may use these uplink resources to send the uplink message. However, in some cases, if the periodicity of the resources allocated for the scheduling request is higher than a threshold periodicity (e.g., relatively longer than other periodicities of the scheduling request resources), the UE may experience increased delay when sending the scheduling request, thereby further delaying the granting of uplink resources and the sending of the uplink message. In such cases, due to the increased delay, the UE may not be able to meet the latency constraints of the uplink message (e.g., low-latency communication, such as virtual reality (XR) packets or ultra-reliable low-latency communication (URLLC) packets). Alternatively, if the periodicity of the resources allocated for scheduling requests is below a threshold (e.g., relatively shorter compared to other periodicities of the scheduling request resources), the UE may send scheduling requests at a relatively higher frequency, which may result in higher resource usage and overhead, thereby reducing the uplink channel capacity (e.g., due to scheduling requests sent by one or more UEs).

[0053] The techniques described herein can enable a network entity to configure one or more UEs in a wireless communication system with contention-based resources for scheduling requests. For example, a network entity can send multiple contention-based resource sets dedicated to scheduling requests to one or more UEs, wherein each contention-based resource set is associated with one or more corresponding conditions. Thus, when a UE has an uplink message to send, the UE can select a contention-based resource set from multiple contention-based resource sets based on satisfying one or more conditions associated with the contention-based resource set. In some examples, one or more corresponding conditions of the contention-based resource set can be associated with a packet delay threshold. In such examples, the UE can use resources of the contention-based resource set for scheduling requests based on the remaining packet delay budget of the uplink message at the UE satisfying the packet delay threshold (e.g., condition) of the contention-based resource set. In some other examples, one or more corresponding conditions of the contention-based resource set can be associated with a buffer size threshold. In such examples, the UE can use resources of the contention-based resource set based on the UE's buffer size satisfying the buffer size threshold (e.g., condition) of the contention-based resource set. After selecting a contention-based resource set, the UE may (e.g., randomly) select a resource from the contention-based resource set and send a scheduling request to the network entity. In this way, the network entity may allocate contention-based resources to one or more UEs for sending scheduling requests, thereby enabling each UE to access resources in an efficient manner.

[0054] Aspects of the present disclosure are first described in the context of wireless communication systems. Figure 4 and Figure 5 Aspects of the present disclosure are further illustrated and described by and with reference to apparatus diagrams, system diagrams, and flow charts related to contention-based scheduling request resources.

[0055] Figure 1 An example of a wireless communication system 100 supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The wireless communication system 100 may include one or more network entities 105, one or more UEs 115, and a core network 130. In some examples, the wireless communication system 100 may be a Long Term Evolution (LTE) network, an Advanced LTE (LTE-A) network, an LTE-A Pro network, a New Radio (NR) network, or a network operating according to other systems and radio technologies, including future systems and radio technologies not explicitly mentioned herein.

[0056] The network entities 105 may be dispersed throughout a geographic area to form the wireless communication system 100 and may include devices in different forms or with different capabilities. In various examples, the network entities 105 may be referred to as network elements, mobility elements, radio access network (RAN) nodes, or network equipment, among other nomenclature. In some examples, the network entities 105 and the UEs 115 may communicate wirelessly via one or more communication links 125 (e.g., radio frequency (RF) access links). For example, the network entities 105 may support a coverage area 110 (e.g., a geographic coverage area) within which the UEs 115 and the network entities 105 may establish one or more communication links 125. The coverage area 110 may be an example of a geographic area within which the network entities 105 and the UEs 115 may support signal communication according to one or more radio access technologies (RATs).

[0057] The UEs 115 may be dispersed throughout the coverage area 110 of the wireless communication system 100, and each UE 115 may be stationary or mobile or both stationary and mobile at different times. The UEs 115 may be devices that take different forms or have different capabilities. Figure 1 Some example UEs 115 are illustrated in FIG. The UEs 115 described herein may be capable of supporting communications with various types of devices, such as Figure 1 Other UEs 115 or network entities 105 are shown.

[0058] As described herein, a node of the wireless communication system 100 (which may be referred to as a network node or wireless node) may be a network entity 105 (e.g., any network entity described herein), a UE 115 (e.g., any UE described herein), a network controller, an apparatus, a device, a computing system, one or more components, or another suitable processing entity configured to perform any of the techniques described herein. For example, the node may be a UE 115. As another example, the node may be a network entity 105. As another example, a first node may be configured to communicate with a second node or a third node. In one aspect of this example, the first node may be a UE 115, the second node may be a network entity 105, and the third node may be a UE 115. In another aspect of this example, the first node may be a UE 115, the second node may be a network entity 105, and the third node may be a network entity 105. In other aspects of this example, the first node, the second node, and the third node may be different relative to these examples. Similarly, references to UE 115, network entity 105, apparatus, device, computing system, etc. may include disclosure of UE 115, network entity 105, apparatus, device, computing system, etc. as nodes. For example, a disclosure that UE 115 is configured to receive information from network entity 105 also discloses that the first node is configured to receive information from the second node.

[0059] In some examples, network entities 105 can communicate with core network 130, with each other, or both. For example, network entities 105 can communicate with core network 130 via one or more backhaul communication links 120 (e.g., according to S1, N2, N3, or other interface protocols). In some examples, network entities 105 can communicate with each other via backhaul communication links 120 (e.g., according to X2, Xn, or other interface protocols), either directly (e.g., directly between network entities 105) or indirectly (e.g., via core network 130). In some examples, network entities 105 can communicate with each other via midhaul communication links 162 (e.g., according to a midhaul interface protocol) or fronthaul communication links 168 (e.g., according to a fronthaul interface protocol), or any combination thereof. Backhaul communication links 120, midhaul communication links 162, or fronthaul communication links 168 can be or include one or more wired links (e.g., electrical links, fiber optic links), one or more wireless links (e.g., radio links, wireless optical links), etc., or various combinations thereof. UE 115 may communicate with core network 130 via communication link 155 .

[0060] One or more of the network entities 105 described herein may include or may be referred to as a base station 140 (e.g., a base transceiver station, a radio base station, an NR base station, an access point, a radio transceiver, a Node B, an evolved Node B (eNB), a next-generation Node B, or a gigabit Node B (any of which may be referred to as a gNB), a 5G NB, a next-generation eNB (ng-eNB), a Home Node B, a Home evolved Node B, or other suitable terminology). In some examples, the network entity 105 (e.g., a base station 140) may be implemented in a converged (e.g., monolithic, stand-alone) base station architecture that may be configured to utilize a protocol stack that is physically or logically integrated within a single network entity 105 (e.g., a single RAN node, such as the base station 140).

[0061] In some examples, the network entity 105 can be implemented in a disaggregated architecture (e.g., a disaggregated base station architecture, a disaggregated RAN architecture) that can be configured to utilize a protocol stack that is physically or logically distributed between two or more network entities 105, such as an integrated access backhaul (IAB) network, an open RAN (O-RAN) (e.g., a network configuration sponsored by the O-RAN Alliance), or a virtualized RAN (vRAN) (e.g., a cloud RAN (C-RAN)). For example, the network entity 105 can include one or more of the following: a central unit (CU) 160, a distributed unit (DU) 165, a radio unit (RU) 170, a RAN intelligent controller (RIC) 175 (e.g., a near real-time RIC (near RT RIC), a non-real-time RIC (non-RT RIC)), a service management and orchestration (SMO) 180 system, or any combination thereof. The RU 170 may also be referred to as a radio head, smart radio head, remote radio head (RRH), remote radio unit (RRU), or transmit receive point (TRP). One or more components of the network entity 105 in the disaggregated RAN architecture may be co-located, or one or more components of the network entity 105 may be located in distributed locations (e.g., separate physical locations). In some examples, one or more network entities 105 of the disaggregated RAN architecture may be implemented as virtual units (e.g., virtual CU (VCU), virtual DU (VDU), virtual RU (VRU)).

[0062] The functional split between CU 160, DU 165, and RU 170 is flexible and can support different functionalities depending on which functions (e.g., network layer functions, protocol layer functions, baseband functions, RF functions, and any combination thereof) are performed at CU 160, DU 165, or RU 170. For example, a functional split of the protocol stack can be employed between CU 160 and DU 165 such that CU 160 can support one or more layers of the protocol stack and DU 165 can support one or more different layers of the protocol stack. In some examples, CU 160 can host higher protocol layer (e.g., Layer 3 (L3), Layer 2 (L2)) functionality and signaling (e.g., Radio Resource Control (RRC), Service Data Adaptation Protocol (SDAP), Packet Data Convergence Protocol (PDCP)). The CU 160 may be connected to one or more DUs 165 or RUs 170, and the one or more DUs 165 or RUs 170 may host lower protocol layers, such as Layer 1 (L1) (e.g., physical (PHY) layer) or L2 (e.g., radio link control (RLC) layer, medium access control (MAC) layer) functionality and signaling, and may each be at least partially controlled by the CU 160. Additionally or alternatively, a functional split of the protocol stack may be employed between the DUs 165 and RUs 170, such that the DUs 165 may support one or more layers of the protocol stack and the RUs 170 may support one or more different layers of the protocol stack. The DUs 165 may support one or more different cells (e.g., via the one or more RUs 170). In some cases, the functional split between the CU 160 and the DU 165 or between the DU 165 and the RU 170 may be within the protocol layer (e.g., some functions of the protocol layer may be performed by one of the CU 160, DU 165, or RU 170, while other functions of the protocol layer may be performed by a different one of the CU 160, DU 165, or RU 170). The CU 160 may be further functionally split into CU control plane (CU-CP) and CU user plane (CU-UP) functions. The CU 160 may be connected to one or more DUs 165 via midhaul communication links 162 (e.g., F1, F1-c, F1-u), and the DU 165 may be connected to one or more RUs 170 via fronthaul communication links 168 (e.g., an open fronthaul (FH) interface). In some examples, midhaul communication link 162 or fronthaul communication link 168 may be implemented according to an interface (e.g., a channel) between layers of a protocol stack supported by respective network entities 105 that communicate via such communication links.

[0063] In some wireless communication systems (e.g., wireless communication system 100), the infrastructure and spectrum resources used for radio access may support wireless backhaul link capabilities to supplement wired backhaul connections, thereby providing an IAB network architecture (e.g., to core network 130). In some cases, in an IAB network, one or more network entities 105 (e.g., IAB nodes 104) may be partially controlled by each other. One or more IAB nodes 104 may be referred to as a donor entity or IAB donor. One or more DUs 165 or one or more RUs 170 may be partially controlled by one or more CUs 160 associated with a donor network entity 105 (e.g., donor base station 140). One or more donor network entities 105 (e.g., IAB donors) may communicate with one or more additional network entities 105 (e.g., IAB nodes 104) via supported access and backhaul links (e.g., backhaul communication link 120). The IAB node 104 may include an IAB mobile terminal (IAB-MT) controlled (e.g., scheduled) by the DU 165 of the coupled IAB donor. The IAB-MT may include an independent set of antennas for relaying communications with the UE 115, or may share the same antennas of the IAB node 104 (e.g., of the RU 170) for access via the DU 165 of the IAB node 104 (e.g., referred to as a virtual IAB-MT (vIAB-MT)). In some examples, the IAB node 104 may include a DU 165 that supports communication links with additional entities (e.g., IAB node 104, UE 115) within a relay chain or configuration (e.g., downstream) of the access network. In such cases, one or more components of the decomposed RAN architecture (e.g., one or more IAB nodes 104 or components of the IAB node 104) may be configured to operate according to the techniques described herein.

[0064] Where the techniques described herein are applied in the context of a disaggregated RAN architecture, one or more components of the disaggregated RAN architecture may be configured to support contention-based scheduling request resources as described herein. For example, some operations described as being performed by a UE 115 or a network entity 105 (e.g., a base station 140) may additionally or alternatively be performed by one or more components of the disaggregated RAN architecture (e.g., an IAB node 104, a DU 165, a CU 160, a RU 170, a RIC 175, a SMO 180).

[0065] UE 115 may include or may be referred to as a mobile device, a wireless device, a remote device, a handheld device, or a subscriber device, or some other suitable terminology, where "device" may also be referred to as a unit, a station, a terminal, or a client, etc. UE 115 may also include or may be referred to as a personal electronic device, such as a cellular phone, a personal digital assistant (PDA), a tablet computer, a laptop computer, or a personal computer. In some examples, UE 115 may include or may be referred to as a wireless local loop (WLL) station, an Internet of Things (IoT) device, an Internet of Everything (IoE) device, or a machine type communication (MTC) device, etc., which may be implemented in various objects, such as appliances or vehicles, meters, etc.

[0066] The UE 115 described herein may be capable of communicating with various types of devices, such as other UEs 115, which may sometimes act as relays, as well as network entities 105 and network equipment including macro eNBs or gNBs, small cell eNBs or gNBs, or relay base stations, etc. Figure 1 shown.

[0067] The UE 115 and the network entity 105 may wirelessly communicate with each other via one or more communication links 125 (e.g., access links) using resources associated with one or more carriers. The term "carrier" may refer to a set of RF spectrum resources having a physical layer structure defined for supporting the communication link 125. For example, a carrier used for the communication link 125 may include a portion of an RF spectrum band (e.g., a bandwidth part (BWP)) that operates according to one or more physical layer channels for a given radio access technology (e.g., LTE, LTE-A, LTE-A Pro, NR). Each physical layer channel may carry acquisition signaling (e.g., synchronization signals, system information), control signaling for coordinating carrier operations, user data, or other signaling. The wireless communication system 100 may support communications with the UE 115 using carrier aggregation or multi-carrier operation. Depending on the carrier aggregation configuration, the UE 115 may be configured with multiple downlink component carriers and one or more uplink component carriers. Carrier aggregation may be used for both frequency division duplex (FDD) and time division duplex (TDD) component carriers. Communication between the network entity 105 and other devices may refer to communication between those devices and any portion (e.g., entity, sub-entity) of the network entity 105. For example, the terms "send," "receive," or "communicate" when referring to the network entity 105 may refer to any portion of the network entity 105 (e.g., base station 140, CU 160, DU 165, RU 170) of the RAN communicating with another device (e.g., directly or via one or more other network entities 105).

[0068] The signal waveform transmitted via the carrier may include multiple subcarriers (e.g., using a multicarrier modulation (MCM) technique such as orthogonal frequency division multiplexing (OFDM) or discrete Fourier transform spread OFDM (DFT-S-OFDM)). In a system employing MCM techniques, a resource element may refer to the resource of one symbol period (e.g., the duration of one modulation symbol) and one subcarrier, in which case the symbol period and subcarrier spacing may be inversely related. The number of bits carried by each resource element may depend on the modulation scheme (e.g., the order of the modulation scheme, the coding rate of the modulation scheme, or both), such that a relatively high number of resource elements (e.g., in the transmission duration) and a relatively high order modulation scheme may correspond to relatively high rate communications. Wireless communication resources may refer to a combination of RF spectrum resources, time resources, and spatial resources (e.g., spatial layers or beams), and the use of multiple spatial resources may increase the data rate or data integrity used for communications with UE 115.

[0069] The time interval for the network entity 105 or the UE 115 can be expressed as a multiple of a basic time unit, which can be, for example, a sampling period T s =1 / (Δf max ·N f ) seconds, for which Δf max It can represent the supported subcarrier spacing, and N f The supported discrete Fourier transform (DFT) size may be indicated. Time intervals of communication resources may be organized according to radio frames, each having a specified duration (e.g., 10 milliseconds (ms)). Each radio frame may be identified by a system frame number (SFN) (e.g., ranging from 0 to 1023).

[0070] Each frame may include a plurality of consecutively numbered subframes or time slots, and each subframe or time slot may have the same duration. In some examples, a frame may be divided (e.g., in the time domain) into subframes, and each subframe may be further divided into a certain number of time slots. Alternatively, each frame may include a variable number of time slots, and the number of time slots may depend on the subcarrier spacing. Each time slot may include a certain number of symbol periods (e.g., depending on the length of the cyclic prefix appended to the front of each symbol period). In some wireless communication systems 100, the time slot may be further divided into a plurality of mini-time slots associated with one or more symbols. Excluding the cyclic prefix, each symbol period may be associated with one or more (e.g., N f The duration of a symbol period may depend on the subcarrier spacing or the operating frequency band.

[0071] A subframe, slot, mini-slot, or symbol may be the smallest scheduling unit (e.g., in the time domain) of the wireless communication system 100 and may be referred to as a Transmit Time Interval (TTI). In some examples, the TTI duration (e.g., the number of symbol periods in a TTI) may be variable. Additionally or alternatively, the smallest scheduling unit of the wireless communication system 100 may be dynamically selected (e.g., in bursts of shortened TTIs (sTTIs)).

[0072] Physical channels may be multiplexed using carriers for communication according to various techniques. Physical control channels and physical data channels may be multiplexed for signaling via downlink carriers, for example, using one or more of time division multiplexing (TDM), frequency division multiplexing (FDM), or hybrid TDM-FDM techniques. A control region (e.g., a control resource set (CORESET)) of a physical control channel may be defined by a set of symbol periods and may extend across the system bandwidth of a carrier or a subset of that bandwidth. One or more control regions (e.g., CORESETs) may be configured for a group of UEs 115. For example, one or more of UEs 115 may monitor or search the control region for control information according to one or more search space sets, and each search space set may include one or more control channel candidates in one or more aggregation levels arranged in a cascaded manner. The aggregation level of a control channel candidate may refer to the amount of control channel resources (e.g., control channel elements (CCEs)) associated with coded information for a control information format having a given payload size. The search space sets may include a common search space set configured for transmitting control information to multiple UEs 115 , and a UE-specific search space set for transmitting control information to a specific UE 115 .

[0073] In some examples, network entities 105 (e.g., base stations 140, RUs 170) can be mobile and, therefore, provide communication coverage for mobile coverage areas 110. In some examples, different coverage areas 110 associated with different technologies can overlap, but the different coverage areas 110 can be supported by the same network entity 105. In some other examples, overlapping coverage areas 110 associated with different technologies can be supported by different network entities 105. The wireless communication system 100 can include, for example, a heterogeneous network in which different types of network entities 105 provide coverage for various coverage areas 110 using the same or different radio access technologies.

[0074] The wireless communication system 100 may be configured to support ultra-reliable communication or low-latency communication or various combinations thereof. For example, the wireless communication system 100 may be configured to support ultra-reliable low-latency communication (URLLC). The UE 115 may be designed to support ultra-reliable, low-latency or critical functionality. Ultra-reliable communication may include private or group communication and may be supported by one or more services such as push-to-talk, video or data. Support for ultra-reliable, low-latency functionality may include prioritization of services, and such services may be used for public safety or general commercial applications. The terms ultra-reliable, low-latency and ultra-reliable low-latency may be used interchangeably herein.

[0075] In some examples, a UE 115 can be configured to support communication directly with other UEs 115 via a device-to-device (D2D) communication link 135 (e.g., according to a peer-to-peer (P2P), D2D, or sidelink protocol). In some examples, one or more UEs 115 in a group performing D2D communication can be within a coverage area 110 of a network entity 105 (e.g., a base station 140, a RU 170), which can support aspects of such D2D communication configured (e.g., scheduled) by the network entity 105. In some examples, one or more UEs 115 in such a group can be outside the coverage area 110 of the network entity 105 or can otherwise be unable or not configured to receive transmissions from the network entity 105. In some examples, a group of UEs 115 communicating via D2D communication can support a one-to-many (1:M) system, in which each UE 115 transmits to each of the other UEs 115 in the group. In some examples, network entity 105 may facilitate scheduling of resources for D2D communications. In some other examples, D2D communications may be performed between UEs 115 without involving network entity 105.

[0076] The core network 130 may provide user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions. The core network 130 may be an evolved packet core (EPC) or a 5G core (5GC), which may include at least one control plane entity (e.g., a mobility management entity (MME), an access and mobility management function (AMF)) for managing access and mobility and at least one user plane entity (e.g., a serving gateway (S-GW), a packet data network (PDN) gateway (P-GW), or a user plane function (UPF)) for routing packets or interconnecting to external networks. The control plane entity may manage non-access stratum (NAS) functions such as mobility, authentication, and bearer management for UEs 115 served by network entities 105 (e.g., base stations 140) associated with the core network 130. User IP packets may be delivered through the user plane entity, which may provide IP address allocation and other functions. The user plane entity may be connected to the IP services 150 of one or more network operators. IP services 150 may include access to the Internet, an intranet, an IP Multimedia Subsystem (IMS), or packet-switched streaming services.

[0077] The wireless communication system 100 can operate using one or more frequency bands that can range from 300 megahertz (MHz) to 300 gigahertz (GHz). Generally speaking, the region from 300 MHz to 3 GHz is referred to as the ultra-high frequency (UHF) region or decimeter band because the wavelengths range from about one decimeter to one meter in length. UHF waves can be blocked or redirected by buildings and environmental features (which can be referred to as clusters), but these waves can penetrate structures sufficiently for a macro cell to provide service to a UE 115 located indoors. Communication using UHF waves can be associated with smaller antennas and a shorter range (e.g., less than 100 kilometers) than communication using the lower frequencies and longer waves in the high frequency (HF) or very high frequency (VHF) portions of the spectrum below 300 MHz.

[0078] The wireless communication system 100 can utilize both licensed RF spectrum bands and unlicensed RF spectrum bands. For example, the wireless communication system 100 can use unlicensed bands (such as the 5 GHz Industrial, Scientific, and Medical (ISM) band) to employ license assisted access (LAA), LTE unlicensed (LTE-U) radio access technology, or NR technology. When operating using unlicensed RF spectrum bands, devices such as the network entity 105 and the UE 115 can employ carrier sensing for conflict detection and avoidance. In some examples, operations using unlicensed bands can be based on carrier aggregation configuration (e.g., LAA) in combination with component carriers operating using licensed bands. Operations using unlicensed spectrum can include downlink transmissions, uplink transmissions, P2P transmissions, or D2D transmissions, among others.

[0079] A network entity 105 (e.g., a base station 140, a RU 170) or a UE 115 may be equipped with multiple antennas that can be used to employ techniques such as transmit diversity, receive diversity, multiple-input, multiple-output (MIMO) communications, or beamforming. The antennas of the network entity 105 or UE 115 may be located within one or more antenna arrays or antenna panels, which may support MIMO operations or transmit or receive beamforming. For example, one or more base station antennas or antenna arrays may be co-located at an antenna assembly (such as an antenna tower). In some examples, the antennas or antenna arrays associated with the network entity 105 may be located at different geographical locations. The network entity 105 may include an antenna array having a set of multiple rows and columns of antenna ports that the network entity 105 can use to support beamforming for communications with the UE 115. Similarly, the UE 115 may include one or more antenna arrays that may support various MIMO or beamforming operations. Additionally or alternatively, the antenna panels may support RF beamforming for signals transmitted via the antenna ports.

[0080] Beamforming (which may also be referred to as spatial filtering, directional transmission, or directional reception) is a signal processing technique that can be used at a transmitting device or a receiving device (e.g., a network entity 105, a UE 115) to shape or steer an antenna beam (e.g., a transmit beam, a receive beam) along a spatial path between the transmitting device and the receiving device. Beamforming can be achieved by combining signals communicated via antenna elements of an antenna array so that some signals propagating along a particular direction relative to the antenna array experience constructive interference, while other signals experience destructive interference. Adjustments to signals communicated via antenna elements can include the transmitting device or the receiving device applying an amplitude offset, a phase offset, or both to signals carried via antenna elements associated with the device. The adjustments associated with each of these antenna elements can be defined by a set of beamforming weights associated with a particular orientation (e.g., relative to the antenna array of the transmitting device or the receiving device or relative to some other orientation).

[0081] In some examples of the wireless communication system 100, the UE 115 can send a scheduling request via a first physical uplink control channel (PUCCH) format (e.g., PUCCH format 1) to request uplink resources for an uplink message.

[0082] In some examples of the wireless communication system 100, the UE 115 and the network entity 105 may perform XR, mixed reality (MR), virtual reality (VR), or other low-latency types of communications (e.g., via one or more XR streams). Such XR communications may have frequent uplink packets and a strict delay budget (e.g., to enhance the XR experience at the UE 115). In such cases, the UE 115 may send multiple scheduling requests to the network entity in order to send the XR uplink packets. However, if the periodicity of the scheduling request transmissions is too large, the latency incurred by the scheduling request transmissions may be relatively high. For example, if the period during which the UE 115 can use the scheduling request resources is relatively long (e.g., above a threshold), the UE 115 may have to wait to send the scheduling request, thereby delaying the XR uplink transmission (e.g., and there is a risk of not meeting the strict delay budget for the XR packets). Alternatively, a relatively shorter scheduling request periodicity (e.g., below a threshold value, which may be different from a threshold value for a longer period) may reduce uplink channel capacity due to an increase in uplink channel resource reservations by UEs sending scheduling requests, receiving grants of uplink resources, or both, and other factors. For example, if the period during which a UE 115 can use scheduling request resources is relatively small, the UE 115 may continuously send scheduling requests (e.g., due to frequent XR uplink packets), thereby reducing uplink channel capacity for other UEs 115 in the network.

[0083] The techniques described herein propose a contention-based scheduling request design to allow for reuse of scheduling request resources across multiple UEs 115. Accordingly, a UE 115 may perform random uplink channel resource reservation to send a scheduling request. To avoid collisions and false detections at the network entity 105 (e.g., due to multiple UEs 115 using the same contention-based resource set), the network entity 105 may configure one or more conditions for each corresponding contention-based resource set such that a UE 115 in the plurality of UEs 115 may use resources of the contention-based resource set, thereby randomizing the UEs 115.

[0084] For example, the network entity 105 may send multiple contention-based resource sets dedicated to scheduling requests to multiple UEs 115, wherein each contention-based resource set is associated with one or more corresponding conditions. Thus, when a UE 115 has an uplink message to send, the UE 115 may select a contention-based resource set from the multiple contention-based resource sets based on satisfying one or more conditions associated with the contention-based resource set. In some examples, the one or more corresponding conditions of the contention-based resource set may be associated with a packet delay threshold. In such examples, the UE 115 may use resources of the contention-based resource set for the scheduling request based on the remaining packet delay budget of the uplink message at the UE 115 satisfying the packet delay threshold of the contention-based resource set. In some other examples, the one or more corresponding conditions of the contention-based resource set may be associated with a buffer size threshold. In such examples, the UE 115 may use resources of the contention-based resource set based on the buffer size of the UE 115 satisfying the buffer size threshold of the contention-based resource set. After selecting the contention-based resource set, the UE 115 may randomly select a resource from the contention-based resource set and send a scheduling request to the network entity 105. In this manner, the network entity 105 may allocate contention-based resources to one or more UEs 115 for sending scheduling requests, thereby enabling each UE 115 to access resources in a timely and efficient manner.

[0085] Figure 2 An example of a network architecture 200 (e.g., a disaggregated base station architecture, a disaggregated RAN architecture) supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The network architecture 200 may illustrate an example for implementing one or more aspects of the wireless communication system 100. The network architecture 200 may include one or more CUs 160-a that may communicate directly with a core network 130-a via a backhaul communication link 120-a, or indirectly with the core network 130-a via one or more disaggregated network entities 105 (e.g., a near-RT RIC 175-b via an E2 link or a non-RT RIC 175-a associated with an SMO 180-a (e.g., an SMO framework), or both). The CU 160-a may communicate with one or more DUs 165-a via corresponding midhaul communication links 162-a (e.g., an F1 interface). The DU 165-a may communicate with one or more RUs 170-a via corresponding fronthaul communication links 168-a. A RU 170-a may be associated with a corresponding coverage area 110-a and may communicate with a UE 115-a via one or more communication links 125-a. In some implementations, a UE 115-a may be simultaneously served by multiple RUs 170-a.

[0086] Each of the network entities 105 of the network architecture 200 (e.g., CU 160-a, DU 165-a, RU 170-a, non-RT RIC 175-a, near-RT RIC 175-b, SMO 180-a, open cloud (O-Cloud) 205, open eNB (O-eNB) 210) may include one or more interfaces or may be coupled to one or more interfaces configured to receive or transmit signals (e.g., data, information) via a wired or wireless transmission medium. Each network entity 105 or an associated processor (e.g., a controller) that provides instructions to an interface of the network entity 105 may be configured to communicate with one or more of the other network entities 105 via the transmission medium. For example, these network entities 105 may include a wired interface configured to receive signals on the wired transmission medium or to transmit signals to one or more of the other network entities 105 on the wired transmission medium. Additionally or alternatively, the network entity 105 may include a wireless interface, which may include a receiver, transmitter, or transceiver (e.g., an RF transceiver) configured to receive signals on a wireless transmission medium, or to transmit signals on a wireless transmission medium to one or more of the other network entities 105, or both.

[0087] In some examples, CU 160-a may host one or more higher layer control functions. Such control functions may include RRC, PDCP, SDAP, etc. Each control function may be implemented using an interface configured to communicate signals with other control functions hosted by CU 160-a. CU 160-a may be configured to handle user plane functionality (e.g., CU-UP), control plane functionality (e.g., CU-CP), or a combination thereof. In some examples, CU 160-a may be logically split into one or more CU-UP units and one or more CU-CP units. When implemented in an O-RAN configuration, the CU-UP unit may communicate bidirectionally with the CU-CP unit via an interface (such as an E1 interface). As needed, CU 160-a may be implemented to communicate with DU 165-a for network control and signaling.

[0088] DU 165-a may correspond to a logical unit that includes one or more functions (e.g., base station functions, RAN functions) for controlling the operation of one or more RUs 170-a. In some examples, DU 165-a may at least partially host one or more of the RLC layer, the MAC layer, and one or more aspects of the PHY layer (e.g., high PHY layers, such as modules for FEC encoding and decoding, scrambling, modulation and demodulation, etc.), depending at least in part on functional partitioning, such as those defined by the Third Generation Partnership Project (3GPP). In some examples, DU 165-a may also host one or more low PHY layers. Each layer may be implemented using an interface that is configured to communicate signals with other layers hosted by DU 165-a or with control functions hosted by CU 160-a.

[0089] In some examples, lower layer functionality may be implemented by one or more RUs 170-a. For example, a RU 170-a controlled by a DU 165-a may correspond to a logical node that hosts RF processing functions or low PHY layer functions (e.g., performing Fast Fourier Transform (FFT), Inverse FFT (iFFT), digital beamforming, Physical Random Access Channel (PRACH) extraction and filtering, etc.), or both, based at least in part on a functional split (such as a lower layer functional split). In such an architecture, the RU 170-a may be implemented to handle over-the-air (OTA) communications with one or more UEs 115-a. In some implementations, real-time and non-real-time aspects of control plane and user plane communications with the RU 170-a may be controlled by the corresponding DU 165-a. In some examples, such a configuration may enable the DU 165-a and CU 160-a to be implemented in a cloud-based RAN architecture (such as a vRAN architecture).

[0090] The SMO 180-a can be configured to support RAN deployment and provisioning of non-virtualized and virtualized network entities 105. For non-virtualized network entities 105, the SMO 180-a can be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which can be managed via an operations and maintenance interface (e.g., an O1 interface). For virtualized network entities 105, the SMO 180-a can be configured to interact with a cloud computing platform (e.g., O-Cloud 205) via a cloud computing platform interface (e.g., an O2 interface) to perform network entity lifecycle management (e.g., to instantiate virtualized network entities 105). Such virtualized network entities 105 can include, but are not limited to, CU 160-a, DU 165-a, RU 170-a, and near-RT RIC 175-b. In some implementations, the SMO 180-a can communicate with components configured according to a 4G RAN (e.g., via the O1 interface). Additionally or alternatively, in some implementations, the SMO 180-a may communicate directly with one or more RUs 170-a via an 01 interface.The SMO 180-a may also include a non-RT RIC 175-a configured to support the functionality of the SMO 180-a.

[0091] The non-RT RIC 175-a may be configured to include logic that enables non-real-time control and optimization of RAN elements and resources, artificial intelligence (AI) or machine learning (ML) workflows (including model training and updating, or policy-based guidance of applications / features in the near-RT RIC 175-b). The non-RT RIC 175-a may be coupled to or in communication with the near-RT RIC 175-b (e.g., via an A1 interface). The near-RT RIC 175-b may be configured to include logic that enables near-real-time control and optimization of RAN elements and resources via data collection and actions over an interface connecting one or more CUs 160-a, one or more DUs 165-a, or both, and the O-eNB 210 with the near-RT RIC 175-b (e.g., via an E2 interface).

[0092] In some examples, non-RT RIC 175-a may receive parameters or external enrichment information from an external server to generate an AI / ML model to be deployed in near-RT RIC 175-b. This information may be utilized by near-RT RIC 175-b and may be received at SMO 180-a or non-RT RIC 175-a from a non-network data source or from a network function. In some examples, non-RT RIC 175-a or near-RT RIC 175-b may be configured to tune RAN behavior or performance. For example, non-RT RIC 175-a may monitor long-term trends and patterns in performance and employ AI or ML models to perform corrective actions through SMO 180-a (e.g., via reconfiguration of O1) or via generation of RAN management policies (such as A1 policies).

[0093] The techniques described herein may enable a group of UEs 115-a (e.g., one or more UEs 115-a in the same service area 110) to use multiple contention-based resource sets to send scheduling requests to a network entity 105. For example, one or more UEs 115-a may receive RRC signaling from a CU 160-a indicating multiple contention-based resource sets, where each contention-based resource set is associated with one or more corresponding conditions. Additionally, one or more UEs 115-a may receive L1 or L2 signaling from a DU 168-a activating the contention-based resource sets (e.g., enabling the one or more UEs 115-a to send scheduling requests using resources of the contention-based resource sets).

[0094] In some examples, a UE 115-a among the one or more UEs 115-a may use resources of a contention-based resource set in a plurality of contention-based resource sets based on satisfaction of one or more corresponding conditions associated with the contention-based resource set. In one example, in order to use the resources of the contention-based resource set, the UE 115-a may have a remaining packet delay budget (e.g., packet delay) that satisfies a packet delay threshold of the contention-based resource set. In another example, in order to use the contention-based resource set, the UE 115-a may have a buffer size (e.g., an amount of data to be sent at the UE 115-a) that satisfies a buffer size threshold associated with the contention-based resource set. Based on selecting the contention-based resource set, the UE 115-a may perform a contention-based process to randomly select resources from the contention-based resource set. Based on successfully completing the contention-based process, the UE 115-a may send a scheduling request to the network entity 105 using the resources of the contention-based resource set.

[0095] Figure 3An example of a wireless communication system 300 supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The wireless communication system 300 may implement reference Figure 1 and Figure 2 Aspects of the wireless communication system 100 of the present invention may be implemented by or may be implemented by aspects of the wireless communication system. For example, the wireless communication system 300 may include a network entity 105-a, a UE 115-b, and a UE 115-c, which may be examples of corresponding network entities and UEs described herein.

[0096] In some cases of wireless communication system 300, UE 115 may transmit one or more uplink messages to network entity 105-a. To send the uplink messages, UE 115 may send a scheduling request 305 requesting resources for the uplink messages. In response to scheduling request 305, network entity 105-a may allocate resources to UE 115 for sending the uplink messages. In some cases, UE 115 may use periodic resources to send scheduling request 305. For example, network entity 105-a may indicate to UE 115-b first resources having a first periodicity, such that UE 115-b may use the first resources to send scheduling request 305-a according to the first periodicity. Similarly, network entity 105-a may allocate second resources having a second periodicity to UE 115-c, such that UE 115-c may use the second resources to send scheduling request 305-b according to the second periodicity.

[0097] The periodicity (e.g., optimal periodicity) for each scheduling request resource set or configured (e.g., by network entity 105-a or other network node) may depend on the traffic at UE 115-b and UE 115-c. However, such information may not be available to network entity 105-a at the time of resource allocation. Thus, if network entity 105-a indicates a relatively large scheduling request periodicity, UE 115 may be unable to send uplink messages in a timely manner (e.g., due to the large delay resulting from the large scheduling request periodicity). Alternatively, if network entity 105-b indicates a relatively small periodicity, UE 115 may send scheduling requests 305 more frequently, thereby reducing (e.g., by using additional resources) the channel capacity of the uplink channel.

[0098] In some implementations of the wireless communication system 300, the network entity 105-a may configure contention-based resource sets 315 (e.g., uplink channel resources) that may be commonly used and selected by the UEs 115 (e.g., randomly or via satisfaction of one or more conditions). For example, the network entity 105-a may send a message 310 to the UEs 115-b and 115-c indicating several contention-based resource sets 315 (e.g., such as resource set 315-a, resource set 315-b, resource set 315-c, and resource set 315-d). Such contention-based resource sets 315 may be shared by the UEs 115-b and 115-c for sending scheduling requests 305. Thus, when the UE 115 sends the scheduling request 305, the UE 115 may select one of the contention-based resource sets 315 based on satisfaction of one or more corresponding conditions associated with the contention-based resource sets 315. Based on selecting the contention-based resource set 315 , the UE 115 may randomly select a resource in the contention-based resource set 315 for sending the scheduling request 305 .

[0099] In addition, the network entity 105-a can configure the UE 115 to randomly reuse contention-based resource sets 315 (e.g., scheduling request resources) based on one or more corresponding conditions for each resource set being satisfied. The conditions associated with each contention-based resource set 315 can be based on a packet delay of uplink messages at the UE 115 or a buffer size of the UE 115. In addition, each contention-based resource set 315 can be configured for the same logical channel (e.g., a logical control channel or a logical traffic channel), wherein each contention-based resource set 315 can correspond to a different generated packet delay. Thus, based on receiving a scheduling request 305 from a particular contention-based resource set 315, the network entity 105-b can have an indication of which uplink messages to prioritize (e.g., prioritize for scheduling). That is, the network entity 105 - a may infer from the resources used to receive the scheduling request 305 which UEs 115 may have more uplink data to send (eg, because the UE 115 uses resources in the contention-based resource set 315 based on satisfying an associated condition).

[0100] In some examples, network entity 105-a may define contention-based resource sets 315 (e.g., regions) based on the size of a buffer status report at UE 115, a logical channel group of an uplink message at UE 115, a buffer status associated with a particular logical channel group, or a remaining packet delay budget (e.g., such as a packet delay time) associated with an uplink message at UE 115, so that each UE 115 determines a probability (e.g., a scheduling request opportunity) of utilizing resources in the contention-based resource set 315. Thus, a UE 115 with a relatively large amount of data in the buffer or with a relatively smaller remaining packet delay budget (e.g., with a large packet delay) may have a higher probability of using the contention-based resource set 315 and may subsequently use the resources in the contention-based resource set 315 more quickly.

[0101] In some examples, network entity 105-a can configure one or more conditions of resource set 315-a to be based on a buffer status threshold and specific to a first logical channel. Thus, in the event that UE 115 has a buffer status report size greater than a buffer status reporting threshold and the uplink message is intended for a specific logical channel, UE 115 can use resources in resource set 315-a (e.g., if UE 115's buffer status report > buffer status threshold and the uplink message is for the X logical channel, UE 115 can use PUCCH resources in resource set 315-a). Similarly, network entity 105-a can configure one or more conditions of resource set 315-b to be based on a buffer status threshold and specific to a second logical channel. Thus, in a scenario where the size of the buffer status report at UE 115 is less than the buffer status threshold and the uplink message of UE 115 is intended for a second logical channel, UE 115 may use resources in resource set 315-b (e.g., if the buffer status report of UE 115 is < the buffer status threshold and the uplink message is for the Y logical channel, UE 115 may use PUCCH resources in resource set 315-b).

[0102] In addition, the network entity 105-a may configure one or more conditions associated with the resource set 315-c to be based on two buffer status report thresholds. Thus, in a case where the size of the buffer status report at the UE 115 is less than the first buffer status threshold and greater than the second buffer status threshold, the UE 115 may use the resources in the resource set 315-c (e.g., if threshold 2 < buffer status report of the UE < threshold 1, the UE 115 may use the PUCCH resources in the resource set 315-c). Similarly, if the latency experienced at each UE 115 is compared with a threshold (e.g., packet latency threshold) and the threshold is satisfied (e.g., packet latency threshold), the network entity 105-a may indicate that one or more resource sets 315 (e.g., regions of PUCCH resources) among multiple contention-based resource sets 315 may be used.

[0103] That is, the network entity 105-a may configure a combination of conditions for the resource set 315-a (e.g., a combination of resource sets 315 having a packet latency threshold condition or a buffer status threshold condition). For example, the network entity 105-a may configure one or more conditions for the resource set 315-a to be based on a packet latency threshold such that if the remaining packet latency budget of the UE 115 (e.g., the packet latency further described herein Figure 3 is greater than the packet latency threshold of the resource set 315-a, the UE 115 may use the PUCCH resources in the resource set 315-a (e.g., remaining packet latency budget > packet latency threshold). Similarly, the network entity 105-a may configure one or more conditions associated with the resource set 315-b to be based on a first packet latency threshold and a second packet latency threshold such that if the remaining packet latency budget of the UE 115 is greater than the first packet latency threshold and less than the second packet latency threshold, the UE 115 may use the PUCCH resources in the resource set 315-b (e.g., threshold 1 < remaining packet latency budget < threshold 2).

[0104] In such an example, the network entity 105-a may configure one or more conditions associated with resource set 315-c to be based on a buffer status threshold, such that if the size of the buffer status report of UE 115 is less than the buffer status threshold, then UE 115 may use the PUCCH resources in resource set 315-c (e.g., buffer status report < threshold). Similarly, the network entity 105-a may configure one or more conditions associated with resource set 315-d to be based on a buffer status threshold, such that if the buffer status report of UE 115 is greater than the buffer status threshold, then UE 115 may use the PUCCH resources in resource set 315-d (e.g., buffer status report > threshold). In this manner, the network entity 105-a may configure a combination of conditions for corresponding contention-based resource sets 315 (e.g., corresponding PUCCH regions or resources). Furthermore, by configuring region-based conditions (e.g., resource set-based conditions), the network entity 105-a may infer (e.g., implicitly learn) the uplink delay and buffer status report of each UE 115 before each UE 115 sends the corresponding buffer status report.

[0105] In some examples, the network entity 105-a may configure one or more conditions associated with each contention-based resource set 315 based on a probability function. For example, to avoid collisions and false detections at the network entity 105-a, the network entity 105-a may configure the UE 115 with a probability function, where the probability function is a function of the remaining packet delay budget or a function of T_wait, which may be the time that the packet has been buffered at the MAC layer of the UE. In some cases, in addition to the time that the packet has been buffered at the MAC layer of the UE, the time T_wait may also include the time from when the packet arrives at the PDCP layer of the UE to when the packet arrives at the MAC layer (e.g., received from the PDCP layer via the RLC layer at the MAC layer), which may be referred to herein as Figure 3 Further description.

[0106] For example, the UE 115 may be configured with a probability based on a probability function and a remaining packet delay budget T_wait, or both, or may determine a probability based on a probability function and a remaining packet delay budget T_wait, or both. In some examples, the UE 115 may compare the probability to a corresponding probability threshold associated with each resource set 315. If the calculated probability satisfies the corresponding probability threshold, the UE 115 may use the PUCCH resources in the resource set 315.

[0107] In another example, if the remaining packet delay budget or T_wait of the uplink message at UE 115 is greater than the packet delay threshold (e.g., T_wait > T1), the calculated probability of UE 115 can be equal to 1, which indicates that as long as the corresponding conditions of the resource set are met, UE 115 has a 100% probability of being able to select any resource set. If the remaining packet delay budget or T_wait of the uplink message at UE 115 is less than the packet delay threshold (e.g., T_wait < T1), the calculated probability of UE 115 can be equal to 0, which indicates that as long as the corresponding conditions of the resource set are met, UE 115 has a 0% probability of being able to select any resource set. In this case, because T_wait is below the threshold, UE 115 may not select a resource set, at least until T_wait exceeds the threshold and the probability of UE 115 changes. Additionally, if the remaining packet delay budget or T_wait of the uplink message at UE 115 is greater than a second packet delay threshold (e.g., T_wait < T2), the calculated probability of UE 115 can be between 0 and 1 (e.g., 0.5). If the probability is 0.5, UE 115 can have a 50% probability of being able to select a resource set as long as the corresponding conditions of the resource set are met. In such examples, compared to a UE 115 with a T_wait below the threshold of T2 or T1, a UE 115 with a T_wait exceeding the threshold of T1 is given a higher priority (based on the probability function) to use or select a resource set. Different T1 and T2 thresholds can be configured for different resource sets or associated with different resource sets, and in some cases, the T1 and T2 thresholds can be part of the conditions for a given resource set. This can provide flexibility for different resource sets and different UEs with different T_wait values or remaining packet delay budget values, such that not all UEs are granted unrestricted access to the selection of any resource set if the corresponding conditions are met. Such techniques can reduce conflicts and prioritize UEs with packets having a higher T_wait time, which may help meet the latency objectives of certain packets.

[0108] In some examples, the network entity 105-a may configure the contention-based resource sets 315 via control signaling 320. For example, the network entity 105-a may send an indication of each resource set 315 via higher layer signaling (e.g., such as RRC signaling). In such examples, the network entity 105-a may indicate one or more conditions associated with each contention-based resource set 315 via control signaling 320. In addition, the network entity 105-a may activate use of the contention-based resource sets 315 or configure T1 and T2 thresholds for the contention-based resource sets 315 via L1 or L2 signaling. That is, the network entity 105-a may send RRC signaling to the UE 115 indicating the corresponding resource sets 315 and the conditions associated with each resource set 315. The network entity 105-a may send L1 or L2 signaling to activate use of the contention-based resource sets 315 or the T1 and T2 thresholds for the resource sets.

[0109] After selecting the contention-based resource set 315, the UE 115 may perform a contention-based procedure (e.g., channel assessment (CCA), listen-before-talk (LBT)) to select a resource from the selected contention-based resource set 315. For example, the UE 115-b may satisfy one or more conditions associated with the resource set 315-a. As a result, the UE 115-b may randomly select a resource from the resource set 315-a with a successful contention-based procedure to transmit the scheduling request 305-a.

[0110] In some examples, UE 115-b may transmit a scheduling request 305-a via a first PUCCH format (e.g., PUCCH format 1). In some other examples, one or more PUCCH formats may be utilized by multiple UEs 115 (e.g., UE 115). In the first PUCCH format, UE 115 may include a cyclic shift to distinguish HARQ-ACK bits from data bits. In order for network entity 105-a to identify multiple scheduling request transmissions from multiple UEs 115 via a resource or resource set 315, UE 115 may transmit scheduling requests according to different cyclic shifts, such that the cyclic shift of scheduling request 305-a is different from the cyclic shift of scheduling request 305-b. In such examples, each transmitted cyclic shift may be mapped to a cell radio network temporary identifier (C-RNTI) of UE 115. In this manner, the network entity 105 - a may receive each scheduling request, identify which UE 115 sent the scheduling request, and provide a corresponding uplink grant encoded using the C-RNTI to each UE 115 .

[0111] Figure 4An example of a timing diagram 400 supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. Aspects of the timing diagram 400 may implement or be implemented by aspects of the wireless communication system 100, the network architecture 200, and the wireless communication system 300. For example, the timing diagram may be associated with the UE 115 and the network entity 105, which may be referenced herein. Figures 1 to 3 Examples of the corresponding devices described.

[0112] Timing diagram 400 may illustrate the transmission and reception of uplink packets between UE 115 and network entity 105. To facilitate such communication, UE 115 and network entity 105 may utilize one or more protocol layers, such as a PDCP layer, an RLC layer, and a MAC layer. For example, the PDCP layer of UE 115 may receive a service data unit (SDU) (e.g., uplink data to be transmitted), wherein the PDCP layer of UE 115 may generate a PDCP packet data unit (PDU) based on the received SDU (e.g., adding one or more additional headers to the SDU packet). The PDCP layer may transmit the PDCP PDU to the RLC layer, wherein the RLC layer may generate an RLC PDU. The MAC layer may receive the RLC PDU and generate a MAC control element (MAC-CE). Based on the generated MAC-CE, UE 115 may send the MAC-CE to network entity 105, wherein the network entity 105 may decode the MAC-CE at the MAC layer to obtain an RLC PDU. The RLC layer of network entity 105 may receive and decode the RLC PDU to obtain a PDCP PDU. The PDCP layer of the network entity 105 may receive and decode the PDCP PDU to obtain the SDU (eg, uplink data).

[0113] In such communications, the network entity 105 and the UE 115 may experience uplink delay 405. The uplink delay 405 (e.g., at the air interface of the network entity 105) may be decomposed into air time 410 (e.g., T_Air) and packet delay 415 (e.g., T_wait). That is, the uplink delay 405 may be the air time 410 experienced at the network entity 105 plus the packet delay 415 experienced at the UE 115 (e.g., UplinkDelay = T_Air + T_wait).

[0114] The packet delay 415 (e.g., the remaining packet delay budget) may represent the waiting time between the arrival time 425 (e.g., T_Arrival) of the SDU and the transmit time 420 (e.g., T_First) of the MAC-CE of the packet containing the SDU. For example, when the SDU arrives at the PDCP queue, the UE 115 may store the arrival time 425 in a memory. Thus, when the UE 115 transmits the first MAC PDU containing data from the received SDU at the transmit time 420, the UE 115 may calculate the packet delay 415 of the SDU as the difference between the transmit time 420 and the arrival time 425 (e.g., T_wait=T_First−T_Arrival).

[0115] The air time 410 may represent the time difference between a first reception time 430 (e.g., even if unsuccessful) of a first MAC PDU containing a MAC-CE or a buffer status report for an SDU and a last reception time 435 of a last MAC PDU containing data from the SDU that was successfully received. For example, the network entity 105 may receive a first MAC PDU containing a first subset of data from the SDU and store the first reception time 430. The network entity 105 may continue to receive MAC PDUs containing data from the SDU. Based on receiving a final MAC PDU containing data from the SDU, the network entity 105 may calculate the air time 410 as the difference between the first reception time 430 of the first MAC PDU and the last reception time 435 of the last MAC PDU (e.g., T_Air = first reception time 430 - last reception time 435).

[0116] However, in some examples, the packet delay 415 may be unknown at the network entity 105, which may prohibit the network entity 105 from calculating the packet delay 415 for the uplink packets at the UE 115. Therefore, if the UE 115 is experiencing a relatively large packet delay 415, the uplink delay 405 experienced in the communication system may increase.

[0117] The packet delay 415 may be an example of a remaining packet delay budget as described herein. In addition, the network entity 105 may configure one or more contentions associated with each contention-based resource set in a plurality of contention-based resource sets with a packet delay threshold, wherein the packet delay threshold may be compared to the packet delay 415 of the UE 115 (e.g., the remaining packet delay budget). Thus, if the packet delay 415 of the UE 115 has a packet delay 415 that satisfies one or more packet delay thresholds of the contention-based resource set, the UE 115 may randomly select a resource from the contention-based resource set. The UE 115 may use the selected resource to send a scheduling request to the network entity 105. In this way, the UE 115 may be able to receive uplink resources for XR or URLLC uplink transmissions in a timely manner. In addition, the network entity 105 may be able to infer the value of the packet delay 415 experienced at the UE 115 based on the resource selected from the contention-based resource set.

[0118] Figure 5 An example of a process flow 500 for supporting contention-based scheduling request resources in accordance with one or more aspects of the present disclosure is illustrated. Aspects of the process flow 500 may implement or be implemented by aspects of the wireless communication system 100, the network architecture 200, the wireless communication system 300, and the timing diagram 400. For example, the process flow 500 may include the network entity 105-b, the UE 115-d, and the UE 115-c, which may be referenced herein. Figures 1 to 4 Examples of corresponding devices are described. In the following description of process flow 500, operations may be performed in a different order than shown. Certain operations may also be excluded from process flow 500, or other operations may be added to process flow 500. In addition, although some operations or signaling are shown as occurring at different times for discussion purposes, these operations may actually occur simultaneously.

[0119] At 505, network entity 105-b may send a message to UE 115-e and UE 115-d indicating a plurality of contention-based resource sets dedicated for scheduling requests, wherein each of the plurality of contention-based resource sets is associated with one or more corresponding conditions. In some examples, the contention-based resource sets may be periodic resource sets. Furthermore, the contention-based resource sets may be used to send scheduling requests associated with XR uplink communications, URLLC communications, or both.

[0120] At 510, network entity 105-b may optionally send control signaling to UE 115-e and UE 115-d. The control signaling may be RRC signaling indicating a plurality of contention-based resource sets and one or more corresponding conditions associated with each contention-based resource set. Additionally, the control signaling may be an example of L1 or L2 signaling activating use of the plurality of contention-based resource sets. In some examples, network entity 105-a may send an indication of a probability function associated with a remaining packet delay budget at UE 115 via the control signaling.

[0121] At 515-a, UE 115-e may determine to use a first contention-based resource set from among a plurality of contention-based resource sets for sending a scheduling request. For example, UE 115-e may compare a remaining packet delay budget for an uplink message with one or more packet delay thresholds of the first contention-based resource set, and may use the contention-based resource set based on the remaining packet delay budget satisfying one or more packet delay thresholds associated with the contention-based resource set from among the plurality of contention-based resource sets. In another example, UE 115-e may compare a size of a buffer status reporting threshold with one or more buffer status thresholds of the first contention-based resource set, and may use the first contention-based resource set based on satisfying the one or more buffer status thresholds. In some other examples, UE 115-e may calculate a probability using an indicated probability function and the remaining packet delay budget, and compare the calculated probability with one or more probability thresholds. Thus, UE 115-e may use resources of the first contention-based resource set based on the calculated probability satisfying the associated probability threshold of the first contention-based resource set. In some other examples, UE 115-e may determine to use the first contention-based resource set based on an uplink message at UE 115-e being associated with a logical channel that satisfies the logical channel condition of the first contention-based resource set. At 515-b, UE 115-d may perform a determination similar to that of UE 115-e.

[0122] At 520-a, in response to determining the first contention-based resource set, UE 115-e may perform a contention-based process. For example, UE 115-c may randomly select a resource from the first contention-based resource set. Similarly, at 520-b, UE 115-d may randomly select a resource from the determined contention-based resource set.

[0123] At 525, the UE 115-e may send a scheduling request to request uplink resources for an uplink message (e.g., an XR or URLLC uplink message) using the randomly selected resources. In such an example, the UE 115-e may send the scheduling request using a cyclic shift mapped to the C-RNTI of the UE 115-e.

[0124] At 530, UE 115-d may send a scheduling request using the randomly selected resources to request uplink resources for an uplink message (e.g., an XR or URLLC uplink message). In such an example, UE 115-d may send the scheduling request using a cyclic shift mapped to the C-RNTI of UE 115-e.

[0125] Figure 6 A block diagram 600 illustrates a device 605 that supports contention-based scheduling request resources according to one or more aspects of the present disclosure. The device 605 can be an example of aspects of the UE 115 as described herein. The device 605 can include a receiver 610, a transmitter 615, and a communication manager 620. The device 605 can also include a processor. Each of these components can communicate with each other (e.g., via one or more buses).

[0126] The receiver 610 may provide means for receiving information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., control channels related to contention-based scheduling request resources, data channels, information channels). The information may be passed to other components of the device 605. The receiver 610 may utilize a single antenna or a set of multiple antennas.

[0127] The transmitter 615 may provide means for transmitting signals generated by other components of the device 605. For example, the transmitter 615 may transmit information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., control channels related to contention-based scheduling request resources, data channels, information channels). In some examples, the transmitter 615 may be co-located with the receiver 610 in a transceiver module. The transmitter 615 may utilize a single antenna or a set of multiple antennas.

[0128] The communication manager 620, the receiver 610, the transmitter 615, or various combinations thereof, or various components thereof, may be examples of means for performing various aspects of contention-based scheduling request resources as described herein. For example, the communication manager 620, the receiver 610, the transmitter 615, or various combinations thereof, or components thereof, may support methods for performing one or more of the functions described herein.

[0129] In some examples, the communication manager 620, the receiver 610, the transmitter 615, or various combinations or components thereof may be implemented in hardware (e.g., in a communication management circuit). The hardware may include a processor, a digital signal processor (DSP), a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a microcontroller, discrete gate or transistor logic, discrete hardware components, or any combination thereof that is configured as or otherwise supports components for performing the functions described herein. In some examples, a processor and a memory coupled to the processor may be configured to perform one or more of the functions described herein (e.g., by executing instructions stored in the memory by the processor).

[0130] Additionally or alternatively, in some examples, the communication manager 620, receiver 610, transmitter 615, or various combinations or components thereof may be implemented in code executed by a processor (e.g., as communication management software or firmware). If implemented in code executed by a processor, the functionality of the communication manager 620, receiver 610, transmitter 615, or various combinations or components thereof may be performed by a general-purpose processor (e.g., configured as or otherwise supporting components for performing the functions described herein), a DSP, a CPU, an ASIC, an FPGA, a microcontroller, or any combination of these or other programmable logic devices.

[0131] In some examples, communication manager 620 can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise cooperating with receiver 610, transmitter 615, or both. For example, communication manager 620 can receive information from receiver 610, transmit information to transmitter 615, or be integrated with receiver 610, transmitter 615, or both to obtain information, output information, or perform various other operations as described herein.

[0132] According to examples disclosed herein, the communication manager 620 can support wireless communications at a UE. For example, the communication manager 620 can be configured to or otherwise support means for receiving a message indicating a set of multiple contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The communication manager 620 can be configured to or otherwise support means for sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of multiple contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0133] By including or configuring a communication manager 620 according to examples as described herein, the device 605 (e.g., a processor controlling the receiver 610, the transmitter 615, the communication manager 620, or a combination thereof or otherwise coupled thereto) can support techniques for using contention-based resource sets for sending scheduling requests, which can be a more efficient use of communication resources.

[0134] Figure 7 A block diagram 700 illustrates a device 705 that supports contention-based scheduling request resources according to one or more aspects of the present disclosure. The device 705 can be an example of aspects of the device 605 or UE 115 as described herein. The device 705 can include a receiver 710, a transmitter 715, and a communication manager 720. The device 705 can also include a processor. Each of these components can communicate with each other (e.g., via one or more buses).

[0135] The receiver 710 may provide means for receiving information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., control channels, data channels, information channels related to contention-based scheduling request resources). The information may be delivered to other components of the device 705. The receiver 710 may utilize a single antenna or a set of multiple antennas.

[0136] The transmitter 715 may provide means for transmitting signals generated by other components of the device 705. For example, the transmitter 715 may transmit information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., control channels related to contention-based scheduling request resources, data channels, information channels). In some examples, the transmitter 715 may be co-located with the receiver 710 in a transceiver module. The transmitter 715 may utilize a single antenna or a set of multiple antennas.

[0137] Device 705 or its various components may be examples of components for performing various aspects of contention-based scheduling and requesting resources as described herein. For example, communication manager 720 may include resource component 725, scheduling request component 730, or any combination thereof. Communication manager 720 may be an example of aspects of communication manager 620 as described herein. In some examples, communication manager 720 or its various components may be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise coordinating with receiver 710, transmitter 715, or both. For example, communication manager 720 may receive information from receiver 710, transmit information to transmitter 715, or be integrated with receiver 710, transmitter 715, or both to obtain information, output information, or perform various other operations as described herein.

[0138] According to examples disclosed herein, a communication manager 720 can support wireless communications at a UE. A resource component 725 can be configured to or otherwise support means for receiving a message indicating a set of a plurality of contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of a plurality of contention-based resource sets being associated with one or more corresponding conditions. A scheduling request component 730 can be configured to or otherwise support means for sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of a plurality of contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0139] Figure 8 Block diagram 800 illustrates a communication manager 820 that supports contention-based scheduling request resources in accordance with one or more aspects of the present disclosure. Communication manager 820 can be an example of aspects of communication manager 620, communication manager 720, or both as described herein. Communication manager 820 or its various components can be examples of means for performing various aspects of contention-based scheduling request resources as described herein. For example, communication manager 820 can include a resource component 825, a scheduling request component 830, a probability component 835, a computation component 840, a communication component 845, an RRC signaling component 850, an L1 and L2 signaling component 855, a resource selection component 860, a cyclic shift component 865, or any combination thereof. Each of these components can communicate with each other directly or indirectly (e.g., via one or more buses).

[0140] According to examples disclosed herein, a communication manager 820 can support wireless communications at a UE. A resource component 825 can be configured to or otherwise support means for receiving a message indicating a set of a plurality of contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of a plurality of contention-based resource sets being associated with one or more corresponding conditions. A scheduling request component 830 can be configured to or otherwise support means for sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of a plurality of contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0141] In some examples, to support sending a scheduling request, the scheduling request component 830 may be configured as or otherwise support a component for sending the scheduling request using resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the packet delay threshold.

[0142] In some examples, to support sending a scheduling request, the scheduling request component 830 may be configured as or otherwise support a component for sending the scheduling request using resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the first packet delay threshold and less than the second packet delay threshold.

[0143] In some examples, to support sending a scheduling request, the scheduling request component 830 may be configured as or otherwise support a component for sending the scheduling request using resources of the contention-based resource set based on the UE's buffer size being greater than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being greater than the buffer size threshold.

[0144] In some examples, to support sending a scheduling request, the scheduling request component 830 may be configured as or otherwise support a component for sending the scheduling request using resources of the contention-based resource set based on the UE's buffer size being less than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being less than the buffer size threshold.

[0145] In some examples, to support sending a scheduling request, the scheduling request component 830 may be configured as or otherwise support a component for sending the scheduling request using resources of the contention-based resource set based on the UE's buffer size being greater than a first buffer size threshold and less than a second buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being greater than the first buffer size threshold and less than the second buffer size threshold.

[0146] In some examples, probability component 835 can be configured to or otherwise support means for receiving an indication of a probability function associated with the plurality of contention-based resource sets, the probability function being associated with the packet delay time of the UE. In some examples, calculation component 840 can be configured to or otherwise support means for calculating a probability using the probability function and the packet delay time of the UE, wherein sending the scheduling request using the resources of the contention-based resource set satisfies a probability threshold for the contention-based resource set based on the probability.

[0147] In some examples, communication component 845 may be configured or otherwise support means for receiving an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0148] In some examples, RRC signaling component 850 can be configured or otherwise support means for receiving an RRC message indicating the set of multiple contention-based resource sets. In some examples, L1 and L2 signaling component 855 can be configured or otherwise support means for receiving an L1 or L2 signal indicating activation of the set of multiple contention-based resource sets.

[0149] In some examples, to support sending a scheduling request, resource selection component 860 may be configured as or otherwise support a component for sending the scheduling request using a resource of the contention-based resource set based on randomly selecting the resource from the contention-based resource set, wherein a successful contention-based process includes randomly selecting the resource from the contention-based resource set.

[0150] In some examples, to support sending a scheduling request, the cyclic shift component 865 may be configured or otherwise support means for sending a scheduling request using a cyclic shift mapped to a radio network temporary identifier of the UE.

[0151] In some examples, the set of multiple contention-based resource sets is periodic.

[0152] In some examples, each contention-based resource set in the set of multiple contention-based resource sets is associated with a corresponding logical channel.

[0153] In some examples, the uplink resources are used for uplink messages including XR uplink messages or ultra-reliable low-latency communication uplink messages.

[0154] Figure 9A diagram illustrating a system 900 including a device 905 supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is shown. The device 905 can be an example of a device 605, a device 705, or a UE 115 as described herein, or include components thereof. The device 905 can communicate (e.g., wirelessly) with one or more network entities 105, one or more UEs 115, or any combination thereof. The device 905 can include components for two-way voice and data communication, including components for sending and receiving communications, such as a communication manager 920, an input / output (I / O) controller 910, a transceiver 915, an antenna 925, a memory 930, code 935, and a processor 940. These components can be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., a bus 945).

[0155] I / O controller 910 can manage input and output signals for device 905. I / O controller 910 can also manage peripheral devices that are not integrated into device 905. In some cases, I / O controller 910 can represent a physical connection or port to an external peripheral device. In some cases, I / O controller 910 can utilize an operating system, such as or another known operating system. Additionally or alternatively, I / O controller 910 may represent or interact with a modem, keyboard, mouse, touch screen, or similar device. In some cases, I / O controller 910 may be implemented as part of a processor, such as processor 940. In some cases, a user may interact with device 905 via I / O controller 910 or via hardware components controlled by I / O controller 910.

[0156] In some cases, the device 905 may include a single antenna 925. However, in some other cases, the device 905 may have more than one antenna 925, which may be capable of concurrently transmitting or receiving multiple wireless transmissions. The transceiver 915 may communicate bidirectionally via one or more antennas 925, a wired or wireless link, as described herein. For example, the transceiver 915 may represent a wireless transceiver and may communicate bidirectionally with another wireless transceiver. The transceiver 915 may also include a modem for modulating packets; providing the modulated packets to one or more antennas 925 for transmission; and demodulating packets received from the one or more antennas 925. The transceiver 915, or the transceiver 915 and one or more antennas 925, may be examples of the transmitter 615, the transmitter 715, the receiver 610, the receiver 710, or any combination thereof, or components thereof, as described herein.

[0157] The memory 930 may include random access memory (RAM) and read-only memory (ROM). The memory 930 may store computer-readable, computer-executable code 935 including instructions that, when executed by the processor 940, cause the device 905 to perform the various functions described herein. The code 935 may be stored in a non-transitory computer-readable medium such as system memory or another type of memory. In some cases, the code 935 may not be directly executable by the processor 940, but may (e.g., when compiled and executed) cause the computer to perform the functions described herein. In some cases, the memory 930 may also contain, among other things, a basic I / O system (BIOS), which may control basic hardware or software operations, such as interaction with peripheral components or devices.

[0158] The processor 940 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, a microcontroller, an ASIC, an FPGA, a programmable logic device, a discrete gate or transistor logic component, a discrete hardware component, or any combination thereof). In some cases, the processor 940 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 940. The processor 940 may be configured to execute computer-readable instructions stored in a memory (e.g., a memory 930) to cause the device 905 to perform various functions (e.g., functions or tasks that support contention-based scheduling request resources). For example, the device 905 or a component of the device 905 may include a processor 940 and a memory 930 coupled to or coupled to the processor 940, the processor 940 and the memory 930 being configured to perform the various functions described herein.

[0159] According to examples disclosed herein, the communication manager 920 can support wireless communications at a UE. For example, the communication manager 920 can be configured to or otherwise support means for receiving a message indicating a set of multiple contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The communication manager 920 can be configured to or otherwise support means for sending a scheduling request to request uplink resources for the UE using resources of a contention-based resource set in the set of multiple contention-based resource sets based on satisfaction of the one or more corresponding conditions for the contention-based resource set and based on a successful contention-based procedure for the contention-based resource set.

[0160] By including or configuring a communication manager 920 according to examples as described herein, the device 905 can support techniques for using contention-based resource sets for sending scheduling requests, which can reduce latency and be a more efficient use of communication resources.

[0161] In some examples, the communication manager 920 can be configured to use or otherwise cooperate with the transceiver 915, one or more antennas 925, or any combination thereof to perform various operations (e.g., receive, monitor, transmit). Although the communication manager 920 is illustrated as a separate component, in some examples, one or more functions described with reference to the communication manager 920 can be supported or performed by the processor 940, the memory 930, the code 935, or any combination thereof. For example, the code 935 can include instructions executable by the processor 940 to cause the device 905 to perform various aspects of contention-based scheduling request resources as described herein, or the processor 940 and the memory 930 can be otherwise configured to perform or support such operations.

[0162] Figure 10 A block diagram 1000 illustrates a device 1005 that supports contention-based scheduling of request resources according to one or more aspects of the present disclosure. The device 1005 can be an example of aspects of the network entity 105 as described herein. The device 1005 can include a receiver 1010, a transmitter 1015, and a communication manager 1020. The device 1005 can also include a processor. Each of these components can communicate with each other (e.g., via one or more buses).

[0163] Receiver 1010 may provide means for obtaining (e.g., receiving, determining, identifying) information associated with various channels (e.g., control channels, data channels, information channels, channels associated with a protocol stack), such as user data, control information, or any combination thereof (e.g., I / Q samples, symbols, packets, protocol data units, service data units). The information may be passed to other components of device 1005. In some examples, receiver 1010 may support obtaining information by receiving signals via one or more antennas. Additionally or alternatively, receiver 1010 may support obtaining information by receiving signals via one or more wired (e.g., electrical, optical) interfaces, wireless interfaces, or any combination thereof.

[0164] The transmitter 1015 may provide means for outputting (e.g., transmitting, providing, conveying, transmitting) information generated by other components of the device 1005. For example, the transmitter 1015 may output information associated with various channels (e.g., control channels, data channels, information channels, channels associated with a protocol stack), such as user data, control information, or any combination thereof (e.g., I / Q samples, symbols, packets, protocol data units, service data units). In some examples, the transmitter 1015 may support outputting information by transmitting signals via one or more antennas. Additionally or alternatively, the transmitter 1015 may support outputting information by transmitting signals via one or more wired (e.g., electrical, optical) interfaces, wireless interfaces, or any combination thereof. In some examples, the transmitter 1015 and the receiver 1010 may be co-located in a transceiver, which may include or be coupled to a modem.

[0165] The communication manager 1020, the receiver 1010, the transmitter 1015, or various combinations thereof, or various components thereof, may be examples of means for performing various aspects of contention-based scheduling request resources as described herein. For example, the communication manager 1020, the receiver 1010, the transmitter 1015, or various combinations thereof, or components thereof, may support methods for performing one or more of the functions described herein.

[0166] In some examples, the communication manager 1020, the receiver 1010, the transmitter 1015, or various combinations or components thereof can be implemented in hardware (e.g., in a communication management circuit). The hardware can include a processor, a DSP, a CPU, an ASIC, an FPGA or other programmable logic device, a microcontroller, discrete gate or transistor logic, discrete hardware components, or any combination thereof that is configured as or otherwise supports components for performing the functions described herein. In some examples, a processor and a memory coupled to the processor can be configured to perform one or more of the functions described herein (e.g., by executing instructions stored in the memory by the processor).

[0167] Additionally or alternatively, in some examples, the communication manager 1020, the receiver 1010, the transmitter 1015, or various combinations or components thereof may be implemented in code executed by a processor (e.g., as communication management software or firmware). If implemented in code executed by a processor, the functionality of the communication manager 1020, the receiver 1010, the transmitter 1015, or various combinations or components thereof may be performed by a general-purpose processor (e.g., a DSP, a CPU, an ASIC, an FPGA, a microcontroller), or any combination of these or other programmable logic devices (e.g., configured as or otherwise supporting means for performing the functions described in this disclosure).

[0168] In some examples, communication manager 1020 can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise cooperating with receiver 1010, transmitter 1015, or both. For example, communication manager 1020 can receive information from receiver 1010, transmit information to transmitter 1015, or be integrated with receiver 1010, transmitter 1015, or both to obtain information, output information, or perform various other operations as described herein.

[0169] According to examples as disclosed herein, the communication manager 1020 can support wireless communications at a network entity. For example, the communication manager 1020 can be configured to or otherwise support components for sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The communication manager 1020 can be configured to or otherwise support components for receiving a scheduling request for uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0170] By including or configuring a communication manager 1020 according to examples as described herein, the device 1005 (e.g., a processor controlling the receiver 1010, the transmitter 1015, the communication manager 1020, or a combination thereof or otherwise coupled thereto) can support techniques for using contention-based resource sets for sending scheduling requests, which can be a more efficient use of communication resources.

[0171] Figure 11 A block diagram 1100 illustrates a device 1105 that supports contention-based scheduling request resources according to one or more aspects of the present disclosure. The device 1105 can be an example of aspects of the device 1005 or the network entity 105 as described herein. The device 1105 can include a receiver 1110, a transmitter 1115, and a communication manager 1120. The device 1105 can also include a processor. Each of these components can communicate with each other (e.g., via one or more buses).

[0172] Receiver 1110 may provide means for obtaining (e.g., receiving, determining, identifying) information associated with various channels (e.g., control channels, data channels, information channels, channels associated with a protocol stack), such as user data, control information, or any combination thereof (e.g., I / Q samples, symbols, packets, protocol data units, service data units). The information may be passed to other components of device 1105. In some examples, receiver 1110 may support obtaining information by receiving signals via one or more antennas. Additionally or alternatively, receiver 1110 may support obtaining information by receiving signals via one or more wired (e.g., electrical, optical) interfaces, wireless interfaces, or any combination thereof.

[0173] The transmitter 1115 may provide means for outputting (e.g., transmitting, providing, conveying, transmitting) information generated by other components of the device 1105. For example, the transmitter 1115 may output information associated with various channels (e.g., control channels, data channels, information channels, channels associated with a protocol stack), such as user data, control information, or any combination thereof (e.g., I / Q samples, symbols, packets, protocol data units, service data units). In some examples, the transmitter 1115 may support outputting information by transmitting signals via one or more antennas. Additionally or alternatively, the transmitter 1115 may support outputting information by transmitting signals via one or more wired (e.g., electrical, optical) interfaces, wireless interfaces, or any combination thereof. In some examples, the transmitter 1115 and the receiver 1110 may be co-located in a transceiver, which may include or be coupled to a modem.

[0174] Device 1105 or its various components can be examples of means for performing various aspects of contention-based scheduling request resources as described herein. For example, communication manager 1120 can include contention-based resource set component 1125, scheduling request component 1130, or any combination thereof. Communication manager 1120 can be an example of various aspects of communication manager 1020 as described herein. In some examples, communication manager 1120 or its various components can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise cooperating with receiver 1110, transmitter 1115, or both. For example, communication manager 1120 can receive information from receiver 1110, transmit information to transmitter 1115, or be integrated in conjunction with receiver 1110, transmitter 1115, or both to obtain information, output information, or perform various other operations as described herein.

[0175] According to examples as disclosed herein, a communication manager 1120 can support wireless communications at a network entity. A contention-based resource set component 1125 can be configured to or otherwise support means for sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. A scheduling request component 1130 can be configured to or otherwise support means for receiving a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0176] Figure 12 A block diagram 1200 illustrates a communication manager 1220 that supports contention-based scheduling request resources in accordance with one or more aspects of the present disclosure. The communication manager 1220 can be an example of aspects of the communication manager 1020, the communication manager 1120, or both, as described herein. The communication manager 1220 or its various components can be examples of means for performing various aspects of contention-based scheduling request resources as described herein. For example, the communication manager 1220 can include a contention-based resource set component 1225, a scheduling request component 1230, a probability component 1235, a condition component 1240, an RRC transmit component 1245, an L1 and L2 transmit component 1250, or any combination thereof. Each of these components may communicate directly or indirectly with each other (e.g., via one or more buses), which communication may include communication within a protocol layer of a protocol stack, communication associated with a logical channel of the protocol stack (e.g., between protocol layers of a protocol stack, within a device, component, or virtualized component associated with the network entity 105, between devices, components, or virtualized components associated with the network entity 105), or any combination thereof.

[0177] According to examples as disclosed herein, a communication manager 1220 can support wireless communications at a network entity. A contention-based resource set component 1225 can be configured to or otherwise support means for sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. A scheduling request component 1230 can be configured to or otherwise support means for receiving a scheduling request requesting uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0178] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support a component for receiving the scheduling request via resources of the contention-based resource set based on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the packet delay threshold.

[0179] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support a component for receiving the scheduling request via the resources of the contention-based resource set based on the remaining packet delay budget of the uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the first packet delay threshold and less than the second packet delay threshold.

[0180] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support a component for receiving the scheduling request via resources of the contention-based resource set based on a buffer size of the first UE being greater than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being greater than the buffer size threshold.

[0181] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support a component for receiving the scheduling request via resources of the contention-based resource set based on a buffer size of the first UE being less than a buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being less than the buffer size threshold.

[0182] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support a component for receiving the scheduling request using resources of the contention-based resource set based on the first UE's buffer size being greater than a first buffer size threshold and less than a second buffer size threshold, wherein satisfaction of one or more corresponding conditions of the contention-based resource set includes the first UE's buffer size being greater than the first buffer size threshold and less than the second buffer size threshold.

[0183] In some examples, the probability component 1235 may be configured as or otherwise support means for sending an indication of a probability function associated with the group of multiple contention-based resource sets, the probability function being based on a packet delay time for each of the one or more UEs, wherein receiving the scheduling request via the resources of the contention-based resource set is based on a calculated probability of the first UE satisfying a probability threshold for the contention-based resource set.

[0184] In some examples, condition component 1240 may be configured as or otherwise support means for sending an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0185] In some examples, RRC transmitting component 1245 can be configured or otherwise support means for transmitting an RRC message indicating the set of multiple contention-based resource sets. In some examples, L1 and L2 transmitting component 1250 can be configured or otherwise support means for transmitting an L1 or L2 signal indicating activation of the set of multiple contention-based resource sets.

[0186] In some examples, to support receiving a scheduling request, the scheduling request component 1230 may be configured as or otherwise support components for receiving the scheduling request via resources of the contention-based resource set based on randomly selecting resources from the contention-based resource set by the first UE, wherein a successful contention-based process includes randomly selecting resources from the contention-based resource set by the first UE.

[0187] In some examples, to support receiving a scheduling request, scheduling request component 1230 may be configured or otherwise support means for receiving a scheduling request associated with a cyclic shift of a radio network temporary identifier mapped to the first UE.

[0188] In some examples, the set of multiple contention-based resource sets is periodic.

[0189] In some examples, each contention-based resource set in the set of multiple contention-based resource sets is associated with a corresponding logical channel.

[0190] In some examples, the uplink resources are used for uplink messages including XR uplink messages or ultra-reliable low-latency communication uplink messages.

[0191] Figure 13 A diagram illustrating a system 1300 including a device 1305 supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is shown. Device 1305 may be an example of device 1005, device 1105, or network entity 105 as described herein, or include components thereof. Device 1305 may communicate with one or more network entities 105, one or more UEs 115, or any combination thereof, which communication may include communication via one or more wired interfaces, via one or more wireless interfaces, or any combination thereof. Device 1305 may include components that support outgoing and incoming communications, such as a communication manager 1320, a transceiver 1310, an antenna 1315, a memory 1325, code 1330, and a processor 1335. These components may be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., bus 1340).

[0192] The transceiver 1310 may support bidirectional communication via a wired link, a wireless link, or both as described herein. In some examples, the transceiver 1310 may include a wired transceiver and may communicate bidirectionally with another wired transceiver. Additionally or alternatively, in some examples, the transceiver 1310 may include a wireless transceiver and may communicate bidirectionally with another wireless transceiver. In some examples, the device 1305 may include one or more antennas 1315, which may be capable of (e.g., concurrently) transmitting or receiving wireless transmissions. The transceiver 1310 may also include a modem for: modulating a signal; providing the modulated signal for transmission (e.g., via one or more antennas 1315, via a wired transmitter); receiving the modulated signal (e.g., from one or more antennas 1315, from a wired receiver); and demodulating the signal. In some implementations, the transceiver 1310 may include one or more interfaces, such as one or more interfaces coupled to one or more antennas 1315 configured to support various receive or obtain operations, or one or more interfaces coupled to one or more antennas 1315 configured to support various transmit or output operations, or a combination thereof. In some implementations, the transceiver 1310 may include or be configured to be coupled to one or more processors or memory components operable to perform or support operations based on received or obtained information or signals, or to generate information or other signals for transmission or other output, or any combination thereof. In some implementations, the transceiver 1310, or the transceiver 1310 and one or more antennas 1315, or the transceiver 1310 and one or more antennas 1315 and one or more processors or memory components (e.g., processor 1335 or memory 1325 or both) may be included in a chip or chip assembly installed in the device 1305. In some examples, the transceiver may be operable to support communications via one or more communication links (eg, communication link 125 , backhaul communication link 120 , midhaul communication link 162 , fronthaul communication link 168 ).

[0193] Memory 1325 may include RAM and ROM. Memory 1325 may store computer-readable, computer-executable code 1330 including instructions that, when executed by processor 1335, cause device 1305 to perform the various functions described herein. Code 1330 may be stored in a non-transitory computer-readable medium such as system memory or another type of memory. In some cases, code 1330 may not be directly executable by processor 1335, but may (e.g., when compiled and executed) cause a computer to perform the functions described herein. In some cases, memory 1325 may also contain, among other things, a BIOS that controls basic hardware or software operations, such as interaction with peripheral components or devices.

[0194] The processor 1335 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, an ASIC, a CPU, an FPGA, a microcontroller, a programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof). In some cases, the processor 1335 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 1335. The processor 1335 may be configured to execute computer-readable instructions stored in a memory (e.g., memory 1325) to cause the device 1305 to perform various functions (e.g., functions or tasks that support contention-based scheduling of resource requests). For example, the device 1305 or a component of the device 1305 may include the processor 1335 and the memory 1325 coupled to the processor 1335, the processor 1335 and the memory 1325 being configured to perform the various functions described herein. The processor 1335 may be an example of a cloud computing platform (e.g., one or more physical nodes and supporting software, such as an operating system, a virtual machine, or a container instance) that may host functions for performing the functions of the device 1305 (e.g., by executing code 1330). Processor 1335 may be any one or more suitable processors capable of executing scripts or instructions of one or more software programs stored in device 1305 (such as within memory 1325). In some implementations, processor 1335 may be a component of a processing system. A processing system may generally refer to a system or series of machines or components that receives inputs and processes those inputs to produce a set of outputs (which may be passed to, for example, other systems or components of device 1305). For example, the processing system of device 1305 may refer to a system that includes various other components or subcomponents of device 1305 (such as processor 1335, transceiver 1310, communications manager 1320, or other components or combinations of components of device 1305). The processing system of device 1305 may interface with other components of device 1305 and may process information (such as inputs or signals) received from other components or output information to other components. For example, a chip or modem of device 1305 may include a processing system and one or more interfaces for outputting information, for receiving information, or both. The one or more interfaces may be implemented as or otherwise include a first interface configured to output information and a second interface configured to obtain information, or the same interface configured to output information and obtain information, etc. In some implementations, the one or more interfaces may refer to an interface between a processing system of a chip or modem and a transmitter, so that the device 1305 can transmit information output from the chip or modem. Additionally or alternatively, in some implementations, the one or more interfaces may refer to an interface between a processing system of a chip or modem and a receiver, so that the device 1305 can obtain information or signal input, and the information can be passed to the processing system.One of ordinary skill in the art will readily recognize that the first interface may also obtain information or signal input, and the second interface may also output information or signal output.

[0195] In some examples, bus 1340 may support communications for protocol layers of a protocol stack (e.g., within a protocol layer). In some examples, bus 1340 may support communications associated with logical channels of a protocol stack (e.g., between protocol layers of a protocol stack), which may include communications performed within components of device 1305 or between different components of device 1305 that may be co-located or located in different locations (e.g., where device 1305 may refer to a system in which one or more of communication manager 1320, transceiver 1310, memory 1325, code 1330, and processor 1335 may be located in one of the different components or divided between the different components).

[0196] In some examples, communication manager 1320 can manage aspects of communications with core network 130 (e.g., via one or more wired or wireless backhaul links). For example, communication manager 1320 can manage the transmission of data communications for client devices, such as one or more UEs 115. In some examples, communication manager 1320 can manage communications with other network entities 105 and can include a controller or scheduler for controlling communications with UEs 115 in coordination with other network entities 105. In some examples, communication manager 1320 can support an X2 interface within LTE / LTE-A wireless communication network technology to provide communications between network entities 105.

[0197] According to examples as disclosed herein, the communication manager 1320 can support wireless communications at a network entity. For example, the communication manager 1320 can be configured to or otherwise support components for sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The communication manager 1320 can be configured to or otherwise support components for receiving a scheduling request for uplink resources from a first UE via resources of a contention-based resource set in the set of multiple contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

[0198] By including or configuring a communication manager 1320 according to examples as described herein, the device 1305 can support techniques for using contention-based resource sets for sending scheduling requests, which can reduce latency and be a more efficient use of communication resources.

[0199] In some examples, the communication manager 1320 can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise coordinating with the transceiver 1310, one or more antennas 1315 (e.g., where applicable), or any combination thereof. Although the communication manager 1320 is illustrated as a separate component, in some examples, one or more functions described with reference to the communication manager 1320 can be supported or performed by the transceiver 1310, the processor 1335, the memory 1325, the code 1330, or any combination thereof. For example, the code 1330 can include instructions executable by the processor 1335 to cause the device 1305 to perform various aspects of contention-based scheduling request resources as described herein, or the processor 1335 and the memory 1325 can be otherwise configured to perform or support such operations.

[0200] Figure 14 A flowchart illustrating a method 1400 for supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The operations of the method 1400 may be implemented by a UE or a component thereof as described herein. For example, the operations of the method 1400 may be implemented by a UE or a component thereof as described herein. Figures 1 to 9 The UE 115 described herein performs the functions described herein. In some examples, the UE may execute an instruction set to control the functional elements of the UE to perform the functions described herein. Additionally or alternatively, the UE may use dedicated hardware to perform various aspects of the functions described herein.

[0201] At 1405, the method may include receiving a message indicating a set of multiple contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The operations of 1405 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1405 may be performed as described in reference to Figure 8 The resource component 825 described here performs.

[0202] At 1410, the method may include: based on satisfaction of one or more corresponding conditions for the contention-based resource set and based on a successful contention-based process for the contention-based resource set, sending a scheduling request to request uplink resources for the UE using resources of the contention-based resource set in the set of multiple contention-based resource sets. The operations of 1410 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1410 may be performed as described in reference to Figure 8 The described scheduling request component 830 performs.

[0203] Figure 15A flowchart illustrating a method 1500 for supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The operations of the method 1500 may be implemented by a UE or a component thereof as described herein. For example, the operations of the method 1500 may be implemented by a UE or a component thereof as described herein. Figures 1 to 9 The UE 115 described herein performs the functions described herein. In some examples, the UE may execute an instruction set to control the functional elements of the UE to perform the functions described herein. Additionally or alternatively, the UE may use dedicated hardware to perform various aspects of the functions described herein.

[0204] At 1505, the method may include receiving a message indicating a set of multiple contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The operations of 1505 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1505 may be performed as described in reference to Figure 8 The resource component 825 described here performs.

[0205] At 1510, the method may include receiving an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets. The operations of 1510 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1510 may be performed as described in reference to Figure 8 The communication component 845 described executes.

[0206] At 1515, the method may include: based on satisfaction of one or more corresponding conditions for the contention-based resource set and based on a successful contention-based process for the contention-based resource set, sending a scheduling request to request uplink resources for the UE using resources of the contention-based resource set in the set of multiple contention-based resource sets. The operations of 1515 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1515 may be performed as described in reference to Figure 8 The described scheduling request component 830 performs.

[0207] Figure 16 A flowchart illustrating a method 1600 for supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The operations of the method 1600 may be implemented by a network entity or component thereof as described herein. For example, the operations of the method 1600 may be implemented by a network entity or component thereof as described herein. Figures 1 to 5 as well as Figures 10 to 13 The network entity described herein performs. In some examples, the network entity may execute an instruction set to control functional elements of the network entity to perform the described functions. Additionally or alternatively, the network entity may use dedicated hardware to perform various aspects of the described functions.

[0208] At 1605, the method may include sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The operations of 1605 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1605 may be performed as described in reference to Figure 12 The described contention-based resource set component 1225 performs.

[0209] At 1610, the method may include receiving a scheduling request for uplink resources from a first UE via resources of a contention-based resource set in the set of a plurality of contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE. The operations of 1610 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1610 may be performed as described with reference to Figure 12 The described scheduling request component 1230 performs.

[0210] Figure 17 A flowchart illustrating a method 1700 for supporting contention-based scheduling request resources according to one or more aspects of the present disclosure is illustrated. The operations of the method 1700 may be implemented by a network entity or component thereof as described herein. For example, the operations of the method 1700 may be implemented by a network entity or component thereof as described herein. Figures 1 to 5 as well as Figures 10 to 13 The network entity described herein performs. In some examples, the network entity may execute an instruction set to control functional elements of the network entity to perform the described functions. Additionally or alternatively, the network entity may use dedicated hardware to perform various aspects of the described functions.

[0211] At 1705, the method may include sending a message indicating a set of multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the set of multiple contention-based resource sets being associated with one or more corresponding conditions. The operations of 1705 may be performed according to examples disclosed herein. In some examples, aspects of the operations of 1705 may be performed as described in reference to Figure 12 The described contention-based resource set component 1225 performs.

[0212] At 1710, the method may include sending an indication of one or more respective conditions associated with each of the plurality of contention-based resource sets. The operations of 1710 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1710 may be performed as described in reference to Figure 12 The described conditional component 1240 executes.

[0213] At 1715, the method may include receiving a scheduling request for uplink resources from a first UE via a resource of a contention-based resource set in the set of a plurality of contention-based resource sets, the contention-based resource set being based on satisfaction of one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE. The operations of 1715 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1715 may be performed as described with reference to Figure 12 The described scheduling request component 1230 performs.

[0214] The following provides an overview of various aspects of the disclosure:

[0215] Aspect 1: A method for wireless communication at a UE, the method comprising: receiving a message indicating a plurality of contention-based resource sets dedicated to scheduling requests, each of the plurality of contention-based resource sets being associated with one or more corresponding conditions; and sending a scheduling request to request uplink resources for the UE using resources of the contention-based resource sets in the plurality of contention-based resource sets based at least in part on satisfaction of the one or more corresponding conditions of the contention-based resource sets and based on a successful contention-based process for the contention-based resource sets.

[0216] Aspect 2: A method according to Aspect 1, wherein sending the scheduling request includes: at least in part based on the remaining packet delay budget of the uplink message associated with the scheduling request being greater than a packet delay threshold, using the resources of the contention-based resource set to send the scheduling request, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the packet delay threshold.

[0217] Aspect 3: A method according to any one of Aspects 1 to 2, wherein sending the scheduling request includes: at least in part based on the remaining packet delay budget of the uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, using the resources of the contention-based resource set to send the scheduling request, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the first packet delay threshold and less than the second packet delay threshold.

[0218] Aspect 4: A method according to any one of Aspects 1 to 3, wherein sending the scheduling request includes: sending the scheduling request using the resources of the contention-based resource set based at least in part on the buffer size of the UE being greater than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the UE being greater than the buffer size threshold.

[0219] Aspect 5: A method according to any one of Aspects 1 to 4, wherein sending the scheduling request includes: sending the scheduling request using the resources of the contention-based resource set based at least in part on the buffer size of the UE being less than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the UE being less than the buffer size threshold.

[0220] Aspect 6: A method according to any one of Aspects 1 to 5, wherein sending the scheduling request includes: sending the scheduling request using the resources of the contention-based resource set based at least in part on the buffer size of the UE being greater than a first buffer size threshold and less than a second buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the UE being greater than the first buffer size threshold and less than the second buffer size threshold.

[0221] Aspect 7: According to any one of aspects 1 to 6, the method further includes: receiving an indication of a probability function associated with the multiple contention-based resource sets, the probability function being associated with the packet delay time of the UE; and calculating a probability using the probability function and the packet delay time of the UE, wherein sending the scheduling request using the resources of the contention-based resource set is at least partially based on the probability satisfying the probability threshold of the contention-based resource set.

[0222] Aspect 8: The method according to any one of aspects 1 to 7, further comprising: receiving an indication of the one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0223] Aspect 9: According to any one of aspects 1 to 8, the method further includes: receiving an RRC message indicating the multiple contention-based resource sets; and receiving an L1 or L2 signal indicating activation of the multiple contention-based resource sets.

[0224] Aspect 10: A method according to any one of Aspects 1 to 9, wherein sending the scheduling request includes: sending the scheduling request using the resources of the contention-based resource set based at least in part on randomly selecting the resources from the contention-based resource set, wherein the successful contention-based process includes randomly selecting the resources from the contention-based resource set.

[0225] Aspect 11: The method according to any one of aspects 1 to 10, wherein sending the scheduling request comprises sending the scheduling request using a cyclic shift mapped to the RNTI of the UE.

[0226] Aspect 12: The method according to any one of aspects 1 to 11, wherein the plurality of contention-based resource sets are periodic.

[0227] Aspect 13: The method according to any one of aspects 1 to 12, wherein each of the plurality of contention-based resource sets is associated with a corresponding logical channel.

[0228] Aspect 14: The method according to any one of aspects 1 to 13, wherein the uplink resources are used for uplink messages including XR uplink messages or URLLC uplink messages.

[0229] Aspect 15: A method for wireless communication at a network entity, the method comprising: sending a message indicating multiple contention-based resource sets dedicated to scheduling requests for one or more UEs, each contention-based resource set in the multiple contention-based resource sets being associated with one or more corresponding conditions; and receiving a scheduling request for uplink resources from a first UE via resources of a contention-based resource set in the multiple contention-based resource sets, the contention-based resource set being at least partially based on satisfaction of the one or more corresponding conditions for the contention-based resource set at the first UE and based on a successful contention-based process for the contention-based resource set at the first UE.

[0230] Aspect 16: A method according to Aspect 15, wherein receiving the scheduling request includes: receiving the scheduling request via the resources of the contention-based resource set at least in part based on the remaining packet delay budget of the uplink message associated with the scheduling request being greater than a packet delay threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the packet delay threshold.

[0231] Aspect 17: A method according to any one of Aspects 15 to 16, wherein receiving the scheduling request includes: receiving the scheduling request via the resources of the contention-based resource set at least in part based on the remaining packet delay budget of the uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the first packet delay threshold and less than the second packet delay threshold.

[0232] Aspect 18: A method according to any one of Aspects 15 to 17, wherein receiving the scheduling request includes: receiving the scheduling request via the resources of the contention-based resource set based at least in part on the buffer size of the first UE being greater than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being greater than the buffer size threshold.

[0233] Aspect 19: A method according to any one of Aspects 15 to 18, wherein receiving the scheduling request includes: receiving the scheduling request via the resources of the contention-based resource set at least in part based on the buffer size of the first UE being less than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being less than the buffer size threshold.

[0234] Aspect 20: A method according to any one of Aspects 15 to 19, wherein receiving the scheduling request includes: receiving the scheduling request using the resources of the contention-based resource set based at least in part on the buffer size of the first UE being greater than a first buffer size threshold and less than a second buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the buffer size of the first UE being greater than the first buffer size threshold and less than the second buffer size threshold.

[0235] Aspect 21: According to any one of Aspects 15 to 20, the method further includes: sending an indication of a probability function associated with the multiple contention-based resource sets, the probability function being based at least in part on the packet delay time of each UE in the one or more UEs, wherein receiving the scheduling request via the resources of the contention-based resource set is based at least in part on the calculated probability of the first UE satisfying the probability threshold of the contention-based resource set.

[0236] Aspect 22: The method according to any one of aspects 15 to 21, further comprising: sending an indication of the one or more respective conditions associated with each of the plurality of contention-based resource sets.

[0237] Aspect 23: The method according to any one of aspects 15 to 22, further comprising: sending an RRC message indicating the plurality of contention-based resource sets; and sending an L1 or L2 signal indicating activation of the plurality of contention-based resource sets.

[0238] Aspect 24: A method according to any one of Aspects 15 to 23, wherein receiving the scheduling request includes: receiving the scheduling request via the resources of the contention-based resource set based at least in part on randomly selecting the resources from the contention-based resource set by the first UE, wherein the successful contention-based process includes randomly selecting the resources from the contention-based resource set by the first UE.

[0239] Aspect 25: The method according to any one of aspects 15 to 24, wherein receiving the scheduling request comprises receiving the scheduling request associated with a cyclic shift of the RNTI mapped to the first UE.

[0240] Aspect 26: The method according to any one of aspects 15 to 25, wherein the plurality of contention-based resource sets are periodic.

[0241] Aspect 27: The method according to any one of aspects 15 to 26, wherein each of the plurality of contention-based resource sets is associated with a corresponding logical channel.

[0242] Aspect 28: The method according to any one of aspects 15 to 27, wherein the uplink resources are used for uplink messages including XR uplink messages or URLLC uplink messages.

[0243] Aspect 29: An apparatus for wireless communication at a UE, the apparatus comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method according to any one of aspects 1 to 14.

[0244] Aspect 30: An apparatus for wireless communication at a UE, the apparatus comprising at least one component for performing the method according to any one of aspects 1 to 14.

[0245] Aspect 31: A non-transitory computer-readable medium storing a code for wireless communication at a UE, the code comprising instructions executable by a processor to perform the method according to any one of aspects 1 to 14.

[0246] Aspect 32: An apparatus for wireless communication at a network entity, the apparatus comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method according to any one of aspects 15 to 28.

[0247] Aspect 33: An apparatus for wireless communication at a network entity, the apparatus comprising at least one component for performing the method according to any one of aspects 15 to 28.

[0248] Aspect 34: A non-transitory computer-readable medium storing code for wireless communication between network entities, the code comprising instructions executable by a processor to perform the method according to any one of aspects 15 to 28.

[0249] It should be noted that the methods described herein describe possible implementations, and that the operations and steps may be rearranged or otherwise modified and that other implementations are possible. Furthermore, aspects from two or more methods may be combined.

[0250] Although aspects of LTE, LTE-A, LTE-A Pro, or NR systems may be described for example purposes, and the terminology of LTE, LTE-A, LTE-A Pro, or NR may be used throughout much of the description, the techniques described herein may also be applicable to networks other than LTE, LTE-A, LTE-A Pro, or NR networks. For example, the techniques described may be applicable to various other wireless communication systems, such as Ultra Mobile Broadband (UMB), Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, and other systems and radio technologies not explicitly mentioned herein.

[0251] The information and signals described herein may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips referred to throughout the specification may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0252] The various illustrative blocks and components described in conjunction with the disclosure herein may be implemented or executed using a general purpose processor, a DSP, an ASIC, a CPU, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration).

[0253] The functions described herein may be implemented using hardware, software executed by a processor, firmware, or any combination thereof. When implemented using software executed by a processor, the functions may be stored as one or more instructions or codes of a computer-readable medium, or sent using one or more instructions or codes of a computer-readable medium. Other examples and specific implementations are within the scope of this disclosure and the appended claims. For example, due to the nature of software, the functions described herein may be implemented using software executed by a processor, hardware, firmware, hard wiring, or a combination of any of these. Features that implement the functions may also be physically located at different locations, including being distributed so that the various parts of the functions are implemented at different physical locations.

[0254] Computer readable medium includes both non-transient computer storage medium and communication medium, and this communication medium includes any medium that promotes computer program to be transferred from one position to another position.Non-transient storage medium can be any available medium that can be accessed by general-purpose computer or special-purpose computer.By way of example and not limitation, non-transient computer readable medium can include RAM, ROM, electrically erasable programmable ROM (EEPROM), flash memory, compact disc (CD) ROM or other optical disc storage device, magnetic disk storage device or other magnetic storage device or can be used for carrying or storing desired program code components and any other non-transient medium that can be accessed by general-purpose or special-purpose computer or general or special-purpose processor in the form of instruction or data structure.In addition, any connection is appropriately referred to as computer readable medium.For example, if software is to be sent from website, server or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wireless technology such as infrared, radio and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL or wireless technology such as infrared, radio and microwave are included in the definition of computer readable medium. As used herein, disk and optical disc include CD, laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc. Disks can reproduce data magnetically, while optical discs can reproduce data optically using lasers. Combinations of the above are also included within the scope of computer-readable media.

[0255] As used herein (including in the claims), "or" used in a list of items (e.g., a list of items followed by a phrase such as "at least one of" or "one or more of") indicates an inclusive list, so that, for example, a list of at least one of A, B, or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). In addition, as used herein, the phrase "based on" should not be interpreted as a reference to a closed set of conditions. For example, an example step described as "based on condition A" can be based on both condition A and condition B without departing from the scope of this disclosure. In other words, as used herein, the phrase "based on" should be interpreted in the same manner as the phrase "based at least in part on."

[0256] The term "determining" encompasses a variety of actions, and thus, "determining" may include calculating, computing, processing, deriving, investigating, looking up (such as via looking up in a table, database, or other data structure), ascertaining, etc. Additionally, "determining" may include receiving (e.g., receiving information), accessing (e.g., accessing data stored in a memory), etc. Additionally, "determining" may include parsing, retrieving, selecting, choosing, establishing, and other such similar actions.

[0257] In the drawings, similar components or features may have the same reference label. In addition, various components of the same type may be distinguished by following the reference label with a dash and a second label to distinguish between similar components. If only the first reference label is used in the specification, the description applies to any of the similar components having the same first reference label, regardless of the second or subsequent reference labels.

[0258] The description set forth herein in conjunction with the accompanying drawings describes example configurations and does not represent all examples that may be implemented or within the scope of the claims. The term "example" as used herein means "serving as an example, instance, or illustration," rather than "preferred" or "having advantages over other examples." The detailed description includes specific details to provide an understanding of the described techniques. However, these techniques may be practiced without these specific details. In some cases, known structures and devices are shown in block diagram form to avoid obscuring the concepts of the described examples.

[0259] The description herein is provided to enable one of ordinary skill in the art to make or use the present disclosure. Various modifications to the present disclosure will be apparent to those of ordinary skill in the art, and the general principles defined herein may be applied to other variations without departing from the scope of the present disclosure. Thus, the present disclosure is not limited to the examples and designs described herein, but should be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An apparatus for wireless communication at a user equipment (UE), the apparatus comprising: Memory; as well as a processor coupled to the memory and configured to: receiving a message indicating a plurality of contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the plurality of contention-based resource sets being associated with one or more respective conditions; as well as Based at least in part on the satisfaction of the one or more corresponding conditions for the contention-based resource set and on a successful contention-based procedure for the contention-based resource set, a scheduling request is sent using resources of a contention-based resource set in the plurality of contention-based resource sets to request uplink resources for the UE.

2. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based resource set based at least in part on a remaining packet delay budget for an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the packet delay threshold.

3. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based resource set based at least in part on a remaining packet delay budget for an uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget being greater than the first packet delay threshold and less than the second packet delay threshold.

4. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based resource set based at least in part on the UE's buffer size being greater than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being greater than the buffer size threshold.

5. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based resource set based at least in part on the UE's buffer size being less than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the UE's buffer size being less than the buffer size threshold.

6. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based resource set based at least in part on the UE's buffer size being greater than a first buffer size threshold and less than a second buffer size threshold, wherein the satisfying of the one or more respective conditions of the contention-based resource set comprises the UE's buffer size being greater than the first buffer size threshold and less than the second buffer size threshold.

7. The apparatus of claim 1 , wherein the processor is further configured to: receiving an indication of a probability function associated with the plurality of contention-based resource sets, the probability function associated with a packet delay time for the UE; and A probability is calculated using the probability function and the packet delay time of the UE, wherein sending the scheduling request using the resources of the contention-based resource set is based at least in part on the probability satisfying a probability threshold for the contention-based resource set.

8. The apparatus of claim 1 , wherein the processor is further configured to: An indication of the one or more respective conditions associated with each of the plurality of contention-based resource sets is received.

9. The apparatus of claim 1 , wherein the processor is further configured to: receiving a radio resource control message indicating the plurality of contention-based resource sets; and A layer 1 or layer 2 signal is received indicating activation of the plurality of contention-based resource sets.

10. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using the resources of the contention-based set of resources based at least in part on randomly selecting the resources from the contention-based set of resources, wherein the successful contention-based procedure includes randomly selecting the resources from the contention-based set of resources.

11. The device according to claim 1, wherein To send the scheduling request, the processor is further configured to: The scheduling request is sent using a cyclic shift mapped to a radio network temporary identifier of the UE.

12. The apparatus of claim 1, wherein the plurality of contention-based resource sets are periodic.

13. The apparatus of claim 1, wherein each of the plurality of contention-based resource sets is associated with a corresponding logical channel.

14. The apparatus of claim 1, wherein the uplink resources are used for uplink messages including virtual reality uplink messages or ultra-reliable low-latency communication uplink messages.

15. An apparatus for wireless communication at a network entity, the apparatus comprising: Memory; as well as a processor coupled to the memory and configured to: transmitting a message indicating a plurality of contention-based resource sets dedicated to a scheduling request for one or more user equipments (UEs), each contention-based resource set in the plurality of contention-based resource sets being associated with one or more respective conditions; as well as A scheduling request for uplink resources is received from a first UE via resources of a contention-based resource set of the plurality of contention-based resource sets, wherein the contention-based resource set is at least partially based on the satisfaction of the one or more corresponding conditions of the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

16. The device according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received via the resources of the contention-based resource set based at least in part on a remaining packet delay budget of an uplink message associated with the scheduling request being greater than a packet delay threshold, wherein the satisfying of the one or more respective conditions of the contention-based resource set comprises the remaining packet delay budget of the first UE being greater than the packet delay threshold.

17. The device according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received via the resources of the contention-based resource set based at least in part on a remaining packet delay budget for an uplink message associated with the scheduling request being greater than a first packet delay threshold and less than a second packet delay threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the remaining packet delay budget of the first UE being greater than the first packet delay threshold and less than the second packet delay threshold.

18. The device according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received via the resources of the contention-based resource set based at least in part on the first UE's buffer size being greater than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the first UE's buffer size being greater than the buffer size threshold.

19. The device according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received via the resources of the contention-based resource set based at least in part on the first UE's buffer size being less than a buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the first UE's buffer size being less than the buffer size threshold.

20. The apparatus according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received using the resources of the contention-based resource set based at least in part on the first UE's buffer size being greater than a first buffer size threshold and less than a second buffer size threshold, wherein the satisfaction of the one or more corresponding conditions of the contention-based resource set includes the first UE's buffer size being greater than the first buffer size threshold and less than the second buffer size threshold.

21. The apparatus of claim 15, wherein the processor is further configured to: and sending an indication of a probability function associated with the plurality of contention-based resource sets, the probability function being based at least in part on a packet delay time for each of the one or more UEs, wherein receiving the scheduling request via the resources of the contention-based resource sets is based at least in part on a calculated probability of the first UE satisfying a probability threshold for the contention-based resource sets.

22. The apparatus of claim 15, wherein the processor is further configured to: An indication of the one or more respective conditions associated with each of the plurality of contention-based resource sets is sent.

23. The apparatus of claim 15, wherein the processor is further configured to: sending a radio resource control message indicating the plurality of contention-based resource sets; and A layer 1 or layer 2 signal is transmitted indicating activation of the plurality of contention-based resource sets.

24. The apparatus according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request is received via the resources of the contention-based resource set based at least in part on randomly selecting, by the first UE, the resources from the contention-based resource set, wherein the successful contention-based procedure includes randomly selecting, by the first UE, the resources from the contention-based resource set.

25. The apparatus according to claim 15, wherein To receive the scheduling request, the processor is further configured to: The scheduling request associated with a cyclic shift mapped to a radio network temporary identifier of the first UE is received.

26. The apparatus of claim 15, wherein the plurality of contention-based resource sets are periodic.

27. The apparatus of claim 15, wherein each of the plurality of contention-based resource sets is associated with a corresponding logical channel.

28. The apparatus of claim 15, wherein the uplink resources are used for uplink messages comprising virtual reality uplink messages or ultra-reliable low-latency communication uplink messages.

29. A method for wireless communication at a user equipment (UE), the method comprising: receiving a message indicating a plurality of contention-based resource sets dedicated to a scheduling request, each contention-based resource set in the plurality of contention-based resource sets being associated with one or more respective conditions; as well as Based at least in part on the satisfaction of the one or more corresponding conditions for the contention-based resource set and on a successful contention-based procedure for the contention-based resource set, a scheduling request is sent using resources of a contention-based resource set in the plurality of contention-based resource sets to request uplink resources for the UE.

30. A method for wireless communication at a network entity, the method comprising: transmitting a message indicating a plurality of contention-based resource sets dedicated to a scheduling request for one or more user equipments (UEs), each contention-based resource set in the plurality of contention-based resource sets being associated with one or more respective conditions; as well as A scheduling request for uplink resources is received from a first UE via resources of a contention-based resource set of the plurality of contention-based resource sets, wherein the contention-based resource set is at least partially based on the satisfaction of the one or more corresponding conditions of the contention-based resource set at the first UE and based on a successful contention-based procedure for the contention-based resource set at the first UE.

Images