CN111294878B

CN111294878B - Network searching method and device, storage medium and terminal

Info

Publication number: CN111294878B
Application number: CN201910526903.6A
Authority: CN
Inventors: 倪金金
Original assignee: Spreadtrum Communications Shanghai Co Ltd
Current assignee: Spreadtrum Communications Shanghai Co Ltd
Priority date: 2019-06-18
Filing date: 2019-06-18
Publication date: 2022-02-25
Anticipated expiration: 2039-06-18
Also published as: CN111294878A

Abstract

A network searching method and device, a storage medium and a terminal comprise: judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network; if the neighbor cell belonging to the second network is configured, searching a third network by adopting element values in a preset first period time length set, otherwise, searching the third network by adopting element values in a preset second period time length set, wherein at least one element value smaller than the element value exists in the second period time length set for each element value in the first period time length set; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship. The invention can quickly search for the network expected to reside in a plurality of networks which do not completely have an interoperation relationship.

Description

Network searching method and device, storage medium and terminal

Technical Field

The present invention relates to the field of wireless communication technologies, and in particular, to a network search method and apparatus, a storage medium, and a terminal.

Background

After a User Equipment (UE) of a current Fifth-Generation mobile communication (5G) network resides in a 2G network or a 3G network (abbreviated as a 2G/3G network), The 2G/3G network and The 5G network cannot directly return to The 5G network from The 2G/3G network through reselection or The like because The 2G/3G network has no neighboring cell relationship with The 5G network.

In the prior art, a method of periodically performing 5G network search is generally adopted to check whether to recover 5G network coverage. The period duration of network search in the 5G network may be fixed or gradually increased, but both search methods have lower efficiency.

Disclosure of Invention

The technical problem solved by the invention is how to quickly search for a network expected to reside in a plurality of networks which do not completely have an interoperation relationship.

To solve the foregoing technical problem, an embodiment of the present invention provides a network search method, including: judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network; if the neighbor cell belonging to the second network is configured, searching a third network by adopting element values in a preset first period time length set, otherwise, searching the third network by adopting element values in a preset second period time length set, wherein at least one element value smaller than the element value exists in the second period time length set for each element value in the first period time length set; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship.

Optionally, the number of elements in the first set of cycle durations is 1, and the value of each element is a fixed value.

Optionally, the number of elements in the second periodic time duration set is 1, and the value of each element is a fixed value.

Optionally, the number of the elements in the first period time length set is multiple, and when the third network is searched, the values of the elements in the first period time length set are increased with the increase of the number of searches.

Optionally, the number of the elements in the second period duration set is multiple, and when searching for the third network, the values of the elements in the second period duration set increase with the increase of the number of searches.

Optionally, the network searching method further includes: attempting to camp on a cell belonging to the third network when the third network is searched.

Optionally, the first network is a 2G network or a 3G network, the second network is a 4G network, and the third network is a 5G network.

In order to solve the above technical problem, an embodiment of the present invention further provides a network search apparatus, including: the judging module is suitable for judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network; an adoption module, adapted to search a third network using element values in a preset first periodic time duration set if a neighboring cell belonging to the second network is configured, or adapted to search the third network using element values in a preset second periodic time duration set, for each element value in the first periodic time duration set, at least one element value in the second periodic time duration set being smaller than the element value; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship.

To solve the above technical problem, an embodiment of the present invention further provides a storage medium having stored thereon computer instructions, where the computer instructions execute the steps of the above method when executed.

In order to solve the foregoing technical problem, an embodiment of the present invention further provides a terminal, including a memory and a processor, where the memory stores computer instructions executable on the processor, and the processor executes the computer instructions to perform the steps of the foregoing method.

Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:

the embodiment of the invention provides a network searching method, which comprises the following steps: judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network; if the neighbor cell belonging to the second network is configured, searching a third network by adopting element values in a preset first period time length set, otherwise, searching the third network by adopting element values in a preset second period time length set, wherein at least one element value smaller than the element value exists in the second period time length set for each element value in the first period time length set; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship. Compared with the prior art, the embodiment of the invention can dynamically adjust the search period for searching other networks (such as 5G networks) under different access networks (such as 2G/3G networks), and can quickly reside in the other networks under the condition of saving power consumption as much as possible. Specifically, when the terminal coexists in multiple radio access networks and each radio access network does not completely have an interworking relationship (for example, the first network and the third network do not have an interworking relationship), if the current network to which the terminal belongs can be restored to the other network through a third network (which has an interworking relationship with both the current network and the other network), the other network can be searched with a larger cycle duration, so as to save the power consumption of the terminal and effectively guarantee the delay requirement for accessing the other network. If no third-party network which has an interoperation relationship with the current network and the other networks exists, the other networks can be searched by adopting a shorter period time, and the searching frequency of the third-party network is properly increased, so that the third-party network can be timely and quickly resided to the third-party network, and the network searching efficiency is improved.

Further, the first network is a 2G network or a 3G network, the second network is a 4G network, and the third network is a 5G network. The embodiment of the invention can realize the dynamic adjustment of the period duration for searching the 5G network and improve the network searching efficiency by judging whether the home cell has the 4G neighbor cell configuration when the 5G UE resides in the 2G/3G network.

Drawings

Fig. 1 is a flowchart illustrating a network searching method according to an embodiment of the present invention;

fig. 2 is a schematic flow chart of a network searching method in a typical scenario according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a network searching apparatus according to an embodiment of the present invention.

Detailed Description

As background art shows, in the prior art, no matter whether a UE in a 2G/3G network has 4G neighbor configuration, the UE searches for a 5G network with the same period duration, which results in large power consumption of the terminal and low network search efficiency.

The embodiment of the invention provides a network searching method, which comprises the following steps: judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network; if the neighbor cell belonging to the second network is configured, searching a third network by adopting element values in a preset first period time length set, otherwise, searching the third network by adopting element values in a preset second period time length set, wherein at least one element value smaller than the element value exists in the second period time length set for each element value in the first period time length set; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship.

Compared with the prior art, the embodiment of the invention can dynamically adjust the search period for searching other networks (such as 5G networks) under different access networks (such as 2G/3G networks), and can quickly reside in the other networks under the condition of saving power consumption as much as possible.

Specifically, when the terminal coexists in multiple radio access networks and each radio access network does not completely have an interworking relationship (for example, the first network and the third network do not have an interworking relationship), if the current network to which the terminal belongs can be restored to the other network through a third network (which has an interworking relationship with both the current network and the other network), the other network can be searched with a larger cycle duration, so as to save the power consumption of the terminal and effectively guarantee the delay requirement for accessing the other network.

If no third-party network which has an interoperation relationship with the current network and the other networks exists, the third-party network can be searched by adopting shorter period duration, and the searching frequency of the third-party network is properly increased, so that the third-party network can be timely and quickly resided to the other networks, and the network searching efficiency is improved.

In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of methods and systems according to various embodiments of the present disclosure. It should be noted that each block in the flowchart or block diagrams may represent a module, a program segment, or a portion of code, which may include one or more executable instructions for implementing the logical function specified in the respective embodiment. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. It should also be noted that the sequence numbers of the respective steps in the flowcharts do not represent a limitation on the execution order of the respective steps.

It should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in this document indicates that the former and latter related objects are in an "or" relationship.

"plurality" appearing in the embodiments of the present invention means two or more.

The descriptions of the first, second, etc. appearing in the embodiments of the present invention are only for illustrating and differentiating the objects, and do not have any order or represent any special limitation to the number of devices in the embodiments of the present invention, and do not constitute any limitation to the embodiments of the present invention.

Fig. 1 is a flowchart illustrating a network searching method according to an embodiment of the present invention. The network search method may be performed by a user equipment side, e.g., a 5G UE.

Specifically, the network search method may include the steps of:

step S101, judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network;

step S102, if the adjacent cell belonging to the second network is configured, searching a third network by using the element value in a preset first period time length set, otherwise, searching the third network by using the element value in a preset second period time length set, wherein for each element value in the first period time length set, at least one element value smaller than the element value exists in the second period time length set.

The first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship.

More specifically, in step S101, the UE may determine a current cell in which the UE is camped and a neighboring cell of the current cell. Then, it may be determined whether the neighboring cell belongs to a second network. The second network is a different network than the first network to which the current cell belongs.

In step S102, if the determination result indicates that the UE has an adjacent cell belonging to the second network, the third network may be searched according to an element value in a preset first period time length set. The third network is different from the first network and the second network.

