Systems and methods for medium access control entity activation and use in cell-free networks

Abstract

Systems and methods for the establishment, creation, activation, and use of medium access control (MAC) entities with respect to a cluster of base stations that serves a user equipment (UE) are discussed herein. It may be the case that each / any base station within the cluster uses more than one MAC entity for the UE These multiple MAC entities may be established for the UE according to / corresponding to a sub-cluster of base stations from cluster as used by radio bearers between the UE and the network. A possible MAC entity is established upon determining that a latency of the MAC entity meets a latency requirement for a sub-cluster which the MAC entity can serve. A set of such possible MAC entities may be reduced to account for a simultaneous MAC limitation at the UE. Dynamic activation / deactivation of one or more established MACs corresponding to active data communications is also discussed.

Description

SYSTEMS AND METHODS FOR MEDIUM ACCESS CONTROL ENTITY ACTIVATION AND USE IN CELL-FREE NETWORKS TECHNICAL FIELD

[0001] This application relates generally to wireless communication systems, including medium access control (MAC) entities in cell-free architectures. BACKGROUND

[0002] Wireless mobile communication technology uses various standards and protocols to transmit data between a base station and a wireless communication device. Wireless communication system standards and protocols can include, for example, 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) (e.g., 4G), 3GPP New Radio (NR) (e.g., 5G), and Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard for Wireless Local Area Networks (WLAN) (commonly known to industry groups as Wi-Fi®).

[0003] As contemplated by the 3GPP, different wireless communication systems’ standards and protocols can use various radio access networks (RANs) for communicating between a base station of the RAN (which may also sometimes be referred to generally as a RAN node, a network node, or simply a node) and a wireless communication device known as a user equipment (UE). 3GPP RANs can include, for example, Global System for Mobile communications (GSM), Enhanced Data Rates for GSM Evolution (EDGE) RAN (GERAN), Universal Terrestrial Radio Access Network (UTRAN), Evolved Universal Terrestrial Radio Access Network (E-UTRAN), and / or Next-Generation Radio Access Network (NG-RAN).

[0004] Each RAN may use one or more radio access technologies (RATs) to perform communication between the base station and the UE. For example, the GERAN implements GSM and / or EDGE RAT, the UTRAN implements Universal Mobile Telecommunication System (UMTS) RAT or other 3GPP RAT, the E-UTRAN implements LTE RAT (sometimes simply referred to as LTE), and NG-RAN implements NR RAT (sometimes referred to herein as 5G RAT, 5G NR RAT, or simply NR). In certain deployments, the E-UTRAN may also implement NR RAT. In certain deployments, NG-RAN may also implement LTE RAT.

[0005] A base station used by a RAN may correspond to that RAN. One example of an E-UTRAN base station is an Evolved Universal Terrestrial Radio Access Network (E-UTRAN) Node B (also commonly denoted as evolved Node B, enhanced Node B, 1 P65105WO14883-6495-3844\1eNodeB, or eNB). One example of an NG-RAN base station is a next generation Node B (also sometimes referred to as a g Node B or gNB).

[0006] A RAN provides its communication services with external entities through its connection to a core network (CN). For example, E-UTRAN may utilize an Evolved Packet Core (EPC) while NG-RAN may utilize a 5G Core Network (5GC).

[0007] Frequency bands for 5G NR may be separated into two or more different frequency ranges. For example, Frequency Range 1 (FR1) may include frequency bands operating in sub-6 gigahertz (GHz) frequencies, some of which are bands that may be used by previous standards, and may potentially be extended to cover new spectrum offerings from 410 megahertz (MHz) to 7125 MHz. Frequency Range 2 (FR2) may include frequency bands from 24.25 GHz to 52.6 GHz. Note that in some systems, FR2 may also include frequency bands from 52.6 GHz to 71 GHz (or beyond). Bands in the millimeter wave (mmWave) range of FR2 may have smaller coverage but potentially higher available bandwidth than bands in FR1. Skilled persons will recognize these frequency ranges, which are provided by way of example, may change from time to time or from region to region. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

[0008] To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the figure number in which that element is first introduced.

[0009] FIG. 1 illustrates a diagram for an example of clustering in a cell-free network architecture, according to embodiments discussed herein.

[0010] FIG. 2 illustrates a diagram showing portions of protocol stacks corresponding to a first PDU session and a second PDU session, according to embodiments herein.

[0011] FIG. 3 illustrates a diagram showing aspects of radio protocol use in cell-free network mechanisms, according to embodiments discussed herein.

[0012] FIG. 4 illustrates a diagram showing a portion of a protocol stack and its visualized application within a corresponding cluster, according to embodiments discussed herein.

[0013] FIG. 5 illustrates a diagram showing a portion of a protocol stack and its visualized application within a cluster serving a UE, corresponding to a case of MAC scheduling using joint decision making, according to embodiments discussed herein.

[0014] FIG. 6 illustrates a diagram showing a portion of a protocol stack and its visualized application within a cluster, corresponding to a case of MAC scheduling using centralized decision making, according to embodiments discussed herein. 2 P65105WO14883-6495-3844\1

[0015] FIG. 7 illustrates a diagram showing a portion of a protocol stack and its visualized application within a cluster, corresponding to a case of MAC scheduling using mixed mode decision making, according to embodiments discussed herein.

[0016] FIG. 8 illustrates a diagram showing a cluster of base stations and MAC entity options for that cluster, according to embodiments discussed herein.

[0017] FIG. 9 illustrates a diagram showing a portion of a protocol stack and its visualized application within a cluster, according to embodiments discussed herein.

[0018] FIG. 10A, FIG. 10B, and FIG. 10C illustrate a diagram showing a portion of a protocol stack and its visualized application within a cluster, according to embodiments discussed herein.

[0019] FIG. 11 illustrates a flow diagram corresponding to MAC entity establishment and / or creation, according to embodiments discussed herein.

[0020] FIG. 12A, FIG. 12B, and FIG. 12C illustrate examples of RLC-to-MAC edge activation / deactivation in the context of a protocol stack, according to embodiments discussed herein.

[0021] FIG. 13 illustrates a diagram showing a base station that operates a MAC controller entity, according to embodiments discussed herein.

[0022] FIG. 14 illustrates a diagram corresponding to the transmission of a UE capability message and further illustrating the contents of a UE capability message report that may be included in the UE capability message, according to embodiments discussed herein.

[0023] FIG. 15 illustrates an example of a configuration of radio bearer IDs for the indication of radio-bearer-specific TBs as between a UE and a cell-free network, according to embodiments discussed herein.

[0024] FIG. 16A illustrates a flow diagram for a DL procedure for indicating radio bearers according to previously established configuration information for a correspondence of radio bearer IDs to zero or more radio bearers that exist between the UE and the cell-free network, according to embodiments discussed herein.

[0025] FIG. 16B illustrates a flow diagram for a UL procedure for indicating radio bearers according to previously established configuration information for a correspondence of radio bearer IDs to zero or more radio bearers that exist between a UE and the cell-free network, according to embodiments discussed herein. 3 P65105WO14883-6495-3844\1

[0026] FIG. 17 illustrates a diagram showing each of a non-DRB-specific data allocation option and a DRB-specific data allocation option for the operation of a MAC entity of an example protocol stack, according to embodiments discussed herein.

[0027] FIG. 18A illustrates a flow diagram showing an RRC message exchange for configuring a CORESET corresponding to a MAC entity as between a UE and a cell-free network, according to embodiments discussed herein.

[0028] FIG. 18B illustrates a flow diagram showing a MAC CE indication of a maximum number of PDCCHs (corresponding to DCIs / TBs) that can be allocated by a MAC as between a UE and a cell-free network, according to embodiments discussed herein.

[0029] FIG. 19A, FIG. 19B, FIG. 19C, FIG. 19D, and FIG. 19E together visually illustrate a procedure for the use of a greedy algorithm, according to embodiments discussed herein.

[0030] FIG. 20 illustrates a method of a CCF of a wireless communication system for performing MAC entity establishment for a cluster of base stations serving a UE, according to embodiments herein.

[0031] FIG. 21 illustrates a method of a CCF of a wireless communication system for performing MAC entity establishment for a cluster of base stations serving a UE, according to embodiments herein.

[0032] FIG. 22 illustrates a method of a UE served by a cluster of base stations of a wireless communication system, according to embodiments herein.

[0033] FIG. 23 illustrates a method of an L3 scheduler of a wireless communication system for performing RLC to MAC edge activation in a cluster of base stations serving a UE, according to embodiments herein.

[0034] FIG. 24 illustrates a method of a UE that is served by a cluster of base stations, according to embodiments herein.

[0035] FIG. 25 illustrates a method of a cluster of base stations serving a UE, according to embodiments herein.

[0036] FIG. 26 illustrates a method of a cluster of base stations serving a UE, according to embodiments herein.

[0037] FIG. 27 illustrates a method of a UE served by a cluster of base stations, according to embodiments herein.

[0038] FIG. 28 illustrates a method of a cluster of base stations that is serving a UE, according to embodiments herein. 4 P65105WO14883-6495-3844\1

[0039] FIG. 29 illustrates a method of a UE being served by a cluster of base stations, according to embodiments herein.

[0040] FIG. 30 illustrates a method of a UE that is served by a cluster of base stations, according to embodiments herein.

[0041] FIG. 31 illustrates a method of a cluster of base stations that is serving a UE, according to embodiments herein.

[0042] FIG. 32 illustrates an example architecture of a wireless communication system, according to embodiments disclosed herein.

[0043] FIG. 33 illustrates a system for performing signaling between a wireless device and a network device, according to embodiments disclosed herein. DETAILED DESCRIPTION

[0044] Various embodiments are described with regard to a UE. However, reference to a UE is merely provided for illustrative purposes. The example embodiments may be utilized with any electronic component that may establish a connection to a network and is configured with the hardware, software, and / or firmware to exchange information and data with the network. Therefore, the UE as described herein is used to represent any appropriate electronic component.

[0045] In some wireless systems, a cell-free network architecture provides an adaptive / dynamic and UE-centric distribution of functionalities that may be associated with a “serving cell” as understood in the context of prior cell-based network architectures (e.g., such as an NR network architecture or an LTE network architecture). With respect to the present disclosure, it may be understood generally that a “cluster” or “serving cluster” of a UE is a set of physically and / or logically connected base stations over which functionalities related to serving the UE (e.g., traditional serving cell functionalities used in cell-based network architectures) may be distributed. Accordingly, (the concept of) a cluster may, under some perspectives, “replace” (the concept of) a serving cell of a UE as understood for prior cell-based networks.

[0046] A cluster may have a one-to-one mapping with a UE. Thus, separate (logical) clusters for each of two UEs may be understood / cognizable (even when each of the two corresponding clusters is made up of the same physical set of base stations). Further, note that a single base station may simultaneously belong to multiple clusters that each serve different UEs. 5 P65105WO14883-6495-3844\1

[0047] FIG. 1 illustrates a diagram 100 for an example of clustering in a cell-free network architecture, according to embodiments discussed herein. A first cluster 102 of base stations serves a first UE 104 and a second cluster 106 of base stations serves the second UE 108. As illustrated, the first cluster 102 includes the first base stations 110 and the second base stations 112, while the second cluster 106 includes the second base stations 112 and the third base station 114.

[0048] Base stations in a same cluster are not necessarily required to jointly transmit / receive to / from the UE being served. Further, control plane and / or user plane functionalities may be dynamically distributed among the base stations in the cluster.

[0049] A clustering control function (CCF) may be defined as one or more logical function sets for the establishment and control of clusters in the wireless communication system. The CCF may be a distributed entity of the wireless communication system. For example, the CCF may be distributed across one or more of the core network, a RAN intelligent controller (RIC), and / or one or more base station(s) of the RAN.

[0050] The CCF may dynamically develop, update, control, and schedule UE-centric connected sets of clusters in certain geographical areas based on, for example: traffic, latency, reliability, coverage, interference, sensing, mobility, cell load, radio resource management (RRM) aspects, radio link quality, backhaul ideality, location, quality of service (QoS) requirements, and / or measurement reports, etc.

[0051] In some wireless communication systems, clustering in cell-free networks includes concepts such as a UE-centric cluster, a CCF, connected base stations (cBSs) (e.g., base stations that are part of a cluster serving a UE), neighboring un-connected base stations (uBSs) (e.g., neighboring base stations to a UE that are not currently part of a cluster serving the UE), etc. In some such systems, a CCF includes functionalities, protocols, message exchange capabilities, and the like that may be used for cluster establishment and / or update tasks (among other things). UEs and base stations may include corresponding functionalities, protocols, message exchange capabilities, and the like supporting the use of clustering as described herein.

[0052] In wireless communication systems implementing cell-free networks, it may be that cell-free radio resource control (RRC) connection establishment and maintenance messaging protocols are used. This may mean, among other things, that an RRC state of a UE is understood, with respect to the network generally (rather than with respect to a particular serving cell). 6 P65105WO14883-6495-3844\1

[0053] Further, such wireless communication systems for cell-free networks may use one or more cluster establishment options corresponding to an initial access of the UE and / or to cluster updating mechanisms (e.g., that control the composition of base stations in the cluster after the UE’s initial access). These may include, for example, “greedy”, downlink (DL)-based, uplink (UL)-based, and / or real-time methodologies (and any corresponding message exchanges). Radio Bearer Latency Requirements

[0054] Suppose that C represents a cluster for a given UE (that is made up of one or more base stations serving the UE). The UE has a single RRC entity with the network. The cluster includes relevant base stations to the UE (where such relevance could be defined, for example, based on signal quality and / or mobility prediction, etc.).

[0055] Further, the UE is capable of establishing one or more protocol data unit (PDU) sessions, where each PDU session includes one or more radio bearers. In some such cases, service data adaptation protocol (SDAP) layer entities are in a one-to-one correspondence with PDU sessions. SDAP entities group quality of service (QoS) flows with similar requirements and then map these to a radio bearer. In various circumstances, it may be understood that QoS requirements (in particular, latency requirements) within each particular radio bearer are static for at least a period of time.

[0056] FIG. 2 illustrates a diagram 200 showing portions of protocol stacks corresponding to a first PDU session 202 and a second PDU session 204, according to embodiments herein. As illustrated, a first SDAP entity 206 corresponds to the first PDU session 202, while a second SDAP entity 208 corresponds to the second PDU session 204.

[0057] Suppose that D is a set of radio bearers used by the UE. These radio bearers are in a one-to-one correspondence with PDCP entities that exist beneath the SDAP entities in the protocol stack scheme.

[0058] For example, the diagram 200 of FIG. 2 illustrates a case corresponding to a set of data radio bearers (DRBs) D = {DRB1, DRB2, DRB3}. The diagram 200 illustrates a first PDCP entity 210 corresponding to a first radio bearer 212 (DRB1) and a second PDCP entity 214 corresponding to a second radio bearer 216 (DRB2) that each serve the first SDAP entity 206. Further, a third PDCP entity 218 corresponding to a third radio bearer 220 (DRB3) serves the second SDAP entity 208.

[0059] Note that a physical location for SDAP and / or PDCP entities may not necessarily be strictly specified. For example, options for the physical location for SDAP and / or PDCP 7 P65105WO14883-6495-3844\1entity(s) may be the same as those available for, for example, a user plane function (UPF) of a 5G wireless communication system.

[0060] It is noted that with respect to the diagram 200, it should be understood that the UE is served by a single cluster C, and according to a single RRC entity. Radio Protocol in Cell-Free Networks

[0061] In some wireless communication systems, “cluster partitioning” represents a radio-bearer-specific dynamic partition of a cluster serving a UE into logical sub-clusters. Such a cluster partitioning into sub-clusters may be determinative of a protocol stack architecture that applies with respect to that cluster. For example, sub-clusters according to the partitioning may be in one-to-one correspondence with RLC entities. Base stations in a same sub-cluster may then, for example, each carry copy of the same logical RLC entity for a given radio bearer.

[0062] FIG. 3 illustrates a diagram 300 showing aspects of radio protocol use in cell-free network mechanisms, according to embodiments discussed herein. A UE 302 is served by a cluster 304. Within the cluster 304, there is a first sub-cluster 306 that corresponds to a first RLC entity 310 used between the UE 302 and the cluster 304, and a second sub-cluster 308 that corresponds to a second RLC entity 312 between the UE 302 and the cluster 304. The first RLC entity 310 and the second RLC entity 312 are RLC entities used by a PDCP entity 318 that corresponds to a radio bearer between the UE 302 and the cluster 304, and that uses the illustrated cluster partitioning.

[0063] As illustrated, the first RLC entity 310 is synchronized 314 across the base stations of the first sub-cluster 306 (BS1, BS2, and BS3). This means that, for example, each of these base stations has and operates according to a copy of the first RLC entity 310, as shown. Further, the second RLC entity 312 is synchronized 316 across the base stations of the second sub-cluster 308 (BS4, BS5, and BS6). This means that, for example, each of these base stations has and operates according to a copy of the second RLC entity 312, as shown. Note that, as illustrated, the arrangement of particular base stations of the cluster into the first sub-cluster 306 or second sub-cluster 308 may be transparent to the UE (the UE knows about / operates in terms of the first RLC entity 310 and the second RLC entity 312 (in terms of the sub-clusters), without consideration with respect to particular base stations underlying those RLC entities / sub-clusters).

