Node and user equipment in wireless communication system and method performed by the same

Abstract

The disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate. The present disclosure provides a node and a user equipment in a wireless communication system and methods performed by the same. A method performed by a first node in a wireless communication system includes: receiving a thirteenth message from a second node, wherein the thirteenth message includes first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node; transmitting a fourteenth message to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information; and transmitting a sixteenth message to the second node, wherein the sixteenth message includes a handover command for handing over the UE to the third node.

Description

NODE AND USER EQUIPMENT IN WIRELESS COMMUNICATION SYSTEM AND METHOD PERFORMED BY THE SAME

[0001] The present disclosure relates to a technical field of wireless communication, and more specifically, to a node and a user equipment in a wireless communication system and methods performed by the same.

[0002] 5G mobile communication technologies define broad frequency bands such that high transmission rates and new services are possible, and can be implemented not only in "Sub 6GHz" bands such as 3.5GHz, but also in "Above 6GHz" bands referred to as mmWave including 28GHz and 39GHz. In addition, it has been considered to implement 6G mobile communication technologies (referred to as Beyond 5G systems) in terahertz bands (for example, 95GHz to 3THz bands) in order to accomplish transmission rates fifty times faster than 5G mobile communication technologies and ultra-low latencies one-tenth of 5G mobile communication technologies.

[0003] At the beginning of the development of 5G mobile communication technologies, in order to support services and to satisfy performance requirements in connection with enhanced Mobile BroadBand (eMBB), Ultra Reliable Low Latency Communications (URLLC), and massive Machine-Type Communications (mMTC), there has been ongoing standardization regarding beamforming and massive MIMO for mitigating radio-wave path loss and increasing radio-wave transmission distances in mmWave, supporting numerologies (for example, operating multiple subcarrier spacings) for efficiently utilizing mmWave resources and dynamic operation of slot formats, initial access technologies for supporting multi-beam transmission and broadbands, definition and operation of BWP (BandWidth Part), new channel coding methods such as a LDPC (Low Density Parity Check) code for large amount of data transmission and a polar code for highly reliable transmission of control information, L2 pre-processing, and network slicing for providing a dedicated network specialized to a specific service.

[0004] Currently, there are ongoing discussions regarding improvement and performance enhancement of initial 5G mobile communication technologies in view of services to be supported by 5G mobile communication technologies, and there has been physical layer standardization regarding technologies such as V2X (Vehicle-to-everything) for aiding driving determination by autonomous vehicles based on information regarding positions and states of vehicles transmitted by the vehicles and for enhancing user convenience, NR-U (New Radio Unlicensed) aimed at system operations conforming to various regulation-related requirements in unlicensed bands, NR UE Power Saving, Non-Terrestrial Network (NTN) which is UE-satellite direct communication for providing coverage in an area in which communication with terrestrial networks is unavailable, and positioning.

[0005] Moreover, there has been ongoing standardization in air interface architecture / protocol regarding technologies such as Industrial Internet of Things (IIoT) for supporting new services through interworking and convergence with other industries, IAB (Integrated Access and Backhaul) for providing a node for network service area expansion by supporting a wireless backhaul link and an access link in an integrated manner, mobility enhancement including conditional handover and DAPS (Dual Active Protocol Stack) handover, and two-step random access for simplifying random access procedures (2-step RACH for NR). There also has been ongoing standardization in system architecture / service regarding a 5G baseline architecture (for example, service based architecture or service based interface) for combining Network Functions Virtualization (NFV) and Software-Defined Networking (SDN) technologies, and Mobile Edge Computing (MEC) for receiving services based on UE positions.

[0006] As 5G mobile communication systems are commercialized, connected devices that have been exponentially increasing will be connected to communication networks, and it is accordingly expected that enhanced functions and performances of 5G mobile communication systems and integrated operations of connected devices will be necessary. To this end, new research is scheduled in connection with eXtended Reality (XR) for efficiently supporting AR (Augmented Reality), VR (Virtual Reality), MR (Mixed Reality) and the like, 5G performance improvement and complexity reduction by utilizing Artificial Intelligence (AI) and Machine Learning (ML), AI service support, metaverse service support, and drone communication.

[0007] Furthermore, such development of 5G mobile communication systems will serve as a basis for developing not only new waveforms for providing coverage in terahertz bands of 6G mobile communication technologies, multi-antenna transmission technologies such as Full Dimensional MIMO (FD-MIMO), array antennas and large-scale antennas, metamaterial-based lenses and antennas for improving coverage of terahertz band signals, high-dimensional space multiplexing technology using OAM (Orbital Angular Momentum), and RIS (Reconfigurable Intelligent Surface), but also full-duplex technology for increasing frequency efficiency of 6G mobile communication technologies and improving system networks, AI-based communication technology for implementing system optimization by utilizing satellites and AI (Artificial Intelligence) from the design stage and internalizing end-to-end AI support functions, and next-generation distributed computing technology for implementing services at levels of complexity exceeding the limit of UE operation capability by utilizing ultra-high-performance communication and computing resources.

[0008] In order to meet an increasing demand for wireless data communication services since a deployment of 4G communication system, efforts have been made to develop an improved 5G or pre-5G communication system. Therefore, the 5G or pre-5G communication system is also called "beyond 4G network" or "post LTE system".

[0009] Wireless communication is one of the most successful innovations in modern history. Recently, a number of subscribers of wireless communication services has exceeded 5 billion, and it continues growing rapidly. With the increasing popularity of smart phones and other mobile data devices (such as tablet computers, notebook computers, netbooks, e-book readers and machine-type devices) in consumers and enterprises, a demand for wireless data services is growing rapidly. In order to meet rapid growth of mobile data services and support new applications and deployments, it is very important to improve efficiency and coverage of wireless interfaces.

[0010] Embodiments of the present disclosure may provide a node and a user equipment in wireless communication system and method performed by the same.

[0011] Embodiments of the present disclosure provide a method performed by a first node in a wireless communication system, including: receiving a thirteenth message from a second node, wherein the thirteenth message includes first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; transmitting a fourteenth message to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information; and transmitting a sixteenth message to the second node, wherein the sixteenth message includes a handover command for handing over the UE to the third node.

[0012] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0013] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0014] According to embodiments of the present disclosure, the method further includes: receiving a fifteenth message from the third node, wherein the fifteenth message includes second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node.

[0015] According to embodiments of the present disclosure, the method further includes: transmitting a seventeenth message to a fifth node, wherein the seventeenth message includes at least one of the first access-related information, the first data transmission state information, the second access-related information, the data transmission state information, wherein the seventeenth message is used for the fifth node to transmit data to at least one of the second node and the third node.

[0016] According to embodiments of the present disclosure, the method further includes: receiving mobility information related to one or more UEs from the third node; and transmitting the mobility information to the second node, wherein the mobility information is used for training a model for generating the first access-related information.

[0017] Embodiments of the present disclosure provide a method performed by a second node in a wireless communication system, including: transmitting a thirteenth message to a first node, wherein the thirteenth message includes first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and receiving a sixteenth message from the first node, wherein the sixteenth message includes a handover command for handing over the UE to the third node, wherein a fourteenth message is transmitted by the first node to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information.

[0018] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0019] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0020] According to embodiments of the present disclosure, the method further includes: obtaining mobility information related to one or more UEs, wherein the mobility information is used for training a model for generating the first access-related information.

[0021] According to embodiments of the present disclosure, the method further includes: obtaining history data transmission state information related to one or more nodes, wherein the history data transmission state information is used for training a model for generating the first data transmission state information.

[0022] According to embodiments of the present disclosure, the method further includes: transmitting a Radio Resource Control (RRC) reconfiguration message to the UE, wherein the RRC reconfiguration message includes the first access-related information.

[0023] Embodiments of the present disclosure provide a method performed by a user equipment (UE) in a wireless communication system, including: transmitting a measurement report to a second node; and receiving a Radio Resource Control (RRC) reconfiguration message from the second node, wherein the RRC reconfiguration message includes first access-related information for the UE to access a third node, wherein a thirteenth message is transmitted by the second node to a first node, wherein the thirteenth message includes the first access-related information and first data transmission state information of the second node before the UE accesses the third node; wherein a fourteenth message is transmitted by the first node to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and wherein a sixteenth message is transmitted by the first node to the second node, wherein the sixteenth message includes a handover command for handing over the UE to the third node.

[0024] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0025] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0026] Embodiments of the present disclosure provide a method performed by a third node in a wireless communication system, including: receiving a fourteenth message from a first node, wherein the fourteenth message includes first access-related information for a User Equipment (UE) to access the third node and first data transmission state information of a second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and transmitting a fifteenth message to the first node, wherein the fifteenth message includes second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node.

[0027] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0028] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0029] According to embodiments of the present disclosure, the method further includes: transmitting mobility information related to one or more UEs to the first node, wherein the mobility information is used for training a model for generating the first access-related information.

[0030] Embodiments of the present disclosure provide a node device in a wireless communication system, including: a transceiver configured to transmit and receive signals; and a processor coupled to the transceiver and configured to perform methods performed by any node (e.g., a first node, a second node, a third node, etc.) in a wireless communication system according to embodiments of the present disclosure.

[0031] Embodiments of the present disclosure provide a user equipment (UE) in a wireless communication system, including: a transceiver configured to transmit and receive signals; and a processor coupled to the transceiver and configured to perform methods performed by a user equipment (UE) in a wireless communication system according to embodiments of the present disclosure.

[0032] Embodiments of the present disclosure provide a computer-readable medium having stored thereon computer-readable instructions which, when executed by a processor, perform methods performed by any node and / or a user equipment in a wireless communication system according to embodiments of the present disclosure.

[0033] The methods performed by the node and / or user equipment (UE) in a wireless communication system provided by the present disclosure can effectively support preparation of handover in advance by exchanging access-related information for accessing a target node / cell and / or information related to the data transmission states of the nodes between the nodes and / or the user equipment, so as to achieve an effect of seamless handover.

[0034] Embodiments of the present disclosure may provide a node and a user equipment in wireless communication system and method performed by the same.

[0035] The above and other aspects, features and advantages of certain embodiments of the present disclosure will be more apparent from the following description taken in conjunction with the accompanying drawings, in which:

[0036] FIG. 1 is an exemplary system architecture of System Architecture Evolution (SAE);

[0037] FIG. 2 is an exemplary system architecture according to various embodiments of the present disclosure;

[0038] FIG. 3A shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0039] FIG. 3B shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0040] FIG. 3C shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0041] FIG. 3D shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0042] FIG. 3E shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0043] FIG. 4A shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0044] FIG. 4Ba shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0045] FIG. 4Bb shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0046] FIG. 4Bc shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0047] FIG. 4C shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0048] FIG. 4D shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0049] FIG. 4Ea shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0050] FIG. 4Eb shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0051] FIG. 4Ec shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0052] FIG. 4F shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0053] FIG. 4G shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0054] FIG. 4Ha shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0055] FIG. 4Hb shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0056] FIG. 4Hc shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0057] FIG. 4Ia shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0058] FIG. 4Ib shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0059] FIG. 5 shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0060] FIG. 6 shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure;

[0061] FIG. 7 shows a flowchart of a method performed by a first node in a wireless communication system according to embodiments of the present disclosure;

[0062] FIG. 8 shows a flowchart of a method performed by a second node in a wireless communication system according to embodiments of the present disclosure;

[0063] FIG. 9 shows a flowchart of a method performed by a user equipment (UE) in a wireless communication system according to embodiments of the present disclosure;

[0064] FIG. 10 shows a flowchart of a method performed by a third node in a wireless communication system according to embodiments of the present disclosure;

[0065] FIG. 11 shows a schematic diagram of a node according to embodiments of the present disclosure; and

[0066] FIG. 12 shows a schematic diagram of a user equipment (UE) according to embodiments of the present disclosure.

[0067] The following description with reference to the accompanying drawings is provided to assist in a comprehensive understanding of various embodiments of the present disclosure as defined by the claims and their equivalents. It includes various specific details to assist in that understanding but these are to be regarded as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the various embodiments described herein can be made without departing from the scope and spirit of the present disclosure. In addition, descriptions of well-known functions and constructions may be omitted for clarity and conciseness.

[0068] The terms and words used in the following description and claims are not limited to the bibliographical meanings, but, are merely used by the inventor to enable a clear and consistent understanding of the present disclosure. Accordingly, it should be apparent to those skilled in the art that the following description of various embodiments of the present disclosure is provided for illustration purpose only and not for the purpose of limiting the present disclosure as defined by the appended claims and their equivalents.

[0069] It is to be understood that the singular forms "a," "an," and "the" include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to "a component surface" includes reference to one or more of such surfaces.

[0070] The term "include" or "may include" refers to the existence of a corresponding disclosed function, operation or component which can be used in various embodiments of the present disclosure and does not limit one or more additional functions, operations, or components. The terms such as "include" and / or "have" may be construed to denote a certain characteristic, number, step, operation, constituent element, component or a combination thereof, but may not be construed to exclude the existence of or a possibility of addition of one or more other characteristics, numbers, steps, operations, constituent elements, components or combinations thereof.

[0071] The term "or" used in various embodiments of the present disclosure includes any or all of combinations of listed words. For example, the expression "A or B" may include A, may include B, or may include both A and B.

[0072] Unless defined differently, all terms used herein, which include technical terminologies or scientific terminologies, have the same meaning as that understood by a person skilled in the art to which the present disclosure belongs. Such terms as those defined in a generally used dictionary are to be interpreted to have the meanings equal to the contextual meanings in the relevant field of art, and are not to be interpreted to have ideal or excessively formal meanings unless clearly defined in the present disclosure.

[0073] Figures discussed below and various embodiments for describing the principles of the present disclosure in this patent document are only for illustration and should not be interpreted as limiting the scope of the present disclosure in any way. Those skilled in the art will understand that the principles of the present disclosure can be implemented in any suitably arranged system or device.

[0074] FIG. 1 is an exemplary system architecture 100 of system architecture evolution (SAE). User equipment (UE) 101 is a terminal device for receiving data. An evolved universal terrestrial radio access network (E-UTRAN) 102 is a radio access network, which includes a macro base station (eNodeB / NodeB) that provides UE with interfaces to access the radio network. A mobility management entity (MME) 103 is responsible for managing mobility context, session context and security information of the UE. A serving gateway (SGW) 104 mainly provides functions of user plane, and the MME 103 and the SGW 104 may be in the same physical entity. A packet data network gateway (PGW) 105 is responsible for functions of charging, lawful interception, etc., and may be in the same physical entity as the SGW 104. A policy and charging rules function entity (PCRF) 106 provides quality of service (QoS) policies and charging criteria. A general packet radio service support node (SGSN) 108 is a network node device that provides routing for data transmission in a universal mobile telecommunications system (UMTS). A home subscriber server (HSS)109 is a home subsystem of the UE, and is responsible for protecting user information including a current location of the user equipment, an address of a serving node, user security information, and packet data context of the user equipment, etc.

[0075] FIG. 2 is an exemplary system architecture 200 according to various embodiments of the present disclosure. Other embodiments of the system architecture 200 can be used without departing from the scope of the present disclosure.

