Allocation of contention-free random access preamble resources
By generating metrics for random access probability and allocating contention-free resources, the system optimizes handover processes in cellular communication, reducing inefficiencies and latency in cellular communication handovers.
Patent Information
- Application Number
- PCT/FI2023/050317
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-06-01
- Publication Date
- 2024-12-05
AI Technical Summary
Current handover procedures in cellular communication often face challenges in smoothly transitioning user equipment between cells, particularly due to contention-based random access methods that can lead to inefficiencies and increased latency, especially when radio conditions change.
The implementation of a system that generates metrics indicating the probability of user equipment performing random access via specific beams of a target cell, allowing for the allocation of contention-free random access resources and the transmission of handover messages to optimize the handover process, utilizing machine learning models to predict future beam connections and signal quality.
This approach enhances the likelihood of contention-free random access, minimizes fallback to contention-based methods, and improves the overall efficiency and robustness of handover procedures by allocating dedicated random access resources based on predicted signal quality and user equipment trajectory.
Smart Images

Figure FI2023050317_05122024_PF_FP_ABST
Abstract
Description
[0001]Allocation^of^Contention-Free^Random^Access^Preamble^Resources Field The following exemplary embodiments relate to cellular communication and performing a handover procedure. Background In cellular communication a user equipment may be served by an access node that provides a cell within which the user equipment is located. As there are changes, for example the cell is to be deactivated, or the user equipment moves such that is no longer suitable to be served by the cell, a handover procedure may be performed such that the user equipment may be served by another cell. It is beneficial to perform this procedure as smoothly as possible. Brief^Description^ The scope of protection sought for various embodiments of the invention is set out by the independent claims. The exemplary embodiments and features, if any, described in this specification that do not fall under the scope of the independent claims are to be interpreted as examples useful for understanding various embodiments of the invention. The base station, or any other suitable radio unit in a wireless digital communication network that comprises multiple antennas for the wireless communication enabling transmission of data, may then use cross polarized antennas to enable independent transmission paths for data transmission. According to a first aspect there is provided an apparatus comprising means for performing: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. In some example embodiments according to the first aspect, the means comprises at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, are configured to cause the performance of the apparatus. According to a second aspect there is provided an apparatus comprising at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, to cause the apparatus at least to: generate, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a third aspect there is provided a method comprising: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. In some example embodiment according to the third aspect the method is a computer implemented method. According to a fourth aspect there is provided a computer program comprising instructions which, when executed by an apparatus, cause the apparatus to perform at least the following: generate, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a fifth aspect there is provided a computer program comprising instructions stored thereon for performing at least the following: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a sixth aspect there is provided a non-transitory computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following: generate, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a seventh aspect there is provided a non-transitory computer readable medium comprising program instructions stored thereon for performing at least the following: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to an eighth aspect there is provided a computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following: generate, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a ninth aspect there is provided a computer readable medium comprising program instructions stored thereon for performing at least the following: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam, and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics. According to a tenth aspect there is provided an apparatus comprising means for performing: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocating contention free random access resources to the plurality of beams and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. In some example embodiments according to the tenth aspect, the means comprises at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, to cause the performance of the apparatus. According to an eleventh aspect there is provided an apparatus comprising at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, are configured to cause the apparatus at least to: receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocate contention free random access resources to the plurality of beams, and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to a twelfth aspect there is provided a method comprising: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocating contention free random access resources to the plurality of beams and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. In some example embodiment according to the twelfth aspect the method is a computer implemented method. According to a thirteenth aspect there is provided a computer program comprising instructions which, when executed by an apparatus, cause the apparatus to perform at least the following: receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocate contention free random access resources to the plurality of beams, and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to a fourteenth aspect there is provided a computer program comprising instructions stored thereon for performing at least the following: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocating contention free random access resources to the plurality of beams and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to a fifteenth aspect there is provided a non-transitory computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following: receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocate contention free random access resources to the plurality of beams, and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to a sixteenth aspect there is provided a non-transitory computer readable medium comprising program instructions stored thereon for performing at least the following: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocating contention free random access resources to the plurality of beams and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to a seventeenth aspect there is provided a computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following: receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocate contention free random access resources to the plurality of beams, and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. According to an eighteenth aspect there is provided a computer readable medium comprising program instructions stored thereon for performing at least the following: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam, based on the metrics, allocating contention free random access resources to the plurality of beams and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams. List^of^Drawings In the following, the invention will be described in greater detail with reference to the embodiments and the accompanying drawings, in which FIG.1 illustrates an example embodiment of a radio access network. FIG.2A illustrates a signaling chart according to an example embodiment of contention based random access. FIG.2B illustrates a signaling chart according to an example embodiment of contention-free random access. FIG. 3 illustrates an example embodiment of a conditional handover procedure. FIG. 4 illustrates an example embodiment of selecting a random access channel preamble. FIG.5 illustrates an example embodiment of utilizing a machine learning model for selecting contention free random access resources to be allocated. FIG.6 illustrates a block diagram according to an example embodiment of a performing a selection for a preamble. FIG. 7 illustrates an example embodiment of a supervised learning autoencoder machine learning model. FIG. 8 illustrates an example embodiment for one training cycle of a supervised machine learning model. FIG.9 illustrates an example embodiment of an apparatus. Description^of^Embodiments^ The following embodiments are exemplifying. Although the specification may refer to “an”, “one”, or “some” embodiment(s) in several locations of the text, this does not necessarily mean that each reference is made to the same embodiment(s), or that a particular feature only applies to a single embodiment. Single features of different embodiments may also be combined to provide other embodiments. As used in this application, the term ‘circuitry’ refers to all of the following: (a) hardware-only circuit implementations, such as implementations in only analog and / or digital circuitry, and (b) combinations of circuits and software (and / or firmware), such as (as applicable): (i) a combination of processor(s) or (ii) portions of processor(s) / software including digital signal processor(s), software, and memory(ies) that work together to cause an apparatus to perform various functions, and (c) circuits, such as a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation, even if the software or firmware is not physically present. This definition of ‘circuitry’ applies to all uses of this term in this application. As a further example, as used in this application, the term ‘circuitry’ would also cover an implementation of merely a processor (or multiple processors) or a portion of a processor and its (or their) accompanying software and / or firmware. The term ‘circuitry’ would also cover, for example and if applicable to the particular element, a baseband integrated circuit or applications processor integrated circuit for a mobile phone or a similar integrated circuit in a server, a cellular network device, or another network device. The above-described embodiments of the circuitry may also be considered as embodiments that provide means for carrying out the embodiments of the methods or processes described in this document. The techniques and methods described herein may be implemented by various means. For example, these techniques may be implemented in hardware (one or more devices), firmware (one or more devices), software (one or more modules), or combinations thereof. For a hardware implementation, the apparatus(es) of embodiments may be implemented within one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), graphics processing units (GPUs), processors, controllers, micro- controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof. For firmware or software, the implementation can be carried out through modules of at least one chipset (e.g. procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit and executed by processors. The memory unit may be implemented within the processor or externally to the processor. In the latter case, it can be communicatively coupled to the processor via any suitable means. Additionally, the components of the systems described herein may be rearranged and / or complemented by additional components in order to facilitate the achievements of the various aspects, etc., described with regard thereto, and they are not limited to the precise configurations set forth in the given figures, as will be appreciated by one skilled in the art. Embodiments described herein may be implemented in a communication system, such as in at least one of the following: Long Term Evolution (LTE), LTE-Advanced, a fifth generation (5G) mobile or cellular communication system, 5G-Advanced and / or 6G. The embodiments are not, however, restricted to the systems given as an example but a person skilled in the art may apply the solution to other communication systems provided with necessary properties. FIG.1 depicts examples of simplified system architectures showing some elements and functional entities, all being logical units, whose implementation may differ from what is shown. The connections shown in FIG.1 are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the system may comprise also other functions and structures than those shown in FIG.1. The example of FIG.1 shows a part of an example embodiment of a radio access network. FIG.1 shows terminal devices 100 and 102 configured to be in a wireless connection on one or more communication channels in a cell with an access node (such as (e / g)NodeB) 104 providing the cell. The terminal devices 100 and 102 may also be called as mobile device, or user equipment (UE), or user terminal, user device, etc. The access node 104 may also be referred to as a node, or a base station, or any other type of interfacing device including a relay station capable of operating in a wireless environment. The physical link from a terminal device to a (e / g)NodeB is called uplink (UL) or reverse link and the physical link from the (e / g)NodeB to the terminal device is called downlink (DL) or forward link. It should be appreciated that (e / g)NodeBs or their functionalities may be implemented by using any access node, host, server or access point etc. entity suitable for such a usage. It is to be noted that although one cell is discussed in this exemplary embodiment, for the sake of simplicity of explanation, multiple cells may be provided by one access node in some example embodiments. A communication system may comprise more than one (e / g)NodeB in which case the (e / g)NodeBs may also be configured to communicate with one another over links, wired or wireless, designed for the purpose. These links may be used for signalling purposes. The (e / g)NodeB is a computing device configured to control the radio resources of communication system it is coupled to. The (e / g)NodeB includes or is coupled to transceivers. From the transceivers of the (e / g)NodeB, a connection is provided to an antenna unit that establishes bi-directional radio links to user devices. The antenna unit may comprise a plurality of antennas or antenna elements. The (e / g)NodeB is further connected to core network 110 (CN or next generation core NGC). Depending on the system, the counterpart on the CN side may be a serving gateway (S-GW, routing and forwarding user data packets), packet data network gateway (P-GW), for providing connectivity of terminal devices to external packet data networks, or mobile management entity (MME), etc. The user equipment (UE) illustrates one type of an apparatus to which resources on the air interface are allocated and assigned, and thus any feature described herein with a UE may be implemented with a corresponding apparatus, such as a relay node. An example of such a relay node is a layer 3 relay (self-backhauling relay) towards the base station. Another example of such a relay node is a layer 2 relay. Such a relay node may comprise a UE part and a Distributed Unit (DU) part. A CU (centralized unit) may coordinate the DU operation via F1AP -interface for example. The UE may refer to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), or an embedded SIM, eSIM. A UE may also be a device having capability to operate in Internet of Things (IoT) network which is a scenario in which objects are provided with the ability to transfer data over a network without requiring human- to-human or human-to-computer interaction. The UE may also utilise cloud computing. The UE (or in some embodiments a layer 3 relay node) is configured to perform one or more of user equipment functionalities. It is to be noted that the UE may also be a vehicle or a household appliance capable of using cellular communication. Additionally, although the apparatuses have been depicted as single entities, different units, processors and / or memory units (not all shown in FIG. 1) may be implemented. 5G enables using multiple input – multiple output (MIMO) antennas, many more base stations or nodes than the LTE (a so-called small cell concept), including macro sites operating in co-operation with smaller stations and employing a variety of radio technologies depending on service needs, use cases and / or spectrum available. 5G mobile communications supports a wide range of use cases and related applications including video streaming, augmented reality, different ways of data sharing and various forms of machine type applications such as (massive) machine-type communications (mMTC), including vehicular safety, different sensors and real-time control. 5G is expected to have multiple radio interfaces, namely below 6GHz, cmWave and mmWave, and also being integratable with existing legacy radio access technologies, such as the LTE. Integration with the LTE may be implemented as a system, where macro coverage is provided by the LTE and 5G radio interface access comes from small cells by aggregation to the LTE. In other words, 5G is may support both inter-RAT operability (such as LTE-5G) and inter-RI operability (inter-radio interface operability, such as below 6GHz – cmWave, below 6GHz – cmWave – mmWave). One of the concepts considered to be used in 5G networks is network slicing in which multiple independent and dedicated virtual sub-networks (network instances) may be created within the same infrastructure to run services that have different requirements on latency, reliability, throughput and mobility. The architecture in LTE networks is fully distributed in the radio and fully centralized in the core network. The low latency applications and services in 5G may require bringing the content close to the radio which may lead to local break out and multi- access edge computing (MEC). 5G enables analytics and knowledge generation to occur at the source of the data. MEC provides a distributed computing environment for application and service hosting. It also has the ability to store and process content in close proximity to cellular subscribers for faster response time. Edge computing covers a wide range of technologies such as wireless sensor networks, mobile data acquisition, mobile signature analysis, cooperative distributed peer-to-peer ad hoc networking and processing also classifiable as local cloud / fog computing and grid / mesh computing, dew computing, mobile edge computing, cloudlet, distributed data storage and retrieval, autonomic self-healing networks, remote cloud services, augmented and virtual reality, data caching, Internet of Things (massive connectivity and / or latency critical), critical communications (autonomous vehicles, traffic safety, real-time analytics, time-critical control, healthcare applications). The communication system is also able to communicate with other networks, such as a public switched telephone network or the Internet 112, and / or utilise services provided by them. The communication network may also be able to support the usage of cloud services, for example at least part of core network operations may be carried out as a cloud service (this is depicted in FIG. 1 by “cloud” 114). The communication system may also comprise a central control entity, or a like, providing facilities for networks of different operators to cooperate for example in spectrum sharing. Edge cloud may be brought into radio access network (RAN) by utilizing network function virtualization (NFV) and software defined networking (SDN). Using edge cloud may mean access node operations to be carried out, at least partly, in a server, host or node operationally coupled to a remote radio head or base station comprising radio parts. It is also possible that node operations will be distributed among a plurality of servers, nodes or hosts. Application of cloudRAN architecture enables RAN real time functions being carried out at the RAN side (in a distributed unit, DU 104) and non-real time functions being carried out in a centralized manner (in a centralized unit, CU 108). It should also be understood that the distribution of labour between core network operations and base station operations may differ from that of the LTE or even be non-existent. Some other technology that may be used includes for example Big Data and all-IP, which may change the way networks are being constructed and managed. 5G (or new radio, NR) networks are being designed to support multiple hierarchies, where MEC servers can be placed between the core and the base station or nodeB (gNB). It should be appreciated that MEC can be applied in 4G networks as well. It is to be noted that the depicted system is an example of a part of a radio access system and the system may comprise a plurality of (e / g)NodeBs, UEs may have access to a plurality of radio cells and the system may comprise also other apparatuses, such as physical layer relay nodes or other network elements, etc. Additionally, in a geographical area of a radio communication system a plurality of different kinds of radio cells as well as a plurality of radio cells may be provided. Radio cells may be macro cells (or umbrella cells) which are large cells, usually having a diameter of up to tens of kilometers, or smaller cells such as micro-, femto- or picocells. The (e / g)NodeBs of FIG.1 may provide any kind of these cells. A cellular radio system may be implemented as a multilayer network including several kinds of cells. In some exemplary embodiments, in multilayer networks, one access node provides one kind of a cell or cells, and thus a plurality of (e / g)NodeBs are required to provide such a network structure. An access node, such as a gNB, that provides a cell that is serving a UE may be understood as a serving access node providing a serving cell, or a source access node providing a source cell. When a handover of the UE is to be performed, the cell to which the UE is to be handed over, may be understood as a target cell provided by a target access node. The handover may be triggered and performed using any suitable handover procedure, for example, a baseline handover procedure, a conditional handover (CHO) or dual-active protocol stack (DAPS). During the handover procedure a random access channel procedure is to be performed. The random access channel (RACH) procedure may be a contention-based random access (CBRA) or a contention-free random access (CFRA). FIG.2A illustrates an example embodiment of a CBRA. In this example embodiment, for the UE 200 the target cell is provided by an access node 205 that in this example embodiment is a gNB, although it may alternatively be any other suitable access node as well. First, the UE 200 selects one RACH preamble out of a configured set and transmits 210 the preamble in one of the pre-determined RACH occasions. As a response the access node 205 then transmits 215, a random access response (RAR) generated by a medium access control (MAC) layer. The RAR may be used to provide to the UE information such as timing advance (TA), initial uplink (UL) grant and an assignment of temporary cell-radio network temporary identifier (C-RNTI). Based on the received RAR, the UE 200 then transmits 220 to the access node 205 a scheduled physical uplink shared channel (PUSCH) transmission using msg 3 (message 3). The access node 205 may then transmit 225 to the UE 200 a content resolution using msg4 (message 4). For example, if the UE 200 has lost the contention due to for example a collision in a preamble transmission, the UE 200 is to repeat the RACH procedure. FIG.2B illustrates an example embodiment of a CFRA, in which the UE 200 has the access node 205 as its target access node like in the example embodiment of FIG.2A. In this example embodiment, the access node 205 configures the UE 200 with dedicated RACH preamble(s) by transmitting 230 a random access preamble assignment. This may be performed alternatively via the source cell which relays the target cell configuration comprising the dedicated RACH preambles. Then the UE 200 transmits 240 a dedicated RACH preamble in one of the pre-configured RACH occasion. As a response, the access node 205 then transmits 250 a RAR. The RACH procedure is then completed when UE 200 successfully receives the RAR. In case a TA is known by the network, or the TA is acquired before a cell switch, a UE may transmit a layer 3 (L3) message confirming a reconfiguration relating to the handover, such as a radio resource control (RRC) reconfiguration completed immediately after it has received the lower layer signalling triggering the cell change. The UE transmits the L3 message confirming the reconfiguration to the target cell using the acquired TA. For acquiring an UL grant for transmitting the L3 message, for example the following two options may be used. In the first option, the prepared target cell may provide a semi-persistent PUSCH grant(s) as part of the handover preparation. The target cell may then specify the UL TCI state that the UE is to use for transmitting L3 message on the UL grant. Given that the target cell may not determine beforehand which quasi co-location (QCL) source reference signal (RS) indices are the relevant for UL transmissions at the time of handover, the target cell may indicate multiple UL TCI states that each correspond to a PUSCH grant. In the second option, the UE may monitor for an UL grant that is provided by the selected target cell for handover execution. Then, based on received measurements, the serving DU may indicate to the UE that it is to perform a TCI state change to another prepared cell. Based on the received indication, the UE then applies the configuration of the selected target cell and monitors the PDCCH scheduling the UL grant from the other prepared cell that is now a new target cell using the QCL information of the indicated TCI state. Yet, if the selected new target cell is under the control of another DU, the serving DU informs the other DU about the TCI state that the UE will be using for monitoring the PDCCH. Using this information, the target DU can then send the PDCCH using the QCL information of the indicated TCI state. The handover procedure may be a conditional handover procedure (CHO). FIG. 3 illustrates an example embodiment of a CHO. In this example embodiment, a UE 300 is triggered, by a configured event to transmit 320 a measurement report to the access node that is its source access node 310. Based on this report, the source access node 310 may then prepare one or more target cells for the handover in response to deciding 330 that a CHO may be performed. The source access node 310 then transmits 332 to a target access node 312 a CHO request. The source access node 310 also transmits 334 to one or more other potential target access nodes 314 a CHO request. The target access node 312 then performs 336 admission control and also the other possible target nodes 314 perform 338 admission control. As a response, the source access node 310 receives 340 a first CHO request acknowledgement from the target access node 312. Correspondingly, the source access node 310 may also receive 342 a second CHO request acknowledgement from the other target access nodes 314. The source access node 310 then transmits 344 an RRC Reconfiguration to the UE. The RRC reconfiguration may be understood as a handover command. As a response, the UE 300 then evaluates 350 the CHO condition, transmits and receives 355 possibly user data with the source access node 310, and accesses the target access node 312 once the CHO execution condition is met. In other words, preparation of the handover and execution phases are decoupled. The condition may be configured, for example by the source access node 312 in a handover command. This allows the handover command to be sent early, when the UE 300 is still safe in the source cell, and performs access to the target cell late when it is stable, which in turn provides mobility robustness. Once the UE 300 determines 360 that the CHO condition is fulfilled, it stops transmitting and receiving to and from the source access node 310. The UE 300 then transmits 362 a physical random access channel (PRACH) preamble to the target access node 312, receives 364 in response a RACH response and then transmits 366 to the target access node 312 a RRC reconfiguration complete. The target access node 312 then transmits 368 a handover success signaling to the source access node 310, which in response stops 370 transmitting and receiving data from the UE 300 and begins data forwarding and transmits 372 an indication of the sequence number (SN) status transfer to the target access node 312. Thus, in case the source access node 310 receives 374 data from user plane function (UPF) 316, it forwards it to the target access node 312. Then, the source access node 310 may transmit 376 an indication of CHO preparation release to the other potential target access nodes 314. Then, path switch is performed 380 by the source access node 310, the target access node 312, the other target access nodes 314, the UPF 316 and the access management functions (AMF) 318. When a handover procedure is performed, a UE may be configured to perform a CFRA towards a target cell. For this, the target cell may indicate to the UE in the handover command dedicated RACH preambles, which are to be used for accessing the target cell. The RACH preambles may be associated with respective beams of the target cell and the beams may be identified via for example Synchronization Signal Blocks (SSB) and / or Channel State Information-Reference Signals (CSI-RS). However, as the radio conditions of the target cell might change between the time instant the UE receives the CFRA preambles and the time instant for transmitting the RACH preamble by the UE, a procedure for the selection of the RACH preamble may be utilized. FIG. 4 illustrates an example embodiment of this procedure for selecting the RACH preamble. First, in block 410, it is determined if the UE has been configured by the network, using for example a handover command or another RRC message, with CFRA resources that are associated with beams, which may be identified via their respective SSB / CSI-RS indices. The UE may then measure such beams and, if at least one of these SSBs / CSI-RSs has L1-Reference Signal Received Strength (RSRP) above certain threshold T1, then in block 412 the UE selects a beam with an SSB / CSI-RS among the associated SSBs / CSI-RSs having L1-RSRP above threshold T1 and uses the dedicated CFRA resources corresponding to the selected beam for performing the random access. If not, then the UE may fallback to perform the CBRA as illustrated in block 420, and the UE checks first if at least one of the beams, associated with SSBs with a L1-RSRP above another threshold rsrp-ThresholdSSB, is available. If yes, then in block 422 the UE selects a beam with an SSB with L1-RSRP above threshold, otherwise the UE selects any beam as illustrated in block 424. In both cases, the UE performs CBRA on the selected beam. In summary, upon having received the CFRA preambles from the source access node, the UE may first measure the CFRA preamble resources, e.g. the respective SSB / CSI- RSs, and carry out the contention-free random access, if the measurements indicate a signal quality above the threshold T1. Accordingly, the UE may fall back to the contention-based random access (only) upon detecting that the measurements indicate that the CFRA preamble resources are not associated with the signal quality above the threshold. Thus, in an example embodiment in which fallback from CFRA to CBRA is used with case of CHO, the candidates for target cells provide beams within the cell that are associated with an SSB or CSI-RS. A source cell receives a measurement report, from the UE when the UE is served by e.g. a first beam of the source cell associate an SSB 1 (1 indicating the respective index), and forwards the measurement report to the target access node of a handover. Using the measurement report, the target cell that has the strongest DL received measurement then prepares a CFRA preamble that is associated with e.g. a beam associated with SSB 8. This target cell then provides the CFRA resource to the UE using a CHO command that is transmitted by the source access node. After receiving the CHO command, the UE moves, and the CHO execution is met when the UE is served by e.g. a beam associated with an SSB 3. When performing random access, UE drops the prepared CFRA preamble associated with the beam associated with the SSB 8 as its L1-RSRP is below threshold T1 and performs rather CBRA by selecting CBRA preamble that is associated with another beam associated with another SSB e.g.6 having much stronger L1-RSRP than SSB 8. It is to be noted that in CHO the time difference between CHO preparation and execution may be up to a couple of seconds which increases the likelihood of CBRA when compared to baseline handover in which the UE executes RACH access shortly after receiving the handover command containing the prepared CFRA preamble. Thus, it would be beneficial to allocate the CFRA preambles during a handover such that the likelihood of CFRA is maximized and the likelihood of a fallback to CBRA is minimized. It should be appreciated that this is a simplified embodiment with one SSB having the CFRA resources. The target cell may assign the CFRA resources on multiple beams, based on the measurement report. In such a case, the UE may search, through the L1-RSRP measurements, the multiple beams for the CFRA resources that provide the signal quality above the threshold T1 and use one of such CFRA resources for the CFRA. Machine learning (ML) may be utilized for CFRA allocation during handover and a trained ML model may be run by the source access node and the outcome may then be provided to the target access node to assist the target access node in allocating the CFRA resources to a UE. An example of CFRA resources are RACH preambles. The source access node may receive periodic L1 RSRP measurement reports from the UE for reference signaling such as SSB or CSI-RS of serving and neighboring cells enabling L1 triggered inter-cell mobility. This means that the source access node would have more knowledge than target access node which receives a measurement report when a measurement event is triggered. Also, the source access node may configure periodic L3 RSRP measurements, including beam measurements, that may be used for CFRA resource allocation and also for other use cases such as predictive handover, load balancing, grid of beams optimizations, etc. Thus, in an example embodiment, the source access node may provide a target access node with a metric, such as a list of values per beams, provided by the target access node, and identified via their respective SSB and / or CSI-RS, the values indicating their expected goodness for random access. Goodness for random access may be understood as probability, indicated by the metric, of the UE to perform random access via the beam for which the goodness is indicated. Then, using this information, the target access node may configure and allocate CFRA resources to the beams identified via their respective SSB and / or CSI-RS. Then, the target access node may provide feedback on how the allocated CFRA resources corresponding to beams have performed capturing the accuracy of the goodness information. It is to be noted that the metric generated may be based on the measurement report provided by the UE, as described above, or alternatively, the metric may be generated based on a location and motion trajectory of the UE. In some example embodiments, a combination of measurement report as well as the location and motion trajectory may also be used as a basis for generating the metric that may be a metric per beam. A sequence-to-sequence supervised ML may be used for predicting future measurements that may be utilized to determine the possible future beams the UE will be connected to. These future predictions may also capture possible common trajectories of UEs in that geographical area (street, train rails, bus route, FIG.5 illustrates an example embodiment in which ML model is utilized for selecting CFRA resources to be allocated. In this example embodiment, the ML model is used to generate a metric that indicates, for a beam, a probability that a UE will perform random access via the beam. In other words, the ML model outputs a prediction regarding the goodness of the beam. In this example embodiment, a UE 500 transmits 520 to its source access node, such as gNB, 510 a measurement report. Upon receiving the measurement report, the source access node 510 then performs ML inference and thus obtains a prediction regarding goodness of a plurality of beams provided by a target access node, such as a gNB, 515. The beams comprised in the plurality of beams may be identified via their respective SSB and / or CSI-RS. The source access node 510 then transmits 535 to the target access node 515 a handover message that may comprise a handover request, or a CHO request. Along with the request, the prediction of the goodness may also be provided. In other words, at least one generated metric is comprised in the handover message. Then, the target access node 515 may allocate 540 CFRA related resources based on the received prediction and transmit 542 an acknowledgement to the handover request to the source access node 510. The acknowledgement may indicate the allocated CFRA resources to the source access node 510. As a response, the source access node 510 may transmit 544 an RRC reconfiguration to the UE 500, indicating the allocated CFRA resources to the UE 500. The UE 500 then performs the random access procedure to the target cell provided the target access node 515, either in the allocated CFRA resources if possible or, as a fallback, in CBRA resources. After the random access, the target access node 515 may also transmit 560 feedback regarding how the configured CFRA resources have been utilized. For example, the feedback may indicate whether the UE used the CFRA or CBRA resources for the random access and, in case of using the CFRA resources, indicate the beam (via SSB and / or CSI-RS index) used for the random access. Based on this feedback ML can be further trained by the source access node 510 or by any other suitable entity. The prediction, which may also be understood as a metric indicating a probability of the UE performing a random access on the respective beam, indicates the estimated goodness of each SSB or CSI-RS provided by the target access node 515 for random access. It is to be noted that the metric may be generated based on the measurement report provided by the UE 500, or alternatively, or additionally, based on a location and motion trajectory of the UE 500. The goodness may be indicated for example by assigning a priority value per beam to be configured for CFRA, e.g., 1 being the highest. The priority value may be based on the prediction obtained from the ML model regarding future signal levels and the prediction may be based on previous reported measurements. Alternatively, the source access node 510 may indicate the goodness by providing predicted RSRP / RSRQ / SINR measurements for at least some of the beam measurements, which may comprise SSBs and / or CSI-RS measurements, for a next time period of a selected duration. The source access node 510 may for example provide the predicted measurements for different time instants such as for 40 ms, 80 ms, 160 ms, or 200 ms as RACH periodicity configured by target cell may vary, or e.g.1 s, 2 s for a CHO. Yet, in another alternative, the source access node 510 may indicate the goodness by providing the target access node 515 with a list of beams identified via SSB or CSI-RS indices that are to be configured for the CFRA based on the predicted future signal levels. The source access node 510 may also provide a candidate configuration for RACH related thresholds used in selection of CFRA or CBRA, e.g. threshold T1 for each beam of the target cell or at least some of the beams. These thresholds may be predicted by the source access node 510. In this example embodiment, the source access node 510 provides the prediction as part of the handover request. In case the handover request is a CHO request, the source access node 510 may update prediction provided to the target access node 515 by transmitting a new CHO Request to the target access node 515 after preparing the target cell. This may be useful if the prediction changes since last update. The target access node 515 may then choose which threshold(s) to apply and indicate back to the source access node 510 the selected threshold(s) as part of a handover request acknowledgement message. The source access node 510 then delivers the selected threshold(s) to the UE 500 in an RRC reconfiguration message for use in random access. The handover message such as the handover request may also comprise information regarding if feedback is requested. Alternatively, such a request for feedback may be transmitted in another feedback configuration message. If the feedback is requested by the source access node 510, the target access node 515 is to report the feedback to the source access node 510. The source access node 510 may specify in the handover message the feedback information that the target access node 515 shall report. The feedback information may comprise for example one or more of the following: whether UE 500 has performed CBRA or CFRA, a beam on which the CBRA or CFRA has been performed, average signal measurement of the beam over a time period, average throughput per beam in downlink and / or uplink. Additionally, or alternatively, the source access node 510 may inform the target access node 515 whether or not off-policy reinforcement learning (RL) is allowed. The off-policy RL allows the target access node 510 not to select the beam(s) determined by the source access node 510 as the best one(s) or recommended for the CFRA. For example, the target access node 515 may select next best beam(s) or even select a random beam for CFRA. This allows to explore if there are better solutions, or if the environment has changed and updates in the ML model are required. On the other hand, an on-policy RL requires the target access node 515 to follow the selection of beam for CFRA made by the source access node 510. This may be beneficial for example for training the ML model used by the source access node 510. If off-policy RL is allowed, the target access node 515 may add exploration on top of the prediction for CFRA resources. The source access node 510 may for example implement a value function evaluating goodness of each beam for CFRA, while the target access node 515 implements a policy that is selected based on the values of the value function. For example, the target access node 515 may select an exploration policy on the basis of the value functions of the beams, e.g. different exploration policies for different sets of the value functions. Optionally the target access node 515 may define the feedback, that is reported back the source access node 510. In this case, the source access node 510 is training the ML model based on the feedback without specifying the requested type of feedback. The feedback may be understood to comprise labels or parameters that may be used to train the ML model. For example, the target access node 515 may report as feedback one or more of the following: whether the UE 500 has performed CBRA or CFRA, a beam on which the CFRA or CBRA was performed, average throughput of the beam in downlink and / or uplink. The feedback may be aggregated into a single message for example. In an embodiment, the target access node collects the feedback over a plurality of random accesses. In such a case, the feedback may comprise a number, a ratio or a percentage of fallbacks from CFRA to CBRA, which may be understood as a ratio of CBRA. For CHO, the feedback may be provided by the target access node 515 as part of a “Handover Success” message which is sent to the source access node 510 as an indication of a completion of handover. The ML model used may be any suitable ML model. For example, a reinforcement learning based model may be used to map the measurement reports and optionally other information related to the UE into the metric(s). In an example embodiment of reinforcement learning (RL), an algorithm with contextual multi-armed bandit, which is a type of reinforcement learning algorithm, may be used. In RL, the environment may be described as Markov decision process (MDP), and the algorithm learns to maximize the cumulative expected reward by choosing proper sequence of actions in the underlying MDP. With contextual multi armed bandit, one context is used, and the algorithm chooses an action from multiple actions with the objective of maximizing the average reward for the given context. Therefore, the solution algorithm resembles supervised learning algorithms, but since the agent can observe reward just for the taken action, the algorithm adds exploration making it a reinforcement learning algorithm. In this example embodiment, the most relevant input data is considered to be a sequence of beam measurements performed and reported by the UE, such as RSRP sequence, in time from a source cell and / or neighbor cell(s). The beam measurements may be for example from N strongest beam or specific beams. The input is thus a two-dimensional matrix with time and beam domains. This kind of state representation implicitly comprises information on location, direction and speed or a UE. Additionally, or alternatively, any other type of information than the RSRP sequence could be used. In this example embodiment, the inference output and training depend on the ML approach and feedback target cell provides. For example, the source access node 510 may not even know the meaning of the feedback, other than higher the value the better. If off-policy inference is used, then for example supervised learning ML at the source access node 510 may be used. The ML may be for example such that it minimizes loss between the prediction and the feedback. The target access node 515 may add exploration on top of the prediction, e.g. random exploration with decreasing probability as the reward increases. If on-policy is used, then a policy gradient algorithm may be used. In the policy gradient algorithm the output is a probability distribution for different actions. The source access node 510 may sample from the predicted distribution and communicate the select beam for target access node 515. In training, the feedback may be used with cross entropy loss function to increase or decrease the probability of a taken action. FIG.6 illustrates a block diagram according to an example embodiment of performing the selection for a preamble. The blocks may be understood as logical units for performing an action and their actual implementation may be done in any suitable manner. In this example embodiment, the UE 600 is to be handed over from the source cell 610 to a target cell 615. First, in this example embodiment, the UE 600 optionally provides a measurement report comprising a sequence of beam measurement to a block 635 comprising a trained ML model that is hosted by the source access node that provides the source cell 610. The ML model may comprise for example a contextual multi-armed bandit model that predicts an average reward for each beam, optionally considering other information such as the UE’s motion trajectory and / or velocity. This is performed over the air-interface 620. The source access node then performs the ML inference and provides, as an output from the ML model, a prediction 640 in the form of the above-described metric(s) for example. The prediction is then provided using an Xn-interface to the target access node that provides the target cell 615. The target access node then performs action selection, which comprises selecting at least one beam to have the CFRA resources, in block 650, runs the selected action in block 655, by preparing the selected beam(s) with the CFRA resources, and finally evaluates the action in block 660 (the random access performed by the UE). Based on the evaluation, the above-described feedback 670 for re-training the ML model may be provided. As the target access node selects the action in block 650, the target access node may decide to perform exploration with random probability. If exploration is performed, the target access node may prepare a random beam weighted by the predicted values, wherein the random beam may be a beam other than the beam having the highest predicted value (being the most probable for the random access). If no exploration is performed, the target access node may select the beam with the highest predicted value. When evaluating the action in block 660, the target access node may evaluate if the preparation of the beam resulted in successful CFRA handover. If so, the reward is 1, otherwise 0. Successful CFRA handover may be decided e.g. if UE has successfully performed CFRA to the target cell and no radio link failure (RLF) occurred after the handover within a pre-determine time period, such as T seconds. If the reward is fed back to the source access node, the source access node associates the reward with the input and action and may use it as part of training. The source access node may use for the training a mean square error (MSE) loss function to minimize difference between the predicted action performance and the observed action performance. The example embodiment described above may have a benefit of reducing signaling overhead over Xn as just the output of the ML algorithm may be provided to the target cell and not the whole data set. Another benefit may be that the example embodiments described above allow leveraging of measurement traces that are available in the source cell and used in other use cases such as L1-triggered inter-cell mobility, predictive handover, load balancing, grid of beam optimizations, etc. Also, the ability for the target access node to define how to train the ML model run at the source access node may have the benefit of allowing target cell-specific configuration. FIG.7 illustrates an example embodiment of a supervised learning autoencoder ML model. In this example embodiment, signal levels 700 are illustrated for a history window 710 that takes previous UE measurements of serving and target cells and / or beam signal levels as input 720 and provides as an output 740 a multi-step prediction for the signal levels for a future window 715. For example, the input 720 may comprise N beams and X steps and the output 740 may comprise N beams and Y steps. The input is processed by an encoder 730 after which there is a decoder 735 for providing the output 740. The output 740 is also provided to post-processing 750 after which the target cells 755 can be identified. Post-processing the prediction window by the serving access node may allow it to identify the future multi-step signal levels and pick the best possible future target cell for the UE. FIG 8 illustrates an example embodiment for one training cycle of a supervised ML model, in which ground truth, in other words labels, is obtained at training time. In this example embodiment there is RSRP levels 800 illustrated for a given time 805 for the cells 810, 812 and 814. An input sequence KxN 830 from a history window 835 is provided to the ML training 840 as an input. The corresponding estimates for a best cell 850 for a sequence K x M used for labeling and obtained during a training time window 855 is provided to the ML training as the labels. FIG.9 illustrates an example embodiment of an apparatus that may be an access node or be comprised in an access node such as a gNB. The apparatus may be, for example, a circuitry or a chipset applicable to an access node to realize the described embodiments. The apparatus 900 may be an electronic device comprising one or more electronic circuitries. The apparatus 900 may comprise a communication control circuitry 910 such as at least one processor, and at least one memory 920 including a computer program code (software) 922 wherein the at least one memory and the computer program code (software) 922 are configured, with the at least one processor, to cause the apparatus 900 to carry out any one of the example embodiments of the access node described above. The apparatus may be applicable to operate as the source access node and / or the target access node. The memory 920 may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The memory may comprise a configuration database for storing configuration data. For example, the configuration database may store current neighbour cell list, and, in some example embodiments, structures of the frames used in the detected neighbour cells. The apparatus 900 may further comprise a communication interface 930 comprising hardware and / or software for realizing communication connectivity according to one or more communication protocols. The communication interface 930 may provide the apparatus with radio communication capabilities to communicate in the cellular communication system. The communication interface may, for example, provide a radio interface to terminal devices to communicate the RRC messages to the UEs and to receive the measurement reports. The apparatus 900 may further comprise another interface towards a core network such as the network coordinator apparatus and / or to the access nodes of the cellular communication system, e.g. to transfer the handover messages described above in connection with Figure 5, for example. The apparatus 900 may further comprise a scheduler 940 that is configured to allocate resources. Even though the invention has been described above with reference to examples according to the accompanying drawings, it is clear that the invention is not restricted thereto but can be modified in several ways within the scope of the appended claims. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, the embodiment. It will be obvious to a person skilled in the art that, as technology advances, the inventive concept can be implemented in various ways. Further, it is clear to a person skilled in the art that the described embodiments may, but are not required to, be combined with other embodiments in various ways.
Claims
Claims 1. An apparatus comprising at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, are configured to cause the apparatus at least to: generate, per beam of a plurality of beams of a target cell a metric indicating a probability of the user equipment to perform random access via said respective beam; and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics.
2. An apparatus according to claim 1, wherein the metric is generated based on a measurement report received from a user equipment, wherein the measurement report comprises measurements regarding the plurality of beams of the target cell.
3. An apparatus according to claim 1, wherein the metric is generated based on a location and motion trajectory of the user equipment.
4. An apparatus according to any previous claim, wherein the apparatus is configured to associate the metric with the respective beam via a synchronization signal block or a channel state information reference signal of the beam.
5. An apparatus according to any previous claim, wherein the apparatus is further caused to receive, from a target access node providing the target cell, feedback information comprising at least one of: indication of a beam the user equipment used for performing the random access, and whether the user equipment used contention-free random access or contention-based random access.
6. An apparatus according to claim 5, wherein the apparatus is further caused to use a machine learning model to generate the metrics and to train the machine learning model based on the feedback.
7. An apparatus according to claim 5 or 6, wherein the apparatus is further caused to transmit to the target access node a feedback configuration message comprising at least one information element enabling the target access node to transmit the feedback and at least one information element indicating contents of the feedback information.
8. An apparatus according to any previous claim, wherein the handover message is a handover request or a conditional handover request.
9. An apparatus according to any previous claim, wherein the handover message further comprises a threshold for the user equipment to use in a selection of either a contention free random access or a contention based random access at the target cell.
10. An apparatus according to any previous claim, wherein the metric comprises one of the following: a priority value assigned per beam, predicted measurements per beam for a next time period, or a list of beams that the target cell shall configure for contention-free random access.
11. An apparatus according to any previous claim, wherein the handover message further indicates if an off-policy is allowed, wherein the off-policy allows the target access node not to follow at least one of the at least one metric.
12. An apparatus comprising at least one processor, and at least one memory storing instructions that, when executed by the at least one processor, are configured to cause the apparatus at least to:receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam; based on the metrics, allocate contention free random access resources to the plurality of beams; and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams.
13. An apparatus according to claim 12, wherein the beam is identified via a synchronization signal block or a channel state information reference signal.
14. An apparatus according to claim 12 or 13, wherein the apparatus is further caused to: perform contention free random access or contention based random access with the user equipment via a beam of the plurality of beams; transmit, to the source access node, feedback information comprising at least one of: indication of the beam the user equipment used for the random access, and whether the user equipment used the contention-free random access or the contention-based random access.
15. An apparatus according to claim 14, wherein the feedback information further comprises one or more of the following: a per-beam average throughput; a per-beam average signal measurement over a time period.
16. An apparatus according to any of claims 12 to 15, wherein the handover message further comprises configuration information for the user equipment to select between contention free random access or contention-based random access to the target cell.
17. An apparatus according to any of claims 12 to 16, wherein the metric comprises one of the following: a priority value assigned per beam, predicted measurements per beam for a next time period, or a list of beams for contention free random access.
18. An apparatus according to any previous claim, wherein the handover message further indicates if an off-policy is allowed, and wherein the apparatus is caused to not follow at least one of the received metrics, if the handover message indicates that the off-policy is allowed.
19. A method comprising: generating, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam; and transmitting a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics.
20. A method comprising: receiving, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam; based on the metrics, allocating contention free random access resources to the plurality of beams; and transmitting, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams.
21. A computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following:generate, per beam of a plurality of beams of a target cell, a metric indicating a probability of the user equipment to perform random access via said respective beam; and transmit a handover message to a target access node of the target cell, wherein the handover message comprises at least one of the metrics.
22. A computer readable medium comprising program instructions that, when executed by an apparatus, cause the apparatus to perform at least the following: receive, from a source access node, a handover message, wherein the handover message comprises, per beam of a plurality of beams of a target cell provided by the apparatus, a metric indicating a probability of a user equipment to perform random access via said respective beam; based on the metrics, allocate contention free random access resources to the plurality of beams; and transmit, to the source access node, an acknowledgement regarding the handover message, wherein the acknowledgement comprises the allocation of the contention free random access resources to the plurality of beams.
Citation Information
Patent Citations
Updating contention free random access resources during conditional handover
EP3716682A1
Resource processing method and apparatus, device, and storage medium
EP4087317A1
Beam selection for initiating random access during conditional handover execution
US20200413392A1
Reporting From User Equipment to the Network for Radio Link Monitoring, Beam Failure Detection, and Beam Failure Recovery
US20220104300A1
Enhanced contention-free random access (CFRA) preamble assignment
WO2023001364A1