[0064] In the illustrated case, a first packet 320 of the radio bearer corresponding to the PDCP entity 318 is handled at the first RLC entity 310. This ultimately means that the first packet 320 is communicated between the UE 302 and the cluster 304 via one or more of the 8 P65105WO14883-6495-3844\1base stations of the first sub-cluster 306. Further, a second packet 322 of the (same) radio bearer corresponding to the PDCP entity 318 is handled at the second RLC entity 312. This ultimately means that the second packet 322 is communicated between the UE 302 and the cluster 304 via one or more of the base stations of the second sub-cluster 308.

[0065] It is contemplated that a cluster partitioning may be updated over time. Establishment and / or updating of a cluster partitioning may take into account QoS requirements and traffic properties associated with a radio bearer. For example, latency constraints, and / or traffic periodicity may be considered. These mechanisms allow the network (e.g., a CCF) to optimally configure sub-cluster-enabled multi-connectivity of a UE to a cluster in, for example, a non-ideal backhaul scenario (where different partitionings of a same cluster may have appreciably different QoS / traffic management characteristics).

[0066] In some wireless communication systems, radio protocols in cell-free networks utilize concepts such as cluster partitioning / sub-clusters, RLC synchronization, etc. A functionality for control over dynamically updating cluster partitions, and a corresponding protocol for the update procedure, may be used. PDCP data routing options and a corresponding configuration may be used. Finally, a cell-free radio bearer configuration and / or a message exchange procedure for radio bearer establishment may be used. Creation of RLC Entities Based on Latency Analysis

[0067] For each radio bearer, thea cluster into one or more sub-clusters. Take as a partition of the cluster C into sub-clusters S for a radio bearer d D, where = , s.t. = C and ∩ = ∅, ∀i ≠ j, ∀d. Each ∈ is inan identical copy at each base station b ∈ .

[0068] Base stations within a same sub-cluster may synchronize a shared RLC buffer status, which adds some delay for the transmission. Relevant assumptions corresponding to this synchronization may include that a latency of synchronization between base stations of a sub-cluster is tolerable for the traffic of radio bearer d, and / or that the synchronization is physically feasible by the network deployment (e.g., the capacity of relevant Xn connections is sufficient).

[0069] FIG. 4 illustrates a diagram 400 showing a portion of a protocol stack 402 and its visualized application within a corresponding cluster 404, according to embodiments discussed herein. The cluster 404 includes the first base station 406 (BS1), the second base 9 P65105WO14883-6495-3844\1station 408 (BS2), and the third base station 410 (BS3), and serves the UE 412, as illustrated.

[0070] The corresponding protocol stack 402 includes a first PDCP entity 414 for serving a first radio bearer and a second PDCP entity 416 for serving a second radio bearer (with each of the first PDCP entity 414 and the second PDCP entity 416 operating under a same SDAP entity 418 of the protocol stack 402).

[0071] The diagram 400 illustrates that, for the first radio bearer served by the first PDCP entity 414, a partitioning of the cluster 404 uses a first sub-cluster 420 that includes each of the first base station 406, the second base station 408, and the third base station 410 (all of the base stations of the cluster 404).

[0072] The first sub-cluster 420 corresponds to the first RLC entity 422 (RLC 1-1) that serves the first PDCP entity 414. Accordingly, each of the first base station 406, the second base station 408, and the third base station 410 is synchronized to the first RLC entity 422, with respect to the first radio bearer (this is noted next to each of the first base station 406, the second base station 408, and the third base station 410 in the diagram 400).

[0073] In the diagram 400, the first radio bearer served by the first PDCP entity 414 may be, for example, a best-effort radio bearer.

[0074] The diagram 400 further illustrates that, for a second radio bearer served by the second PDCP entity 416, a partitioning of the cluster 404 uses a second sub-cluster 424 that uses the first base station 406 and the second base station 408 and a third sub-cluster 426 that uses the third base station 410.

[0075] The second sub-cluster 424 corresponds to the second RLC entity 428 (RLC 2-1) that serves the second PDCP entity 416. Accordingly, each of the first base station 406 and second base station 408 is synchronized to the second RLC entity 428, with respect to the second radio bearer (this is noted next to each of the first base station 406 and the second base station 408 in the diagram 400).

[0076] Further, the third sub-cluster 426 corresponds to the third RLC entity 430 (RLC 2-2) that serves the second PDCP entity 416. Accordingly, the third sub-cluster 426 uses the third RLC entity 430 with respect to the second radio bearer (this is noted next to the third base station 410 in the diagram 400).

[0077] In the diagram 400, the second radio bearer served by the second PDCP entity 416 may be, for example, a radio bearer with a guaranteed low-latency. Cell-Free Procedures Timescales 10 P65105WO14883-6495-3844\1

[0078] Procedures of cell-free networks may operate according to various timescales and / or be managed by various entities.

[0079] A first set of functionalities for a cell-free network include non-real-time functionalities. Non-real-time functionalities may occur on the order of seconds, and may be managed by a CCF.

[0080] Non-real-time functionalities may take as input one or more of (for example): inter- base-station exchange (Xn interface) latency, radio bearer(s) configuration information, and / or UE capabilities.

[0081] Non-real-time functionalities may take one or more decisions, such as (for example): determinations of a base station identification / assignment to cluster, establishment of sub-clusters and corresponding RLC entities for each radio bearer of the cluster, and the establishment of medium access control (MAC) entities within a protocol stack, including the identification of base stations to MAC entities and / or the identification of MAC entities to RLC entities.

[0082] A second set of functionalities for a cell-free network include near-real-time functionalities. Near-real-time functionalities may occur on the order of dozens to hundreds of milliseconds, and may be managed by a layer 3 (L3) scheduler. The L3 scheduler may be an L3 procedure that is implemented in the network. It may dynamically (e.g., at a given transmission time interval (TTI) and / or a given set of multiple TTIs) form, update, and / or schedule UE-specific sub-clusters and base stations’ logical states. This may occur upon request and / or based on applicable QoS requirements and / or measurement reports, etc. In some embodiments, the L3 scheduler is implemented as part of a CCF (but this is not required – the L3 scheduler can alternatively reside separately from the CCF in the wireless communication system).

[0083] Near-real-time functionalities may take as input one or more of (for example): propagation delay between a UE to one or more base stations, base station state information (load information, signal quality information, etc.), and / or traffic statistics.

[0084] Near-real-time functionalities may take one or more decisions, such as (for example): determinations with respect to physical (PHY) layer restrictions, such as propagation delay and / or synchronization impairments; determinations with respect to the MAC layer, including a transport block (TB) number configuration and / or a scheduling pattern agreement; determinations with respect to a MAC scheduler, including a selection of responsible base stations and establishment of resource allocation chains; determinations 11 P65105WO14883-6495-3844\1with respect to RLC-to-MAC links activation; and / or determinations with respect to PDCP-to-RLC links, including for traffic routing and / or duplication.

[0085] A third set of functionalities for a cell-free network includes real-time functionalities (e.g., that are meant to occur as soon as possible). Real-time functionalities may occur on the order of milliseconds (ms) or even less than ms, and may be managed by a MAC scheduler.

[0086] Real-time functionalities may take as input one or more of (for example): channel state information (CSI), buffer statuses, and / or scheduling metrics.

[0087] Real-time functionalities may take one or more decisions, such as (for example): determinations with respect to a MAC scheduler, including coordination message exchanges, radio resource allocations, and / or LAs; determinations with respect to a MAC layer, including layer 3 (L2) data processing; and determinations with respect to a physical layer (PHY layer), including multi user multiple input multiple output (MU-MIMO) precoding and / or layer 2 (L1) data transmission and / or reception. Embodiments of Cell-Free MAC Scheduling

[0088] MAC scheduling as cell-free networks having characteristics described herein are now discussed. MACmay be performed by a MAC entity. A MAC entity may be understood to serve one or more RLC entity(s) (and thus one or more sub-cluster(s)). The MAC entity can operate with respect to one, some, and / or all of the base stations for an RLC / sub-cluster that it serves (as the case may be). A MAC entity, as described herein, may be responsible for performing MAC scheduling across its constituent base stations corresponding to a data packet received from an RLC entity that the MAC entity serves.

[0089] A first option for MAC scheduling may be referred to as “joint decision making.” In joint decision making cases, a MAC resource allocation decision is made jointly / collectively by all of the base stations in a sub-cluster.

[0090] FIG. 5 illustrates a diagram 500 showing a portion of a protocol stack 502 and its visualized application within a cluster 504 serving a UE 506, corresponding to a case of MAC scheduling using joint decision making, according to embodiments discussed herein. As illustrated, the cluster 504 uses the first base station 514 (BS1), the second base station 516 (BS2), and the third base station 518 (BS3) to serve the UE 506.

[0091] The diagram 500 illustrates a PDCP entity 508 corresponding to a radio bearer that is served by an RLC entity 510 representing a sub-cluster that includes each of the first base 12 P65105WO14883-6495-3844\1station 514 (BS1), the second base station 516 (BS2) and the third base station 518 (BS3), in the manner discussed herein.

[0092] The diagram 500 further illustrates that the RLC entity 510 is itself served by a MAC entity 512 that can perform MAC scheduling using the first base station 514, the second base station 516, and the third base station 518. Note that the bounds of the MAC entity 512 as illustrated in the cluster 504 may be understood directly in terms of the MAC entity 512, rather than the RLC entity 510 (though these bounds are co-extensive in this case).

[0093] An example of joint decision making is now described. An initial decision is made by one of the base stations (e.g., the first base station 514) and provided to the other base stations (e.g., the second base station 516 and the third base station 518) (e.g., via Xn interface). In some cases, several rounds of similar message exchanges are possible. At the minimum, at least one round of message exchange is used. Accordingly, it will be understood that in joint decision making cases, a resource allocation decision can be made for a TTI that is in the future by at least an Xn latency time corresponding to the at least one round of message exchange. Therefore, the use of joint decision making may be understood to add an Xn latency to a scheduling latency for the MAC entity 512.

[0094] Joint decision making may accordingly be understood to enable a high spectral efficiency across the first base station 514, the second base station 516, and the third base station 518 at the cost of additional MAC scheduling latency. It may therefore be a good choice for cases of latency-tolerant traffic.

[0095] A second option for MAC scheduling may be referred to as “centralized decision making.” In centralized decision making cases, a resource allocation decision is made in a decentralized manner by the base stations across the different sub-clusters.

[0096] FIG. 6 illustrates a diagram 600 showing a portion of a protocol stack 602 and its visualized application within a cluster 604, corresponding to a case of MAC scheduling using centralized decision making, according to embodiments discussed herein. As illustrated, the cluster 604 uses the first base station 614 (BS1), the second base station 620 (BS2), and the third base station 626 (BS3) to serve the UE 606.

[0097] The diagram 600 illustrates a PDCP entity 608 corresponding to a radio bearer that is served by a first RLC entity 610 representing a first sub-cluster that includes the first base station 614 (BS1), a second RLC entity 616 representing a second sub-cluster that includes the second base station 620 (BS2), and a third RLC entity 622 representing a third sub-cluster that includes the third base station 626 (BS3), in the manner discussed herein. 13 P65105WO14883-6495-3844\1

[0098] The diagram 600 further illustrates that first RLC entity 610 is itself served by a first MAC entity 612 that can perform MAC scheduling using the first base station 614, that the second RLC entity 616 is served by a second MAC entity 618 that can perform MAC scheduling using the second base station 620, and that the third RLC entity 622 is served by a third MAC entity 624 that can perform MAC scheduling using the third base station 626. Note that the bounds of each of the first MAC entity 612, the second MAC entity 618, and the third MAC entity 624 as illustrated in the cluster 604 should be understood directly in terms of the respective MAC entity rather than bounds of any corresponding RLC entity (though the MAC entity bounds are co-extensive to the corresponding RLC entity bounds in this case).

[0099] As an example of centralized decision making is now described, the first base station 614, the second base station 620, and the third base station 626 agree to a resource-sharing pattern (in the time, frequency and / or spatial domain(s)) for a period of time. For example, they may agree to let each base station K as selected from the first base station 614, the second base station 620, and the third base station 626 schedule the UE 606 in TTIs T, such that T mod 3 = K (where K is a different integer value from 1 to 3 corresponding to the three base stations under discussion).

[0100] In another example, in the case that the UE 606 is a multi-antenna UE, the first base station 614, the second base station 620, and the third base station 626 may agree to a split of the frequency band and / or spatial domain as between the first base station 614, the second base station 620, and / or the third base station 626.

[0101] Then, each of the first base station 614, the second base station 620, and the third base station 626 decides (e.g., in real time) to schedule the UE 606 in a manner that complies with the resource-sharing pattern. These decisions may be taken autonomously at each base station (without a need to check with and / or gain consensus from any other base station).

[0102] Decentralized decision making may accordingly be understood not to incur the additional latency penalty that is described herein in relation the joint decision making case but might ultimately achieve less spectral efficiency as compared with the joint decision making case.

[0103] A third option for MAC scheduling may be referred to as “semi-decentralized decision making” or “mixed mode decision making.” In mixed mode decision making cases, a resource allocation decision is made in a mixed-mode / semi-decentralized manner that uses 14 P65105WO14883-6495-3844\1joint decision making between base stations within a sub-cluster and further uses decentralized decision making across the different sub-clusters.

[0104] FIG. 7 illustrates a diagram 700 showing a portion of a protocol stack 702 and its visualized application within a cluster 704, corresponding to a case of MAC scheduling using mixed mode decision making, according to embodiments discussed herein. As illustrated, the cluster 704 uses the first base station 714 (BS1), the second base station 720 (BS2), and the third base station 722 (BS3) to serve the UE 706.

[0105] The diagram 700 illustrates a PDCP entity 708 corresponding to a radio bearer that is served by a first RLC entity 710 representing a first sub-cluster that includes the first base station 714 (BS1) and the second base station 720 (BS2), and a second RLC entity 716 representing a second sub-cluster that includes the third base station 722 (BS3), in the manner discussed herein.

[0106] The diagram 700 further illustrates that first RLC entity 710 is itself served by a first MAC entity 712 that can perform MAC scheduling using the first base station 714 and the second base station 720 and that the second RLC entity 716 is served by a second MAC entity 718 that can perform MAC scheduling using the third base station 722. Note that the bounds of each of the first MAC entity 712 and the second MAC entity 718, as illustrated in the cluster 704, should be understood directly in terms of the respective MAC entity (rather than the bounds of any corresponding RLC entity). While in this case the first MAC entity 712 covers all base stations of the sub-cluster of the first RLC entity 710, this should be understood by way of example only (it is possible that a MAC entity covers fewer than all base stations of an RLC entity / sub-cluster that it serves).

[0107] Under mixed mode decision making, a joint decision making resource allocation occurs between base stations that belong to the same sub-cluster (independently of other base stations of other different sub-cluster(s)). For example, the first base station 714 and the second base station 720 that are within the sub-cluster corresponding to the first RLC entity 710 might use a message exchange (e.g., analogously to the joint decision making mechanism of FIG. 5) to coordinate their transmissions when they are simultaneously used for joint MAC scheduling (e.g., as may be the case according to the first MAC entity 712). This message exchange / coordination may occur without a check to and / or consensus from any base station from outside of the cluster (such as the third base station 722).

[0108] Further, base stations across different sub-clusters might agree to a resource- sharing pattern (in the time, frequency and / or spatial domain(s)) for a period of time that is used as between those base stations, where the resources are split on a MAC entity basis. 15 P65105WO14883-6495-3844\1For example, the base stations of the first MAC entity 712 (the first base station 714 and the second base station 720) might agree with the base stations of the second MAC entity 718 (the third base station 722) on a resource-sharing pattern (in the time, frequency, and / or spatial domain(s)) for a period of time that splits resources as between the first MAC entity 712 and the second MAC entity 718 (e.g., analogously to the decentralized decision making mechanism of FIG. 6).

[0109] It may be understood that a use of a joint decision making resource allocation task at the sub-cluster level may involve a more tolerable / lower Xn latency / MAC scheduling latency penalty incurred as between the base stations of the sub-cluster than that which may be incurred in the alternative case of joint decision making across all base stations of the full cluster (as was described in relation to FIG. 5). Further, due the use of MAC-level decentralized resource allocation, spectral efficiency across the cluster may be improved at least somewhat over a case where decentralized decision making is taken at each individual base station of the full cluster, as was described in relation to FIG. 6. Accordingly, the mixed mode decision making mechanism may be understood to provide a trade-off between the competing spectral efficiency and latency considerations under discussion.