[0076] User equipment (UE) 201 is a terminal device for receiving data. A next generation radio access network (NG-RAN) 202 is a radio access network, which includes a base station (a gNB or an eNB connected to 5G core network 5GC, and the eNB connected to the 5GC is also called ng-gNB) that provides UE with interfaces to access the radio network. An access control and mobility management function entity (AMF) 203 is responsible for managing mobility context and security information of the UE. A user plane function entity (UPF) 204 mainly provides functions of user plane. A session management function entity SMF 205 is responsible for session management. A data network (DN) 206 includes, for example, services of operators, access of Internet and service of third parties.

[0077] Nodes and / or entities described in the present disclosure may include: gNB, gNB Central Unit (gNB-CU), gNB Distributed Unit (gNB-DU), gNB Central Unit-Control Plane (gNB-CU-CP), gNB Central Unit-User Plane (gNB CU-UP), en-gNB, eNB, ng-eNB, UE, Access and Mobility Management Function (AMF), Session Management Function (SMF), Mobility Management Entity (MME), Location Management Function (LMF), and other network entities or network logic units, and cells and / or beams managed by them, etc.

[0078] The information and / or field described in the present disclosure may be an average value, an instantaneous value, a maximum value, a minimum value, etc. of the corresponding information and / or field and / or parameter and / or numerical value, etc., which are not limited herein.

[0079] The information and / or field described in the present disclosure may be used to represent one or more of the following cases: uplink, downlink, uplink and downlink, uplink or downlink.

[0080] The signal strength and / or signal quality and / or measurement report and / or measurement result and / or measurement report result and / or signal measurement result described in the present disclosure may be Received Signal Strength Indicator (RSSI), Reference Signal Receiving Power (RSRP), Reference Signal Receiving Quality (RSRQ), Signal to Interference plus Noise Ratio (SINR), etc.

[0081] In the present disclosure, a slice identifier may be represented by one or more Single Network Slice Selection Assistance Information (S-NSSAI).

[0082] In the present disclosure, failure type and / or problem type may also be referred to as report type.

[0083] In the present disclosure, self-optimization network (SON) related reports may include one or more of the following: Connection Establishment Failure (CEF) reports, Random Access reports, Successful Handover reports, Radio Link Failure (RLF) reports, measurement reports, or other wireless connection related reports.

[0084] In the present disclosure, radio link failure includes two situations: radio link failure and handover failure.

[0085] In the present disclosure, a TA value obtained in advance and a TA value in an LTM command may refer to each other.

[0086] In the present disclosure, a TA obtained in advance may also be called a TA obtained by early synchronization and / or corresponding to early synchronization.

[0087] Network self-optimization decisions described in the present disclosure may include network energy saving, load balancing, coverage and / or capacity optimization, mobility optimization and / or management, making and / or updating configurations, etc.

[0088] In the present disclosure, results and reports may be referred to each other.

[0089] In the present disclosure, time can be represented by one or more of the following: timestamp, time point, time interval, timer, period of time, time length, time period, time spacing, duration, etc. The time length may be the length of time from a certain time point, which may be the current time or any other time point. The time may be a relative time or an absolute time. In some implementations, the period of time may be represented by separate fields, for example, by a combination of a start time and an end time, or by a combination of a start time and a time period.

[0090] In the present disclosure, Quality of Experience (QoE) parameters and / or user experience parameters may include one or more of the following: Round-trip time, Jitter duration, Corruption duration, Average throughput, Initial playback delay, Playout Delay at Initial Startup, Device Information, Rendered viewports, Codec information, Buffer level, Representation switch events, Play List, MPD (Media presentation description) Information, Interactivity Summary, Interactivity Event List, etc.

[0091] In the present disclosure, Quality of Service (QoS) parameters may include at least one of the following: packet loss rate, latency, throughput, data rate, etc.

[0092] In the present disclosure, load condition and / or load information may include one or more of the following: PRB usage ratio, number of available PRBs, number of allocated PRBs, scheduled PDCCH CCE usage, Transport Network Layer (TNL) capacity indication, radio resource status, comprehensive available capacity group, comprehensive available resource group, number of active user terminals, number of Radio Resource Control (Radio Resource Control (RRC) connections, slice available capacity, hardware capacity indication, S1 TNL load indication, hardware load indication, Almost Blank Subframe (ABS) status, Reference Signal Received Power (RSRP) measurement report list, Reference Signal Receiving Quality (RSRQ) measurement report, Signal to Interference plus Noise Ratio (SINR） measurement report, Channel State Information (CSI) report, cell report indication, Channel Occupancy time ratio, Energy Detection threshold, signal strength and / or signal quality, channel busy ratio, data volume, and Jitter of each of the above parameters, etc.

[0093] In the present disclosure, load condition and / or load information may be referred to with resource status interchangeably.

[0094] In the present disclosure, capacity information may be one or more of the following: QoS requirements, QoS classes, capacity status, average QoS requirements, average QoS classes, average capacity status identifiers, the proportion of one or more QoS requirements, the proportion of one or more QoS classes, the proportion of one and / or more capacity status identifiers, etc. Herein, the capacity status identifier is representation by an identifier, where one identifier represents a capacity configuration. The QoS class may be represented by an identifier, which may be, for example, a mapped 5G QoS Identifier (5QI) or a QoS Class Identifier (QCI).

[0095] In the present disclosure, the capacity prediction information may be a predicted value of the capacity information.

[0096] In the present disclosure, a beam may refer to an SSB beam or any other beam.

[0097] In the present disclosure, a location may be represented by one or more of the following: coordinates, an area, a cell identifier, a beam identifier, an identifier used to represent a location and / or an area, etc. The cell identifier may be one or more of the following: a visited cell identifier, a connecting cell identifier, a serving cell identifier, etc. The beam identifier may be one or more of the following: a visited beam identifier, a connecting beam identifier, an accessing beam identifier, etc. The identifier used to represent a location and / or an area may be used to represent a certain location or locations and / or a certain area or areas. In some implementations, for example, areas whose distance is greater than and / or equal to and / or less than a certain threshold may be represented by an identifier. In some other implementations, for example, areas where the signal quality is greater than and / or equal to and / or less than a certain threshold may be represented by an identifier.

[0098] In the present disclosure, a target node may also be a candidate target node, a target master node, a target secondary node, a candidate target master node, a candidate target secondary node, etc.

[0099] In the present disclosure, a source node may also be a source master node, a source secondary node, etc.

[0100] In the present disclosure, data collection may be Minimization of Drive Tests (MDT) or any other data collection, which is not limited herein. The MDT may be logged MDT or immediate MDT. The MDT may be signaling-based MDT or management-based MDT.

[0101] In the present disclosure, collect / collection may also be referred to as measure / measurement.

[0102] In the present disclosure, information may be an actual value collected and / or measured, a predicted value, or a generated value. The generated value may be a calculated value obtained using a mathematical method or the like, or a generated value and / or an output value obtained using a method such as an artificial intelligence (AI) model.

[0103] In the present disclosure, data collection may be used to collect user trajectory information and / or user performance information, or may be used to collect any other data.

[0104] In the present disclosure, a secondary cell may be a Primary Secondary Cell (PSCell) or a Secondary Cell (SCell).

[0105] In the present disclosure, data corresponding to the data collection may include one or more of the following:

[0106] ● User trajectory related data: it may include one or more of the following information related to a user:

[0107] ○ User identifier (ID)

[0108] ○ Visited cell identifier

[0109] ○ Visited primary cell identifier

[0110] ○ Visited secondary cell identifier

[0111] ○ Visited primary cell identifier and visited secondary cell identifier: which indicates a visited primary cell and a visited secondary cell by the user in the case of dual-connectivity.

[0112] ○ Node where a visited cell is located: it may be a node identifier or a node name.

[0113] ○ Node where a visited primary cell is located: it may be a node identifier or a node name.

[0114] ○ Node where a visited secondary cell is located: it may be a node identifier or a node name.

[0115] ○ Visit time and / or stay time

[0116] ○ Coordinate

[0117] ○ Information of a visited beam: it may be a beam identifier.

[0118] ● User performance related data: it may include one or more of the following information related to a user:

[0119] ○ User identifier (ID)

[0120] ○ Collection time of user performance

[0121] ○ Node corresponding to user performance: it may be a node identifier or a node name

[0122] ○ Identifier of a cell corresponding to user performance

[0123] ○ User performance: it may include one or more of the following: uplink and / or downlink data rate, uplink and / or downlink throughput, uplink and / or downlink latency, uplink and / or downlink packet loss rate, uplink and / or downlink QoE parameters.

[0124] ● User measurement result information: it may include one or more of the following:

[0125] ○ User identifier (ID)

[0126] ○ Node ID and / or cell ID corresponding to a user measurement result

[0127] ○ Measurement result

[0128] ○ Measurement time

[0129] In the present disclosure, a beam may refer to a synchronization signal and physical broadcast channel (PBCH) block (SSB) beam, or any other beam.

[0130] In the present disclosure, user equipment (UE), user, terminal and the like can refer to each other.

[0131] In the present disclosure, a cell may also refer to one or more beams associated with the cell.

[0132] In the present disclosure, a beam may also refer to a cell to which the beam corresponds.

[0133] In the present disclosure, TAs may include one or more of the following: TA, TA obtained by early synchronization, TA obtained by RACH-free, TA obtained by random access, TA used for accessing a (target) cell, TA used when access to a (target) cell fails, TA corresponding to transmission failure, difference between TA and the edge of a receiving window, difference between TA and the center of a receiving window, receiving (time) point corresponding to the transmission of data and / or information using a TA, difference between the receiving (time) point corresponding to the transmission of data and / or information using a TA and the edge of a receiving window, difference between the receiving (time) point corresponding to the transmission of data and / or information using a TA and the center of a receiving window, difference between a TA used when access fails and a TA used when access succeeds, difference between a TA used when access succeeds and a TA obtained by early synchronization, size of a receiving window, information of the edge of a receiving window, information of the center of a receiving window, average of the above information, difference of the above information, variance of the above information, standard deviation of the above information, etc. The random access may include one or more of the following: contention-based random access, contention-free random access, etc.

[0134] In the present disclosure, a TA value may be the numerical value of a TA or the like.

[0135] In the present disclosure, Transmission Configuration Indicators (TCI) may include one or more of the following: TCI, TCI obtained by early synchronization and / or corresponding to early synchronization, TCI obtained by RACH-free and / or corresponding to RACH-free, TCI obtained by random access and / or corresponding to random access, TCI corresponding to access to a (target) cell, TCI corresponding to access failure of a (target) cell, TCI corresponding to transmission failure, receiving (time) point corresponding to the transmission of data and / or information using a TCI, difference between the receiving (time) point corresponding to the transmission of data and / or information using a TCI and the edge of a receiving window, difference between the receiving (time) point corresponding to the transmission of data and / or information using a TCI and the center of a receiving window, difference between a TCI corresponding to access failure and a TCI corresponding to access success, difference between a TCI corresponding to access success and a TCI corresponding to early synchronization, size of a receiving window, information of the edge of a receiving window, information of the center of a receiving window, average of the above information, difference of the above information, variance of the above information, standard deviation of the above information, etc. The random access may include one or more of the following: contention-based random access, contention-free random access, etc.

[0136] In the present disclosure, the TCI may also refer to beam information. The beam information may be one and / or a list of beam identifiers, etc.

[0137] In the present disclosure, the edge may include one or more of the following: the starting point of a receiving window, the ending point of a receiving window, a certain distance from the starting point of a receiving window, a certain distance from the ending point of a receiving window, a distance, etc. The center may be the center point of a receiving window, a certain distance from the center point, a certain distance from the center point within a certain range, etc. The center may include one or more of the following: the center point of a receiving window, a certain distance from the center point, a distance, a distance from the center point within a certain range, range information, etc. The center may be determined by the starting point of the receiving window and / or the ending point of the receiving window. For example, it may be the sum of the starting point of the receiving window and the ending point of the receiving window, and then divided by 2.

[0138] In the present disclosure, information may be obtained through measurement, artificial intelligence and / or machine learning models, or other mathematical methods.

[0139] In the present disclosure, a model may be an artificial intelligence model and / or a machine learning model, a mathematical model, or any other model.

[0140] In the present disclosure, model training may include one or more of the following: generation of a model, training of a model, fine-tuning of a model, etc.

[0141] In the present disclosure, collection may be referred to interchangeably with measurement.

[0142] In the present disclosure, "related to" or "associated with" and the like may also mean "including" and they may be used interchangeably. For example, a first message related to / associated with first information may also represent a first message including the first information, and so on.

[0143] The existing technology has many restrictions for realizing seamless handover and is relatively complex. Therefore, it is necessary to design a highly versatile solution.

[0144] Example 1

[0145] The present disclosure proposes a method for supporting mobility, which may include one or more of the following steps.

[0146] In some implementations, a first node may transmit a first message including a request for relevant information for accessing a target node and / or cell to a second node to request the second node to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. After obtaining the relevant information for accessing the target node and / or cell, the first node may perform handover based on the relevant information for accessing the target node and / or cell, or forward it to other nodes for the other nodes to perform handover based on the relevant information for accessing the target node and / or cell. This method can achieve seamless handover.

[0147] In some implementations, the first message may be included in one or more of the following:

[0148] A HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0149] In some implementations, the first message may include one or more of the following information and / or fields:

[0150] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message assigned by a message transmitting node.

[0151] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message assigned by a message receiving node.

[0152] ● Request ID: used to identify the request. The request ID is used to identify the request. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0153] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the requested relevant information for accessing the target node and / or cell.

[0154] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the requested relevant information for accessing the target node and / or cell. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0155] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the requested relevant information for accessing the target node and / or cell. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0156] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the requested relevant information for accessing the target node and / or cell. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0157] ● Requested information: used to represent information requested to be collected and / or generated and / or predicted and / or reported. The information may be relevant information for accessing the target node and / or cell. This information may include one or more of the following: Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc.

[0158] ● Collection and / or reporting configuration: used to represent a configuration for the requested collection and / or reporting. It may include one or more of the following:

[0159] ○ Collection and / or reporting type: it may include one or more of the following: single collection and / or reporting, periodic collection and / or reporting, on-demand collection and / or reporting, event-triggered collection and / or reporting, etc.

[0160] ○ Collection and / or reporting periodicity: a time spacing between two adjacent collections, and / or a collection interval corresponding to the collection, and / or a reporting time spacing corresponding to two adjacent reporting. This information may be present in case of periodic reporting. In an implementation, for example, if this information is present, it may implicitly indicate that the requested reporting type is periodic reporting.

[0161] ○ Registration request of the collection and / or reporting: it may include one or more of the following: start, stop, release, cancel, addition, update, etc. The "start" indicates that the message receiving node should initiate the requested collection and / or reporting, for example, initiate a corresponding requested collection and / or reporting based on the information in this message. The "stop" indicates that the message receiving node should stop all and / or part of the collection and / or reporting. The "release" indicates that the message receiving node should release the information corresponding to the request, for example, release the information corresponding to this message, or release the collected and / or reported information. The "cancel" indicates that the message receiving node cancels the current and / or subsequent collection and / or reporting. The "addition" indicates that the message receiving node adds a corresponding collection and / or reporting, for example, adds the requested collection and / or reporting corresponding to the information in this message. In some implementations, for example, the "addition" may also indicate to perform collection and / or reporting based on a request corresponding to the information in this message and / or a request corresponding to a request message received previously. For example, as for information not included in this request message, collection and / or reporting can be performed with reference to the corresponding request in a previously received request message. The "update" indicates that the message receiving node updates the corresponding collection and / or reporting according to the content in this message.

[0162] ○ Number of collections and / or reporting: it indicates the number of times of collections and / or reporting requested.

[0163] ○ Collection and / or reporting time: it indicates the time information corresponding to the requested collection and / or reporting. It may include one or more of the following: start time (point), end time (point), time interval, etc. The time may be a relative time or an absolute time.

[0164] ○ Trigger event corresponding to an event-triggered collection and / or reporting: when a trigger event corresponding to an event-triggered collection and / or reporting is met, collection and / or reporting is performed. The trigger event may include one or more of the following:

[0165] ■ The RRC state of the UE changes: for example, the RRC state changes from a RRC connected state to a RRC idle state and / or RRC inactive state. For example, the RRC state changes from a RRC idle state and / or RRC inactive state to a RRC connected state.

[0166] ■ Handover of the UE happens.

[0167] ■ The location of the reception corresponding to a TA value in a reception window meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TA value is at the edge of the reception window, the reception corresponding to the TA value is at the center of the reception window, the reception corresponding to the TA value is outside the reception window and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0168] ■ The reception corresponding to a TCI meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TCI fails, the reception success rate corresponding to the TCI changes, and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0169] In some implementations, after receiving the first message including a request for relevant information for accessing a target node and / or cell transmitted by the first node, the second node may transmit a second message including a response for relevant information for accessing the target node and / or cell to the first node, so as to inform the first node whether the second node can collect and / or generate and / or predict and / or report the relevant information.

[0170] In some implementations, the second message may be included in one or more of the following:

[0171] A HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message of Xn; a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0172] In some implementations, the second message may include one or more of the following information and / or fields:

[0173] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0174] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0175] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the first message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0176] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to relevant information for accessing the target node and / or cell that can (not) be collected and / or generated and / or predicted and / or reported.

[0177] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to relevant information for accessing the target node and / or cell that can (not) be collected and / or generated and / or predicted and / or reported. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0178] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to relevant information for accessing the target node and / or cell that can (not) be collected and / or generated and / or predicted and / or reported. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0179] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to relevant information for accessing the target node and / or cell that can (not) be collected and / or generated and / or predicted and / or reported. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0180] ● Information on whether relevant information for accessing the target node and / or cell can be collected and / or generated and / or predicted and / or reported: the relevant information for accessing the target node and / or cell may include the following One or more: Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc.

[0181] ● Relevant information for accessing a target node and / or cell that can (not) be collected and / or generated and / or predicted and / or reported: This information may include one or more of the following: Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc.

[0182] ● Collection and / or reporting configuration that can (not) be used for collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the first message.

[0183] In some implementations, the second node may transmit a third message including relevant information for accessing the target node and / or cell to the first node. It may also be that after the second node receives a first message including a request for relevant information for accessing a target node and / or cell transmitted by the first node, and / or after the second node transmits a second message including a response for relevant information for accessing the target node and / or cell to the first node (for example, after the second node transmits to the first node information about that the second node can collect and / or generate and / or predict and / or report the relevant information), the second node transmits a third message including relevant information for accessing the target node and / or cell to the first node.

[0184] The relevant information for accessing a target node and / or cell may be relevant information for accessing a cell managed by the first node, or may be relevant information for accessing a cell managed by the second node, or may be relevant information for accessing a cell managed by other nodes (for example, a target node corresponding to a subsequent handover).

[0185] In some implementations, for example, after receiving the message, the first node may use the information in the message to access the target node and / or the target cell. For example, the first node may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the first node may access the target node and / or cell at the handover time. For example, the first node may access the target node and / or target cell using the Timing Advance (TA) information at the handover time.

[0186] In yet other implementations, for example, after receiving the message, the first node may use the information in the message to decide a strategy for receiving UE uplink transmissions, for example, use the transmission configuration indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling.

[0187] In yet other implementations, for example, after receiving the message, the first node may include all and / or part of the information contained in the message into a handover command and / or a cell switch command and / or an RRC reconfiguration message and transmit the same to the UE. The UE may use the information to access the target node and / or cell. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover. In yet other implementations, for example, the first node may forward all and / or part of the information in the message to other nodes for the other nodes and / or UEs to perform seamless handover. This scheme can be applicable to any handover and / or mobility scenario.

[0188] In some implementations, the third message may be included in one or more of the following: a HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message or a HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message or a DATA COLLECTION UPDATE message or a RESOURCE STATUS UPDATE message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message or a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0189] In some implementations, the third message may include one or more of the following information and / or fields:

[0190] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0191] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0192] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the first message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0193] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the collected and / or generated and / or predicted and / or reported relevant information for accessing the target node and / or cell.

[0194] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the collected and / or generated and / or predicted and / or reported relevant information for accessing the target node and / or cell. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0195] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the collected and / or generated and / or predicted and / or reported relevant information for accessing the target node and / or cell. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0196] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the collected and / or generated and / or predicted and / or reported relevant information for accessing the target node and / or cell. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0197] ● Reported information : used to indicate the reported information. The information may be relevant information for accessing the target node and / or cell. The reported information may be collected and / or generated and / or predicted information. The information may include one or more of the following: target node ID and / or target cell ID, Timing Advance (TA), Transmission Configuration Indicator (TCI) state (ID), handover time, corresponding valid time, etc. The information may be information for one target node / target cell or an information list for multiple target nodes / target cells.

[0198] ● Collection and / or reporting configuration corresponding to the collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the first message.

[0199] In the present disclosure, one or more information and / or fields included in one message may correspond to or be combined with or associated with each other. For example, taking the third message as an example, the TA included in the third message may be a TA for the one or more UEs in the UE ID and / or ID list included in the third message to access the one or more cells in the cell ID and / or ID list or one or more nodes in the node ID and / or ID list included in the third message, etc. The TCI state (ID) included in the third message may be a TCI state (ID) for the one or more cells in the cell ID and / or ID list or one or more nodes in the node ID and / or ID list included in the third message, etc. The handover time included in the third message may be a handover time corresponding to the handover of the one or more UEs in the UE ID and / or ID list included in the third message to the one or more cells in the cell ID and / or ID list or one or more nodes in the node ID and / or ID list included in the third message, etc. Other messages or information have the similar explanation and will not be described again below.

[0200] Example 2

[0201] The present disclosure proposes a method for supporting mobility, which may include one or more of the following steps.

[0202] In some implementations, a third node may transmit a fourth message including a request for predicted and / or current data transmission state information to a fourth node to request the fourth node to collect and / or generate and / or predict and / or report the predicted and / or current data transmission state information. After obtaining the information, the third node may perform data transmission according to the predicted and / or current data transmission state information. Alternatively, after obtaining the information, the third node may forward the information to other nodes for the other nodes to perform data transmission.

[0203] In some implementations, the fourth message may be included in one or more of the following:

[0204] A HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP REQUEST message or a BEARER CONTEXT MODIFICATION REQUEST message or a BEARER CONTEXT MODIFICATION CONFIRM message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0205] In some implementations, the fourth message may include one or more of the following information and / or fields:

[0206] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message assigned by a message transmitting node.

[0207] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message assigned by a message receiving node.

[0208] ● Request ID: used to identify the request. The request ID is used to identify the request. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0209] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the requested data transmission state information.

[0210] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the requested data transmission state information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0211] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the requested data transmission state information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0212] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the requested data transmission state information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0213] ● Requested information: used to represent information requested to be collected and / or generated and / or predicted and / or reported. The information may be predicted and / or current data transmission state information. The data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, etc. The corresponding time information may refer to time information corresponding to one or more of the aforementioned, such as: the time when the data packets can be transmitted, the time when transmission of the data packets can be completed, the time when the data packets can be successfully transmitted, etc. One or more of the number of data packets that can be transmitted, the sequence numbers corresponding to the data packets that can be transmitted, and the time when the data packets can be transmitted may also be included in information related to data packets that can be transmitted. One or more of the number of data packets the transmission of which can be completed, sequence numbers corresponding to the data packets the transmission of which can be completed, and the time when transmission of the data packets can be completed may also be included in information related to data packets the transmission of which can be completed. One or more of the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be successfully transmitted, and the time when the data packets can be successfully transmitted may also be included in information related to data packets that can be successfully transmitted. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc. In some implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information of a node when the UE is connected to the node. In some other implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information corresponding to the data transmission performed by a connected (source) node with the UE before handover of the UE.

[0214] ● Collection and / or reporting configuration: used to represent a configuration for the requested collection and / or reporting. It may include one or more of the following:

[0215] ○ Collection and / or reporting type: it may include one or more of the following: single collection and / or reporting, periodic collection and / or reporting, on-demand collection and / or reporting, event-triggered collection and / or reporting, etc.

[0216] ○ Collection and / or reporting periodicity: a time spacing between two adjacent collections, and / or a collection interval corresponding to the collection, and / or a reporting time spacing corresponding to two adjacent reporting. This information may be present in case of periodic reporting. In an implementation, for example, if this information is present, it may implicitly indicate that the requested reporting type is periodic reporting.

[0217] ○ Registration request of the collection and / or reporting: it may include one or more of the following: start, stop, release, cancel, addition, update, etc. The "start" indicates that the message receiving node should initiate the requested collection and / or reporting, for example, initiate a corresponding requested collection and / or reporting based on the information in this message. The "stop" indicates that the message receiving node should stop all and / or part of the collection and / or reporting. The "release" indicates that the message receiving node should release the information corresponding to the request, for example, release the information corresponding to this message, or release the collected and / or reported information. The "cancel" indicates that the message receiving node cancels the current and / or subsequent collection and / or reporting. The "addition" indicates that the message receiving node adds a corresponding collection and / or reporting, for example, adds the requested collection and / or reporting corresponding to the information in this message. In some implementations, for example, the "addition" may also indicate to perform collection and / or reporting based on a request corresponding to the information in this message and / or a request corresponding to a request message received previously. For example, as for information not included in this request message, collection and / or reporting can be performed with reference to the corresponding request in a previously received request message. The "update" indicates that the message receiving node updates the corresponding collection and / or reporting according to the content in this message.

[0218] ○ Number of collections and / or reporting: it indicates the number of times of collections and / or reporting requested.

[0219] ○ Collection and / or reporting time: it indicates the time information corresponding to the requested collection and / or reporting. It may include one or more of the following: start time (point), end time (point), time interval, etc. The time may be a relative time or an absolute time.

[0220] ○ Trigger event corresponding to an event-triggered collection and / or reporting: when a trigger event corresponding to an event-triggered collection and / or reporting is met, collection and / or reporting is performed. The trigger event may include one or more of the following:

[0221] ■ The RRC state of the UE changes: for example, the RRC state changes from a RRC connected state to a RRC idle state and / or RRC inactive state. For example, the RRC state changes from a RRC idle state and / or RRC inactive state to a RRC connected state.

[0222] ■ Handover of the UE happens.

[0223] ■ The location of the reception corresponding to a TA value in a reception window meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TA value is at the edge of the reception window, the reception corresponding to the TA value is at the center of the reception window, the reception corresponding to the TA value is outside the reception window and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0224] ■ The reception corresponding to a TCI meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TCI fails, the reception success rate corresponding to the TCI changes, and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0225] ■ Data transmission state changes.

[0226] In some implementations, after receiving the fourth message including a request for predicted and / or current data transmission state information transmitted by the third node, the fourth node may transmit a fifth message including a response for predicted and / or current data transmission state information to the third node, to inform the third node whether the fourth node can collect and / or generate and / or predict and / or report the predicted and / or current data transmission state.

[0227] In some implementations, the fifth message may be included in one or more of the following:

[0228] A HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message of Xn; a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP RESPONSE message or a BEARER CONTEXT MODIFICATION RESPONSE message or a BEARER CONTEXT MODIFICATION REQUIRED message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0229] In some implementations, the fifth message may include one or more of the following information and / or fields:

[0230] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0231] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0232] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the fourth message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0233] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the predicted and / or current data transmission state information that can (not) be collected and / or generated and / or predicted and / or reported.

[0234] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to predicted and / or current data transmission state information that can (not) be collected and / or generated and / or predicted and / or reported. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0235] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the predicted and / or current data transmission state information that can (not) be collected and / or generated and / or predicted and / or reported. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0236] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the predicted and / or current data transmission state information that can (not) be collected and / or generated and / or predicted and / or reported. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0237] ● Information on whether predicted and / or current data transmission state information can be collected and / or generated and / or predicted and / or reported: the predicted and / or current data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc. In some implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information of a node when the UE is connected to the node. In some other implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information corresponding to the data transmission performed by a connected (source) node with the UE before handover of the UE.

[0238] ● Predicted and / or current data transmission state information that can (not) be collected and / or generated and / or predicted and / or reported: the data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc. In some implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information of a node when the UE is connected to the node. In some other implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information corresponding to the data transmission performed by a connected (source) node with the UE before handover of the UE.

[0239] ● Collection and / or reporting configuration that can (not) be used for collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the seventh message.

[0240] In some implementations, the fourth node may transmit a sixth message including predicted and / or current data transmission state information to the third node. It may also be that after the fourth node receives a fourth message including a request for predicted and / or current data transmission state information transmitted by the third node, and / or after the fourth node transmits a fifth message including a response for predicted and / or current data transmission state information to the third node (for example, after the fourth node transmits to the third node information about that the fourth node can collect and / or generate and / or predict and / or report the predicted and / or current data transmission state information), the fourth node transmits a sixth message including the predicted and / or current data transmission state information to the third node.

[0241] In some implementations, for example, after receiving the message, the third node may use the information in the message for data transmission. In yet other implementations, for example, after receiving the message, the third node may forward all and / or part of the information in the message to other nodes for the other nodes to perform data transmission. This scheme can achieve fast data transmission and reduce latency of data transmission. For example, during a handover process, the core network node and / or the UE can accurately perform data transmission to the source node and / or the target node to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0242] The predicted and / or current data transmission state information may be predicted and / or current data transmission state information corresponding to the fourth node, or predicted and / or current data transmission state information corresponding to the third node, or predicted and / or current data transmission state information corresponding to other nodes.

[0243] In some implementations, the sixth message may be included in one or more of the following: a HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message or a HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message or a DATA COLLECTION UPDATE message or a RESOURCE STATUS UPDATE message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message or a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP RESPONSE message or a BEARER CONTEXT MODIFICATION RESPONSE message or a BEARER CONTEXT MODIFICATION REQUIRED message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0244] In some implementations, the sixth message may include one or more of the following information and / or fields:

[0245] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0246] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0247] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the fourth message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0248] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the collected and / or generated and / or predicted and / or reported predicted and / or current data transmission state information.

