CN114071711B - Paging area optimization method, device and storage medium - Google Patents

Paging area optimization method, device and storage medium Download PDF

Info

Publication number
CN114071711B
CN114071711B CN202111305658.XA CN202111305658A CN114071711B CN 114071711 B CN114071711 B CN 114071711B CN 202111305658 A CN202111305658 A CN 202111305658A CN 114071711 B CN114071711 B CN 114071711B
Authority
CN
China
Prior art keywords
base station
target
optimized
edge
switching times
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111305658.XA
Other languages
Chinese (zh)
Other versions
CN114071711A (en
Inventor
乔金剑
朱佳佳
刘亮
狄子翔
吕非彼
王昭宁
张亚南
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202111305658.XA priority Critical patent/CN114071711B/en
Publication of CN114071711A publication Critical patent/CN114071711A/en
Application granted granted Critical
Publication of CN114071711B publication Critical patent/CN114071711B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like
    • H04W68/005—Transmission of information for alerting of incoming communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like
    • H04W68/02—Arrangements for increasing efficiency of notification or paging channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/022—One-way selective calling networks, e.g. wide area paging
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The application provides a paging area optimization method, a paging area optimization device and a storage medium, which relate to the technical field of communication and can improve service quality. The method comprises the following steps: acquiring service switching information of each source base station in a paging area TA to be optimized, wherein the service switching information comprises: the method comprises the steps of determining the TA where a source base station is located, the service switching times, the target base station and the TA where the target base station is located, wherein the source base station corresponds to the target base station. And determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station. And determining whether the TA to be optimized has the target edge base station according to the service switching times of each edge base station and the target switching times threshold, wherein the target edge base station is the edge base station with the service switching times larger than the target switching times threshold. If the TA to be optimized has the target edge base station, the edge base station of the TA to be optimized is optimized, and the optimized TA to be optimized does not have the target edge base station.

Description

Paging area optimization method, device and storage medium
Technical Field
The present invention relates to the field of communications, and in particular, to a paging area optimization method, apparatus, and storage medium.
Background
With the development of wireless communication technology, communication services are being developed towards improving service quality and improving user experience. The paging Area (TA) is the basic unit of network paging. A long term evolution (Long Term Evolution, LTE) system can manage the location of a terminal (UE) through a paging Area (TA). The core network can learn the position of the UE in idle state through TA information, and can page the UE when there is a data service requirement.
When a UE moves in a different TA, the UE may be triggered to access the base station of one TA from the base station of another TA. However, switching TAs may affect the quality of service, degrading the user's service experience. Therefore, how to optimize TA is a problem to be solved.
Disclosure of Invention
The application provides a paging area optimization method, a paging area optimization device and a storage medium, which can improve service quality.
In order to achieve the above purpose, the present application adopts the following technical scheme:
in a first aspect, the present application provides a method for optimizing a paging zone. In the method, service switching information of each source base station in a paging area TA to be optimized is acquired, wherein the service switching information comprises: the method comprises the steps of determining the TA where a source base station is located, the service switching times, the target base station and the TA where the target base station is located, wherein the source base station corresponds to the target base station. And determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station. And determining whether the TA to be optimized has the target edge base station according to the service switching times of each edge base station and the target switching times threshold, wherein the target edge base station is the edge base station with the service switching times larger than the target switching times threshold. If the TA to be optimized has the target edge base station, the edge base station of the TA to be optimized is optimized, and the optimized TA to be optimized does not have the target edge base station.
Based on the scheme, the service switching information of each source base station in the paging area TA to be optimized is obtained. And then, determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station. In this way, it can be determined whether there is a target edge base station in the edge base stations, where the target edge base station is an edge base station whose number of service handovers is greater than a threshold of the target number of handovers. It can be appreciated that the number of service handovers of the target edge base station is too high and the handover across TAs may affect the service experience of the user. And if the target edge base station exists in the TA to be optimized, optimizing the edge base station of the TA to be optimized, wherein the target edge base station does not exist in the optimized TA to be optimized. In this way, the frequency of switching the service across the TA by the source base station in the TA to be optimized is lower, so that the service quality can be improved, and the service experience of the user can be improved.
In one possible design, if the TA where the first base station is located is different from the TA where the target base station corresponding to the first base station is located, determining that the first base station is an edge base station of the TA to be optimized, where the first base station is any base station in each source base station.
In one possible design, neighboring base stations of the target edge base station are determined. If the service switching times of the adjacent base stations are smaller than the target switching times threshold, the adjacent base stations are set as the edge base stations of the TA to be optimized.
In one possible design, a first value and a second value are obtained, where the first value is the sum of service switching times of all source base stations in the TA to be optimized, and the second value is the number of all source base stations in the TA to be optimized. And determining a target switching frequency threshold according to the first value and the second value.
In one possible design, the number of source base stations in the parent TA is obtained. If the number of the source base stations in the mother TA is larger than a preset number threshold, dividing the mother TA into a plurality of sub-TAs, wherein the number of the source base stations in each sub-TA in the plurality of sub-TAs is smaller than the preset number threshold, and the plurality of sub-TAs comprise TAs to be optimized.
In a second aspect, the present application provides an apparatus for optimizing a paging area, where the apparatus includes an acquisition unit and a processing unit.
The acquisition unit is configured to acquire service switching information of each source base station in the paging area TA to be optimized, where the service switching information includes: the method comprises the steps of determining the TA where a source base station is located, the service switching times, the target base station and the TA where the target base station is located, wherein the source base station corresponds to the target base station. And the processing unit is used for determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station. The processing unit is further configured to determine, according to the service switching times and the target switching times threshold of each edge base station, whether the TA to be optimized has a target edge base station, where the target edge base station is an edge base station whose service switching times are greater than the target switching times threshold. The processing unit is further configured to optimize the edge base station of the TA to be optimized if the target edge base station exists in the TA to be optimized, and the target edge base station does not exist in the TA to be optimized after optimization.
In one possible design, the processing unit is specifically configured to determine that the first base station is an edge base station of the TA to be optimized if the TA where the first base station is located is different from the TA where the target base station corresponding to the first base station is located, where the first base station is any one of the source base stations.
In a possible design, the processing unit is specifically configured to determine the neighboring base stations of the target edge base station. If the service switching times of the adjacent base stations are smaller than the target switching times threshold, the adjacent base stations are set as the edge base stations of the TA to be optimized.
In one possible design, the obtaining unit is further configured to obtain a first value and a second value, where the first value is a sum of service switching times of all source base stations in the TA to be optimized, and the second value is a number of all source base stations in the TA to be optimized. And the processing unit is also used for determining a target switching frequency threshold value according to the first numerical value and the second numerical value.
In a possible design, the acquiring unit is further configured to acquire the number of source base stations in the mother TA. The processing unit is further configured to divide the mother TA into a plurality of sub-TAs if the number of source base stations in the mother TA is greater than a preset number threshold, where the number of source base stations in each of the plurality of sub-TAs is less than the preset number threshold, and the plurality of sub-TAs includes the TA to be optimized.
In a third aspect, the present application provides an apparatus for optimizing a paging area, the apparatus comprising: a processor and a memory; the processor and the memory are coupled; the memory is configured to store one or more programs comprising computer-executable instructions that, when executed by the paging zone optimization device, are executable by the processor to perform the paging zone optimization method as described in the first aspect and any one of the possible implementations of the first aspect.
In a fourth aspect, the present application provides a computer readable storage medium having instructions stored therein, which when run on a computer, cause the computer to perform the method of optimizing a paging zone described in any one of the possible implementations of the first aspect and the first aspect.
In a fifth aspect, the present application provides a chip comprising a processor and a communication interface, the communication interface and the processor being coupled, the processor being for running a computer program or instructions to implement the method of optimizing a paging zone as described in any one of the possible implementations of the first aspect and the first aspect.
In the above solution, the technical problems and the technical effects that can be solved by the optimizing device, the computer storage medium or the chip of the paging area can be referred to the technical problems and the technical effects that can be solved by the above first aspect, and are not described herein again.
Drawings
Fig. 1 is a system architecture diagram of a communication system according to an embodiment of the present application;
fig. 2 is a flow chart of a paging area optimization method according to an embodiment of the present application;
fig. 3 is a flow chart of another method for optimizing paging area according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an optimizing device for paging area according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of another paging area optimizing apparatus according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The character "/" herein generally indicates that the associated object is an "or" relationship. For example, A/B may be understood as A or B.
The terms "first" and "second" in the description and in the claims of the present application are used for distinguishing between different objects and not for describing a particular sequential order of objects.
Furthermore, references to the terms "comprising" and "having" and any variations thereof in the description of the present application are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or modules is not limited to only those steps or modules but may include other steps or modules not listed or inherent to such process, method, article, or apparatus.
In addition, in the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as examples, illustrations, or descriptions. Any embodiment or design described herein as "exemplary" or "e.g." should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present concepts in a concrete fashion.
Before describing the paging area optimization method in detail, the implementation environment and application field Jing Jinhang of the embodiments of the present application will be described.
As shown in fig. 1, a communication system according to an embodiment of the present application includes at least one network device (e.g., a base station or a server) and a terminal. For example, the at least one network device includes a first base station 101 and a second base station 102, where a TA where the first base station 101 is located is different from a TA where the second base station 102 is located. The terminal comprises a handset 103, and the handset 103 can switch an accessed base station from a first base station 101 to a second base station 102. That is, the TA to which the handset 103 has access switches.
The base station may include various forms of base stations, such as: macro base stations, micro base stations (also referred to as small stations), relay stations, access points, and the like. The method specifically comprises the following steps: an Access Point (AP) in a wireless local area network (Wireless Local Area Network, WLAN), a base station (Base Transceiver Station, BTS) in a global system for mobile communications (Global System for Mobile Communications, GSM) or code division multiple access (Code Division Multiple Access, CDMA), a base station (NodeB, NB) in wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA), an Evolved base station (Evolved Node B, eNB or eNodeB) in LTE, a relay station or access point, or a vehicle device, a wearable device, and a next generation Node B (The Next Generation Node B, gNB) in a future 5G network or a base station in a future Evolved public land mobile network (Public Land Mobile Network, PLMN) network, etc.
The server may be a physical server or a cloud server.
It should be noted that, in the embodiment of the present application, the execution body is a network device. For example, a base station may perform embodiments provided herein. For another example, a server may perform embodiments provided herein.
The terminal may be a device having a transceiving function. Terminals may be deployed on land, including indoors or outdoors, hand-held or vehicle-mounted; may also be deployed on the surface of water (e.g., a ship, etc.); but may also be deployed in the air (e.g., on aircraft, balloon, satellite, etc.). The terminal includes a handheld device, an in-vehicle device, a wearable device, or a computing device with wireless communication capabilities. The terminal may be a mobile phone, a tablet computer, or a computer with a wireless transceiving function, for example. The terminal device may also be a Virtual Reality (VR) terminal device, an augmented reality (augmented reality, AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city, a wireless terminal in smart home (smart home), etc.
As shown in fig. 2, a paging area optimization method provided in an embodiment of the present application includes:
s201, acquiring service switching information of each source base station in a paging area to be optimized.
The service switching information comprises: the method comprises the steps of determining the TA where a source base station is located, the service switching times, the target base station and the TA where the target base station is located, wherein the source base station corresponds to the target base station.
The TA to be optimized includes a macro base station and a cell substation. In the embodiment of the present application, the source base station is a macro base station. The TA where the source base station is located is the TA to be optimized.
In one possible design, the target base station of the source base station refers to another base station to which the base station serving the terminal is handed off from the source base station. For example, suppose terminal a is first served by a first base station. And then, the second base station serves the terminal A. And the second base station is a target base station under the condition that the first base station is a source base station.
It should be noted that, the TA where the target base station is located is the same as the TA to be optimized, or the TA where the target base station is located is different from the TA to be optimized, which is not limited in the embodiment of the present application.
In the embodiment of the present application, the number of service switching times is the number of times of switching from the source base station to the target base station. Illustratively, if the number of times the second base station is handed over from the first base station is 32, the number of times the first base station is handed over is 32.
Exemplary, as shown in table 1, it shows service switching information of a source base station. The source base station identity card identification number (Identity Document, ID) is used for identifying a source base station, the source base station paging area code (Tracking Area Code, TAC) is used for identifying a TA to be optimized, the target base station ID is used for identifying a target base station corresponding to the source base station, and the target base station TAC is used for identifying the TA where the target base station is located.
TABLE 1
Source base station ID Source base station TAC Target base station ID Target base station TAC Number of handovers
Base station A TAC1 Base station E TAC2 12
Base station B TAC1 Base station F TAC2 15
Base station C TAC1 Base station G TAC3 23
Base station D TAC1 Base station H TAC1 54
That is, in TAC1 (i.e., TA to be optimized), the target base station of the base station a is base station E, TAC of the base station E is TAC2, and the number of times of switching from the base station a to the base station E is 12. For the description of the service switching information of other source base stations (such as base station B, base station C and base station D), reference may be made to the description of base station a, which is not repeated herein.
Note that the TAC may be broadcast in a system message (e.g., SIB 1) of the cell.
Optionally, the service switching information may further include a cell ID.
In a possible implementation, basic industrial parameters of the TA to be optimized and cell handover data of each source base station are obtained. Wherein the basic industrial parameters include: base station identification (e.g., base station ID), cell ID, TAC to be optimized, base station type, location information (e.g., longitude and latitude), cell handover data of the source base station includes: the method comprises the steps of source base station identification, source base station cell (namely original cell) identification, target base station cell (namely target cell) identification and service switching times. And obtaining service switching information of each source base station according to the basic industrial parameters of the TA to be optimized and the cell switching data of each source base station.
S202, determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station.
In one possible implementation, the TA where each source base station is located is compared with the TA where the corresponding target base station of each source base station is located. If the TA of the first base station is different from the TA of the target base station corresponding to the first base station, determining the first base station as an edge base station of the TA to be optimized, wherein the first base station is any base station in each source base station.
For example, in combination with table 1, the target base station of the base station a is the base station E, and the TA of the base station a is different from the TA of the base station E, then the base station a is the edge base station. Similarly, base station B and base station C are also edge base stations.
If the TA of the first base station is the same as the TA of the target base station corresponding to the first base station, determining that the first base station is not an edge base station of the TA to be optimized.
For example, in combination with table 1, the target base station corresponding to the base station D is the base station H, and the TA of the base station D is the same as the TA of the base station H, and the base station D is not an edge base station.
S203, determining whether the TA to be optimized has the target edge base station according to the service switching times of each edge base station and the target switching times threshold value.
The target edge base station is an edge base station with service switching times larger than a threshold value of the target switching times.
Note that, in the embodiment of the present application, the target switching frequency threshold is not limited. For example, the target handover number threshold may be an average of service handover numbers of all source base stations in the TA to be optimized. For another example, the target handover number threshold may be a variance of service handover numbers of all source base stations in the TA to be optimized. For another example, the target handover number threshold may be a standard deviation of service handover numbers of all source base stations in the TA to be optimized.
In one possible design, the target handover number threshold may be an average of the number of service handovers for all source base stations in the TA to be optimized. And obtaining a first numerical value and a second numerical value, wherein the first numerical value is the sum of service switching times of all source base stations in the TA to be optimized, and the second numerical value is the number of all source base stations in the TA to be optimized. And then, determining a target switching frequency threshold according to the first value and the second value.
Illustratively, if the TA to be optimized includes: base station A, base station B and base station C, wherein the service switching times of base station A is 28, the service switching times of base station B is 35 and the service switching times of base station C is 27. The first value is 90 and the second value is 3, the target number of handovers is 30.
It can be understood that the average value of the service switching times of all the source base stations can reflect the central tendency of the service switching times of the source base stations in the TA to be optimized.
In one possible implementation, the number of service handovers per edge base station is compared to a target handover number threshold. And if the service switching times of the edge base station are greater than the target switching times threshold, determining the edge base station as a target edge base station. And if the service switching times of the edge base station are smaller than or equal to the target switching times threshold value, determining that the edge base station is not the target edge base station.
In some embodiments, if the TA to be optimized has a target edge base station, S204 is performed.
In some embodiments, if the TA to be optimized has a target edge base station, S204 is performed. And if the TA to be optimized does not have the target edge base station, not optimizing the TA to be optimized.
S204, optimizing the edge base station of the TA to be optimized.
And the optimized TA to be optimized does not have a target edge base station.
In one possible implementation, neighboring base stations of the target edge base station are determined. For example, the neighbor base station of the target edge base station may be determined according to the location information of the target edge base station. And then, comparing the service switching times of the adjacent base stations with a target switching times threshold value. If the service switching times of the adjacent base stations are smaller than the target switching times threshold, the adjacent base stations are set as the edge base stations of the TA to be optimized.
Illustratively, if the neighbor base station of the target edge base station includes: base station a, base station B, and base station C. Wherein, the number of service switching times of the base station A is 15, the number of service switching times of the base station B is 20, the number of service switching times of the base station C is 30, and the threshold value of the target switching times is 22. Then base station a and base station B may determine as edge base stations for the TA to be optimized.
Based on the scheme, the service switching information of each source base station in the paging area TA to be optimized is obtained. And then, determining each edge base station of the TA to be optimized according to the TA of each source base station and the TA of the target base station corresponding to each source base station. In this way, it can be determined whether there is a target edge base station in the edge base stations, where the target edge base station is an edge base station whose number of service handovers is greater than a threshold of the target number of handovers. It can be appreciated that the number of service handovers of the target edge base station is too high and the handover across TAs may affect the service experience of the user. And if the target edge base station exists in the TA to be optimized, optimizing the edge base station of the TA to be optimized, wherein the target edge base station does not exist in the optimized TA to be optimized. In this way, the frequency of switching the service across the TA by the source base station in the TA to be optimized is lower, so that the service quality can be improved, and the service experience of the user can be improved.
As shown in fig. 3, another paging area optimization method provided in an embodiment of the present application includes:
s301, obtaining the number of source base stations in the mother TA.
In some embodiments, prior to S201, the number of source base stations in the parent TA is obtained.
S302, determining whether the number of source base stations in the mother TA is larger than a preset number threshold.
In some embodiments, if the number of source base stations in the parent TA is greater than a preset number threshold, S303 is performed. If the number of source base stations in the parent TA is less than or equal to the preset number threshold, S201 is executed.
It should be noted that, if the number of source base stations in the mother TA is less than or equal to the preset number threshold, the mother TA is the TA to be optimized.
For example, if the number of source base stations in the parent TA is 2000 and the preset number threshold is 1000, S302 is performed. If the number of source base stations in the parent TA is 800, S201 is performed.
S303, dividing the mother TA into a plurality of child TAs.
The number of source base stations in each of a plurality of sub-TAs is smaller than a preset number threshold, and the plurality of sub-TAs comprise TAs to be optimized.
For example, if the number of source base stations in the mother TA is 2000 and the preset number threshold is 1000, the mother TA may be divided into: the first sub-TA comprises 800 source base stations, the second sub-TA comprises 600 source base stations, and the third sub-TA comprises 600 source base stations, any one of the first sub-TA, the second sub-TA and the third sub-TA can be the TA to be optimized.
It should be noted that, in the case where the number of source base stations in the TA is large, the probability of service interruption may be high. Therefore, the mother TA is divided into a plurality of sub TAs, so that the number of source base stations in each sub TA can be reduced, the probability of service interruption is reduced, and the service quality is improved.
In some embodiments, after determining the TA to be optimized, S201 is performed.
Based on the above technical scheme, the number of source base stations in the mother TA is obtained, and the mother TA is divided into a plurality of sub-TAs, and the number of source base stations in each sub-TA in the plurality of sub-TAs is smaller than a preset number threshold under the condition that the number of source base stations in the mother TA is larger than the preset number threshold. In this way, the number of source base stations in the TA to be optimized can be reduced, and the service quality can be improved.
The foregoing description of the solution provided by the embodiments of the present application has been presented mainly from the perspective of a computer device. It will be appreciated that the computer device, in order to carry out the functions described above, comprises corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the exemplary paging zone optimization method steps described in connection with the embodiments disclosed herein may be implemented in hardware or a combination of hardware and computer software. Whether a function is implemented as hardware or computer software driven 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.
The embodiment of the application also provides an optimizing device of the paging area. The optimizing device of the paging area can be a computer device, a CPU in the computer device, a processing module for optimizing the paging area in the computer device, and a client for optimizing the paging area in the computer device.
The embodiment of the application may perform the division of the functional modules or the functional units according to the above method example for the optimization of the paging area, for example, each functional module or functional unit may be divided corresponding to each function, or two or more functions may be integrated in one processing module. The integrated modules may be implemented in hardware, or in software functional modules or functional units. The division of the modules or units in the embodiments of the present application is merely a logic function division, and other division manners may be implemented in practice.
Fig. 4 is a schematic structural diagram of an optimizing apparatus for paging area according to an embodiment of the present application. The paging area optimizing means is used to perform the paging area optimizing method shown in fig. 2 or fig. 3. The optimizing means of the paging area may comprise an acquisition unit 401 and a processing unit 402.
An obtaining unit 401, configured to obtain service switching information of each source base station in the paging area TA to be optimized, where the service switching information includes: the method comprises the steps of determining the TA where a source base station is located, the service switching times, the target base station and the TA where the target base station is located, wherein the source base station corresponds to the target base station. And the processing unit 402 is configured to determine each edge base station of the TA to be optimized according to the TA where each source base station is located and the TA where the target base station corresponding to each source base station is located. The processing unit 402 is further configured to determine, according to the number of service handovers of each edge base station and the target handover number threshold, whether the TA to be optimized has a target edge base station, where the target edge base station is an edge base station whose number of service handovers is greater than the target handover number threshold. The processing unit 402 is further configured to optimize an edge base station of the TA to be optimized if the TA to be optimized has the target edge base station, and the optimized TA to be optimized does not have the target edge base station.
Optionally, the processing unit 402 is specifically configured to determine that the first base station is an edge base station of the TA to be optimized if the TA where the first base station is located is different from the TA where the target base station corresponding to the first base station is located, where the first base station is any one of the source base stations.
Optionally, the processing unit 402 is specifically configured to determine a neighboring base station of the target edge base station. If the service switching times of the adjacent base stations are smaller than the target switching times threshold, the adjacent base stations are set as the edge base stations of the TA to be optimized.
Optionally, the obtaining unit 401 is further configured to obtain a first value and a second value, where the first value is a sum of service switching times of all source base stations in the TA to be optimized, and the second value is a number of all source base stations in the TA to be optimized. The processing unit 402 is further configured to determine a target handover number threshold according to the first value and the second value.
Optionally, the obtaining unit 401 is further configured to obtain the number of source base stations in the mother TA. The processing unit 402 is further configured to divide the mother TA into a plurality of sub-TAs if the number of source base stations in the mother TA is greater than a preset number threshold, where the number of source base stations in each of the plurality of sub-TAs is less than the preset number threshold, and the plurality of sub-TAs includes the TA to be optimized.
Fig. 5 shows still another possible structure of the paging area optimizing apparatus involved in the above-described embodiment. The paging area optimizing device comprises: a processor 501 and a communication interface 502. The processor 501 is configured to control and manage the actions of the apparatus, for example, to perform various steps in the method flows shown in the method embodiments described above, and/or to perform other processes of the techniques described herein. The communication interface 502 is used to support communication of the paging zone optimization device with other network entities. The optimizing means of the paging zone may further comprise a memory 503 and a bus 504, the memory 503 being used for storing program codes and data of the means.
Wherein the processor 501 may implement or execute the various exemplary logic blocks, elements and circuits described in connection with the present disclosure. The processor may be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, units and circuits described in connection with this disclosure. A processor may also be a combination that performs computing functions, e.g., including one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
Memory 503 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, hard disk or solid state disk; the memory may also comprise a combination of the above types of memories.
Bus 504 may be an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus or the like. The bus 504 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in fig. 5, but not only one bus or one type of bus.
In actual implementation, the acquisition unit 401 may be implemented by the communication interface 502 shown in fig. 5, and the processing unit 402 may be implemented by the processor 501 shown in fig. 5 invoking program codes in the memory 503. The specific implementation process may refer to the description of the paging area optimization method shown in fig. 2 or fig. 3, and will not be repeated here.
From the foregoing description of the embodiments, it will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of functional modules is illustrated, and in practical application, the above-described functional allocation may be implemented by different functional modules according to needs, i.e. the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above. The specific working processes of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which are not described herein.
Embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of optimizing a paging zone in the method embodiments described above.
The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores instructions, and when the instructions run on a computer, the instructions cause the computer to execute the paging area optimization method in the method flow shown in the method embodiment.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), a register, a hard disk, an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing, or any other form of computer readable storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuit, ASIC). In the context of the present application, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Since the paging area optimizing apparatus, the computer readable storage medium, and the computer program product in the embodiments of the present invention can be applied to the above-mentioned method, the technical effects that can be obtained by the method can also refer to the above-mentioned method embodiments, and the embodiments of the present invention are not described herein again.
The foregoing is merely a specific embodiment of the present application, but the protection scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. A method of optimizing a paging zone, the method comprising:
acquiring service switching information of each source base station in a paging area TA to be optimized, wherein the service switching information comprises: the method comprises the steps that a TA where a source base station is located, service switching times, a target base station and a TA where the target base station is located are carried out, and the source base station corresponds to the target base station;
if the TA of the first base station is different from the TA of the target base station corresponding to the first base station, determining that the first base station is an edge base station of the TA to be optimized, wherein the first base station is any base station in each source base station;
determining whether the TA to be optimized has a target edge base station according to the service switching times of each edge base station and a target switching times threshold, wherein the target edge base station is an edge base station with the service switching times being greater than the target switching times threshold;
if the TA to be optimized has the target edge base station, optimizing the edge base station of the TA to be optimized, wherein the optimized TA to be optimized does not have the target edge base station.
2. The method of claim 1, wherein optimizing the edge base station of the TA to be optimized if the target edge base station exists in the TA to be optimized comprises:
determining adjacent base stations of the target edge base station;
and if the service switching times of the adjacent base station are smaller than the target switching times threshold, setting the adjacent base station as the edge base station of the TA to be optimized.
3. The method according to claim 2, wherein the target handover number threshold is an average of service handover numbers of all source base stations in the TA to be optimized; the method further comprises the steps of:
acquiring a first value and a second value, wherein the first value is the sum of service switching times of all source base stations in the TA to be optimized, and the second value is the number of all source base stations in the TA to be optimized;
and determining the target switching frequency threshold according to the first value and the second value.
4. A method according to claim 3, characterized in that the method further comprises:
acquiring the number of source base stations in a mother TA;
if the number of the source base stations in the mother TA is greater than a preset number threshold, dividing the mother TA into a plurality of sub-TAs, wherein the number of the source base stations in each sub-TA in the plurality of sub-TAs is smaller than the preset number threshold, and the plurality of sub-TAs comprise the TA to be optimized.
5. An apparatus for optimizing a paging zone, the apparatus comprising:
an obtaining unit, configured to obtain service switching information of each source base station in a paging area TA to be optimized, where the service switching information includes: the method comprises the steps that a TA where a source base station is located, service switching times, a target base station and a TA where the target base station is located are carried out, and the source base station corresponds to the target base station;
the processing unit is configured to determine that a first base station is an edge base station of the TA to be optimized if a TA where the first base station is located is different from a TA where a target base station corresponding to the first base station is located, where the first base station is any one of the source base stations;
the processing unit is further configured to determine, according to the service switching times of each edge base station and a target switching times threshold, whether the TA to be optimized has a target edge base station, where the target edge base station is an edge base station whose service switching times are greater than the target switching times threshold;
the processing unit is further configured to optimize an edge base station of the TA to be optimized if the target edge base station exists in the TA to be optimized, and the target edge base station does not exist in the TA to be optimized after the optimization.
6. The device according to claim 5, wherein the processing unit is adapted, in particular,
determining adjacent base stations of the target edge base station;
and if the service switching times of the adjacent base station are smaller than the target switching times threshold, setting the adjacent base station as the edge base station of the TA to be optimized.
7. The apparatus of claim 6, wherein the target handover number threshold is an average of service handover numbers of all source base stations in the TA to be optimized;
the acquiring unit is further configured to acquire a first value and a second value, where the first value is a sum of service switching times of all source base stations in the TA to be optimized, and the second value is a number of all source base stations in the TA to be optimized;
the processing unit is further configured to determine the target handover frequency threshold according to the first value and the second value.
8. The apparatus of claim 7, wherein the device comprises a plurality of sensors,
the acquisition unit is further configured to acquire the number of source base stations in the mother TA;
the processing unit is further configured to divide the mother TA into a plurality of sub-TAs if the number of source base stations in the mother TA is greater than a preset number threshold, where the number of source base stations in each sub-TA in the plurality of sub-TAs is less than the preset number threshold, and the plurality of sub-TAs includes the TA to be optimized.
9. An apparatus for optimizing a paging zone, comprising: a processor and a memory; the processor and the memory are coupled; the memory is configured to store one or more programs, the one or more programs comprising computer-executable instructions that, when executed by the paging zone optimization device, cause the paging zone optimization device to perform the method of any of claims 1-4.
10. A computer readable storage medium having instructions stored therein, which when executed by a computer, performs the method of any of claims 1-4.
CN202111305658.XA 2021-11-05 2021-11-05 Paging area optimization method, device and storage medium Active CN114071711B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111305658.XA CN114071711B (en) 2021-11-05 2021-11-05 Paging area optimization method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111305658.XA CN114071711B (en) 2021-11-05 2021-11-05 Paging area optimization method, device and storage medium