[0110] Note that in cases where, as illustrated in FIG. 7, there is a single radio bearer in use at the cluster, in order to implement mixed mode decision making, it is sufficient to have MAC entities and RLC entities in a 1-1 correspondence with MAC entities associated with the entire set of base stations of the corresponding RLC entity. However, support for the use of mixed mode decision making in cases corresponding to larger degrees of freedom within the cluster (for example, where there are multiple radio bearers using different RLC entities arranged according to differing sub-cluster partitionings, where MAC entities may or may not be coextensive with an RLC entity that they serve) may involve further considerations.

[0111] Embodiments herein describe procedures, mechanisms, and protocols for supporting the use of joint decision making, decentralized decision making, and / or mixed mode decision making within a cluster that account for degrees of freedom in the cluster with respect to, for example, a number of radio bearers, the sub-cluster partitionings for each radio bearer, whether a MAC entity serving an RLC entity is coextensive with that RLC entity, etc. Procedures for the creation of multiple MAC entities that may be used to support joint decision making, decentralized decision making, and / or mixed decision making options of MAC scheduling for one or multiple DRBs of the UE are discussed. Aspects of MAC entity to RLC entity connectivity are discussed. Examples for the 16 P65105WO14883-6495-3844\1simultaneous operation of several MAC entities, including grant allocation concepts, are discussed. Mechanisms for the near real-time activation and / or deactivation of MAC entity to RLC entity connections that take into account UE capabilities and avoid blockages of DRB traffic are discussed. Finally, aspects with respect to coordination between different MAC entities are discussed. Embodiments of MAC Entity Establishment

[0112] FIG. 8 illustrates a diagram 800 showing a cluster 802 of base stations and MAC entity options 812 for that cluster, according to embodiments discussed herein. The cluster 802 serves the UE 810 using the first base station 804 (BS1), the second base station 806 (BS2) and the third base station 808 (BS3).

[0113] With respect to the cluster 802, the following MAC entity options 812 exist. A first MAC entity option may be for a first MAC entity 814 that uses the first base station 804. A second MAC entity option may be for a second MAC entity 816 that uses the second base station 806 and a third MAC entity option may be for a third MAC entity 818 that uses the third base station 808. A fourth MAC entity option may be for a fourth MAC entity 820 that uses the first base station 804 and the second base station 806. A fifth MAC entity option may be for a fifth MAC entity 822 that uses the first base station 804 and the third base station 808. A sixth MAC entity option may be for a sixth MAC entity 824 that uses the second base station 806 and the third base station 808. A seventh MAC entity option may be for a seventh MAC entity 826 that uses the first base station 804, the second base station 806, and the third base station 808.

[0114] With respect to designs for MAC entities, it may be that each MAC entity created with respect to / for a UE is associated with a unique set of base stations of the cluster serving that UE. It may be that a MAC entity can be connected to (can potentially serve) an RLC entity if the delays provided by a Xn latency of inter-base-station communication within the MAC entity and by MAC scheduling coordination are acceptable for that RLC entity. It may be that such a connection between an RLC entity and a MAC entity can be activated and / or deactivated (such that the MAC entity begins actively serving / stops actively serving the RLC entity) at a near-real time timescale.

[0115] Note that a timescale of decision making for MAC entity creation is generally longer than the timescale for RLC entity to MAC entity connection activation / deactivation. For example, MAC entity creation is typically a non-real time process, where the set of created MAC entities may be updated on the order of, e.g., seconds. However, the activation 17 P65105WO14883-6495-3844\1of a MAC entity to RLC entity connection may be a near-real time process (a faster process) that may occur on the order of dozens or hundreds of milliseconds.

[0116] A MAC entity M can be understood in terms of a set of base stations it belongs to (i.e., M C). Each base station b M has an identical copy of this MAC entity. MAC entity M is assumed / considered to be connected to RLC entity of radio bearer d if thelatency of M data processing are acceptable for RLC entity . Onceestablished, this connection might be a subject of activation deactivation.

[0117] In some embodiments, the relation M on the corresponding subsets of base stations should be satisfied.

[0118] A single RLC entity may be connected to one or multiple MAC entities. A single MAC entity may be connected to one or multiple RLC entities. MAC entities that are not connected to any RLC entity may be discarded / not used / forbidden. MAC entities of the same UE may not assume synchronization with each other (rather, they are each understood to act and make decisions independently from other MAC entities).

[0119] FIG. 9 illustrates a diagram 900 showing a portion of a protocol stack 902 and its visualized application within a cluster 904, according to embodiments discussed herein. As illustrated, the cluster 904 uses the first base station 916 (BS1), the second base station 922 (BS2), and the third base station 928 (BS3) to serve the UE 906.

[0120] The diagram 900 illustrates a first PDCP entity 908 corresponding to a first radio bearer between the network and the UE 906 and a second PDCP entity 910 corresponding to a second radio bearer between the network and the UE 906.

[0121] The diagram 900 illustrates that, for the first radio bearer served by the first PDCP entity 908, a partitioning of the cluster 904 uses a first sub-cluster 930 that includes each of the first base station 916, the second base station 922, and the third base station 928 (all of the base stations of the cluster 904).

[0122] The first sub-cluster 930 corresponds to the first RLC entity 912 (RLC 1-1) that serves the first PDCP entity 908. Accordingly, each of the first base station 916, the second base station 922, and the third base station 928 is synchronized to the first RLC entity 912 with respect to the first radio bearer (this is noted next to each of the first base station 916, the second base station 922, and the third base station 928 in the diagram 900).

[0123] The diagram 900 further illustrates that, for the second radio bearer served by the second PDCP entity 910, a partitioning of the cluster 904 uses a second sub-cluster 932 that 18 P65105WO14883-6495-3844\1uses the first base station 916 and the second base station 922 and a third sub-cluster 934 that uses the third base station 928.

[0124] The second sub-cluster 932 corresponds to the second RLC entity 918 (RLC 2-1) that serves the second PDCP entity 910. Accordingly, each of the first base station 916 and second base station 922 is synchronized to the second RLC entity 918 with respect to the second radio bearer (this is noted next to each of the first base station 916 and the second base station 922 in the diagram 900).

[0125] Further, the third sub-cluster 934 corresponds to the third RLC entity 924 (RLC 2-2) that serves the second PDCP entity 910. Accordingly, the third base station 1010 uses the third RLC entity 924 with respect to the second radio bearer (this is noted next to the third base station 928 in the diagram 900).

[0126] As illustrated, the first MAC entity 914 (MAC1) includes the first base station 916, the second base station 922, and the third base station 928; the second MAC entity 920 (MAC2) includes the first base station 916 and the second base station 922; and the third MAC entity 926 (MAC3) includes the third base station 928. The first MAC entity 914, the second MAC entity 920, and the third MAC entity 926 are examples of valid MAC entities that may be created / used with respect to the arrangement of the protocol stack 902 and the cluster 904 as described. This is because each of these MAC entities fulfill the requirement M for at least one (e.g., that a MAC entity is some subset of base stations from at least one sub-clusterby at least one radio bearer / PDCP entity).

[0127] Note that other valid MAC entities (not illustrated) are also possible / valid (meet at least one instance of M ) with respect to the illustrated configuration. However, it may be that these other MAC entities may not have been established / created for the illustrated case (because, for example, it was determined that the illustrated MAC entities represent a full and valid configuration for use). Embodiments of MAC Entity Establishment and Creation

[0128] FIG. 10A, FIG. 10B, and FIG. 10C illustrate a diagram 1000 showing a portion of a protocol stack 1002 and its visualized application within a cluster 1004, according to embodiments discussed herein. As illustrated, the cluster 1004 uses the first base station 1006 (BS1), the second base station 1008 (BS2), and the third base station 1010 (BS3) to serve the UE 1012.

[0129] Starting with FIG. 10A: the diagram 1000 illustrates a first PDCP entity 1014 corresponding to a first radio bearer (DRB1) between the network and the UE 1012, a 19 P65105WO14883-6495-3844\1second PDCP entity 1016 corresponding to a second radio bearer (DRB2) between the network and the UE 1012, and a third PDCP entity 1018 corresponding to a third radio bearer (DRB3) between the network and the UE 1012.

[0130] The diagram 1000 illustrates that, for the first radio bearer served by the first PDCP entity 1014, a partitioning of the cluster 1004 uses a first sub-cluster 1032 that includes each of the first base station 1006, the second base station 1008, and the third base station 1010 (all of the base stations of the cluster 1004).

[0131] The first sub-cluster 1032 corresponds to the first RLC entity 1020 (RLC 1-1) that serves the first PDCP entity 1014. Accordingly, each of the first base station 1006, the second base station 1008, and the third base station 114 is synchronized to the first RLC entity 1020 with respect to the first radio bearer (this is noted next to each of the first base station 1006, the second base station 1008, and the third base station 1010 in the diagram 1000).

[0132] The diagram 1000 further illustrates that, for the second radio bearer served by the second PDCP entity 1016, a partitioning of the cluster 1004 uses a second sub-cluster 1034 that uses the first base station 1006 and the second base station 1008 and a third sub-cluster 1036 that uses the third base station 1010.

[0133] The second sub-cluster 1034 corresponds to the second RLC entity 1022 (RLC 2-1) that serves the second PDCP entity 1016. Accordingly, each of the first base station 1006 and second base station 1008 is synchronized to the second RLC entity 1022 with respect to the second radio bearer (this is noted next to each of the first base station 1006 and the second base station 1008 in the diagram 1000).

[0134] Further, the third sub-cluster 1036 corresponds to the third RLC entity 1024 (RLC 2-2) that serves the second PDCP entity 1016. Accordingly, the third sub-cluster 1036 uses the third RLC entity 1024 with respect to the second radio bearer (this is noted next to the third base station 1010 in the diagram 1000).

[0135] The diagram 1000 further illustrates that, for the third radio bearer served by the third PDCP entity 1018, a partitioning of the cluster 1004 uses a fourth sub-cluster 1038 that uses the first base station 1006, a fifth sub-cluster 1040 that uses the second base station 1008, and a sixth sub-cluster 1042 that uses the third base station 1010.

[0136] The fourth sub-cluster 1038 corresponds to a fourth RLC entity 1026 (RLC 3-1) that serves the third PDCP entity 1018. Accordingly, the first base station 1006 uses the fourth RLC entity 1026 with respect to the third radio bearer (this is noted next the first base station in the diagram 1000). 20 P65105WO14883-6495-3844\1

[0137] Further, the fifth sub-cluster 1040 corresponds to the fifth RLC entity 1028 (RLC 3-2) that serves the third PDCP entity 1018. Accordingly, the second base station 1008 uses the fifth RLC entity 1028 with respect to the third radio bearer (this is noted next to the second base station 1008 in the diagram 1000).

[0138] Still further, the sixth sub-cluster 1042 corresponds to the sixth RLC entity 1030 (RLC 3-3) that serves the third PDCP entity 1018. Accordingly, the third base station 1010 uses the sixth RLC entity 1030 with respect to the third radio bearer (this is noted next to the third base station 1010 in the diagram 1000).

[0139] A procedure for establishing the MAC entities that will be created within the described structure is now discussed. Preliminarily, a listing of all possible MAC entities M satisfying M is determined. With respect to the protocol stack 1002 as described to this point, there is at least one sub-cluster that uses each of the first base station 1006, the second base station 1008 and the third base station 1010 (e.g., the first sub-cluster 1032 corresponding to the first RLC entity 1020), so a first MAC entity 1044 that uses each of the first base station 1006, the second base station 1008, and the third base station 1010 is possible.

[0140] Further, there is at least one sub-cluster that uses each of the second base station 1008 and the third base station 1010 (e.g., the first sub-cluster 1032 corresponding to the first RLC entity 1020), so a second MAC entity 1046 that uses each of the second base station 1008 and the third base station 1010 is possible.

[0141] Still further, there is at least one sub-cluster that uses each of the first base station 1006 and the third base station 1010 (e.g., the e.g., the first sub-cluster 1032 corresponding to the first RLC entity 1020), so a third MAC entity 1048 that uses each of the first base station 1006 and the third base station 1010 is possible.

[0142] Still further, there is at least one sub-cluster that uses each of the first base station 1006 and the second base station 1008 (e.g., either / each of the first sub-cluster 1032 corresponding to the first RLC entity 1020 and the second sub-cluster 1034 corresponding to the second RLC entity 1022), so a fourth MAC entity 1050 that uses each of the first base station 1006 and the second base station 1008 is possible.

[0143] Still further, there is at least one sub-cluster that uses the first base station 1006 (e.g., either / each of the first sub-cluster 1032 corresponding to the first RLC entity 1020, the second sub-cluster 1034 corresponding to the second RLC entity 1022, and the fourth sub-cluster 1038 corresponding to the fourth RLC entity 1026), so a fifth MAC entity 1052 that uses the first base station 1006 is possible. 21 P65105WO14883-6495-3844\1

[0144] Still further, there is at least one sub-cluster that uses the second base station 1008 (e.g., either / each of the first sub-cluster 1032 corresponding to the first RLC entity 1020, the second sub-cluster 1034 corresponding to the second RLC entity 1022, and the fifth sub-cluster 1040 corresponding to the fifth RLC entity 1028), so a sixth MAC entity 1054 that uses the second base station 1008 is possible.

[0145] Finally, there is at least one sub-cluster that uses the third base station 1010 (e.g., either / each of the first sub-cluster 1032 corresponding to the first RLC entity 1020, third sub-cluster 1036 corresponding to the third RLC entity 1024, and the sixth sub-cluster 1042 corresponding to the sixth RLC entity 1030), so a seventh MAC entity 1056 that uses the third base station 1010 is possible.

[0146] The network may further check whether each of the MAC entities M that are possible when considering the RLC / sub-clustering arrangement of the active DRBs can operate according to a data processing and scheduling latency that is acceptable for the RLCs for that MAC entity M. In the case illustrated in FIG. 10A, the network determines is the case for each illustrated MAC entity.

[0147] As illustrated in FIG. 10A, connections may be understood / inferred between each possible MAC entity and each of the RLC entities that it may serve per structural relation (as in M ) and per the data processing and scheduling latency requirement. Note that in the illustrated case, there is at least one such connection for each possible MAC entity.

[0148] In an alternative case where a MAC entity had no connections to any RLC entities (e.g., a MAC entity did not meet the structural M requirement and / or if the MAC entity could not satisfy a data processing and scheduling latency for any RLC entity where the structural M requirement is met), it might be removed from the listing of possible MAC entities at this juncture (this is not the case / not illustrated in FIG. 10A).

[0149] From this juncture, the network may create one or more of the MAC entities of the listing. In some cases, this may be accomplished though sending the UE a message containing indication(s) for the MAC entities that can be used by the RLC entities. In some cases, these indication(s) indicate particular RLC entity(s) as capable of using particular ones of the MAC entity(s), consistent with the determinations heretofore discussed.

[0150] FIG. 10A corresponds to a case where there may be no UE-based limitation on the number of MACs created. In such a case, the network might create all of the possible entities (e.g., the network might create each of the first MAC entity 1044, the second MAC 22 P65105WO14883-6495-3844\1entity 1046, the third MAC entity 1048, the fourth MAC entity 1050, the fifth MAC entity 1052, the sixth MAC entity 1054, and the seventh MAC entity 1056.)

[0151] FIG. 10B illustrates a case of MAC entity creation where the network is configured to use as much joint resource allocation as possible between base stations in a same sub-cluster (e.g., while respecting applicable latency constraints). In such a case, the network might ultimately create only a subset of the MAC entities that use full sets of base stations within one sub-cluster. In other words, for each RLC entity, out of all connected MACs, it is assumed that the MAC associated with maximum number of base stations will be selected (or at least preferred) by the network for use with that RLC entity.

[0152] For example, FIG. 10B illustrates that in the case under discussion, the second MAC entity 1046 is not ultimately created (because there is no sub-cluster that is fully populated by only the second base station 1008 and the third base station 1010) and the third MAC entity 1048 is not ultimately created (because there is no sub-cluster that is fully populated by only the first base station 1006 and the second base station 1008). Note that FIG. 10B illustrates a case that is, like FIG. 10A, consistent with the notion that there is no UE-based limitation on the number of MACs created.

[0153] FIG. 10C illustrates a case of MAC entity creation where a UE-based limitation known to the network indicates that the UE can support only two simultaneously activated MAC entities. In UE-limited scenarios, the network may strive to create a number of MAC entities that is within the UE restriction / limit, and where each radio bearer can be served by at least one of the MAC entities (through at least one RLC entity for that radio bearer).

[0154] The example illustrated in FIG. 10C shows one of the possible decisions that may be taken by the network for the case presently under discussion. The network determines that the seventh MAC entity 1056 at the third base station 1010 can be used to allocate traffic of each of the sixth RLC entity 1030 serving DRB3 of the third PDCP entity 1018 and the third RLC entity 1024 serving DRB2 of the second PDCP entity 1016. Further, the network determines that the fourth MAC entity 1050 can be used to allocate traffic of the second RLC entity 1022 serving DRB2 of the second PDCP entity 1016 and the first RLC entity 1020 serving DRB1 of the first PDCP entity 1014. Note that while not every RLC entity within the protocol stack 1002 is capable of allocating traffic in this case, at least one RLC entity for each radio bearer can.

[0155] Consistent with these determinations and the MAC entity limitation of two at the UE, the network ultimately creates the fourth MAC entity 1050 and the seventh MAC entity 1056 (and does not create the other MAC entities, as illustrated). 23 P65105WO14883-6495-3844\1

[0156] FIG. 11 illustrates a flow diagram 1100 corresponding to MAC entity establishment and / or creation, according to embodiments discussed herein. The flow diagram 1100 illustrates operations of and between a CCF 1102, one or more RLC entity(s) 1104, and an L3 scheduler 1106.

[0157] The CCF 1102 receives 1108, from the RLC entity(s) 1104, RLC latency requirements (denoted LREQ(RLC)). These latency requirement(s) may correspond to data processing and scheduling latency(s) that are acceptable for the RLC entity(s) 1104, as is discussed herein.

[0158] The CCF 1102 then selects 1110 a candidate MAC entity (e.g., a MAC entity that is one of a listing of possible MAC entities, as is described herein).

[0159] For the selected candidate MAC entity, the CCF 1102 sends 1112, to the L3 scheduler 1106, a request for a report of a latency due to scheduler coordination for that candidate MAC entity. The CCF 1102 receives 1114, in response from the L3 scheduler 1106, the report of the latency due to scheduler coordination for that candidate MAC entity.

[0160] The CCF 1102 then proceeds to calculate 1116 an overall latency of the candidate MAC entity (denoted LMAC). The overall latency of the MAC candidate includes the latency due to scheduler coordination as received 1114 from the L3 scheduler 1106. The overall latency of the candidate MAC entity might further include / account for additional relevant durations known to the CCF 1102, such as a duration for algorithm processing, a duration corresponding to conveying the grant to the UE, and / or a duration corresponding to the period between a first TTI when a grant is provided and a second TTI for which the transmission is scheduled.

[0161] Once LMACfor the candidate MAC entity is determined, the network determines whether or not LMAC is within (e.g., is less than or equal to) LREQ(RLC) for each of the RLC entity(s) 1104 that can structurally be served by the candidate MAC entity (according to the structural M requirement). If at least one such case exists, a corresponding connection may be assumed between the candidate MAC entity and the candidate MAC entity remains on the listing of possible MAC entities. If no such case exists, the candidate MAC entity under consideration is removed as a candidate.

[0162] Note that the procedure from the selection 1110 to the determining 1118 may also be performed for additional candidate MAC entities.

[0163] The CCF 1102 then decides 1120 about the creation of the MAC entity. This decision 1120 may be taken in view of a set of candidate MAC entities for which there was at least one case for which LMAC was within an applicable LREQ(RLC). Further / additionally, 24 P65105WO14883-6495-3844\1the decision 1120 may be made on one or more bases discussed herein, such as whether or not the network is particularly configured to use as much joint resource allocation as possible, whether or not there is any UE limitation on the number of simultaneous MAC entities, etc. Transport Blocks Distribution over MACs UE may be denoted by . Further, takeTmax a UE can process / use a single TTI.Note that Tmax may be defined by / according to a capability of the UE.

[0165] A MAC entity M may be allowed to generate (up to) TMtransport blocks at a single TTI. Accordingly, TMis equal to the number of grants (DL or UL) that can be provided by MAC entity M. In various cases, the network may be configured to provide a TB distribution (e.g., on a near-real-time basis) that assigns TMfor each MAC entity M.

[0166] In cases where TM= 0, the corresponding MAC entity M may be considered to be inactive. In cases where TM> 0, the corresponding MAC entity M may be considered to be active. Let be the set of all active MACs.

[0167] of a “feasible” distribution of TMis now discussed. For a distribution of TMto be considered feasible, the assignment of TMfor each M shouldfollowing two constraints:1. TM≤ Tmax, andr R, there should be an active MAC entity M that is connected to an RLC of r.

[0168] Let be the set of all feasible distributions over M.

[0169] It may be understood that a set of allat the UE should be composed such that it supports at leastfeasible distribution . Examples of this concept are now described in terms of the protocol stack 902cluster 904 of the diagram 900, as is described above in relation to FIG. 9.

[0170] With respect to the protocol stack 902 of FIG. 9, when Tmax= 1, there are two possible feasible distributions: 1. T1= 0, T2= 1, T3= 0 2. T1 = 0, T2 = 0, T3 = 1 Note that in this case, the first MAC entity 914 cannot be used, because the radio bearer of the second PDCP entity 910 will be blocked in this case. 25 P65105WO14883-6495-3844\1

[0171] Again, with respect to the protocol stack 902 of FIG. 9, when Tmax = 2, there are five possible feasible distributions: 1. T1= 1, T2= 1, T3= 0 2. T1 = 1, T2 = 0, T3 = 1 3. T1= 0, T2= 1, T3= 1 4. T1 = 0, T2 = 2, T3 = 0 5. T1= 0, T2= 0, T3= 2 Note that in this case, at least one of the second MAC entity 920 and the third MAC entity 926 should be used to allow a radio bearer for each of the first PDCP entity 908 and the second PDCP entity 910 to communicate with the UE. RLC Entity to MAC Entity Edge Activation

[0172] With respect to discussion herein, the term “edge” is defined as a possible one-to-one connection between an existing RLC entity and an existing MAC entity. Referring to FIG. 9, it may accordingly be understood that the illustrated connections between the RLC entities and the MAC entities are examples of “edges” as discussed herein.

[0173] An “active” edge is an active (e.g., in use) connection between an RLC entity and a MAC entity for a given QoS and / or link adaptation (LA) policy requirements of radio bearer. An “inactive” edge is an inactive (e.g., not in use) connection between an RLC entity and a MAC entity for a given QoS and / or LA policy requirements of a radio bearer. It is contemplated that any given radio bearer might correspond to one or multiple active and / or inactive edges. Edges may be active / activated and / or inactive / deactivated at granularities of TTI.

[0174] One or more edges from the set of all edges for selected (created) MAC entities can be dynamically activated or deactivated based on, for example, needs for meeting different QoS and / or LA policy requirements for different bearers over time. Due to the ability to dynamically activate / deactivate the edges, an overall set of created MAC entities does not necessarily need to be adjusted to account for every change in these QoS and / or LA policy requirements for the active bearers; accordingly, processes for the creation and / or deletion of MAC entities may be performed with lower frequency as compared to an alternative mechanism where edges are not dynamically activated / deactivated. In other words, because edges may be activated and / or deactivated more efficiently compared to an outright creation and / or deletion of MAC entities, the total overhead incurred when using edge 26 P65105WO14883-6495-3844\1activation / deactivation may be relatively reduced. Activation / deactivation of one or more edges in the manner described may be performed by an L3 scheduler.

[0175] With respect to the handling of different possible QoS and / or LA policy requirements for different radio bearers, various requirements may be at play. For example, there may be a high reliability requirement for a radio bearer. Such a requirement might lead to the use of more simultaneous duplicated data transmissions via multiple MAC entities. This requirement might not require MAC entity synchronization in cases where beamforming is not used.

[0176] As another example, there may be a low latency requirement for a radio bearer. Such a requirement might lead to the use of a single TB transmission via a single MAC entity. Further, this requirement might affect the QoS and / or LA requirements of other radio bearers.

[0177] As another example, there may be a capacity requirement for a radio bearer. This requirement might lead to the use of more simultaneous non-duplicated data transmissions via multiple possible MAC entities. This requirement might not require MAC entity synchronization in cases where beamforming is not used. Examples of RLC-to-MAC Edge Activation / Deactivationof RLC-to-MAC edge activation / deactivation in the context of the protocol stack 902 that was first introduced in relation to FIG. 9. In these examples, it is assumed that Tmax= 2.

[0179] FIG. 12A illustrates a case where distribution through the protocol stack 902 of FIG. 9 corresponds to T1 = 1, T2 = 1, T3 = 0. Asdiscussed, this is a feasible distribution.

[0180] Consistent with this distribution, as shown, a first edge 1202 between the first RLC entity 912 and the first MAC entity 914 is active, a second edge 1204 between the first RLC entity 912 and the second MAC entity 920 is inactive, a third edge 1206 between the first RLC entity 912 and the third MAC entity 926 is inactive, a fourth edge 1208 between the second RLC entity 918 and the second MAC entity 920 is active, and a fifth edge 1210 between the third RLC entity 924 and the third MAC entity 926 is inactive. As no edge connected to the third MAC entity 926 is active, the third MAC entity 926 is inactive (not used) during the TTI(s) where this arrangement is used.

[0181] The activation of the first edge 1202 and the fourth edge 1208 within the context of the protocol stack 902 as shown corresponds to a case where the TB of first MAC entity 914 27 P65105WO14883-6495-3844\1is used for data of the first radio bearer of the first PDCP entity 908 according to a first QoS and / or LA policy for the first radio bearer of the first PDCP entity 908 and where the TB of the third MAC entity 926 is used for data of the second radio bearer of the second PDCP entity 910 according to a second QoS and / or LA policy for the second radio bearer of the second PDCP entity 910.

[0182] The arrangement of FIG. 12A may be considered to represent example candidate edge activations for the protocol stack 902 in a case of reliability-constrained data in the radio bearer for the first PDCP entity 908.

[0183] FIG. 12B illustrates a case where distribution through the protocol stack 902 of FIG. 9 corresponds to T1= 1, T2= 0, T3= 1. As previously discussed, this is a feasible distribution.

[0184] Consistent with this distribution, as shown, a first edge 1202 between the first RLC entity 912 and the first MAC entity 914 is active, a second edge 1204 between the first RLC entity 912 and the second MAC entity 920 is inactive, a third edge 1206 between the first RLC entity 912 and the third MAC entity 926 is active, a fourth edge 1208 between the second RLC entity 918 and the second MAC entity 920 is inactive, and a fifth edge 1210 between the third RLC entity 924 and the third MAC entity 926 is active. As no edge connected to the second MAC entity 920 is active, the second MAC entity 920 is inactive (not used) during the TTI(s) where this arrangement is used.

[0185] In this case, it may be that data from the first PDCP entity 908 in the buffer of the first RLC entity 912 is duplicated or non-duplicated and forwarded for each of the TB of the first MAC entity 914 and the TB of the third MAC entity 926. Data from the second PDCP entity 910 in the buffer of the third RLC entity 924 is forwarded for the TB of the third MAC entity 926. In view of the fact that TB of the third MAC entity 926 is potentially used by each of the first RLC entity 912 for the first PDCP entity 908 and the third RLC entity 924 for the second PDCP entity 910, if one of the first PDCP entity 908 or the second PDCP entity 910 requires relatively a lower modulation and coding scheme (MCS), data in both the buffer of the first RLC entity 912 and the buffer of the third RLC entity 924 should follow this lower MCS in the TB of the third MAC entity 926.

[0186] The arrangement of FIG. 12B may be considered to represent example candidate edge activations for the protocol stack 902 in a case of reliability and / or capacity constrained data in the radio bearer for the first PDCP entity 908. 28 P65105WO14883-6495-3844\1

[0187] FIG. 12B illustrates a case where distribution through the protocol stack 902 of FIG. 9 corresponds to T1= 0, T2= 1, T3= 1. As previously discussed, this is a feasible distribution.

[0188] Consistent with this distribution, as shown, a first edge 1202 between the first RLC entity 912 and the first MAC entity 914 is inactive, a second edge 1204 between the first RLC entity 912 and the second MAC entity 920 is active, a third edge 1206 between the first RLC entity 912 and the third MAC entity 926 is inactive, a fourth edge 1208 between the second RLC entity 918 and the second MAC entity 920 is active, and a fifth edge 1210 between the third RLC entity 924 and the third MAC entity 926 is active. As no edge connected to the first MAC entity 914 is active, the first MAC entity 914 is inactive (not used) during the TTI(s) where this arrangement is used.

[0189] From the present arrangement, it may be understood that data from the first PDCP entity 908 in the buffer of the first RLC entity 912 and data from the second PDCP entity 910 in the buffer of the second RLC entity 918 will effectively follow the same QoS and LA policies (based on the fact that data from either / both of the buffer of the first RLC entity 912 and the buffer of the second RLC entity 918 may be incorporated into the TB of the second MAC entity 920). This means that, for example, if one of the first PDCP entity 908 or the second PDCP entity 910 requires relatively a lower MCS, data in both the buffer of the first RLC entity 912 and the buffer of the second RLC entity 918 should follow this lower MCS in the TB of the third MAC entity 926. MAC Controller Entity for MAC Entity Orchestration at a Base Station

[0190] In some existing wireless communication systems, each connected base station has a single logical MAC entity for each connected UE (this may be, for example, the case according to present implementations of wireless communications systems operating LTE and / or NR RAT). However, in a cell-free network architecture as is described herein, each base station might have more than one logical MAC entity for each connected UE. Hence, it will be understood that for a same collection of hardware and / or software resources, a lesser number of UEs may be simultaneously supportable at a base station operating according to the cell-free network architecture as compared to a base station operating in an LTE / NR context.

[0191] It may be observed that some MAC procedures operated by a MAC entity may be defined as / understood as being UE-specific (procedures which should be implemented per UE) and others may alternatively be understood as TB-specific (procedures which may be implemented on a per-TB / per MAC entity basis). Where a cell-free architecture as discussed 29 P65105WO14883-6495-3844\1herein now contemplates potentially multiple MACs for one UE at a base station, it can therefore be the case that some UE-specific procedures might be duplicated at each MAC entity for the UE. This duplication represents an inefficient usage of hardware and / or software resources at the base station.

[0192] Accordingly, in some embodiments, a MAC controller entity may be introduced at a base station. A MAC controller entity may be a logical entity having a one-to-one correspondence with UE. The MAC controller entity can be a leveraged UE-specific MAC entity having additional / particular control functionalities. The MAC controller entity may have the ability to differentiate between UE-specific and TB-specific MAC procedures in order to enable a more efficient usage of hardware and / or software resources at a base station operating in a cell-free architecture.

[0193] A MAC controller entity may take one or more of the following roles. An example MAC controller entity may take an operational role, under which it should have responsibility to conduct all UE-specific procedures and UE-specific data processing without the need to route data to any of the (potentially multiple) logical MAC entities for a given UE at the base station (resulting in a more efficient usage of hardware and / or software resources at the base station).

[0194] An example MAC controller entity additionally and / or alternatively take a management and orchestration role, under which it manages all TB-specific data processing across different logical MAC entities for a given UE at a base station (resulting in a more efficient usage of hardware and / or software resources at the base station).

[0195] FIG. 13 illustrates a diagram 1300 showing a base station 1302 that operates a MAC controller entity 1304, according to embodiments discussed herein. As illustrated, the MAC controller entity 1304 may control one or more of the first MAC entity 1306, the second MAC entity 1308, and / or the third MAC entity 1310 of the base station 1302 (e.g., according to an operational role and / or a management and orchestration role, as has been discussed herein). Note that under this arrangement, the first MAC entity 1306, the second MAC entity 1308, and the third MAC entity 1310 retain their position as the entities that interact directly with the physical layer 1312. Embodiments of UE Multiple TB (Multi-TB) Capability Messaging

[0196] To make decentralized MAC scheduling as described herein possible, a UE may handle multiple (e.g., several) UL / DL grants simultaneously and may further receive / transmit a corresponding number of TBs within a given TTI. It may be that the UE is configured to provide the network with a capability message to indicate its capability to 30 P65105WO14883-6495-3844\1handle TBs in a given TTI, such that the network is made aware of these UE capabilities. A UE capability message might include one or more of: a maximum number of supported TBs per TTI at the UE, a maximum data size of a TB (e.g., assuming a given number of transmitted and / or received TBs), and / or a total maximum collective data size for TBs that are transmitted and / or received in a given TTI. In some embodiments, a UE capability message may be an RRC message. In some cases, UE limitations on the maximum / total TB sizes may be broken out separately as between UL and DL in the capability message.

[0197] Note that UE limitations of the maximum / total collective TB sizes, etc., are applicable at a UE in order to keep a PHY layer implementation complexity for the UE at a feasible level.

[0198] FIG. 14 illustrates a diagram 1400 corresponding to the transmission of a UE capability message 1406 and further illustrating the contents of a UE capability message report 1412 that may be included in the UE capability message 1406, according to embodiments discussed herein.

[0199] As illustrated, a UE 1402 may provide a cell-free network 1404 with a UE capability message 1406. This UE capability message 1406 may be sent to, for example, a cluster of base stations that is serving the UE.

[0200] The UE capability message 1406 may include, for example, the UE capability message report 1412. In the present example, the UE capability message report 1412 reports (separately) the maximum number of DL TBs 1408 that is supportable by the UE with respect to various maximum possible DL TB sizes and the maximum number of UL TBs 1410 that is supportable by the UE with respect to various maximum possible UL TB sizes.

[0201] In the example corresponding to FIG. 14, the maximum number of DL TBs 1408 the UE may support is up to one DL TB when the maximum possible DL TB size is S_DL (the size of a DL grant), up to two DL TBs when the maximum possible DL TB size is S_DL / 2, up to four DL TBs when the maximum possible DL TB size is S_DL / 4, up to eight DL TBs when the maximum possible DL TB size is S_DL / 8, and up to up to 16 DL TBs when the maximum possible DL TB size is S_DL / 16.

[0202] Further, the maximum number of UL TBs 1410 the UE may support is the UE may support is up to one UL TB when the maximum possible UL TB size is S_UL (the size of an UL grant), up to two UL TBs when the maximum possible UL TB size is S_UL / 2, up to four UL TBs when the maximum possible UL TB size is S_UL / 4, and up to eight UL TBs when the maximum possible UL TB size is S_UL / 8.Note that in alternative examples / alternative UEs, other numbers / values might apply. 31 P65105WO14883-6495-3844\1Embodiments for Radio-Bearer-Specific TBs

[0203] According to the cell-free network mechanisms described herein, a TB can contain the data from a single logical channel or from multiple logical channels (and thus from a single radio bearer or from multiple radio bearers). It is contemplated that one grant (for DL or UL) may be provided per TB. In the DL case, a grant for a TB (e.g., in DCI) could indicate one or more radio bearer identifier(s) (ID(s)) for radio bearers that are to use the DL TB. In the UL case, uplink control information (UCI) accompanying the scheduled TB may indicate one or more radio bearer IDs for radio bearers that use the UL TB.

[0204] To this end, the UE and the network can, prior to the indication, configure information with respect to a correspondence between radio bearer IDs and radio bearers of interest (in order to simplify the later indication). FIG. 15 illustrates an example of a configuration of radio bearer IDs for the indication of radio-bearer-specific TBs as between a UE 1502 and a cell-free network 1504, according to embodiments discussed herein. Note that the cell-free network 1504 may operate as indicated through, for example, a cluster of base stations of the cell-free network 1504 that is serving the UE 1502.

[0205] As illustrated, the UE 1502 provides the cell-free network 1504 with configuration information 1506 with respect to one or more radio bearer IDs. The configuration information 1506 may, for example, relate a correspondence of radio bearer IDs to zero or more radio bearers that exist or may exist between the UE 1502 and the cell-free network 1504.

[0206] FIG. 15 provides one example of such configuration information in the form of the table 1510 of radio bearer IDs. As shown in the table 1510, a radio bearer ID of “0” is not associated with any radio bearers, a radio bearer ID of “1” is associated with a first signaling radio bearer (SRB) (SRB1), a radio bearer ID of “2” is associated with each of a first and second DRB (each of DRB1 and DRB2), and a radio bearer ID of “3” is associated with a third DRB (DRB6).

[0207] With respect to the table 1510, if the data of SRB1 and / or DRB1, DRB2, and / or DRB6 is to be located in the TB, this will be indicated in DCI or UCI (as the case may be) using the corresponding radio bearer ID(s), otherwise, the indication in the DCI / UCI may be “0”.

[0208] Upon receiving the configuration information 1506, the cell-free network 1504 may reply to the UE 1502 with a confirmation message 1508.

[0209] It is contemplated that the configuration information 1506 may represent a semi-static configuration that is delivered using RRC messaging (and with respect to such a 32 P65105WO14883-6495-3844\1case, the flow diagram 1500 may thus be understood to illustrate an RRC message exchange).

[0210] It is further contemplated that the configuration information 1506 may include different information (e.g., different tables) for each of the UL and DL cases. In other words, the configuration information 1506 may, in some embodiments, include first information for a correspondence of radio bearer IDs to zero or more radio bearers used in the UL context and second information for a correspondence of radio bearer IDs to zero or more radio bearers that is used in the DL context.

[0211] It is also contemplated that the configuration information 1506 may further provide a set of radio bearers that is to be used when no radio bearer ID is included in an indication (a signaling case which may be leveraged in order to save radio resources).

[0212] In a UL case, it may be that UCI that includes radio bearer ID(s) for applicable radio bearer(s) using the UL TB is transmitted in a physical uplink control channel (PUCCH) that is sent just before or together with the corresponding physical uplink shared channel (PUSCH) having the TB.

[0213] Based on the radio bearer information as known to each of the UE and the network for a TB, the UE / the network may adjust PHY layer and / or L2 processing procedures (e.g., the processing order and / or a number of low density parity check (LDPC) decoder iterations) for the TB.

[0214] FIG. 16A illustrates a flow diagram 1600 for a DL procedure for indicating radio bearers according to previously established configuration information for a correspondence of radio bearer IDs to zero or more radio bearers that exist between the UE 1602 and the cell-free network 1604, according to embodiments discussed herein. Note that the cell-free network 1604 may operate as indicated through, for example, a cluster of base stations of the cell-free network 1604 that is serving the UE 1602.

[0215] The flow diagram 1600 illustrates that the cell-free network 1604 sends the UE 1602 a DCI 1606 that schedules a physical downlink shared channel (PDSCH) containing a TB and a radio bearer indication corresponding to that TB. This radio bearer indication may take the form of radio bearer ID(s) previously configured between the UE 1602 and the cell-free network 1604 that identify one or more radio bearers that will use the TB. In this way, the UE is informed of which radio bearers will use the TBs.

[0216] Then, the cell-free network 1604 sends the network the PDSCH 1608 having the TB. Based on the radio bearer indication received in the DCI 1606, the UE 1602 is aware of 33 P65105WO14883-6495-3844\1which radio bearers used the TB and is therefore capable of selecting 1610 a receive processing option that allows the UE 1602 to properly process the TB.

[0217] FIG. 16B illustrates a flow diagram 1612 for an UL procedure for indicating radio bearers according to previously established configuration information for a correspondence of radio bearer IDs to zero or more radio bearers that exist between a UE 1602 and the cell-free network 1604, according to embodiments discussed herein. Note that the cell-free network 1604 may operate as indicated through, for example, a cluster of base stations of the cell-free network 1604 that is serving the UE 1602.

[0218] The flow diagram 1600 illustrates that the cell-free network 1604 sends the UE 1602 a DCI 1614 that schedules a PUSCH containing a TB. The UE 1602 then performs MAC data allocation 1616 of data from one or more radio bearers into that TB.

[0219] The UE 1602 then sends the cell-free network 1604 a PUCCH 1618 that includes UCI indicating a radio bearer indication corresponding to the TB. This radio bearer indication may take the form of radio bearer ID(s) previously configured between the UE 1602 and the cell-free network 1604 that identify one or more radio bearers that will use the TB. In this way, the network is informed of which radio bearers will use the TBs.

[0220] Then, the UE 1602 sends the network the PUSCH 1620 having the TB. Based on the radio bearer indication received in the PUCCH 1618, the cell-free network 1604 is aware of which radio bearers used the TB and is therefore capable of selecting 1622 a receive processing option that allows the cell-free network 1604 to properly process the TB.

[0221] One advantage that stems from the use of a radio-bearer-specific TB mechanisms is that it enables the application of different QoS and / or LA policy(s) with respect to each of the TBs. FIG. 17 illustrates a diagram 1700 showing each of a non-DRB-specific data allocation option 1702 and a DRB-specific data allocation option 1704 for the operation of a MAC entity 1706 of an example protocol stack 1708, according to embodiments discussed herein. As illustrated, the MAC entity 1706 can serve first data of a first radio bearer (DRB1) (the DRB1 data 1718) through a first PDCP entity 1710 and a first RLC entity 1712 and second data of a second radio bearer DRB2 (the DRB2 data 1720) through a second PDCP entity 1714 and a second RLC entity 1716. The MAC entity 1706 may be capable of creating two TBs during a TTI.

[0222] In FIG. 17, the DRB1 data 1718 is illustrated with a solid line and the DRB2 data 1720 is illustrated with a dotted line. With respect to the non-DRB-specific data allocation option 1702, it may be that the MAC entity 1706 schedules DRB1 data 1718 and DRB2 data 1720 on each of a first TB 1722 and a second TB 1724, as illustrated. In this case, it may be 34 P65105WO14883-6495-3844\1that an MCS choice for both of the TBs should target a block error rate (BLER) that is compatible with QoS requirements of both DRBs (e.g., that meets the BLER / QoS requirement of the most strict DRB).

[0223] With respect to the DRB-specific data allocation option 1704, it may be that the MAC entity 1706 instead schedules (only) DRB1 data 1718 on the first TB 1722 and (only) DRB2 data 1720 on the second TB 1724, as illustrated. In this case, an MCS for the first TB 1722 can be selected according to the QoS requirements of DRB1, while an MCS for the second TB 1724 can be (independently) selected according to the QoS requirements of DRB2.

[0224] Typically, for DRBs with low-latency QoS requirements, it may be considered better to do LA targeting lower BLER (<10%), while for DRBs with high throughput QoS requirements, it may be considered better to target higher BLER (~10% and higher). Accordingly, the use of radio-bearer-specific TBs (as in the DRB-specific data allocation option 1704) allow a flexibility in terms of enabling different LA (MCS selection) across TBs of a same MAC entity and during a same TTI. PDCCH Configuration for Multiple TBs / Grantseach MAC entity might be configured to correspond to a specific control resource set (CORESET) that is used to provide a UE with control information. In such cases, it may further be that a MAC entity provides more than one UL grant (or more than one DL TB allocation) for a same TTI. In this case, the MAC entity allocates a corresponding number of PDCCH / DCI in the CORESET search space for that MAC.

[0226] Thus, a UE may search for PDCCHs in a CORESET corresponding to a MAC entity up to the maximum number of PDCCHs for that MAC entity. This process may be repeated for each MAC entity at the UE.

[0227] It is contemplated that a maximum number of PDCCHs for a MAC entity may be provided to a UE in various different ways, including, for example, via RRC signaling and / or MAC control element (MAC CE) signaling.

[0228] A DCI of a PDCCH may, in some cases, include an indication about an actual number of PDCCHs for the UE in the considered CORESET that may be less than the maximum number of PDCCHs for that CORESET. This indication may accordingly be used to reduce the complexity of PDCCH search at the UE, as the UE can stop performing 35 P65105WO14883-6495-3844\1PDCCH searching in the CORESET once this actual number of PDCCHs has been identified in the CORESET.

[0229] FIG. 18A illustrates a flow diagram 1800 showing an RRC message exchange for configuring a CORESET corresponding to a MAC entity as between a UE 1802 and a cell-free network 1804 , according to embodiments discussed herein. Note that the cell-free network 1804 may operate as indicated through, for example, a cluster of base stations of the cell-free network 1804 that is serving the UE 1802.

[0230] The flow diagram 1800 illustrates that the cell-free network 1804 sends the UE 1802 a first RRC message 1806 that configures the correspondence of CORESET to a particular MAC entity to the UE. Then, the cell-free network 1804 sends the UE 1802 a second RRC message 1808 indicating a maximum number of PDCCHs that may be found in that CORESET. Accordingly, the UE is aware of and is equipped to search for (up to) the maximum number of PDCCHs for the MAC corresponding to that CORESET.

[0231] FIG. 18B illustrates a flow diagram 1810 showing a MAC CE indication of a maximum number of PDCCHs (corresponding to DCIs / TBs) that can be allocated by a MAC as between a UE 1802 and a cell-free network 1804, according to embodiments discussed herein. Note that the cell-free network 1804 may operate as indicated through, for example, a cluster of base stations of the cell-free network 1804 that is serving the UE 1802.

[0232] The flow diagram 1810 illustrates that a MAC entity 1814 (from the side of the cell-free network 1804) sends a MAC CE 1812 to the (same) MAC entity 1814 (on the side of the MAC entity 1814). This MAC CE 1812 includes a maximum number of PDCCHs for the MAC entity 1814 that may be found in the CORESET for the MAC entity 1814. Embodiments for Algorithms for MAC Entity Establishment

[0233] A UE-specific procedure that creates MAC entities and assign each of them 1) to a subset of base stations, and 2) to a subset of RLC entities is now discussed.

[0234] Inputs for this procedure may include: • C, a list of base stations that belong to the cluster for the UE; • a list of DRB entities; • a list of RLC entities (e.g., with entries in the following form: (RLC_ID, DRB_ID, (BS IDs)), which communicates an ID for an RLC entity, a DRB ID for a DRB served by that RLC entity, and IDs of the one or more base stations in the sub-cluster of that RLC entity); 36 P65105WO14883-6495-3844\1• a reference signal received power (RSRP) associated with each base station (e.g., as a real value in decibels (dB)), and a base station load for each base station (e.g., a value in the range of [0,1]); • MACMax: a value representing a maximum number of MAC entities; • Tmax: a value representing a maximum number of transport blocks that can be simultaneously processed by the UE; • GainTh: a parameter of an option for a greedy algorithm discussed elsewhere herein; and • No: a noise parameter (e.g., in dB).

[0235] Output of this procedure may include a list of MAC entities .

[0236] A MAC entity in may be represented by a MAC ID, a of base station IDs towhich that MAC entity and list of RLC entities to which it is related (e.g., in theform (MAC_ID, (BS , IDs))).

[0237] In such cases, there should exist at least one assignment of natural values TM(transport blocks) for each MAC entity M ∈ , such that: 1. TM≤ Tmax, andexists at least one MAC entity M with TM> 0 that isconnected to an RLC entity that belongs to DRB d.

[0238] Further, a number of DRBs connected to a MAC entity M may be defined as D(M) := #{d ∈ DRBs: M ∈ RLC ∈ d}, where RLC ∈ d means that the RLC entity belongs to DRB d.

[0239] It may further be understood that b ∈ M means that a base station b is associated with MAC entity M. A MAC entity M is considered connected to an RLC entity if and only if the set of base stations associated with MAC M belongs to the set of base stations associated with the RLC entity. Note that M ∈ RLC denotes the relation that a MAC entity M is connected to the given RLC entity.

[0240] It may further be understood that w = (wb)b represents a vector of base station weights, with wb∈ .

[0241] An optimization target function may then be defined as follows: where37 P65105WO14883-6495-3844\1. a first option for a

[0243] First, for each base station b, weights wbare calculated as follows: .

[0244] Then, is set all subsets of cluster C.

[0245] Then, the following steps are repeated: 1. Find an element M of for which elimination does not decrease the target function F, i.e. F( , w) = F( w).2. Set := \{M} These steps may be repeated until an element M of for which elimination does not decrease the target function F cannot be found.

[0246] If | | ≤ MACMax, set Result := . Else, repeat the following steps until | | ≤ MACMax:1. Find an element M of for which elimination decreases the target function F the least. 2. Set := \{M}.

[0247] set Result := .

[0248] Once the algorithm is complete, a MAC list structure may be created based on the Result.

[0249] FIG. 19A, FIG. 19B, FIG. 19C, FIG. 19D, and FIG. 19E together visually illustrate modification to a diagram 1900 corresponding to a procedure for the use of a greedy algorithm, according to embodiments discussed herein. The diagram 1900 includes the protocol stack 402 and the cluster 404 as these were discussed in relation to FIG. 4 (but note that the SDAP entity 418 has been omitted from the protocol stack 402 in FIG. 19A to facilitate the illustration).

[0250] At the juncture illustrated in FIG. 19A, various possible MAC entities have been identified with respect to the protocol stack 402, and connections corresponding to these possibilities have been made. These possible MAC entities include a first MAC entity 1902 that uses each of the first base station 406, the second base station 408, and the third base station 410 and that is connected to the first RLC entity 422; a second MAC entity 1904 that uses the first base station 406 and the second base station 408 and that is connected to the 38 P65105WO14883-6495-3844\1first RLC entity 422 and the second RLC entity 428; a third MAC entity 1906 that uses the third base station 410 and that is connected to the first RLC entity 422 and the third RLC entity 430; a fourth MAC entity 1908 that uses the first base station 406 and the third base station 410 and that is connected to the first RLC entity 422; a fifth MAC entity 1910 that uses the second base station 408 and the third base station 410 and that is connected to the first RLC entity 422; a sixth MAC entity 1912 that uses the first base station 406 and is connected to the first RLC entity 422 and the second RLC entity 428; and a seventh MAC entity 1914 that uses the second base station 408 and that is connected to first RLC entity 422 and the second RLC entity 428.

[0251] The network may be aware that a capability of the UE 412 is limited to the use of 3 MAC entities. Accordingly, the use of the greedy algorithm as illustrated across FIG. 19A, FIG. 19B, FIG. 19C, FIG. 19D, and FIG. 19E is meant to reduce these seven possible MAC entities down to a set of three that will actually be created.

[0252] FIG. 19B illustrates that at a first repetition within the procedure, it is determined that the removal of the seventh MAC entity 1914 as a possibility does not decrease a target function F corresponding to the set of possible MAC entities. Accordingly the seventh MAC entity 1914 is removed as a possible MAC entity from the set of possible MAC entities.