[0249] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the collected and / or generated and / or predicted and / or reported predicted and / or current data transmission state information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0250] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the collected and / or generated and / or predicted and / or reported predicted and / or current data transmission state information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0251] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the collected and / or generated and / or predicted and / or reported predicted and / or current data transmission state information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0252] ● Reported information: used to indicate the reported information. The information may be predicted and / or current data transmission state information. The data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc. In some implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information of a node when the UE is connected to the node. In some other implementations, for example, the predicted and / or current data transmission state information may be the predicted and / or current data transmission state information corresponding to the data transmission performed by a connected (source) node with the UE before handover of the UE.

[0253] ● Collection and / or reporting configuration corresponding to the collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the fourth message.

[0254] Example 3

[0255] The present disclosure proposes a method for supporting mobility, which may include one or more of the following steps.

[0256] In some implementations, the fifth node may transmit a seventh message including a mobility information request to the sixth node to request the sixth node to collect and / or report mobility information. After obtaining the mobility information, the fifth node may make mobility decisions and / or generate mobility-related information. For example, the obtained mobility information may be used for training and / or fine-tuning and / or inferring and / or evaluation of a model, which may be used for generating mobility decisions and / or generating mobility and / or handover related information. The mobility and / or handover related information includes, but is not limited to: (predicted) timing advance information, (predicted) transmission configuration indicator (TCI) state (ID), (predicted) handover time, (predicted) handover target node and / or target cell, (predicted) measurement results, (predicted) handover events, and other handover-related information. The measurement results may include one or more of the following: Layer 1 measurement results, Layer 3 measurement results, etc. The handover events may include one or more of the following: handover successes, handover fails, radio link failure occurs, handover successes but radio link failure occurs soon (e.g., within a first time after the handover successes), etc. This scheme is beneficial to improving handover robustness and handover success rate. This scheme can reduce handover latency. For example, this scheme is conducive to achieving seamless handover. Specific information about how to achieve the above effects may refer to Example 1.

[0257] In some implementations, the seventh message may be included in one or more of the following:

[0258] A HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc. In some implementations, the seventh message may include one or more of the following information and / or fields:

[0259] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message assigned by a message transmitting node.

[0260] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message assigned by a message receiving node.

[0261] ● Request ID: used to identify the request. The request ID is used to identify the request. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0262] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the requested mobility information.

[0263] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the requested mobility information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0264] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the requested mobility information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0265] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the requested mobility information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0266] ● Collection and / or reporting configuration: used to represent a configuration for the requested collection and / or reporting. It may include one or more of the following:

[0267] ○ Collection and / or reporting type: it may include one or more of the following: single collection and / or reporting, periodic collection and / or reporting, on-demand collection and / or reporting, event-triggered collection and / or reporting, etc.

[0268] ○ Collection and / or reporting periodicity: a time spacing between two adjacent collections, and / or a collection interval corresponding to the collection, and / or a reporting time spacing corresponding to two adjacent reporting. This information may be present in case of periodic reporting. In an implementation, for example, if this information is present, it may implicitly indicate that the requested reporting type is periodic reporting.

[0269] ○ Registration request of the collection and / or reporting: it may include one or more of the following: start, stop, release, cancel, addition, update, etc. The "start" indicates that the message receiving node should initiate the requested collection and / or reporting, for example, initiate a corresponding requested collection and / or reporting based on the information in this message. The "stop" indicates that the message receiving node should stop all and / or part of the collection and / or reporting. The "release" indicates that the message receiving node should release the information corresponding to the request, for example, release the information corresponding to this message, or release the collected and / or reported information. The "cancel" indicates that the message receiving node cancels the current and / or subsequent collection and / or reporting. The "addition" indicates that the message receiving node adds a corresponding collection and / or reporting, for example, adds the requested collection and / or reporting corresponding to the information in this message. In some implementations, for example, the "addition" may also indicate to perform collection and / or reporting based on a request corresponding to the information in this message and / or a request corresponding to a request message received previously. For example, as for information not included in this request message, collection and / or reporting can be performed with reference to the corresponding request in a previously received request message. The "update" indicates that the message receiving node updates the corresponding collection and / or reporting according to the content in this message.

[0270] ○ Number of collections and / or reporting: it indicates the number of times of collections and / or reporting requested.

[0271] ○ Collection and / or reporting time: it indicates the time information corresponding to the requested collection and / or reporting. It may include one or more of the following: start time (point), end time (point), time interval, etc. The time may be a relative time or an absolute time.

[0272] ○ Trigger event corresponding to an event-triggered collection and / or reporting: when a trigger event corresponding to an event-triggered collection and / or reporting is met, collection and / or reporting is performed. The trigger event may include one or more of the following:

[0273] ■ The RRC state of the UE changes: for example, the RRC state changes from a RRC connected state to a RRC idle state and / or RRC inactive state. For example, the RRC state changes from a RRC idle state and / or RRC inactive state to a RRC connected state.

[0274] ■ Handover of the UE happens.

[0275] ■ The location of the reception corresponding to a TA value in a reception window meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TA value is at the edge of the reception window, the reception corresponding to the TA value is at the center of the reception window, the reception corresponding to the TA value is outside the reception window and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0276] ■ The reception corresponding to a TCI meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TCI fails, the reception success rate corresponding to the TCI changes, and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0277] ● Requested information: used to indicate the information requested to be collected and / or reported. The information may be mobility information. The information may include one or more of the following: measurement results, movement speed, location information, camped and / or visited cell (ID), trajectory information, trajectory prediction information, handover target cell (ID), frequency information of a source cell, frequency information of a target cell, Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc. The trajectory information may be a trajectory composed of one or more location information. The location information may include one or more of the following: coordinate information, camped and / or visited cell (ID), camped and / or visited beam (ID), corresponding time information, etc. The time information may include one or more of the following: a time point, a time period, a camping and / or visiting time, a time to enter the location, a time to leave the location, etc.

[0278] In some implementations, after receiving the seventh message including a mobility information request transmitted by the fifth node, the sixth node may transmit an eighth message including a mobility information response to the fifth node, to inform the fifth node whether the sixth node can collect and / or report the mobility information.

[0279] In some implementations, the eighth message may be included in one or more of the following:

[0280] A HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message of Xn; a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0281] In some implementations, the eighth message may include one or more of the following information and / or fields:

[0282] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0283] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0284] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the seventh message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0285] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the mobility information that can (not) be collected and / or reported.

[0286] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the mobility information that can (not) be collected and / or reported. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0287] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the mobility information that can (not) be collected and / or reported. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0288] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the mobility information that can (not) be collected and / or reported. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0289] ● Information about whether mobility information can be collected and / or reported: the mobility information may include one or more of the following: measurement results, movement speed, location information, camped and / or visited cell (ID), trajectory information, trajectory prediction information, handover target cell (ID), frequency information of a source cell, frequency information of a target cell, Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc. The trajectory information may be a trajectory composed of one or more location information.

[0290] ● Collection and / or reporting configuration that can (not) be used for collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the seventh message.

[0291] ● Mobility information that can (not) be collected and / or reported: the mobility information may include one or more of the following: measurement results, movement speed, location information, camped and / or visited cell (ID), trajectory information, trajectory prediction information, handover target cell (ID), frequency information of a source cell, frequency information of a target cell, Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc. The trajectory information may be a trajectory composed of one or more location information.

[0292] In some implementations, the sixth node may transmit a ninth message including mobility information to the fifth node. It may also be that after the sixth node receives the seventh message including a mobility information request transmitted by the fifth node, and / or after the sixth node transmits the eighth message including a mobility information response to the fifth node (for example, after the sixth node transmits to the fifth node information about that the sixth node can collect and / or report mobility information), the sixth node may transmit a ninth message including mobility information to the fifth node. After obtaining the mobility information, the fifth node may make mobility decisions and / or generate mobility-related information. For example, the obtained mobility information may be used for training and / or fine-tuning of a model, which may be used for generating mobility decisions and / or generating mobility and / or handover related information. The mobility and / or handover related information includes, but is not limited to: (predicted) timing advance information, (predicted) transmission configuration indicator (TCI) state (ID), (predicted) handover time, (predicted) handover target node and / or target cell, (predicted) measurement results, (predicted) handover events, and other handover-related information. The measurement results may include one or more of the following: Layer 1 measurement results, Layer 3 measurement results, etc. The handover events may include one or more of the following: handover successes, handover fails, radio link failure occurs, handover successes but radio link failure occurs soon (e.g., within a first time after the handover successes), etc. This scheme is beneficial to improving handover robustness and handover success rate. This scheme can reduce handover latency. For example, this scheme is conducive to achieving seamless handover. Specific information about how to achieve the above effects may refer to Example 1.

[0293] In some implementations, the ninth message may be included in one or more of the following: a HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message or a HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message or a DATA COLLECTION UPDATE message or a RESOURCE STATUS UPDATE message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message or a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0294] In some implementations, the ninth message may include one or more of the following information and / or fields:

[0295] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0296] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0297] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the seventh message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0298] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the collected and / or reported mobility information.

[0299] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the collected and / or reported mobility information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0300] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the collected and / or reported mobility information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0301] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the collected and / or reported mobility information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0302] ● Reported information: used to indicate the reported information. The information may be mobility information. The information may include one or more of the following: measurement results, movement speed, location information, camped and / or visited cell (ID), trajectory information, trajectory prediction information, handover target cell (ID), frequency information of a source cell, frequency information of a target cell, Timing Advance (TA), Transmission Configuration Indicator (TCI) (ID), switching time / handover time, corresponding valid time, etc. The trajectory information may be a trajectory composed of one or more location information. The location information may include one or more of the following: coordinate information, camped and / or visited cell (ID), camped and / or visited beam (ID), corresponding time information, etc. The time information may include one or more of the following: a time point, a time period, a camping and / or visiting time, a time to enter the location, a time to leave the location, etc.

[0303] ● Collection and / or reporting configuration corresponding to the collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the seventh message.

[0304] Example 4

[0305] The present disclosure proposes a method for supporting mobility, which may include one or more of the following steps.

[0306] In some implementations, a seventh node may transmit a tenth message including a request for history data transmission state information to an eighth node to request the eighth node to collect and / or report history data transmission state information. After obtaining the history data transmission state information, the seventh node may make data transmission decisions and / or generate data transmission-related auxiliary information (for example, predicted data transmission state, etc.). For example, the obtained data transmission state information may be used for training and / or fine-tuning and / or inferring and / or evaluation of a model, which be used for generating data transmission decisions and / or generating data transmission-related auxiliary information. The scheme can realize fast data transmission and reduce the latency of data transmission. For example, during a handover process, the core network node and / or the UE can accurately perform data transmission to the source node and / or the target node to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc. Specific information about how to achieve the above effects may refer to Example 2.

[0307] In the present disclosure, the history data transmission state information may be data transmission state information corresponding to data transmission that has occurred, etc. The history data transmission state information may also be called actual data transmission state information. The history data transmission state information may also be referred to as measured data transmission state information.

[0308] In some implementations, the tenth message may be included in one or more of the following:

[0309] A HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP REQUEST message or a BEARER CONTEXT MODIFICATION REQUEST message or a BEARER CONTEXT MODIFICATION CONFIRM message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0310] In some implementations, the tenth message may include one or more of the following information and / or fields:

[0311] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message assigned by a message transmitting node.

[0312] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message assigned by a message receiving node.

[0313] ● Request ID: used to identify the request. The request ID is used to identify the request. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0314] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the requested history data transmission state information.

[0315] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the requested history data transmission state information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0316] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the requested history data transmission state information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0317] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the requested history data transmission state information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0318] ● Requested information: used to indicate the information requested to be collected and / or reported. The information may be history data transmission state information. The data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, the corresponding mobility information, the corresponding measurement results, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc.

[0319] ● Collection and / or reporting configuration: used to represent a configuration for the requested collection and / or reporting. It may include one or more of the following:

[0320] ○ Collection and / or reporting type: it may include one or more of the following: single collection and / or reporting, periodic collection and / or reporting, on-demand collection and / or reporting, event-triggered collection and / or reporting, etc.

[0321] ○ Collection and / or reporting periodicity: a time spacing between two adjacent collections, and / or a collection interval corresponding to the collection, and / or a reporting time spacing corresponding to two adjacent reporting. This information may be present in case of periodic reporting. In an implementation, for example, if this information is present, it may implicitly indicate that the requested reporting type is periodic reporting.

[0322] ○ Registration request of the collection and / or reporting: it may include one or more of the following: start, stop, release, cancel, addition, update, etc. The "start" indicates that the message receiving node should initiate the requested collection and / or reporting, for example, initiate a corresponding requested collection and / or reporting based on the information in this message. The "stop" indicates that the message receiving node should stop all and / or part of the collection and / or reporting. The "release" indicates that the message receiving node should release the information corresponding to the request, for example, release the information corresponding to this message, or release the collected and / or reported information. The "cancel" indicates that the message receiving node cancels the current and / or subsequent collection and / or reporting. The "addition" indicates that the message receiving node adds a corresponding collection and / or reporting, for example, adds the requested collection and / or reporting corresponding to the information in this message. In some implementations, for example, the "addition" may also indicate to perform collection and / or reporting based on a request corresponding to the information in this message and / or a request corresponding to a request message received previously. For example, as for information not included in this request message, collection and / or reporting can be performed with reference to the corresponding request in a previously received request message. The "update" indicates that the message receiving node updates the corresponding collection and / or reporting according to the content in this message.

[0323] ○ Number of collections and / or reporting: it indicates the number of times of collections and / or reporting requested.

[0324] ○ Collection and / or reporting time: it indicates the time information corresponding to the requested collection and / or reporting. It may include one or more of the following: start time (point), end time (point), time interval, etc. The time may be a relative time or an absolute time.

[0325] ○ Trigger event corresponding to an event-triggered collection and / or reporting: when a trigger event corresponding to an event-triggered collection and / or reporting is met, collection and / or reporting is performed. The trigger event may include one or more of the following:

[0326] ■ The RRC state of the UE changes: for example, the RRC state changes from a RRC connected state to a RRC idle state and / or RRC inactive state. For example, the RRC state changes from a RRC idle state and / or RRC inactive state to a RRC connected state.

[0327] ■ Handover of the UE happens.

[0328] ■ The location of the reception corresponding to a TA value in a reception window meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TA value is at the edge of the reception window, the reception corresponding to the TA value is at the center of the reception window, the reception corresponding to the TA value is outside the reception window and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0329] ■ The reception corresponding to a TCI meets a certain condition, which, for example, may include one or more of the following: the reception corresponding to the TCI fails, the reception success rate corresponding to the TCI changes, and the node performs reconfiguration, etc. Herein, that the node performs reconfiguration may include performing beam re-forming, etc.

[0330] ■ Data transmission state changes.

[0331] In some implementations, after receiving the tenth message including a request for history data transmission state information transmitted by the seventh node, the eighth node may transmit an eleventh message including a response for history data transmission state information to the seventh node, to inform the seventh node whether the eighth node can collect and / or report history data transmission state.

[0332] In some implementations, the tenth message may be included in one or more of the following:

[0333] A HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message of Xn; a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a HANDOVER COMMAND message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP RESPONSE message or a BEARER CONTEXT MODIFICATION RESPONSE message or a BEARER CONTEXT MODIFICATION REQUIRED message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0334] In some implementations, the eleventh message may include one or more of the following information and / or fields:

[0335] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0336] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0337] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the fourth message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0338] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the history data transmission state information that can (not) be collected and / or reported.

[0339] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the history data transmission state information that can (not) be collected and / or reported. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0340] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to history data transmission state information that can (not) be collected and / or reported. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0341] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the history data transmission state information that can (not) be collected and / or reported. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0342] ● Information about whether history data transmission state information can be collected and / or reported: the data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc.

[0343] ● History data transmission state information that can (not) be collected and / or reported: the data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, the corresponding mobility information, the corresponding measurement results, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc.

[0344] ● Collection and / or reporting configuration that can (not) be used for collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the tenth message.

[0345] In some implementations, the eighth node may transmit a twelfth message including history data transmission state information to the seventh node. It may also be that after the eighth node receives the tenth message including a request for history data transmission state information transmitted by the seventh node, and / or after the eighth node transmits an eleventh message including a response for history data transmission state information to the seventh node (for example, after the eighth node transmits information to the seventh node about that the eighth node can collect and / or report the history data transmission state information), the eighth node may transmit a twelfth message including the data transmission state information to the seventh node. After obtaining the history data transmission state information, the seventh node may make data transmission decisions and / or generate data transmission-related auxiliary information (for example, predicted data transmission state, etc.). For example, the obtained data transmission state information may be used for training and / or fine-tuning and / or inferring and / or evaluation of a model, which be used for generating data transmission decisions and / or generating data transmission-related auxiliary information. The scheme can realize fast data transmission and reduce the latency of data transmission. For example, during a handover process, the core network node and / or the UE accurately performs data transmission to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc. Specific information about how to achieve the above effects may refer to Example 2.

[0346] In some implementations, the twelfth message may be included in one or more of the following: a HANDOVER REQUEST message or a DATA COLLECTION REQUEST message or a RESOURCE STATUS REQUEST message or a HANDOVER REQUEST ACKNOWLEDGE message or a DATA COLLECTION RESPONSE message or a DATA COLLECTION FAILURE message or a RESOURCE STATUS RESPONSE message or a RESOURCE STATUS FAILURE message or a DATA COLLECTION UPDATE message or a RESOURCE STATUS UPDATE message of Xn; a UE CONTEXT SETUP REQUEST message or a UE CONTEXT MODIFICATION REQUEST message or a UE CONTEXT SETUP RESPONSE message or a UE CONTEXT MODIFICATION REQUEST message of F1; a HANDOVER REQUIRED message or a HANDOVER REQUEST message or a HANDOVER COMMAND message or a HANDOVER REQUEST ACKNOWLEDGE message or a PATH SWITCH REQUEST message or a PATH SWITCH REQUEST ACKNOWLEDGE message of NG; a BEARER CONTEXT SETUP RESPONSE message or a BEARER CONTEXT MODIFICATION RESPONSE message or a BEARER CONTEXT MODIFICATION REQUIRED message of E1; or an other and / or newly defined RRC and / or Xn and / or X2 and / or F1 and / or E1 and / or NG message and / or RRC container and / or MAC CE; or a message between AMF and UPF, etc.

[0347] In some implementations, the twelfth message may include one or more of the following information and / or fields:

[0348] ● Transmitting node identifier (ID): used to identify the node that transmits the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message transmitting node.

[0349] ● Receiving node identifier (ID): used to identify the node that receives the message. It may also be an identifier of the request and / or the request message corresponding to this confirmation / response assigned by a message receiving node.

[0350] ● Request ID: used to identify the request. This ID may be consistent with the request ID in the tenth message to match the response message with the request message. The request ID may also be referred to as one or more of the following: transaction ID, measurement ID, collection ID, etc.

[0351] ● UE ID and / or ID list: used to identify the UE and / or UE list corresponding to the reported history data transmission state information.

[0352] ● Beam ID and / or ID list: used to identify the beam and / or beam list corresponding to the reported history data transmission state information. The beam may be a beam of a source cell, a beam of a target cell, a beam of a neighboring cell, a beam of a cell managed by a message transmitting node, a beam of a cell managed by a message receiving node, or a beam of any other cell.

[0353] ● Cell ID and / or ID list: used to identify the cell and / or cell list corresponding to the reported history data transmission state information. The cell may be a source cell, a target cell, a neighboring cell, a cell managed by a message transmitting node, a cell managed by a message receiving node, or any other cell.

[0354] ● Node ID and / or ID list: used to identify the node and / or node list corresponding to the reported history data transmission state information. The node may be a source node, a target node, a neighboring node (also called a node where a neighboring cell is located), or any other node.

[0355] ● Reported information: used to indicate the reported information. The information may be data transmission state information. The data transmission state information may include one or more of the following: the number of data packets that can be transmitted, the number of data packets the transmission of which can be completed, the number of data packets that can be successfully transmitted, sequence numbers corresponding to the data packets that can be transmitted, sequence numbers corresponding to the data packets the transmission of which can be completed, sequence numbers corresponding to the data packets that can be successfully transmitted, the corresponding time information, the corresponding mobility information, the corresponding measurement results, etc. The sequence number may include one or more of the following: a New Radio-Unlicensed (NR-U) sequence number, a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) sequence number, a Radio Link Control (RLC) sequence number, etc.

[0356] ● Collection and / or reporting configuration corresponding to the collection and / or reporting: the specific information or content of the configuration may refer to the collection and / or reporting configuration in the tenth message.

[0357] Exemplary embodiments of the present disclosure are further described below with reference to the accompanying drawings.

[0358] The text and drawings are provided as examples only to help understand the present disclosure. They should not be construed as limiting the scope of the present disclosure in any way. Although certain embodiments and examples have been provided, based on the disclosure herein, it is obvious to those skilled in the art that changes can be made to the illustrated embodiments and examples without departing from the scope of the present disclosure.

[0359] FIG. 3A shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 3A shows a process of exchanging relevant information for accessing a target node and / or cell between two nodes.

[0360] In some implementations, for example, the first node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB, and the second node may be a UE. In some implementations, for example, the first node may be a UE, and the second node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In some other implementations, for example, the first node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the second node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the first node may be an AMF or SMF or MME, and the second node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the first node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the second node may be an AMF or SMF or MME. It may also be, for example, that the first node is a master node and the second node is a secondary node; for example, the first node is a secondary node and the second node is a master node; for example, the first node is a source node and the second node is a target node; for example, the first node is a target node and the second node is a source node.

[0361] Step 301A: optionally, the first node transmits a request for relevant information for accessing a target node and / or cell to the second node. The request is for requesting the second node to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. The request for relevant information for accessing a target node and / or cell may be the aforementioned first message.

[0362] Step 302A: optionally, the second node transmits a response for relevant information for accessing the target node and / or cell to the first node. The response may be used to inform the first node whether the second node is capable of collecting and / or generating and / or predicting and / or reporting all and / or part of the requested relevant information for accessing the target node and / or cell (as requested). The response for relevant information for accessing the target node and / or cell may be the aforementioned second message.

[0363] Step 303A: the second node collects and / or generates and / or predicts all and / or part of the relevant information for accessing the target node and / or cell. In some implementations, for example, the second node may perform collection and / or generation and / or prediction based on the request for relevant information for accessing a target node and / or cell in step 301A. In some implementations, for example, the generation and / or prediction of the relevant information for accessing a target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or by mathematical algorithms, etc.

[0364] Step 304A: the second node transmits relevant information for accessing the target node and / or cell to the first node. The relevant information for accessing the target node and / or cell may be the aforementioned third message. In some implementations, for example, after receiving the message, the first node may use the information in the message to access the target node and / or the target cell. For example, the first node may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the first node may access the target node and / or cell at the handover time. For example, the first node may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after receiving the message, the first node may use the information in the message to decide a strategy for receiving UE uplink transmissions, for example, use the transmission configuration indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. In yet other implementations, for example, after receiving the message, the first node may include all and / or part of the information contained in the message into a handover command and / or a cell switch command and / or an RRC reconfiguration message and transmit the same to the UE. The UE may use the information to access the target node and / or cell. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover. In yet other implementations, for example, the first node may forward all and / or part of the information in the message to other nodes for the other nodes and / or UEs to perform seamless handover.

[0365] FIG. 3B shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 3B shows a process of exchanging relevant information for accessing a target node and / or cell between nodes.

[0366] Step 301B: the UE transmits a measurement report to the source node and / or source node CU.

[0367] Step 302B: the source node and / or source node CU transmits a request for relevant information for accessing a target node and / or cell to the target node and / or target node CU. The request is used to request the target node and / or target node CU and / or target node DU to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. The request for relevant information for accessing a target node and / or cell may be the aforementioned first message. The request for relevant information for accessing a target node and / or cell may be carried by a handover request message.

[0368] Step 303B: the target node CU transmits a request for the relevant information for accessing the target node and / or cell to the target node DU. The request is used to request the target node DU to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. The request for relevant information for accessing a target node and / or cell may be the aforementioned first message. The request for relevant information for accessing a target node and / or cell may be carried by a UE context setup request message.

[0369] Step 304B: the target node DU performs collection and / or generation and / or prediction of relevant information for accessing the target node and / or cell. In some implementations, for example, the target node DU may perform collection and / or generation and / or prediction based on the request for relevant information for accessing a target node and / or cell in step 303B. In some implementations, for example, the generation and / or prediction of the relevant information for accessing a target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or by mathematical algorithms, etc.

[0370] Step 305B: the target node DU transmits relevant information for accessing the target node and / or cell to the target node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a UE context setup response message.

[0371] Step 306B: the target node and / or target node CU transmits relevant information for accessing the target node and / or cell to the source node and / or source node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request acknowledge message.

[0372] Step 307B: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0373] Step 308B: the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0374] Step 309B: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0375] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0376] FIG. 3C shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 3C shows a process of exchanging relevant information for accessing a target node and / or cell between nodes.

[0377] Step 301C: the UE transmits a measurement report to the source node and / or source node CU.

[0378] Step 302C: the source node and / or source node CU transmits a request for relevant information for accessing a target node and / or cell to the target node and / or target node CU. The request is used to request the target node and / or target node CU and / or target node DU to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. The request for relevant information for accessing a target node and / or cell may be the aforementioned first message. The request for relevant information for accessing a target node and / or cell may be carried by a handover request message.

[0379] Step 303C: the target node and / or target node CU performs collection and / or generation and / or prediction of relevant information for accessing the target node and / or cell. In some implementations, for example, the target node CU may perform collection and / or generation and / or prediction based on the request for relevant information for accessing a target node and / or cell in step 302C. In some implementations, for example, the generation and / or prediction of the relevant information for accessing a target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or by mathematical algorithms, etc.

[0380] Step 304C: the target node CU transmits relevant information for accessing the target node and / or cell to the target node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a UE context setup request message.

[0381] Step 305C: the target node DU transmits a UE context setup response message to the target node CU.

[0382] Step 306C: the target node and / or target node CU transmits relevant information for accessing the target node and / or cell to the source node and / or source node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request acknowledge message.

[0383] Step 307C: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0384] Step 308C: the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0385] Step 309C: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0386] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0387] FIG. 3D shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 3D shows a process of exchanging relevant information for accessing a target node and / or cell between nodes.

[0388] Step 301D: the UE transmits a measurement report to the source node and / or source node CU.

[0389] Step 302D: the source node and / or source node CU performs collection and / or generation and / or prediction of relevant information for accessing the target node and / or cell. In some implementations, for example, the generation and / or prediction of the relevant information for accessing a target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or by mathematical algorithms, etc.

[0390] Step 303D: the source node and / or source node CU transmits relevant information for accessing the target node and / or cell to the target node and / or target node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request message.

[0391] Step 304D: the target node CU transmits relevant information for accessing the target node and / or cell to the target node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a UE context setup request message.

[0392] Step 305D: the target node DU transmits a UE context setup response message to the target node CU.

[0393] Step 306D: the target node and / or target node CU transmits a handover request acknowledge message to the source node and / or source node CU.

[0394] Step 307D: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0395] Step 308D: the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0396] Step 309D: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0397] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0398] FIG. 3E shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 3E shows a process of exchanging relevant information for accessing a target node and / or cell between nodes.

[0399] Step 301E: the UE transmits a measurement report to the source node and / or source node CU.

[0400] Step 302E: the source node CU transmits a request for relevant information for accessing a target node and / or cell to the source node DU. The request is used to request the source node DU to collect and / or generate and / or predict and / or report relevant information for accessing the target node and / or cell. The request for relevant information for accessing a target node and / or cell may be the aforementioned first message. The request for relevant information for accessing a target node and / or cell may be carried by a UE context modification request message.

[0401] Step 303E: the source node DU performs collection and / or generation and / or prediction of relevant information for accessing the target node and / or cell. In some implementations, for example, the source node DU may perform collection and / or generation and / or prediction based on the request for relevant information for accessing a target node and / or cell in step 302E. In some implementations, for example, the generation and / or prediction of the relevant information for accessing a target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or by mathematical algorithms, etc.

[0402] Step 304E: the source node DU transmits relevant information for accessing the target node and / or cell to the source node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a UE context modification response message.

[0403] Step 305E: the source node and / or source node CU transmits relevant information for accessing the target node and / or cell to the target node and / or target node CU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request message.

[0404] Step 306E: the target node CU transmits relevant information for accessing the target node and / or cell to the target node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a UE context setup request message.

[0405] Step 307E: the target node DU transmits a UE context setup response message to the target node CU.

[0406] Step 308E: the target node and / or target node CU transmits a handover request acknowledge message to the source node and / or source node CU.

[0407] Step 309E: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0408] Step 310E: the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0409] Step 312E: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0410] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0411] FIG. 4A shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4A shows a process of exchanging predicted and / or current data transmission state information between two nodes.

[0412] In some implementations, for example, the third node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB, and the fourth node may be a UE. In some implementations, for example, the third node may be a UE, and the fourth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In some other implementations, for example, the third node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the fourth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the third node may be an AMF or SMF or MME, and the fourth node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the third node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the fourth node may be an AMF or SMF or MME. It may also be, for example, that the third node is a master node and the fourth node is a secondary node; for example, the third node is a secondary node and the fourth node is a master node; for example, the third node is a source node and the fourth node is a target node; for example, the third node is a target node and the fourth node is a source node.

[0413] Step 401A: optionally, the third node transmits a request for predicted and / or current data transmission state information to the fourth node. The request is for requesting the fourth node to collect and / or generate and / or predict and / or report predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message.

[0414] Step 402A: optionally, the fourth node transmits a response for predicted and / or current data transmission state information to the third node. The response may be used to inform the third node whether the fourth node is capable of collecting and / or generating and / or predicting and / or reporting all and / or part of the requested predicted and / or current data transmission state (as requested). The response for predicted and / or current data transmission state information may be the aforementioned fifth message.