Or, if the determination result indicates that the UE does not have a neighboring cell belonging to the second network, the third network may be searched according to an element value in a preset second period duration set.

In a specific implementation, the first set of cycle durations may include 1 element value or may include a plurality of element values. Each element value may be a first period duration for the UE to search for the third network. When the first set of cycle time periods includes a plurality of element values, the first cycle time period may be gradually increased as the number of searches increases when searching for the third network. That is, as the number of searches increases, element values may be selected from the first period duration set in order from small to large as the first period duration to search for the third network.

In a specific implementation, the second periodic time duration set may include 1 element value, or may include a plurality of element values. Each element value may be a second period duration for the UE to search for the third network. When the second period duration set includes a plurality of element values, the second period duration may be gradually increased as the number of searches increases when searching for the third network. That is, as the number of searches increases, element values may be selected from the second period duration set in a descending order as the second period duration to search for the third network.

It should be noted that, for each element value in the first set of period durations, at least one element value smaller than the element value exists in the second set of period durations.

For example, the first set of periodic durations may include 1 element value and the second set of periodic durations may include 1 element value, the first periodic duration being greater than the second periodic duration. As a non-limiting example, it may be assumed that the first set of periodic time durations is {10} and the second set of periodic time durations is {5 }.

For another example, the first set of periodic durations may include a plurality of element values, the second set of periodic durations may include a plurality of element values, and a minimum element value in the first set of periodic durations is greater than a maximum element value in the second set of periodic durations. As a non-limiting example, it may be assumed that the first set of periodic time durations is {10,20,30} and the second set of periodic time durations is {3,5,7 }.

For another example, the first set of periodic durations may include a plurality of element values, the second set of periodic durations may include a plurality of element values, and a minimum element value in the first set of periodic durations is greater than a maximum element value in the second set of periodic durations. As a non-limiting example, it may be assumed that the first set of periodic time durations is {10,20,30} and the second set of periodic time durations is {1,3,5,7 }.

For another example, the first set of periodic durations may include a plurality of element values, the second set of periodic durations may include a plurality of element values, a portion of the element values in the first set of periodic durations may be greater than a portion of the element values in the second set of periodic durations, and a number of elements in the first set of periodic durations may or may not be equal to a number of elements in the second set of periodic durations. As a non-limiting example, it may be assumed that the first set of periodic time durations is {10,20,30}, and the second set of periodic time durations is {5,10,15}, or {1,5,10,15,20 }.

For another example, the first set of periodic durations may include 1 element value, the second set of periodic durations may include a plurality of element values, and the element values in the first set of periodic durations are greater than at least some of the element values in the second set of periodic durations. As a non-limiting example, it may be assumed that the first set of periodic time durations is {10}, and the second set of periodic time durations is {1,5,10,15}, or {1,5,9 }.

For another example, the first set of periodic durations may include a plurality of element values, the second set of periodic durations may include 1 element value, and each element value in the first set of periodic durations is greater than an element value in the second set of periodic durations. In this condition, as a non-limiting example, it may be assumed that the first set of periodic time durations is {10,20,30} and the second set of periodic time durations is {5 }.

Further, when the UE searches for the third network, it may attempt to camp on a cell belonging to the third network.

In one embodiment, the first network may be a 2G/3G network, the second network may be a 4G network, and the third network may be a 5G network. In subsequent evolution, if the 4G network has an interworking relationship with a 6G network, a 7G network, the first network may be a 2G network or a 3G network, the second network may be a 4G network, and the third network may be a 6G network or a 7G network.

The following explains an embodiment of the present invention by taking an example in which the first network is a 2G/3G network, the second network is a 4G network, and the third network is a 5G network.

Those skilled in the art will appreciate that the 3rd Generation Partnership Project (3 GPP) protocol specifies that a 5G network is interoperable with a 4G network, i.e., from the 4G network, the 5G network may be returned to the 4G network by reselection, etc., while the 4G network is interoperable with a 2G/3G network.

This means that, when a 5G terminal (i.e. a 5G UE) resides in a cell of a 2G/3G network, if the resident 2G/3G cell configures a 4G neighboring cell, the 5G terminal may reselect to the 4G cell through the 2G/3G cell, and then return to the 5G network from the 4G cell through reselection or other methods. And if the 2G/3G cell where the 5G terminal resides is not configured with the 4G neighbor cell, the 5G terminal cannot return to the 5G network in a reselection mode.