Publications (2)

Publication Number Publication Date
CN114071711A CN114071711A (en) 2022-02-18
CN114071711B true CN114071711B (en) 2023-07-18

Family

ID=80274154

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111305658.XA Active CN114071711B (en) 2021-11-05 2021-11-05 Paging area optimization method, device and storage medium

Country Status (1)

Country Link
CN (1) CN114071711B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108696877A (en) * 2017-04-11 2018-10-23 中国移动通信集团安徽有限公司 The confirmation method and device of the border cell of tracking area
US10212615B1 (en) * 2017-10-29 2019-02-19 Cisco Technology, Inc. Tracking area optimization
WO2020114606A1 (en) * 2018-12-07 2020-06-11 Telefonaktiebolaget Lm Ericsson (Publ) User equipment tracking and paging area selection in wireless communication systems

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4932515B2 (en) * 2007-02-02 2012-05-16 株式会社エヌ・ティ・ティ・ドコモ Tracking area setting device, user device, and tracking area setting method
CN101815298B (en) * 2009-02-25 2013-04-24 华为技术有限公司 Tracking area optimizing and updating method, device and system
US9191835B2 (en) * 2013-11-27 2015-11-17 At&T Intellectual Property I, L.P. Method and apparatus for tracking area planning and optimization in a wireless network
US10212693B2 (en) * 2014-11-03 2019-02-19 Parallel Wireless, Inc Tracking area planning

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108696877A (en) * 2017-04-11 2018-10-23 中国移动通信集团安徽有限公司 The confirmation method and device of the border cell of tracking area
US10212615B1 (en) * 2017-10-29 2019-02-19 Cisco Technology, Inc. Tracking area optimization
WO2020114606A1 (en) * 2018-12-07 2020-06-11 Telefonaktiebolaget Lm Ericsson (Publ) User equipment tracking and paging area selection in wireless communication systems

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Huawei.C1-080547 "TR24.801 - TA List Unchanged optimization".3GPP tsg_ct\WG1_mm-cc-sm_ex-CN1.2008,(第TSGC1_51期),全文. *
Mitsubishi Electric.S2-073219 "Self-optimization of assigned TA list from reported list of last visited TAs".3GPP tsg_sa\WG2_Arch.2007,(第TSGS2_59_Helsinki期),全文. *
基于LTE网络寻呼模型的TA容量分析;张秀成;;电信工程技术与标准化(第01期);全文 *

