CN114125972A

CN114125972A - Network connection method and related device

Info

Publication number: CN114125972A
Application number: CN202111460974.4A
Authority: CN
Inventors: 王丽丽
Original assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Current assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date: 2021-12-01
Filing date: 2021-12-01
Publication date: 2022-03-01
Anticipated expiration: 2041-12-01
Also published as: CN114125972B

Abstract

The embodiment of the application provides a network connection method and a related device, which are applied to a terminal, wherein the method comprises the following steps: adding a TA value of a first tracking area corresponding to a first cell into a TA forbidden list under the condition that the terminal resides in the first cell and the registration failure frequency on the first cell reaches a preset frequency; determining a second cell through cell reselection operation, wherein the TA prohibition list comprises TA values of at least one cell except a second TA value corresponding to the second cell; sending a camping request to the second cell; determining whether the terminal is camped successfully on the second cell; and if the residence on the second cell is successful, sending a registration request to the second cell. Therefore, the TA with problems can not be selected by mistake again, the network connection efficiency is improved, and the network selection mode is optimized.

Description

Network connection method and related device

Technical Field

The present application belongs to the field of communications technologies, and in particular, to a network connection method and a related apparatus.

Background

Generally, a terminal receives a system message and then measures the signal strength of a cell to determine whether the cell can reside, and if the system information of the cell allows the terminal to reside, the terminal resides in a target cell, and selects a Public Land Mobile Network (PLMN) where the cell is located, so that the target cell becomes a serving cell of the terminal. The terminal then needs to establish contact with the network device through random access, so as to achieve synchronization with the cell.

Disclosure of Invention

The embodiment of the application provides a network connection method and a related device, which aim to improve the network connection efficiency and optimize the network selection mode.

In a first aspect, an embodiment of the present application provides a network connection method, which is applied to a terminal, and the method includes:

adding a TA value of a first tracking area corresponding to a first cell into a TA forbidden list under the condition that the terminal resides in the first cell and the registration failure frequency on the first cell reaches a preset frequency;

determining a second cell through cell reselection operation, wherein the TA prohibition list comprises TA values of at least one cell except a second TA value corresponding to the second cell;

sending a camping request to the second cell;

determining whether the terminal is camped successfully on the second cell;

and if the residence on the second cell is successful, sending a registration request to the second cell.

In a second aspect, an embodiment of the present application provides a network connection apparatus, which is applied to a terminal, and the apparatus includes:

a joining unit, configured to join a first TA value corresponding to a first cell into a TA barring list when the terminal resides in the first cell and a number of registration failures in the first cell reaches a preset number;

a first determining unit, configured to determine a second cell through a cell reselection operation, where the TA barring list includes a TA value of at least one cell except a second TA value corresponding to the second cell;

a first sending unit, configured to send a camping request to the second cell;

a second determining unit, configured to determine whether the terminal successfully camps on the second cell;

a second sending unit, configured to send a registration request to the second cell if the camping on the second cell is successful.

In a third aspect, an embodiment of the present application provides an electronic device, including a processor, a memory, a communication interface, and one or more programs, stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps in the first aspect of the embodiment of the present application.

In a fourth aspect, the present application provides a computer storage medium, which is characterized by storing a computer program for electronic data exchange, wherein the computer program enables a computer to perform some or all of the steps described in the first aspect of the present embodiment.

In a fifth aspect, embodiments of the present application provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, where the computer program is operable to cause a computer to perform some or all of the steps as described in the first aspect of the embodiments of the present application. The computer program product may be a software installation package.

It can be seen that, in this embodiment of the present application, when a terminal resides in a first cell, and a number of times of registration failure on the first cell reaches a preset number of times, a TA value of a first tracking area corresponding to the first cell is added to a TA barred list, a second cell is determined through a cell reselection operation, where the TA barred list includes TA values of at least one cell except for a second TA value corresponding to the second cell, a residence request is then sent to the second cell, it is then determined whether the terminal successfully resides on the second cell, and finally, if the terminal successfully resides on the second cell, a registration request is sent to the second cell. Therefore, the TA with problems can not be selected by mistake again, the network connection efficiency is improved, and the network selection mode is optimized.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

Fig. 1a is a system architecture diagram of a communication system according to an embodiment of the present application;

fig. 1b is a schematic structural diagram of a terminal according to an embodiment of the present application;

fig. 2a is a schematic flowchart of a network connection method according to an embodiment of the present application;

FIG. 2b is a schematic diagram of a processing sequence according to an embodiment of the present application;

fig. 2c is a schematic flowchart of another network connection method provided in the embodiment of the present application;

fig. 3 is a block diagram illustrating functional units of a network connection device according to an embodiment of the present disclosure;

fig. 4 is a block diagram of functional units of another network connection device according to an embodiment of the present disclosure.

Detailed Description

In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.

Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.

For better understanding of the technical solutions of the embodiments of the present application, the technical solutions of the embodiments of the present application will be described below with reference to the accompanying drawings.

Referring to fig. 1a, fig. 1a is a system architecture diagram of a communication system according to an embodiment of the present disclosure. The communication system 100 includes a terminal 110 and a network device 120, the terminal 110 being communicatively coupled to the network device 120.

The communication system 100 may be, for example: a Global System for Mobile communications (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a General Packet Radio Service (GPRS), a Long Term Evolution (Long Term Evolution, LTE) System, an Advanced Long Term Evolution (LTE-a) System, a New Radio (NR) System, an Evolution System of an NR System, an LTE (LTE-based Access to unlicensed spectrum, LTE-U) System on unlicensed spectrum, an NR (NR-based Access to unlicensed spectrum) System on unlicensed spectrum, a UMTS (Universal Mobile telecommunications System), or other next generation communication systems.

Generally, conventional Communication systems support a limited number of connections and are easy to implement, however, with the development of Communication technology, mobile Communication systems will support not only conventional Communication, but also, for example, Device-to-Device (D2D) Communication, Machine-to-Machine (M2M) Communication, Machine Type Communication (MTC), and Vehicle-to-Vehicle (V2V) Communication, and the embodiments of the present application can also be applied to these Communication systems. Optionally, the communication system in the embodiment of the present application may be applied to a Carrier Aggregation (CA) scenario, may also be applied to a Dual Connectivity (DC) scenario, and may also be applied to an independent (SA) networking scenario.

The frequency spectrum of the application is not limited in the embodiment of the present application. For example, the embodiments of the present application may be applied to a licensed spectrum and may also be applied to an unlicensed spectrum.

A terminal 110 in the embodiments of the present application may refer to a user equipment, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user device. The terminal may also be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a relay device, a vehicle-mounted device, a wearable device, a terminal in a future 5G network or a terminal in a future evolved Public Land Mobile Network (PLMN), and the like, which are not limited in this embodiment. As shown in fig. 1b, the terminal 110 in the terminal of the embodiment of the present application may include one or more of the following components: a processor 210, a memory 220, and a communication interface 230, the processor 210 being communicatively coupled to the memory 220 and the communication interface 230, respectively, the memory 220 further including one or more programs 221.

The embodiment of the present application does not particularly limit a specific structure of an execution subject of the method provided by the embodiment of the present application, as long as the communication can be performed according to the method provided by the embodiment of the present application by running a program recorded with codes of the method provided by the embodiment of the present application, for example, the execution subject of the method provided by the embodiment of the present application may be a terminal, or a functional module in the terminal that can call a program and execute the program.

The definitions or explanations of the concepts and terms referred to in this application are as follows.

Tracking Area (TA), which is a concept set up by the LTE system for location management of the UE. Which is defined as a free mobility area where the UE does not need to update the service. The TA function is to manage the location of the terminal, and may be divided into paging management and location update management. The UE informs an Evolved Packet Core (EPC) of its own TA through tracking area registration.

Public Land Mobile Networks (PLMNs), networks established and operated by governments or operators approved therefor for the purpose of providing Land Mobile services to the Public. The network is typically interconnected with the Public Switched Telephone Network (PSTN) to form a communications network of regional or national scale. A PLMN is a wireless communication system intended for land-based mobile users, such as vehicles or pedestrians. PLMNs may be used to distinguish between different operators, different Radio Access Technologies (RATs), and different network services of the same RAT of the same operator.

At present, when a terminal cannot register in a cell successfully for many times, the terminal needs to wait for a certain time before reselecting and registering the cell, but at this time, other cells of the TA with the problem may still be reselected, so that even if other TAs capable of providing normal service exist, the terminal still needs to wait for a certain time before reattempting to register in the original TA and obtaining the service.

In view of the foregoing problems, embodiments of the present application provide a network connection method and a related apparatus, and the following describes embodiments of the present application in detail with reference to the accompanying drawings.

Referring to fig. 2a, fig. 2a is a schematic flowchart illustrating a network connection method according to an embodiment of the present disclosure. The network connection method is applied to a terminal and comprises the following steps:

s201, when the terminal resides in a first cell and the number of registration failures in the first cell reaches a preset number, adding a TA value of a first tracking area corresponding to the first cell into a TA forbidden list.

The first cell may be any cell corresponding to the first TA. The preset number may be the maximum number of registration attempts specified in the protocol, for example, 5, or may be the number of registration attempts set by the user according to the requirement. When the number of times of the terminal trying to register reaches the preset number, the second timer is started, and then the first TA corresponding to the first cell is added into the TA forbidden list, that is, the first TA is a problematic TA. In particular, the second timer may be a T3502 timer or a T3402 timer.

S202, a second cell is determined through cell reselection operation, and the TA prohibition list comprises TA values of at least one cell except a second TA value corresponding to the second cell;

s203, sending a camping request to the second cell;

s204, determining whether the terminal successfully resides in the second cell;

s205, if the camping on the second cell is successful, sending a registration request to the second cell.

Since for the case where the number of attempts reaches the maximum, it is only the TA level that actually becomes problematic, i.e., if the restriction fails after the TA is replaced, the attempt can be made again. Therefore, only the TA needs to be correspondingly limited, the PLMN does not need to be limited, and the RAT capability does not need to be limited. Therefore, in this scheme, after the first TA is added to the TA barred list, the access stratum may be notified of the updated TA barred list, and the access stratum may be triggered to reselect. And the access layer reselects according to the updated TA forbidden list to acquire a second cell corresponding to a new TA which is not in the TA forbidden list, tries to camp and register on the second cell, and stops the second timer, and if the registration is successful, the terminal stays on the RAT of the PLMN corresponding to the first cell to acquire service. Specifically, if the camping in the second cell is successful, but the number of times of attempting registration in the second cell is greater than the preset number of times of not yet being successful, the second TA of the second cell may be added to the TA barring list, and the above operations may be repeated.

It can be seen that, in this example, when a terminal resides in a first cell and the number of times of registration failure on the first cell reaches a preset number, a TA value of a first tracking area corresponding to the first cell is added to a TA barred list, a second cell is determined through a cell reselection operation, the TA barred list includes TA values of at least one cell except for a second TA value corresponding to the second cell, then a residence request is sent to the second cell, then it is determined whether the terminal successfully resides on the second cell, and finally, if the terminal successfully resides on the second cell, a registration request is sent to the second cell. Therefore, the TA with problems can not be selected by mistake again, the network connection efficiency is improved, and the network selection mode is optimized.

In one possible example, after adding the first TA value corresponding to the first cell to a TA barring list, the method further includes: starting a first timer; moving the first TA value out of the TA inhibit list after the first timer times out if the first timer corresponds to the first TA value in the TA inhibit list; in a case that the first timer corresponds to all TA values in the TA barring list, moving a temporarily barred TA value in the TA barring list out of the TA barring list after the first timer times out, wherein the temporarily barred TA value comprises the first TA value.

The first timer T1 may be used to monitor the TA with a problem in the TA barring list. The first timer may be used for monitoring one TA, or may be used for monitoring TAs in the entire TA barring list. When the TA in question is no longer restricted, the timer corresponding to the specific TA may be stopped, and the specific TA is no longer restricted when the timer corresponding to the specific TA is expired. If the TA in the TA forbidden list shares one timer, namely when the TA with the first problem appears, the timer is started, and when the problem appears again in the subsequent new TA, the timer does not need to be restarted; when a certain TA is not limited any more, if other TA with problems exists, the timer continues to run, and if TA with problems does not exist any more, the timer can be stopped; when the timer times out, all problem TAs are no longer bounded. The terminal may mark the first TA as a temporarily prohibited TA while adding the first TA value to the TA prohibited list. In particular, the initial duration of the first timer may be related to the duration of the second timer, and when the first timer is first started, the duration T1 of the first timer is equal to the duration of the second timer, a preset duration deltaT, which is a constant and may be set to zero.

As can be seen, in this example, after the first timer expires, the TA value corresponding to the first timer is removed from the TA barring list, so that the terminal can be camped on the TA again, thereby improving the flexibility of network connection.

In one possible example, the terminal fails to camp on the second cell, and the method further includes: performing cell search according to a first Radio Access Technology (RAT) corresponding to a first Public Land Mobile Network (PLMN) of the first cell, and determining a third cell, wherein the TA prohibition list comprises TA values of at least one cell except a third TA value corresponding to the third cell; sending a camping request to the third cell; determining whether the terminal is camped successfully on the third cell; and if the residence on the third cell is successful, sending a registration request to the third cell.

The terminal may not find the second cell, but may not find the second cell after sending the camping request. If the access layer cannot find the second cell which is not in the TA forbidden list, the lost coverage information can be reported to the non-access layer, and the non-access layer informs the access layer to search the network on the first RAT corresponding to the first PLMN. The access layer also performs cell selection according to the TA value in the TA forbidden list. And if the third cell is found when network searching is executed on all frequency bands or frequency points supported by the first RAT corresponding to the first PLMN, the third cell is resided, if the residence is successful, a non-access layer is informed, a registration attempt is carried out in the third cell, at the moment, the second timer is stopped, and if the registration is successful, the terminal stops waiting for obtaining service on the first RAT corresponding to the first PLMN. Specifically, if the camping in the third cell is successful, but the registration attempt time of the third cell is greater than the preset registration time, and the registration has not been successful, the third TA of the third cell may be added to the TA barring list, and the above operations may be repeated.

In this example, if the terminal fails to camp in the second cell, network searching is performed again, and a new cell is obtained for camping and registering, instead of waiting for the second timer to timeout and reselect or obtain services on RATs of other low-priority PLMNs, so that network connection efficiency can be improved, and a network selection mode is optimized.

In one possible example, the terminal fails to camp on the third cell, and the method further includes: performing cell search according to a second RAT corresponding to a first PLMN of the first cell, and determining a fourth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fourth TA value corresponding to the fourth cell, and the second RAT is a RAT except the first RAT in the RAT corresponding to the first PLMN; sending a camping request to the fourth cell; determining whether the terminal is camped successfully on the fourth cell; and if the residence on the fourth cell is successful, sending a registration request to the fourth cell.

The terminal may not find the third cell, but may fail to camp after sending the camp-on request. If the access layer cannot find the proper cell residence in the first RAT corresponding to the first PLMN, the non-access layer informs the access layer to search for the network in other RATs corresponding to the first PLMN, the access layer performs network searching in all frequency bands or frequency points supported by the RAT selected by the first PLMN to obtain a fourth cell and performs residence in the fourth cell, if the residence is successful, the access layer is informed, a registration attempt is performed in the fourth cell, at the moment, the second timer is stopped, and if the registration is successful, the terminal stops waiting for the service obtained on the selected RAT of the first PLMN. Specifically, if the camping in the fourth cell is successful, but the registration attempt time of the fourth cell is greater than the preset registration time, the fourth TA of the fourth cell may be added to the TA barring list, and the above operations may be repeated.

As can be seen, in this example, the terminal may also perform network search on other RATs of the PLMN corresponding to the first cell, and does not need to wait for the second timer to timeout and then reselect or acquire service on RATs of other PLMNs with low priorities, so that the network connection efficiency may be improved and the network selection mode may be optimized.

In one possible example, the terminal fails to camp on the fourth cell, and the method further includes: performing cell search according to a second PLMN, and determining a fifth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fifth TA value corresponding to the fifth cell; sending a camping request to the fifth cell; determining whether the terminal is camped successfully on the fifth cell; and if the residence on the fifth cell is successful, sending a registration request to the fifth cell.

The failure of the terminal to camp on the fourth cell may be that the terminal finds the fourth cell, but the camping fails after sending the camping request, or that the terminal does not find the fourth cell. If the access stratum can not find a suitable cell residence on other RATs of the first PLMN, the non-access stratum informs the access stratum to perform network searching on other PLMNs, and at this time, the RAT corresponding to the second PLMN may be the first RAT or the second RAT. And the access layer executes network searching on all frequency bands or frequency points supported by the RAT selected by the second PLMN to determine a fifth cell, and resides on the fifth cell, if the residence is successful, the access layer is informed, registration attempt is carried out in the fifth cell, at the moment, the second timer is stopped, and if the registration is successful, the terminal stays to obtain service on the selected RAT of the second PLMN. Specifically, if the camping in the fifth cell is successful, but the registration attempt in the fifth cell is performed more than the preset number of times, and the registration has not been successful, the fifth TA of the fifth cell may be added to the TA barring list, and the above operations may be repeated.

Therefore, in this example, network searching and registration attempt may be performed on other PLMNs, which may improve flexibility of network connection.

In one possible example, the terminal fails to camp on the fifth cell, and the method further includes: and moving the first TA value out of the TA forbidden list, so that the terminal is resided in a sixth cell, wherein the sixth cell is a cell corresponding to the first TA value.

If the network connection modes are executed and the camping is not successful, it can be determined that only the cell corresponding to the first TA exists in the current environment, and the non-access stratum can remove the first TA from the TA barred list. And the access layer is informed of the updated TA barred list again, so that the access layer can successfully reside in the cell corresponding to the first TA. The sixth cell may also be the first cell described above. Specifically, at this time, if the first timer corresponds to a first TA, the first timer is stopped, and if the first timer corresponds to the TA prohibited list, it is determined whether the first TA is the last temporarily prohibited TA in the TA prohibited list, if so, the first timer is stopped, and if not, the first timer is kept running continuously.

In this example, it can be seen that, the first TA is removed from the TA barring list, so that the terminal may finally camp on the cell corresponding to the first TA, and the flexibility of network connection may be improved.

In one possible example, after the terminal camps on the sixth cell, the method further includes: determining a first remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list; when the first residual time length is longer than a first preset time length, starting a third timer; determining whether a service request is received before the second timer times out; if the service request is received, determining whether the third timer is in operation; and if the third timer is not in operation, sending a registration request to the sixth cell.

The preset duration may be equal to deltaT + duration threshold, and may be set according to a user requirement. The third timer is used for monitoring how long the timer can initiate re-attempt registration again after the scheme is finished in order to consider user demand response speed, network searching efficiency, power consumption and the like when only a problem TA exists in the environment. The duration of the third timer may be configured according to the requirement, and the duration may be [0, duration-deltaT of the second timer ]. In a specific implementation, if the third timer is not running, the second timer may be directly ignored, registration is tried again on the first TA, and if registration is successful, the second timer is stopped, and the service is continuously executed.

Therefore, in this example, whether to perform the registration request again on the first cell may be determined according to the working state of the third timer, so that the flexibility of network connection may be improved and the network selection mode may be optimized.

In one possible example, after the terminal camps on the sixth cell, the method further includes: determining a remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list; when the residual time length is greater than the preset time length, starting a third timer; determining whether a service request is received before the second timer times out; if the service request is received, determining whether the third timer is in operation; and if the third timer is in operation, caching the service requirement, and sending a registration request to the sixth cell until the third timer is overtime.

When the duration of the third timer is zero, it means that the user service request is received and then directly responded without waiting or buffering. It should be noted that, if the terminal does not receive the service request all the time during the operation of the second timer, after the second timer expires, the access stratum may perform the registration attempt again on the original sixth cell, or enter a new TA and perform the registration attempt again.

Therefore, in this example, the service request is cached, and then the registration request is sent to the first cell after the third timer is overtime, so that the reliability of data transmission can be improved.

In a possible example, after the terminal fails to register on the sixth cell and sends the registration request to the sixth cell, the method further includes: determining a second remaining duration of the second timer; adding the first TA value into the TA prohibition list under the condition that the second remaining duration is greater than a second preset duration; and rejecting the service request under the condition that the second remaining time length is less than or equal to the second preset time length.

The registration failure in the sixth cell may be failure after sending a registration request, or may be a registration failure in the sixth cell determined when the number of times of the registration request failure reaches a preset number. If the terminal fails to register in the sixth cell, it may be determined whether it is necessary to add the first TA of the sixth cell to the TA barring list again and perform a cell reselection operation according to the remaining duration of the second timer. And if the operation is executed again, the first timer needs to be restarted, and the duration of the first timer at this time is the remaining duration-deltaT of the second timer. Specifically, the operation may be performed again for multiple times until the terminal successfully registers in any one cell, or the operation may be performed again in a loop, and if the terminal does not successfully register in the cell, the user service is rejected, and the second timer is waited for to time out.

For example, as shown in fig. 2b, fig. 2b is a schematic diagram of a processing sequence according to an embodiment of the present disclosure. T2 is the duration of the second timer. At point a1, when the registration frequency of the terminal in the first cell is greater than the preset frequency, the second timer is started, the first TA value is added into the TA forbidden list, the first timer is started, the duration is T1, and the cell reselection operation is executed. At point a2, it is found that only a problem TA exists in the environment, the TA forbidden list is removed from the first TA value, the first TA value stays at the problem TA, and the third timer is started because the remaining time of the second timer is longer than the preset time length. At point a3, the third timer times out. At point a4, the user sends a service request to attempt registration in the sixth cell, but the registration still fails, and the process proceeds to point a 5. At point a5, because the remaining time of the second timer is longer than the preset time, the first TA value may be added to the TA barred list again, the cell reselection operation is performed, and the first timer is started again at the same time, where the time is T3. At point a6, it is found again that only the problem TA still exists in the environment, and the user service needs to be rejected, and at the same time, the remaining time of the second timer is longer than the preset time length, and the third timer is started again. At point a7, the third timer times out. At point A8, the second timer has less time remaining and has been less than the preset time period. At point a9, the user service request is received again and a sixth cell registration attempt is performed. At point a10, the registration attempt fails, and when the remaining time of the second timer is less than the preset time, the scheme is not executed. At point a11, the first timer times out and all temporarily prohibited TAs are deactivated. Until point a12, the second timer expires and a registration attempt at the new TA is performed. Meanwhile, if a user service request is received between a 2-A3 or between a 6-a 7, buffering is required until a point A3 and a point a7 can be executed.

Therefore, in this example, when the remaining duration of the second timing is sufficient, the above scheme may be repeatedly executed, so as to improve the efficiency and flexibility of network connection.

The present invention will be described with reference to a specific example.

Referring to fig. 2c, fig. 2c is a schematic flowchart illustrating another network connection method according to an embodiment of the present disclosure. As shown in the figure, when the terminal resides in the first cell and the number of registration failures in the first cell reaches a preset number, the second timer is started, the TA corresponding to the first cell is added to the TA barred list, the first timer T1 is started, and then the terminal performs cell reselection. If the access layer cell reselection is successful, initiating a registration request, if the access layer cell reselection is failed, searching the network on the RAT of the first PLMN, determining a second cell, and if the residence is successful on the second cell, initiating a residence request to the second cell. And if the residence in the second cell fails, searching the network on other RAT corresponding to the first PLMN to obtain a third cell, performing residence attempt on the third cell, and if the residence is successful, initiating a registration request to the third cell. If the residence in the third cell fails, network searching is carried out on other PLMN, a fourth cell is determined, a residence attempt is carried out on the fourth cell, and if the residence is successful, a registration request is initiated to the fourth cell. If the camping in the fourth cell fails, determining that the first TA is removed from the TA prohibition list as long as the cell corresponding to the first TA in the current environment is located. And if the residual time length of the second timer is greater than the preset value, starting a third timer. If the user service is received at the moment, judging whether the third timer is overtime or not, if not, caching the user service, if so, initiating a registration request to the cell corresponding to the first TA value again, if the registration fails, judging whether the residual time of the second timer is greater than a preset value or not, and if so, re-performing cell reselection and other operations. In particular, if the first timer times out, the temporary TA prohibited list corresponding to the first timer is removed from the TA prohibited list according to the TA content corresponding to the first timer.

Referring to fig. 3, fig. 3 is a block diagram illustrating functional units of a network connection device according to an embodiment of the present disclosure. The network connection device 30 is applied to a terminal, and the device 30 includes: a adding unit 301, configured to add a first TA value corresponding to a first cell into a TA barring list when the terminal resides in the first cell and a number of registration failures in the first cell reaches a preset number; a first determining unit 302, configured to determine a second cell through a cell reselection operation, where the TA barred list includes TA values of at least one cell except for a second TA value corresponding to the second cell; a first sending unit 303, configured to send a camping request to the second cell; a second determining unit 304, configured to determine whether the terminal successfully camps on the second cell; a second sending unit 305, configured to send a registration request to the second cell if the camping on the second cell is successful.

In one possible example, after adding the first TA value corresponding to the first cell to the TA barred list, the apparatus 30 is further configured to: starting a first timer; moving the first TA value out of the TA inhibit list after the first timer times out if the first timer corresponds to the first TA value in the TA inhibit list; in a case that the first timer corresponds to all TA values in the TA barring list, moving a temporarily barred TA value in the TA barring list out of the TA barring list after the first timer times out, wherein the temporarily barred TA value comprises the first TA value.

In one possible example, the terminal fails to camp on the second cell, and the apparatus 30 is further configured to: performing cell search according to a first Radio Access Technology (RAT) corresponding to a first Public Land Mobile Network (PLMN) of the first cell, and determining a third cell, wherein the TA prohibition list comprises TA values of at least one cell except a third TA value corresponding to the third cell; sending a camping request to the third cell; determining whether the terminal is camped successfully on the third cell; and if the residence on the third cell is successful, sending a registration request to the third cell.

In one possible example, the terminal fails to camp on the third cell, and the apparatus 30 is further configured to: performing cell search according to a second RAT corresponding to a first PLMN of the first cell, and determining a fourth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fourth TA value corresponding to the fourth cell, and the second RAT is a RAT except the first RAT in the RAT corresponding to the first PLMN; sending a camping request to the fourth cell; determining whether the terminal is camped successfully on the fourth cell; and if the residence on the fourth cell is successful, sending a registration request to the fourth cell.

In one possible example, the terminal fails to camp on the fourth cell, and the apparatus 30 is further configured to: performing cell search according to a second PLMN, and determining a fifth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fifth TA value corresponding to the fifth cell; sending a camping request to the fifth cell; determining whether the terminal is camped successfully on the fifth cell; and if the residence on the fifth cell is successful, sending a registration request to the fifth cell.

In a possible example, the terminal fails to camp on the fifth cell, and the apparatus 30 is further configured to: and moving the first TA value out of the TA forbidden list, so that the terminal is resided in a sixth cell, wherein the sixth cell is a cell corresponding to the first TA value.

In one possible example, after the terminal camps on the sixth cell, the apparatus 30 is further configured to: determining a first remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list; when the first residual time length is longer than a first preset time length, starting a third timer; determining whether a service request is received before the second timer times out; if the service request is received, determining whether the third timer is in operation; and if the third timer is not in operation, sending a registration request to the sixth cell.

In one possible example, after the terminal camps on the sixth cell, the apparatus 30 is further configured to: determining a remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list; when the residual time length is greater than the preset time length, starting a third timer; determining whether a service request is received before the second timer times out; if the service request is received, determining whether the third timer is in operation; and if the third timer is in operation, caching the service requirement, and sending a registration request to the sixth cell until the third timer is overtime.

In a possible example, after the terminal fails to register in the sixth cell and sends the registration request to the sixth cell, the apparatus 30 is further configured to: determining a second remaining duration of the second timer; adding the first TA value into the TA prohibition list under the condition that the second remaining duration is greater than a second preset duration; and rejecting the service request under the condition that the second remaining time length is less than or equal to the second preset time length.

It can be understood that, since the method embodiment and the apparatus embodiment are different presentation forms of the same technical concept, the content of the method embodiment portion in the present application should be synchronously adapted to the apparatus embodiment portion, and is not described herein again.

In the case of using an integrated unit, as shown in fig. 4, fig. 4 is a block diagram of functional units of another network connection device provided in the embodiment of the present application. In fig. 4, the network connection device 400 includes: a processing module 412 and a communication module 411. The processing module 412 is used to control and manage the actions of the network connection device, such as the steps of the joining unit 301, the first determining unit 302, the first sending unit 303, the second determining unit 304, and the second sending unit 305, and/or other processes for performing the techniques described herein. The communication module 411 is used for interaction between the network connection device and other devices. As shown in fig. 4, the network connection device may further include a storage module 413, and the storage module 413 is used for storing program codes and data of the network connection device.

The Processing module 412 may be a Processor or a controller, and may be, for example, a Central Processing Unit (CPU), a general-purpose Processor, a Digital Signal Processor (DSP), an ASIC, an FPGA or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, DSPs, and microprocessors, among others. The communication module 411 may be a transceiver, an RF circuit or a communication interface, etc. The storage module 413 may be a memory.

All relevant contents of each scene related to the method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again. The network connection device 400 may perform the network connection method shown in fig. 2 a.

The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the electronic device includes hardware structures and software modules for performing the respective functions in order to realize the functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative elements and algorithm steps described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.

Embodiments of the present application further provide a chip, where the chip includes a processor, configured to call and run a computer program from a memory, so that a device in which the chip is installed performs some or all of the steps described in the electronic device in the above method embodiments.

Embodiments of the present application also provide a computer storage medium, where the computer storage medium stores a computer program for electronic data exchange, the computer program enabling a computer to execute part or all of the steps of any one of the methods described in the above method embodiments, and the computer includes an electronic device.

Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any of the methods as described in the above method embodiments. The computer program product may be a software installation package, the computer comprising an electronic device.

It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.

In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit may be stored in a computer readable memory if it is implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the above-mentioned method of the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.

Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.

The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications can be easily made by those skilled in the art without departing from the spirit and scope of the present invention, and it is within the scope of the present invention to include different functions, combination of implementation steps, software and hardware implementations.

Claims

1. A network connection method is applied to a terminal, and the method comprises the following steps:

sending a camping request to the second cell;

determining whether the terminal is camped successfully on the second cell;

2. The method of claim 1, wherein after adding the first TA value corresponding to the first cell to a TA prohibit list, the method further comprises:

starting a first timer;

moving the first TA value out of the TA inhibit list after the first timer times out if the first timer corresponds to the first TA value in the TA inhibit list;

in a case that the first timer corresponds to all TA values in the TA barring list, moving a temporarily barred TA value in the TA barring list out of the TA barring list after the first timer times out, wherein the temporarily barred TA value comprises the first TA value.

3. The method of claim 1 or 2, wherein the terminal fails to camp on the second cell, the method further comprising:

performing cell search according to a first Radio Access Technology (RAT) corresponding to a first Public Land Mobile Network (PLMN) of the first cell, and determining a third cell, wherein the TA prohibition list comprises TA values of at least one cell except a third TA value corresponding to the third cell;

sending a camping request to the third cell;

determining whether the terminal is camped successfully on the third cell;

and if the residence on the third cell is successful, sending a registration request to the third cell.

4. The method of claim 3, wherein the terminal fails to camp on the third cell, and wherein the method further comprises:

performing cell search according to a second RAT corresponding to a first PLMN of the first cell, and determining a fourth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fourth TA value corresponding to the fourth cell, and the second RAT is a RAT except the first RAT in the RAT corresponding to the first PLMN;

sending a camping request to the fourth cell;

determining whether the terminal is camped successfully on the fourth cell;

and if the residence on the fourth cell is successful, sending a registration request to the fourth cell.

5. The method of claim 4, wherein the terminal fails to camp on the fourth cell, and wherein the method further comprises:

performing cell search according to a second PLMN, and determining a fifth cell, wherein the TA prohibition list comprises TA values of at least one cell except a fifth TA value corresponding to the fifth cell;

sending a camping request to the fifth cell;

determining whether the terminal is camped successfully on the fifth cell;

and if the residence on the fifth cell is successful, sending a registration request to the fifth cell.

6. The method of claim 5, wherein the terminal fails to camp on the fifth cell, and wherein the method further comprises:

and moving the first TA value out of the TA forbidden list, so that the terminal is resided in a sixth cell, wherein the sixth cell is a cell corresponding to the first TA value.

7. The method of claim 6, wherein after the terminal camps on a sixth cell, the method further comprises:

determining a first remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list;

when the first residual time length is longer than a first preset time length, starting a third timer;

determining whether a service request is received before the second timer times out;

if the service request is received, determining whether the third timer is in operation;

and if the third timer is not in operation, sending a registration request to the sixth cell.

8. The method of claim 6, wherein after the terminal camps on a sixth cell, the method further comprises:

determining a remaining duration of a second timer, the second timer being opened before adding the first TA value to the TA prohibit list;

when the residual time length is greater than the preset time length, starting a third timer;

and if the third timer is in operation, caching the service requirement, and sending a registration request to the sixth cell until the third timer is overtime.

9. The method according to claim 7 or 8, wherein the terminal fails to register on the sixth cell, and after the sending of the registration request to the sixth cell, the method further comprises:

determining a second remaining duration of the second timer;

adding the first TA value into the TA prohibition list under the condition that the second remaining duration is greater than a second preset duration;

and rejecting the service request under the condition that the second remaining time length is less than or equal to the second preset time length.

10. A network connection device, applied to a terminal, the device comprising:

a first sending unit, configured to send a camping request to the second cell;

11. An electronic device comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method of any of claims 1-9.

12. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-9.