CN109996224B - Optimization method, system, equipment and storage medium for tracking area code TAC boundary - Google Patents

Optimization method, system, equipment and storage medium for tracking area code TAC boundary Download PDF

Info

Publication number
CN109996224B
CN109996224B CN201711486741.5A CN201711486741A CN109996224B CN 109996224 B CN109996224 B CN 109996224B CN 201711486741 A CN201711486741 A CN 201711486741A CN 109996224 B CN109996224 B CN 109996224B
Authority
CN
China
Prior art keywords
tac
boundary
traffic
segment
tau
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
CN201711486741.5A
Other languages
Chinese (zh)
Other versions
CN109996224A (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 Mobile Communications Group Co Ltd
China Mobile Group Hubei Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Group Hubei 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 Mobile Communications Group Co Ltd, China Mobile Group Hubei Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN201711486741.5A priority Critical patent/CN109996224B/en
Publication of CN109996224A publication Critical patent/CN109996224A/en
Application granted granted Critical
Publication of CN109996224B publication Critical patent/CN109996224B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • 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
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to an optimization method, a system, equipment and a storage medium for tracking a TAC boundary of an area code, wherein the optimization method comprises the following steps: extracting tracking area update TAU data, and eliminating invalid data to keep valid TAU times; carrying out grid quantization based on the reported traffic and the effective TAU times so as to position the base stations with high traffic and TAU times in the grids with high traffic and TAU times; taking the base station with the largest traffic in the grid as a central base station, and segmenting the base stations within a preset distance range of the central base station according to preset gradient to obtain an initial TAC boundary of each segment; calculating a new TAC boundary of each segment through boundary simulation; and respectively comparing the total traffic of the newly added grids of the new TAC boundary relative to the initial TAC boundary in each section, and taking the new TAC boundary in the section with the minimum total traffic as the optimal TAC boundary. The invention solves the TAC boundary problem of the grid with high service volume and high TAU times in a targeted way by carrying out grid quantization on the service volume and the TAU times.

Description

Optimization method, system, equipment and storage medium for tracking area code TAC boundary
Technical Field
The present invention relates to the field of wireless network optimization technologies, and in particular, to an optimization method, system, device, and storage medium for tracking area code boundaries.
Background
In the existing method for optimizing the boundary of a Tracking Area Code (TAC), by means of Operation and Maintenance Center (OMC) network management data and cell static information, the number of times of updating a Tracking Area of a network and the paging capability of the Tracking Area are analyzed, and trade-off processing is performed between the number of times of updating the Tracking Area and the paging capability of the Tracking Area, so that the Tracking Area is divided, the updating frequency of the Tracking Area is reduced, and system channel resources are saved.
The optimization method of the TAC boundary is to extract accumulated Tracking Area Update (TAU) times data of all users in the whole Tracking Area and manually adjust and divide the size of the Tracking Area by combining paging capacity in the Tracking Area. Because the extracted TAU data contains more invalid data and a large amount of TAU data is mainly concentrated on the TAC boundary, the TAU data is inaccurate in statistics and low in manual adjustment efficiency, user perception cannot be improved in a targeted manner, and the actual problem in the network cannot be effectively solved.
Disclosure of Invention
The invention aims to provide an optimization method and system for tracking the TAC boundary of an area code, which can solve the TAC boundary problem with high traffic and high TAU times in a targeted manner.
In one aspect, an embodiment of the present invention provides an optimization method for tracking a TAC boundary of a region code, including: extracting tracking area update TAU data, and eliminating invalid data to keep valid TAU times; carrying out grid quantization based on the reported traffic and the effective TAU times so as to position the base stations with high traffic and TAU times in the grids with high traffic and TAU times; taking the base station with the largest traffic in the grid as a central base station, and segmenting the base stations within a preset distance range of the central base station according to preset gradient to obtain an initial TAC boundary of each segment; calculating a new TAC boundary of each segment through boundary simulation; and respectively comparing the total traffic of the newly added grids of the new TAC boundary relative to the initial TAC boundary in each section, and taking the new TAC boundary in the section with the minimum total traffic as the optimal TAC boundary.
According to an aspect of the embodiments of the present invention, calculating a new TAC boundary for each segment through boundary simulation includes: obtaining all TAC values of the base station in each segment; comparing the traffic of the base station under different TAC values in each segment to obtain a TAC value corresponding to the minimum traffic in each segment; adjusting the TAC values of all base stations in each segment to be the TAC value corresponding to the minimum traffic in the segment; and calculating the new TAC boundary of each segment by adopting a Thiessen polygon method according to the adjusted TAC value.
According to an aspect of the embodiments of the present invention, performing trellis quantization based on reported traffic and effective TAU times includes: and matching the characteristic vectors with a fingerprint library in the grid set of the home main service cell according to a minimum Euclidean distance method, and positioning each TAU time data to an optimal space grid.
According to an aspect of an embodiment of the invention, the invalid data includes an initial attach, a periodic TAU number, and a joint TAU number.
On the other hand, the embodiment of the present invention further provides an optimization system for tracking a TAC boundary of a region code, which includes: the extraction unit is used for extracting the TAU data and eliminating invalid data so as to keep the number of valid TAUs; a positioning unit, configured to perform grid quantization based on the reported traffic and the effective TAU times, so as to position a base station with high traffic and high TAU times in a grid with high traffic and high TAU times; the dividing unit is used for taking the base station with the largest traffic in the grid as a central base station, and dividing the base stations in a preset distance range of the central base station into sections according to a preset gradient to obtain an initial TAC boundary of each section; the calculating unit is used for calculating a new TAC boundary of each segment through boundary simulation; and the optimizing unit is used for respectively comparing the total traffic of the newly added grids of the new TAC boundary relative to the initial TAC boundary in each section, and taking the new TAC boundary in the section with the minimum total traffic as the optimal TAC boundary.
According to an aspect of the embodiment of the present invention, the calculating unit is further configured to obtain all TAC values of the base stations in each segment, compare traffic amounts of the base stations under different TAC values in each segment, obtain a TAC value corresponding to a minimum traffic amount in each segment, adjust the TAC values of all base stations in each segment to the TAC value corresponding to the minimum traffic amount in the segment, and calculate a new TAC boundary of each segment by using a thieson polygon method according to the adjusted TAC values.
According to an aspect of the embodiment of the present invention, the positioning unit is further configured to perform matching of feature vectors with the fingerprint database according to a minimum euclidean distance method in the grid set of the home primary serving cell, and position each TAU time data to an optimal spatial grid.
According to an aspect of an embodiment of the present invention, the invalid data rejected by the extraction unit includes initial attach, periodic TAU times, and joint TAU times.
On the other hand, an embodiment of the present invention further provides an optimization apparatus for tracking a TAC boundary of a region code, including: a memory storing computer program instructions; a processor which when executed by the processor implements a method of optimizing the TAC boundary of the tracking area code as previously described.
In another aspect, an embodiment of the present invention further provides a computer storage medium, where the computer storage medium includes instructions, and when the instructions are executed on a computer, the instructions cause the computer to perform the foregoing optimization method for tracking area code TAC boundary.
According to the optimization method and system for tracking the TAC boundary of the area code, provided by the embodiment of the invention, the effective data of the TAU times of the cell level and the grid level are counted by using the big data signaling platform, and the TAC boundary problem of grids with high service volume and high TAU times is pertinently solved by carrying out grid quantization on the service volume and the TAU times, so that the user perception can be effectively improved.
Drawings
Features, advantages and technical effects of exemplary embodiments of the present invention will be described below with reference to the accompanying drawings.
FIG. 1 is a block diagram of a flowchart of an optimization method for tracking a TAC boundary of a region code according to an embodiment of the present invention;
FIG. 2 is a schematic block diagram of an optimization system for tracking TAC boundaries in area codes according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a TAC boundary after grid quantization is performed on reported traffic and effective TAU times by using the optimization method for tracking an area code TAC boundary shown in fig. 1;
fig. 4 is a schematic diagram of calculating new TAC boundaries within the first segment for the TAC boundaries shown in fig. 3;
fig. 5 is a schematic diagram of calculating a new TAC boundary within the second section with respect to the TAC boundary shown in fig. 3.
Detailed Description
The embodiments of the present invention will be described in further detail with reference to the drawings and examples. The following detailed description of the embodiments and the accompanying drawings are provided to illustrate the principles of the invention and are not intended to limit the scope of the invention, i.e., the invention is not limited to the described embodiments.
For better understanding of the present invention, the following describes in detail a method and a system for optimizing TAC boundaries of tracking area codes according to an embodiment of the present invention with reference to fig. 1 to 3.
Referring to fig. 1, an embodiment of the present invention provides an optimization method for tracking a TAC boundary of a region code, including:
and step S1, extracting tracking area update TAU data, and eliminating invalid data to keep valid TAU times.
Invalid data includes initial attach, periodic TAU times, and joint TAU times. And extracting TAU data by using a big data signaling platform based on an S1-MME interface, and eliminating invalid data to reserve valid TAU times as the basis of subsequent analysis and statistics.
The process of extracting TAU data from a big data signaling platform is described in detail below. The first 3 bytes (bit) in the TAU flow of the kernel 1 field of the S1-MME interface are used for distinguishing different TAU services, and the following table shows that:
Figure BDA0001534900750000041
the value of EPS update type value is as follows:
Figure BDA0001534900750000051
in the TAU flow, the first 3-byte values are "001" and "010" as the joint TAU times, the value is "011" as the periodic TAU times, the values are "100" and "101" as the initial attachment data, and only the data corresponding to the value of "000" is the TAU valid data reserved from the big data signaling platform, so that the signaling data of the subsequent analysis and statistics is more accurate.
And step S2, carrying out grid quantization based on the reported traffic and the effective TAU times so as to position the base station with high traffic and TAU times in the grid with high traffic and TAU times.
Step S3, taking the base station with the largest traffic in the grid as the central base station, dividing the base stations in the preset distance range of the central base station into sections according to the preset gradient, and obtaining the initial TAC boundary of each section.
The big data signaling platform can output grids with high service volume and high TAU times, and can also output base stations with high service volume and high TAU times in the grids. If there are multiple base stations in the same grid, the base station with the largest traffic is used as the center base station.
In addition, base stations within a predetermined distance range from the central base station are divided into segments according to a predetermined gradient, for example, 5 segments each having a distance of 100m, 200m, 300m, 400m, and 500m from the central base station are divided into segments according to a predetermined gradient of 100m with an urban area of 500m as the predetermined distance range. For non-urban areas, it is possible to divide 5 segments into segments with a predetermined gradient of 200m, with 1000m as the predetermined distance range, each segment being segmented at distances of 200m, 400m, 600m, 800m and 1000m with respect to the central base station.
It is to be understood that the predetermined distance range and the predetermined gradient are not limited to the above values, and may be modified adaptively according to specific situations.
In step S4, a new TAC boundary for each segment is calculated by boundary simulation.
Step S5, respectively comparing the total traffic of the newly added grid of the new TAC boundary relative to the initial TAC boundary in each segment, and taking the new TAC boundary in the segment with the minimum total traffic as the optimal TAC boundary.
Further, in step S2, the performing grid quantization based on the reported traffic volume and the effective TAU number includes: and matching the characteristic vectors with a fingerprint library in the grid set of the home main service cell according to a minimum Euclidean distance method, and positioning each TAU time data to an optimal space grid.
Further, in step S4, the calculating of the new TAC boundary for each segment through boundary simulation includes:
step S41, all TAC values of the base station in each segment are obtained;
step S42, comparing the traffic of the base station under different TAC values in each segment to obtain the TAC value corresponding to the minimum traffic in each segment;
step S43, adjusting the TAC values of all base stations in each segment to the TAC value corresponding to the minimum traffic volume in the segment;
and step S44, calculating the new TAC boundary of each segment by adopting a Thiessen polygon method according to the adjusted TAC value. The Thiessen polygon method is a well-established technique and is not described herein in detail.
Referring to fig. 5, an embodiment of the present invention further provides an optimization system for tracking a TAC boundary of a region code, including: an extraction unit 10, a positioning unit 20, a dividing unit 30, a calculation unit 40 and an optimization unit 50.
The extracting unit 10 is used for extracting TAU data and eliminating invalid data to keep valid TAU times. Invalid data includes initial attach, periodic TAU times, and joint TAU times.
The positioning unit 20 is configured to perform grid quantization based on the reported traffic and the effective TAU number, so as to position the base station with high traffic and high tracking area update times in the grid with high traffic and high tracking area update times.
The dividing unit 30 is configured to use a base station with the largest traffic in the grid as a center base station, and divide base stations within a predetermined distance range of the center base station into segments according to a predetermined gradient to obtain an initial TAC boundary of each segment.
The calculation unit 40 is used to calculate new TAC boundaries for each segment by boundary simulation.
The optimizing unit 50 is configured to compare the total traffic of the newly added grid of the new TAC boundary with respect to the initial TAC boundary in each segment, and use the new TAC boundary in the segment with the minimum total traffic as the optimal TAC boundary.
In addition, the calculating unit 40 is further configured to obtain all TAC values of the base stations in each segment, compare traffic amounts of the base stations under different TAC values in each segment, obtain a TAC value corresponding to a minimum traffic amount in each segment, adjust the TAC values of all the base stations in each segment to the TAC value corresponding to the minimum traffic amount in the segment, and calculate a new TAC boundary of each segment by using a thieson polygon method according to the adjusted TAC values.
The positioning unit 20 is further configured to perform matching of feature vectors with the fingerprint database according to a minimum euclidean distance method in the grid set of the home main serving cell, and position each TAU time data to the optimal spatial grid.
It can be understood that the system for optimizing the TAC boundary of the tracking area code provided in the embodiment of the present invention is an execution subject of the method for optimizing the TAC boundary of the tracking area code, and specific execution modes of the modules may refer to the content of the method for optimizing the TAC boundary of the tracking area code, which is not described herein again.
According to the optimization method and system for tracking the TAC boundary of the area code, provided by the embodiment of the invention, the effective data of the TAU times of the cell level and the grid level are counted by using the big data signaling platform, and the TAC boundary problem of grids with high traffic and TAU times is pertinently solved by carrying out grid quantization on the traffic and the TAU times, so that the user perception is effectively improved.
For ease of understanding, the process of obtaining the optimal TAC boundary is described in detail below with reference to fig. 3 to 5.
As shown in fig. 3, extracting effective TAU times data in a big data signaling platform; and carrying out grid quantization based on the reported traffic and the effective TAU times so as to position the base stations with high traffic and high TAU times in grids Gr1, Gr2 and Gr3 with high traffic and high TAU times.
Assuming that a base station M with the largest traffic volume in the grid Gr1 is a central base station, and a 500M range of an urban area is used as a boundary, and segments are divided into 100M, 200M, 300M, 400M and 500M, fig. 3 only shows the base station distribution of the first two segments S1 and S2, where S1 is 100M and S2 is 200M, and an initial TAC boundary B1 of each segment is obtained after segmentation.
For the S1 segment, first, all TAC values of the base stations in the S1 segment are obtained, which are TAC1, TAC2 and TAC3, traffic of the base stations under TAC1, TAC2 and TAC3 in the S1 segment is compared, a TAC value corresponding to the minimum traffic in the S1 segment is obtained, for example, the TAC value corresponding to the minimum traffic is TAC1, the TAC values of all base stations in the S1 segment are all adjusted to be TAC1, and a new TAC boundary B1' of the S1 segment is calculated by using a taison polygon method according to the adjusted TAC1 value, as shown in fig. 4. The total traffic of the newly added grid of the new TAC boundary B1' with respect to the initial TAC boundary B1 within the segment S1 is compared.
In the same way, the new TAC boundary B2 'of the S2 segment is calculated, and as shown in fig. 5, the total traffic of the newly added grid of the new TAC boundary B2' relative to the initial TAC boundary B1 in the S2 segment is compared. And calculating new TAC boundaries of the rest 3 segments by the same method, and respectively comparing the total traffic of the newly added grids of the new TAC boundaries in the rest 3 segments relative to the initial TAC boundaries.
And aiming at the total traffic of the newly added grids of the 5 segments, taking the new TAC boundary in the segment with the minimum total traffic as the optimal TAC boundary. For example, the total traffic of the newly added grid in the S2 segment is the least, so the optimal TAC boundary is proposed as the new TAC boundary in the S2 segment.
In addition, an embodiment of the present invention further provides an optimization apparatus for tracking a TAC boundary of a region code, including: a memory storing computer program instructions; a processor which when executed by the processor implements a method of optimizing the TAC boundary of the tracking area code as previously described.
In addition, the embodiment of the present invention further provides a computer storage medium, where the computer storage medium includes instructions, and when the instructions are executed on a computer, the instructions cause the computer to execute the optimization method for tracking the TAC boundary of the area code as described above.
While the invention has been described with reference to a preferred embodiment, various modifications may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In particular, the technical features mentioned in the embodiments can be combined in any way as long as there is no structural conflict. The present invention is not limited to the predetermined embodiments disclosed herein but encompasses all technical solutions falling within the scope of the claims.

Claims (8)

1. An optimization method for tracking TAC boundary of area code includes:
extracting tracking area update TAU data, and eliminating invalid data to keep valid TAU times;
performing grid quantization based on the reported traffic and the effective TAU times to position the base stations with high traffic and TAU times in the grids with high traffic and TAU times;
taking the base station with the largest traffic in the grid as a central base station, and segmenting the base station within a preset distance range of the central base station according to a preset gradient to obtain an initial TAC boundary of each segment;
calculating a new TAC boundary of each segment through boundary simulation;
respectively comparing the total traffic of the newly added grids of the new TAC boundary relative to the initial TAC boundary in each section, and taking the new TAC boundary in the section with the minimum total traffic as an optimal TAC boundary;
the calculating of the new TAC boundary of each segment through boundary simulation includes:
obtaining all TAC values of the base station in each segment;
comparing the traffic of the base station under different TAC values in each segment to obtain the TAC value corresponding to the minimum traffic in each segment;
adjusting the TAC values of all the base stations in each segment to the TAC value corresponding to the minimum traffic in the segment;
and calculating the new TAC boundary of each segment by adopting a Thiessen polygon method according to the adjusted TAC value.
2. The optimization method of claim 1, wherein the performing trellis quantization based on reported traffic and the number of available TAUs comprises:
and matching the characteristic vectors with a fingerprint library in a grid set of a home main service cell according to a minimum Euclidean distance method, and positioning each TAU time data to an optimal space grid.
3. The optimization method of claim 1, wherein the invalid data comprises initial attach, periodic TAU number, and joint TAU number.
4. An optimization system for tracking TAC boundaries in a region code, comprising:
an extraction unit (10) for extracting the TAU data and eliminating invalid data to retain valid TAU times;
a positioning unit (20) for performing grid quantization based on the reported traffic and the effective TAU times to position the high-traffic and high-TAU-times base station in the grid with high traffic and high TAU times;
a dividing unit (30) for taking the base station with the largest traffic in the grid as a central base station, and dividing the base station in the predetermined distance range of the central base station into segments according to a predetermined gradient to obtain an initial TAC boundary of each segment;
a calculation unit (40) for calculating new TAC boundaries for the segments by boundary simulation;
an optimizing unit (50) for respectively comparing the total traffic of the newly added grid of the new TAC boundary relative to the initial TAC boundary in each segment, and taking the new TAC boundary in the segment with the minimum total traffic as an optimal TAC boundary;
the calculating unit (40) is further configured to obtain all TAC values of the base station in each segment, compare traffic amounts of the base station under different TAC values in each segment, obtain the TAC value corresponding to the minimum traffic amount in each segment, adjust the TAC values of all base stations in each segment to the TAC value corresponding to the minimum traffic amount in the segment, and calculate the new TAC boundary of each segment by using a thieson polygon method according to the adjusted TAC values.
5. The optimization system according to claim 4, wherein the positioning unit (20) is further configured to match feature vectors with a fingerprint database in a grid set of home primary cells according to a minimum Euclidean distance method, and to position each of the TAU times data to an optimal spatial grid.
6. The optimization system according to claim 4, characterized in that the invalid data rejected by the extraction unit (10) comprises initial attach, periodic TAU times and joint TAU times.
7. An optimization apparatus for tracking TAC boundaries of area codes, comprising:
a memory storing computer program instructions;
processor which when executed by said processor implements a method of optimizing tracking area code, TAC, boundaries according to any one of claims 1-3.
8. A computer-readable storage medium, characterized in that,
the computer-readable storage medium has stored instructions which, when run on a computer, cause the computer to perform the method of optimizing tracking area code, TAC, boundaries according to any one of claims 1-3.
CN201711486741.5A 2017-12-30 2017-12-30 Optimization method, system, equipment and storage medium for tracking area code TAC boundary Active CN109996224B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711486741.5A CN109996224B (en) 2017-12-30 2017-12-30 Optimization method, system, equipment and storage medium for tracking area code TAC boundary

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711486741.5A CN109996224B (en) 2017-12-30 2017-12-30 Optimization method, system, equipment and storage medium for tracking area code TAC boundary

Publications (2)

Publication Number Publication Date
CN109996224A CN109996224A (en) 2019-07-09
CN109996224B true CN109996224B (en) 2021-09-28

Family

ID=67111306

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711486741.5A Active CN109996224B (en) 2017-12-30 2017-12-30 Optimization method, system, equipment and storage medium for tracking area code TAC boundary

Country Status (1)

Country Link
CN (1) CN109996224B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114363922B (en) * 2020-10-14 2023-07-07 中国移动通信集团设计院有限公司 TAC boundary optimization method and device
WO2022188108A1 (en) * 2021-03-11 2022-09-15 北京小米移动软件有限公司 Methods and apparatuses for sending and determining tracking area code, device and storage medium

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106304105B (en) * 2015-05-18 2019-11-12 中国移动通信集团湖北有限公司 A kind of position area optimization method and device
CN106851664A (en) * 2015-12-03 2017-06-13 中国联合网络通信集团有限公司 Determine the method and device on tracking area border

Also Published As

Publication number Publication date
CN109996224A (en) 2019-07-09

Similar Documents

Publication Publication Date Title
CN111756848B (en) QoS optimization method based on federal learning and mobile perception under mobile edge environment
CN101296477B (en) Method and device for planning network topological
CN107548067B (en) Traffic-based capacity expansion method and device
CN109996224B (en) Optimization method, system, equipment and storage medium for tracking area code TAC boundary
CN109995836B (en) Cache decision method and device
CN108882174B (en) Mobile terminal positioning method and device, electronic equipment and storage medium
WO2017211150A1 (en) Processing method and device for storing fingerprint data in library
WO2016127880A1 (en) Method and device for determining quality of offline positioning data
CN113412608B (en) Content pushing method and device, server and storage medium
CN111327435B (en) Root cause positioning method, server and storage medium
CN108696877B (en) Method and device for confirming boundary cells of tracking area
CN107046691B (en) LTE wireless network rapid site selection method
WO2020024597A1 (en) Indoor positioning method and apparatus
CN110856188B (en) Communication method, apparatus, system, and computer-readable storage medium
CN108770057B (en) Method for determining predetermined fingerprint database, method and device for positioning fingerprint, and storage medium
US9271175B2 (en) Wireless quality collecting device, wireless quality collecting method, and computer-readable recording medium
CN109936820A (en) A kind of user terminal localization method and device
CN111163482B (en) Data processing method, device and storage medium
CN114676444A (en) Block chain-based storage system
CN114118748B (en) Service quality prediction method and device, electronic equipment and storage medium
CN114547180A (en) Data processing system and method based on multiple geographic visualization platforms
CN112101692A (en) Method and device for identifying poor-quality users of mobile Internet
CN112887910B (en) Method and device for determining abnormal coverage area and computer readable storage medium
CN110830978B (en) User data processing method, device, equipment and medium based on region
CN111385804B (en) Cell cluster dividing method and electronic equipment

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