[0415] Step 403A: the fourth node collects and / or generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the fourth node may perform collection and / or generation and / or prediction based on the request for predicted and / or current data transmission state information in step 401A. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0416] Step 404A: the fourth node transmits predicted and / or current data transmission state information to the third node. The predicted and / or current data transmission state information may be the aforementioned sixth message. In some implementations, for example, after receiving the message, the third node may use the information in the message for data transmission. In yet other implementations, for example, after receiving the message, the third node may forward all and / or part of the information in the message to other nodes for the other nodes to perform data transmission. This scheme can achieve fast data transmission and reduce latency of data transmission. For example, during a handover process, the core network node and / or the UE can accurately perform data transmission to the source node and / or the target node to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0417] FIG. 4Ba-4Bc shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4Ba-4Bc shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0418] Step 401B: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0419] Step 402B: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0420] Step 403B: the source node and / or source node CU-CP transmits to the target node and / or target node CU-CP a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the target node and / or target node DU to collect and / or generate and / or predict the predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell may be carried by a handover request message.

[0421] Step 404B: the target node CU-CP transmits to the target node DU a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the target node and / or target node DU to collect and / or generate and / or predict the predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell may be carried by a UE context setup request message.

[0422] Step 405B: the target node DU collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the collection and / or generation and / or prediction may be performed according to the request for predicted and / or current data transmission state information in step 404B. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0423] Step 406B: the target node DU transmits predicted and / or current data transmission state information to the target node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a UE context setup response message.

[0424] Step 407B: the target node CU-CP transmits predicted and / or current data transmission state information to the target node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a bearer context setup request message.

[0425] Step 408B: the target node CU-UP transmits a bearer context setup response message to the target node CU-CP.

[0426] Step 409B: optionally, the target node and / or target node CU-CP transmits predicted and / or current data transmission state information to the source node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a handover request acknowledge message. The predicted and / or current data transmission state information may be used to inform the source node and / or source node CU-CP and / or source node CU-UP of data state information and / or data transmission scheme. For example, when the source node and / or source node CU-CP and / or source node CU-UP cannot perform data transmission according to the predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node and / or source node CU-CP and / or source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node and / or source node CU-CP and / or source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-CP and / or target node CU-UP. Thereby, the target node and / or target node CU-CP and / or target node CU-UP transmits the data which is not transmitted by the source node and / or source node CU-CP and / or source node CU-UP to the UE.

[0427] Step 410B: the source node CU-CP and the source node DU perform a UE context modification process.

[0428] Step 411B: optionally, the source node CU-CP transmits predicted and / or current data transmission state information to the source node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a bearer context modification message. The predicted and / or current data transmission state information may be used to inform the source node CU-UP of data state information and / or data transmission scheme. For example, when the source node CU-UP cannot perform data transmission according to the predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-UP. Thereby, the target node and / or target node CU-UP transmits data which is not transmitted by the source node and / or source node CU-UP to the UE.

[0429] Step 412B: the source node CU-UP transmits a bearer context modification response message to the source node CU-CP.

[0430] Step 413B: optionally, the source node CU-UP performs data-forwarding to the target node CU-UP. For example, when the source node CU-UP cannot perform data transmission according to the received predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-UP. Thereby, the target node and / or target node CU-UP transmits data which is not transmitted by the source node and / or source node CU-UP to the UE.

[0431] Step 414B: the target node and / or target node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a path switch request message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0432] Step 415B: AMF transmits a path switch request acknowledge message to the target node and / or target node CU-CP.

[0433] Step 416B: AMF transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the UPF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0434] Step 417B: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU-CP may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0435] Step 418B: UPF transmits data to the source node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0436] Step 419B: the UE accesses the target node and / or cell. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0437] Step 420B: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0438] Step 421B: UPF transmits data to the target node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0439] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0440] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0441] FIG. 4C shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4C shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0442] Step 401C: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0443] Step 402C: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0444] Step 403C: the source node and / or source node CU-CP transmits a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the target node and / or target node CU-UP to collect and / or generate and / or predict predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request message.

[0445] Step 404C: the target node CU-CP transmits a UE context setup request message to the target node DU.

[0446] Step 405C: the target node DU transmits a UE context setup response message to the target node CU-CP.

[0447] Step 406C: the target node CU-CP transmits to the target node CU-UP a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the target node CU-UP to collect and / or generate and / or predict predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell may be carried by a bearer context setup request message.

[0448] Step 407C: the target node CU-UP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the collection and / or generation and / or prediction may be performed based on the request for predicted and / or current data transmission state information in step 406C. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0449] Step 408C: the target node CU-UP transmits predicted and / or current data transmission state information to the target node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a bearer context setup response message.

[0450] Step 409C: optionally, the target node and / or target node CU-CP transmits predicted and / or current data transmission state information to the source node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a handover request acknowledge message. The predicted and / or current data transmission state information may be used to inform the source node and / or source node CU-CP and / or source node CU-UP of data state information and / or data transmission scheme. For example, when the source node and / or source node CU-CP and / or source node CU-UP cannot perform data transmission according to the predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node and / or source node CU-CP and / or source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node and / or source node CU-CP and / or source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-CP and / or target node CU-UP. Thereby, the target node and / or target node CU-CP and / or target node CU-UP transmits the data which is not transmitted by the source node and / or source node CU-CP and / or source node CU-UP to the UE.

[0451] Step 410C: the source node CU-CP and the source node DU perform a UE context modification process.

[0452] The subsequent steps are the same as step 411B, step 412B, step 413B, step 414B, step 415, step 416B, step 417B, step 418B, step 419B, step 420B, step 421B in FIG. 4Ba-4Bc.

[0453] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0454] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0455] FIG. 4D shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4D shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0456] Step 401D: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0457] Step 402D: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0458] Step 403D: the source node and / or source node CU-CP transmits a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the target node and / or target node CU-CP to collect and / or generate and / or predict predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by a handover request message.

[0459] Step 404D: the target node CU-CP transmits a UE context setup request message to the target node DU.

[0460] Step 405D: the target node DU transmits a UE context setup response message to the target node CU-CP.

[0461] Step 406D: the target node CU-CP transmits a bearer context setup request message to the target node CU-UP.

[0462] Step 407D: the target node CU-UP transmits a bearer context setup response message to the target node CU-CP.

[0463] Step 408D: the target node CU-CP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the collection and / or generation and / or prediction may be performed based on the request for predicted and / or current data transmission state information in step 403D. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0464] Step 409D: optionally, the target node and / or target node CU-CP transmits predicted and / or current data transmission state information to the source node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a handover request acknowledge message. The predicted and / or current data transmission state information may be used to inform the source node and / or source node CU-CP and / or source node CU-UP of data state information and / or data transmission scheme. For example, when the source node and / or source node CU-CP and / or source node CU-UP cannot perform data transmission according to the predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node and / or source node CU-CP and / or source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node and / or source node CU-CP and / or source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-CP and / or target node CU-UP. Thereby, the target node and / or target node CU-CP and / or target node CU-UP transmits the data which is not transmitted by the source node and / or source node CU-CP and / or source node CU-UP to the UE.

[0465] Step 410D: the source node CU-CP and the source node DU perform a UE context modification process.

[0466] The subsequent steps are the same as step 411B, step 412B, step 413B, step 414B, step 415, step 416B, step 417B, step 418B, step 419B, step 420B, step 421B in FIG. 4Ba-4Bc.

[0467] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0468] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0469] FIG. 4Ea-4Ec shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4Ea-4Ec shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0470] Step 401E: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0471] Step 402E: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0472] Step 403E: the source node and / or source node CU-CP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0473] Step 404E: the source node and / or source node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node and / or target node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0474] Step 405E: the target node CU-CP and the target node DU perform a UE context modification process.

[0475] Step 406E: the target node CU-CP transmits predicted and / or current data transmission state information to the target node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a bearer context setup request message.

[0476] Step 407E: the target node CU-UP transmits a bearer context setup response message to the target node CU-CP.

[0477] Step 408E: the target node and / or target node CU-CP transmits a handover request acknowledge message to the source node and / or source node CU-CP.

[0478] Step 409E: the source node CU-CP and the source node DU perform a UE context modification process.

[0479] Step 410E: optionally, the source node CU-CP transmits predicted and / or current data transmission state information to the source node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The predicted and / or current data transmission state information may be carried by a bearer context modification message. The predicted and / or current data transmission state information may be used to inform the source node CU-UP of data state information and / or data transmission scheme. For example, when the source node CU-UP cannot perform data transmission according to the predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-UP. Thereby, the target node and / or target node CU-UP transmits data which is not transmitted by the source node and / or source node CU-UP to the UE.

[0480] Step 411E: the source node CU-UP transmits a bearer context modification response message to the source node CU-CP.

[0481] Step 412E: optionally, the source node CU-UP performs data-forwarding to the target node CU-UP. For example, when the source node CU-UP cannot perform data transmission according to the received predicted and / or current data state information and / or data transmission scheme (for example, in some implementations, the source node CU-UP cannot complete data transmission to the UE according to the predicted and / or current data state information and / or data transmission scheme), the source node CU-UP performs data-forwarding of the remaining unsent data to the target node and / or target node CU-UP. Thereby, the target node and / or target node CU-UP transmits data which is not transmitted by the source node and / or source node CU-UP to the UE.

[0482] The source node and / or the target node may transmit target node and / or cell related information to the AMF, which may be performed in the following two methods:

[0483] Method A:

[0484] Step 413EA: the target node and / or target node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a path switch request message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0485] Step 414EA: AMF transmits a path switch request acknowledge message to the target node and / or target node CU-CP.

[0486] Method B:

[0487] Step 413EB: the source node and / or source node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a path switch request message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0488] Step 414EB: AMF transmits a path switch request acknowledge message to the source node and / or source node CU-CP.

[0489] Step 415E: AMF transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the UPF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0490] Step 416E: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU-CP may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0491] Step 417E: UPF transmits data to the source node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0492] Step 418E: the UE accesses the target node and / or cell. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0493] Step 419E: the UE transmits an RRC reconfiguration complete message to the target node. Alternatively, the UE may transmit an RRC reconfiguration complete message to the target node CU through the target node DU.

[0494] Step 420E: optionally, the AMF transmits security information to the target node and / or target node CU-CP. The security information may also be called security context. The security context may include one or more of the following: Next Hop Chaining Count, Next-Hop (NH) (which may also be called security key), etc.

[0495] Step 421E: UPF transmits data to the target node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0496] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0497] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0498] FIG. 4F shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4F shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0499] Step 401F: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0500] Step 402F: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0501] Step 403F: the source node CU-CP transmits to the source node CU-UP a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the source node CU-UP to collect and / or generate and / or predict predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell may be carried by a bearer context modification request message.

[0502] Step 404F: the source node CU-UP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the collection and / or generation and / or prediction may be performed based on the request for predicted and / or current data transmission state information in step 403F. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0503] Step 405F: the source node CU-UP transmits a bearer context modification response message to the source node CU-CP.

[0504] Step 406F: the source node and / or source node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node and / or target node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0505] Step 407F: the target node CU-CP and the target node DU perform a UE context modification process.

[0506] Step 408F: the target node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a bearer context setup request message.

[0507] Step 409F: the target node CU-UP transmits a bearer context setup response message to the target node CU-CP.

[0508] Step 410F: the target node and / or target node CU-CP transmits a handover request acknowledge message to the source node and / or source node CU-CP.

[0509] Step 411F: the source node CU-CP performs other handover processes (for example, the other steps in a handover process) with the source node DU and / or source node CU-UP.

[0510] The subsequent steps may refer to step 412E and the subsequent steps thereof in FIG. 4Ea-4Ec.

[0511] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0512] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0513] FIG. 4G shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4G shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0514] Step 401G: the UE transmits a measurement report to the source node and / or source node CU-CP.

[0515] Step 402G: the source node and / or source node CU-CP collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0516] Step 403G: the source node CU-CP transmits to the source node DU a request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell. The request for predicted and / or current data transmission state information is used to request the source node DU to collect and / or generate and / or predict the predicted and / or current data transmission state information. The request for predicted and / or current data transmission state information may be the aforementioned fourth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The request for predicted and / or current data transmission state information and / or relevant information for accessing the target node and / or cell may be carried by a UE context modification request message.

[0517] Step 404G: the source node DU collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the collection and / or generation and / or prediction may be performed based on the request for predicted and / or current data transmission state information in step 403G. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0518] Step 405G: the source node DU transmits a UE context modification response message to the source node CU-CP.

[0519] Step 406G: the source node and / or source node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node and / or target node CU-CP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0520] Step 407G: the target node CU-CP and the target node DU perform a UE context modification process.

[0521] Step 408G: the target node CU-CP transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node CU-UP. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a bearer context setup request message.

[0522] Step 409G: the target node CU-UP transmits a bearer context setup response message to the target node CU-CP.

[0523] Step 410G: the target node and / or target node CU-CP transmits a handover request acknowledge message to the source node and / or source node CU-CP.

[0524] Step 411G: the source node CU-CP performs other handover processes (for example, the other steps in a handover process) with the source node DU and / or source node CU-UP.

[0525] The subsequent steps may refer to step 412E and the subsequent steps thereof in FIG. 4Ea-4Ec.

[0526] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0527] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0528] FIG. 4Ha-4Hc shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 4Ha-4Hc shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0529] Step 401H: the UE transmits a measurement report to the source node.

[0530] Step 402H: the source node collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0531] Step 403H: the source node and / or source node CU-CP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0532] Step 404H: the source node transmits to the AMF relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information (for example, it may be transmitted through a thirteenth message). The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when leaving a cell managed by the source node and / or accessing the target node 1 (and / or a cell managed by the target node 1) and / or accessing the target node 2 (and / or a cell managed by the target node 2) and / or accessing one or more target nodes and / or target cells. The predicted and / or current data transmission state is a data transmission state corresponding to the data transmission performed before the UE leaves a cell managed by the source node and / or accesses the target node 1 (and / or a cell managed by the target node 1). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover required message.

[0533] Step 405H: AMF transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node 1 (for example, it may be transmitted through a fourteenth message). The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 1 and / or when switching between cells managed by the target node 1. The predicted and / or current data transmission state is a data transmission state corresponding to the data transmission performed before the UE before accesses the target node 1 (and / or a cell managed by the target node 1). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0534] Step 406H: the target node 1 collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 1 and / or when performing a next handover after accessing the target node 1 and / or switching between cells managed by the target node 1. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0535] Step 407H: the target node 1 collects and generates and / or predicts predicted and / or current data transmission state information. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 1 and / or when the UE performs data transmission between cells managed by the target node 1 and / or before the UE accesses the next target node (e.g., target node 2). In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0536] Step 408H: the target node 1 transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF (for example, it may be transmitted through a fifteenth message). The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 1 and / or when performing a next handover after accessing the target node 1 and / or switching between cells managed by the target node 1. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 1 and / or when the UE performs data transmission between cells managed by the target node 1 and / or before the UE accesses the next target node (e.g., target node 2). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request acknowledge message.