[0253] FIG. 19C illustrates that at a second repetition within the procedure, it is determined that the removal of the sixth MAC entity 1912 as a possibility does not decrease a target function F corresponding to the set of possible MAC entities. Accordingly the sixth MAC entity 1912 is removed as a possible MAC entity from the set of possible MAC entities.

[0254] FIG. 19D illustrates that at a fourth repetition within the procedure, it is determined that the removal of the fifth MAC entity 1910 as a possibility does not decrease a target function F corresponding to the set of possible MAC entities. Accordingly the fifth MAC entity 1910 is removed as a possible MAC entity from the set of possible MAC entities.

[0255] FIG. 19E illustrates that at a fifth repetition within the procedure, it is determined that the removal of the fourth MAC entity 1908 as a possibility does not decrease a target function F corresponding to the set of possible MAC entities. Accordingly the fourth MAC entity 1908 is removed as a possible MAC entity from the set of possible MAC entities.

[0256] At this juncture, there are three remaining possible MAC entities, which is within the UE capability. Accordingly, the network proceeds to create these three MAC entities. 39 P65105WO14883-6495-3844\1

[0257] Note that the previously provided example is not the only possible option for a greedy algorithm. A description of a procedure for a second option for a greedy algorithm is now described.

[0258] First, for each base station b, weights wb are calculated as follows: wb := (1 – Loadb) entity, a base station with having a maximum weight is:= .

[0260] Then, set .

[0261] Then, if |1. Set — representing the set of all subsets of the cluster, excluding elements of and the empty set. 2. Set:= 3. Repeat the following steps while | | ≤ MACMax: i. Calculate F( ∪ {S}, w) for each S ∈ , assuming that MAC S is connected to RLCs if and only if) ≤ MACLatencyReq(RLC) and S RLC. ii. Find the element S ∈ with the largest F( ∪ {S}, w). iii. If ≥ GainTh, update := ∪ {S}, := \{ },

[0262] Then, set Result := .

[0263] Once the algorithm is complete, a MAC list structure may be created based on the Result. Embodiments of Algorithms for RLC Entity to MAC Entity Edge Activation

[0264] An algorithm for RLC entity to MAC entity edge activation may use the following decision variables: • xi,j: a binary variable representing the connection between an RLC entity i and a MAC entity j • yj: a binary variable representing whether a MAC entity j is active (e.g., 1 if active and 0 otherwise)

[0265] An algorithm for RLC entity to MAC entity edge activation may use the following parameters: 40 P65105WO14883-6495-3844\1• Ci,j: A connection matrix entry that indicates whether a connection between an RLC entity i and MAC entity j is feasible or not (1 if possible, and 0 otherwise); • wd: a priority weight of DRB d; • : a normalized priority weight of a given MAC entity j corresponding to DRB d. may be calculated based on ; • weight of a base station k associated with MAC entity j indicating its base and RSRP quality; • αj: a normalized weight of base stations belong to MAC entity j to ensure that a MAC entity weight reflects the average across base stations in MAC entity j, i.e. αj= a set of RLC entities indices associated with DRB d. This set may be a subsetnumber of RLC entities of all DRBs; • D: a total number of DRBs associated with a given UE; • P: a total number of RLC entities associated with all DRBs of a given UE; • R: a total number of all possible MAC entities; • Tmax: a maximum number of MAC entities that can be activated based on the maximum number of TBs of a given UE; and • λ: a fairness factor that ensure fair utilization of resources among all DRBs of a UE

[0266] An objective function is then leveraged. The purpose of the objective function may be to maximize the combined priority of the DRBs and the weights of base stations connected by active MAC entities while maintaining fairness across DRBs. Hence, the optimization problem represented by the objective function is structured to maximize the combined priority of DRBs and base station weights while also ensuring fairness and adhering to a given set of constraints.

[0267] An example objective function may be: .is designed tomaximize the cumulative priority of DRBs the weight of base stations (represented by bk,j) associated with the MACterm encourages the 41 P65105WO14883-6495-3844\1optimization problem to prioritize the connections between RLC entities and the MAC entities based on both the DRB priority and the base station weight.

[0269] The term is designed to operate as a fairness penalty. It squares the connection (where each DRB would have 1 connection). Thethe importance of this fairness relative to the other term.

[0270] Various Constraints within the above framework are now discussed.

[0271] A first such constraint may be a feasibility constraint. This constraint ensures that only possible connections as defined by the connection matrix Ci,jare made. This constraint is essential in adhering to the UE’s capability limitation. This constraint may be expressed as: xi,j≤ Ci,j∀i,j

[0272] Another such constraint may be a MAC activation constraint. This constraint ensures that the number of active MAC entities does not exceed Tmax. This constraint may be used for adhering to a UE’s capability limitation. This constraint may be expressed as: yj≤ Tmaxconstraint may ensuring at least one RLC for each DRB is connected. Such a constraint ensures that every DRB gets at least one connection, ensuring a minimum service level for each DRB. This constraint may be expressed as: xi,j≥ 1∀dmay link the yjand xi,jvariables: Such a constraint links the yjdecision variables with the xi,j variables. If any RLC entity is connected to MAC entity j, then yjwill be forced to 1, indicating that the MAC entity j is active. Conversely, if no RLC entity is connected to MAC entity j, yj will be 0, indicating that the MAC entity j is inactive. This constraint may be expressed as: xi,j≤ P yj∀j 42 P65105WO14883-6495-3844\1

[0275] Other constraints may be binary constraints of the yj and xi,j variables. Such constraints may ensure that the decision variables can only take values of 0 or 1, representing the absence or presence of a connection, respectively. These constraints may be expressed as: xi,j ∈ {0,1}∀i,j and yj ∈ {0,1}∀j

[0276] With respect to the objective function, selecting an appropriate fairness factor λ is crucial for striking a balance between individual DRB priorities and overall fairness among all DRBs. One general approach for determining λ is now described.

[0277] Preliminarily, it is noted that with respect role of λ, a larger λ places more emphasis on fairness (making sure that as many DRBs as possible have at least one of their RLC entities connected to a MAC entity), while a smaller λ focuses more on individual DRB priorities and the weights of base stations.

[0278] Then, to find a value λ for use: • First, select an arbitrary value of λ (for instance, set it equal to the average priority of all DRBs). • Then, solve the optimization problem (using the objective function) and analyze the results. If the solution undesirably favors individual DRB priorities and at the expense of fairness, increase λ. Conversely, if the solution is overly fair (e.g., such that high-priority DRBs were ignored), decrease λ. • In a proposed iterative refinement mechanism, λ is adjusted in small increments or decrements. Each time λ is modified, the optimization problem is solved again. The iterative mechanism repeatedly refines λ in this manner until a satisfactory balance between DRB priorities and fairness is achieved.

[0279] Various practical considerations may apply when selecting λ. For example, in real-world scenarios, it might be beneficial to prioritize certain DRBs, especially if they are associated with critical applications or services. In such cases, a lower λ may be used.

[0280] Conversely, in scenarios where it is essential to provide service to as many users as possible (even, for example, if that means compromising on quality for high-priority users) a higher λ may be used. 43 P65105WO14883-6495-3844\1

[0281] FIG. 20 illustrates a method 2000 of a CCF of a wireless communication system for performing MAC entity establishment for a cluster of base stations serving a UE, according to embodiments herein. The method 2000 includes identifying 2002 a first candidate MAC entity for the UE, the first candidate MAC entity corresponding to first one or more base stations of the cluster, wherein the first one or more base stations are in a first sub-cluster of base stations of the cluster across which a first RLC entity is synchronized. The method 2000 further includes calculating 2004 a first latency for the first candidate MAC entity. The method 2000 further includes determining 2006 that the first latency for the first candidate MAC entity is within a first latency first threshold of the first RLC entity. The method 2000 further includes sending 2008, to the UE, based on the determining that the first latency for the first candidate MAC entity is within the first latency threshold of the first RLC entity, a first indication that the first RLC entity can use the first candidate MAC entity.

[0282] In some embodiments, the method 2000 further includes requesting, from an L3 scheduler, a scheduler coordination latency for the first candidate MAC entity; and receiving, from the L3 scheduler, the scheduler coordination latency for the first candidate MAC entity wherein the first latency for the first candidate MAC entity is calculated by the CCF using the scheduler coordination latency for the first candidate MAC entity.

[0283] In some embodiments, the method 2000 further includes receiving, from the first RLC entity, the first latency threshold of the first RLC entity.

[0284] In some embodiments, the method 2000 further includes identifying a second candidate MAC entity for the UE, the second candidate MAC entity corresponding to second one or more base stations of the cluster, wherein the second one or more base stations are in the sub-cluster across which the first RLC entity is synchronized; calculating a second latency for the second candidate MAC entity; determining that the second latency for the second candidate MAC entity is within the first latency threshold of the first RLC entity; and sending, to the UE, based on the determining that the second latency for the second candidate MAC entity is within the first latency threshold of the first RLC entity, a second indication that the first RLC entity can use the second candidate MAC entity.

[0285] In some embodiments, the method 2000 further includes identifying a second candidate MAC entity for the UE, the second candidate MAC entity corresponding to second one or more base stations of the cluster, wherein the second one or more base stations are in the sub-cluster across which the first RLC entity is synchronized; calculating a second latency for the second candidate MAC entity; determining that the second latency 44 P65105WO14883-6495-3844\1for the second candidate MAC entity is not within a latency threshold of the first RLC entity; and dropping, based on the determining that the second latency for the second candidate MAC entity is not within the latency threshold of the first RLC entity, a second indication that the first RLC entity can use the second candidate MAC entity.

[0286] In some embodiments of the method 2000, the first one or more base stations corresponding to the first MAC entity are in a second sub-cluster of base stations of the cluster across which a second RLC entity is synchronized, and the method 2000 further includes determining that the first latency for the first candidate MAC entity is within a second latency threshold of the second RLC entity, and sending, to the UE, based on the determining that the first latency for the first candidate MAC entity is within the second latency threshold of the second RLC entity, a second indication that the second RLC entity may use the first candidate MAC entity.

[0287] FIG. 21 illustrates a method 2100 of a CCF of a wireless communication system for performing MAC entity establishment for a cluster of base stations serving a UE, according to embodiments herein. The method 2100 includes determining 2102 that a set of candidate MAC entities for the UE exceeds a capability of the UE. The method 2100 further includes removing 2104 a first MAC entity from the set of candidate MAC entities for the UE in response to the determining that the set of candidate MAC entities for the UE exceeds the capability of the UE. The method 2100 further includes sending 2106, to the UE, a listing that identifies that the set of candidate MAC entities can be used for the communications corresponding to the UE in the wireless communication system.

[0288] In some embodiments, the method 2100 further includes determining, after the removal of the first MAC entity from the set of candidate MAC entities, that the set of candidate MAC entities for the UE does not exceed the capability of the UE; wherein the sending, to the UE, the listing that identifies that the set of candidate MAC entities can be used for communications corresponding to the UE in the wireless communication system is based on the determining that the set of candidate MAC entities for the UE does not exceed the capability of the UE.

[0289] In some embodiments of the method 2100, the first MAC entity is selected for the removal of the first MAC entity from the set of candidate MAC candidates based on a greedy algorithm.

[0290] In some embodiments, the method 2100 further includes determining, prior to the removal of the first MAC entity from the set of candidate MAC entities, that the set of candidate MAC entities will be a feasible set of MAC entities after the removal of the first 45 P65105WO14883-6495-3844\1MAC entity from the set of candidate MAC entities; wherein the removal of the first MAC entity from the set of candidate MAC entities for the UE is further in response to the determining that the set of candidate MAC entities will be the feasible set of MAC entities after the removal of the first MAC entity from the set of candidate MAC entities.

[0291] In some embodiments, the method 2100 further includes determining, after the removal of the first MAC entity from the set of candidate MAC entities, that the set of candidate MAC entities still exceeds the capability of the UE; and removing a second MAC entity from the set of candidate MAC entities for the UE in response to the determining that the set of candidate MAC entities for the UE still exceeds the capability of the UE.

[0292] In some embodiments of the method 2100, the capability of the UE comprises a maximum number of MAC entities supportable at the UE, and the determining that the set of candidate MAC entities for the UE exceeds the capability of the UE comprises determining that a number of MAC entities in the set of candidate MAC entities exceeds the maximum number of MAC entities supportable at the UE.

[0293] In some embodiments, the method 2100 further comprises receiving, from the UE, the capability of the UE.

[0294] FIG. 22 illustrates a method 2200 of a UE served by a cluster of base stations of a wireless communication system, according to embodiments herein. The method 2200 includes receiving 2202, from a CCF of the wireless communication system, a listing that identifies a set of MAC entities that can be used corresponding to the UE in the wireless communication system. The method 2200 further includes performing 2204 first communications in the wireless communication system using a first MAC entity of the set of MAC entities, wherein the first MAC entity corresponds to first one or more base stations of the cluster, and wherein the first communications are for a first RLC entity that is synchronized across a first sub-cluster of base stations of the cluster that includes the first one or more base stations.

[0295] In some embodiments, the method 2200 further includes performing second communications in the wireless communication system using a second MAC entity of the set of MAC entities, wherein the second MAC entity corresponds to second one or more base stations of the cluster, and wherein the second communications are for a second RLC entity that is synchronized across a second sub-cluster of base stations of the cluster that includes the second one or more base stations. In some such embodiments, the first communications and the second communications comprise data of a same radio bearer. In 46 P65105WO14883-6495-3844\1some such embodiments, the first communications comprise first data of a first radio bearer and the second communications comprise second data of a second radio bearer.

[0296] In some embodiments, the method 2200 further comprises performing second communications using the first MAC entity of the set of MAC entities, wherein the second communications are for a second RLC entity that is synchronized across a second sub-cluster of base stations of the cluster that includes the first one or more base stations.

[0297] FIG. 23 illustrates a method 2300 of a L3 scheduler of a wireless communication system for performing RLC to MAC edge activation in a cluster of base stations serving a UE, according to embodiments herein. The method 2300 includes activating 2302, for a first TTI, a first edge between a first RLC entity used by a first radio bearer and a first MAC entity. The method 2300 further includes scheduling 2304 a use of a first sub-cluster of base stations of the cluster that corresponds to the first RLC during the first TTI to pass first data of the first radio bearer between the first RLC entity and the first MAC entity during the first TTI according to the activation of the first edge.

[0298] In some embodiments, the method 2300 further includes activating, for the first TTI, a second edge between the first RLC entity and a second MAC entity, wherein the scheduling of the use of the first sub-cluster during the first TTI is further to pass second data of the first radio bearer between the first RLC entity and the second MAC entity during the first TTI according to the activation of the second edge.

[0299] In some embodiments, the method 2300 further includes activating, for the first TTI, a second edge between a second RLC entity used by a second radio bearer and the first MAC entity; and scheduling a second sub-cluster of base stations of the cluster that corresponds to the second RLC entity during the first TTI to pass second data of the second radio bearer between the second RLC entity and the first MAC entity during the first TTI according to the activation of the second edge. Some such embodiments further comprise configuring each of the first RLC entity and the second RLC entity to use a same MCS for a TB of the first MAC entity during the first TTI.

[0300] In some embodiments, the method 2300 further includes activating, for the first TTI, a second edge between a second RLC entity used by a second radio bearer and a second MAC entity; and scheduling a second sub-cluster of the cluster that corresponds to the second RLC entity during the first TTI to pass second data of the second radio bearer between the second RLC entity and the second MAC entity during the first TTI according to the activation of the second edge. 47 P65105WO14883-6495-3844\1

[0301] In some embodiments, the method 2300 further includes deactivating, during a second TTI, the first edge; activating, during the second TTI, a second edge between the first RLC entity and a second MAC entity; and scheduling the first sub-cluster during the second TTI to pass second data of the first radio bearer between the first RLC entity and the second MAC entity during the second TTI according to the activation of the second edge.

[0302] In some embodiments, the method 2300 further includes determining that a first TB of the first MAC entity can meet one of a first QoS policy and a first LA policy for the first radio bearer during the first TTI, wherein the activation of the first edge is based on the determination that the first TB of the first MAC entity can meet the one of the first QoS policy and the first LA policy for the first radio bearer during the first TTI. In some such embodiments, the method 2300 further includes determining that a second TB of a second MAC entity can meet one of a second QoS policy and a second LA policy for a second radio bearer during the first TTI; and activating, for the first TTI, a second edge between a second RLC entity used by the second radio bearer and the second MAC entity based on the determination that the second TB of the second MAC entity can meet the one of the second QoS policy and the second LA policy for the second radio bearer during the first TTI.

[0303] FIG. 24 illustrates a method 2400 of a UE that is served by a cluster of base stations, according to embodiments herein. The method 2400 includes generating 2402 a capability message indicating a first maximum number of TBs that is supported at the UE during a single TTI. The method 2400 further includes transmitting 2404, to the cluster, the capability message.

[0304] In some embodiments of the method 2400, the first maximum number of TBs is for UL, and the capability message further indicates a second maximum number of TBs that is supported at the UE during the single TTI for DL.

[0305] In some embodiments of the method 2400, the capability message further indicates a maximum data size for each of the TBs.

