System and method for resource allocation chain construction and pregree planning time calculation in

Abstract

Systems and methods for media access control (MAC) scheduling in a cellular-free network are discussed. In some cases, a Layer 3 (L3) scheduler of a cluster of base stations serving a user equipment (UE) identifies a first set of responsible base stations of a set of MAC entities from the cluster of base stations, constructs a set of resource allocation chains for the base stations in the cluster, computes an advanced planned time set of the set of MAC entities based on the set of resource allocation chains, and transmits the advanced planned time set to the UE. And providing the first set of advanced planning time of the set of MAC entities to the first set of responsible base stations. Mechanisms responsible for a base station to make and communicate resource allocation decisions using a set of resource allocation chains are also discussed. Fair mechanisms for such decisions are also discussed.

Description

Technical Field

[0001] This application relates in general to wireless communication systems, including Media Access Control (MAC) scheduling in non-cellular networks. Background Technology

[0002] Wireless mobile communication technologies use various standards and protocols to transmit data between base stations (BSs) and wireless communication devices. For example, wireless communication system standards and protocols may include, for instance, 3GPP Long Term Evolution (LTE) (e.g., 4G), 3GPP New Radio (NR) (e.g., 5G), and the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard for Wireless Local Area Networks (WLANs) (often referred to as Wi-Fi within the industry organization). ® ).

[0003] As envisioned by 3GPP, different wireless communication system standards and protocols can use various radio access networks (RANs) for communication between RAN base stations (sometimes referred to as RAN nodes, network nodes, or simply nodes) and wireless communication equipment called user equipment (UEs). 3GPP RANs can include, for example, Global System for Mobile Communications (GSM), Enhanced Data Rate 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 can use one or more Radio Access Technologies (RATs) to perform communication between the base station and the UE. For example, GERAN implements the GSM and / or EDGE RAT, UTRAN implements the Universal Mobile Telecommunications System (UMTS) RAT or other 3GPP RATs, E-UTRAN implements the LTE RAT (sometimes simply referred to as LTE), and NG-RAN implements the NR RAT (this NR RAT is sometimes referred to herein as the 5G RAT, 5G NR RAT, or simply NR). In some deployments, E-UTRAN may also implement the NR RAT. In some deployments, NG-RAN may also implement the LTE RAT.

[0005] The base stations used by a RAN can correspond to that RAN. An example of an E-UTRAN base station is an Evolved Universal Terrestrial Radio Access Network (E-UTRAN) Node B (also commonly referred to as Evolved Node B, Enhanced Node B, eNodeB, or eNB). An example of an NG-RAN base station is a Next Generation Node B (sometimes also called gNode B or gNB).

[0006] The RAN provides communication services to external entities through its connection with the core network (CN). For example, E-UTRAN can utilize the evolved packet core (EPC), while NG-RAN can utilize the 5G core network (5GC). Attached Figure Description

[0007] To facilitate the identification of any particular element or action in the discussion, one or more of the most significant digits in the figure reference numerals refer to the figure number in which the element was first introduced.

[0008] Figure 1 A diagram illustrating an example of clustering in a non-cellular network architecture is provided.

[0009] Figure 2 The diagram illustrates various aspects of the radio protocol used in a cellular-free network mechanism.

[0010] Figure 3 A diagram illustrating a base station cluster and its MAC entity options according to the implementation scheme discussed herein is provided.

[0011] Figure 4 A network-level view of a wireless communication system is illustrated, showing the relationships between the various MAC entities used in the wireless communication system and their relationships with the various base stations.

[0012] Figure 5 An example diagram is provided, illustrating a portion of the protocol stack corresponding to a MAC configuration as discussed herein and its visual application within a cluster.

[0013] Figure 6 Examples of MAC entities that can be scheduled by the cluster's MAC scheduler are shown. M The diagram is shown in Figure 1.

[0014] Figure 7 An example network topology is shown for which one or more resource allocation chains can be established.

[0015] Figure 8 A diagram illustrating an example of time planning for a resource allocation chain based on the implementation scheme discussed herein.

[0016] Figure 9 A diagram illustrating an example of time planning for a MAC entity according to the implementation scheme discussed herein is provided.

[0017] Figure 10 The diagram illustrates the construction of a feasible solution based on the implementation scheme discussed in this paper.

[0018] Figure 11A flowchart illustrating the communication between the CCF and L3 scheduler according to the implementation scheme discussed herein, corresponding to the first option for adding MAC entities, is provided.

[0019] Figure 12 A flowchart illustrating the communication between the CCF and L3 scheduler according to the implementation scheme discussed herein, corresponding to the second option for adding MAC entities, is provided.

[0020] Figure 13 A flowchart illustrating the communication between the CCF and L3 scheduler according to the implementation scheme discussed herein, corresponding to the options for MAC entity removal, is provided.

[0021] Figure 14 A flowchart illustrating the communication between the CCF and the L3 scheduler according to the implementation scheme discussed herein, corresponding to the L3 process for reconfiguring the resource allocation chain, is provided.

[0022] Figure 15A An example diagram is provided, illustrating the process from... Prec ( b Base station collection to base station b Inputs from previous resource allocation decisions for one or more MAC entities, and from the base station b arrive Succ ( b The subsequent output of the base station set for resource allocation decisions for one or more MAC entities.

[0023] Figure 15B Examples of the same Figure 15A Corresponding base stations b , Prec ( b Base station set and Succ ( b A flowchart detailing the communication between a set of base stations.

[0024] Figure 16A A network-level view of a wireless communication system is illustrated, showing the relationships between the various MAC entities used by the wireless communication system and their relationships with the various base stations.

[0025] Figure 16B This example illustrates how, without using a virtual MAC fairness mechanism, [the following is an example of something]... Figure 16A The first example of resource distribution corresponding to a wireless communication system.

[0026] Figure 16C This example illustrates the use of a virtual MAC fairness mechanism, in contrast to... Figure 16A The second example is the resource distribution corresponding to the wireless communication system.

[0027] Figure 17 An example is given of a method for an L3 scheduler serving a UE's base station cluster according to the implementation scheme discussed herein.

[0028] Figure 18 An example is illustrated of a method for a first responsible base station of a first MAC entity according to an implementation scheme discussed herein, the first MAC entity comprising a first plurality of base stations within a base station cluster serving a UE.

[0029] Figure 19 An example architecture of a wireless communication system according to the implementation scheme disclosed herein is illustrated.

[0030] Figure 20 An example is illustrated of a system for performing signaling between a wireless device and a network device, supported by a CN device according to an embodiment disclosed herein. Detailed Implementation

[0031] Various implementations are described with respect to the UE. However, references to the UE are provided for illustrative purposes only. The example implementations can be used with any electronic component capable of establishing a connection to a network and configured with hardware, software, and / or firmware for exchanging information and data with the network. Therefore, the UE as described herein is used to represent any suitable electronic component.

[0032] Implementation schemes for cellless process timescales In a non-real-time (e.g., second-level) cellular process, inputs may include, for example, inter-base station exchange (Xn) latency, radio bearer configuration, and / or UE capabilities. Decisions made during a non-real-time cellular process may include: the establishment of a cluster with associated base station identifiers, a subcluster structure with subclusters for each radio bearer, and a radio link control (RLC) entity, and / or the establishment of a media access control (MAC) entity with base station and RLC identifiers. The responsible control entity for the non-real-time cellular process may be a cluster control function.

[0033] In near real-time (e.g., tens to hundreds of milliseconds) cellular-free processes, inputs may include, for example, propagation delay from the UE to the base station, base station status (load, signal quality), and / or service statistics. Decisions made during near real-time cellular-free processes may include: • Physical layer (PHY) limitations caused by propagation delay and synchronization impairment; • MAC layer transport block (TB) quantity configuration or scheduling mode convention; • Decisions regarding the selection of the MAC scheduler responsible for base stations and resource allocation chains; • RLC-MAC link activation; and / or • Packet Data Convergence Protocol (PDCP) - RLC link service routing and replication.

[0034] The responsible control entity for near real-time cellular-free processes can be a Layer 3 (L3) scheduler.

[0035] In a real-time (e.g., as fast as possible, or milliseconds or less) cellular-free process, inputs may include, for example, CSI, buffer status, and / or scheduling metrics. Decisions during a real-time cellular-free process may include: • MAC scheduler decisions used to coordinate message exchange, radio resource allocation, and / or link adaptation; • MAC layer 2 (L2) data processing; and / or • PHY Multi-User Multiple-Input Multiple-Output (MIMO) (MU-MIMO) pre-decoding, Layer 1 (L1) data transmission / reception.

[0036] The responsible control entity for a real-time non-cellular process can be a MAC scheduler.

[0037] Implementation of clusters in cellular networks In some wireless communication systems, cellular network architectures provide an adaptive / dynamic and UE-centric distribution of functionality that can be associated with a “serving cell,” as understood in the context of prior cell-based network architectures (e.g., NR or LTE network architectures). Regarding this disclosure, it is generally understood that a UE’s “cluster” or “serving cluster” is a collection of physically and / or logically connected base stations on which functionality associated with serving the UE (e.g., traditional serving cell functionality used in cell-based network architectures) can be distributed. Therefore, in some contexts, the concept of a cluster can “replace” the concept of a UE’s serving cell, as understood for prior cell-based networks.

[0038] A cluster can have a one-to-one mapping to a UE. Therefore, the individual (logical) cluster for each of two UEs can be understood / identified (even when each of the two corresponding clusters consists of the same physical set of base stations). Furthermore, it should be noted that a single base station can belong to multiple clusters simultaneously, each serving different UEs.

[0039] Figure 1 Figure 100 illustrates an example of clustering in a cellular network architecture. A first cluster 102 of base stations serves a first UE 104, and a second cluster 106 of base stations serves a second UE 108. As illustrated, the first cluster 102 includes a first base station 110 and a second base station 112, while the second cluster 106 includes a second base station 112 and a third base station 114.

[0040] It is not always necessary for base stations within the same cluster to jointly transmit / receive to / from the UE being served. Furthermore, control plane and / or user plane functionality can be dynamically distributed among base stations within the cluster.

[0041] A cluster control function (CCF) can be defined as a set of one or more logical functions used to establish and control clusters in a wireless communication system. A CCF can be a distributed entity within the wireless communication system. For example, a CCF can be distributed across one or more base stations in the core network, the RAN Intelligent Controller (RIC), and / or the RAN.

[0042] The CCF can dynamically develop, update, control, and schedule UE-centric connection sets for clusters in certain geographic areas based on factors such as: services, 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.

[0043] In some wireless communication systems, clustering in a cellular network includes concepts such as UE-centric clusters, CCFs, connected base stations (cBSs) (e.g., base stations that are part of a cluster serving the UE), and adjacent unconnected base stations (uBSs) (e.g., neighboring base stations that are not currently part of a cluster serving the UE). In some such systems, the CCF includes, in particular, the functionality, protocols, message exchange capabilities, etc., available for cluster establishment and / or update tasks. UEs and base stations may include corresponding functionality, protocols, message exchange capabilities, etc., supporting the use of clusters as described herein.

[0044] In wireless communication systems implementing cellular networks, it is possible to establish and maintain message delivery protocols using cellular radio resource control (RRC) connections. This in particular can mean that the RRC state of a UE is typically understood relative to the network (rather than relative to a specific serving cell).

[0045] Furthermore, such wireless communication systems for cellular networks can use one or more cluster establishment options corresponding to the UE's initial access and / or cluster update mechanism (e.g., which controls the composition of base stations in the cluster after the UE's initial access). These can include, for example, "greedy," downlink-based (DL), uplink-based (UL), and / or real-time methods (and any corresponding message exchange).

[0046] Implementation of radio protocols in cellular networks In some wireless communication systems, "trunking partitioning" refers to the dynamic division of a trunk serving a UE into logical sub-trunks for a specific radio bearer. This division may determine the protocol stack architecture applied to that trunk. For example, each sub-trunk may correspond to a separate Logical Communication Entity (RLC) entity. Then, base stations within the same sub-trunk may, for example, carry a copy of the same logical RLC entity for a given radio bearer.

[0047] Figure 2 Figure 200 illustrates various aspects of the radio protocol used in a cellular-free network mechanism. UE 202 is served by cluster 204. Within cluster 204, there exists a first sub-cluster 206 corresponding to a first RLC entity 210 used between UE 202 and cluster 204, and a second sub-cluster 208 corresponding to a second RLC entity 212 used between UE 202 and cluster 204. The first RLC entity 210 and the second RLC entity 212 are RLC entities used by a PDCP entity 218, which corresponds to the radio bearer between UE 202 and cluster 204 and uses the illustrated cluster partitioning.

[0048] As illustrated, the first RLC entity 210 is synchronized 214 across the base stations (BS1, BS2, and BS3) of the first sub-cluster 206. This means, for example, that each of these base stations has a copy of the first RLC entity 210 and operates according to that copy, as shown. Furthermore, the second RLC entity 212 is synchronized 216 across the base stations (BS4, BS5, and BS6) of the second sub-cluster 208. This means, for example, that each of these base stations has a copy of the second RLC entity 212 and operates according to that copy, as shown. It should be noted that, as illustrated, the arrangement of specific base stations of a cluster as either the first sub-cluster 206 or the second sub-cluster 208 can be transparent to the UE (the UE knows about the first RLC entity 210 and the second RLC entity 212 (according to the sub-cluster) / operates according to the first RLC entity and the second RLC entity, regardless of the specific base stations under those RLC entities / sub-clusters).

[0049] In the illustrated scenario, the first packet 220 of the radio bearer corresponding to PDCP entity 218 is processed at the first RLC entity 210. This ultimately means that the first packet 220 is transmitted between UE 202 and cluster 204 via one or more base stations of the first sub-cluster 206. Furthermore, the second packet 222 of the (same) radio bearer corresponding to PDCP entity 218 is processed at the second RLC entity 212. This ultimately means that the second packet 222 is transmitted between UE 202 and cluster 204 via one or more base stations of the second sub-cluster 208.

[0050] The idea is that cluster partitioning can be updated over time. The establishment and / or updating of cluster partitioning can take into account QoS requirements and service characteristics associated with radio bearers. For example, latency constraints and / or service periodicity can be considered. These mechanisms allow the network (e.g., CCF) to optimally configure multi-connectivity of UEs to enabled sub-clusters in scenarios such as non-ideal backhaul (where different partitions of the same cluster may have significantly different QoS / service management characteristics).

[0051] In some wireless communication systems, radio protocols in cellular networks utilize concepts such as trunking / sub-trunking and RLC synchronization. Functionality for controlling dynamic updates of trunking partitions and corresponding protocols for the update process can be used. PDCP data routing options and corresponding configurations can be used. Finally, cellular radio bearer configuration and / or message exchange procedures for radio bearer establishment can be used.

[0052] Implementation plan for establishing MAC entities Figure 3 Figure 300 illustrates a base station cluster 302 and its MAC entity option 312 according to the implementation scheme discussed herein. Cluster 302 uses a first base station 304 (BS1), a second base station 306 (BS2), and a third base station 308 (BS3) to serve UE 310.

[0053] For cluster 302, the following MAC entity options 312 exist. A first MAC entity option can be used with a first MAC entity 314 using a first base station 304. A second MAC entity option can be used with a second MAC entity 316 using a second base station 306. A third MAC entity option can be used with a third MAC entity 318 using a third base station 308. A fourth MAC entity option can be used with a fourth MAC entity 320 using a first base station 304 and a second base station 306. A fifth MAC entity option can be used with a fifth MAC entity 322 using both a first base station 304 and a third base station 308. A sixth MAC entity option can be used with a sixth MAC entity 324 using both a second base station 306 and a third base station 308. A seventh MAC entity option can be used with a seventh MAC entity 326 using a first base station 304, a second base station 306, and a third base station 308.

[0054] Regarding the design of MAC entities, each MAC entity created for a UE is associated with a unique set of base stations serving that UE. If the Xn latency of inter-base station communication within the MAC entity and the latency provided by MAC scheduling coordination are acceptable for the RLC entity, then the MAC entity can connect to (and potentially serve) the RLC entity. This connection between the RLC entity and the MAC entity can be activated and / or deactivated on a near real-time timescale (causing the MAC entity to begin actively serving / stop actively serving the RLC entity).

[0055] It is important to note that the timescale for making decisions regarding MAC entity creation is typically longer than the timescale for activating / deactivating RLC entity-to-MAC entity connections. For example, MAC entity creation is usually a non-real-time process, where the set of MAC entities created can be updated, for example, on the order of seconds. However, the activation of MAC entity-to-RLC entity connections can be a near real-time process (a much faster process), which can occur on the order of tens or hundreds of milliseconds.

[0056] Implementation of multiple MAC entities in a cellular network In some wireless communication systems, a MAC entity is associated with both the UE and a subset of base stations. Furthermore, in some cases, a UE may have more than one MAC entity. B is provided as the set of base stations in the system, and It is provided as a set of MAC entities in the system. A MAC entity maps data to the radio resources of all base stations associated with it. The radio resources of each base station can be allocated among the MAC entities associated with that base station.

[0057] Figure 4 Figure 400 illustrates a network-level view of a wireless communication system 402, showing the relationships between the various MAC entities used in the wireless communication system 402 and their relationships with the various base stations. As shown, each MAC entity uses a corresponding base station (and note that there are multiple multi-BS MAC entities and one single-BS MAC entity). For example, as can be seen from the wireless communication system 402 (and as indicated in the first list 404), MAC entities M 1406 includes base stations b 0420, Base Station b 2424 and base station b 3426; MAC entity M 2408 includes base stations b 3426 and base station b 4428; MAC entity M 3410 includes base stations b 0420, Base Station b 4428 and base station b5430; MAC entity M 4412 includes base stations b 0420 and base station b 6432; MAC entity M 5414 includes base stations b 6432 and base station b 7434; MAC entity M 6416 includes base stations b 0420; and MAC entity M 7418 includes base stations b 0420, Base Station b 1422, Base Station b 2424, Base Station b 3426, Base Station b 4428, Base Station b 5430, base station b 6432 and base station b 7434.

[0058] A MAC scheduler may be provided as a module in / used in wireless communication system 402. The MAC scheduler may be responsible for radio resource allocation and for selecting transmission parameters (e.g., modulation and coding scheme (MCS), rank, pre-decoding options, etc.) for such transmissions. Furthermore, in a cellular network, the MAC scheduler may be a network-level algorithm operating across base stations of wireless communication system 402.

[0059] Implementation plan for cell-free, UE-centric MAC entity configuration Figure 5 Figure 500 illustrates a portion of the protocol stack 502 corresponding to the MAC configuration discussed herein and its visual application within cluster 504. As shown, cluster 504 uses a first base station 506 (BS1), a second base station 508 (BS2), and a third base station 510 (BS3) to serve UE 512.

[0060] Figure 500 illustrates a PDCP entity 514 corresponding to a radio bearer, which is served by a first RLC entity 516 and a second RLC entity 518 in a manner discussed herein. The first RLC entity represents a first sub-cluster comprising a first base station 506 (BS1) and a second base station 508 (BS2), and the second RLC entity represents a second sub-cluster comprising a third base station 510 (BS3).

[0061] Figure 500 also illustrates that the first RLC entity 516 is itself served by the first MAC entity 520, which can perform MAC scheduling using the first base station 506 and the second base station 508, and the second RLC entity 518 is served by the second MAC entity 522, which can perform MAC scheduling using the third base station 510.

[0062] For example, in Figure 5 In this example, the first MAC entity 520 and the first RLC entity 516 share a common extension with respect to the included base stations, and the second MAC entity 522 and the second RLC entity 518 share a common extension with respect to the included base stations. This is given by way of example and not limitation. For example, although in this case the first MAC entity 520 covers all base stations of the sub-cluster of the first RLC entity 516, this should be understood only by way of example (it is possible for a MAC entity to cover less than all base stations of the RLC entity / sub-cluster it serves).

[0063] In some wireless communication systems, resource allocation decisions for a MAC entity with multiple base stations (e.g., the first MAC entity 520 shown in the figure) are made jointly by the base stations within that MAC entity. As an example, for the first MAC entity 520, the resource allocation decision may be made by the first base station 506 and provided to the second base station 508 via the Xn interface. Due to the Xn delay, resource allocation decisions can be made for future transmission time intervals (TTIs) (at least with an applicable Xn delay in advance). This is understood as adding the Xn delay to the total scheduling delay. Therefore, joint resource allocation used in this way can be understood as providing high spectral efficiency, but introducing / increasing delay. Thus, in the context of allocating delay-tolerant traffic, such joint scheduling may be a reasonable choice.

[0064] In some wireless communication systems, resource allocation decisions across multiple MAC entities used by a UE (e.g., across a first MAC entity 520 and a second MAC entity 522 used by UE 512) can be made in a decentralized manner by base stations of different MAC entities used by the UE. First, those base stations can agree on a coordinated allocation pattern (in the time, frequency, and / or spatial domains) to be applied over a period of time. As an example, the base stations can agree to allow scheduling of the first MAC entity 520 at even-numbered TTIs and further allow scheduling of the second MAC entity 522 at odd-numbered TTIs. Other possible examples may include having base stations agree on coordination in the frequency band and / or spatial domain (for multi-antenna UEs). In real time, each base station can decide to schedule the MAC entity according to the coordinated allocation pattern. Therefore, decentralized scheduling used in this way can be understood as not increasing latency, but potentially achieving lower spectral efficiency compared to joint decision-making options across MAC entities.

[0065] Implementation schemes for single-base station and cross-base station MAC schedulers It can be assumed that a single-base station scheduling algorithm is available, which can allocate radio bearers (RBs) and select transmission parameters for the UEs (MAC entities) it serves. However, more specific aspects of the scheduler (such as the scheduler being of a particular type) may not be assumed; instead, for these aspects, the MAC scheduler can be conceived as a "black box" / implementing a "black box" algorithm.

[0066] Envision enhancing this single-base station scheduling algorithm to make it usable as a multi-base station scheduling algorithm. This enhancement could provide resource allocation for jointly scheduled base stations, with the allocation being jointly optimized for the UEs served by these base stations. In some cases, with this enhancement, each UE could obtain PHY measurements and link quality estimates from the jointly scheduled base stations. In other cases, with this enhancement, joint multiple-input multiple-output (MIMO) pre-decoding and reception could be considered, if the PHY supports it.

[0067] Figure 6 An example is shown of a MAC entity that can be scheduled by the cluster's MAC scheduler 604. M Figure 600 of 1602. As shown in the figure, the MAC entity... M 1602 includes base stations b 0606, Base Station b 1608 and base stations b 2610.

[0068] MAC scheduler 604 can schedule MAC entities based on various inputs. M 1602, these inputs include using MAC entities M UE buffer state / service history 612, using MAC entity 1602 M UE PHY measurement / link quality estimation 614 for 1602, and / or using MAC entity M 1602 UE's link adaptation / QoS parameters 616. The output of MAC scheduler 604 may include resource allocation 618 (e.g., time-domain and frequency-domain resource allocation) and / or transmission parameters 620 (e.g., modulation and decoding scheme (MCS), rank, pre-decoding, etc.) for the UE.

[0069] This enhancement provides a solution to scheduling problems in specific cases where the MAC entities of all UEs overlap as subsets of base stations or where such MAC entities do not intersect. However, it should be noted that the existence of these conditions would be atypical for many user-centric non-cellular network applications as envisioned and described herein. More typically, the MAC entities of the cluster (as discussed herein, envisioned as subsets of base stations) would significantly overlap with each other. See, for example... Figure 4Wireless communication system 402.

[0070] Implementation scheme for general MAC scheduling in cellular networks Therefore, this paper discusses systems and methods for performing resource allocation among multiple MAC entities (each with one or more base stations) in situations where the base station sets of MAC entities may overlap (e.g., including cases with significant overlap). Such situations are expected to be common in specific implementations of cell-free, user-centric networks as discussed herein.

[0071] Therefore, the resource allocation algorithm proposed for the implementation discussed in this paper addresses the problem of extending such methods to cases of overlapping base station sets. It is expected that such a resource allocation solution is scalable (e.g., applicable to networks of any size), minimizes introduced coordination latency, makes the coordination latency of any single base station MAC entity negligible, and / or maximizes communication efficiency (e.g., spectral efficiency) while maintaining fairness across the entire system. The implementation of the general solution for resource allocation in a cellular-free, user-centric approach for MIMO networks discussed in this paper is built upon these characteristics.

[0072] The implementations discussed in this paper provide various protocol enhancements. These implementations introduce the concept of a resource allocation chain responsible for the base station and MAC entities. They provide functionality for a Layer 3 (L3) scheduler to construct and update the resource allocation chain. The implementations define the interactions between the L3 scheduler and the CCF, enabling the functionality described herein. They provide real-time cross-BS input and / or output messages for resource allocation decisions. The implementations address the configuration of a real-time radio resource scheduler. Finally, they address the concept of a virtual MAC and related methods for establishing fairness throughout the system.

[0073] Implementation plan for L3 processes used in resource allocation chain management Figure 7 An example network topology 700 is illustrated, for which one or more resource allocation chains can be established. As shown in the figure, the set of base stations B within network topology 700 includes base stations b 0702, Base Station b 1704 and base stations b 2706.

[0074] In some implementation schemes, for each base station b , b The resource allocation chain of radio resources is defined as a finite sequence of base stations: Ch( b ) ( Ch 0( b ), Ch 1( b ), …, Ch n(b) ( b )),in: • Ch k ( b ) B is the base station number. b The first of the chain k One element; • n ( b ) It is the base station number b The number of elements in the chain minus one; • Ch 0( b ) = b ; indicates that the chain starts from its corresponding base station, and • Ch i ( b ) ≠ Ch j ( b ), i ≠ j This indicates that each base station in the same chain is different from the others.

[0075] In this algorithm, a single resource allocation chain is constructed for each base station, therefore, for each k = 1, …, n ( b )definition Ch k ( b ) B. The purpose of constructing the resource allocation chain is to define which base stations (and in what order) will be allocated to base stations. b Radio resources. Base station. Ch n(b) ( b Start BS b Resource allocation involves allocating some resources and then transmitting the results to the base station. Ch n(b)-1 ( b Therefore, it should be understood that base stations Ch k ( b (It is not) Ch n(b) (b )) can be obtained from the base station Ch k+1 ( b Receiving base station b Partial allocation results for this base station. Ch k ( b Then continue allocating some of the remaining available resources without touching any resource allocations that have already been made.

[0076] refer to Figure 7 The network topology presented in the image is 700, where B = { b 0, b 1, b 2}, an example set of such resource allocation chains (among various possibilities) is: • Ch ( b 0) = ( b 0, b 1, b 2), of which n ( b 0) = 2; • Ch ( b 1) = ( b 1), of which n ( b 1) = 0; and • Ch ( b 2) = ( b 2, b 0), of which n ( b 2) = 1.

[0077] It should be noted that in this article, when providing a resource allocation chain... Ch ( b During related discussions, base stations b This can be referred to as a "resource allocation chain". Ch ( b The base station described.

[0078] Implementation plan for time planning of resource allocation chain In some implementation schemes, it is possible to time δ The scheduling algorithm is executed at each base station. Furthermore, the network is aware of the latency of Xn communication between base stations. (Base station) b i to base station b j The communication delay can be represented as follows: l ( b i ,b j ) Note that in some examples in this article, the notation... l ( b i , b j This can be further simplified / abbreviated to equivalent notation. l i,j .

[0079] Within this framework, along b The decision propagation time of the chain can be defined as follows: ,in: (otherwise ).

[0080] Therefore, in base stations Ch k ( b The base station was used at ) b The TTI during resource allocation and the current TTI (i.e. Ch k ( b The time interval between resource allocation (TTI) should not be less than [amount missing]. .

[0081] Figure 8 Figure 800 illustrates an example of time planning for a resource allocation chain according to the implementation scheme discussed herein. Figure 800 illustrates a system including a base station. b 0802, Base Station b 1804 and base station b Network topology of 2806.

[0082] In addition, Figure 800 illustrates examples used for base stations b 0802 resource allocation chain 812 Ch ( b 0) = ( b 0, b 1, b 2) Details of the resource allocation "path" (and note the following) n ( b 0) = 2). More specifically, Figure 800 illustrates the notation according to resource allocation chain 812. Ch ( b 0) = ( b 0, b 1, b 2): • First, base station b 2806 base station allocationb Resources for 0802. The time spent on this allocation is (less than or equal to) [amount missing]. δ .

[0083] • Second, at the base station b The results of the resource allocation decisions made at location 2806 were communicated to the base station. b 1804 (This base station is the next base station in the resource allocation chain). The time spent on this communication corresponds to the base station. b 2806 and base station b The first delay 808 of the Xn interface between 1804 is shown in Figure 800 as follows. l ( b 1 , b 2 ).

[0084] • Third, base stations b 1804 base station allocation b The (previously unallocated) resources for 0802. The time taken for this allocation is (less than or equal to) [amount missing]. δ .

[0085] Fourth, at the base station b 2806 and base station b The results of resource allocation decisions made at each of the 1804 points are communicated to the base station. b 1804 (This base station is the next base station in the resource allocation chain). The time spent on this communication corresponds to the base station. b 1804 and base station b The second delay 810 of the Xn interface between 0802, which is represented in diagram 800 is as follows l ( b 0 , b 1 ).

[0086] Fifth, base stations b 0802 base station allocation b The (previously unallocated) resources for 0802. The time taken for this allocation is (less than or equal to) [amount missing]. δ .

[0087] Note that the time amounts referenced in the first five steps correspond to those shown in Figure 800. L (0, 2, b The calculation of 0) (using the formula given above). The final result is, as shown in the figure, calculated backwards from the target TTI, at the base station b The minimum amount of time required for resources to be allocated at location 0802 (i.e., the base station at the beginning of the resource allocation chain) b2806 The time required to begin the process is equal to the sum of the following three items: base station b 2806 and base station b The first delay of the Xn interface between 1804 and 1808 ( l ( b 1 , b 2 ), base station b 1804 and base station b The second delay of the Xn interface between 0802 and 0802 is 810 ( l ( b 0 , b 1 The individual time required for each of the three base stations in the resource allocation chain to perform resource allocation decision processing / generation (3) δ ).

[0088] Implementation plan responsible for base station and time planning In some implementations, for each MAC entity ,in M With base station subset Relatedly, a responsible base station can be defined. This responsible base station is represented as... Responsible for MAC entity M The allocation of radio resources. The radio resources discussed are MAC entities. M Radio resources on all base stations in the system. To simplify implementation, the base station responsible for the MAC should be understood as being associated with the MAC entity (i.e., ).

[0089] Now we introduce the concept of advance planning time for MAC entities. This advance planning time is the (minimum) time distance between the moment of the resource allocation decision and the closest possible allocation of resources in the time domain. Accordingly, if the MAC entity is determined by the base station... Ch k ( b If it is allocated, then it cannot be allocated / provided with more time than in the time domain. L ( k , b It is closer to the current TTI resources.

[0090] The chain index function can be defined as follows: .

[0091] Therefore, assuming a resource allocation chain has been established and responsible base stations have been assigned, the advance planning time for MAC can be defined as: .

[0092] Figure 9 Figure 902 illustrates an example of time planning for a MAC entity according to the implementation scheme discussed herein. Figure 902 illustrates a system including a base station. b 0904, Base Station b 2906, Base Station b 3908, Base Station b 4910, Base Station b 5912 and base station b Network topology of 6914. As shown in the figure, base station... b 0904, Base Station b 2906, Base Station b 3908 is included in the MAC entity. M 1916 (Simultaneous base station) b 4910, Base Station b 5912 and base station b 6914 was not included in the MAC entity ( M (1916)

[0093] As shown in the figure, the base station b 0904 acts as a MAC entity M The base station responsible for 1916. Therefore, it applies to MAC entities. M The advance planning time for 1916 is for each base station within that MAC entity. b The longest decision propagation time calculated at each resource allocation chain L (0, k 1, b ), where in each case, k 1 is the index of the location of the base station within the resource allocation chain.

[0094] In the illustrated example, for the MAC entity M 1916, using base stations b 0904's first resource allocation chain 918, used for base stations b 2906's second resource allocation chain 920 and for base stations b Each of the three resource allocation chains 3908 and 922 is used to calculate the applicable decision propagation time. L (0, k 1, b ),in k 1 is configured as a base station in each case. b 0904 is the index position within the applicable resource allocation chain.

[0095] According to this formula, the base station b The applicable decision propagation time for 0904 is L (0, 0, b0 In addition, base stations b The applicable decision propagation time for 2906 is L (0, 2, b 2 Furthermore, base stations b The applicable decision propagation time for 3908 is L (0, 2, b 3 Therefore, it applies to MAC entities. M The total advance planning time for 1916 was L (0, 0, b 0 ), L (0, 2, b 2 )and L (0, 2, b 3 The longest one (in terms of time) is shown in the figure.

[0096] Implementation plans corresponding to feasibility and optimality In some implementations, the algorithm for scheduling cellular-free MAC entities may have the following characteristics: • For each Build a resource allocation chain ;as well as • For each MAC entity M Assign responsibility for base stations (of which) , This allows the following feasibility conditions to be met: , .

[0097] A pair ( Ch , Rsp A set of resource allocation chains (i.e., the set of responsible base station sets constructed for the base stations of the system, and the set of responsible base station assignments for one or more base stations in the system) is considered feasible if it satisfies the feasibility conditions of all MAC entities in the system. It should be noted that, according to the implementation scheme described in this paper, at least one feasible set can always be found. right.

[0098] Given , , , and latency Plan your time in advance It is uniquely defined for each MAC entity. The system can be configured to implement... The lower value of . The corresponding optimization problem can be defined as follows: • The minimum value is obtained over all feasible pairs; and • ,in It is a MAC entity M The maximum tolerable delay.

[0099] In some implementation schemes, the proposed measures are aimed at The steps to construct a feasible solution include: 1. For each MAC Select base station One of the base stations becomes the responsible base station.

[0100] 2. For each base station Provide a list This list contains all those with [certain features] in their base station collection. b MAC entity: .

[0101] 3. For each base station Create a list containing all those responsible One or more MAC entities in the base station (excluding) b (Itself), specifically as follows: .

[0102] 4. Regarding The elements in the data are sorted (e.g., by base station identifier (ID)) and the sorting result is identified using a portion of the resource allocation chain, as follows: .

[0103] 5. By adding an element at the beginning of the chain. b To build : .

[0104] It should be noted that performing the build in this manner satisfies... Feasibility conditions.

[0105] Optimization opportunities (flexibility) for the above process include, for example, according to section 1 above. Perform optimization selection and execute according to section 4 above. Perform optimized sorting.

[0106] Figure 10 Figure 1000 illustrates the construction of a feasible solution corresponding to the implementation scheme discussed herein. Figure 1000 again uses, as Figure 4 The wireless communication system 402 discussed herein includes the same configuration as that used in the MAC entity and base station as indicated in the first list 404, as in Figure 4As described in the discussion.

[0107] Assuming the wireless communication system 402 is defined according to the first list 404, a second list 1002 can be generated according to part 1 above, which represents the definition of each MAC entity. M The base station responsible Rsp ( M (The choice of )

[0108] Furthermore, assuming again that the wireless communication system 402 is defined according to the first list 404, a third list 1004 can be generated according to the above part 2, which represents the MAC entity including each base station.

[0109] Then, a fourth list 1006 can be generated based on parts 3, 4, and 5 above. This fourth list represents the list used for base stations. b Resource allocation chain for each base station in Ch ( b This solution is feasible for the MAC entity arrangement of the wireless communication system 402.

[0110] It should be noted that Figure 1000 also includes information for each MAC entity. M The fifth list 1008 lists the advance planning times, which can be calculated based on the responsible base station assignments in the second list 1002 and the resource allocation chain in the fourth list 1006 (time). Time ( M | Ch , Rsp (See, for example, the section “Implementation Plan for Base Station and Timing Planning” described elsewhere in this document).

[0111] Implementation plan of L3 process In some implementations, from the perspective of the overall cellular-free architecture, ( Ch , Rsp The selection / construction of solutions is considered a near real-time process and therefore can be categorized under the control of the L3 scheduler, or can be regarded as a function of the L3 scheduler. The L3 scheduler can be understood as a RAN function. For example, the L3 scheduler can be implemented across RAN nodes (e.g., BS, CU, and / or Distributed Unit (DU)) by RAN cloud entities and / or dedicated control entities (e.g., RAN Intelligent Controller (RIC)).

[0112] Consider using the L3 scheduler with ( Ch , Rsp Other behaviors related to the effective solution of the resource allocation chain. These other behaviors may include behaviors for maintaining (e.g., an already constructed) set of resource allocation chains. These other behaviors may also / optionally include behaviors for (re)selecting base stations.

[0113] We will now discuss the L3 behavior corresponding to instances of MAC entity addition and / or removal. First, to recap, the CCF in a cellular-free system is responsible for the creation and removal of L2 entities. Therefore, the CCF can decide to add a MAC entity to the system or remove an existing MAC entity from the system.

[0114] Regarding the case of adding an unrepresented / unused MAC entity to a non-cellular system, it should be noted that the MAC entity can always be included in ( Ch , Rsp In existing L3 schemes, this avoids increasing the advance planning time for any existing MAC entities. For example, after creating a MAC entity, for some base stations... b , It can be changed to include that MAC. Therefore, the set It may also be necessary to update the chain to include more base stations. This will be necessary if these new base stations are added to the existing chain. At the end of the timeline, the advance planning time for existing MAC entities will remain unchanged.

[0115] It will also be understood that removing a MAC entity from the system will not increase the advance planning time for any remaining MAC entities.

[0116] In the event of L3 chain reconfiguration (which can occur periodically and / or based on triggering events), the L3 scheduler can run an optimization process that includes reselecting the responsible base station and / or rebuilding the resource allocation chain (generating a new one). Ch , Rsp The goal of this approach is to modify (e.g., further minimize) one or more latency characteristics of a distributed resource allocation scheme.

[0117] Figure 11 A flowchart 1100 illustrates the communication between the CCF 1102 and the L3 scheduler 1104, according to the implementation scheme discussed herein, corresponding to the first option for adding MAC entities.

[0118] First, CCF 1102 creates a new MAC entity 1106 ( M new The context information of the new MAC entity may include the constituent base stations of the new MAC entity. CCF 1102 transmits this context information to L3 scheduler 1104 via 1108.

[0119] Based on the context information of the new MAC entity received, the L3 scheduler 1104 selects the responsible base station for the new MAC entity 1110, which is one of the base stations of the new MAC entity.

[0120] The L3 scheduler 1104 then checks the resource allocation chain of each base station in the new MAC entity 1112. For each resource allocation chain that does not include the selected responsible base station, the selected responsible base station is added to the end of that chain.

[0121] Then, the L3 scheduler 1104 calculates the advance planning time of the new MAC entity 1114 based on the resource allocation chain of the base station in the new MAC entity (e.g., as described elsewhere in this document).

[0122] In some implementations, the L3 scheduler 1104 may optionally provide the CCF 1102 with the value of the advance planning time for the new MAC entity calculated by 1116.

[0123] It should be noted that the L3 scheduler 1104 will also transmit the value of the advance planning time of the new MAC entity to the base station responsible for the new MAC entity (not shown).

[0124] As shown in the figure, flowchart 1100 corresponds to the case where the resource allocation chain can be updated by appending an element (base station) to the end of the resource allocation chain. In this case, the advance planning time of the previous establishment of all previously established MAC entities in the system remains unchanged.

[0125] Figure 12 A flowchart 1200 illustrates the communication between the CCF 1202 and the L3 scheduler 1204, according to the implementation scheme discussed herein, corresponding to the second option for adding MAC entities.

[0126] First, CCF 1202 transmits 1206 the L3 scheduler 1204 latency requirement for any existing MAC entity.

[0127] Then, CCF 1202 creates a new MAC entity 1208 ( M new The context information of the new MAC entity may include the constituent base stations of the new MAC entity. CCF 1202 transmits this context information to L3 scheduler 1204 via 1210.

[0128] Based on the context information of the received new MAC entity, the L3 scheduler 1204 selects the responsible base station for the new MAC entity 1212, which is one of the base stations of the new MAC entity.

[0129] The L3 scheduler 1204 then checks the resource allocation chain for each base station in the new MAC entity 1214. For each resource allocation chain that does not include the selected responsible base station, the selected responsible base station is added to a position within the resource allocation chain. Note that this position is not (not necessarily) at the end of the resource allocation chain.

[0130] Then, the L3 scheduler 1204 (re)calculates the advance planning time for each MAC entity of system 1216 having at least one base station described by one of the updated resource allocation chains. In other words, the L3 scheduler 1204 calculates the advance planning time of the new MAC entity based on the resource allocation chains of the base stations in the new MAC entity, and recalculates any advance planning time for any existing MAC entities having at least one base station described by one of the updated resource allocation chains. These calculations use the resource allocation chains of the base stations in each of these MAC entities (e.g., as described elsewhere herein, as updated resource allocation chains).

[0131] In some implementations, the L3 scheduler 1204 may optionally provide the CCF 1202 with the value of the (re)calculated advance planning time calculated by 1218.

[0132] It should be noted that the L3 scheduler 1204 will also communicate the value of each (re)calculated advance planning time for the corresponding MAC entity to the base station responsible for that MAC entity (not shown).

[0133] As shown in the figure, flowchart 1200 corresponds to not necessarily appending elements to the end of the resource allocation chain (such as...). Figure 11 (As shown), instead of updating the resource allocation chain, it involves adding elements at other locations in the chain. The location for adding elements can be determined based on optimization principles described elsewhere in this document, for example. Therefore, corresponding to such cases, the advance planning time for one or more existing MAC entities can be changed.

[0134] Figure 13 A flowchart 1300 illustrates the communication between the CCF 1302 and the L3 scheduler 1304, according to the implementation scheme discussed herein, corresponding to the option for MAC entity removal.

[0135] First, CCF 1302 removes a certain MAC entity from use (the removed MAC entity is referred to as the "old MAC entity" and is represented as...). M old CCF 1302 sends a notification to L3 scheduler 1304 that the old MAC entity 1308 has been removed.

[0136] Then, for each base station in the old MAC entity, the L3 scheduler 1304 checks 1310 whether any remaining MAC entities to which that base station belongs are using the same responsible base station as the responsible base station of the old MAC entity. If this is not the case, the responsible base station of the old MAC entity is removed from the resource allocation chain of the base station being checked.

[0137] Subsequently, flowchart 1300 recalculates the advance planning time for any MAC entity of a base station described by the modified resource allocation chain (e.g., as described elsewhere in this document).

[0138] In some implementations, the L3 scheduler 1304 may optionally provide the CCF 1302 with any (re)calculated advance planning time value calculated by 1314.

[0139] It should be noted that the L3 scheduler 1304 will also communicate the value of each (re)calculated advance planning time for the corresponding MAC entity to the base station responsible for that MAC entity (not shown).

[0140] It should be noted that under the mechanism described above, the advance planning time for each remaining MAC entity can remain the same or be reduced (but will not increase).

[0141] Figure 14 A flowchart 1400 illustrates the communication between the CCF 1402 and the L3 scheduler 1404 according to the implementation scheme discussed herein, corresponding to the L3 process for reconfiguring the resource allocation chain.

[0142] First, CCF 1402 transmits 1406 the L3 scheduler 1404 latency requirement for any existing MAC entity.

[0143] Then, the L3 scheduler 1404 selects a new responsible base station 1408 for each MAC entity (it should be understood that, in some cases, the previously responsible base station for the given MAC entity in question can be reselected here). For example, this reconfiguration can be based on... , It happened, among which It is a MAC entity M The maximum tolerable latency, as provided by the CCF to the L3 scheduler. Alternatively, this reconfiguration can occur based on a triggering condition corresponding to an indication that the sum of the pre-planned times for identifying outgoing / receiving MAC entities has exceeded a threshold. The L3 scheduler 1404 also continues to build resource allocation chains for each base station in the system corresponding to the newly selected responsible base station for the MAC entity.

[0144] L3 scheduler 1404 then continues to identify TTI 1410, during which the newly selected responsible base station and the newly constructed resource allocation chain should begin operation. This TTI can be represented as... T new .

[0145] The L3 scheduler 1404 further recalculates the advance planning time for each MAC entity 1412 using the newly selected responsible base station and the newly constructed resource allocation chain (e.g., as described elsewhere in this document).

[0146] In some implementations, the L3 scheduler 1404 may optionally provide the CCF 1402 with the value of the recalculated advance planning time and / or TTI calculated by 1414. T new Instructions.

[0147] It should be noted that the L3 scheduler 1304 also transmits the value of each recalculated advance planning time of a MAC entity to the base station responsible for that MAC entity (not shown).

[0148] The process for reconfiguring the resource allocation chain can begin periodically (e.g., according to a pre-configured time period), and / or the use of such reconfiguration can be based on specific triggering conditions (e.g., when...). The value is identified as being greater than a pre-configured threshold.

[0149] Implementation plan for real-time base station process The mechanisms used for inputting and outputting resource allocation decisions at the base station are now discussed. Specifically, the base station is discussed. b The input and / or output message exchange stream for resource allocation decisions at the base station. b It can participate in multiple resource allocation chains ( In addition, base stations b It can be a responsible base station used to perform resource allocation for one or more MAC entities. ).

[0150] For each Base station b Keep The latest version of resource allocation. This resource allocation is based on data from the predecessor base station. Input and based on base station b The allocation decision is updated accordingly.

[0151] In each TTI, after receiving and processing any input messages, for each The resource allocation process takes place within a specific future TTI. The time used to calculate resource allocation is... δ .

[0152] In each TTI, at the time of the current moment δ The resource allocation process initiated before each TTI applies to all After completion, for each All future TTIs (the allocation results of which are at the base station)b (provided by) The current resource allocation result is transmitted to the successor base stations in the resource allocation chain: .

[0153] In addition, if the base station b For any TTI T Once it has made its own resource allocation decision, it will implement that decision in that TTI.

[0154] Based on this mechanism, it should therefore be understood that the information sent to the base station... b The set of one or more precursor base stations that provide input messages is represented as In addition, base stations b The set of one or more successor base stations that provide output messages to it is represented as .

[0155] Figure 15A Figure 1502 illustrates the process from Prec(b) base station set 1508 to base station b 1506 is the input for previous resource allocation decisions for one or more MAC entities, and from the base station b The subsequent outputs of the resource allocation decisions for one or more MAC entities from base station set 1506 to Succ(b) 1510.

[0156] Figure 15B Examples of the same Figure 15A Corresponding base stations b Flowchart 1504 details the communication between Prec(b) base station set 1508 and Succ(b) base station set 1510.

[0157] like Figure 15B As shown, Prec(b) base station set 1508 directs to base station b 1506 transmits information from 1512 regarding any previous resource allocation decisions for one or more MAC entities. This information may include resource allocation decisions made at any one or more base stations in the Prec(b) base station set 1508. This resource allocation information may also include resource allocation decisions received at the Prec(b) base station set 1508 from more distant preceding base stations (e.g., such as...). Figure 15A (As shown).

[0158] base station b 1506 then processes the resource allocation decision information received from 1514. Considering the received resource allocation decision information, the base station... b 1506 then runs schedule 1516 to update / create resource allocation decisions. For example, a base station bThe resource allocation decisions for each MAC entity under the responsibility of 1506 are made by the base station. b 1506 is made and added to the resource allocation information set previously received from the Prec(b) base station set 1508.

[0159] base station b 1506 then transmits 1518 resource allocation information to the Succ(b) base station set 1510 (e.g., as in base station b (1506 updates / creations).

[0160] In addition, if the base station b 1506 for any TTI T Once it has made its own resource allocation decision, it will execute that decision in TTI 1520.

[0161] It should be noted that, although in Figure 15A In the specific implementation shown, each of the Prec(b) base station set 1508 and the Succ(b) base station set 1510 is shown as including multiple base stations, but in an alternative case, one or both of these sets may include only a single base station.

[0162] The mechanism of real-time scheduling at the base station will now be discussed. Specifically, the base station will be discussed. b The MAC scheduling process and message exchange for resource allocation decisions. Base station b It can participate in multiple resource allocation chains ( In addition, base stations b It can be a responsible base station used to perform resource allocation for one or more MAC entities. ).

[0163] For each TTI, ,exist Run the real-time resource allocation process. Here, Δ is the implementation time of the scheduling decision, which includes the applicable time corresponding to the downlink (DL) and uplink (UL), respectively. K 0 (the time slot between the transmission of downlink control information (DCI) and the associated physical downlink shared channel (PDSCH)) and K 2 (the time slot between DCI and the associated Physical Uplink Shared Channel (PUSCH) transmission). Note the time used for calculating resource allocation, as discussed herein. δ It can be considered as already This item is to be considered.

[0164] In various implementation schemes, the resource allocation process (depending on the scheduler) can have the same advance planning time. MAC Allocated to base station Resources used for TTI: Note that the scheduler does not change what it already is. Any allocation made.

[0165] The scheduler can be configured to use information about what should be assigned later. Information about the MAC entities is used to ensure fairness. For example, the scheduler treats these MAC entities as "virtual MAC entities" when making allocation decisions (discussed further elsewhere in this article).

[0166] It should be noted that due to the nature of the cellular-free architecture, a UE may belong to more than one MAC entity. To enable resource allocation without real-time coordination, MAC entities for the same UE agree on a coordination allocation mode (in the time, frequency, or spatial domains, as described elsewhere in this document). The scheduler considers these constraints when performing real-time resource allocation.

[0167] Details regarding the use of virtual MAC entities and related fairness mechanisms are now provided. Consideration. It is a set of MAC entities that will be allocated by a specific base station for a specific TTI in the future. Therefore, all The advance planning time is the same and equal to In addition, consider .

[0168] A virtual MAC entity can be defined as: , represents the set of the following MAC entities whose planned allocation time is later than MAC entities and / or equal to The MAC entity, and Overlapping on one or more base stations of at least one MAC entity.

[0169] The scheduler operates at the base station to virtually allocate... Any remaining / still available resources for virtual MAC entities Note After obtaining the results from the real-time scheduler, only for... The allocation of MAC entities will actually be preserved / alongside. Succ ( b Any set of base stations is transmitted. The allocated resources are counted as unoccupied in this communication.

[0170] Figure 16AA network-level view of a wireless communication system 1602 is illustrated, showing the relationships between various MAC entities used by the wireless communication system 1602 and their relationships with various base stations. As shown, different MAC entities use different base stations. For example, as can be seen from the wireless communication system 1602, MAC entities... M 11610 includes base stations b 01604, Base Station b 11606 and base stations b 21608; MAC entity M 21612 includes base stations b 01604 and base station b 11606; MAC entity M 31614 includes base stations b 01604 and base station b 11606; and MAC entity M 41616 includes base stations b 01604.

[0171] Figure 16B This example illustrates how, without using a virtual MAC fairness mechanism, [the following is an example of something]... Figure 16A The first example 1618 is the resource distribution corresponding to the wireless communication system 1602. It can be assumed that resource allocation occurs according to the resource allocation chain 1620 shown, according to which the allocation order is: first, the base station... b 21608, then the base station b 11606, then the base station b 01604.

[0172] The first base station to make a resource allocation decision based on resource allocation chain 1620 is the base station. b 21608. Base station. b 21608 is a MAC entity. M The base station responsible for 11610 will correspondingly be used for MAC entities. M The first resource 1622 of 11610 is allocated to an unused resource block in the known set of resource blocks 1624. Note that the base station... b 21608 does not use the virtual MAC to consider 1626 when making its resource allocation decisions, and accordingly does not restrict its use of resource block 1624.

[0173] The next base station to make a resource allocation decision according to resource allocation chain 1620 is base station 1620. b 11606. Base station b 21608 is a MAC entity. M 11610 and MAC entities MEach of the 21612 is responsible for the base station. Therefore, the base station b 11606 will be used for MAC entities M The second resource 1628 of 21612 is allocated to the remaining unused resource blocks in the known set of resource blocks 1624. However, because the second resource 1628 has exhausted all the remaining resource blocks 1624, the base station... b 21608 is not a MAC entity. M 31614 Allocate resources.

[0174] In addition, it should be noted that base stations b 21608 does not use the virtual MAC to consider 1630 when making its resource allocation decisions, and it does not restrict its use of resource block 1624.

[0175] The next base station to make a resource allocation decision according to resource allocation chain 1620 is base station 1620. b 01604. Base station. b 21608 is a MAC entity. M The base station responsible for resource block 41616. However, all resources in resource block 1624 have already been scheduled. Therefore, the base station... b 01604 Cannot send to MAC entity M 41616 allocates any resources.

[0176] Therefore, according to Figure 16B It is understandable that, without using / considering virtual MAC entities, resources may be disproportionately distributed to favor MAC entities with relatively long lead times.

[0177] Figure 16C This example illustrates the use of a virtual MAC fairness mechanism, in contrast to... Figure 16A A second example 1632 of the resource distribution corresponding to the wireless communication system 1602. It can be further assumed that the resource allocation occurs according to the resource allocation chain 1620 shown.

[0178] The first base station to make a resource allocation decision based on resource allocation chain 1620 is the base station. b 21608. Base station. b 21608 is a MAC entity. M The base station responsible for 11610 will correspondingly be used for MAC entities. M The first resource 1634 of 11610 is allocated to an unused resource block in the known set of resource blocks 1624.

[0179] It should be noted that in this case, the base station b 21608 operates based on the usage of the first virtual MAC entity information 1642. (Base station) b21608 Based on the first virtual MAC entity information 1642, we know the MAC entity M 21612, MAC entity M 31614 and MAC entities M 41616 still needs to be scheduled by the downlink base station within resource block 1624. Therefore, the base station b 21608 restricts its use of resource block 1624 (comparison) Figure 16C The allocation of the first resource 1634 in the game and Figure 16B The allocation of the first resource 1622 in the middle).

[0180] The next base station to make a resource allocation decision according to resource allocation chain 1620 is base station 1620. b 11606. Base station b 11606 is a MAC entity. M 21612 and MAC entities M Each of the 31614 members is responsible for the base station. Therefore, the base station... b 11606 will be used for MAC entities M 21612's second resource 1636 and for MAC entities M The third resource 1638 of 31614 is allocated to an unused resource block in the known set of resource blocks 1624.

[0181] It should be noted that in this case, the base station b 11606 operates based on the use of the second virtual MAC entity information 1644. (Base station) b 21608 Based on the second virtual MAC entity information 1644, we know the MAC entity. M 41616 still needs to be scheduled by the downlink base station within resource block 1624. Therefore, the base station b 11606 restricts its use of resource block 1624 (comparison) Figure 16C The allocation of the second resource 1636 and the third resource 1638 in the middle Figure 16B The allocation of the second resource 1628 in the middle).

[0182] The next base station to make a resource allocation decision according to resource allocation chain 1620 is base station 1620. b 01604. Base station. b 01604 is a MAC entity. M The base station responsible for 41616. Therefore, the base station... b 01604 allocates the fourth resource 1640, which is used for the fourth resource 1640, to the unused resource blocks in the known set of resource blocks 1624.

[0183] It should be noted that in this case, the base station b01604 operates based on the use of the third virtual MAC entity information 1646. However, the third virtual MAC entity information 1646 indicates that there are no remaining virtual MAC entities to be scheduled by the downlink base station. Therefore, the base station... b 01604 does not restrict its use of resource block 1624.

[0184] Therefore, according to Figure 16C It is understandable that by using / considering virtual MAC entities, resources can be distributed more fairly among all relevant MAC entities, even if these MAC entities use different advance planning times.

[0185] In some implementations using virtual MAC entities, resources are allocated based on a priority strategy. In some cases, this priority strategy may depend on the applicable lead time.

[0186] We will now discuss real-time scheduling mechanisms consistent with the use of virtual MAC entities. In some implementations, the scheduler's input can be provided as: ,in: • It means to be in the same The set of allocated MAC entities; • Indicates to Base stations and TTIs that allocate resources. In this formula, and ; • Indicates to The existing allocation of resources is determined by the base station. b Make or be located in the resource allocation chain b The previous base station provided this allocation. In various implementations, this allocation is considered fixed (not located at the base station). b (modified by / not modified by this base station); and • This represents the set of virtual MAC entities participating in the overall resource allocation process. It should be understood that, after making an overall resource allocation decision that takes into account the set of virtual MAC entities, the resource allocations of these virtual MAC entities are removed / discarded (to release those resources).

[0187] Then, the scheduler's output can be provided to any downstream base station as... Updated resource allocation.

[0188] From and / or Each MAC can be provided to the scheduler as a structure containing the following: • UE's buffer state and service history; • PHY measurement and link quality estimation; • UE link adaptation and QoS parameters; and / or • Resource allocation constraints based on the coordinated allocation model.

[0189] Figure 17 A method 1700 for an L3 scheduler serving a UE's base station cluster according to an embodiment discussed herein is illustrated. Method 1700 includes identifying 1702 a first set of responsible base stations from the base station cluster, wherein each base station in the first set of responsible base stations is responsible for at least one MAC entity in a set of MAC entities used between the base station cluster and the UE, and wherein each MAC entity in the set of MAC entities includes one or more base stations in the cluster. Method 1700 further includes constructing 1704 a first set of resource allocation chains, wherein each resource allocation chain in the first set of resource allocation chains is used for one base station in the cluster. Method 1700 further includes calculating 1706 a first set of advance planning times for the set of MAC entities based on the first set of resource allocation chains, wherein each advance planning time in the first set of advance planning times is used for one MAC entity in the set of MAC entities. Method 1700 further includes providing 1708 the first set of advance planning times for the set of MAC entities to the first set of responsible base stations.

[0190] In some embodiments of method 1700, each resource allocation chain for each base station in the first set of resource allocation chains is constructed by: identifying a subset of MAC entities in the MAC entity set that includes a base station described by the resource allocation chain; adding each responsible base station in the first set of responsible base stations responsible for one or more MAC entities in the subset of MAC entities to the resource allocation chain; and adding base stations for the resource allocation chain to the resource allocation chain. In some such embodiments, method 1700 further includes sorting the resource allocation chain after adding each responsible base station in the first set of responsible base stations responsible for one or more MAC entities in the subset of MAC entities to the resource allocation chain and before adding base stations for the resource allocation chain to the resource allocation chain.

[0191] In some embodiments of method 1700, each advance planning time for each MAC entity in the first set of advance planning times is calculated by: identifying one or more resource allocation chains from the first set of resource allocation chains, the one or more resource allocation chains including each resource allocation chain in the first set of resource allocation chains used by the base stations of the MAC entity; using the one or more resource allocation chains to calculate one or more attributable scheduling times for the MAC entity; and selecting the longest attributable scheduling time among the one or more attributable scheduling times of the MAC entity as the advance planning time of the MAC entity. In some such embodiments, for each of the one or more resource allocation chains, each attributable scheduling time among the one or more attributable scheduling times of the MAC entity is calculated by summing the following: the total Xn interface delay corresponding to the Xn interface extending from the responsible base station to a portion of the resource allocation chain described by the resource allocation chain; and the total scheduling algorithm delay attributable to the use of the scheduling algorithm at each base station included in that portion of the resource allocation chain in the first set of responsible base stations.

[0192] In some implementations, method 1700 further includes: identifying a trigger condition indicating that a second set of resource allocation chains should be used; identifying a responsible second set of base stations from the base station cluster in response to identifying the trigger condition, wherein each base station in the responsible second set of base stations is responsible for at least one MAC entity in the MAC entity set; constructing a second set of resource allocation chains based on receiving the trigger condition, wherein each resource allocation chain in the second set of resource allocation chains is used for one base station in the cluster; calculating a second set of advance planning times based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for one MAC entity in the MAC entity set; and providing the second set of advance planning times for the MAC entity set to the responsible second set of base stations. In some such implementations, the trigger condition includes an indication that the sum of a first set of advance planning times has exceeded a threshold.

[0193] In some implementations, method 1700 further includes: determining that the validity period of a first set of resource allocation chains has expired; in response to determining that the validity period has expired, identifying a second set of responsible base stations from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; constructing a second set of resource allocation chains based on determining that the validity period has expired, wherein each resource allocation chain in the second set of resource allocation chains is used for one base station in the cluster; calculating a second set of advance planning times for the MAC entity set based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for one MAC entity in the MAC entity set; and providing the second set of advance planning times for the MAC entity set to the second set of responsible base stations.

[0194] In some implementations, method 1700 further includes: receiving from a cluster control function (CCF) a context of a new MAC entity to be used by the cluster, the context identifying one or more base stations in the cluster belonging to the new MAC entity; selecting a responsible base station for the new MAC entity; for each resource allocation chain in a first set of resource allocation chains for a base station belonging to the one or more base stations of the new MAC entity: identifying whether the resource allocation chain for that base station includes the responsible base station; and if the resource allocation chain for that base station does not include the responsible base station, adding the responsible base station to the resource allocation chain; using the one or more resource allocation chains to calculate an advance planning time for the new MAC entity; and providing the advance planning time of the new MAC entity to the responsible base station of the new MAC entity. In some such implementations, method 1700 further includes: calculating a second set of advance planning times for one or more MAC entities in the set of MAC entities, the one or more MAC entities including base stations described by resource allocation chains in the one or more resource allocation chains that include the responsible base station; and providing the second set of advance planning times to the one or more responsible base stations in the set of responsible base stations responsible for the one or more MAC entities.

[0195] In some implementations, method 1700 further includes: receiving from the CCF a notification of a first MAC entity to be removed from the cluster in the MAC entity set, wherein the first MAC entity uses a first responsible base station, and one or more base stations of the cluster belong to the first MAC entity; for each of the one or more base stations belonging to the first MAC entity, when no MAC entity in the MAC entity set other than the first MAC entity to which the base station belongs uses the first responsible base station as its responsible base station, removing the first responsible base station from the resource allocation chain for that base station; calculating a second set of advance planning times for one or more MAC entities in the MAC entity set, the one or more MAC entities including base stations described by a resource allocation chain in the one or more resource allocation chains to which the responsible base station has been removed; and providing the second set of advance planning times to one or more responsible base stations in the responsible base station set that are responsible for the one or more MAC entities.

[0196] Figure 18 A method 1800 for a first responsible base station for a first MAC entity, according to an embodiment discussed herein, is illustrated. The first MAC entity includes a first plurality of base stations within a base station cluster serving a UE. Method 1800 includes receiving 1802 a first advance planning time corresponding to the first MAC entity from an L3 scheduler. Method 1800 includes allocating 1804 first transmission resources to the first MAC entity at a first target TTI after the current TTI and separated from it by the first advance planning time. Method 1800 further includes transmitting 1806 a first indication to a first successor base station in a first resource allocation chain of the first target base station among the plurality of base stations for the first MAC entity regarding the first transmission resources allocated to the first MAC entity at the first target TTI.

[0197] In some implementations, method 1800 further includes: receiving from a predecessor base station a second indication of a second transmission resource allocated to a second MAC entity at a first target TTI, wherein allocating the first transmission resource to the first MAC entity at the first target TTI does not include the second transmission resource.

[0198] In some implementations, method 1800 further includes: performing a virtual allocation of second transmission resources at a first target TTI to a virtual MAC entity, wherein the virtual MAC entity represents a second MAC entity to be scheduled by a second base station.

[0199] In some implementations of method 1800, the first successor base station of the first resource allocation chain is the target base station.

[0200] In some implementations of method 1800, the first successor base station of the first resource allocation chain is not included in the MAC entity.

[0201] In some embodiments, method 1800 further includes transmitting a second indication to a second successor base station in a second resource allocation chain of a second target base station among a plurality of base stations for the first MAC entity, regarding a first transmission resource allocated to the first MAC entity at the first target TTI. In some such embodiments, the second successor base station of the second resource allocation chain includes the second target base station. In some such embodiments, the second successor base station of the second resource allocation chain is not included in the first MAC entity.

[0202] In some embodiments of method 1800, the first responsible base station is also responsible for a second MAC entity comprising a second plurality of base stations within the base station cluster, and method 1800 further includes: receiving a second advance planning time corresponding to the second MAC entity from an L3 scheduler; allocating second transmission resources to the second MAC entity at a second TTI after the current TTI and separated by the second advance planning time; and transmitting a second indication to a second successor base station in a second resource allocation chain of a second target base station among one or more base stations for the second MAC entity, regarding the second transmission resources allocated to the second MAC entity at the second target TTI. In some such embodiments, the first MAC entity and the second MAC entity each include a shared base station. In some such embodiments, there is no shared base station between the first MAC entity and the second MAC entity.

[0203] In some implementations of method 1800, Figure 19 An example architecture of a wireless communication system 1900 according to an embodiment disclosed herein is illustrated. The following description is provided for an example wireless communication system 1900 operating in conjunction with LTE system standards and / or 5G or NR system standards provided by 3GPP technical specifications.

[0204] like Figure 19 As shown, the wireless communication system 1900 includes UE 1902 and UE 1904 (but any number of UEs may be used). In this example, UE 1902 and UE 1904 are exemplified as smartphones (e.g., handheld touchscreen mobile computing devices capable of connecting to one or more cellular networks), but may also include any mobile or non-mobile computing device configured for wireless communication.

[0205] UE 1902 and UE 1904 can be configured to communicatively couple with RAN 1906. In implementations, RAN 1906 can be NG-RAN, E-UTRAN, etc. UE 1902 and UE 1904 utilize connections (or channels) with RAN 1906 (shown as connection 1908 and connection 1910, respectively), where each connection includes a physical communication interface. RAN 1906 may include one or more base stations (such as base station 1912 and base station 1914) implementing connection 1908 and connection 1910.

[0206] In this example, Connection 1908 and Connection 1910 are air interfaces that enable this type of communication coupling and can conform to the RAT used by RAN 1906, such as LTE and / or NR, for example.

[0207] In some implementations, UE 1902 and UE 1904 can also directly exchange communication data via sidelink interface 1916. UE 1904 is shown configured to access an access point (shown as AP 1918) via connection 1920. By way of example, connection 1920 may include a local wireless connection, such as a connection conforming to any IEEE 802.11 protocol, where AP 1918 may include Wi-Fi. ® Router. In this example, AP 1918 can connect to another network (e.g., the Internet) without using CN 1924.

[0208] In the implementation scheme, UE 1902 and UE 1904 may be configured to communicate with each other or with base station 1912 and / or base station 1914 via a multi-carrier communication channel using orthogonal frequency division multiplexing (OFDM) communication signals according to various communication technologies, such as but not limited to orthogonal frequency division multiple access (OFDMA) communication technology (e.g., for downlink communication) or single-carrier frequency division multiple access (SC-FDMA) communication technology (e.g., for uplink and ProSe or sidelink communication), but the scope of the implementation scheme is not limited in this respect. The OFDM signal may include multiple orthogonal subcarriers.

[0209] In some implementations, all or some of the base stations in base station 1912 or base station 1914 may be implemented as one or more software entities running on a server computer as part of a virtual network. Furthermore, or in other implementations, base station 1912 or base station 1914 may be configured to communicate with each other via interface 1922. In implementations where the wireless communication system 1900 is an LTE system (e.g., when CN 1924 is an EPC), interface 1922 may be an X2 interface. This X2 interface may be defined between two or more base stations (e.g., two or more eNBs, etc.) connected to the EPC and / or between two eNBs connected to the EPC. In implementations where the wireless communication system 1900 is an NR system (e.g., when CN 1924 is a 5GC), interface 1922 may be an Xn interface. The Xn interface is defined between two or more base stations (e.g., two or more gNBs, etc.) connected to the 5GC, between base station 1912 (e.g., a gNB) connected to the 5GC and an eNB, and / or between two eNBs connected to the 5GC (e.g., CN 1924).

[0210] RAN 1906 is shown communicatively coupled to CN 1924. CN 1924 may include one or more network elements 1926 configured to provide various data and telecommunications services to customers / subscribers (e.g., users of UE 1902 and UE 1904) connected to CN 1924 via RAN 1906. Components of CN 1924 may be implemented in a single physical device or separate physical device, including components for reading and executing instructions from machine-readable or computer-readable media (e.g., non-transitory machine-readable storage media).

[0211] In the implementation scheme, CN 1924 may be an EPC, and RAN 1906 may be connected to CN 1924 via S1 interface 1928. In the implementation scheme, S1 interface 1928 may be divided into two parts: an S1 user plane (S1-U) interface carrying service data between base station 1912 or base station 1914 and the serving gateway (S-GW), and an S1-MME interface serving as the signaling interface between base station 1912 or base station 1914 and the mobility management entity (MME).

[0212] In the implementation scheme, CN 1924 may be a 5GC, and RAN 1906 may be connected to CN 1924 via NG interface 1928. In the implementation scheme, NG interface 1928 may be divided into two parts: an NG user plane (NG-U) interface carrying service data between base station 1912 or base station 1914 and user plane function (UPF), and an S1 control plane (NG-C) interface serving as the signaling interface between base station 1912 or base station 1914 and access and mobility management function (AMF).

[0213] Generally, application server 1930 can be an element that provides Internet Protocol (IP) carried resources (e.g., packet-switched data services) for use with CN 1924. Application server 1930 can also be configured to support one or more communication services (e.g., VoIP sessions, group communication sessions, etc.) for UE 1902 and UE 1904 via CN 1924. Application server 1930 can communicate with CN 1924 via IP communication interface 1932.

[0214] Figure 20 A system 2000, supported by CN device 2036 according to an embodiment disclosed herein, is illustrated for executing signaling 2034 between wireless device 2002 and network device 2018. System 2000 may be part of a wireless communication system as described herein. Wireless device 2002 may be, for example, a UE of a wireless communication system. Network device 2018 may be, for example, a base station of a wireless communication system (e.g., an eNB, gNB, or a sixth-generation base station).

[0215] Wireless device 2002 may include one or more processors 2004. Processor 2004 may execute instructions to perform various operations of wireless device 2002 as described herein. Processor 2004 may include one or more baseband processors, which may be implemented using, for example, a central processing unit (CPU), digital signal processor (DSP), application-specific integrated circuit (ASIC), controller, field-programmable gate array (FPGA) device, another hardware device, firmware device, or any combination thereof configured to perform the operations described herein.

[0216] Wireless device 2002 may include memory 2006. Memory 2006 may be a non-transitory computer-readable storage medium that stores instructions 2008, which may include, for example, instructions executed by processor 2004. Instructions 2008 may also be referred to as program code or computer program. Memory 2006 may also store data used by processor 2004 and results calculated by the processor.

[0217] Wireless device 2002 may include one or more transceivers 2010, which may include radio frequency (RF) transmitter circuitry and / or receiver circuitry, which use antenna 2012 of wireless device 2002 to facilitate signaling (e.g., signaling 2034) to and / or from wireless device 2002 and other devices (e.g., network device 2018) in accordance with the corresponding RAT.

[0218] Wireless device 2002 may include one or more antennas 2012 (e.g., one, two, four, or more antennas). In embodiments with multiple antennas 2012, wireless device 2002 may fully utilize the spatial diversity of such multiple antennas 2012 to transmit and / or receive multiple different data streams on the same time and frequency resources. This behavior may be referred to as, for example, MIMO behavior (referring to multiple antennas used at each of the transmitting and receiving devices to implement this aspect). MIMO transmission performed by wireless device 2002 may be achieved according to pre-decoding (or digital beamforming) applied at wireless device 2002, which multiplexes data streams across antennas 2012 based on known or assumed channel characteristics, such that each data stream is received with appropriate signal strength relative to the other streams and at a desired location in the spatial domain (e.g., the location of the receiver associated with that data stream). Some implementations may use a single-user MIMO (SU-MIMO) approach (where all data streams are directed to a single receiver) and / or a multi-user MIMO (MU-MIMO) approach (where individual data streams may be directed to individual (different) receivers at different locations in the airspace).

[0219] In some implementations with multiple antennas, the wireless device 2002 can implement analog beamforming technology, thereby relatively adjusting the phase of the signal transmitted by the antenna 2012 so that the (joint) transmission of the antenna 2012 can be directed (this is sometimes called beam control).

[0220] Wireless device 2002 may include one or more interfaces 2014. Interfaces 2014 can be used to provide input to or output from wireless device 2002. For example, wireless device 2002 as a UE may include interfaces 2014, such as microphones, speakers, touchscreens, and buttons, to allow users of the UE to input and / or output to the UE. Other interfaces of such UEs may consist of transmitters, receivers, and other circuitry that allow the UE to communicate with other devices (e.g., in addition to the transceiver 2010 / antenna 2012 already described), and may be based on known protocols (e.g., Wi-Fi). ® and Bluetooth ® (etc.) to perform the operation.

[0221] Wireless device 2002 may include a MAC scheduling module 2016. The MAC scheduling module 2016 may be implemented via hardware, software, or a combination thereof. For example, the MAC scheduling module 2016 may be implemented as a processor, circuitry, and / or instructions 2008 stored in memory 2006 and executed by processor 2004. In some examples, the MAC scheduling module 2016 may be integrated within processor 2004 and / or transceiver 2010. For example, the MAC scheduling module 2016 may be implemented via a combination of software components (e.g., executed by a DSP or general-purpose processor) and hardware components (e.g., logic gates and circuitry) within processor 2004 or transceiver 2010.

[0222] The MAC scheduling module 2016 can configure the wireless device 2002 for various aspects of this disclosure in the manner discussed herein, such as aspects corresponding to the use of communication using a MAC entity such as a scheduler.

[0223] Network device 2018 may include one or more processors 2020. Processor 2020 may execute instructions to cause various operations of network device 2018 to be performed as described herein. Processor 2020 may include one or more baseband processors, which may be implemented using, for example, a CPU, DSP, ASIC, controller, FPGA device, another hardware device, firmware device, or any combination thereof configured to perform the operations described herein.

[0224] Network device 2018 may include memory 2022. Memory 2022 may be a non-transitory computer-readable storage medium that stores instructions 2024, which may include instructions executed, for example, by processor 2020. Instructions 2024 may also be referred to as program code or computer program. Memory 2022 may also store data used by processor 2020 and results calculated by the processor.

[0225] Network device 2018 may include one or more transceivers 2026, which may include RF transmitter circuitry and / or receiver circuitry, which use the antenna 2028 of network device 2018 to facilitate signaling (e.g., signaling 2034) to and / or from network device 2018 and other devices (e.g., wireless device 2002) in accordance with the corresponding RAT.

[0226] Network device 2018 may include one or more antennas 2028 (e.g., one, two, four or more). In embodiments having multiple antennas 2028, network device 2018 may perform MIMO, digital beamforming, analog beamforming, beam control, etc., as described.

[0227] Network device 2018 may include one or more interfaces 2030. Interfaces 2030 can be used to provide input to or output to network device 2018. For example, network device 2018, acting as a base station, may include interfaces 2030 consisting of transmitters, receivers, and other circuitry (e.g., in addition to the transceiver 2026 / antenna 2028 already described), enabling the base station to communicate with other equipment in the core network and / or to communicate with external networks, computers, databases, etc., for the purpose of operating, managing, and maintaining the base station or other equipment operatively connected to it. As another example, network device 2018 may communicate with CN device 2036 on interface 2048 of interface 2030 (e.g., in the NR case, this interface may be an NG interface, or in the LTE case, this interface may be an S1 interface).

[0228] Network device 2018 may include MAC scheduling module 2032. MAC scheduling module 2032 may be implemented via hardware, software, or a combination thereof. For example, MAC scheduling module 2032 may be implemented as a processor, circuitry, and / or instructions 2024 stored in memory 2022 and executed by processor 2020. In some examples, MAC scheduling module 2032 may be integrated within processor 2020 and / or transceiver 2026. For example, MAC scheduling module 2032 may be implemented via a combination of software components (e.g., executed by a DSP or general-purpose processor) and hardware components (e.g., logic gates and circuitry) within processor 2020 or transceiver 2026.

[0229] The MAC scheduling module 2032 can configure the network device 2018 for various aspects of this disclosure, for example, Figure 17 and / or Figure 18 In some implementations, the MAC scheduling module 2032 may configure the network device 2018 to work with and / or as part of the L3 scheduler to identify responsible base stations, construct resource allocation chain sets, calculate advance planning times, and / or provide advance planning times to any responsible base station. In some implementations, the MAC scheduling module 2032 may configure the network device 2018 to receive advance planning times from the L3 scheduler for MAC entities, allocate transmission resources at a target TTI to a first MAC entity, and / or transmit indications of the allocated transmission resources to subsequent base stations.

[0230] CN device 2036 may include one or more processors 2038. Processor 2038 may execute instructions to perform various operations of CN device 2036 as described herein. Processor 2038 may include one or more baseband processors, which may be implemented using, for example, a CPU, DSP, ASIC, controller, FPGA device, another hardware device, firmware device, or any combination thereof configured to perform the operations described herein.

[0231] CN device 2036 may include memory 2040. Memory 2040 may be a non-transitory computer-readable storage medium that stores instructions 2042, which may include, for example, instructions executed by processor 2038. Instructions 2042 may also be referred to as program code or computer program. Memory 2040 may also store data used by processor 2038 and results calculated by the processor.

[0232] CN device 2036 may include one or more interfaces 2044. Interface 2044 can be used to provide input to or from CN device 2036. For example, CN device 2036 can communicate with network device 2018 on interface 2048 of interface 2044 (e.g., in the case of NR, this interface may be an NG interface, or in the case of LTE, this interface may be an S1 interface).

[0233] CN device 2036 may include a MAC scheduling module 2046. The MAC scheduling module 2046 may be implemented via hardware, software, or a combination thereof. For example, the MAC scheduling module 2046 may be implemented as a processor, circuitry, and / or instructions 2042 stored in memory 2040 and executed by processor 2038. In some examples, the MAC scheduling module 2046 may be integrated within processor 2038. For example, the MAC scheduling module 2046 may be implemented via a combination of software components (e.g., executed by a DSP or general-purpose processor) and hardware components (e.g., logic gates and circuitry) within processor 2038.

[0234] MAC scheduling module 2046 can configure CN device 2036 for various aspects of this disclosure, for example, Figure 17 In some implementations, the MAC scheduling module 2046 can configure the network CN device 2036 to work with and / or as part of the L3 scheduler to identify responsible base stations, build resource allocation chain sets, calculate advance planning time, and / or provide advance planning time to any responsible base station.

[0235] The embodiments contemplated herein include an apparatus comprising components for performing one or more elements of either method 1700 or method 1800. This apparatus may be, for example, an apparatus for a base station (such as network device 2018 as a base station, as described herein).

[0236] The embodiments contemplated herein include one or more non-transitory computer-readable media, which include instructions for causing the electronic device to perform one or more elements of either method 1700 or method 1800 when executed by one or more processors of the electronic device. The non-transitory computer-readable medium may be, for example, the memory of a base station (such as memory 2022 of a network device 2018 serving as a base station, as described herein).

[0237] The embodiments contemplated herein include an apparatus comprising logic components, modules, or circuitry for performing one or more elements of either method 1700 or method 1800. This apparatus may be, for example, an apparatus for a base station (such as network equipment 2018 as a base station, as described herein).

[0238] The embodiments contemplated herein include an apparatus comprising: one or more processors and one or more computer-readable media including instructions that, when executed by the one or more processors, cause the one or more processors to perform one or more elements of either method 1700 or method 1800. The apparatus may be, for example, an apparatus for a base station (such as network device 2018 as a base station, as described herein).

[0239] The implementation scheme envisioned herein includes a signal as described in or associated with one or more elements of either method 1700 or method 1800.

[0240] The embodiments contemplated herein include a computer program or computer program product comprising instructions, wherein execution of the program by a processing element will cause the processing element to perform one or more elements of either method 1700 or method 1800. The processor may be a processor of a base station (such as processor 2020 of network device 2018 as a base station, as described herein). These instructions may, for example, be located in the processor and / or on the memory of the base station (such as memory 2022 of network device 2018 as a base station, as described herein).

[0241] The embodiments contemplated herein include an apparatus comprising components for performing one or more elements of method 1700. This apparatus may be, for example, an apparatus of a base station (such as network device 2018 as a base station, as described herein) and / or an apparatus of a CN (such as CN device 2036, as described herein). It is also contemplated that the apparatus may be one of many such apparatuses working together in a distributed manner to perform one or more elements of method 1700.

[0242] The embodiments contemplated herein include one or more non-transitory computer-readable media comprising instructions that, when executed by one or more processors of an electronic device, cause the electronic device to perform one or more elements of method 1700. The non-transitory computer-readable medium may be, for example, the memory of a base station (such as memory 2040 of network device 2018 as a base station, as described herein) and / or the memory of a CN (such as memory 2040 of CN device 2036, as described herein). It is also contemplated that the electronic device may be one of many such electronic devices working together in a distributed manner to perform one or more elements of method 1700.

[0243] The embodiments contemplated herein include an apparatus comprising logic components, modules, or circuitry for performing one or more elements of method 1700. This apparatus may be, for example, a base station (such as network device 2018 as a base station, as described herein) and / or a CN (such as CN device 2036, as described herein). It is also contemplated that the apparatus may be one of many such apparatuses working together in a distributed manner to perform one or more elements of method 1700.

[0244] The embodiments contemplated herein include an apparatus comprising: one or more processors and one or more computer-readable media including instructions that, when executed by the one or more processors, cause the one or more processors to perform one or more elements of method 1700. The apparatus may be, for example, an apparatus of a base station (such as network device 2018 as a base station, as described herein) and / or an apparatus of a CN (such as CN device 2036, as described herein). It is also contemplated that the apparatus may be one of many such apparatuses working together in a distributed manner to perform one or more elements of method 1700.

[0245] The implementation scheme envisioned herein includes a signal as described or associated with one or more elements of method 1700.

[0246] The embodiments contemplated herein include a computer program or computer program product comprising instructions, wherein execution by a processing element causes the processing element to perform one or more elements of method 1700. The processor may be a processor of a base station (such as processor 2020 of network device 2018 as a base station, as described herein). These instructions may be, for example, located in the processor and / or on the memory of the base station (such as memory 2022 of network device 2018 as a base station, as described herein). The processor may be a processor of a CN device (such as processor 2038 of CN device 2036, as described herein). These instructions may be, for example, located in the processor and / or on the memory of the CN device (such as memory 2040 of CN device 2036, as described herein). It is also contemplated that the processing element may be one of many such processing elements working together in a distributed manner to perform one or more elements of method 1700.

[0247] For one or more embodiments, at least one of the components illustrated in one or more of the foregoing figures may be configured to perform one or more operations, techniques, processes, and / or methods as described herein. For example, a baseband processor as described herein in conjunction with one or more of the foregoing figures may be configured to operate according to one or more of the examples illustrated herein. Similarly, circuitry associated with a UE, base station, network element, etc., as described above in conjunction with one or more of the foregoing figures may be configured to operate according to one or more of the examples illustrated herein.

[0248] Unless otherwise expressly stated, any of the embodiments described above may be combined with any other embodiment (or combination of embodiments). The foregoing description of one or more specific embodiments provides illustrative and descriptive information, but is not intended to be exhaustive or to limit the scope of the embodiments to the precise form disclosed. In light of the teachings above, modifications and variations are possible, or modifications and variations may be derived from practice with various embodiments.

[0249] Implementations and specific embodiments of the systems and methods described herein may include various operations embodied in machine-executable instructions to be executed by a computer system. The computer system may include one or more general-purpose or special-purpose computers (or other electronic devices). The computer system may include hardware components, including specific logical parts for performing the operations; or may include a combination of hardware, software, and / or firmware.

[0250] It should be recognized that the systems described herein include descriptions of specific implementations. These implementations may be combined into a single system, partially integrated into other systems, divided into multiple systems, or otherwise partitioned or combined. Furthermore, it is conceivable to use parameters, attributes, aspects, etc., of one implementation in one implementation. For clarity, these parameters, attributes, aspects, etc., are described only in one or more implementations, and it should be recognized that, unless expressly stated herein, these parameters, attributes, aspects, etc., may be combined with or substituted for parameters, attributes, aspects, etc., of another implementation.

[0251] As is widely recognized, the use of personally identifiable information should comply with privacy policies and practices that are generally accepted to meet or exceed industry or governmental requirements for protecting user privacy. Specifically, personally identifiable information data should be managed and processed to minimize the risk of unintentional or unauthorized access or use, and the nature of authorized use should be clearly explained to users.

[0252] Although the foregoing has been described in considerable detail for clarity, it will be apparent that certain changes and modifications can be made without departing from the principles of the invention. It should be noted that there are many alternative ways to implement both the processes and apparatus described herein. Therefore, embodiments of the invention should be considered illustrative rather than restrictive, and this specification is not limited to the details given herein, but can be modified within the scope and equivalents of the appended claims.

Claims

1. A method for a Layer 3 (L3) scheduler serving a base station cluster for a User Equipment (UE), the method comprising: Identify a first set of responsible base stations from the base station cluster, wherein each base station in the first set of responsible base stations is responsible for at least one MAC entity in a set of media access control (MAC) entities used between the base station cluster and the UE, and wherein each MAC entity in the set of MAC entities includes one or more base stations from the base stations of the cluster. Construct a first set of resource allocation chains, wherein each resource allocation chain in the first set of resource allocation chains is used for one of the base stations of the cluster; The first set of advance planning times for the MAC entity set is calculated based on the first set of resource allocation chains, wherein each advance planning time in the first set of advance planning times is used for one MAC entity in the MAC entity set. as well as The first set of advance planning times for the MAC entity set is provided to the first set of responsible base stations.

2. The method of claim 1, wherein each resource allocation chain for each base station in the first set of resource allocation chains is constructed by the following operations: The set of MAC entities includes a subset of the MAC entities of the base station described by the resource allocation chain; Add each responsible base station in the first set of responsible base stations for one or more MAC entities in the subset of MAC entities to the resource allocation chain; and Add the base station used in the resource allocation chain to the resource allocation chain.

3. The method according to claim 2, further comprising: The resource allocation chain is sorted after each responsible base station in the first set of responsible base stations responsible for one or more MAC entities in the subset of MAC entities is added to the resource allocation chain and before the base station used for the resource allocation chain is added to the resource allocation chain.

4. The method of claim 1, wherein each advance planning time of each MAC entity in the first set of advance planning times is calculated by the following operation: Identify one or more resource allocation chains from the first set of resource allocation chains, the one or more resource allocation chains including each resource allocation chain in the first set of resource allocation chains used by the base station of the MAC entity; Use the one or more resource allocation chains to calculate one or more attributable scheduling times for the MAC entity; as well as The longest attributable scheduling time among the one or more attributable scheduling times of the MAC entity is selected as the advance planning time of the MAC entity.

5. The method of claim 4, wherein for each of the one or more resource allocation chains, each attributable scheduling time of the MAC entity is calculated by summing the following: The total Xn interface delay corresponding to the Xn interface extending from the responsible base station to a portion of the resource allocation chain described by the resource allocation chain of the base station; and This can be attributed to the total scheduling algorithm delay at each base station in the first set of responsible base stations, which is included in the portion of the resource allocation chain.

6. The method according to claim 1, further comprising: The identifier indicates that the triggering conditions of the second set of the resource allocation chain should be used; In response to identifying the triggering condition, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the received triggering condition, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for a MAC entity in the MAC entity set; as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

7. The method of claim 6, wherein the triggering condition includes an indication that the sum of the first set of advance planning times has exceeded a threshold.

8. The method according to claim 1, further comprising: It has been determined that the validity period of the first resource allocation chain set has expired; In response to determining that the validity period has expired, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the determination that the validity period has expired, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times for the MAC entity set is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for one MAC entity in the MAC entity set. as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

9. The method according to claim 1, further comprising: Receive the context of a new MAC entity to be used by the cluster from the cluster control function (CCF), the context identifying one or more base stations in the cluster that belong to the new MAC entity; Select a responsible base station for the new MAC entity; For each resource allocation chain in one or more resource allocation chains of the first set of resource allocation chains for base stations belonging to the one or more base stations of the new MAC entity: Identify whether the resource allocation chain used for the base station includes the responsible base station; as well as If the resource allocation chain for the base station does not include the responsible base station, then the responsible base station is added to the resource allocation chain; Use the one or more resource allocation chains to calculate the advance planning time of the new MAC entity; as well as The responsible base station of the new MAC entity provides the advance planning time of the new MAC entity.

10. The method according to claim 9, further comprising: Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by the resource allocation chain of the one or more resource allocation chains that includes the responsible base station; as well as The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

11. The method according to claim 1, further comprising: Receive a notification from the Cluster Control Function (CCF) regarding a first MAC entity to be removed from the cluster from the set of MAC entities, wherein the first MAC entity uses a first responsible base station, and one or more base stations of the cluster belong to the first MAC entity; For each of the one or more base stations belonging to the first MAC entity, when no MAC entity in the set of MAC entities uses the first responsible base station as its responsible base station except for the first MAC entity to which the base station belongs, the first responsible base station is removed from the resource allocation chain for the base station. Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by one of the one or more resource allocation chains from which the responsible base station has been removed; as well as The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

12. A non-transitory computer-readable storage medium comprising instructions that, when executed by an L3 scheduler, cause the L3 scheduler to perform the following operations: Identify a first set of responsible base stations from the base station cluster, wherein each base station in the first set of responsible base stations is responsible for at least one MAC entity in a set of media access control (MAC) entities used between the base station cluster and the UE, and wherein each MAC entity in the set of MAC entities includes one or more base stations from the base stations of the cluster. Construct a first set of resource allocation chains, wherein each resource allocation chain in the first set of resource allocation chains is used for one of the base stations of the cluster; The first set of advance planning times for the MAC entity set is calculated based on the first set of resource allocation chains, wherein each advance planning time in the first set of advance planning times is used for one MAC entity in the MAC entity set. as well as The first set of advance planning times for the MAC entity set is provided to the first set of responsible base stations.

13. The non-transitory computer-readable storage medium of claim 12, wherein each resource allocation chain for each base station in the first set of resource allocation chains is constructed by: The set of MAC entities includes a subset of the MAC entities of the base station described by the resource allocation chain; Add each responsible base station in the first set of responsible base stations for one or more MAC entities in the subset of MAC entities to the resource allocation chain; and Add the base station used in the resource allocation chain to the resource allocation chain.

14. The non-transitory computer-readable storage medium of claim 13, wherein the instructions further cause the L3 scheduler to sort the resource allocation chain after adding each responsible base station in the first set of responsible base stations responsible for the one or more MAC entities in the subset of MAC entities to the resource allocation chain and before adding the base station for the resource allocation chain to the resource allocation chain.

15. The non-transitory computer-readable storage medium of claim 12, wherein each advance planning time of each MAC entity in the first set of advance planning times is calculated by: Identify one or more resource allocation chains from the first set of resource allocation chains, the one or more resource allocation chains including each resource allocation chain in the first set of resource allocation chains used by the base station of the MAC entity; Use the one or more resource allocation chains to calculate one or more attributable scheduling times for the MAC entity; as well as The longest attributable scheduling time among the one or more attributable scheduling times of the MAC entity is selected as the advance planning time of the MAC entity.

16. The non-transitory computer-readable storage medium of claim 15, wherein for each of the one or more resource allocation chains, each attributable scheduling time of the MAC entity is calculated by summing the following: The total Xn interface delay corresponding to the Xn interface extending from the responsible base station to a portion of the resource allocation chain described by the resource allocation chain of the base station; and This can be attributed to the total scheduling algorithm delay at each base station in the first set of responsible base stations, which is included in the portion of the resource allocation chain.

17. The non-transitory computer-readable storage medium of claim 12, wherein the instructions further cause the L3 scheduler to: The identifier indicates that the triggering conditions of the second set of the resource allocation chain should be used; In response to identifying the triggering condition, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the received triggering condition, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for a MAC entity in the MAC entity set; as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

18. The non-transitory computer-readable storage medium of claim 17, wherein the triggering condition includes an indication that the sum of the first set of advance planning times has exceeded a threshold.

19. The non-transitory computer-readable storage medium of claim 12, wherein the instructions further cause the L3 scheduler to: It has been determined that the validity period of the first resource allocation chain set has expired; In response to determining that the validity period has expired, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the determination that the validity period has expired, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times for the MAC entity set is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for one MAC entity in the MAC entity set. as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

20. The non-transitory computer-readable storage medium of claim 12, wherein the instructions further cause the L3 scheduler to: Receive the context of a new MAC entity to be used by the cluster from the cluster control function (CCF), the context identifying one or more base stations in the cluster that belong to the new MAC entity; Select a responsible base station for the new MAC entity; For each resource allocation chain in one or more resource allocation chains of the first set of resource allocation chains for base stations belonging to the one or more base stations of the new MAC entity: Identify whether the resource allocation chain used for the base station includes the responsible base station; as well as If the resource allocation chain for the base station does not include the responsible base station, then the responsible base station is added to the resource allocation chain; Use the one or more resource allocation chains to calculate the advance planning time of the new MAC entity; as well as The responsible base station of the new MAC entity provides the advance planning time of the new MAC entity.

21. The non-transitory computer-readable storage medium of claim 20, wherein the instructions further cause the L3 scheduler to: Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by the resource allocation chain responsible for the base station added to the one or more resource allocation chains; and The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

22. The non-transitory computer-readable storage medium of claim 12, wherein the instructions further cause the L3 scheduler to: Receive a notification from the Cluster Control Function (CCF) regarding a first MAC entity to be removed from the cluster from the set of MAC entities, wherein the first MAC entity uses a first responsible base station, and one or more base stations of the cluster belong to the first MAC entity; For each of the one or more base stations belonging to the first MAC entity, when no MAC entity in the set of MAC entities uses the first responsible base station as its responsible base station except for the first MAC entity to which the base station belongs, the first responsible base station is removed from the resource allocation chain for the base station. Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by one of the one or more resource allocation chains from which the responsible base station has been removed; as well as The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

23. An apparatus for an L3 scheduler, the apparatus comprising: One or more processors; and A memory for storing instructions, which, when executed by the one or more processors, configure the L3 scheduler to: Identify a first set of responsible base stations from the base station cluster, wherein each base station in the first set of responsible base stations is responsible for at least one MAC entity in a set of media access control (MAC) entities used between the base station cluster and the UE, and wherein each MAC entity in the set of MAC entities includes one or more base stations from the base stations of the cluster. Construct a first set of resource allocation chains, wherein each resource allocation chain in the first set of resource allocation chains is used for one of the base stations of the cluster; The first set of advance planning times for the MAC entity set is calculated based on the first set of resource allocation chains, wherein each advance planning time in the first set of advance planning times is used for one MAC entity in the MAC entity set. as well as The first set of advance planning times for the MAC entity set is provided to the first set of responsible base stations.

24. The apparatus of claim 23, wherein each resource allocation chain for each base station in the first set of resource allocation chains is constructed by the following operations: The set of MAC entities includes a subset of the MAC entities of the base station described by the resource allocation chain; Add each responsible base station in the first set of responsible base stations for one or more MAC entities in the subset of MAC entities to the resource allocation chain; and Add the base station used in the resource allocation chain to the resource allocation chain.

25. The apparatus of claim 24, wherein the instructions further cause the L3 scheduler to sort the resource allocation chain after adding each responsible base station in the first set of responsible base stations responsible for the one or more MAC entities in the subset of MAC entities to the resource allocation chain and before adding the base station for the resource allocation chain to the resource allocation chain.

26. The apparatus of claim 23, wherein each advance planning time of each MAC entity in the first set of advance planning times is calculated by: Identify one or more resource allocation chains from the first set of resource allocation chains, the one or more resource allocation chains including each resource allocation chain in the first set of resource allocation chains used by the base station of the MAC entity; Use the one or more resource allocation chains to calculate one or more attributable scheduling times for the MAC entity; as well as The longest attributable scheduling time among the one or more attributable scheduling times of the MAC entity is selected as the advance planning time of the MAC entity.

27. The apparatus of claim 26, wherein for each of the one or more resource allocation chains, each attributable scheduling time of the MAC entity is calculated by summing the following: The total Xn interface delay corresponding to the Xn interface extending from the responsible base station to a portion of the resource allocation chain described by the resource allocation chain of the base station; and This can be attributed to the total scheduling algorithm delay at each base station in the first set of responsible base stations, which is included in the portion of the resource allocation chain.

28. The apparatus of claim 23, wherein the instructions further configure the L3 scheduler to: The identifier indicates that the triggering conditions of the second set of the resource allocation chain should be used; In response to identifying the triggering condition, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the received triggering condition, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for a MAC entity in the MAC entity set; as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

29. The apparatus of claim 28, wherein the triggering condition includes an indication that the sum of the first set of advance planning times has exceeded a threshold.

30. The apparatus of claim 23, wherein the instructions further configure the L3 scheduler to: It has been determined that the validity period of the first resource allocation chain set has expired; In response to determining that the validity period has expired, a second set of responsible base stations is identified from the base station cluster, wherein each base station in the second set of responsible base stations is responsible for at least one MAC entity in the MAC entity set; A second set of resource allocation chains is constructed based on the determination that the validity period has expired, wherein each resource allocation chain in the second set of resource allocation chains is used for one of the base stations of the cluster; The second set of advance planning times for the MAC entity set is calculated based on the second set of resource allocation chains, wherein each advance planning time in the second set of advance planning times is used for one MAC entity in the MAC entity set. as well as The second set of advance planning times for the MAC entity set is provided to the second set of responsible base stations.

31. The apparatus of claim 23, wherein the instructions further configure the L3 scheduler to: Receive the context of a new MAC entity to be used by the cluster from the cluster control function (CCF), the context identifying one or more base stations in the cluster that belong to the new MAC entity; Select a responsible base station for the new MAC entity; For each resource allocation chain in one or more resource allocation chains of the first set of resource allocation chains for base stations belonging to the one or more base stations of the new MAC entity: Identify whether the resource allocation chain used for the base station includes the responsible base station; as well as If the resource allocation chain for the base station does not include the responsible base station, then the responsible base station is added to the resource allocation chain; Use the one or more resource allocation chains to calculate the advance planning time of the new MAC entity; as well as The responsible base station of the new MAC entity provides the advance planning time of the new MAC entity.

32. The apparatus of claim 31, wherein the instructions further configure the L3 scheduler to: Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by the resource allocation chain responsible for the base station added to the one or more resource allocation chains; and The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

33. The apparatus of claim 23, wherein the instructions further configure the L3 scheduler to: Receive a notification from the Cluster Control Function (CCF) regarding a first MAC entity to be removed from the cluster from the set of MAC entities, wherein the first MAC entity uses a first responsible base station, and one or more base stations of the cluster belong to the first MAC entity; For each of the one or more base stations belonging to the first MAC entity, when no MAC entity in the set of MAC entities uses the first responsible base station as its responsible base station except for the first MAC entity to which the base station belongs, the first responsible base station is removed from the resource allocation chain for the base station. Calculate a second set of advance planning times for one or more MAC entities in the MAC entity set, wherein the one or more MAC entities include base stations described by one of the one or more resource allocation chains from which the responsible base station has been removed; as well as The second set of advance planning times is provided to one or more responsible base stations in the set of responsible base stations that are responsible for the one or more MAC entities.

34. An apparatus comprising components for performing the method according to any one of claims 1 to 11.

35. A computer-readable medium comprising instructions for causing the electronic device to perform the method according to any one of claims 1 to 11 when executed by one or more processors of the electronic device.

36. An apparatus comprising a logic component, module, or circuit for performing the method according to any one of claims 1 to 11.

37. A baseband processor for a base station, the baseband processor being configured to cause the base station to perform one or more elements according to any one of claims 1 to 11.

Images