[0537] Step 409H: AMF transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node 2. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 2 and / or when switching between cells managed by the target node 2. The predicted and / or current data transmission state is a data transmission state corresponding to the data transmission performed before the UE before accesses the target node 2. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0538] Step 410H: the target node 2 collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when the UE accesses the target node 2 and / or when the UE performs the next handover after accessing the target node 2 and / or when the UE performs switching between cells managed by the target node 2. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0539] Step 411H: the target node 2 collects and generates and / or predicts predicted and / or current data transmission state information. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 2 and / or when the UE performs data transmission between cells managed by the target node 2 and / or before the UE accesses the next target node. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0540] Step 412H: the target node 2 transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell after the UE accesses the target node 2 and / or when the UE performs the next handover after accessing the target node 2 and / or when the UE performs switching between cells managed by the target node 2. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 2 and / or when the UE performs data transmission between cells managed by the target node 2 and / or before the UE accesses the next target node. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request acknowledge message.

[0541] Step 413H: AMF transmits to the source node relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information (for example, it may be transmitted through a sixteenth message). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover command message.

[0542] Step 414H: AMF transmits to the UPF relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information (for example, it may be transmitted through a seventeenth message). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0543] Step 415H: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU-CP may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0544] Step 416H: UPF transmits data to the source node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0545] Step 417H: the UE accesses the target node 1 and / or a cell of the target node 1. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0546] Step 418H: UPF transmits data to the target node 1 based on the relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information.

[0547] Step 419H: the UE accesses the target node 2 and / or a cell of the target node 2. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0548] Step 420H: UPF transmits data to the target node 2 based on the relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information.

[0549] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0550] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0551] It should be understood that in the present disclosure, the order numbers of the messages are used only for distinction. In each step of various embodiments of the present disclosure, one or more information may be transmitted in combination through one message, or may be transmitted separately through different messages or other methods, which is not limited herein.

[0552] FIG. 4Ia-4Ib shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 41 shows a process of exchanging predicted and / or current data transmission state information between nodes.

[0553] Step 401I: the UE transmits a measurement report to the source node.

[0554] Step 402I: the source node collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0555] Step 403I: the source node and / or source node CU-CP collects and generates and / or predicts predicted and / or current data transmission state information. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0556] Step 404I: the source node transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node 1. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when leaving the cell managed by the source node and / or accessing the target node 1 (and / or a cell managed by the target node 1). The predicted and / or current data transmission state is a data transmission state corresponding to the data transmission performed before the UE leaves a cell managed by the source node and / or accesses the target node 1 (and / or a cell managed by the target node 1). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0557] Step 405I: the target node 1 collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 1 and / or when performing a next handover after accessing the target node 1 and / or switching between cells managed by the target node 1. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0558] Step 406I: the target node 1 collects and generates and / or predicts predicted and / or current data transmission state information. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 1 and / or when the UE performs data transmission between cells managed by the target node 1 and / or before the UE accesses the next target node (e.g., target node 2). In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0559] Step 407I: the target node 1 transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the source node. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 1 and / or when performing a next handover after accessing the target node 1 and / or switching between cells managed by the target node 1. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 1 and / or when the UE performs data transmission between cells managed by the target node 1 and / or before the UE accesses the next target node (e.g., target node 2). The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request acknowledge message.

[0560] Step 408I: the source node transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the target node 2. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when accessing the target node 2 and / or when switching between cells managed by the target node 2. The predicted and / or current data transmission state is a data transmission state corresponding to the data transmission performed before the UE before accesses the target node 2. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request message.

[0561] Step 409I: the target node 2 collects and / or generates and / or predicts the relevant information for accessing the target node and / or cell. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell when the UE accesses the target node 2 and / or when the UE performs the next handover after accessing the target node 2 and / or when the UE performs switching between cells managed by the target node 2. In some implementations, for example, the relevant information for accessing the target node and / or cell may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0562] Step 410I: the target node 2 collects and generates and / or predicts predicted and / or current data transmission state information. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 2 and / or when the UE performs data transmission between cells managed by the target node 2 and / or before the UE accesses the next target node. In some implementations, for example, the predicted and / or current data transmission state may be obtained by machine learning and / or artificial intelligence models, or may be obtained by mathematical algorithms, etc.

[0563] Step 411I: the target node 2 transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the source node. The relevant information for accessing the target node and / or cell is relevant information for the UE to access a target node and / or cell after the UE accesses the target node 2 and / or when the UE performs the next handover after accessing the target node 2 and / or when the UE performs switching between cells managed by the target node 2. The predicted and / or current data transmission state is a data transmission state after the UE accesses the target node 2 and / or when the UE performs data transmission between cells managed by the target node 2 and / or before the UE accesses the next target node. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a handover request acknowledge message.

[0564] Step 412I: the source node transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the AMF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be carried by a path switch request message.

[0565] Step 413I: AMF transmits relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information to the UPF. The predicted and / or current data transmission state information may be the aforementioned sixth message. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information may be used by the core network to make a data transmission scheme. For example, before accessing the target node and / or cell, an entity of the core network (e.g., UPF) transmits data to the source node according to the predicted and / or current data transmission state information. For example, after accessing the target node and / or cell, the entity of the core network (e.g., UPF) transmits data to the target node according to the predicted and / or current data transmission state information.

[0566] Step 414I: the source node transmits relevant information for accessing the target node and / or cell to the UE. Alternatively, the source node CU-CP may transmit relevant information for accessing the target node and / or cell to the UE through the source node DU. The relevant information for accessing the target node and / or cell may be the aforementioned third message. The relevant information for accessing the target node and / or cell may be carried by an RRC reconfiguration message.

[0567] Step 415I: UPF transmits data to the source node based on the relevant information for accessing the target node and / or cell, and / or, the predicted and / or current data transmission state information.

[0568] Step 416I: the UE accesses the target node 1 and / or a cell of the target node 1. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0569] Step 417I: optionally, the AMF transmits security information to the target node 1. The security information may also be called security context. The security context may include one or more of the following: Next Hop Chaining Count, Next-Hop (NH) (which may also be called security key), etc.

[0570] Step 418I: UPF transmits data to the target node 1 based on the relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information.

[0571] Step 419I: the UE accesses the target node 2 and / or a cell of the target node 2. In some implementations, for example, the UE accesses the target node and / or cell according to the relevant information for accessing the target node and / or cell.

[0572] Step 420I: optionally, the AMF transmits security information to the target node 2. The security information may also be called security context. The security context may include one or more of the following: Next Hop Chaining Count, Next-Hop (NH) (which may also be called security key), etc.

[0573] Step 421I: the UPF transmits data to the target node 2 based on the relevant information for accessing the target node and / or cell, and / or, predicted and / or current data transmission state information.

[0574] Through this scheme, the UE may access the target node and / or target cell according to the relevant information for accessing the target node and / or cell. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and thus does not need to perform a random access procedure to access the target node and / or target cell. For example, the UE may access the target node and / or cell at the handover time. For example, the UE may access the target node and / or target cell using the Timing Advance (TA) information at the handover time. In yet other implementations, for example, after obtaining the relevant information for accessing the target node and / or cell, the target node and / or target node DU may use the information to decide a strategy for receiving UE uplink transmission, for example, use the Transmission Configuration Indicator (TCI) state (ID) to decide the selection of beams for receiving uplink data and / or uplink signaling. For example, the UE may use the Timing Advance (TA) information to access the target node and / or target cell, and the target node and / or target cell may use the transmission configuration indicator (TCI) state (ID) for reception of uplink data and / or uplink signaling. This scheme can achieve seamless handover. Herein, seamless handover may also be called interruption-free handover, and / or low-latency handover, and / or non-latency handover.

[0575] Through this scheme, the core network can perform data transmission according to the predicted and / or current data transmission state information. During a handover process, the core network can accurately transmit, data that can be transmitted, to the source node and / or the target node, so as to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc.

[0576] The examples of FIGs. 4B, 4C, 4D, 4E, 4F, 4G, 4H, and 4I are illustrated by taking the source node CU-CP performing the collection and / or generation and / or prediction of the relevant information for accessing the target node and / or cell as an example, and the collection and / or generation and / or prediction of the relevant information for accessing the target node and / or cell may also be performed by the source node DU and / or target node and / or target node CU-CP and / or target node DU. Specific related processes for the collection and / or generation and / or prediction of the relevant information for accessing the target node and / or cell may be referred to FIG. 3B, FIG. 3C, FIG. 3D and FIG. 3E. In the present disclosure, the embodiments may be combined with each other. In an implementation, the examples of FIGs. 4B, 4C, 4D, 4E, 4F and 4G may be applied to scenarios where handover is to be performed, and / or handover is performed within a short time.

[0577] FIG. 5 shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 5 shows a process of exchanging mobility information between two nodes.

[0578] In some implementations, for example, the fifth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB, and the sixth node may be a UE. In some implementations, for example, the fifth node may be a UE, and the sixth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In some other implementations, for example, the fifth node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the sixth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the fifth node may be an AMF or SMF or MME, and the sixth node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the fifth node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the sixth node may be an AMF or SMF or MME. It may also be, for example, that the fifth node is a master node and the sixth node is a secondary node; for example, the fifth node is a secondary node and the sixth node is a master node; for example, the fifth node is a source node and the sixth node is a target node; for example, the fifth node is a target node and the sixth node is a source node.

[0579] Step 501A: optionally, the fifth node transmits a mobility information request to the sixth node. The request is used to request the sixth node to collect and / or report mobility information. The mobility information request may be the aforementioned seventh message.

[0580] Step 502A: optionally, the sixth node transmits a mobility information response to the fifth node. The response may be used to inform the fifth node whether the sixth node is capable of collecting and / or reporting mobility information (as requested). The mobility information response may be the aforementioned eighth message.

[0581] Step 503A: the sixth node collects mobility information. In some implementations, for example, the sixth node may collect mobility information according to the mobility information request in step 501A.

[0582] Step 504A: the sixth node transmits mobility information to the fifth node. The mobility information may be the aforementioned ninth message. After obtaining the mobility information, the fifth node may make mobility decisions and / or generate mobility-related information. For example, the obtained mobility information may be used for training and / or fine-tuning of a model, which may be used for generating mobility decisions and / or generating mobility and / or handover related information. The mobility and / or handover related information includes, but is not limited to: (predicted) timing advance information, (predicted) transmission configuration indicator (TCI) state (ID), (predicted) handover time, (predicted) handover target node and / or target cell, (predicted) measurement results, (predicted) handover events, and other handover-related information. The measurement results may include one or more of the following: Layer 1 measurement results, Layer 3 measurement results, etc. The handover events may include one or more of the following: handover successes, handover fails, radio link failure occurs, handover successes but radio link failure occurs soon (e.g., within a first time after the handover successes), etc. This scheme is beneficial to improving handover robustness and handover success rate. This scheme can reduce handover latency. For example, this scheme is conducive to achieving seamless handover. Specific information about how to achieve the above effects may refer to Example 1.

[0583] FIG. 6 shows a schematic diagram of an aspect of a method for supporting mobility according to embodiments of the present disclosure. Specifically, FIG. 6 shows a process of exchanging history data transmission state information between two nodes.

[0584] In some implementations, for example, the seventh node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB, and the eighth node may be a UE. In some implementations, for example, the seventh node may be a UE, and the eighth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In some other implementations, for example, the seventh node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the eighth node may be a gNB or gNB-CU or gNB-DU or gNB CU-CP or gNB CU-UP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the seventh node may be an AMF or SMF or MME, and the eighth node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB. In yet other implementations, for example, the seventh node may be a gNB or gNB-CU or gNB CU-CP or en-gNB or eNB or ng-eNB, and the eighth node may be an AMF or SMF or MME. It may also be, for example, that the seventh node is a master node and the eighth node is a secondary node; for example, the seventh node is a secondary node and the eighth node is a master node; for example, the seventh node is a source node and the eighth node is a target node; for example, the seventh node is a target node and the eighth node is a source node.

[0585] Step 601A: optionally, the seventh node transmits a request for history data transmission state information to the eighth node. The request is used to request the eighth node to collect and / or report history data transmission state information. The request for history data transmission state information may be the aforementioned tenth message.

[0586] Step 602A: optionally, the eighth node transmits a response for history data transmission state information to the seventh node. The response may be used to inform the seventh node whether the eighth node is capable of collecting and / or reporting history data transmission state information (as requested). The response for history data transmission state information may be the aforementioned eleventh message.

[0587] Step 603A: the eighth node collects history data transmission state information. In some implementations, for example, the eighth node may collect history data transmission state information according to the request for history data transmission state information in step 601A.

[0588] Step 604A: the eighth node transmits history data transmission state information to the seventh node. The history data transmission state information may be the aforementioned twelfth message. After obtaining the history data transmission state information, the seventh node may make data transmission decisions and / or generate data transmission-related auxiliary information (for example, predicted data transmission state, etc.). For example, the obtained data transmission state information may be used for training and / or fine-tuning and / or inferring and / or evaluation of a model, which be used for generating data transmission decisions and / or generating data transmission-related auxiliary information. The scheme can realize fast data transmission and reduce the latency of data transmission. For example, during a handover process, the core network node and / or the UE can accurately perform data transmission to the source node and / or the target node to avoid and / or reduce exchange of data-forwarding address, data-forwarding, transmission of the data state of the source node, etc. Specific information about how to achieve the above effects may refer to Example 2.

[0589] In the above embodiments, if a node is in a non-split architecture, the node CU and the node DU may be regarded as one node, and the exchanging between the node CU and the node DU may be regarded as intra-node exchanging. Alternatively, if a node is in a non-split architecture, the node CU-CP, the node CU-UP, and the node DU may be regarded as one node, and the exchanging between the node CU-CP and the node CU-UP and / or the node CU-CP and the node DU may be regarded as intra-node exchanging.

[0590] In the present disclosure, the embodiments are only given as examples, and the above embodiments may be combined with each other, etc.

[0591] In the above example, for example, in a non-gNB CU and gNB DU split architecture, the gNB CU and gNB DU may be combined into one node, for example, a gNB. In this case, the exchanging between gNB CU and gNB DU may be regarded as intra-node behaviors.

[0592] It should be understood that depending on the application scenario, the various examples, aspects, methods, steps, processes, etc. described herein may be implemented separately or in combination in any manner, which are not limited herein. In the present disclosure, to make the description more concise, generally, description performed in a specific step in an example or embodiment is not repeated again in the corresponding step in another example or embodiment. However, it should be understood that description performed in a specific step in an example or embodiment may apply to the corresponding step of any other example.

[0593] Next, FIG. 7 shows a flowchart of a method 700 performed by a first node in a wireless communication system according to embodiments of the present disclosure.

[0594] As shown in FIG. 7, a method 700 performed by a first node in a wireless communication system according to embodiments of the present disclosure may include: in step S701, receiving a thirteenth message from a second node, wherein the thirteenth message includes first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; in step S702, transmitting a fourteenth message to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information; and in step S703, transmitting a sixteenth message to the second node, wherein the sixteenth message includes a handover command for handing over the UE to the third node.

[0595] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0596] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0597] According to embodiments of the present disclosure, the method further includes: receiving a fifteenth message from the third node, wherein the fifteenth message includes second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node.

[0598] According to embodiments of the present disclosure, the method further includes: transmitting a seventeenth message to a fifth node, wherein the seventeenth message includes at least one of the first access-related information, the first data transmission state information, the second access-related information, the data transmission state information, wherein the seventeenth message is used for the fifth node to transmit data to at least one of the second node and the third node.

[0599] According to embodiments of the present disclosure, the method further includes: receiving mobility information related to one or more UEs from the third node; and transmitting the mobility information to the second node, wherein the mobility information is used for training a model for generating the first access-related information.

[0600] FIG. 8 shows a flowchart of a method 800 performed by a second node in a wireless communication system according to embodiments of the present disclosure.

[0601] As shown in FIG. 8, a method 800 performed by a second node in a wireless communication system according to embodiments of the present disclosure may include: in step S801, transmitting a thirteenth message to a first node, wherein the thirteenth message includes first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and in step S802, receiving a sixteenth message from the first node, wherein the sixteenth message includes a handover command for handing over the UE to the third node, wherein a fourteenth message is transmitted by the first node to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information.

[0602] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0603] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0604] According to embodiments of the present disclosure, the method further includes: obtaining mobility information related to one or more UEs, wherein the mobility information is used for training a model for generating the first access-related information.

[0605] According to embodiments of the present disclosure, the method further includes: obtaining history data transmission state information related to one or more nodes, wherein the history data transmission state information is used for training a model for generating the first data transmission state information.

[0606] According to embodiments of the present disclosure, the method further includes: transmitting a Radio Resource Control (RRC) reconfiguration message to the UE, wherein the RRC reconfiguration message includes the first access-related information.

[0607] FIG. 9 shows a flowchart of a method 900 performed by a user equipment (UE) in a wireless communication system according to embodiments of the present disclosure.

[0608] As shown in FIG. 9, a method 900 performed by a user equipment (UE) in a wireless communication system according to embodiments of the present disclosure may include: in step S901, transmitting a measurement report to a second node; and in step S902, receiving a Radio Resource Control (RRC) reconfiguration message from the second node, wherein the RRC reconfiguration message includes first access-related information for the UE to access a third node, wherein a thirteenth message is transmitted by the second node to a first node, wherein the thirteenth message includes the first access-related information and first data transmission state information of the second node before the UE accesses the third node; wherein a fourteenth message is transmitted by the first node to the third node, wherein the fourteenth message includes the first access-related information and the first data transmission state information, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and wherein a sixteenth message is transmitted by the first node to the second node, wherein the sixteenth message includes a handover command for handing over the UE to the third node.

[0609] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0610] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0611] FIG. 10 shows a flowchart of a method 1000 performed by a third node in a wireless communication system according to embodiments of the present disclosure.

[0612] As shown in FIG. 10, a method 1000 performed by a third node in a wireless communication system according to embodiments of the present disclosure may include: in step S1001, receiving a fourteenth message from a first node, wherein the fourteenth message includes first access-related information for a User Equipment (UE) to access the third node and first data transmission state information of a second node before the UE accesses the third node, wherein the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to a handover of the UE to the third node, and wherein the first data transmission state information includes at least one of: information of data packets that the second node can be able to transmit, information of data packets that the second node can be able to finish transmitting, information of data packets that the second node can be able to successfully transmit; and in step S1002, transmitting a fifteenth message to the first node, wherein the fifteenth message includes second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node.

[0613] According to embodiments of the present disclosure, the first access-related information further includes: an identifier of the third node.

[0614] According to embodiments of the present disclosure, the information of data packets that the second node can be able to transmit includes at least one of: the number of the data packets that the second node can be able to transmit, sequence numbers corresponding to the data packets that the second node can be able to transmit, and a time when the second node can transmit the data packets; wherein the information of data packets that the second node can be able to finish transmitting includes at least one of: the number of the data packets that the second node can be able to finish transmitting, sequence numbers corresponding to the data packets that the second node can be able to finish transmitting, and a time when the second node can finish transmitting of the data packets; and wherein the information of data packets that the second node can be able to successfully transmit includes at least one of: the number of the data packets that the second node can be able to successfully transmit, sequence numbers corresponding to the data packets that the second node can be able to successfully transmit, and a time when the second node can successfully transmit the data packets.

[0615] According to embodiments of the present disclosure, the method further includes: transmitting mobility information related to one or more UEs to the first node, wherein the mobility information is used for training a model for generating the first access-related information.

[0616] In some implementations, the first node may be an AMF; the second node may be a source node; the third node may be a target node 1; the fourth node may be a target node 2; the fifth node may be a UPF. In other implementations, a node according to embodiments of the present disclosure may also be any other node as described above.

[0617] It should be understood that methods 700, 800, 900, 1000, etc. according to embodiments of the present disclosure may also include any steps described in conjunction with various examples, aspects, drawings, etc. of the present disclosure.

[0618] Next, FIG. 11 shows a schematic diagram of a node 1100 according to embodiments of the present disclosure.

[0619] As shown in FIG. 11, a node (or node device) 1100 according to embodiments of the present disclosure may include a transceiver 1110 and a processor 1120. The transceiver 1110 may be configured to transmit and receive signals. The processor 1120 may be coupled to transceiver 1110 and may be configured to (e.g., control the transceiver 1110 to) perform methods performed by any node (e.g., first node, second node, third node, etc.) according to embodiments of the present disclosure.

[0620] FIG. 12 shows a schematic diagram of a user equipment (UE) 1200 according to embodiments of the present disclosure.

[0621] As shown in FIG. 12, a user equipment (UE) 1200 according to embodiments of the present disclosure may include a transceiver 1210 and a processor 1220. The transceiver 1210 may be configured to transmit and receive signals. The processor 1220 may be coupled to transceiver 1210 and may be configured to (e.g., control the transceiver 1210 to) perform methods performed by user equipment (UE) according to embodiments of the present disclosure. In the present disclosure, a processor may also be referred to as a controller.

[0622] Embodiments of the present disclosure also provide a computer-readable medium having stored thereon computer-readable instructions which, when executed by a processor, implement any method according to embodiments of the present disclosure.

[0623] Various embodiments of the present disclosure may be implemented as computer-readable codes embodied on a computer-readable recording medium from a specific perspective. A computer-readable recording medium is any data storage device that can store data readable by a computer system. Examples of computer-readable recording media may include read-only memory (ROM), random access memory (RAM), compact disk read-only memory (CD-ROM), magnetic tape, floppy disk, optical data storage device, carrier wave (e.g., data transmission via the Internet), etc. Computer-readable recording media can be distributed by computer systems connected via a network, and thus computer-readable codes can be stored and executed in a distributed manner. Furthermore, functional programs, codes and code segments for implementing various embodiments of the present disclosure can be easily explained by those skilled in the art to which the embodiments of the present disclosure are applied.

[0624] It will be understood that the embodiments of the present disclosure may be implemented in the form of hardware, software, or a combination of hardware and software. The software may be stored as program instructions or computer-readable codes executable on a processor on a non-transitory computer-readable medium. Examples of non-transitory computer-readable recording media include magnetic storage media (such as ROM, floppy disk, hard disk, etc.) and optical recording media (such as CD-ROM, digital video disk (DVD), etc.). Non-transitory computer-readable recording media may also be distributed on computer systems coupled to a network, so that computer-readable codes are stored and executed in a distributed manner. The medium can be read by a computer, stored in a memory, and executed by a processor. Various embodiments may be implemented by a computer or a portable terminal including a controller and a memory, and the memory may be an example of a non-transitory computer-readable recording medium suitable for storing program (s) with instructions for implementing embodiments of the present disclosure. The present disclosure may be realized by a program with code for concretely implementing the apparatus and method described in the claims, which is stored in a machine (or computer)-readable storage medium. The program may be electronically carried on any medium, such as a communication signal transmitted via a wired or wireless connection, and the present disclosure suitably includes its equivalents.

[0625] What has been described above is only the specific implementation of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Anyone who is familiar with this technical field may make various changes or substitutions within the technical scope disclosed in the present disclosure, and these changes or substitutions should be covered within the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1.A method performed by a first node in a communication system, the method comprising:receiving, from a second node, a message including first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein:the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, or a handover time corresponding to a handover of the UE to the third node; andthe first data transmission state information includes at least one of: information of data packets that the second node can transmit, information of data packets that the second node can finish transmitting, or information of data packets that the second node can successfully transmit;transmitting, to the third node, a message including the first access-related information and the first data transmission state information; andtransmitting, to the second node, a message including a handover command for handing over the UE to the third node.2.The method of claim 1, wherein:the first access-related information further includes an identifier of the third node,wherein the information of data packets that the second node can transmit includes at least one of: the number of the data packets that the second node can transmit, sequence numbers corresponding to the data packets that the second node can transmit, or a time when the second node can transmit the data packets,wherein the information of data packets that the second node can finish transmitting includes at least one of: the number of the data packets that the second node can finish transmitting, sequence numbers corresponding to the data packets that the second node can finish transmitting, or a time when the second node can finish transmitting of the data packets, andwherein the information of data packets that the second node can successfully transmit includes at least one of: the number of the data packets that the second node can successfully transmit, sequence numbers corresponding to the data packets that the second node can successfully transmit, or a time when the second node can successfully transmit the data packets.3.The method of claim 1, further comprising:receiving, from the third node, a message including second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node; andtransmitting, to a fifth node, a message including at least one of the first access-related information, the first data transmission state information, the second access-related information, or the data transmission state information,wherein the message transmitted to the fifth node is used for the fifth node to transmit data to at least one of the second node or the third node.4.The method of claim 1, further comprising:receiving mobility information related to one or more UEs from the third node; andtransmitting the mobility information to the second node,wherein the mobility information is used for training a model for generating the first access-related information.5.A method performed by a second node in a communication system, the method comprising:transmitting, to a first node, a message including first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein:the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to or a handover of the UE to the third node; andthe first data transmission state information includes at least one of: information of data packets that the second node can transmit, information of data packets that the second node can finish transmitting, or information of data packets that the second node can successfully transmit; andreceiving, from the third node, a message including a handover command for handing over the UE to the third node,wherein a message is transmitted by the first node to the third node, wherein the message includes the first access-related information and the first data transmission state information.6.The method of claim 5, wherein:the first access-related information further includes:an identifier of the third node,wherein the information of data packets that the second node can transmit includes at least one of: the number of the data packets that the second node can transmit, sequence numbers corresponding to the data packets that the second node can transmit, or a time when the second node can transmit the data packets;wherein the information of data packets that the second node can finish transmitting includes at least one of: the number of the data packets that the second node can finish transmitting, sequence numbers corresponding to the data packets that the second node can finish transmitting, or a time when the second node can finish transmitting of the data packets; andwherein the information of data packets that the second node can successfully transmit includes at least one of: the number of the data packets that the second node can successfully transmit, sequence numbers corresponding to the data packets that the second node can successfully transmit, or a time when the second node can successfully transmit the data packets.7.The method of claim 5, further comprising:obtaining mobility information related to one or more UEs,wherein the mobility information is used for training a model for generating the first access-related information.8.The method of claim 5, further comprising:obtaining history data transmission state information related to one or more nodes; andwherein the history data transmission state information is used for training a model for generating the first data transmission state information,transmitting a Radio Resource Control (RRC) reconfiguration message to the UE, wherein the RRC reconfiguration message includes the first access-related information.9.A first node comprising:at least one transceiver;at least one processor communicatively coupled to the at least one transceiver; andat least one memory, communicatively coupled to the at least one processor, storing instructions executable by the at least one processor individually or in any combination to cause the first node to:receiving, from a second node, a message including first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein:the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, or a handover time corresponding to a handover of the UE to the third node; andthe first data transmission state information includes at least one of: information of data packets that the second node can transmit, information of data packets that the second node can finish transmitting, or information of data packets that the second node can successfully transmit;transmitting, to the third node, a message including the first access-related information and the first data transmission state information; andtransmitting, to the second node, a message including a handover command for handing over the UE to the third node.10.The first node of claim 9,wherein:the first access-related information further includes an identifier of the third node,wherein the information of data packets that the second node can transmit includes at least one of: the number of the data packets that the second node can transmit, sequence numbers corresponding to the data packets that the second node can transmit, or a time when the second node can transmit the data packets,wherein the information of data packets that the second node can finish transmitting includes at least one of: the number of the data packets that the second node can finish transmitting, sequence numbers corresponding to the data packets that the second node can finish transmitting, or a time when the second node can finish transmitting of the data packets, andwherein the information of data packets that the second node can successfully transmit includes at least one of: the number of the data packets that the second node can successfully transmit, sequence numbers corresponding to the data packets that the second node can successfully transmit, or a time when the second node can successfully transmit the data packets.11.The first node of claim 9, wherein the instructions executable by the at least one processor individually or in any combination further cause the first node to:receive, from the third node, a message including second access-related information for the UE to access a fourth node and second data transmission state information of the third node before the UE accesses the fourth node; andtransmit, to a fifth node, a message including at least one of the first access-related information, the first data transmission state information, the second access-related information, or the data transmission state information,wherein the message transmitted to the fifth node is used for the fifth node to transmit data to at least one of the second node or the third node.12.The first node of claim 9, wherein the instructions executable by the at least one processor individually or in any combination further cause the first node to:receive mobility information related to one or more UEs from the third node; andtransmit the mobility information to the second node,wherein the mobility information is used for training a model for generating the first access-related information.13.A second node comprising:at least one transceiver;at least one processor communicatively coupled to the at least one transceiver; andat least one memory, communicatively coupled to the at least one processor, storing instructions executable by the at least one processor individually or in any combination to cause the second node to:transmit, to a first node, a message including first access-related information for a user equipment (UE) to access a third node and first data transmission state information of the second node before the UE accesses the third node, wherein:the first access-related information includes at least one of: a timing advance (TA) for the UE to access the third node, a transmission configuration indicator (TCI) state for the third node, a handover time corresponding to or a handover of the UE to the third node; andthe first data transmission state information includes at least one of: information of data packets that the second node can transmit, information of data packets that the second node can finish transmitting, or information of data packets that the second node can successfully transmit; andreceive, from the third node, a message including a handover command for handing over the UE to the third node,wherein a message is transmitted by the first node to the third node, wherein the message includes the first access-related information and the first data transmission state information.14.The first node of claim 13,wherein:the first access-related information further includes:an identifier of the third node,wherein the information of data packets that the second node can transmit includes at least one of: the number of the data packets that the second node can transmit, sequence numbers corresponding to the data packets that the second node can transmit, or a time when the second node can transmit the data packets;wherein the information of data packets that the second node can finish transmitting includes at least one of: the number of the data packets that the second node can finish transmitting, sequence numbers corresponding to the data packets that the second node can finish transmitting, or a time when the second node can finish transmitting of the data packets; andwherein the information of data packets that the second node can successfully transmit includes at least one of: the number of the data packets that the second node can successfully transmit, sequence numbers corresponding to the data packets that the second node can successfully transmit, or a time when the second node can successfully transmit the data packets.15.The second node of claim 9, wherein the instructions executable by the at least one processor individually or in any combination further cause the second node to:obtain mobility information related to one or more UEs;wherein the mobility information is used for training a model for generating the first access-related information,obtain history data transmission state information related to one or more nodes; andwherein the history data transmission state information is used for training a model for generating the first data transmission state information,transmit a Radio Resource Control (RRC) reconfiguration message to the UE, wherein the RRC reconfiguration message includes the first access-related information.

Images