[0306] In some embodiments of the method 2400, the capability message further indicates a maximum data size for the TBs collectively.

[0307] FIG. 25 illustrates a method 2500 of a cluster of base stations serving a UE, according to embodiments herein. The illustrated method 2500 includes receiving 2502, from the UE, a capability message indicating a first maximum number of TBs that is supported at the UE during a single TTI. The method 2500 further includes performing 2504 MAC scheduling within the maximum number of TBs in response to receiving the capability message. 48 P65105WO14883-6495-3844\1

[0308] In some embodiments of the method 2500, the first maximum number of TBs is for UL, and wherein the capability message further indicates a second maximum number of TBs that is supported at the UE during the single TTI for DL.

[0309] In some embodiments of the method 2500, the capability message further indicates a maximum data size for each of the TBs.

[0310] In some embodiments of the method 2500, the capability message further indicates a maximum data size for the TBs collectively.

[0311] FIG. 26 illustrates a method 2600 of a cluster of base stations serving a UE, according to embodiments herein. The method 2600 includes sending 2602, to the UE, DCI that schedules a first TB in DL and comprises a first radio bearer ID identifying first one or more radio bearers that can use the first TB. The method 2600 further includes sending 2604, to the UE, in the first TB, first data of the first one or more radio bearers.

[0312] In some embodiments, the method 2600 further includes receiving, from the UE, configuration information defining that the first radio bearer ID is for the first one or more radio bearers.

[0313] In some embodiments, the method 2600 further includes adjusting a lower layer processing procedure used by the cluster to correspond to the one or more radio bearers for the first TB prior to sending the first data.

[0314] In some embodiments of the method 2600, the DCI further schedules a second TB in the DL and the UCI comprises a second radio bearer ID identifying second one or more radio bearers that can use the second TB, and the method 2600 further includes sending, to the UE, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are generated by a same MAC entity according to different MCSs.

[0315] FIG. 27 illustrates a method 2700 of a UE served by a cluster of base stations, according to embodiments herein. The method 2700 includes receiving 2702, from the cluster, DCI that schedules a first TB in UL. The method 2700 further includes sending 2704, to the cluster, UCI that comprises a first radio bearer ID for first one or more radio bearers that can use the first TB. The method 2700 further includes sending 2706, to the cluster, in the first TB, first data of the first one or more radio bearers.

[0316] In some embodiments, the method 2700 further includes sending, to the cluster, configuration information defining that the first radio bearer ID is for the first one or more radio bearers. 49 P65105WO14883-6495-3844\1

[0317] In some embodiments, the method 2700 further includes adjusting a lower layer processing procedure used by the UE to correspond to the one or more radio bearers for the first TB prior to sending the first data.

[0318] In some embodiments of the method 2700, the DCI further schedules a second TB in the UL, the UCI comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and the method 2700 further includes sending, to the cluster, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are generated by a same MAC entity according to different MCSs.

[0319] FIG. 28 illustrates a method 2800 of a cluster of base stations that is serving a UE, according to embodiments herein. The method 2800 includes sending 2802, to the UE, DCI that schedules a first TB in UL. The method 2800 further includes receiving 2804, from the UE, UCI that comprises a first radio bearer ID for first one or more radio bearers that can use the first TB. The method 2800 further includes receiving 2806, from the UE, in the first TB, first data of the one or more radio bearers.

[0320] In some embodiments, the method 2800 further comprises receiving, from the UE, configuration information defining that the first radio bearer ID is for the first one or more radio bearers.

[0321] n some embodiments, the method 2800 further comprises adjusting a lower layer processing procedure used by the cluster to correspond to the one or more radio bearers for the first TB prior to receiving the first data.

[0322] In some embodiments of the method 2800, the DCI further schedules a second TB in the UL, the UCI comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and the method 2800 further comprises receiving, from the UE, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are received by a same MAC entity and according to different MCSs.

[0323] FIG. 29 illustrates a method 2900 of a UE being served by a cluster of base stations, according to embodiments herein. The method 2900 includes receiving 2902, from the cluster, DCI that schedules a first TB in DL and comprises a first radio bearer ID for first one or more radio bearers that can use the first TB. The method 2900 further includes receiving 2904, from the cluster, in the first TB, the first data of the first one or more radio bearers.

[0324] In some embodiments, the method 2900 further includes sending, to the cluster, configuration information defining that the first radio bearer ID is for the first one or more radio bearers. 50 P65105WO14883-6495-3844\1

[0325] In some embodiments, the method 2900 further includes adjusting a lower layer processing procedure used by the UE to correspond to the first one or more radio bearers for the first TB prior to receiving the first data.

[0326] In some embodiments of the method 2900, the DCI further schedules a second TB in the DL and comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and the method 2900 further includes receiving, from the cluster, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are received using a same MAC entity and according to different MCSs.

[0327] FIG. 30 illustrates a method 3000 of a UE that is served by a cluster of base stations, according to embodiments herein. The method 3000 includes receiving 3002, from the cluster, a first message configuring a CORESET for use by a MAC entity of the cluster. The method 3000 further includes receiving 3004, from the cluster, a second message indicating a maximum number of PDCCHs that may be allocated by the MAC entity in the CORESET per TTI. The method 3000 further includes performing 3006 PDCCH searching in the CORESET in a first TTI to identify up to the maximum number of PDCCHs.

[0328] In some embodiments of the method 3000, the second message is received in RRC signaling.

[0329] In some embodiments of the method 3000, the second message is received in a MAC CE.

[0330] In some embodiments, the method 3000 further includes receiving, from the cluster, a third message indicating an actual number of PDCCHs allocated by the MAC entity in the CORESET in the first TTI; and stopping the PDCCH searching in the CORESET in the first TTI upon identifying the actual number of PDCCHs.

[0331] FIG. 31 illustrates a method 3100 of a cluster of base stations that is serving a UE, according to embodiments herein. The method 3100 includes sending 3102, to the UE, a first message configuring a CORESET for use by a MAC entity of the cluster. The method 3100 further includes sending 3104, to the UE, a second message indicating a maximum number of PDCCHs that may be allocated by the MAC entity in the CORESET per TTI. The method 3000 further includes allocating 3106, by the MAC entity, up to the maximum number of PDCCHs in the CORESET in a first TTI.

[0332] In some embodiments of the method 3100, the second message is sent in RRC signaling.

[0333] In some embodiments of the method 3100, the second message is sent in a MAC CE. 51 P65105WO14883-6495-3844\1

[0334] In some embodiments, the method 3100 further includes sending, to the UE, a third message indicating an actual number of PDCCHs allocated by the MAC entity in the CORESET in the first TTI.

[0335] FIG. 32 illustrates an example architecture of a wireless communication system 3200, according to embodiments disclosed herein. The following description is provided for an example wireless communication system 3200 that operates in conjunction with the LTE system standards and / or 5G or NR system standards as provided by 3GPP technical specifications.

[0336] As shown by FIG. 32, the wireless communication system 3200 includes UE 3202 and UE 3204 (although any number of UEs may be used). In this example, the UE 3202 and the UE 3204 are illustrated as smartphones (e.g., handheld touchscreen mobile computing devices connectable to one or more cellular networks), but may also comprise any mobile or non-mobile computing device configured for wireless communication.

[0337] The UE 3202 and UE 3204 may be configured to communicatively couple with a RAN 3206. In embodiments, the RAN 3206 may be NG-RAN, E-UTRAN, etc. The UE 3202 and UE 3204 utilize connections (or channels) (shown as connection 3208 and connection 3210, respectively) with the RAN 3206, each of which comprises a physical communications interface. The RAN 3206 can include one or more base stations (such as base station 3212 and base station 3214) that enable the connection 3208 and connection 3210.

[0338] In this example, the connection 3208 and connection 3210 are air interfaces to enable such communicative coupling, and may be consistent with RAT(s) used by the RAN 3206, such as, for example, an LTE and / or NR.

[0339] In some embodiments, the UE 3202 and UE 3204 may also directly exchange communication data via a sidelink interface 3216. The UE 3204 is shown to be configured to access an access point (shown as AP 3218) via connection 3220. By way of example, the connection 3220 can comprise a local wireless connection, such as a connection consistent with any IEEE 802.11 protocol, wherein the AP 3218 may comprise a Wi-Fi®router. In this example, the AP 3218 may be connected to another network (for example, the Internet) without going through a CN 3224.

[0340] In embodiments, the UE 3202 and UE 3204 can be configured to communicate using orthogonal frequency division multiplexing (OFDM) communication signals with each other or with the base station 3212 and / or the base station 3214 over a multicarrier communication channel in accordance with various communication techniques, such as, but 52 P65105WO14883-6495-3844\1not limited to, an orthogonal frequency division multiple access (OFDMA) communication technique (e.g., for downlink communications) or a single carrier frequency division multiple access (SC-FDMA) communication technique (e.g., for uplink and ProSe or sidelink communications), although the scope of the embodiments is not limited in this respect. The OFDM signals can comprise a plurality of orthogonal subcarriers.

[0341] In some embodiments, all or parts of the base station 3212 or base station 3214 may be implemented as one or more software entities running on server computers as part of a virtual network. In addition, or in other embodiments, the base station 3212 or base station 3214 may be configured to communicate with one another via interface 3222. In embodiments where the wireless communication system 3200 is an LTE system (e.g., when the CN 3224 is an EPC), the interface 3222 may be an X2 interface. The X2 interface may be defined between two or more base stations (e.g., two or more eNBs and the like) that connect to an EPC, and / or between two eNBs connecting to the EPC. In embodiments where the wireless communication system 3200 is an NR system (e.g., when CN 3224 is a 5GC), the interface 3222 may be an Xn interface. The Xn interface is defined between two or more base stations (e.g., two or more gNBs and the like) that connect to 5GC, between a base station 3212 (e.g., a gNB) connecting to 5GC and an eNB, and / or between two eNBs connecting to 5GC (e.g., CN 3224).

[0342] The RAN 3206 is shown to be communicatively coupled to the CN 3224. The CN 3224 may comprise one or more network elements 3226, which are configured to offer various data and telecommunications services to customers / subscribers (e.g., users of UE 3202 and UE 3204) who are connected to the CN 3224 via the RAN 3206. The components of the CN 3224 may be implemented in one physical device or separate physical devices including components to read and execute instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium).

[0343] In embodiments, the CN 3224 may be an EPC, and the RAN 3206 may be connected with the CN 3224 via an S1 interface 3228. In embodiments, the S1 interface 3228 may be split into two parts, an S1 user plane (S1-U) interface, which carries traffic data between the base station 3212 or base station 3214 and a serving gateway (S-GW), and the S1-MME interface, which is a signaling interface between the base station 3212 or base station 3214 and mobility management entities (MMEs).

[0344] In embodiments, the CN 3224 may be a 5GC, and the RAN 3206 may be connected with the CN 3224 via an NG interface 3228. In embodiments, the NG interface 3228 may be split into two parts, an NG user plane (NG-U) interface, which carries traffic data between 53 P65105WO14883-6495-3844\1the base station 3212 or base station 3214 and a user plane function (UPF), and the S1 control plane (NG-C) interface, which is a signaling interface between the base station 3212 or base station 3214 and access and mobility management functions (AMFs).

[0345] Generally, an application server 3230 may be an element offering applications that use internet protocol (IP) bearer resources with the CN 3224 (e.g., packet switched data services). The application server 3230 can also be configured to support one or more communication services (e.g., VoIP sessions, group communication sessions, etc.) for the UE 3202 and UE 3204 via the CN 3224. The application server 3230 may communicate with the CN 3224 through an IP communications interface 3232.

[0346] FIG. 33 illustrates a system 3300 for performing signaling 3334 between a wireless device 3302 and a network device 3318, according to embodiments disclosed herein. The system 3300 may be a portion of a wireless communications system as herein described. The wireless device 3302 may be, for example, a UE of a wireless communication system. The network device 3318 may be, for example, a base station (e.g., an eNB or a gNB) of a wireless communication system.

[0347] The wireless device 3302 may include one or more processor(s) 3304. The processor(s) 3304 may execute instructions such that various operations of the wireless device 3302 are performed, as described herein. The processor(s) 3304 may include one or more baseband processors implemented using, for example, a central processing unit (CPU), a digital signal processor (DSP), an application specific integrated circuit (ASIC), a controller, a field programmable gate array (FPGA) device, another hardware device, a firmware device, or any combination thereof configured to perform the operations described herein.

[0348] The wireless device 3302 may include a memory 3306. The memory 3306 may be a non-transitory computer-readable storage medium that stores instructions 3308 (which may include, for example, the instructions being executed by the processor(s) 3304). The instructions 3308 may also be referred to as program code or a computer program. The memory 3306 may also store data used by, and results computed by, the processor(s) 3304.

[0349] The wireless device 3302 may include one or more transceiver(s) 3310 that may include radio frequency (RF) transmitter circuitry and / or receiver circuitry that use the antenna(s) 3312 of the wireless device 3302 to facilitate signaling (e.g., the signaling 3334) to and / or from the wireless device 3302 with other devices (e.g., the network device 3318) according to corresponding RATs. 54 P65105WO14883-6495-3844\1

[0350] The wireless device 3302 may include one or more antenna(s) 3312 (e.g., one, two, four, or more). For embodiments with multiple antenna(s) 3312, the wireless device 3302 may leverage the spatial diversity of such multiple antenna(s) 3312 to send and / or receive multiple different data streams on the same time and frequency resources. This behavior may be referred to as, for example, multiple input multiple output (MIMO) behavior (referring to the multiple antennas used at each of a transmitting device and a receiving device that enable this aspect). MIMO transmissions by the wireless device 3302 may be accomplished according to precoding (or digital beamforming) that is applied at the wireless device 3302 that multiplexes the data streams across the antenna(s) 3312 according to known or assumed channel characteristics such that each data stream is received with an appropriate signal strength relative to other streams and at a desired location in the spatial domain (e.g., the location of a receiver associated with that data stream). Certain embodiments may use single user MIMO (SU-MIMO) methods (where the data streams are all directed to a single receiver) and / or MU-MIMO methods (where individual data streams may be directed to individual (different) receivers in different locations in the spatial domain).

[0351] In certain embodiments having multiple antennas, the wireless device 3302 may implement analog beamforming techniques, whereby phases of the signals sent by the antenna(s) 3312 are relatively adjusted such that the (joint) transmission of the antenna(s) 3312 can be directed (this is sometimes referred to as beam steering).

[0352] The wireless device 3302 may include one or more interface(s) 3314. The interface(s) 3314 may be used to provide input to or output from the wireless device 3302. For example, a wireless device 3302 that is a UE may include interface(s) 3314 such as microphones, speakers, a touchscreen, buttons, and the like in order to allow for input and / or output to the UE by a user of the UE. Other interfaces of such a UE may be made up of transmitters, receivers, and other circuitry (e.g., other than the transceiver(s) 3310 / antenna(s) 3312 already described) that allow for communication between the UE and other devices and may operate according to known protocols (e.g., Wi-Fi®, Bluetooth®, and the like).

[0353] The wireless device 3302 may include a MAC entity module 3316. The MAC entity module 3316 may be implemented via hardware, software, or combinations thereof. For example, the MAC entity module 3316 may be implemented as a processor, circuit, and / or instructions 3308 stored in the memory 3306 and executed by the processor(s) 3304. In some examples, the MAC entity module 3316 may be integrated within the processor(s) 55 P65105WO14883-6495-3844\13304 and / or the transceiver(s) 3310. For example, the MAC entity module 3316 may be implemented by a combination of software components (e.g., executed by a DSP or a general processor) and hardware components (e.g., logic gates and circuitry) within the processor(s) 3304 or the transceiver(s) 3310.

[0354] The MAC entity module 3316 may be used for various aspects of the present disclosure, for example, aspects of FIG. 1 through FIG. 31. The MAC entity module 3316 may configured to cause the wireless device 3302 to establish, create, activate, and / or use MAC entities with respect to a cluster of base stations that serves the wireless device 3302 in one or more manners that is discussed herein.

[0355] The network device 3318 may include one or more processor(s) 3320. The processor(s) 3320 may execute instructions such that various operations of the network device 3318 are performed, as described herein. The processor(s) 3320 may include one or more baseband processors implemented using, for example, a CPU, a DSP, an ASIC, a controller, an FPGA device, another hardware device, a firmware device, or any combination thereof configured to perform the operations described herein.

[0356] The network device 3318 may include a memory 3322. The memory 3322 may be a non-transitory computer-readable storage medium that stores instructions 3324 (which may include, for example, the instructions being executed by the processor(s) 3320). The instructions 3324 may also be referred to as program code or a computer program. The memory 3322 may also store data used by, and results computed by, the processor(s) 3320.

[0357] The network device 3318 may include one or more transceiver(s) 3326 that may include RF transmitter circuitry and / or receiver circuitry that use the antenna(s) 3328 of the network device 3318 to facilitate signaling (e.g., the signaling 3334) to and / or from the network device 3318 with other devices (e.g., the wireless device 3302) according to corresponding RATs.

[0358] The network device 3318 may include one or more antenna(s) 3328 (e.g., one, two, four, or more). In embodiments having multiple antenna(s) 3328, the network device 3318 may perform MIMO, digital beamforming, analog beamforming, beam steering, etc., as has been described.

[0359] The network device 3318 may include one or more interface(s) 3330. The interface(s) 3330 may be used to provide input to or output from the network device 3318. For example, a network device 3318 that is a base station may include interface(s) 3330 made up of transmitters, receivers, and other circuitry (e.g., other than the transceiver(s) 3326 / antenna(s) 3328 already described) that enables the base station to communicate with 56 P65105WO14883-6495-3844\1other equipment in a core network, and / or that enables the base station to communicate with external networks, computers, databases, and the like for purposes of operations, administration, and maintenance of the base station or other equipment operably connected thereto.

[0360] The network device 3318 may include a MAC entity module 3332. The MAC entity module 3332 may be implemented via hardware, software, or combinations thereof. For example, the MAC entity module 3332 may be implemented as a processor, circuit, and / or instructions 3324 stored in the memory 3322 and executed by the processor(s) 3320. In some examples, the MAC entity module 3332 may be integrated within the processor(s) 3320 and / or the transceiver(s) 3326. For example, the MAC entity module 3332 may be implemented by a combination of software components (e.g., executed by a DSP or a general processor) and hardware components (e.g., logic gates and circuitry) within the processor(s) 3320 or the transceiver(s) 3326.

[0361] The MAC entity module 3332 may be used for various aspects of the present disclosure, for example, aspects of FIG. 1 through FIG. 31. The MAC entity module 3332 may configure the network device 3318 to establish, create, activate, and / or use MAC entities with respect to a UE that is served by cluster of base stations including the network device 3318 in one or more manners that is discussed herein.

[0362] Embodiments contemplated herein include an apparatus comprising means to perform one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000. This apparatus may be, for example, an apparatus of a UE (such as a wireless device 3302 that is a UE, as described herein).

[0363] Embodiments contemplated herein include one or more non-transitory computer-readable media comprising instructions to cause an electronic device, upon execution of the instructions by one or more processors of the electronic device, to perform one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000. This non-transitory computer-readable media may be, for example, a memory of a UE (such as a memory 3306 of a wireless device 3302 that is a UE, as described herein).

[0364] Embodiments contemplated herein include an apparatus comprising logic, modules, or circuitry to perform one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000. This apparatus may be, for example, an apparatus of a UE (such as a wireless device 3302 that is a UE, as described herein). 57 P65105WO14883-6495-3844\1

[0365] Embodiments contemplated herein include an apparatus comprising: one or more processors and one or more computer-readable media comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000. This apparatus may be, for example, an apparatus of a UE (such as a wireless device 3302 that is a UE, as described herein).

[0366] Embodiments contemplated herein include a signal as described in or related to one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000.

[0367] Embodiments contemplated herein include a computer program or computer program product comprising instructions, wherein execution of the program by a processor is to cause the processor to carry out one or more elements of any one or more of the method 2200, method 2400, method 2700, method 2900, and / or method 3000. The processor may be a processor of a UE (such as a processor(s) 3304 of a wireless device 3302 that is a UE, as described herein). These instructions may be, for example, located in the processor and / or on a memory of the UE (such as a memory 3306 of a wireless device 3302 that is a UE, as described herein).

[0368] Embodiments contemplated herein include an apparatus comprising means to perform one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100. This apparatus may be, for example, an apparatus of one or more base stations (such as a network device 3318 that is a base station, as described herein).

[0369] Embodiments contemplated herein include one or more non-transitory computer-readable media comprising instructions to cause an electronic device, upon execution of the instructions by one or more processors of the electronic device, to perform one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100. This non-transitory computer-readable media may be, for example, a memory of one or more base stations (such as a memory 3322 of a network device 3318 that is a base station, as described herein).

[0370] Embodiments contemplated herein include an apparatus comprising logic, modules, or circuitry to perform one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100. This apparatus may be, for example, an apparatus of one or more base stations (such as a network device 3318 that is a base station, as described herein). 58 P65105WO14883-6495-3844\1

[0371] Embodiments contemplated herein include an apparatus comprising: one or more processors and one or more computer-readable media comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100. This apparatus may be, for example, an apparatus of one or more base stations (such as a network device 3318 that is a base station, as described herein).

[0372] Embodiments contemplated herein include a signal as described in or related to one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100.

[0373] Embodiments contemplated herein include a computer program or computer program product comprising instructions, wherein execution of the program by a processing element is to cause the processing element to carry out one or more elements of any one or more of the method 2000, method 2100, method 2300, method 2500, method 2600, method 2800, and / or method 3100. The processor may be a processor of one or more base stations (such as a processor(s) 3320 of a network device 3318 that is a base station, as described herein). These instructions may be, for example, located in the processor and / or on a memory of the one or more base stations (such as a memory 3322 of a network device 3318 that is a base station, as described herein).

[0374] For one or more embodiments, at least one of the components set forth in one or more of the preceding figures may be configured to perform one or more operations, techniques, processes, and / or methods as set forth herein. For example, a baseband processor as described herein in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth herein. For another example, circuitry associated with a UE, base station, network element, etc. as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth herein.

[0375] Any of the above-described embodiments may be combined with any other embodiment (or combination of embodiments), unless explicitly stated otherwise. The foregoing description of one or more implementations provides illustration and description but is not intended to be exhaustive or to limit the scope of embodiments to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of various embodiments. 59 P65105WO14883-6495-3844\1

[0376] Embodiments and implementations of the systems and methods described herein may include various operations, which may be embodied in machine-executable instructions to be executed by a computer system. A computer system may include one or more general-purpose or special-purpose computers (or other electronic devices). The computer system may include hardware components that include specific logic for performing the operations or may include a combination of hardware, software, and / or firmware.

[0377] It should be recognized that the systems described herein include descriptions of specific embodiments. These embodiments can be combined into single systems, partially combined into other systems, split into multiple systems or divided or combined in other ways. In addition, it is contemplated that parameters, attributes, aspects, etc. of one embodiment can be used in another embodiment. The parameters, attributes, aspects, etc. are merely described in one or more embodiments for clarity, and it is recognized that the parameters, attributes, aspects, etc. can be combined with or substituted for parameters, attributes, aspects, etc. of another embodiment unless specifically disclaimed herein.

[0378] It is well understood that the use of personally identifiable information should follow privacy policies and practices that are generally recognized as meeting or exceeding industry or governmental requirements for maintaining the privacy of users. In particular, personally identifiable information data should be managed and handled so as to minimize risks of unintentional or unauthorized access or use, and the nature of authorized use should be clearly indicated to users.

[0379] Although the foregoing has been described in some detail for purposes of clarity, it will be apparent that certain changes and modifications may be made without departing from the principles thereof. It should be noted that there are many alternative ways of implementing both the processes and apparatuses described herein. Accordingly, the present embodiments are to be considered illustrative and not restrictive, and the description is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims. 60 P65105WO14883-6495-3844\1

Claims

CLAIMS 1. A method of a Layer 3 (L3) scheduler of a wireless communication system for performing radio link control (RLC) to medium access control (MAC) edge activation in a cluster of base stations serving a user equipment (UE), comprising: activating, for a first transmission time interval (TTI), a first edge between a first RLC entity used by a first radio bearer and a first MAC entity; and scheduling a use of a first sub-cluster of base stations of the cluster that corresponds to the first RLC during the first TTI to pass first data of the first radio bearer between the first RLC entity and the first MAC entity during the first TTI according to the activation of the first edge.

2. The method of claim 1, further comprising activating, for the first TTI, a second edge between the first RLC entity and a second MAC entity, wherein the scheduling of the use of the first sub-cluster during the first TTI is further to pass second data of the first radio bearer between the first RLC entity and the second MAC entity during the first TTI according to the activation of the second edge.

3. The method of claim 1, further comprising: activating, for the first TTI, a second edge between a second RLC entity used by a second radio bearer and the first MAC entity; and scheduling a second sub-cluster of base stations of the cluster that corresponds to the second RLC entity during the first TTI to pass second data of the second radio bearer between the second RLC entity and the first MAC entity during the first TTI according to the activation of the second edge.

4. The method of claim 3, further comprising configuring each of the first RLC entity and the second RLC entity to use a same modulation and coding scheme (MCS) for a transport block (TB) of the first MAC entity during the first TTI.

5. The method of claim 1, further comprising: activating, for the first TTI, a second edge between a second RLC entity used by a second radio bearer and a second MAC entity; and scheduling a second sub-cluster of the cluster that corresponds to the second RLC entity during the first TTI to pass second data of the second radio bearer between the second RLC entity and the second MAC entity during the first TTI according to the activation of the second edge. 61 P65105WO14883-6495-3844\16. The method of claim 1, further comprising: deactivating, during a second TTI, the first edge; activating, during the second TTI, a second edge between the first RLC entity and a second MAC entity; and scheduling the first sub-cluster during the second TTI to pass second data of the first radio bearer between the first RLC entity and the second MAC entity during the second TTI according to the activation of the second edge.

7. The method of claim 1, further comprising determining that a first transport block (TB) of the first MAC entity can meet one of a first quality of a service (QoS) policy and a first link adaptation (LA) policy for the first radio bearer during the first TTI, wherein the activation of the first edge is based on the determination that the first TB of the first MAC entity can meet the one of the first quality of service (QoS) policy and the first LA policy for the first radio bearer during the first TTI; 8. The method of claim 7, further comprising: determining that a second TB of a second MAC entity can meet one of a second QoS policy and a second LA policy for a second radio bearer during the first TTI; and activating, for the first TTI, a second edge between a second RLC entity used by the second radio bearer and the second MAC entity based on the determination that the second TB of the second MAC entity can meet the one of the second QoS policy and the second LA policy for the second radio bearer during the first TTI.

9. A method of a user equipment (UE) that is served by a cluster of base stations, comprising: generating a capability message indicating a first maximum number of transport blocks (TBs) that is supported at the UE during a single TTI; and transmitting, to the cluster, the capability message.

10. The method of claim 9, wherein the first maximum number of TBs is for uplink (UL), and wherein the capability message further indicates a second maximum number of TBs that is supported at the UE during the single TTI for downlink (DL).

11. The method of claim 9, wherein the capability message further indicates a maximum data size for each of the TBs. 62 P65105WO14883-6495-3844\112. The method of claim 9, wherein the capability message further indicates a maximum data size for the TBs collectively.

13. A method of a cluster of base stations serving a user equipment (UE), comprising: receiving, from the UE, a capability message indicating a first maximum number of transport blocks (TBs) that is supported at the UE during a single TTI; and performing medium access control (MAC) scheduling within the maximum number of TBs in response to receiving the capability message.

14. The method of claim 13, wherein the first maximum number of TBs is for uplink (UL), and wherein the capability message further indicates a second maximum number of TBs that is supported at the UE during the single TTI for downlink (DL).

15. The method of claim 13, wherein the capability message further indicates a maximum data size for each of the TBs.

16. The method of claim 13, wherein the capability message further indicates a maximum data size for the TBs collectively.

17. A method of a cluster of base stations serving a user equipment (UE), comprising: sending, to the UE, downlink control information (DCI) that schedules a first transport block (TB) in downlink (DL) and comprises a first radio bearer identifier (ID) identifying first one or more radio bearers that can use the first TB; and sending, to the UE, in the first TB, first data of the first one or more radio bearers.

18. The method of claim 17, further comprising receiving, from the UE, configuration information defining that the first radio bearer ID is for the first one or more radio bearers.

19. The method of claim 17, further comprising adjusting a lower layer processing procedure used by the cluster to correspond to the one or more radio bearers for the first TB prior to sending the first data.

20. The method of claim 17, wherein the DCI further schedules a second TB in the DL and comprises a second radio bearer ID identifying second one or more radio bearers that can use the second TB, and further comprising: sending, to the UE, in the second TB, second data of the second one or more radio bearers, 63 P65105WO14883-6495-3844\1wherein the first TB and the second TB are generated by a same MAC entity according to different modulation and coding schemes (MCSs).

21. A method of a user equipment (UE) served by a cluster of base stations, comprising: receiving, from the cluster, downlink control information (DCI) that schedules a first transport block (TB) in uplink (UL); sending, to the cluster, uplink control information (UCI) that comprises a first radio bearer identifier (ID) for first one or more radio bearers that can use the first TB; and sending, to the cluster, in the first TB, first data of the first one or more radio bearers.

22. The method of claim 21, further comprising sending, to the cluster, configuration information defining that the first radio bearer ID is for the first one or more radio bearers.

23. The method of claim 21, further comprising adjusting a lower layer processing procedure used by the UE to correspond to the one or more radio bearers for the first TB prior to sending the first data.

24. The method of claim 21, wherein the DCI further schedules a second TB in the UL, and wherein the UCI comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and further comprising: sending, to the cluster, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are generated by a same MAC entity according to different modulation and coding schemes (MCSs).

25. A method of a cluster of base stations that is serving a user equipment (UE), comprising: sending, to the UE, downlink control information (DCI) that schedules a first transport block (TB) in uplink (UL); receiving, from the UE, uplink control information (UCI) that comprises a first radio bearer identifier (ID) for first one or more radio bearers that can use the first TB; and receiving, from the UE, in the first TB, first data of the one or more radio bearers.

26. The method of claim 25, further comprising receiving, from the UE, configuration information defining that the first radio bearer ID is for the first one or more radio bearers. 64 P65105WO14883-6495-3844\127. The method of claim 25, further comprising adjusting a lower layer processing procedure used by the cluster to correspond to the one or more radio bearers for the first TB prior to receiving the first data.

28. The method of claim 25, wherein the DCI further schedules a second TB in the UL, and wherein the UCI comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and further comprising: receiving, from the UE, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are received by a same MAC entity and according to different modulation and coding schemes (MCSs).

29. A method of a user equipment (UE) being served by a cluster of base stations, comprising: receiving, from the cluster, downlink control information (DCI) that schedules a first transport block (TB) in downlink (DL) and comprises a first radio bearer identifier (ID) for first one or more radio bearers that can use the first TB; and receiving, from the cluster, in the first TB, the first data of the first one or more radio bearers.

30. The method of claim 29, further comprising sending, to the cluster, configuration information defining that the first radio bearer ID is for the first one or more radio bearers.

31. The method of claim 29, further comprising adjusting a lower layer processing procedure used by the UE to correspond to the first one or more radio bearers for the first TB prior to receiving the first data.

32. The method of claim 29, wherein the DCI further schedules a second TB in the DL and comprises a second radio bearer ID for second one or more radio bearers that can use the second TB, and further comprising: receiving, from the cluster, in the second TB, second data of the second one or more radio bearers, wherein the first TB and the second TB are received using a same MAC entity and according to different modulation and coding schemes (MCSs).

33. A method of a user equipment (UE) that is served by a cluster of base stations, comprising: 65 P65105WO14883-6495-3844\1receiving, from the cluster, a first message configuring a control resource set (CORESET) for use by a medium access control (MAC) entity of the cluster; receiving, from the cluster, a second message indicating a maximum number of physical downlink control channels (PDCCHs) that may be allocated by the MAC entity in the CORESET per transmission time interval (TTI); and performing PDCCH searching in the CORESET in a first TTI to identify up to the maximum number of PDCCHs.

34. The method of claim 33, wherein the second message is received in radio resource control (RRC) signaling.

35. The method of claim 33, wherein the second message is received in a MAC control element (MAC CE).

36. The method of claim 33, further comprising: receiving, from the cluster, a third message indicating an actual number of PDCCHs allocated by the MAC entity in the CORESET in the first TTI; and stopping the PDCCH searching in the CORESET in the first TTI upon identifying the actual number of PDCCHs.

37. A method of a cluster of base stations that is serving a user equipment (UE), comprising: sending, to the UE, a first message configuring a control resource set (CORESET) for use by a medium access control (MAC) entity of the cluster; sending, to the UE, a second message indicating a maximum number of physical downlink control channels (PDCCHs) that may be allocated by the MAC entity in the CORESET per transmission time interval (TTI); and allocating, by the MAC entity, up to the maximum number of PDCCHs in the CORESET in a first TTI.

38. The method of claim 37, wherein the second message is sent in radio resource control (RRC) signaling.

39. The method of claim 37, wherein the second message is sent in a MAC control element (MAC CE).

40. The method of claim 37, further comprising sending, to the UE, a third message indicating an actual number of PDCCHs allocated by the MAC entity in the CORESET in the first TTI. 66 P65105WO14883-6495-3844\141. An apparatus comprising means to perform the method of any of claim 1 to claim 40.

42. A computer-readable media comprising instructions to cause an electronic device, upon execution of the instructions by one or more processors of the electronic device, to perform the method of any of claim 1 to claim 40.

43. An apparatus comprising logic, modules, or circuitry to perform the method of any of claim 1 to claim 40. 67 P65105WO14883-6495-3844\1

Images