Methods and apparatus for handling forbidden list, shared network and deregistration procedure in mobile communications
The proposed methods for constructing tracking area identities and managing forbidden lists in mobile communications address undefined behaviors in shared networks, ensuring correct registration and deregistration procedures, thus preventing collisions and maintaining efficient network operations.
Patent Information
- Application Number
- PCT/CN2025/095642
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-05-27
- Filing Date
- 2025-05-19
- Publication Date
- 2025-11-27
AI Technical Summary
Current mobile communication systems face undefined behaviors in handling forbidden lists and deregistration procedures, particularly in shared networks with multiple PLMN or SNPN identities, leading to collisions and incorrect additions to forbidden lists, and undefined UE and network behaviors during registration and deregistration processes.
Proposed methods involve UE and network operations to construct tracking area identities from broadcast system information, handle deregistration requests, and manage forbidden lists based on specific cause values, ensuring proper registration and deregistration procedures are executed correctly.
The proposed solutions ensure accurate handling of forbidden lists and deregistration procedures, preventing collisions and incorrect additions, thereby maintaining efficient and defined UE and network behaviors in shared networks.
Smart Images

Figure CN2025095642_27112025_PF_FP_ABST
Abstract
Description
METHODS AND APPARATUS FOR HANDLING FORBIDDEN LIST, SHARED NETWORK AND DEREGISTRATION PROCEDURE IN MOBILE COMMUNICATIONSCROSS REFERENCE TO RELATED PATENT APPLICATION (S)
[0001] The present disclosure claims the priority benefit of Indian Patent Application Nos. 202421039731, 202421041160 and 202421041052, filed 21 May 2024, 27 May 2024 and 27 May 2024, respectively, the contents of which herein being incorporated by reference in their entirety.TECHNICAL FIELD
[0002] The present disclosure is generally related to mobile communications and, more particularly, to handling forbidden list, shared network and deregistration procedure in mobile communications.BACKGROUND
[0003] In wireless communications such as mobile communications under the current 3rd Generation Partnership Project (3GPP) specification, when a mobile station (MS) , or user equipment (UE) , reselects to a cell in a shared network, and the cell is a suitable cell for multiple public land mobile network (PLMN) identities received on the broadcast control channel (BCCH) or on the extended coverage BCCH (EC-BCCH) , the access stratum (AS) of the network indicates these multiple PLMN identities to the non-access stratum (NAS) according to 3GPP technical specification (TS) 44.018
[0034] , 3GPP TS 44.060
[0039] , 3GPP TS 25.304
[0032] , 3GPP TS 36.304
[0043] and 3GPP TS 38.304
[0061] . The MS / UE is to choose one of these PLMNs. If a registered PLMN is available among these PLMNs, the MS / UE is not to choose a different PLMN (other than the registered PLMN) . Similarly, when the MS / UE reselects to a cell in a shared network, and the cell is a suitable cell for multiple standalone non-public network (SNPN) identities received in the broadcast information as specified in 3GPP TS 38.331
[0065] , the AS indicates these multiple SNPN identities to the NAS according to 3GPP TS 38.304
[0061] . The MS / UE is to select one of these SNPNs. If a registered SNPN is available among these SNPNs, the MS / UE is not to select a different SNPN (other than the registered SNPN) .
[0004] Moreover, it is possible that a collision between a registration procedure for mobility and periodic registration update and a deregistration procedure can occur. If the UE receives a DEREGISTRATION REQUEST message without a 5th Generation Mobility Management (5GMM) cause value #11, #12, #13 or #15 before the registration procedure for mobility and periodic registration update has been completed, the registration procedure for mobility and periodic registration update is to be aborted and the deregistration procedure is to be progressed. On the other hand, if the UE receives a DEREGISTRATION REQUEST message with a 5GMM cause value #11, #12, #13 or #15 before the registration procedure for mobility and periodic registration update has been completed, the registration procedure for mobility and periodic registration update is to be progressed and the deregistration procedure is to be aborted. The UE is to trigger a transition from 5GMM-CONNECTED mode with radio resource control (RRC) inactive indication to 5GMM-IDLE mode upon selection of a PLMN or SNPN that is not an equivalent PLMN or SNPN to the registered PLMN or SNPN. The UE is not to trigger a transition from 5GMM-CONNECTED mode with RRC inactive indication to 5GMM-IDLE mode upon entering a new PLMN or SNPN which is in the list of equivalent PLMNs or SNPNs.
[0005] However, when multiple PLMN identities are received in the broadcast information and the UE receives a cause #73 or #36, then it is undefined as to which PLMN identity should be added in a forbidden list and whether or not a PLMN identity should be added in the forbidden list in a connected mode. Likewise, when multiple SNPN identities are received in the broadcast information and the UE receives a cause #36, #74 or #75, then it is undefined as to which SNPN identity should be added in a forbidden list and whether or not a SNPN identity will be added in the forbidden list in the connected mode. Cause #36 indicates “IAB-node operation not authorized” . Cause #73 indicates “Serving network not authorized” is considered an abnormal case. Cause #74 indicates “Temporarily not authorized for this SNPN” . Cause #75 indicates “Permanently not authorized for this SNPN” .
[0006] In addition, due to collision of DEREGISTRATION REQUEST message containing deregistration type "re-registration required" and the registration procedure for mobility and periodic registration update has been completed, UE and network behavior is undefined due to which UE might end up with initial registration and mobility registration update procedure processing at the same time both UE and network cannot handle. Also, UE behavior is not defined when the UE in 5GMM-CONNECTED mode with RRC inactive indication enters a cell in the current registration area belonging to an equivalent SNPN of the registered SNPN and not belonging to the registered SNPN. Moreover, due to collision of deregistration request message containing cause #74 or #75, UE could add an incorrect SNPN in forbidden list. For instance, UE may be on SNPN ID “x” initially and the UE may move to new SNPN ID “y” , thereby leading to triggering of mobility registration. Meanwhile, the network may initiate a deregistration procedure with cause #74 or #75, assuming the UE is on SNPN ID “x” , thus resulting in a collision between the mobility registration procedure and the deregistration procedure. The UE then receives a network-initiated deregistration message before completing the registration procedure and, if the UE proceeds with the deregistration procedure, the UE would populate SNPN ID “y” in a forbidden SNPN list whereas the network’s intention was to populate SNPN ID “x” .
[0007] Therefore, there is a need for a solution of handling forbidden list, shared network and deregistration procedure in mobile communications.SUMMARY
[0008] The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits, and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.
[0009] An objective of the present disclosure is to propose solutions or schemes that address the issue (s) described herein. More specifically, various schemes proposed in the present disclosure are believed to provide solutions pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications. It is believed that implementations of one or more of the schemes proposed herein may address or otherwise alleviate the issues described above.
[0010] In one aspect, a method may involve a UE in a shared network receiving a TAC on a broadcast system information. The method may also involve the UE constructing a tracking area identity (TAI) of a cell from one of a plurality of PLMN identities (or a plurality of SNPN identities) and the TAC.
[0011] In another aspect, a method may involve a UE receiving a deregistration request message with a cause indicating temporarily not authorized for an SNPN or permanently not authorized for the SNPN. The method may also involve the UE performing an operation corresponding to whether or not the deregistration request message is received before a registration procedure for mobility and periodic registration update has been completed. In response to the deregistration request message being received before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) progressing the registration procedure for mobility and periodic registration update; and (b) aborting a deregistration procedure. In response to the deregistration request message being received not before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) aborting the registration procedure for mobility and periodic registration update; and (b) progressing the deregistration procedure.
[0012] In yet another aspect, a method may involve a network transmitting a TAC on a broadcast system information which causes a UE to construct a TAI of a cell from the TAC one of a plurality of SNPN identities or a plurality of PLMN identities. The method may also involve the network transmitting a deregistration request message to the UE with a cause indicating temporarily not authorized for an SNPN or permanently not authorized for the SNPN to initiate a deregistration procedure. The method may also involve the network receiving a registration request message from the UE indicating either mobility registration updating or periodic registration updating to initiate a registration procedure. The method may further involve the network performing an operation corresponding to whether or not the registration request message is received before the deregistration procedure has been completed. In response to the registration request message being received before the deregistration procedure has been completed, the operation may involve: (a) progressing the registration procedure; and (b) aborting the deregistration procedure. In response to the registration request message being received not before the deregistration procedure has been completed, the operation may involve: (a) progressing the deregistration procedure; and (b) ignoring the registration request message.
[0013] It is noteworthy that, although the description provided herein may be in the context of certain radio access technologies, networks, and network topologies such as 5th Generation (5G) NR / Beyond Fifth-Generation (B5G) mobile communications, the proposed concepts, schemes and any variation (s) / derivative (s) thereof may be implemented in, for and by other types of radio access technologies, networks and network topologies such as, for example and without limitation, 4G / Long-Term Evolution (LTE) , LTE-Advanced, LTE-Advanced Pro, Internet-of-Things (IoT) , Narrow Band Internet of Things (NB-IoT) , Industrial Internet of Things (IIoT) , vehicle-to-everything (V2X) , and non-terrestrial network (NTN) communications. Thus, the scope of the present disclosure is not limited to the examples described herein.BRIEF DESCRIPTION OF THE DRAWINGS
[0014] The accompanying drawings are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of the present disclosure. The drawings illustrate implementations of the disclosure and, together with the description, serve to explain the principles of the disclosure. It is appreciable that the drawings are not necessarily in scale as some components may be shown to be out of proportion than the size in actual implementation in order to clearly illustrate the concept of the present disclosure.
[0015] FIG. 1 is a diagram of an example network environment in which various solutions and schemes in accordance with the present disclosure may be implemented.
[0016] FIG. 2 is a block diagram of an example communication system under a proposed scheme in accordance with the present disclosure.
[0017] FIG. 3 is a flowchart of an example process under a proposed scheme in accordance with the present disclosure.
[0018] FIG. 4 is a flowchart of an example process under a proposed scheme in accordance with the present disclosure.
[0019] FIG. 5 is a flowchart of an example process under a proposed scheme in accordance with the present disclosure.
[0020] FIG. 6 is a flowchart of an example process under a proposed scheme in accordance with the present disclosure. DETAILED DESCRIPTION OF PREFERRED IMPLEMENTATIONS
[0021] Detailed embodiments and implementations of the claimed subject matters are disclosed herein. However, it shall be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matters which may be embodied in various forms. The present disclosure may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided so that description of the present disclosure is thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. In the description below, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments and implementations. Overview
[0022] Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and / or solutions pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications. According to the present disclosure, a number of possible solutions may be implemented separately or jointly. That is, although these possible solutions may be described below separately, two or more of these possible solutions may be implemented in one combination or another.
[0023] FIG. 1 illustrates an example network environment 100 in which various solutions and schemes in accordance with the present disclosure may be implemented. FIG. 2 ~ FIG. 6 illustrate examples of implementation of various proposed schemes in network environment 100 in accordance with the present disclosure. The following description of various proposed schemes is provided with reference to FIG. 1 ~ FIG. 6.
[0024] Referring to FIG. 1, network environment 100 may involve a UE 110, such as a mobile device or smartphone, in wireless communication with a wireless network 120 as part of a communication network. The wireless network 120 may be one or more public land mobile networks (PLMNs) including 5G / NR domain, 4G / LTE domain, and 2nd Generation / 3rd Generation (2G / 3G) domain. UE 110 may initially be in wireless communication with wireless network 120 via a base station or network node 125 (e.g., an eNB, gNB or transmit-receive point (TRP) ) . In network environment 100, UE 110 and the wireless network 120 may implement various schemes pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications in accordance with the present disclosure, as described herein.
[0025] It is noteworthy that, while the various proposed schemes may be individually or separately described below, in actual implementations some or all of the proposed schemes may be utilized or otherwise implemented jointly. Of course, each of the proposed schemes may be utilized or otherwise implemented individually or separately. Moreover, as used herein, a lower layer may refer to a layer in the 5GMM protocol stack that is lower than the radio resource control (RRC) layer, such as a packet data convergence protocol (PDCP) layer, a radio control link (RLC) layer, a medium access control (MAC) layer, a physical (PHY) layer, or so forth.
[0026] Under a first proposed scheme in accordance with the present disclosure, in a shared network, UE 110 may construct a tracking area identity (TAI) of a cell from one of a plurality of PLMN identities and a type allocation code (TAC) received on the broadcast system information. Whenever a REGISTRATION REJECT message, a TAU (tracking area update) REJECT message or an ATTACH REJECT message is received by UE 110 with the 5GMM (or Evolved Packet System (EPS) Mobility Management (EMM) ) cause #73 or #36, the chosen PLMN identity may be stored in the "forbidden PLMN list" and, in case that UE 110 is configured to use timer, UE 110 may start a timer T3245 and proceed as described in subclause 5.3.19A. 1 of the 3GPP specification. Alternatively, or additionally, whenever a REGISTRATION REJECT / TAU REJECT / ATTACH REJECT message is received by UE 110 as a response to a registration procedure for mobility registration update initiated in a 5GMM-CONNECTED (or EMM connected) mode, UE 110 may not update (e.g., UE 110 may refrain from updating) one or more forbidden lists with the selected PLMN identity, respectively.
[0027] Under a second proposed scheme in accordance with the present disclosure, in a shared network, UE 110 may construct a TAI of a cell from one of a plurality of SNPN identities and a TAC received on the broadcast system information. Whenever a REGISTRATION REJECT message is received by UE 110 with a 5GMM cause #74 ( "Temporarily not authorized for this SNPN" ) or #36 ( “IAB-node operation not authorized” ) , the chosen SNPN identity may be stored in a "temporarily forbidden SNPNs" list or a "temporarily forbidden SNPNs for access for localized services in SNPN" list if the SNPN is an SNPN selected for localized services in SNPN access operation mode for a specific access type for which the REGISTRATION REJECT message was received and the selected entry of the "list of subscriber data" or the selected PLMN subscription and, if UE 110 is configured to use a timer T3245, UE 110 may start timer T3245 and proceed as described in subclause 5.3.19A. 2 of the 3GPP specification. Alternatively, or additionally, whenever a REGISTRATION REJECT message is received by UE 110 with a 5GMM cause #75 ( "Permanently not authorized for this SNPN" ) , the chosen SNPN identity may be stored in a "permanently forbidden SNPNs" list or a "permanently forbidden SNPNs for access for localized services in SNPN" list if the SNPN is an SNPN selected for localized services in SNPN access operation mode for a specific access type for which the REGISTRATION REJECT message was received and the selected entry of the "list of subscriber data" or the selected PLMN subscription and, if UE 110 is configured to use timer T3245, UE 110 may start timer T3245 and proceed as described in subclause 5.3.19A. 2 of the 3GPP specification. Alternatively, or additionally, whenever a REGISTRATION REJECT message is received by UE 110 with a 5GMM cause #12 ( "tracking area not allowed" ) , #13 ( "roaming not allowed in this tracking area" ) , #15 ( "no suitable cells in tracking area" ) , or #62 ( "No network slices available" ) , a constructed TAI may be stored in the suitable list. Alternatively, whenever a REGISTRATION REJECT message is received by UE 110 as a response to a registration procedure for mobility registration update initiated in a 5GMM-CONNECTED mode, UE 110 may not update (e.g., UE 110 may refrain from updating) one or more forbidden lists with the selected SNPN identity or the constructed TAI, respectively.
[0028] Under a third proposed scheme in accordance with the present disclosure, in case that UE 110 receives a DEREGISTRATION REQUEST message containing deregistration type "re-registration required" or deregistration type "re-registration not required" and no 5GMM cause IE before the registration procedure for mobility and periodic registration update has been completed, then UE 110 may perform an operation correspondingly. For instance, the operation may involve UE 110 aborting the registration procedure for mobility and periodic registration update, progressing the DEREGISTRATION REQUEST message, and performing an initial registration procedure after completion of the deregistration procedure, if required. Notably, the registration procedure for mobility and periodic registration update may be aborted only if the DEREGISTRATION REQUEST message indicates in the access type that the access in which the registration procedure for mobility and periodic registration update was attempted is to be deregistered. Otherwise, both the procedures are to be progressed. Alternatively, the operation may involve UE 110 progressing the registration procedure for mobility and periodic registration update and aborting the DEREGISTRATION REQUEST message.
[0029] Under the third proposed scheme, in case that a network (e.g., wireless network 120) sent a DEREGISTRATION REQUEST message containing deregistration type "re-registration required" or deregistration type "re-registration not required" and no 5GMM cause IE and the network receives a REGISTRATION REQUEST message indicating either "mobility registration updating" or "periodic registration updating" in a 5th Generation System (5GS) registration type information element (IE) before the network-initiated deregistration procedure has been completed, then wireless network 120 may progress the deregistration procedure (and ignore the REGISTRATION REQUEST message) . Notably, the above collision case may be valid if the DEREGISTRATION REQUEST message indicates the access type over which the mobility and periodic registration procedure is attempted otherwise both the procedures are progressed. Alternatively, wireless network 120 may abort the deregistration procedure (and progress the REGISTRATION REQUEST message) .
[0030] Under a fourth proposed scheme in accordance with the present disclosure, UE 110 in a state 5GMM-REGISTERED may initiate a registration procedure for mobility and periodic registration update by sending a REGISTRATION REQUEST message to an Access and Mobility Management Function (AMF) of wireless network 120, when UE 110 in a 5GMM-CONNECTED mode with a RRC inactive indication enters a cell in a current registration area belonging to an equivalent SNPN of the registered SNPN and not belonging to the registered SNPN.
[0031] Under a fifth proposed scheme in accordance with the present disclosure, in case that UE 110 receives a DEREGISTRATION REQUEST message with a 5GMM cause value #74 or #75 before a registration procedure for mobility and periodic registration update has been completed, UE 110 may progress (e.g., continue) the registration procedure for mobility and periodic registration update and abort the deregistration procedure. Otherwise, the registration procedure for mobility and periodic registration update may be aborted and the deregistration procedure may be progressed.
[0032] As a first implementation example, in a shared network, UE 110 may construct the TAI of the cell from one of the PLMN identities as specified in 3GPP TS 23.122 [5] and the TAC received on the broadcast system information. Whenever a REGISTRATION REJECT message is received by UE 110 with the 5GMM cause #11 "PLMN not allowed" or #36 "IAB-node operation not authorized" , the chosen PLMN identity may be stored in the "forbidden PLMN list" and, if UE 110 is configured to use timer T3245 (see 3GPP TS 24.368
[0017] or 3GPP TS 31.102
[0022] ) , UE 110 may start timer T3245 and proceed as described in subclause 5.3.19A of the 3GPP specification.
[0033] As a second implementation example, in a shared network, UE 110 may construct the TAI of the cell from one of the SNPN identities as specified in 3GPP TS 23.122 [5] constructing the TAI from the PLMN identity part of the SNPN identity and the TAC received on the broadcast system information. Whenever a REGISTRATION REJECT message is received by UE 110 with the 5GMM cause #74 "Temporarily not authorized for this SNPN" , the chosen SNPN identity may be stored in the "temporarily forbidden SNPNs" list, "temporarily forbidden SNPNs for access for localized services in SNPN" list if the SNPN is an SNPN selected for localized services in SNPN access operation mode (see 3GPP TS 23.122 [5] ) or "temporarily forbidden SNPNs for onboarding services in SNPN" list if UE 110 is registered for onboarding services in SNPN and, if UE 110 is configured to use timer T3245 (see 3GPP TS 24.368
[0017] or 3GPP TS 31.102
[0022] ) , UE 110 may start timer T3245 and proceed as described in subclause 5.3.19A of the 3GPP specification.
[0034] As a third implementation example, with respect to collision between a registration procedure for mobility and periodic registration update and a deregistration procedure, if UE 110 receives a DEREGISTRATION REQUEST message without 5GMM cause value #11, #12, #13, #15, #36, #62, #74, #75 or #78 before the registration procedure for mobility and periodic registration update has been completed, the registration procedure for mobility and periodic registration update may be aborted and the deregistration procedure may be progressed. On the other hand, if UE 110 receives a DEREGISTRATION REQUEST message with 5GMM cause value #11, #12, #13, #15, #36, #62, #74, #75 or #78 before the registration procedure for mobility and periodic registration update has been completed, the registration procedure for mobility and periodic registration update may be progressed and the deregistration procedure may be aborted.
[0035] Similarly, with respect to collision between a deregistration and registration procedure for mobility and a periodic registration update, if wireless network 120 sent a DEREGISTRATION REQUEST message without 5GMM cause value #11, #12, #13, #15, #62, #74, #75 or #78 and wireless network 120 receives a REGISTRATION REQUEST message indicating either "mobility registration updating" or "periodic registration updating" in the 5GS registration type IE before the network-initiated deregistration procedure has been completed, the deregistration procedure may be progressed (e.g., the REGISTRATION REQUEST message may be ignored) . Conversely, if wireless network 120 sent a DEREGISTRATION REQUEST message with 5GMM cause value #11, #12, #13, #15, #62, #74, #75 or #78 and wireless network 120 receives a REGISTRATION REQUEST message indicating either "mobility registration updating" or "periodic registration updating" in the 5GS registration type IE before the network-initiated deregistration procedure has been completed, the deregistration procedure may be aborted and the registration procedure may be progressed. Otherwise, the deregistration procedure may be progressed (e.g., the REGISTRATION REQUEST message may be ignored) .
[0036] As a fourth implementation example, in a shared network, UE 110 may construct the TAI of the cell from one of the PLMN identities as specified in 3GPP TS 23.122 [5] and the TAC received on the broadcast system information. Whenever a REGISTRATION REJECT message is received by UE 110 with a 5GMM cause #11 "PLMN not allowed" , #36 "IAB-node operation not authorized" or #73 "Serving network not authorized" , the chosen PLMN identity may be stored in the "forbidden PLMN list" and, if UE 110 is configured to use timer T3245 (see 3GPP TS 24.368
[0017] or 3GPP TS 31.102
[0022] ) , UE 110 may start timer T3245 and proceed as described in subclause 5.3.19A of the 3GPP specification. Illustrative Implementations
[0037] FIG. 2 illustrates an example communication system 200 having at least an example apparatus 210 and an example apparatus 220 in accordance with an implementation of the present disclosure. Each of apparatus 210 and apparatus 220 may perform various functions to implement schemes, techniques, processes and methods described herein pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications, including the various schemes described above with respect to various proposed designs, concepts, schemes, systems and methods described above, including network environment 100, as well as processes described below.
[0038] Each of apparatus 210 and apparatus 220 may be a part of an electronic apparatus, which may be a network apparatus or a UE (e.g., UE 110) , such as a portable or mobile apparatus, a wearable apparatus, a vehicular device or a vehicle, a wireless communication apparatus or a computing apparatus. For instance, each of apparatus 210 and apparatus 220 may be implemented in a smartphone, a smart watch, a personal digital assistant, an electronic control unit (ECU) in a vehicle, a digital camera, or a computing equipment such as a tablet computer, a laptop computer or a notebook computer. Each of apparatus 210 and apparatus 220 may also be a part of a machine type apparatus, which may be an IoT apparatus such as an immobile or a stationary apparatus, a home apparatus, a roadside unit (RSU) , a wire communication apparatus or a computing apparatus. For instance, each of apparatus 210 and apparatus 220 may be implemented in a smart thermostat, a smart fridge, a smart door lock, a wireless speaker or a home control center. When implemented in or as a network apparatus, apparatus 210 and / or apparatus 220 may be implemented in an eNB in an LTE, LTE-Advanced or LTE-Advanced Pro network or in a gNB or TRP in a 5G network, an NR network, or an IoT network.
[0039] In some implementations, each of apparatus 210 and apparatus 220 may be implemented in the form of one or more integrated-circuit (IC) chips such as, for example and without limitation, one or more single-core processors, one or more multi-core processors, one or more complex-instruction-set-computing (CISC) processors, or one or more reduced-instruction-set-computing (RISC) processors. In the various schemes described above, each of apparatus 210 and apparatus 220 may be implemented in or as a network apparatus or a UE. Each of apparatus 210 and apparatus 220 may include at least some of those components shown in FIG. 2 such as a processor 212 and a processor 222, respectively, for example. Each of apparatus 210 and apparatus 220 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and / or user interface device) , and, thus, such component (s) of apparatus 210 and apparatus 220 are neither shown in FIG. 2 nor described below in the interest of simplicity and brevity.
[0040] In one aspect, each of processor 212 and processor 222 may be implemented in the form of one or more single-core processors, one or more multi-core processors, or one or more CISC or RISC processors. That is, even though a singular term “a processor” is used herein to refer to processor 212 and processor 222, each of processor 212 and processor 222 may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor 212 and processor 222 may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and / or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor 212 and processor 222 is a special-purpose machine specifically designed, arranged, and configured to perform specific tasks including those pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications in accordance with various implementations of the present disclosure.
[0041] In some implementations, apparatus 210 may also include a transceiver 216 coupled to processor 212. Transceiver 216 may be capable of wirelessly transmitting and receiving data. In some implementations, transceiver 216 may be capable of wirelessly communicating with different types of wireless networks of different radio access technologies (RATs) . In some implementations, transceiver 216 may be equipped with a plurality of antenna ports (not shown) such as, for example, four antenna ports. That is, transceiver 216 may be equipped with multiple transmit antennas and multiple receive antennas for multiple-input multiple-output (MIMO) wireless communications. In some implementations, apparatus 220 may also include a transceiver 226 coupled to processor 222. Transceiver 226 may include a transceiver capable of wirelessly transmitting and receiving data. In some implementations, transceiver 226 may be capable of wirelessly communicating with different types of UEs / wireless networks of different RATs. In some implementations, transceiver 226 may be equipped with a plurality of antenna ports (not shown) such as, for example, four antenna ports. That is, transceiver 226 may be equipped with multiple transmit antennas and multiple receive antennas for MIMO wireless communications.
[0042] In some implementations, apparatus 210 may further include a memory 214 coupled to processor 212 and capable of being accessed by processor 212 and storing data therein. In some implementations, apparatus 220 may further include a memory 224 coupled to processor 222 and capable of being accessed by processor 222 and storing data therein. Each of memory 214 and memory 224 may include a type of random-access memory (RAM) such as dynamic RAM (DRAM) , static RAM (SRAM) , thyristor RAM (T-RAM) and / or zero-capacitor RAM (Z-RAM) . Alternatively, or additionally, each of memory 214 and memory 224 may include a type of read-only memory (ROM) such as mask ROM, programmable ROM (PROM) , erasable programmable ROM (EPROM) and / or electrically erasable programmable ROM (EEPROM) . Alternatively, or additionally, each of memory 214 and memory 224 may include a type of non-volatile random-access memory (NVRAM) such as flash memory, solid-state memory, ferroelectric RAM (FeRAM) , magnetoresistive RAM (MRAM) and / or phase-change memory.
[0043] Each of apparatus 210 and apparatus 220 may be a communication entity capable of communicating with each other using various proposed schemes in accordance with the present disclosure. For illustrative purposes and without limitation, a description of capabilities of apparatus 210, as a UE (e.g., UE 110) , and apparatus 220, as a network node (e.g., network node 125) of a network (e.g., wireless network 120 as a 5G / NR mobile network) , is provided below in the context of example processes 300, 400, 500 and 600. Illustrative Processes
[0044] Each of FIG. 3, FIG. 4, FIG. 5 and FIG. 6 illustrates an example process 300, example process 400, example process 500 or example process 600, respectively, in accordance with an implementation of the present disclosure. Each of process 300, process 400, process 500 and process 600 may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, each of process 300, process 400, process 500 and process 600 may represent an aspect of the proposed concepts and schemes pertaining to handling forbidden list, shared network and deregistration procedure in mobile communications in accordance with the present disclosure. Each of process 300, process 400, process 500 and process 600 may include one or more operations, actions, or functions as illustrated by one or more of blocks 310 and 320 for process 300, blocks 410 and 420 for process 400, blocks 510 and 520 for process 500, and blocks 610, 620, 630 and 640 for process 600. Although illustrated as discrete blocks, various blocks of each of process 300, process 400, process 500 and process 600 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks / sub-blocks of each of process 300, process 400, process 500 and process 600 may be executed in the order shown in FIG. 3, FIG. 4, FIG. 5 and FIG. 6, respectively, or in a different order. Furthermore, one or more of the blocks / sub-blocks of each of process 300, process 400, process 500 and process 600 may be executed repeatedly or iteratively. Each of process 300, process 400, process 500 and process 600 may be implemented by or in apparatus 210 and apparatus 220 as well as any variations thereof. Solely for illustrative purposes and without limiting the scope, each of process 300, process 400 and process 500 is described below in the context of apparatus 210 as a UE (e.g., UE 110) and apparatus 220 as a communication entity such as a network node or base station (e.g., network node 125) of a network (e.g., wireless network 120) .
[0045] Process 300 may begin at block 310.
[0046] At 310, process 300 may involve processor 212 of apparatus 210, as UE 110, receiving, via transceiver 216 and in a shared network, a TAC on a broadcast system information. Process 300 may proceed from 310 to 320.
[0047] At 320, process 300 may involve processor 212 constructing a TAI of a cell from one of a plurality of PLMN identities and the TAC.
[0048] In some implementations, process 300 may further involve processor 212 performing additional operations. For instance, process 300 may involve processor 212 receiving, via transceiver 216, a reject message. For instance, the reject message may include a registration reject message, a tracking area update (TAU) reject message, or an attach reject message. Moreover, responsive to the receiving, process 300 may involve processor 212 performing an operation corresponding to the reject message being received under a first condition or a second condition.
[0049] In some implementations, the first condition may involve receiving the reject message with a cause indicating a serving network not authorized (#73) or an integrated access backhaul (IAB) -node operation not authorized (#36) . Correspondingly, the operation may involve storing a chosen PLMN identity in a forbidden PLMN list.
[0050] In some implementations, the second condition may involve receiving the reject message as a response to a registration procedure for mobility registration update initiated in a connected mode. Correspondingly, the operation may involve refraining from updating one or more forbidden lists with a selected PLMN identity.
[0051] Process 400 may begin at block 410.
[0052] At 410, process 400 may involve processor 212 of apparatus 210, as UE 110, receiving, via transceiver 216 and in a shared network, a TAC on a broadcast system information. Process 400 may proceed from 410 to 420.
[0053] At 420, process 400 may involve processor 212 constructing a TAI of a cell from one of a plurality of SNPN identities and the TAC.
[0054] In some implementations, process 400 may further involve processor 212 performing additional operations. For instance, process 400 may involve processor 212 receiving, via transceiver 216, a reject message. For instance, the reject message may include a registration reject message. Moreover, responsive to the receiving, process 400 may involve processor 212 performing an operation corresponding to the reject message being received under a first condition, a second condition, a third condition or a fourth condition.
[0055] In some implementations, the first condition may involve receiving the reject message with a cause indicating temporarily not authorized for an SNPN (#74) or an IAB-node operation not authorized (#36) . Correspondingly, the operation may involve: (a) storing a chosen SNPN identity in: (i) a “temporarily forbidden SNPNs” list, or (ii) a “temporarily forbidden SNPNs for access for localized services in SNPN” list responsive to the chosen SNPN being selected for localized services in an SNPN access operation mode for a specific access type for which the reject message was received; and (b) starting a timer T3245.
[0056] In some implementations, the second condition may involve receiving the reject message with a cause indicating permanently not authorized for this SNPN (#75) . Correspondingly, the operation may involve: (a) storing a chosen SNPN identity in: (i) a “permanently forbidden SNPNs” list, or (ii) a “permanently forbidden SNPNs for access for localized services in SNPN” list responsive to the chosen SNPN being selected for localized services in an SNPN access operation mode for a specific access type for which the reject message was received; and (b) starting a timer T3245.
[0057] In some implementations, the third condition may involve receiving the reject message with a cause indicating tracking area not allowed (#12) , roaming not allowed in a tracking area ( “#13) , no suitable cells in the tracking area (#15) or no network slices available (#62) . Correspondingly, the operation may involve storing the constructed TAI in a suitable list.
[0058] In some implementations, the fourth condition may involve receiving the reject message as a response to a registration procedure for mobility registration update initiated in a connected mode. Correspondingly, the operation may involve refraining from updating one or more forbidden lists with a selected SNPN identity or the constructed TAI.
[0059] In some implementations, process 400 may further involve processor 212 performing additional operations. For instance, process 400 may involve processor 212 receiving, via transceiver 216, a deregistration request message with a cause indicating temporarily not authorized for a SNPN or permanently not authorized for the SNPN. Moreover, process 400 may involve processor 212 performing, via transceiver 216, an operation corresponding to whether or not the deregistration request message is received before a registration procedure for mobility and periodic registration update has been completed. In some implementations, responsive to the deregistration request message being received before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) progressing the registration procedure for mobility and periodic registration update; and (b) aborting a deregistration procedure. Alternatively, responsive to the deregistration request message being received not before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) aborting the registration procedure for mobility and periodic registration update; and (b) progressing the deregistration procedure.
[0060] Process 500 may begin at block 510.
[0061] At 510, process 500 may involve processor 212 of apparatus 210, as UE 110, receiving, via transceiver 216, a deregistration request message with a cause indicating temporarily not authorized for a SNPN or permanently not authorized for the SNPN. Process 500 may proceed from 510 to 520.
[0062] At 520, process 500 may involve processor 212 performing, via transceiver 216, an operation corresponding to whether or not the deregistration request message is received before a registration procedure for mobility and periodic registration update has been completed.
[0063] In some implementations, responsive to the deregistration request message being received before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) progressing the registration procedure for mobility and periodic registration update; and (b) aborting a deregistration procedure. Alternatively, responsive to the deregistration request message being received not before the registration procedure for mobility and periodic registration update has been completed, the operation may involve: (a) aborting the registration procedure for mobility and periodic registration update; and (b) progressing the deregistration procedure.
[0064] Process 600 may begin at block 610.
[0065] At 610, process 600 may involve processor 222 of apparatus 220, as network node 125 of wireless network 120, transmitting, via transceiver 226, a TAC on a broadcast system information which causes a UE (e.g., apparatus 210 as UE 110) to construct a TAI of a cell from the TAC one of a plurality of SNPN identities or a plurality of PLMN identities. Process 600 may proceed from 610 to 620.
[0066] At 620, process 600 may involve processor 222 transmitting, via transceiver 226, a deregistration request message to the UE with a cause indicating temporarily not authorized for an SNPN or permanently not authorized for the SNPN to initiate a deregistration procedure. Process 600 may proceed from 620 to 630.
[0067] At 630, process 600 may involve processor 222 receiving, via transceiver 226, a registration request message from the UE indicating either mobility registration updating or periodic registration updating to initiate a registration procedure. Process 600 may proceed from 630 to 640.
[0068] At 640, process 600 may involve processor 222 performing, via transceiver 226, an operation corresponding to whether or not the registration request message is received before the deregistration procedure has been completed.
[0069] In some implementations, responsive to the registration request message being received before the deregistration procedure has been completed, the operation may involve: (a) progressing the registration procedure; and (b) aborting the deregistration procedure. Alternatively, responsive to the registration request message being received not before the deregistration procedure has been completed, the operation may involve: (a) progressing the deregistration procedure; and (b) ignoring the registration request message. Additional Notes
[0070] The herein-described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as "associated with" each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being "operably connected" , or "operably coupled" , to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being "operably couplable" , to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and / or physically interacting components and / or wirelessly interactable and / or wirelessly interacting components and / or logically interacting and / or logically interactable components.
[0071] Further, with respect to the use of substantially any plural and / or singular terms herein, those having skill in the art can translate from the plural to the singular and / or from the singular to the plural as is appropriate to the context and / or application. The various singular / plural permutations may be expressly set forth herein for sake of clarity.
[0072] Moreover, it will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims, e.g., bodies of the appended claims, are generally intended as “open” terms, e.g., the term “including” should be interpreted as “including but not limited to, ” the term “having” should be interpreted as “having at least, ” the term “includes” should be interpreted as “includes but is not limited to, ” etc. It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim recitation to implementations containing only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an, " e.g., “a” and / or “an” should be interpreted to mean “at least one” or “one or more; ” the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number, e.g., the bare recitation of "two recitations, " without other modifiers, means at least two recitations, or two or more recitations. Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. In those instances where a convention analogous to “at least one of A, B, or C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. It will be further understood by those within the art that virtually any disjunctive word and / or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B. ”
[0073] From the foregoing, it will be appreciated that various implementations of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the present disclosure. Accordingly, the various implementations disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the following claims.
Claims
1.A method, comprising:receiving, by a processor of a user equipment (UE) in a shared network, a type allocation code (TAC) on a broadcast system information; andconstructing, by the processor, a tracking area identity (TAI) of a cell from one of a plurality of public land mobile network (PLMN) identities and the TAC.2.The method of Claim 1, further comprising:receiving, by the processor, a reject message; andresponsive to the receiving, performing, by the processor, an operation corresponding to the reject message being received under a first condition or a second condition.3.The method of Claim 2, wherein the first condition comprises receiving the reject message with a cause indicating a serving network not authorized (#73) or an integrated access backhaul (IAB) -node operation not authorized (#36) .4.The method of Claim 3, wherein the operation comprises storing a chosen PLMN identity in a forbidden PLMN list.5.The method of Claim 2, wherein the second condition comprises receiving the reject message as a response to a registration procedure for mobility registration update initiated in a connected mode.6.The method of Claim 5, wherein the operation comprises refraining from updating one or more forbidden lists with a selected PLMN identity.7.The method of Claim 2, wherein the reject message comprises a registration reject message, a tracking area update (TAU) reject message, or an attach reject message.8.A method, comprising:receiving, by a processor of a user equipment (UE) in a shared network, a type allocation code (TAC) on a broadcast system information; andconstructing, by the processor, a tracking area identity (TAI) of a cell from one of a plurality of standalone non-public network (SNPN) identities and the TAC.9.The method of Claim 8, further comprising:receiving, by the processor, a reject message; andresponsive to the receiving, performing, by the processor, an operation corresponding to the reject message being received under a first condition, a second condition, a third condition or a fourth condition.10.The method of Claim 9, wherein the first condition comprises receiving the reject message with a cause indicating temporarily not authorized for an SNPN (#74) or an integrated access backhaul (IAB) -node operation not authorized (#36) .11.The method of Claim 10, wherein the operation comprises:storing a chosen SNPN identity in:a “temporarily forbidden SNPNs” list, ora “temporarily forbidden SNPNs for access for localized services in SNPN” list responsive to the chosen SNPN being selected for localized services in an SNPN access operation mode for a specific access type for which the reject message was received; and starting a timer T3245.12.The method of Claim 9, wherein the second condition comprises receiving the reject message with a cause indicating permanently not authorized for this SNPN (#75) .13.The method of Claim 12, wherein the operation comprises:storing a chosen SNPN identity in:a “permanently forbidden SNPNs” list, ora “permanently forbidden SNPNs for access for localized services in SNPN” list responsive to the chosen SNPN being selected for localized services in an SNPN access operation mode for a specific access type for which the reject message was received; and starting a timer T3245.14.The method of Claim 9, wherein the third condition comprises receiving the reject message with a cause indicating tracking area not allowed (#12) , roaming not allowed in a tracking area ( “#13) , no suitable cells in the tracking area (#15) or no network slices available (#62) .15.The method of Claim 12, wherein the operation comprises storing the constructed TAI in a suitable list.16.The method of Claim 9, wherein the fourth condition comprises receiving the reject message as a response to a registration procedure for mobility registration update initiated in a connected mode.17.The method of Claim 16, wherein the operation comprises refraining from updating one or more forbidden lists with a selected SNPN identity or the constructed TAI.18.The method of Claim 9, wherein the reject message comprises a registration reject message.19.The method of Claim 8, further comprising:receiving, by the processor, a deregistration request message with a cause indicating temporarily not authorized for a SNPN or permanently not authorized for the SNPN; andperforming, by the processor, an operation corresponding to whether or not the deregistration request message is received before a registration procedure for mobility and periodic registration update has been completed,wherein, responsive to the deregistration request message being received before the registration procedure for mobility and periodic registration update has been completed, the operation comprises:progressing the registration procedure for mobility and periodic registration update; andaborting a deregistration procedure, andwherein, responsive to the deregistration request message being received not before the registration procedure for mobility and periodic registration update has been completed, the operation comprises:aborting the registration procedure for mobility and periodic registration update; andprogressing the deregistration procedure.20.A method, comprising:transmitting, by a processor of a network node, a type allocation code (TAC) on a broadcast system information which causes a user equipment (UE) to construct a tracking area identity (TAI) of a cell from the TAC and one of a plurality of standalone non-public network (SNPN) identities or a plurality of public land mobile network (PLMN) identities;transmitting, by the processor, a deregistration request message to the UE with a cause indicating temporarily not authorized for a standalone non-public network (SNPN) or permanently not authorized for the SNPN to initiate a deregistration procedure;receiving, by the processor, a registration request message from the UE indicating either mobility registration updating or periodic registration updating to initiate a registration procedure; andperforming, by the processor, an operation corresponding to whether or not the registration request message is received before the deregistration procedure has been completed,wherein, responsive to the registration request message being received before the deregistration procedure has been completed, the operation comprises:progressing the registration procedure; andaborting the deregistration procedure, andwherein, responsive to the registration request message being received not before the deregistration procedure has been completed, the operation comprises:progressing the deregistration procedure; andignoring the registration request message.
Citation Information
Patent Citations
Method for enhancing processing of prohibited SNPN list by UE and user equipment
CN114390523A
Handling Of Multiple Tracking Area Identifiers In Satellite Access
US20230224847A1
Cell barring for network slicing
US20230262580A1
UE Handling Of Forbidden TAI List Information Elements In EPS SERVICE ACCEPT In Mobile Communications
US20230388905A1