Handling equivalent PLMN list upon PLMN being not allowed to operate at a present UE location in mobile communications
The UE addresses undefined behavior by deleting the equivalent PLMN list and resetting counters upon receiving cause #78, ensuring proper PLMN handling and smooth network operations.
Patent Information
- Application Number
- PCT/CN2025/077773
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-02-27
- Filing Date
- 2025-02-18
- Publication Date
- 2025-09-04
AI Technical Summary
In mobile communications, when a PLMN is not allowed to operate at a present UE location, the equivalent PLMN list is not properly handled, leading to undefined behavior in the UE, particularly when cause #78 is received during EPS or 5GMM procedures, resulting in incomplete deletion of registered PLMNs and TAs.
The UE is designed to delete the equivalent PLMN list and reset relevant counters upon receiving cause #78, storing the PLMN identity and geographical location, and enter a PLMN search state to handle the equivalent PLMN list effectively.
This solution ensures proper handling of the equivalent PLMN list, preventing undefined behavior and facilitating smooth cell selection/reselection by performing a PLMN selection process when a PLMN is not allowed at the UE's location.
Smart Images

Figure CN2025077773_04092025_PF_FP_ABST
Abstract
Description
HANDLING EQUIVALENT PLMN LIST UPON PLMN BEING NOT ALLOWED TO OPERATE AT A PRESENT UE LOCATION IN MOBILE COMMUNICATIONSCROSS REFERENCE TO RELATED PATENT APPLICATION (S)
[0001] The present disclosure claims the priority benefit of Indian Patent Application No. 202421014102, filed 27 February 2024, the content of which herein being incorporated by reference in its entirety.TECHNICAL FIELD
[0002] The present disclosure is generally related to mobile communications and, more particularly, to handling an equivalent public land mobile network (PLMN) list upon a PLMN being not allowed to operate at a present user equipment (UE) location in mobile communications.BACKGROUND
[0003] In wireless communications such as mobile communications under the current 3rd Generation Partnership Project (3GPP) specification, when cause #78 is received by a UE for Evolved Packet System (EPS) Mobility Management (EMM) or 5th Generation Mobility Management (5GMM) procedures, then the UE is to set the 5th Generation System (5GS) update status to 5U3 ROAMING NOT ALLOWED (and store it according to subclause 5.1.3.2.2 of the 3GPP Technical Specification (TS) ) and the UE is to delete the last visited registered tracking area identity (TAI) and a TAI list. In case that the UE is not registering or has not registered to the same PLMN over both 3GPP access and non-3GPP access, the UE is to additionally delete the 5th Generation Global Unique Temporary Identifier (5G-GUTI) and ngKSI. Additionally, the UE is to reset the registration attempt counter. The UE is to store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" and the UE is to start a corresponding timer instance (per subclause 4.23.2 of the 3GPP TS) . Moreover, the UE is to enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection.
[0004] However, when cause #78 is received, the UE is to delete the registered PLMN and registered TAs, but the equivalent PLMN (eqPLMN or EPLMN) list is still present. In an event that the UE does not delete the eqPLMN list (which is stored in any MM (e.g., EMM or 5GMM) , then the UE is to perform a cell selection / reselection procedure without the presence of a registered PLMN. Yet, doing so would result in undefined behavior (s) in or by the UE. Therefore, there is a need for a solution of handling an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location in mobile communications.SUMMARY
[0005] 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.
[0006] 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 an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location 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.
[0007] In one aspect, a method may involve a UE receiving, from a network, a cause with a value indicating that a PLMN is not allowed to operate at a present UE location. The method may also involve the UE deleting a list of one or more equivalent PLMNs responsive to receiving the cause.
[0008] In another aspect, a method may involve a UE receiving, from a network, an MM message containing a cause with a value indicating that a PLMN is not allowed to operate at a present UE location. The method may also involve the UE resetting a service request attempt counter responsive to receiving the cause in the MM message.
[0009] 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) / New Radio (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, 4th Generation (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
[0010] 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.
[0011] 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.
[0012] FIG. 2 is a block diagram of an example communication system under a proposed scheme in accordance with the present disclosure.
[0013] FIG. 3 is a flowchart of a second example process under a proposed scheme in accordance with the present disclosure.
[0014] FIG. 4 is a flowchart of a second example process under a proposed scheme in accordance with the present disclosure. DETAILED DESCRIPTION OF PREFERRED IMPLEMENTATIONS
[0015] 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
[0016] Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and / or solutions pertaining to handling an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location 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.
[0017] 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. 4 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. 4.
[0018] 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 an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location in mobile communications in accordance with the present disclosure, as described herein.
[0019] 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.
[0020] When a cause #78, which indicates that a PLMN is not allowed to operate at the present UE location, is received from a non-satellite Evolved UMTS Terrestrial Radio Access (E-UTRA) cell, it is considered as an abnormal case and the behavior of a UE (e.g., UE 110) may be in accordance with the various proposed schemes in accordance with the present disclosure as described below.
[0021] Under a proposed scheme in accordance with the present disclosure, when a cause #78 is received by UE 110 in any message such as any EMM message, 5GMM message or 6th Generation Mobility Management (6GMM) message (e.g., ATTACH REJECT, TAU REJECT, DL NAS TRANSPORT, REGISTRATION REJECT, SERVICE REJECT, and so on) from wireless network 120, UE 110 may delete a list of equivalent PLMN (which may be stored in any MM (e.g., EMM or 5GMM or 6GMM or the like) ) .
[0022] Under another proposed scheme in accordance with the present disclosure, when a cause #78 is received by UE 110 in an MM message, UE 110 may reset a service request attempt counter. The MM message may be, for example and not limited to, an EMM service reject message, 5GMM service reject message, or downlink (DL) non-access stratum (NAS) transport message.
[0023] In one implementational example, when UE 110 receives a cause #78, UE 110 may set the EPS update status to EU3 ROAMING NOT ALLOWED (and store it according to clause 5.1.3.3 of 3GPP TS 23.122) , and UE 110 may delete the list of equivalent PLMNs, any GUTI, last visited registered TAI, TAI list and eKSI. Additionally, UE 110 may reset an attach attempt counter, a tracking area updating (TAU) attempt counter, and / or a service request attempt counter. Moreover, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" . Furthermore, UE 110 may start a corresponding timer instance, enter the state of EMM-DEREGISTERED. PLMN-SEARCH, and perform a PLMN selection according to 3GPP TS 23.122.
[0024] In another implementational example, when UE 110 receives a cause #78, if the cause is received from a satellite next-generation radio access network (NG-RAN) cell, UE 110 may not send the uplink (UL) non-access stratum (NAS) TRANSPORT message to transport any of the data types listed in subclause 5.4.5.2.1 of the 3GPP TS. Additionally, UE 110 may delete the list of equivalent PLMNs, last visited registered TAI and TAI list. In case that UE 110 is not registering or has not registered to the same PLMN over non-3GPP access, UE 110 may additionally delete 5G-GUTI and ngKSI. Moreover, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" , and UE 110 may start a corresponding timer instance. Furthermore, UE 110 may enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection according to 3GPP TS 23.122.
[0025] In another implementational example, when UE 110 receives a cause #78, UE 110 may set the 5GS update status to 5U3 ROAMING NOT ALLOWED (and may store it according to subclause 5.1.3.2.2 of the 3GPP TS) and may delete the list of equivalent PLMNs, last visited registered TAI and TAI list. In case that UE 110 is not registering or has not registered to the same PLMN over non-3GPP access, UE 110 may additionally delete 5G-GUTI and ngKSI. Additionally, UE 110 may reset the registration attempt counter. Also, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" and UE 110 may start a corresponding timer instance. Moreover, UE 110 may enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection according to 3GPP TS 23.122.
[0026] In another implementational example, when UE 110 receives a cause #78, UE 110 may set the 5GS update status to 5U3 ROAMING NOT ALLOWED (and may store it according to subclause 5.1.3.2.2 of the 3GPP TS) and UE 110 may delete the list of equivalent PLMNs, last visited registered TAI and TAI list. In case that UE 110 is not registering or has not registered to the same PLMN over both 3GPP access and non-3GPP access, UE 110 may additionally delete 5G-GUTI and ngKSI. Additionally, UE 110 may reset the registration attempt counter. Moreover, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" and may start a corresponding timer instance. Furthermore, UE 110 may enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection according to 3GPP TS 23.122.
[0027] In yet another implementational example, when UE 110 receives a cause #78, UE 110 may set the 5GS update status to 5U3 ROAMING NOT ALLOWED (and may store it according to subclause 5.1.3.2.2 of the 3GPP TS) and UE 110 may delete the list of equivalent PLMNs, last visited registered TAI and TAI list. In case that UE 110 is not registering or has not registered to the same PLMN over both 3GPP access and non-3GPP access, UE 110 may additionally delete 5G-GUTI and ngKSI. Additionally, UE 110 may reset the registration attempt counter. Also, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" and may start a corresponding timer instance. Moreover, UE 110 may enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection according to 3GPP TS 23.122.
[0028] In still another implementational example, when UE 110 receives a cause #78, UE 110 may set the 5GS update status to 5U3 ROAMING NOT ALLOWED (and may store it according to subclause 5.1.3.2.2) and UE 110 may delete the list of equivalent PLMNs, last visited registered TAI and TAI list. In case that UE 110 is not registering or has not registered to the same PLMN over both 3GPP access and non-3GPP access, UE 110 may additionally delete 5G-GUTI and ngKSI. Additionally, UE 110 may reset the service request attempt counter. Moreover, UE 110 may store the PLMN identity and, if it is known, the current geographical location in the list of "PLMNs not allowed to operate at the present UE location" and may start a corresponding timer instance (see subclause 4.23.2) . Furthermore, UE 110 may enter the state of 5GMM-DEREGISTERED. PLMN-SEARCH and perform a PLMN selection according to 3GPP TS 23.122. Illustrative Implementations
[0029] 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 an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location 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.
[0030] 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 eNodeB 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.
[0031] 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.
[0032] 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 an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location in mobile communications in accordance with various implementations of the present disclosure.
[0033] 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.
[0034] 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.
[0035] 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 and 400. Illustrative Processes
[0036] FIG. 3 illustrates an example process 300 in accordance with an implementation of the present disclosure. Process 300 may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, process 300 may represent an aspect of the proposed concepts and schemes pertaining to handling an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location in mobile communications in accordance with the present disclosure. Process 300 may include one or more operations, actions, or functions as illustrated by one or more of blocks 310 and 320. Although illustrated as discrete blocks, various blocks of process 300 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks / sub-blocks of process 300 may be executed in the order shown in FIG. 3 or, alternatively, in a different order. Furthermore, one or more of the blocks / sub-blocks of process 300 may be executed repeatedly or iteratively. Process 300 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, process 300 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) . Process 300 may begin at block 310.
[0037] At 310, process 300 may involve processor 212 of apparatus 210, as UE 110, receiving, via transceiver 216, from a network (e.g., via apparatus 220 as network node 125) a cause with a value indicating that a PLMN is not allowed to operate at a present UE location. Process 300 may proceed from 310 to 320.
[0038] At 320, process 300 may involve processor 212 deleting a list of one or more equivalent PLMNs responsive to the receiving.
[0039] In some implementations, in receiving the cause, process 300 may involve processor 212 receiving the cause in an EMM message or a 5GMM message.
[0040] In some implementations, in receiving the cause, process 300 may involve processor 212 receiving the cause in an attach reject message, a TAU reject message, a DL NAS transport message, a registration reject message or a service reject message.
[0041] In some implementations, in receiving the cause, process 300 may involve processor 212 receiving a cause #78.
[0042] In some implementations, in deleting the list of one or more PLMNs, process 300 may involve processor 212 deleting the list of one or more equivalent PLMNs which is stored in an MM. In some implementations, the MM may include an EMM or a 5GMM.
[0043] In some implementations, in receiving the cause, process 300 may involve processor 212 receiving the cause in an MM message.
[0044] In some implementations, the MM message may include an EMM service reject message, a 5GMM service reject message or a DL NAS transport message.
[0045] In some implementations, process 300 may further involve processor 212 resetting a service request attempt counter responsive to receiving the cause in the MM message.
[0046] FIG. 4 illustrates an example process 400 in accordance with an implementation of the present disclosure. Process 400 may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, process 400 may represent an aspect of the proposed concepts and schemes pertaining to handling an equivalent PLMN list upon a PLMN being not allowed to operate at a present UE location in mobile communications in accordance with the present disclosure. Process 400 may include one or more operations, actions, or functions as illustrated by one or more of blocks 410 and 420. Although illustrated as discrete blocks, various blocks of process 400 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks / sub-blocks of process 400 may be executed in the order shown in FIG. 4 or, alternatively, in a different order. Furthermore, one or more of the blocks / sub-blocks of process 400 may be executed repeatedly or iteratively. Process 400 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, process 400 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) . Process 400 may begin at block 410.
[0047] At 410, process 400 may involve processor 212 of apparatus 210, as UE 110, receiving, via transceiver 216, from a network (e.g., via apparatus 220 as network node 125) an MM message containing a cause with a value indicating that a PLMN is not allowed to operate at a present UE location. Process 400 may proceed from 410 to 420.
[0048] At 420, process 400 may involve processor 212 resetting a service request attempt counter responsive to receiving the cause in the MM message.
[0049] In some implementations, the MM message may include an EMM service reject message, a 5GMM service reject message or a DL NAS transport message. Additional Notes
[0050] 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.
[0051] 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.
[0052] 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. ”
[0053] 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) , from a network a cause with a value indicating that a public land mobile network (PLMN) is not allowed to operate at a present UE location; anddeleting, by the processor, a list of one or more equivalent PLMNs responsive to the receiving.2.The method of claim 1, wherein the receiving of the cause comprises receiving the cause in an Evolved Packet System (EPS) Mobility Management (EMM) message or a 5th Generation Mobility Management (5GMM) message.3.The method of claim 1, wherein the receiving of the cause comprises receiving the cause in an attach reject message, a tracking area updating (TAU) reject message, a downlink (DL) non-access stratum (NAS) transport message, a registration reject message or a service reject message.4.The method of claim 1, wherein the receiving of the cause comprises receiving a cause #78.5.The method of claim 1, wherein the deleting comprises deleting the list of one or more equivalent PLMNs which is stored in a mobility management (MM) .6.The method of claim 5, wherein the MM comprises an Evolved Packet System (EPS) Mobility Management (EMM) or a 5th Generation Mobility Management (5GMM) .7.The method of claim 1, wherein the receiving of the cause comprises receiving the cause in a Mobility Management (MM) message.8.The method of claim 7, wherein the MM message comprises an Evolved Packet System (EPS) Mobility Management (EMM) service reject message, a 5th Generation Mobility Management (5GMM) service reject message or a downlink (DL) non-access stratum (NAS) transport message.9.The method of Claim 7, further comprising:resetting, by the processor, a service request attempt counter responsive to receiving the cause in the MM message.10.A method, comprising:receiving, by a processor of a user equipment (UE) , from a network a Mobility Management (MM) message containing a cause with a value indicating that a public land mobile network (PLMN) is not allowed to operate at a present UE location; andresetting, by the processor, a service request attempt counter responsive to receiving the cause in the MM message.11.The method of claim 10, wherein the MM message comprises an Evolved Packet System (EPS) Mobility Management (EMM) service reject message, a 5th Generation Mobility Management (5GMM) service reject message or a downlink (DL) non-access stratum (NAS) transport message.12.An apparatus implementable in a user equipment (UE) , comprising:a transceiver configured to communicate wirelessly; anda processor coupled to the transceiver and configured to perform operations comprising:receiving, via the transceiver, from a network a cause with a value indicating that a public land mobile network (PLMN) is not allowed to operate at a present UE location; anddeleting a list of one or more equivalent PLMNs responsive to the receiving.13.The apparatus of claim 12, wherein the receiving of the cause comprises receiving the cause in an Evolved Packet System (EPS) Mobility Management (EMM) message or a 5th Generation Mobility Management (5GMM) message.14.The apparatus of claim 12, apparatus of claim 12, wherein the receiving of the cause comprises receiving the cause in an attach reject message, a tracking area updating (TAU) reject message, a downlink (DL) non-access stratum (NAS) transport message, a registration reject message or a service reject message.15.The apparatus of claim 12, wherein the receiving of the cause comprises receiving a cause #78.16.The apparatus of claim 12, apparatus of claim 12, wherein the deleting comprises deleting the list of one or more equivalent PLMNs which is stored in a mobility management (MM) .17.The apparatus of claim 16, wherein the MM comprises an Evolved Packet System (EPS) Mobility Management (EMM) or a 5th Generation Mobility Management (5GMM) .18.The apparatus of claim 12, wherein the receiving of the cause comprises receiving the cause in a Mobility Management (MM) message.19.The apparatus of claim 18, wherein the MM message comprises an Evolved Packet System (EPS) Mobility Management (EMM) service reject message, a 5th Generation Mobility Management (5GMM) service reject message or a downlink (DL) non-access stratum (NAS) transport message.20.The apparatus of claim 18, wherein the processor is further configured to perform operations comprising:resetting, by the processor, a service request attempt counter responsive to receiving the cause in the MM message.
Citation Information
Patent Citations
Preventing a mobile device from repeating a request toward a mobile network
US20160345243A1
Network selection for satellite access
US20220110051A1
Public Land Mobile Network Selection for Non-Terrestrial Networks
US20220232464A1
Handling of PLMN-specific attempt counter in mobile communications
WO2019214716A1
Method and apparatus for PLMN search and selection after removal of entry in wireless network
WO2023244015A1