Also Published As

Publication number Publication date
CN114071711A (en) 2022-02-18

Similar Documents

Publication Publication Date Title
US11212154B2 (en) Signal sending method, network device, and terminal device
CN105848253B (en) Intelligent network searching method and device and mobile terminal
CN112188471B (en) Communication method and device
CN109691194B (en) Paging method and device
CN109413661B (en) Method and device for calculating station distance
CN114071711B (en) Paging area optimization method, device and storage medium
CN116347546A (en) Satellite network switching method, device, equipment and medium
CN113950080B (en) Method, device and storage medium for determining optimized cell
EP3542567B1 (en) Load balancing in cellular networks
US10440562B2 (en) System information obtaining method in cell cluster, related device, and system
CN113923666B (en) Method and device for identifying over-coverage base station, electronic equipment and storage medium
CN114928849A (en) Base station deployment method and device, electronic equipment and storage medium
CN111935778B (en) Power regulation method, device, storage medium and network equipment
CN105122860A (en) Radio white space database discovery
CN108540277B (en) Method for determining transmission power and terminal equipment
CN111866968A (en) Network mode switching method and device
CN112584304A (en) Cell management method and equipment
CN113329476B (en) Network searching method, terminal and storage medium
CN113938922B (en) Method and device for determining optimized cell
CN111034348A (en) User equipment, next generation radio access network node and radio communication method thereof
CN104094642A (en) Scanning of channels based on channel-availability information
CN114698412B (en) Measurement interval determining method, measurement method, related device, and storage medium
CN116600384B (en) Multi-base station positioning method, device, storage medium and system
CN113316093B (en) Communication method, communication apparatus, and storage medium
CN107734605B (en) Method and apparatus for resource management in a communication system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant