Method and apparatus for a radio access network to recommend an alternative access point to a user equipment in a wireless communication system
By enabling the RAN to determine and provide access probabilities for multiple access points based on network conditions, the method optimizes access distribution, reducing congestion and improving system performance in wireless communication systems.
Patent Information
- Application Number
- PCT/KR2026/095720
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-05
- Filing Date
- 2026-04-09
- Publication Date
- 2026-11-12
AI Technical Summary
Existing wireless communication systems lack mechanisms for a radio access network (RAN) to efficiently distribute access attempts across multiple access points based on dynamic network conditions, leading to congestion and inefficient utilization of network resources due to independent UE access decisions without considering load distribution or congestion levels.
The RAN collects and analyzes network information, determining access probabilities for multiple access points and providing this information to user equipment (UE) to guide access decisions, allowing UEs to select among access points based on congestion and load conditions, thereby optimizing access distribution.
This approach reduces congestion and improves overall system performance by balancing access attempts across available network resources, enhancing communication efficiency and user experience.
Smart Images

Figure KR2026095720_12112026_PF_FP_ABST
Abstract
Description
METHOD AND APPARATUS FOR A RADIO ACCESS NETWORK TO RECOMMEND AN ALTERNATIVE ACCESS POINT TO A USER EQUIPMENT IN A WIRELESS COMMUNICATION SYSTEM
[0001] The present disclosure relates to a wireless communication system. Specifically, the present disclosure relates to a method and apparatus for a radio access network (RAN) to recommend an alternative access point (AP) to a user equipment (UE) in a wireless communication system.
[0002] In recent years, wireless communication systems have evolved to support heterogeneous access environments in which a user equipment (UE) may access multiple communication networks, including a cellular radio access network (RAN) and one or more alternative access networks such as wireless local area networks (WLANs) or other access point (AP)-based systems. Such multi-access environments enable flexible traffic distribution and may improve overall system performance by allowing the UE to select among multiple available access options.
[0003] In existing systems, the UE may perform access network discovery and selection based on various types of information, including signal strength, network availability, subscription information, and pre-configured policies. For example, the UE may perform scanning procedures to discover available APs, determine whether the detected APs correspond to trusted networks, and select a target network based on predefined rules or local measurements. In addition, network-based policy frameworks may provide guidance regarding preferred networks or access priorities.
[0004] However, such access selection procedures are typically performed based on limited or static information and may not sufficiently reflect dynamic network conditions. In particular, the UE may not have accurate or timely information regarding load distribution, resource availability, or congestion conditions associated with multiple access networks or individual APs. As a result, the UE may select a network or an AP without considering current congestion levels, which may lead to inefficient access distribution.
[0005] For example, in a cellular network, congestion may occur in a random access channel (RACH), resulting in increased access delay or access failure even when other parts of the network are not congested. In such cases, it may be beneficial for the UE to access the network through an alternative access network, such as a WLAN. However, when multiple UEs independently attempt to access nearby APs without coordination, access attempts may become concentrated on specific APs, leading to congestion and performance degradation in the alternative access network.
[0006] Furthermore, existing systems do not provide sufficient mechanisms for a network node, such as a RAN node, to obtain and utilize information regarding the load or performance of multiple APs and to control access behavior of UEs accordingly. In particular, there is a lack of mechanisms that enable the network to guide UEs in distributing access attempts across multiple APs in a balanced manner based on network conditions.
[0007] Accordingly, there is a need for a method and apparatus that enable a network to determine access control parameters for multiple access points based on network conditions and to provide such parameters to a UE, so that the UE may perform access decisions in a condition-aware and distributed manner. Through such mechanisms, access attempts may be efficiently distributed across available network resources, thereby reducing congestion and improving overall system performance.
[0008] In order to solve the above-described problems, the present disclosure provides a method and apparatus for a radio access network (RAN) to recommend an alternative access point (AP) to a user equipment (UE) in a wireless communication system.
[0009] The technical objects to be achieved by the present disclosure are not limited to those that have been described hereinabove merely by way of example, and other technical objects that are not mentioned can be clearly understood by those skilled in the art, to which the present disclosure pertains, from the following descriptions.
[0010] According to various embodiments of the present disclosure, there is provided a method performed by a first node, comprising: receiving, from a second node, system information including probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network; determining, based on congestion information included in the system information, whether to perform a random access procedure for a first communication network associated with the second node or to access the second communication network; selecting, based on the respective access probability values and based on determining to access the second communication network, one of the plurality of APs of the second communication network; and transmitting, to the second node, a first message for the random access procedure based on determining to perform the random access procedure.
[0011] According to various embodiments of the present disclosure, there is provided a method performed by a second node, comprising: determining congestion information indicating a congestion status of a first communication network; determining, based on the congestion information, probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network; transmitting, to a first node, system information including the congestion information and the probability information; and receiving, from the first node, a first message for a random access procedure based on the first node determining to perform the random access procedure.
[0012] According to various embodiments of the present disclosure, there is provided a first node in a wireless communication system, the first node comprising: a transceiver; at least one processor; and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the first node to perform operations corresponding to the method performed by the first node according to various embodiments of the present disclosure.
[0013] According to various embodiments of the present disclosure, there is provided a second node in a wireless communication system, the second node comprising: a transceiver; at least one processor; and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the second node to perform operations corresponding to the method performed by the second node according to various embodiments of the present disclosure.
[0014] According to various embodiments of the present disclosure, there is provided a control apparatus controlling a first node in a wireless communication system, the control apparatus comprising: at least one processor; and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform operations corresponding to the method performed by the first node according to various embodiments of the present disclosure.
[0015] According to various embodiments of the present disclosure, there is provided a control apparatus controlling a second node in a wireless communication system, the control apparatus comprising: at least one processor; and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform operations corresponding to the method performed by the second node according to various embodiments of the present disclosure.
[0016] According to various embodiments of the present disclosure, there is provided a non-transitory computer-readable medium storing one or more instructions, wherein the one or more instructions, when executed by one or more processors, cause the one or more processors to perform operations corresponding to the method performed by the first node according to various embodiments of the present disclosure.
[0017] According to various embodiments of the present disclosure, there is provided a non-transitory computer-readable medium storing one or more instructions, wherein the one or more instructions, when executed by one or more processors, cause the one or more processors to perform operations corresponding to the method performed by the second node according to various embodiments of the present disclosure.
[0018] In order to solve the above-described problems, the present disclosure can provide a method and apparatus for a radio access network (RAN) to recommend an alternative access point (AP) to a user equipment (UE) in a wireless communication system.
[0019] The accompanying drawings, which are included to provide a further understanding of the present disclosure and constitute a part of the detailed description, illustrate embodiments of the present disclosure and serve to explain technical features of the present disclosure together with the description. Technical features of the present disclosure are not limited to specific drawings, and features disclosed in each drawing can be combined with each other to form a new embodiment. Reference numerals in each drawing may denote structural elements.
[0020] FIG. 1 illustrates physical channels used in a system applicable to the present disclosure and an example of a general signal transmission method using the physical channels.
[0021] FIG. 2 illustrates an example of a structure of a radio frame used in a system applicable to the present disclosure.
[0022] FIG. 3 illustrates an example of a slot structure used in a system applicable to the present disclosure.
[0023] FIG. 4 illustrates an example of a slot structure of a radio frame used in a system applicable to the present disclosure.
[0024] FIG. 5 illustrates a data flow example in the 3GPP NR system.
[0025] FIG. 6 illustrates an example of the overall architecture of an NG-RAN to which technical features of the present disclosure can be applied.
[0026] FIG. 7 illustrates an interface protocol structure for F1-C to which technical features of the present disclosure can be applied.
[0027] FIG. 8 illustrates an example of a signaling procedure between a user equipment (UE) and an access point for establishing a connection in a wireless communication system.
[0028] FIG. 9 illustrates an example of a procedure for controlling access of a user equipment to an alternative access point based on congestion information and probabilistic access control in a wireless communication system.
[0029] FIG. 10 illustrates an example of a procedure for determining access of a user equipment to an alternative access point based on congestion conditions in a wireless communication system.
[0030] FIG. 11 illustrates an example of a procedure for dynamically updating access control parameters for a user equipment based on network congestion information in a wireless communication system.
[0031] FIG. 12 illustrates an example of a process of operating a first device in a system applicable to the present disclosure.
[0032] FIG. 13 illustrates an example of a process of operating a second device in a system applicable to the present disclosure.
[0033] FIG. 14 illustrates an example of a structure of a first device and a second device in a system applicable to the present disclosure.
[0034] In various embodiments of the present disclosure, "A or B" may mean "only A," "only B" or "both A and B." In other words, in various embodiments of the present disclosure, "A or B" may be interpreted as "A and / or B." For example, in various embodiments of the present disclosure, "A, B or C" may mean "only A," "only B," "only C" or "any combination of A, B and C."
[0035] A slash ( / ) or comma used in various embodiments of the present disclosure may mean "and / or." For example, "A / B" may mean "A and / or B." Hence, "A / B" may mean "only A," "only B" or "both A and B." For example, "A, B, C" may mean "A, B, or C."
[0036] In various embodiments of the present disclosure, "at least one of A and B" may mean "only A," "only B" or "both A and B." In addition, in various embodiments of the present disclosure, the expression of "at least one of A or B" or "at least one of A and / or B" may be interpreted in the same meaning as "at least one of A and B."
[0037] Further, in various embodiments of the present disclosure, "at least one of A, B, and C" may mean "only A," "only B," "only C" or "any combination of A, B and C." In addition, "at least one of A, B or C" or "at least one of A, B and / or C" may mean "at least one of A, B, and C."
[0038] Further, parentheses used in various embodiments of the present disclosure may mean "for example." Specifically, when "control information (PDCCH)" is described, "PDCCH" may be proposed as an example of "control information." In other words, "control information" in various embodiments of the present disclosure is not limited to "PDCCH," and "PDDCH" may be proposed as an example of "control information." In addition, even when "control information (i.e., PDCCH)" is described, "PDCCH" may be proposed as an example of "control information."
[0039] Technical features described individually in one drawing in various embodiments of the present disclosure may be implemented individually or simultaneously.
[0040] General Signal Transmission Method in 3GPP
[0041] Physical Channels and General Signal Transmission
[0042] FIG. 1 illustrates physical channels used in a system applicable to the present disclosure and an example of a general signal transmission method using the physical channels. More specifically, FIG. 1 illustrates physical channels and general signal transmission used in the 3GPP system.
[0043] FIG. 1 illustrates physical channels and general signal transmission used in the 3GPP system. In a wireless communication system, the UE receives information from the eNB through Downlink (DL) and the UE transmits information from the eNB through Uplink (UL). The information which the eNB and the UE transmit and receive includes data and various control information and there are various physical channels according to a type / use of the information which the eNB and the UE transmit and receive.
[0044] A UE that is powered on again while being powered off or enters a new cell performs an initial cell search operation such as synchronizing with a base station (BS) in S11. To this end, the UE receives a primary synchronization channel (PSCH) and a secondary synchronization channel (SSCH) from the base station to synchronize with the base station and acquires information such as a cell identity (ID), etc. Further, the UE may receive a physical broadcast channel (PBCH) from the base station and acquire in-cell broadcast information. The UE may receive a downlink reference signal (DL RS) in an initial cell search step to check a downlink channel state.
[0045] The UE that completes the initial cell search may receive a physical downlink control channel (PDCCH) and a physical downlink shared channel (PDSCH) corresponding to the PDCCH to acquire more detailed system information, in S12.
[0046] Next, the UE may perform a random access procedure in order to complete an access to the base station, in S13 to S16. Specifically, the UE may transmit a preamble on a physical random access channel (PRACH) in S13, and receive a random access response (RAR) for the preamble on the PDCCH and the PDSCH corresponding to the PDCCH in S14. Thereafter, the UE may transmit a physical uplink shared channel (PUSCH) using scheduling information within the RAR in S15, and perform a contention resolution procedure such as the PDCCH and the PDSCH corresponding to the PDCCH in S16.
[0047] Next, the UE that performs the above-described procedure may perform PDCCH / PDSCH reception S17 and PUSCH / physical uplink control channel (PUCCH) transmission S18, as a general uplink / downlink signal transmission procedure. Control information that the UE transmits to the base station is referred to as uplink control information (UCI). The UCI includes hybrid automatic repeat and request (HARQ) acknowledgement / negative ACK (ACK / NACK), scheduling request (SR), channel state information (CSI), etc. The CSI includes a channel quality indication (CQI), a precoding matrix indicator (PMI), a rank indicator (RI), etc. The UCI is generally transmitted on the PUCCH, but if control information and data need to be transmitted at the same time, the UCI may be transmitted on the PUSCH. The UE may aperiodically transmit the UCI on the PUSCH based on a request / indication of the network.
[0048] Orthogonal Frequency Division Multiplexing (OFDM) Numerology
[0049] A new RAT system uses an OFDM transmission scheme or a similar transmission scheme thereto. The new RAT system may follow different OFDM parameters from OFDM parameters of LTE. Alternatively, the new RAT system may follow numerology of existing LTE / LTE-A as it is but have a larger system bandwidth (e.g., 100 MHz). Alternatively, one cell may support a plurality of numerologies. In other words, UEs that operate with different numerologies may coexist in one cell.
[0050] Radio Frame Structure
[0051] FIG. 2 illustrates an example of a structure of a radio frame used in a system applicable to the present disclosure.
[0052] In NR, uplink and downlink transmission consists of frames. A radio frame has a length of 10 ms and is defined as two 5 ms half-frames (HFs). The half-frame is defined as five 1 ms subframes (SFs). The subframe is split into one or more slots, and the number of slots in the subframe depends on a subcarrier spacing (SCS). Each slot includes 12 or 14 OFDM(A) symbols depending on a cyclic prefix (CP). When a normal CP is used, each slot includes 14 symbols. When an extended CP is used, each slot includes 12 symbols. The symbol may include an OFDM symbol (or CP-OFDM symbol) and an SC-FDMA symbol (or DFT-s-OFDM symbol).
[0053] Table 1 shows that when the normal CP is used, the number of symbols per slot, the number of slots per frame, and the number of slots per subframe vary depending on the SCS.
[0054] SCS (15*2^u)NslotsymbNframe,uslotNsubframe,uslot15KHz (u=0)1410130KHz (u=1)1420260KHz (u=2)14404120KHz (u=3)14808240KHz (u=4)1416016
[0055] Nslotsymbis the number of symbols in the slot. Nframe,uslotis the number of slots in the frame. Nsubframe,uslotis the number of slots in the subframe.
[0056] Table 2 shows that when the extended CP is used, the number of symbols per slot, the number of slots per frame, and the number of slots per subframe vary depending on the SCS.
[0057] SCS (15*2^u)NslotsymbNframe,uslotNsubframe,uslot60KHz (u=2)12404
[0058] The NR supports multiple numerologies (or subcarrier spacing (SCS)) for supporting diverse 5G services. For example, when the SCS is 15 kHz, a wide area in traditional cellular bands is supported, when the SCS is 30 kHz / 60 kHz, dense-urban, lower latency, and wider carrier bandwidth are supported, and when the SCS is 60 kHz or more, a bandwidth larger than 24.25 GHz is supported to overcome phase noise. An NR frequency band may be defined as two types of frequency ranges (FR1 and FR2). Values of the frequency ranges may be changed, and, for example, the two types of frequency ranges (FR1 and FR2) may be as shown in Table 3 below. For convenience of description, among frequency ranges used in an NR system, FR1 may denote "sub 6GHz range", and FR2 may denote "above 6GHz range" and may be referred to as millimeter wave (mmW).
[0059] Frequency Range DesignationCorresponding Frequency RangeSubcarrier SpacingFR1450MHz - 6000MHz15, 30, 60kHzFR224250MHz - 52600MHz60, 120, 240kHz
[0060] As described above, the values of the frequency ranges in the NR system may be changed. For example, FR1 may include a frequency band from 410 MHz to 7125 MHz, as shown in Table 4 below. That is, FR1 may include a frequency band of 6 GHz (or 5850, 5900, 5925 MHz, etc.) or higher. For example, the frequency band of 6 GHz (or 5850, 5900, 5925 MHz, etc.) or higher included in FR1 mat include an unlicensed band. The unlicensed band may be used for diverse purposes, for example, used for communication for vehicles (e.g., self-driving).
[0061] Frequency Range DesignationCorresponding Frequency RangeSubcarrier SpacingFR1410MHz - 7125MHz15, 30, 60kHzFR224250MHz - 52600MHz60, 120, 240kHz
[0062] In the NR system, OFDM(A) numerology (e.g., SCS, CP length, etc.) may be differently configured between a plurality of cells merged into one UE. Hence, an (absolute time) duration of a time resource (e.g., SF, slot or TTI) (for convenience, collectively referred to as a time unit (TU)) consisting of the same number of symbols may be configured differently between the merged cells. FIG. 3 illustrates an example of a slot structure used in a system applicable to the present disclosure.
[0063] A slot includes a plurality of symbols in a time domain. For example, one slot includes 7 symbols in a normal CP, while one slot includes 6 symbols in an extended CP. A carrier includes a plurality of subcarriers in a frequency domain. A resource block (RB) is defined as a plurality of (e.g., 12) consecutive subcarriers in the frequency domain. A bandwidth part (BWP) is defined as a plurality of consecutive (P)RBs in the frequency domain and may correspond to one numerology (e.g., SCS, CP length, etc.). The carrier may include up to N (e.g., 5) BWPs. The data communication may be performed through an activated BWP, and only one BWP may be activated in one UE. In a resource grid, each element is referred to as a resource element (RE), and one complex symbol may be mapped to each RE.
[0064] FIG. 4 illustrates an example of a slot structure of a radio frame used in a system applicable to the present disclosure.
[0065] More specifically, FIG. 4 illustrates a slot structure of a frame of the NR system as an exemplary system.
[0066] As illustrated in FIG. 4, a frame structure of NR is characterized by a self-contained structure in which all of DL control channel, DL or UL data, UL control channel, etc. can be included in one slot. In this instance, DL data scheduling information, UL data scheduling information, etc. may be transmitted on the DL control channel, and ACK / NACK information for DL data, CSI information (modulation and coding scheme information, MIMO transmission related information, etc.), scheduling request, etc. may be transmitted on the UL control channel. In FIG. 4, a time gap for DL-to-UL or UL-to-DL switching may exist between a control region and a data region. Further, a part of the DL control channel / DL data / UL data / UL control channel may not be configured within one slot. Alternatively, order of the channels constituting one slot may vary. (e.g., DL control / DL data / UL control / UL data or UL control / UL data / DL control / DL data, etc.)
[0067] BACKGROUND
[0068] FIG. 5 illustrates a data flow example in the 3GPP NR system.
[0069] In FIG. 5, "RB" denotes a radio bearer, and "H" denotes a header. Radio bearers are categorized into two groups: data radio bearers (DRB) for user plane data and signalling radio bearers (SRB) for control plane data. The MAC PDU is transmitted / received using radio resources through the PHY layer to / from an external device. The MAC PDU arrives to the PHY layer in the form of a transport block.
[0070] In the PHY layer, the uplink transport channels UL-SCH and RACH are mapped to their physical channels PUSCH and PRACH, respectively, and the downlink transport channels DL-SCH, BCH and PCH are mapped to PDSCH, PBCH and PDSCH, respectively. In the PHY layer, uplink control information (UCI) is mapped to PUCCH, and downlink control information (DCI) is mapped to PDCCH. A MAC PDU related to UL-SCH is transmitted by a UE via a PUSCH based on an UL grant, and a MAC PDU related to DL-SCH is transmitted by a BS via a PDSCH based on a DL assignment.
[0071] FIG. 6 illustrates an example of the overall architecture of an NG-RAN to which technical features of the present disclosure can be applied.
[0072] Referring to FIG. 6, a gNB may include a gNB-CU (hereinafter, gNB-CU may be simply referred to as CU) and at least one gNB-DU (hereinafter, gNB-DU may be simply referred to as DU).
[0073] The gNB-CU is a logical node hosting RRC, SDAP and PDCP protocols of the gNB or an RRC and PDCP protocols of the en-gNB. The gNB-CU controls the operation of the at least one gNB-DU.
[0074] The gNB-DU is a logical node hosting RLC, MAC, and physical layers of the gNB or the en-gNB. The operation of the gNB-DU is partly controlled by the gNB-CU. One gNB-DU supports one or multiple cells. One cell is supported by only one gNB-DU.
[0075] The gNB-CU and gNB-DU are connected via an F1 interface. The gNB-CU terminates the F1 interface connected to the gNB-DU. The gNB-DU terminates the F1 interface connected to the gNB-CU. One gNB-DU is connected to only one gNB-CU. However, the gNB-DU may be connected to multiple gNB-CUs by appropriate implementation. The F1 interface is a logical interface. For NG-RAN, the NG and Xn-C interfaces for a gNB consisting of a gNB-CU and gNB-DUs, terminate in the gNB-CU. For E-UTRAN-NR dual connectivity (EN-DC), the S1-U and X2-C interfaces for a gNB consisting of a gNB-CU and gNB-DUs, terminate in the gNB-CU. The gNB-CU and connected gNB-DUs are only visible to other gNBs and the 5GC as a gNB.
[0076] Functions of the F1 interface includes F1 control (F1-C) functions as follows.
[0077] (1) F1 interface management function
[0078] The error indication function is used by the gNB-DU or gNB-CU to indicate to the gNB-CU or gNB-DU that an error has occurred.
[0079] The reset function is used to initialize the peer entity after node setup and after a failure event occurred. This procedure can be used by both the gNB-DU and the gNB-CU.
[0080] The F1 setup function allows to exchange application level data needed for the gNB-DU and gNB-CU to interoperate correctly on the F1 interface. The F1 setup is initiated by the gNB-DU.
[0081] The gNB-CU configuration update and gNB-DU configuration update functions allow to update application level configuration data needed between gNB-CU and gNB-DU to interoperate correctly over the F1 interface, and may activate or deactivate cells.
[0082] The F1 setup and gNB-DU configuration update functions allow to inform the single network slice selection assistance information (S-NSSAI) supported by the gNB-DU.
[0083] The F1 resource coordination function is used to transfer information about frequency resource sharing between gNB-CU and gNB-DU.
[0084] (2) System Information management function
[0085] Scheduling of system broadcast information is carried out in the gNB-DU. The gNB-DU is responsible for transmitting the system information according to the scheduling parameters available.
[0086] The gNB-DU is responsible for the encoding of NR master information block (MIB). In case broadcast of system information block type-1 (SIB1) and other SI messages is needed, the gNB-DU is responsible for the encoding of SIB1 and the gNB-CU is responsible for the encoding of other SI messages.
[0087] (3) F1 UE context management function
[0088] The F1 UE context management function supports the establishment and modification of the necessary overall UE context.
[0089] The establishment of the F1 UE context is initiated by the gNB-CU and accepted or rejected by the gNB-DU based on admission control criteria (e.g., resource not available).
[0090] The modification of the F1 UE context can be initiated by either gNB-CU or gNB-DU. The receiving node can accept or reject the modification. The F1 UE context management function also supports the release of the context previously established in the gNB-DU. The release of the context is triggered by the gNB-CU either directly or following a request received from the gNB-DU. The gNB-CU request the gNB-DU to release the UE Context when the UE enters RRC_IDLE or RRC_INACTIVE.
[0091] This function can be also used to manage DRBs and SRBs, i.e., establishing, modifying and releasing DRB and SRB resources. The establishment and modification of DRB resources are triggered by the gNB-CU and accepted / rejected by the gNB-DU based on resource reservation information and QoS information to be provided to the gNB-DU. For each DRB to be setup or modified, the S-NSSAI may be provided by gNB-CU to the gNB-DU in the UE context setup procedure and the UE context modification procedure.
[0092] The mapping between QoS flows and radio bearers is performed by gNB-CU and the granularity of bearer related management over F1 is radio bearer level. For NG-RAN, the gNB-CU provides an aggregated DRB QoS profile and QoS flow profile to the gNB-DU, and the gNB-DU either accepts the request or rejects it with appropriate cause value. To support packet duplication for intra-gNB-DU carrier aggregation (CA), one data radio bearer should be configured with two GPRS tunneling protocol (GTP)-U tunnels between gNB-CU and a gNB-DU.
[0093] With this function, gNB-CU requests the gNB-DU to setup or change of the special cell (SpCell) for the UE, and the gNB-DU either accepts or rejects the request with appropriate cause value.
[0094] With this function, the gNB-CU requests the setup of the secondary cell(s) (SCell(s)) at the gNB-DU side, and the gNB-DU accepts all, some or none of the SCell(s) and replies to the gNB-CU. The gNB-CU requests the removal of the SCell(s) for the UE.
[0095] (4) RRC message transfer function
[0096] This function allows to transfer RRC messages between gNB-CU and gNB-DU. RRC messages are transferred over F1-C. The gNB-CU is responsible for the encoding of the dedicated RRC message with assistance information provided by gNB-DU.
[0097] (5) Paging function
[0098] The gNB-DU is responsible for transmitting the paging information according to the scheduling parameters provided.
[0099] The gNB-CU provides paging information to enable the gNB-DU to calculate the exact paging occasion (PO) and paging frame (PF). The gNB-CU determines the paging assignment (PA). The gNB-DU consolidates all the paging records for a particular PO, PF and PA, and encodes the final RRC message and broadcasts the paging message on the respective PO, PF in the PA.
[0100] (6) Warning messages information transfer function
[0101] This function allows to cooperate with the warning message transmission procedures over NG interface. The gNB-CU is responsible for encoding the warning related SI message and sending it together with other warning related information for the gNB-DU to broadcast over the radio interface.
[0102] FIG. 7 illustrates an interface protocol structure for F1-C to which technical features of the present disclosure can be applied.
[0103] A transport network layer (TNL) is based on Internet protocol (IP) transport, comprising a stream control transmission protocol (SCTP) layer on top of the IP layer. An application layer signaling protocol is referred to as an F1 application protocol (F1AP).
[0104] PROBLEM DESCRIPTION
[0105] Recently, wireless communication systems have been evolving to support heterogeneous access environments in which a user equipment (UE) may access multiple types of communication networks, including terrestrial networks and non-3GPP or alternative access networks such as wireless local area networks (WLANs) or other access point (AP)-based systems. Such environments are expected to improve overall system performance by enabling traffic offloading and flexible access selection across multiple networks.
[0106] In particular, a UE may have multiple access options, including a first communication network (e.g., a cellular network) and a second communication network including one or more APs. Efficient selection among these access options is important to ensure balanced network utilization, reduced congestion, and improved quality of service. In existing systems, the UE may perform WLAN scanning and detection to discover available APs, and may identify whether a WLAN is trusted based on provisioned configuration, network selection policies, or information obtained through mechanisms such as access network query protocols or operator-provided credentials. Policy frameworks, such as access network discovery and selection functions or policy control mechanisms, may provide rules regarding preferred networks, access priorities, and interworking conditions.
[0107] Based on such information, the UE may perform a selection procedure by considering signal quality, network trust status, subscription conditions, and other parameters, and may subsequently establish connectivity through authentication procedures and session establishment. However, despite the existence of such procedures, the UE typically performs access decisions without sufficiently reflecting dynamic network conditions, such as load distribution or congestion levels across multiple APs.
[0108] In practical wireless communication environments, network conditions such as load, resource availability, and congestion levels may vary dynamically across different APs and across different parts of the network. For example, certain APs may be heavily loaded or may have limited available resources, while other APs may have sufficient capacity. Similarly, congestion may occur in a radio access network (RAN), for example, on a random access channel (RACH), even when a core network (CN) is not congested. In such cases, it may be desirable to offload traffic from the RAN to non-3GPP or alternative access networks. However, if multiple UEs are simultaneously redirected or independently attempt to access non-3GPP APs without coordination, the non-3GPP APs may become overcrowded, resulting in degraded performance in the alternative access network.
[0109] In such systems, a UE may still perform an access procedure without fully considering dynamic network conditions associated with multiple access networks. For example, a UE may attempt to perform a random access procedure toward a RAN even when the RACH is congested, or may attempt to connect to an AP without awareness of the load condition of the AP. Such behavior may lead to inefficient access distribution, increased collision probability in random access procedures, and suboptimal utilization of available network resources.
[0110] Furthermore, when multiple UEs independently attempt access without coordination, access attempts may become concentrated on specific network resources or specific APs, thereby further aggravating congestion. In particular, when UEs do not have guidance regarding which APs are preferable under current network conditions, the UEs may repeatedly select suboptimal access paths, resulting in degraded quality of experience (QoE) and increased signaling overhead.
[0111] Modern wireless communication systems are increasingly incorporating network intelligence and analytics functions, such as network data analytics functions, which are capable of collecting and analyzing various types of network information, including load conditions, congestion indicators, resource utilization, and performance statistics across different network elements. Based on such information, a network node may estimate network conditions and determine parameters for controlling access behavior of UEs.
[0112] However, existing systems do not provide sufficient mechanisms for a network node, such as a radio access network node, to obtain information regarding the number, distribution, and load conditions of non-3GPP access points and to use such information to determine appropriate access control parameters. In particular, there is a lack of mechanisms that allow the network node to determine and provide access probabilities for respective APs in a manner that prevents excessive concentration of UEs on specific APs.
[0113] Accordingly, there exists a need for mechanisms that enable a network node to determine access probabilities for respective APs based on network conditions, such as load, resource availability, congestion information, and characteristics of available non-3GPP access points, and to provide such information to a UE. By receiving such probability information, the UE may perform access decisions in a probabilistic and condition-aware manner by determining whether to access the first communication network or the second communication network based on congestion information and selecting among multiple APs based on the provided probabilities, for example, by determining whether to access the first communication network or the second communication network based on congestion information, and selecting among multiple APs based on the provided probabilities. In some embodiments, network analytics functions may be used in determining such access probabilities, thereby enabling more accurate and adaptive control based on aggregated network statistics. By leveraging such mechanisms, access attempts may be distributed more efficiently across available network resources, reducing congestion on both the RAN and the non-3GPP access network and improving overall system performance.
[0114] DETAILED DESCRIPTION
[0115] In a wireless communication system, a user equipment (UE) may access multiple communication networks including a first communication network and a second communication network including one or more access points (APs). In order to improve efficiency of such multi-access environments, a radio access network (RAN) may collect and analyze network status information, including load conditions, resource utilization, and congestion indicators, optionally with assistance from a network data analytics function.
[0116] In some embodiments, the system information may further include information indicating a number of available access points (APs) of the second communication network. Such information may assist the UE in identifying a set of candidate APs and correctly interpreting the probability information, for example, by mapping probability values to respective APs or determining a valid probability distribution over the candidate APs. In this manner, the UE may perform access selection in a consistent and implementation-feasible manner based on the provided probability information.
[0117] Accordingly, the present disclosure proposes a method in which the RAN determines access probabilities for respective APs of the second communication network based on network conditions and provides probability information to the UE via system information. The UE may determine, based on congestion information, whether to perform a random access procedure for the first communication network or to access the second communication network, and may select one of a plurality of APs of the second communication network based on the probability information. Through such probabilistic and condition-aware access control, access attempts may be distributed across available resources in a balanced manner, thereby reducing congestion and improving communication efficiency.
[0118] In order to further describe operational scenarios of the present disclosure, it is assumed that a UE operates within coverage of a first communication network, such as a 3GPP system including a 5G system or a next-generation communication system, and attempts to initiate a communication service by performing a random access procedure toward a RAN. When a random access channel (RACH) is congested, even if a core network (CN) is not congested, the UE may experience a significant delay before successfully completing the random access procedure.
[0119] In particular, UEs in an idle state that are willing to transmit data or are prepared to receive data may be unable to promptly access the network due to congestion on the RACH. This may lead to increased access delay, reduced service responsiveness, and degraded user experience. Under such circumstances, it may be beneficial for the UE to utilize alternative access options that allow the UE to access network resources without relying solely on the RAN.
[0120] For example, when one or more non-3GPP access networks, such as wireless local area networks (WLANs), are available, the UE may have an opportunity to access the CN resources through such non-3GPP access networks. In particular, when a trusted WLAN is available, the UE may be able to establish connectivity to the CN through the trusted WLAN, thereby bypassing congestion in the RAN. This may enable more efficient utilization of network resources and reduce access delay.
[0121] However, when multiple UEs attempt to utilize non-3GPP access networks simultaneously, for example, when a large number of UEs are redirected or independently select nearby access points (APs), congestion may also occur at the non-3GPP access networks. In such a case, the UEs may experience delays in associating with APs, resulting in a similar or even worse level of performance degradation compared to accessing the RAN.
[0122] Accordingly, it is desirable to provide a mechanism in which a network can adaptively control access behavior of UEs across multiple access networks, including both 3GPP and non-3GPP access networks. In particular, it may be advantageous to control access parameters associated with non-3GPP access, such as access probabilities or selection parameters for multiple APs, in a manner that prevents excessive concentration of UEs on specific APs while efficiently utilizing available network resources.
[0123] In modern wireless communication systems, various network entities may be involved in monitoring and analyzing network conditions, including congestion status and resource utilization. For example, a network data analytics function may collect and analyze information from multiple network elements, including the RAN and user plane functions, to derive insights regarding network load, traffic patterns, and potential congestion situations. Based on such analysis, the network data analytics function may provide analytics information to other network functions to support congestion mitigation and resource optimization.
[0124] In addition, an access and mobility management function may manage registration, connection, and mobility of UEs and may receive information related to load conditions and congestion from the RAN. Based on such information, the access and mobility management function may initiate control actions, such as restricting access attempts or guiding UEs toward less congested access paths.
[0125] Furthermore, the RAN itself may monitor various indicators related to resource utilization, buffer status, and channel conditions, and may detect congestion conditions at the radio level. Upon detecting congestion, the RAN may provide information to other network entities and may participate in determining appropriate access control parameters.
[0126] In some cases, an application-related function may also receive network status information and adapt service behavior or quality requirements based on congestion conditions, thereby contributing to overall system efficiency.
[0127] Through cooperation among such network entities, a communication system may obtain comprehensive awareness of network congestion conditions across multiple domains. In particular, network entities responsible for analytics and radio access control may play a significant role in detecting congestion situations and enabling appropriate control mechanisms.
[0128] Motivated by the above considerations, it is advantageous to provide a mechanism in which a network determines access control parameters for non-3GPP access based on network conditions, including congestion information associated with both 3GPP and non-3GPP access networks. By adaptively adjusting such parameters, even when multiple access points are available in proximity to a UE, the network may distribute access attempts across available resources in a balanced manner, thereby reducing access delay, preventing congestion in specific access points, and improving overall communication efficiency.
[0129] Based on the above-described considerations, various procedures for connection establishment and access control are described with reference to the accompanying drawings.
[0130]
[0131] FIG. 8 illustrates an example of a signaling procedure between a user equipment (UE) and an access point for establishing a connection in a wireless communication system.
[0132] In this context, the procedure shown in FIG. 8 may represent a connection establishment process between the UE and a non-3GPP access point, such as a wireless local area network (WLAN) access point, which may be utilized as an alternative access path to a core network.
[0133] Referring to FIG. 8, the UE and the access point (AP) may perform a sequence of signaling procedures including scanning, authentication, association, and data transfer. Although FIG. 8 illustrates a specific order of operations, it should be understood that one or more steps may be omitted, combined, or reordered according to implementation or system configuration.
[0134] In step 1, the UE may perform a scanning procedure to discover one or more available APs. The scanning procedure may include at least one of active scanning or passive scanning. In active scanning, the UE may transmit probe request messages and receive probe response messages from nearby APs. In passive scanning, the UE may receive beacon signals periodically broadcast by the APs. Through the scanning procedure, the UE may obtain information related to the APs, such as service set identifiers (SSIDs), signal strength indicators, supported capabilities, security configurations, and network identifiers. In some embodiments, the UE may further determine whether a detected AP corresponds to a trusted access network based on pre-configured information, subscription credentials, or network-provided policies.
[0135] In step 2, the UE and the AP may perform an authentication procedure. Specifically, the UE may transmit an authentication request message to the AP, and the AP may transmit an authentication response message to the UE. The authentication procedure may be performed using one or more authentication mechanisms, including but not limited to open system authentication, shared key authentication, or authentication protocols based on extensible authentication protocols (EAP), such as EAP-SIM, EAP-AKA, or EAP-TTLS. In some embodiments, the authentication procedure may involve interaction with an authentication server or a core network entity to verify credentials of the UE. Successful completion of the authentication procedure may allow the UE to proceed to a subsequent association procedure.
[0136] In step 3, the UE and the AP may perform an association procedure. The UE may transmit an association request message to the AP, and the AP may transmit an association response message to the UE. The association request message may include capability information of the UE, supported data rates, security parameters, and other configuration information. The association response message may include acceptance or rejection of the association request and may further include configuration parameters assigned to the UE, such as association identifiers (AIDs) or quality of service (QoS) parameters. Upon successful association, the UE may be considered logically connected to the AP.
[0137] After the association procedure, the UE and the AP may perform data transfer. The data transfer may include uplink and downlink transmission of user data, control signaling, or both. In some embodiments, the UE may further establish an Internet Protocol (IP) connection, obtain an IP address, and access services provided by a core network through the AP. When the AP is associated with a trusted non-3GPP access network, the UE may access core network services without requiring additional secure tunneling procedures. In other embodiments, additional procedures such as session establishment or bearer configuration may be performed after association.
[0138] The connection establishment procedure illustrated in FIG. 8 may serve as a basic access mechanism that can be utilized when a UE accesses a non-3GPP access network. In particular, when congestion occurs in a radio access network, such as congestion on a random access channel, the UE may utilize the procedure illustrated in FIG. 8 to establish a connection with an AP and access network resources through the non-3GPP access network.
[0139] In some embodiments, the UE may select a specific AP based on one or more selection criteria, including signal strength, load condition, access restrictions, subscription information, or network-provided parameters. In particular, the UE may receive information related to access control, such as access probabilities or priority indicators associated with multiple APs, from a network node. Based on such information, the UE may determine whether to attempt association with a particular AP or to defer access.
[0140] Furthermore, the procedure illustrated in FIG. 8 may be selectively initiated and controlled in conjunction with access control mechanisms proposed in the present disclosure. For example, prior to performing scanning, authentication, or association with a particular AP, the UE may determine, based on probability information, whether to select an AP and initiate a connection establishment procedure with the selected AP. The probability information may be provided by a network node and may reflect network conditions including congestion levels of a radio access network, congestion conditions of a core network, and load conditions of available APs.
[0141] In some embodiments, the UE may generate a random value and compare the random value with a received probability value to determine whether to proceed with the connection establishment procedure. When the random value satisfies a predetermined condition relative to the probability value, the UE may proceed with the scanning, authentication, and association procedures as illustrated in FIG. 8. Otherwise, the UE may defer access or select another AP.
[0142] In addition, the network node may dynamically update access control parameters associated with the APs based on network conditions, and the UE may adapt its access behavior accordingly. Through such mechanisms, access attempts of multiple UEs may be distributed across multiple APs in a balanced manner, thereby preventing excessive congestion at specific APs and improving overall network efficiency.
[0143] Accordingly, the signaling procedure illustrated in FIG. 8 may be interpreted not only as a basic connection establishment procedure but also as a component of a broader access control framework in which the initiation and execution of each step may be influenced by network-provided control parameters. Through integration of such mechanisms, efficient utilization of both 3GPP and non-3GPP access networks may be achieved.
[0144]
[0145] FIG. 9 illustrates an example of a procedure for controlling access of a user equipment to an alternative access point based on congestion information and probabilistic access control in a wireless communication system.
[0146] In the present disclosure, the term "alternative access point" may refer to an access point that is not part of a primary cellular radio access network, and may include, for example, a non-3GPP access point such as a wireless local area network (WLAN) access point.
[0147] Referring to FIG. 9, the procedure may involve a UE, one or more access points (APs) associated with a non-3GPP access network such as a wireless local area network (WLAN), a radio access network (RAN) including a base station (e.g., gNB), and one or more core network entities, such as a network data analytics function (NWDAF), an access and mobility management function (AMF), a user plane function (UPF), and a policy control function (PCF). The procedure illustrated in FIG. 9 may enable system-level generation, distribution, and application of probabilistic access control parameters for UE access across heterogeneous networks based on dynamically obtained congestion information.
[0148] In an initial phase, the RAN and / or one or more core network entities may collect and generate congestion-related information. For example, the RAN may monitor radio resource utilization, buffer status, and channel conditions to determine congestion levels associated with a random access channel (RACH). In parallel, the UE, the RAN, and / or the APs may generate and report access delay statistics associated with both 3GPP access and non-3GPP access. Such statistics may include, for example, information related to UE location, time, experienced access delay, identifiers of candidate APs, and historical association performance.
[0149] The collected information may be provided to a network analytics entity, such as the NWDAF. The NWDAF may aggregate and analyze the received information, including load levels, resource utilization patterns, congestion indicators from the RAN, and delay statistics associated with both 3GPP and non-3GPP access. Based on such analysis, the NWDAF may derive analytics and insights for congestion mitigation and access optimization.
[0150] The analytics information generated by the NWDAF may be provided to one or more control entities, such as the PCF and / or the AMF. Based on the received analytics information, the PCF and / or the AMF may determine access control parameters associated with both 3GPP and non-3GPP access. In particular, the PCF may determine congestion indicators for the RACH and may further determine a probability vector associated with multiple non-3GPP APs. The probability vector may include, for example, individual probability values corresponding to respective APs, indicating a likelihood that the UE is allowed or recommended to attempt access to each AP.
[0151] In some embodiments, the access control parameters may be transmitted to the RAN, and the RAN may broadcast or provide the parameters to UEs through system information signaling, such as system information blocks (SIBs). For example, the RAN may transmit a system information message including a non-3GPP access probability vector associated with one or more APs.
[0152] Upon receiving the system information, the UE may store and interpret the access control parameters. The UE may then evaluate congestion conditions of the RACH and / or the core network based on the received information. In some embodiments, the UE may determine whether the core network is congested and whether the RACH is congested based on the received indicators.
[0153] When the UE determines that the core network is congested, the UE may defer access attempts and wait for further instructions or updated system information. When the UE determines that the core network is not congested but the RACH is congested, the UE may consider accessing the network through a non-3GPP access network.
[0154] In such a case, the UE may perform a discovery procedure to identify one or more candidate APs. The UE may then apply probabilistic access control based on the received probability vector. For example, the UE may generate a random value and compare the random value with one or more probability values associated with respective APs. Based on the comparison result, the UE may determine whether to attempt association with a particular AP.
[0155] In some embodiments, the UE may select an AP based on both the probability vector and additional criteria, such as signal strength, trust status, or subscription information. The UE may then perform an association procedure with the selected AP and may subsequently transmit and receive user plane data through the non-3GPP access network.
[0156] Alternatively, when the UE determines that the RACH is not congested, the UE may perform a random access procedure toward the RAN and may transmit and receive user plane data through the 3GPP access network.
[0157] After performing access through either the 3GPP access network or the non-3GPP access network, the UE and / or the network entities may continue to collect and report access delay statistics and congestion-related information. Such information may be fed back to the NWDAF and other network entities, thereby enabling continuous and dynamic updating of access control parameters.
[0158] In some embodiments, the probability vector associated with the APs may be dynamically updated based on time-varying network conditions, spatial distribution of UEs, historical access performance, or load balancing requirements. The updated parameters may be periodically or event-triggered transmitted to the UE, enabling adaptive control of access behavior.
[0159] The procedure illustrated in FIG. 9 may provide a mechanism for distributing access attempts of multiple UEs across multiple access networks in a balanced and efficient manner. By incorporating probabilistic access control based on congestion information, the system may prevent excessive concentration of UEs on specific APs, reduce access delay, and improve overall resource utilization.
[0160] Furthermore, the procedure may be implemented in various forms. For example, the probability vector may be defined per AP, per group of APs, per geographical region, or per service type. In some embodiments, different probability vectors may be provided for different categories of UEs or different quality of service (QoS) requirements.
[0161] In addition, the access control mechanism described with reference to FIG. 9 may be combined with other control mechanisms, such as access barring, priority-based access control, or network slicing-based policies. The UE may jointly consider multiple control parameters when determining access behavior.
[0162] Accordingly, the procedure illustrated in FIG. 9 may support flexible and adaptive access control across heterogeneous networks, enabling efficient coordination between 3GPP access and non-3GPP access and improving overall system performance in the presence of dynamic congestion conditions.
[0163]
[0164] FIG. 10 illustrates an example of a procedure for determining access of a user equipment to an alternative access point based on congestion conditions in a wireless communication system.
[0165] Referring to FIG. 10, the illustrated procedure may involve a user equipment (UE), one or more access points (APs) associated with a non-3GPP access network such as a wireless local area network (WLAN), a radio access network (RAN) including a base station (e.g., gNB), and one or more core network entities, such as a network data analytics function (NWDAF), an access and mobility management function (AMF), a user plane function (UPF), and a policy control function (PCF). The procedure of FIG. 10 may focus on a UE-side decision-making process for selecting between 3GPP access and non-3GPP access based on congestion conditions of multiple network domains and, in some embodiments, probability information associated with candidate APs.
[0166] In an initial stage, the UE may receive system information from the RAN, such as system information blocks (SIBs), including parameters associated with congestion status of a random access channel (RACH) and / or congestion status of a core network (CN). In some embodiments, the system information may further include parameters related to non-3GPP access, such as identifiers of candidate APs, access conditions, or indicators associated with non-3GPP access availability.
[0167] The UE may analyze the received system information to determine congestion conditions. For example, the UE may determine whether the core network is congested based on one or more CN congestion indicators included in the system information. When the UE determines that the core network is congested, the UE may refrain from initiating access procedures and may enter a waiting status until further instructions or updated system information are received.
[0168] When the UE determines that the core network is not congested, the UE may proceed to determine whether the RACH is congested. The determination may be performed based on one or more RACH congestion indicators included in the system information or based on locally observed conditions, such as access failure rates or backoff information.
[0169] When the UE determines that the RACH is not congested, the UE may perform a random access procedure toward the RAN, for example, by transmitting a preamble to a base station (gNB), receiving a response, and completing connection establishment. After successful completion of the random access procedure, the UE may transmit and receive user plane data through the 3GPP access network.
[0170] On the other hand, when the UE determines that the RACH is congested while the core network is not congested, the UE may consider accessing the network through a non-3GPP access network. In such a case, the UE may perform a discovery procedure to identify one or more candidate APs. The discovery procedure may include scanning operations, such as active or passive scanning, to detect available WLAN APs.
[0171] After identifying candidate APs, the UE may perform an association procedure with a selected AP. The selection of the AP may be based on one or more criteria, including signal strength, trust status, subscription information, access restrictions, or other policy-based conditions. In some embodiments, the UE may prioritize APs that are identified as trusted or that are associated with the operator network.
[0172] Upon successful association with the AP, the UE may transmit and receive user plane data through the non-3GPP access network. In some embodiments, the UE may access core network services through the AP, for example, via a trusted non-3GPP access interface.
[0173] In addition to performing access procedures, the UE and / or network entities may collect and report information related to access performance. For example, the UE may generate and transmit access delay statistics associated with both 3GPP and non-3GPP access. The statistics may include information such as UE location, time of access, identifiers of APs, experienced delays, and success or failure of access attempts.
[0174] The collected information may be provided to network entities such as the NWDAF, which may analyze the information to derive congestion-related insights. Based on such analysis, the network may update congestion indicators and access control parameters, which may be subsequently transmitted to UEs through system information.
[0175] In some embodiments, the decision-making procedure illustrated in FIG. 10 may be combined with probabilistic access control mechanisms. For example, when multiple APs are available, the UE may further determine whether to attempt association with a specific AP based on probability values associated with respective APs. Such probability values may be provided by the network and may reflect load balancing considerations and congestion conditions.
[0176] In some embodiments, the UE may generate a random value and compare the random value with a probability value associated with a particular AP to determine whether to initiate an association procedure with the particular AP. Alternatively, the UE may select among multiple APs based on a weighted probability distribution.
[0177] The procedure illustrated in FIG. 10 may provide a hierarchical decision structure in which the UE first determines whether to access the network through a 3GPP access network or a non-3GPP access network based on congestion conditions, and then determines specific access actions within the selected network.
[0178] Furthermore, the decision logic may be extended to support additional conditions. For example, the UE may consider service type, quality of service (QoS) requirements, application requirements, mobility state, or energy consumption constraints when determining access. In some embodiments, different decision criteria may be applied for different types of services or different categories of UEs.
[0179] In addition, the decision procedure may be dynamically adapted based on updated network conditions. For example, the UE may periodically re-evaluate congestion conditions and may switch between 3GPP access and non-3GPP access when conditions change.
[0180] Accordingly, the procedure illustrated in FIG. 10 may enable the UE to make informed and adaptive access decisions based on congestion conditions of multiple network domains, thereby reducing access delay, avoiding congested resources, and improving overall system performance.
[0181]
[0182] FIG. 11 illustrates an example of a procedure for dynamically updating access control parameters for a user equipment based on network congestion information in a wireless communication system.
[0183] Referring to FIG. 11, the illustrated procedure may involve a user equipment (UE), one or more access points (APs) associated with a non-3GPP access network such as a wireless local area network (WLAN), a radio access network (RAN) including a base station (e.g., gNB), and one or more core network entities, including a network data analytics function (NWDAF), an access and mobility management function (AMF), a user plane function (UPF), and a policy control function (PCF). The procedure shown in FIG. 11 may enable continuous and adaptive optimization of access control parameters by utilizing feedback from network conditions and UE access performance.
[0184] In an initial phase, the UE, the RAN, and / or the non-3GPP access network may collect and report access-related performance information. For example, the UE may generate access delay statistics associated with both 3GPP access and non-3GPP access. The statistics may include information such as UE location, time of access attempts, identifiers of WLAN APs, experienced delays, success or failure rates of access attempts, and throughput performance.
[0185] The collected information may be transmitted to one or more network entities, such as the NWDAF. In addition, the RAN and the core network entities (e.g., UPF and AMF) may provide congestion-related information, including load levels, resource utilization, traffic patterns, and congestion indicators associated with the RACH and the core network.
[0186] The NWDAF may aggregate the received information and perform analytics to derive insights related to network congestion and access performance. For example, the NWDAF may analyze correlations between UE location and congestion levels, temporal variations of network load, success rates of access attempts, and performance differences between 3GPP access and non-3GPP access.
[0187] Based on the analytics results, the NWDAF may generate updated congestion-related information and provide the information to control entities such as the PCF and / or the AMF. The provided information may include recommendations or policies for congestion mitigation and access control.
[0188] The PCF and / or the AMF may determine updated access control parameters based on the analytics information. In particular, the PCF may determine updated congestion indicators for the RACH and the core network, and may further determine an updated probability vector associated with non-3GPP access. The probability vector may include probability values corresponding to respective APs, reflecting updated network conditions and load balancing objectives.
[0189] In some embodiments, the updated probability vector may be determined based on updated congestion information, including congestion statuses of a core network and a random access channel.
[0190] The updated access control parameters may be transmitted to the RAN, which may update system information accordingly. For example, the RAN may update system information, including one or more system information blocks (SIBs), to include updated non-3GPP access probability vectors and congestion indicators.
[0191] The updated system information may be broadcast to UEs. Upon receiving the updated system information, the UE may update its internal access control parameters and may re-evaluate access decisions based on the updated information.
[0192] In some embodiments, the UE may periodically or event-triggeredly re-evaluate congestion conditions and access parameters. For example, the UE may trigger re-evaluation when a significant change in network conditions is detected, when updated system information is received, or when an access attempt fails.
[0193] Based on the updated parameters, the UE may adjust its access behavior. For example, when congestion in the RACH increases, the UE may increase the likelihood of selecting non-3GPP access based on the updated probability vector. Conversely, when congestion decreases, the UE may prefer 3GPP access.
[0194] In some embodiments, the dynamic update procedure may form a closed-loop control system. The UE behavior influenced by updated parameters may affect network load, which may be measured and reported back to the network. The network may then update access control parameters again based on the new measurements, thereby continuously optimizing system performance. Such updating may be performed periodically, event-triggeredly, in response to an access failure, or in response to a detected performance degradation.
[0195] In addition, the update of access control parameters may be performed at different granularities. For example, parameters may be updated per AP, per geographical region, per time interval, or per service type. In some embodiments, different parameter sets may be provided for different categories of UEs or different quality of service (QoS) requirements.
[0196] In some embodiments, machine learning techniques may be applied in the NWDAF to predict future congestion conditions and proactively adjust access control parameters. For example, predictive models may estimate future load based on historical data and may determine probability vectors that minimize expected congestion.
[0197] Furthermore, the dynamic update procedure may be combined with other access control mechanisms, such as access barring, priority-based access control, or network slicing-based policies. The UE may consider multiple parameters jointly when determining access behavior.
[0198] Accordingly, the procedure illustrated in FIG. 11 may enable continuous, adaptive, and intelligent optimization of access control parameters based on real-time and historical network conditions. This may result in improved load balancing, reduced access delay, enhanced user experience, and more efficient utilization of network resources.
[0199]
[0200] Advantageous Effects
[0201] According to various embodiments of the present disclosure, the present disclosure provides a mechanism in which a network node determines access probabilities for a plurality of access points (APs) based on network conditions and provides probability information to a user equipment (UE), thereby enabling the UE to perform probabilistic and condition-aware access control across heterogeneous networks including 3GPP access and non-3GPP access. By distributing access attempts based on the provided probability information, the disclosed technique reduces excessive concentration of UEs on specific access points and improves overall resource utilization efficiency.
[0202] According to various embodiments of the present disclosure, the present disclosure provides practical and technical advantageous effects by enabling the UE to perform access selection based on both deterministic congestion indicators and probabilistic access control parameters. Specifically, the UE may determine whether to access a 3GPP network or a non-3GPP network based on congestion conditions of a random access channel (RACH) and a core network, and may further determine whether to attempt access to a particular access point (AP) based on a probability vector associated with multiple APs. This mechanism prevents excessive concentration of UEs on specific access nodes, thereby mitigating congestion and improving load balancing across the network.
[0203] In addition, the disclosed technique enables intelligent and distributed access control without requiring centralized enforcement of access decisions. By providing probability-based access control parameters to UEs, the network allows each UE to independently determine access behavior in a stochastic manner. Such decentralized control reduces signaling overhead and avoids synchronization issues that may arise in centralized access control schemes, while still achieving effective load distribution across multiple access networks.
[0204] Furthermore, the present disclosure enables continuous and adaptive optimization of access control parameters through a feedback-based mechanism. For example, access delay statistics, congestion indicators, and performance metrics associated with both 3GPP and non-3GPP access may be collected from UEs and network entities and provided to a network analytics function, such as a Network Data Analytics Function (NWDAF). Based on analysis of the collected information, the network may dynamically update congestion indicators and probability vectors, and may provide updated parameters to UEs through system information signaling. This closed-loop control mechanism allows the system to continuously adapt to changing network conditions and user distributions.
[0205] In some embodiments, the disclosed technique enables predictive and proactive access control by utilizing advanced analytics or machine learning techniques. For example, the network may predict future congestion conditions based on historical data and temporal patterns, and may adjust access control parameters in advance to prevent congestion. Such predictive capabilities further enhance system stability and performance under dynamic and high-load scenarios.
[0206] In addition, the disclosed technique supports flexible implementation across various network architectures and deployment scenarios. For example, the access control parameters may be delivered through system information broadcasting, dedicated signaling, or policy-based control mechanisms. The disclosed method may be applied to 3GPP access networks, non-3GPP access networks, integrated access and backhaul systems, and future-generation communication systems. Furthermore, the mechanism may be extended to support different service types, quality of service (QoS) requirements, or user categories.
[0207] Accordingly, the present disclosure improves network performance, access reliability, and user experience by enabling adaptive, probabilistic, and feedback-driven access control across heterogeneous networks. By distributing access attempts based on congestion conditions and dynamically updating access parameters, the disclosed technique reduces access delay, prevents network overload, enhances resource utilization efficiency, and provides a scalable solution for next-generation wireless communication systems.
[0208] According to various embodiments of the present disclosure, probabilistic access control further enables distributed and scalable load balancing without requiring centralized scheduling or strict coordination among UEs. By allowing each UE to independently determine access behavior based on probability information, the system reduces synchronized access attempts and lowers the likelihood of congestion collapse. Accordingly, the probabilistic mechanism provides a robust alternative to deterministic access control in dynamic network environments.
[0209]
[0210] [Description of claims related to a first node (UE)]
[0211] Below, the above-described embodiments are described in detail from a perspective of an operation of a first node with reference to FIG. 12. Methods to be described below are merely distinguished for convenience of explanation. Thus, as long as the methods are not mutually exclusive, it is obvious that partial configuration of any method can be substituted or combined with partial configuration of another method.
[0212] FIG. 12 illustrates an example of an operation process of a first node in a system applicable to the present disclosure.
[0213] A first node may be a user equipment (UE). A second node may be a radio access network (RAN).
[0214] In step S1210, the first node receives, from a second node, system information including probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network.
[0215] In step S1220, the first node determines, based on congestion information included in the system information, whether to perform a random access procedure for a first communication network associated with the second node or to access the second communication network.
[0216] In step S1230, the first node selects, based on the respective access probability values and based on determining to access the second communication network, one of the plurality of APs of the second communication network.
[0217] In step S1240, the first node transmits, to the second node, a first message for the random access procedure based on determining to perform the random access procedure.
[0218] According to various embodiments of the present disclosure, the second node determines the respective access probability values based on a load status or available resources of each of the plurality of APs. The probability information includes an access probability vector including the respective access probability values for the plurality of APs of the second communication network.
[0219] According to various embodiments of the present disclosure, the system information includes information indicating a number of available APs of the second communication network.
[0220] According to various embodiments of the present disclosure, the access probability vector includes the respective access probability values for the plurality of APs. Each of the respective access probability values is compared with a random value generated by the first node. The first node selects one of the plurality of APs based on a result of the comparison.
[0221] According to various embodiments of the present disclosure, the congestion information includes information indicating a congestion status of a core network (CN) associated with the second node and a congestion status of a random access channel (RACH). The second node determines the congestion information based on analytics information related to the core network and the random access channel, the analytics information being received from a network data analytics function (NWDAF).
[0222] According to various embodiments of the present disclosure, the congestion information includes information indicating that the core network is not congested and the random access channel is congested.
[0223] According to various embodiments of the present disclosure, the second node determines the respective access probability values based on congestion statuses of a core network and a random access channel.
[0224] According to various embodiments of the present disclosure, the first node may further perform adaptive access control by dynamically adjusting a decision threshold used for comparing the access probability with the random value. For example, the first node may adjust the threshold based on at least one of a service type, a quality of service (QoS) requirement, a traffic priority, a battery status of the first node, or a mobility status. Accordingly, even when the access probability vector is provided by the second node, the first node may fine-tune its access decision behavior in a context-aware manner, thereby improving service continuity and resource utilization efficiency under diverse operating conditions.
[0225] According to various embodiments of the present disclosure, the first node may maintain historical access performance information associated with each of the plurality of APs and may use the historical information to influence access decision-making. For example, the first node may store information indicating previous access success rates, experienced delays, throughput levels, or connection stability for each AP. The first node may combine the access probability vector received from the second node with the locally stored historical information to determine a weighted access probability for each AP. This allows the first node to perform more reliable and optimized access selection by considering both network-provided information and locally observed performance characteristics.
[0226] According to various embodiments of the present disclosure, the first node may support a learning-based access control mechanism. For example, the first node may apply a machine learning model to predict an expected access performance for each AP based on input features including congestion information, access probability values, signal strength, and historical performance metrics. Based on the prediction results, the first node may determine whether to perform the random access procedure for the first communication network or to attempt access to the second communication network. Such a learning-based mechanism enables the first node to proactively adapt to dynamic network environments and further enhances the effectiveness of congestion-aware access control.
[0227] According to various embodiments of the present disclosure, the first node may further transmit information related to access performance to the second node. The information may include at least one of access success or failure, experienced delay, throughput, or connection stability associated with the plurality of APs. The second node may use the received information to update the access probability vector. Accordingly, a feedback loop may be established between the first node and the second node, enabling continuous refinement of access probability based on actual access performance. Such feedback-based refinement may be performed periodically, event-triggeredly, or in response to an access failure or performance degradation.
[0228] According to various embodiments of the present disclosure, there is provided a first node in a wireless communication system. The first node may comprise a transceiver, at least one processor, and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the first node to perform operations corresponding to the method performed by the first node according to various embodiments of the present disclosure.
[0229] According to various embodiments of the present disclosure, there is provided a control apparatus for controlling a first node in a wireless communication system. The control apparatus may comprise at least one processor and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform the method performed by the first node according to various embodiments of the present disclosure.
[0230] According to various embodiments of the present disclosure, there is provided a non-transitory computer-readable medium storing one or more instructions. The one or more instructions, when executed by one or more processors, cause the one or more processors to perform the method performed by the first node according to various embodiments of the present disclosure.
[0231]
[0232] [Description of claims related to a second node (RAN)]
[0233] Below, the above-described embodiments are described in detail from a perspective of an operation of a second node with reference to FIG. 13. Methods to be described below are merely distinguished for convenience of explanation. Thus, as long as the methods are not mutually exclusive, it is obvious that partial configuration of any method can be substituted or combined with partial configuration of another method.
[0234] FIG. 13 illustrates an example of an operation process of a second node in a system applicable to the present disclosure.
[0235] A first node may be a user equipment (UE). A second node may be a radio access network (RAN).
[0236] In step S1310, the second node determines congestion information indicating a congestion status of a first communication network.
[0237] In step S1320, the second node determines, based on the congestion information, probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network.
[0238] In step S1330, the second node transmits, to a first node, system information including the congestion information and the probability information.
[0239] In step S1340, the second node receives, from the first node, a first message for a random access procedure based on the first node determining to perform the random access procedure.
[0240] According to various embodiments of the present disclosure, the second node determines the respective access probability values based on a load status or available resources of each of the plurality of APs. The probability information includes an access probability vector including the respective access probability values for the plurality of APs of the second communication network.
[0241] According to various embodiments of the present disclosure, the system information includes information indicating a number of available APs of the second communication network.
[0242] According to various embodiments of the present disclosure, the access probability vector includes the respective access probability values for the plurality of APs. The first node compares each of the respective access probability values with a random value generated by the first node. The first node selects one of the plurality of APs based on a result of the comparison.
[0243] According to various embodiments of the present disclosure, the congestion information includes information indicating a congestion status of a core network (CN) associated with the second node and a congestion status of a random access channel (RACH). The second node determines the congestion information based on analytics information related to the core network and the random access channel, the analytics information being received from a network data analytics function (NWDAF).
[0244] According to various embodiments of the present disclosure, the congestion information includes information indicating that the core network is not congested and the random access channel is congested.
[0245] According to various embodiments of the present disclosure, the second node determines the respective access probability values based on congestion statuses of a core network and a random access channel.
[0246] According to various embodiments of the present disclosure, the second node may further perform adaptive generation of the access probability by dynamically adjusting probability values based on context information associated with the first node. For example, the second node may determine the access probability by considering at least one of a service type, a quality of service (QoS) requirement, a traffic priority, a mobility status, or a capability of the first node. Accordingly, the second node may provide differentiated access probability vectors tailored to individual UEs or UE groups, thereby enabling more efficient and context-aware load balancing across the plurality of APs.
[0247] According to various embodiments of the present disclosure, the second node may determine the access probability based on historical access performance information associated with the plurality of APs. For example, the second node may collect or receive information indicating access success rates, experienced delays, throughput levels, or connection stability for each AP from one or more network entities or from the first node. The second node may aggregate and analyze the historical information to derive optimized access probability values for the respective APs. This allows the second node to provide more accurate and reliable probability information reflecting actual network performance conditions.
[0248] According to various embodiments of the present disclosure, the second node may support a learning-based access probability determination mechanism. For example, the second node may obtain prediction information from a network data analytics function (NWDAF) or may apply a machine learning model to predict congestion levels or access performance of the plurality of APs. Based on the prediction results, the second node may determine and update the access probability vector in a proactive manner. Such a learning-based mechanism enables the second node to anticipate future congestion conditions and to distribute access attempts more effectively, thereby improving overall network efficiency and stability.
[0249] According to various embodiments of the present disclosure, the second node may receive, from the first node, information related to access performance associated with a plurality of access points (APs), the information including at least one of access success or failure, experienced delay, throughput, or connection stability observed by the first node during access attempts, and may process the received information to update an access probability vector for the plurality of APs. For example, the second node may adjust probability values assigned to respective APs based on the received access performance information, thereby reflecting actual network conditions experienced by user equipments, and may dynamically adapt access control parameters based on feedback from the first node. Accordingly, a feedback loop may be established between the first node and the second node, enabling continuous refinement of access probability based on real-time access performance and improving load balancing across the plurality of APs. Such feedback-based refinement may be performed periodically, event-triggeredly, or in response to an access failure, congestion increase, or performance degradation.
[0250] According to various embodiments of the present disclosure, there is provided a second node in a wireless communication system. The second node may comprise a transceiver, at least one processor, and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the second node to perform operations corresponding to the method performed by the second node according to various embodiments of the present disclosure.
[0251] According to various embodiments of the present disclosure, there is provided a control apparatus for controlling a second node in a wireless communication system. The control apparatus may comprise at least one processor and at least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform the method performed by the second node according to various embodiments of the present disclosure.
[0252] According to various embodiments of the present disclosure, there is provided a non-transitory computer-readable medium storing one or more instructions. The one or more instructions, when executed by one or more processors, cause the one or more processors to perform the method performed by the second node according to various embodiments of the present disclosure.
[0253]
[0254] Wireless device applicable to the present disclosure
[0255] Examples of wireless devices to which various embodiments of the present disclosure are applied are described below.
[0256] FIG. 14 illustrates an example of a structure of a first device and a second device in a system applicable to the present disclosure.
[0257] A first device 1600 may include a processor 1610, an antenna unit 1620, a transceiver 1630, and a memory 1640.
[0258] The processor 1610 may perform baseband-related signal processing and include a higher layer processing unit 1611 and a physical layer processing unit 1615. The higher layer processing unit 1611 may process operations of the MAC layer, the RRC layer, or higher layers. The physical layer processing unit 1615 may process the operation of the PHY layer. For example, if the first device 1600 is a base station (BS) device in BS-UE communication, the physical layer processing unit 1615 may perform uplink reception signal processing, downlink transmission signal processing, and the like. For example, if the first device 1600 is a first UE device in inter-UE communication, the physical layer processing unit 1615 may performs downlink reception signal processing, uplink transmission signal processing, sidelink transmission signal processing, and the like. The processor 1610 may control the overall operation of the first device 1600 in addition to performing the baseband-related signal processing.
[0259] The antenna unit 1620 may include one or more physical antennas and support MIMO transmission / reception if the antenna unit 1620 includes a plurality of antennas. The transceiver 1630 may include a radio frequency (RF) transmitter and an RF receiver. The memory 1640 may store information processed by the processor 1610 and software, operating systems, and applications related to the operation of the first device 1600. The memory 1640 may also include components such as a buffer.
[0260] The processor 1610 of the first device 1600 may be configured to implement the operation of the BS in the BS-UE communication (or the operation of the first UE device in the inter-UE communication) in embodiments described in the present disclosure.
[0261] The second device 1650 may include a processor 1660, an antenna unit 1670, a transceiver 1680, and a memory 1690.
[0262] The processor 1660 may perform baseband-related signal processing and include a higher layer processing unit 1661 and a physical layer processing unit 1665. The higher layer processing unit 1661 may process the operation of the MAC layer, the RRC layer, or higher layers. The physical layer processing unit 1665 may process the operation of the PHY layer. For example, if the second device 1650 is a UE device in BS-UE communication, the physical layer processing unit 1665 may perform downlink reception signal processing, uplink transmission signal processing, and the like. For example, if the second device 1650 is a second UE device in inter-UE communication, the physical layer processing unit 1665 may perform downlink reception signal processing, uplink transmission signal processing, sidelink reception signal processing, and the like. The processor 1660 may control the overall operation of the second device 1660 in addition to performing the baseband-related signal processing.
[0263] The antenna unit 1670 may include one or more physical antennas and support MIMO transmission / reception if the antenna unit 1670 includes a plurality of antennas. The transceiver 1680 may include an RF transmitter and an RF receiver. The memory 1690 may store information processed by the processor 1660 and software, operating systems, and applications related to the operation of the second device 1650. The memory 1690 may also include components such as a buffer.
[0264] The processor 1660 of the second device 1650 may be configured to implement the operation of the UE in the BS-UE communication (or the operation of the second UE device in the inter-UE communication) in embodiments described in the present disclosure.
[0265] The descriptions for the BS and the UE in the BS-UE communication (or the first UE device and the second UE device in the inter-UE communication) in the examples of the present disclosure can be equally applied to the operations of the first device 1600 and the second device 1650, and redundant descriptions are omitted.
[0266] Wireless communication technologies implemented in the devices 1600 and 1650 according to the present disclosure may include LTE, NR, and 6G, as well as various other wireless communication technologies.
[0267] The claims described in various embodiments of the present disclosure can be combined in various ways. For example, technical features of the method claims of various embodiments of the present disclosure can be combined and implemented as a device, and technical features of the device claims of various embodiments of the present disclosure can be combined and implemented as a method. In addition, the technical features of the method claims and the technical features of the device claims in various embodiments of the present disclosure can be combined and implemented as a device, and the technical features of the method claims and the technical features of the device claims in various embodiments of the present disclosure can be combined and implemented as a method.
Claims
1.A method performed by a first node, the method comprising:receiving, from a second node, system information including probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network;determining, based on congestion information included in the system information, whether to perform a random access procedure for a first communication network associated with the second node or to access the second communication network;selecting, based on the respective access probability values and based on determining to access the second communication network, one of the plurality of APs of the second communication network; andtransmitting, to the second node, a first message for the random access procedure based on determining to perform the random access procedure.2.The method of claim 1,wherein the second node determines the respective access probability values based on a load status or available resources of each of the plurality of APs, andwherein the probability information includes an access probability vector including the respective access probability values for the plurality of APs of the second communication network.3.The method of claim 2,wherein the system information includes information indicating a number of available APs of the second communication network.4.The method of claim 2,wherein the access probability vector includes the respective access probability values for the plurality of APs,wherein each of the respective access probability values is compared with a random value generated by the first node, andwherein the first node selects one of the plurality of APs based on a result of the comparison.5.The method of claim 1,wherein the congestion information includes information indicating a congestion status of a core network (CN) associated with the second node and a congestion status of a random access channel (RACH), andwherein the second node determines the congestion information based on analytics information related to the core network and the random access channel, the analytics information being received from a network data analytics function (NWDAF).6.The method of claim 5,wherein the congestion information includes information indicating that the core network is not congested and the random access channel is congested.7.The method of claim 1, wherein the second node determines the respective access probability values based on congestion statuses of a core network and a random access channel.8.A method performed by a second node, the method comprising:determining congestion information indicating a congestion status of a first communication network;determining, based on the congestion information, probability information indicating respective access probability values for a plurality of access points (APs) of a second communication network;transmitting, to a first node, system information including the congestion information and the probability information; andreceiving, from the first node, a first message for a random access procedure based on the first node determining to perform the random access procedure.9.The method of claim 8,wherein the second node determines the respective access probability values based on a load status or available resources of each of the plurality of APs, andwherein the probability information includes an access probability vector including the respective access probability values for the plurality of APs of the second communication network.10.The method of claim 9,wherein the system information includes information indicating a number of available APs of the second communication network.11.The method of claim 9,wherein the access probability vector includes the respective access probability values for the plurality of APs,wherein the first node compares each of the respective access probability values with a random value generated by the first node, andwherein the first node selects one of the plurality of APs based on a result of the comparison.12.The method of claim 8,wherein the congestion information includes information indicating a congestion status of a core network (CN) associated with the second node and a congestion status of a random access channel (RACH), andwherein the second node determines the congestion information based on analytics information related to the core network and the random access channel, the analytics information being received from a network data analytics function (NWDAF).13.The method of claim 12,wherein the congestion information includes information indicating that the core network is not congested and the random access channel is congested.14.The method of claim 8,wherein the second node determines the respective access probability values based on congestion statuses of a core network and a random access channel.15.A first node comprising:a transceiver;at least one processor; andat least one memory operably coupled to the at least one processor and storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the method of any one of claims 1 to 7.16.A second node comprising:a transceiver;at least one processor; andat least one memory operably coupled to the at least one processor and storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the method of any one of claims 8 to 14.17.A control apparatus for controlling a first node, the control apparatus comprising:at least one processor; andat least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform the method of any one of claims 1 to 7.18.A control apparatus for controlling a second node, the control apparatus comprising:at least one processor; andat least one memory operably connected to the at least one processor and storing instructions that, when executed by the at least one processor, cause the control apparatus to perform the method of any one of claims 8 to 14.19.A non-transitory computer-readable medium storing one or more instructions, wherein the one or more instructions, when executed by one or more processors, cause the one or more processors to perform the method of any one of claims 1 to 7.20.A non-transitory computer-readable medium storing one or more instructions, wherein the one or more instructions, when executed by one or more processors, cause the one or more processors to perform the method of any one of claims 8 to 14.