In combination with the network layout characteristics, in general, in a 5G network coverage area, there is a high probability of a 4G network also existing. Under the condition, if the 2G/3G cell is configured with the 4G neighboring cell, the 5G terminal residing in the 2G/3G cell can reselect to the 4G cell through the 2G/3G cell and further reselect from the 4G cell to the 5G cell once moving to the area covered by the 5G network. At this time, frequent 5G network searches will increase the terminal power consumption. If the 2G/3G cell is not configured with the 4G adjacent cell, the cell cannot return to the 5G network in a reselection mode and the like. At this time, the search frequency for the 5G network needs to be increased appropriately to avoid the situation that the 5G terminal cannot return to the 5G network in time after moving to the coverage area of the 5G network.

Fig. 2 is a schematic flowchart of a network searching method in a typical application scenario according to an embodiment of the present invention.

In the typical scenario, the 5G UE first performs step S201 to camp on the 2G/3G cell under the coverage of the 2G/3G network.

Secondly, in the 2G/3G cell, executing step S202 to determine whether the 2G/3G cell is configured with a 4G neighboring cell, if the 4G neighboring cell is configured, executing step S203A, namely setting a longer 5G network search period; if the 4G neighbor is not configured, step S203B is executed, i.e., a shorter 5G network search period is set.

Further, when the 5G network is searched, the 5G UE may perform step S204, i.e., attempt to camp on the 5G cell.

Therefore, according to the technical scheme provided by the embodiment of the invention, when the 5G terminal resides in the 2G/3G network, whether the resident 2G/3G cell is provided with the 4G neighbor cell or not is judged firstly. If the 4G adjacent cell is configured, 5G network search can be carried out by adopting a longer search period duration; if the 4G neighbor cell is not configured, the 5G network search can be performed by adopting a shorter search period duration. Through the embodiment, the 5G terminal can dynamically adjust the period duration of the 5G network searching, and can recover the 5G network residence as soon as possible on the premise of saving power consumption as much as possible.

Fig. 3 is a schematic structural diagram of a network searching apparatus according to an embodiment of the present invention. The network searching apparatus 3 may be executed by a terminal side, for example, a 5G UE, and implement the method solutions shown in fig. 1 and fig. 2.

Specifically, the network search device 3 may include: a determining module 31, adapted to determine whether a resident current cell is configured with a neighboring cell belonging to a second network, where the current cell belongs to a first network; an employing module 32, where if a neighboring cell belonging to the second network is configured, the employing module 32 is adapted to search for a third network by using an element value in a preset first periodic time duration set, otherwise, the third network is searched for by using an element value in a preset second periodic time duration set, and for each element value in the first periodic time duration set, at least one element value in the second periodic time duration set is smaller than the element value; the first network, the second network and the third network are different from each other, the first network and the second network have an interoperation relationship, the second network and the third network have an interoperation relationship, and the first network and the third network do not have an interoperation relationship.

In a specific implementation, the number of elements of the first set of cycle durations may be 1, and the value of each element is a fixed value.

In an implementation, the number of elements of the second periodic time duration set may be 1, and the value of the element is a fixed value.

In a specific implementation, the number of the elements in the first period duration set may be multiple, and when searching for the third network, the values of the elements in the first period duration set may be increased as the number of searches increases.

In a specific implementation, the number of the elements in the second period duration set may be multiple, and when searching for the third network, the values of the elements in the second period duration set may be increased as the number of searches increases.

In a specific implementation, the network searching apparatus 3 may further include: a camping module 33 adapted to attempt to camp on a cell belonging to the third network when the third network is searched.

In a specific implementation, the first network is a 2G network or a 3G network, the second network is a 4G network, and the third network is a 5G network.

For more details of the operation principle and the operation mode of the network search apparatus 3, reference may be made to the description of the technical solutions in fig. 1 and fig. 2, which is not repeated herein.

Further, the embodiment of the present invention also discloses a storage medium, on which computer instructions are stored, and when the computer instructions are executed, the technical solution of the method described in the embodiments shown in fig. 1 and fig. 2 is executed. Preferably, the storage medium may include a computer-readable storage medium such as a non-volatile (non-volatile) memory or a non-transitory (non-transient) memory. The computer readable storage medium may include ROM, RAM, magnetic or optical disks, and the like.

It should be understood that, in the embodiment of the present invention, the Processor may be a Central Processing Unit (CPU), and the Processor may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

It will also be appreciated that the memory in embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. The volatile Memory may be a Random Access Memory (RAM) which serves as an external cache. By way of illustration and not limitation, many forms of Random Access Memory (RAM) are available, such as Static RAM (Static RAM), Dynamic RAM (Dynamic RAM), Synchronous DRAM (Synchronous DRAM), SDRAM (Synchronous DRAM), DDR (Double Data Rate SDRAM), edram (Enhanced SDRAM), SDRAM (Synchronous DRAM), SLDRAM (Synchronous connected DRAM), and dlram (DR-RAM).

The above embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product comprises one or more computer instructions or computer programs. The procedures or functions according to the embodiments of the present invention are wholly or partially generated when the computer instructions or the computer program are loaded or executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more collections of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.

It should be understood that, in various embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

In the embodiments provided in the present invention, it should be understood that the disclosed method, apparatus and system can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, 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 through some interfaces, devices or units, and may be in an electrical, mechanical 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 invention may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.

The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

Further, an embodiment of the present invention further discloses a terminal, which includes a memory and a processor, where the memory stores computer instructions capable of being executed on the processor, and the processor executes the technical solution of the method in the embodiment shown in fig. 1 and fig. 2 when executing the computer instructions. Preferably, the terminal may be a 5G terminal.

A terminal (e.g., a sending terminal and/or a receiving terminal) in the embodiments of the present invention may refer to various forms of User Equipment (UE), an access terminal, a subscriber unit, a subscriber Station, a Mobile Station (MS), a remote Station, a remote terminal, a Mobile device, a User terminal, a terminal device (terminal Equipment), a wireless communication device, a User agent, or a User Equipment. The terminal device 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 a Wireless communication function, a computing device or other processing devices connected to a Wireless modem, a vehicle-mounted device, a wearable device, a user device in a 5G Network, or a terminal device in a Public Land Mobile Network (PLMN) for future evolution, and the like, which are not limited in the embodiments of the present invention.

Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A method for network searching, comprising:

judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network;

if the neighbor cell belonging to the second network is configured, searching a third network by adopting element values in a preset first period time length set, otherwise, searching the third network by adopting element values in a preset second period time length set, wherein at least one element value smaller than the element value exists in the second period time length set for each element value in the first period time length set;

2. The method according to claim 1, wherein the number of elements of the first set of period durations is 1, and the value of each element is constant.

3. The method according to claim 1 or 2, wherein the number of elements in the second period duration set is 1, and the value of the element is constant.

4. The method according to claim 1, wherein the number of the elements in the first period duration set is plural, and the values of the elements in the first period duration set used in searching the third network increase as the number of searches increases.

5. The method according to claim 1 or 4, wherein the number of elements in the second periodic time duration set is plural, and the values of the elements in the second periodic time duration set are increased as the number of searches increases when searching for the third network.

6. The network searching method according to claim 1, 2 or 4, further comprising:

attempting to camp on a cell belonging to the third network when the third network is searched.

7. The method according to claim 1, 2 or 4, wherein the first network is a 2G network or a 3G network, the second network is a 4G network, and the third network is a 5G network.

8. A network search apparatus, comprising:

the judging module is suitable for judging whether a resident current cell is configured with an adjacent cell belonging to a second network, wherein the current cell belongs to a first network;

an adoption module, adapted to search a third network using element values in a preset first periodic time duration set if a neighboring cell belonging to the second network is configured, or adapted to search the third network using element values in a preset second periodic time duration set, for each element value in the first periodic time duration set, at least one element value in the second periodic time duration set being smaller than the element value;

9. A storage medium having stored thereon computer instructions, characterized in that the computer instructions are operative to perform the steps of the method of any one of claims 1 to 7.

10. A terminal comprising a memory and a processor, the memory having stored thereon computer instructions executable on the processor, wherein the processor, when executing the computer instructions, performs the steps of the method of any one of claims 1 to 7.