CN106255126A - A kind of method and device identifying to arrange flowers in base station location district - Google Patents
A kind of method and device identifying to arrange flowers in base station location district Download PDFInfo
- Publication number
- CN106255126A CN106255126A CN201510311608.0A CN201510311608A CN106255126A CN 106255126 A CN106255126 A CN 106255126A CN 201510311608 A CN201510311608 A CN 201510311608A CN 106255126 A CN106255126 A CN 106255126A
- Authority
- CN
- China
- Prior art keywords
- triangle
- lac
- base station
- triangular
- triangles
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000004458 analytical method Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000003491 array Methods 0.000 claims description 3
- 238000007726 management method Methods 0.000 claims description 3
- 238000005520 cutting process Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 7
- 238000010295 mobile communication Methods 0.000 description 6
- 238000013439 planning Methods 0.000 description 5
- 239000007787 solid Substances 0.000 description 3
- 238000004891 communication Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
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
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/24—Cell structures
- H04W16/30—Special cell shapes, e.g. doughnuts or ring cells
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the method identifying the flower arrangement of base station location district, including: the Area generation network of triangle serviced base station, the lane place calculating each triangular apex in described network of triangle encodes (LAC)；Select the LAC on a summit of any one triangle in described network of triangle and selected triangle, all trianglees that traversal is directly or indirectly connected with selected triangle, according to the LAC identification flower arrangement base station of all trianglees that selected LAC is directly or indirectly connected with selected triangle.The invention also discloses a kind of device identifying to arrange flowers in base station location district.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method and a device for identifying flower arrangement in a base station location area.
Background
A mobile communication network generally comprises a plurality of cells, and in order to locate the geographical position of a user and implement call connection and short message delivery, the mobile communication network needs to master the position information of the user, namely the position area of the user; at present, in order to manage a location area, a group of cells adjacent to a geographical location is divided into one location area, and the same location area has the same Location Area Code (LAC); thus, a plurality of location areas form a complete mobile network. When planning a network, a geographical area, such as a city, needs to be divided into a plurality of location areas, and then each cell is scattered into different location areas to form a seamless mobile communication network; then, carrying out on-site survey by using the mobile communication network after dividing the position area; however, due to reasons such as property, the location of the station is usually changed, and the boundary between different location areas is deformed, so that the location area attribute of one base station is different from that of the surrounding base stations, and the base station having the location area attribute different from that of the surrounding base stations is called a cut-out station. Since the flower arrangement sites may cause damage to the performance of the mobile communication network, it is necessary to identify the flower arrangement sites and adjust the planning scheme in time.
At present, in the course of a first planning of a mobile communication network, the division of location areas and the scattering of cells need to be designed by iteration for many times, and the boundary relation among a plurality of location areas is checked; moreover, such inspection requires manual checking on the map, which consumes a lot of manpower.
Disclosure of Invention
In view of this, embodiments of the present invention are expected to provide a method and an apparatus for identifying a flower arrangement in a base station location area, which can efficiently, conveniently and automatically identify the flower arrangement in the base station location area, determine LAC area planning information, and save time and labor.
The technical scheme of the embodiment of the invention is realized as follows:
the method for identifying the flower arrangement in the base station location area provided by the embodiment of the invention comprises the following steps: generating a triangular network from an area served by a base station, and calculating a position area code (LAC) of each triangular vertex in the triangular network; selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying the flower arrangement base station according to the LACs of all triangles directly or indirectly connected with the selected triangle.
In the above scheme, the identifying the flower arrangement base station according to the selected LAC and the LACs of all triangles directly or indirectly connected to the selected triangle includes: identifying the triangle vertexes with different LACs from the selected LAC as flower arrangement base stations when the LACs of any two vertexes or three vertexes of the selected triangle are the same; and identifying the triangle vertex of the selected LAC as a flower arrangement base station when the LAC of one vertex of the selected triangle is different from the LACs of the other two vertices of the selected triangle, the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is different from the LAC of all the triangle vertices directly or indirectly connected with the selected triangle, and the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is the same as the LAC of the two outer two vertices of the selected triangle.
In the foregoing solution, when all the triangles LAC in the selected triangulation are the same, the selected triangulation is embedded in another triangulation composed of triangles with the same LAC, and the LAC of the selected triangulation is different from the LAC of the other triangulation, the method further includes: and calculating the number of the base stations in the selected triangular net and the number of the base stations in the other triangular net, and identifying the base stations in the triangular net as the flower arrangement base station cluster when the ratio of the number of the base stations in the triangular net to the number of the base stations in the other triangular net is greater than a preset threshold value.
In the above solution, after calculating the LAC of each triangle vertex in the triangle mesh, the method further includes: storing triangles with two vertexes or three vertexes having the same LAC as dynamic arrays;
accordingly, after traversing all triangles connected directly or indirectly to the triangle, the method further comprises: and deleting the traversed triangles with the same LAC from the dynamic array.
In the above scheme, when the dynamic array is empty, traversal is completed.
The embodiment of the invention also provides a device for identifying the flower arrangement in the base station location area, which comprises: the device comprises a processing module, a calculating module, an analyzing module and a recognition module; wherein,
the processing module is used for generating a triangular network for the area served by the base station;
the calculation module is used for calculating the position area code LAC of each triangle vertex in the triangular net;
the analysis module is used for selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, and traversing all the triangles directly or indirectly connected with the selected triangle;
the identification module is used for identifying the flower arrangement base station according to the selected LAC and all triangular LACs directly or indirectly connected with the selected triangle.
In the above scheme, the identification module is specifically configured to identify, as the flower arrangement base station, a triangle vertex having a LAC different from that of the selected LAC when the LACs of any two vertices or three vertices of the selected triangle are the same; and identifying the triangle vertex of the selected LAC as a flower arrangement base station when the LAC of one vertex of the selected triangle is different from the LACs of the other two vertices of the selected triangle, the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is different from the LAC of all the triangle vertices directly or indirectly connected with the selected triangle, and the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is the same as the LAC of the two outer two vertices of the selected triangle.
In the above scheme, the calculating module is further configured to calculate the number of base stations in the selected triangulated network and the number of base stations in another triangulated network when all the triangular LACs in the selected triangulated network are the same, the selected triangulated network is embedded in another triangulated network formed by the same LAC triangles, and the LAC of the selected triangulated network is different from the LAC of the another triangulated network;
correspondingly, the identification module is further configured to identify the base station in the triangular network as a flower arrangement base station cluster when a ratio of the number of the base stations in the triangular network to the number of the base stations in the other triangular network is greater than a preset threshold value.
In the above scheme, the apparatus further comprises: the management module is used for storing the triangles with two vertexes or three vertexes having the same LAC as a dynamic array after the calculation module calculates the LAC of each vertex of the triangle in the triangular net; and after the analysis module traverses all triangles directly or indirectly connected with the triangles, deleting the traversed triangles with the same LAC from the dynamic array.
In the above scheme, when the dynamic array is empty, the analysis module completes traversal.
The method and the device for identifying the flower arrangement in the base station location area provided by the embodiment of the invention generate a triangular network from the area served by the base station, and calculate the LAC of each triangular vertex in the triangular network; selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying the flower arrangement base station according to the LACs of all triangles directly or indirectly connected with the selected triangle. The triangular net is a Delaunay triangular net generated by a triangulation tool; thus, by searching triangles in the triangular net for triangles sharing a common side and a common vertex, when the LAC of one vertex in the triangles is different from the LACs of other triangles directly or indirectly connected with the triangle to which the vertex belongs, the base station represented by the vertex is identified as a flower arrangement base station; when the ratio of the number of base stations in one triangular net to the number of base stations in the other triangular net is greater than a preset threshold value, the base stations in the one triangular net are identified as a flower arrangement base station cluster; the method and the device realize efficient, convenient and fast automatic identification of the flower arrangement in the base station location area and determination of LAC area planning information, and save time and labor.
Drawings
FIG. 1 is a schematic view of a basic process flow for identifying a flower arrangement in a base station location area according to an embodiment of the present invention;
FIG. 2 is a first diagram of an embodiment of the present invention traversing triangles connected to a selected triangle;
FIG. 3 is a second diagram illustrating traversal of triangles connected to a selected triangle according to an embodiment of the present invention;
FIG. 4 is a third diagram illustrating traversal of triangles connected to a selected triangle according to an embodiment of the present invention;
FIG. 5 is a diagram of a flower arrangement base station cluster according to an embodiment of the present invention;
FIG. 6 is a flowchart illustrating a detailed process for identifying a flower arrangement in a base station location area according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a triangle connected to a selected triangle traversed by an embodiment of the present invention;
fig. 8 is a schematic structural diagram illustrating a structure of an apparatus for identifying a flower arrangement in a base station location area according to an embodiment of the present invention.
Detailed Description
In the embodiment of the invention, a triangular network is generated in an area served by a base station, and the LAC of each triangular vertex in the triangular network is calculated; selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying the flower arrangement base station according to the LACs of all triangles directly or indirectly connected with the selected triangle.
In the embodiment of the present invention, a basic processing flow of the method for identifying a flower arrangement in a base station location area, as shown in fig. 1, includes the following steps:
step 101, generating a triangular network in an area served by a base station;
here, a Delaunay triangulation network may be generated for the area served by the base station through a triangulation tool;
how to generate a triangle network through a triangulation tool belongs to the prior art, and is not described herein again.
102, calculating LAC of each triangle vertex in the triangular net;
here, after calculating the LAC of each triangle vertex in the triangle mesh, storing a triangle having two vertices with the same LAC or a triangle having three vertices with the same LAC as a dynamic array;
in this embodiment, how to calculate the LAC of each triangle vertex in the triangle network belongs to the prior art, and details are not described here.
103, selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying a flower arrangement base station according to the LAC of all triangles directly or indirectly connected with the selected triangle;
in particular, a first schematic diagram of triangles connected to the selected triangle is traversed, as shown in FIG. 2:
in the embodiment of the invention, a triangle 1 is selected, and LACs of three vertexes of the triangle 1 are the same; the triangle directly connected to the triangle 1 is the triangle sharing the same side with the triangle 1, and includes the triangles 2, 3, and 4, and the LACs of the vertices of the triangles 2, 3, and 4 are the same as the LACs of the three vertices of the triangle 1, so that the triangles 2, 3, and 4 are not the flower arrangement base stations, and the information of the triangles 2, 3, and 4 is deleted from the dynamic array stored in the step 102.
Traversing a second schematic of the triangle connected to the selected triangle, as shown in FIG. 3:
in the embodiment of the present invention, the triangles indirectly connected to the selected triangle 1 include: 5-12 parts of a triangle, wherein LACs at vertexes represented by solid dots in the triangle 5 are different from other LACs in the triangular net, and a base station represented by the solid dots in the triangle 5 is identified as a flower arrangement base station; the LAC of each vertex of triangles 6-12 is the same as the LAC of the three vertices of triangle 1, identifying the non-flower-cut base station of triangles 6-12, and deleting the information of triangles 5-12 in the dynamic array stored in step 102.
Traversing a third schematic of the triangle connected to the selected triangle, as shown in FIG. 4:
in the embodiment of the present invention, the triangles indirectly connected to the selected triangle 1 include: triangles 13-20, the LAC of each vertex of triangles 13-20 being the same as the LAC of the three vertices of triangle 1; therefore, the triangle 13-20 is not the base station for flower arrangement, and the information of the triangle 13-20 is deleted from the dynamic array stored in the step 102; at the moment, if the dynamic array is empty, traversing is finished, and a flower arrangement base station is identified in the triangular network; if the dynamic array is not empty, a LAC of a new triangle different from triangle 1 is selected as the traversal starting point, and step 103 is repeatedly executed until the dynamic array is empty.
In this step, if the LACs of triangles in one triangular net are the same, the triangular net is embedded in another triangular net formed by triangles with the same LAC, and the LACs of the two triangular nets are different, the number of base stations in the two triangular nets needs to be calculated, and when the ratio of the number of base stations in the two triangular nets is greater than a preset threshold value, the base stations in one triangular net are identified as flower arrangement base station clusters; the preset threshold value can be flexibly set according to actual net distribution, such as: 20%, etc.;
specifically, as shown in fig. 5, a first area is represented by a forward diagonal line and includes 5 base stations, and LACs of the 5 base stations are all X; the first area is embedded in a second area, the second area is represented by reverse oblique lines and comprises 50 base stations, and LACs of the 50 base stations are Y; and if the ratio of the number of the base stations in the first area to the number of the base stations in the second area is 1/10 and is smaller than the preset threshold value of 20%, identifying 5 base stations in the first area as the flower-arranging base station cluster.
In the embodiment of the present invention, a detailed processing flow of the method for identifying flower arrangement in a base station location area, as shown in fig. 6, includes the following steps:
step 201, generating a triangular network in an area served by a base station;
here, a Delaunay triangulation network may be generated for the area served by the base station through a triangulation tool;
how to generate a triangle network through a triangulation tool belongs to the prior art, and is not described herein again.
Step 202, calculating the LAC of each triangle vertex in the triangular mesh;
here, after calculating the LAC of each triangle vertex in the triangle mesh, storing a triangle having two vertices with the same LAC or a triangle having three vertices with the same LAC as a dynamic array;
in this embodiment, how to calculate the LAC of each triangle vertex in the triangle network belongs to the prior art, and details are not described here.
Step 203, selecting a triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying a flower arrangement base station according to the LAC of the triangle;
specifically, as shown in fig. 7, one vertex of triangle a and triangle a, i.e., the vertex identified by the solid dots in fig. 7, is selected, and the selected vertex of triangle a is different from the other two vertices LAC of triangle a; the triangle directly connected with the triangle a is a triangle sharing the same side with the triangle a, including the triangle B, C, D, and the vertices of the triangle B, LACs of the vertices of the triangle C, D except the vertex same as the selected triangle a are the same as the LACs of the other two vertices of the triangle a, such as the triangle vertices identified by hollow dots in fig. 7; triangles A-D are deleted from the dynamic data stored in step 202; when traversing triangles sharing the same side with the triangle B, C, D, including the triangle E-L, the LACs of other vertices of the triangle E, F, G are the same as the LACs of the other two vertices of the triangle except the vertex which is the same as the triangle A, deleting the triangle E-L from the dynamic data stored in the step 202; and identifying the base station to which the selected vertex in the triangle A belongs as a flower arrangement base station.
In order to implement the foregoing method for inspecting a machine room, an embodiment of the present invention further provides a device for identifying flower arrangement in a location area of a base station, where a structure of the device is as shown in fig. 8, and the device includes: the system comprises a processing module 1, a calculating module 2, an analyzing module 3 and an identifying module 4; wherein,
the processing module 1 is configured to generate a triangular network from an area served by a base station;
the calculation module 2 is configured to calculate a location area code LAC of each triangle vertex in the triangle network;
the analysis module 3 is configured to select any one of the triangles in the triangle network and the LAC of one vertex of the selected triangle, and traverse all the triangles directly or indirectly connected to the selected triangle;
the identification module 4 is configured to identify the flower arrangement base station according to the selected LAC and the LACs of all triangles directly or indirectly connected to the selected triangle;
here, Delaunay triangulation networks may be generated by triangulation tools for the area served by the base station.
In an embodiment, the identifying module 4 is specifically configured to identify, as the flower arrangement base station, a triangle vertex having a LAC different from that of the selected LAC when the LACs of any two vertices or three vertices of the selected triangle are the same;
and identifying the triangle vertex of the selected LAC as a flower arrangement base station when the LAC of one vertex of the selected triangle is different from the LACs of the other two vertices of the selected triangle, the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is different from the LAC of all the triangle vertices directly or indirectly connected with the selected triangle, and the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is the same as the LAC of the other two vertices of the selected triangle.
In an embodiment, the calculating module 2 is further configured to calculate the number of base stations in the selected triangulated mesh and the number of base stations in another triangulated mesh when all the triangular LACs in the selected triangulated mesh are the same, the selected triangulated mesh is embedded in another triangulated mesh composed of triangles of the same LAC, and the LAC of the selected triangulated mesh is different from the LAC of another triangulated mesh;
correspondingly, the identifying module 4 is further configured to identify the base station in the triangular network as a flower arrangement base station cluster when a ratio of the number of the base stations in the triangular network to the number of the base stations in the other triangular network is greater than a preset threshold;
the preset threshold value can be flexibly set according to actual net distribution, such as: 20%, etc.
In one embodiment, the apparatus further comprises: the management module 5 is used for storing the triangles with the same LAC at two vertexes or three vertexes as dynamic arrays after the calculation module calculates the LAC of each vertex of the triangles in the triangular net; and after the analysis module traverses all triangles directly or indirectly connected with the triangles, deleting the traversed triangles with the same LAC from the dynamic array.
In an embodiment, when the dynamic array is empty, the analysis module 3 completes the traversal.
It should be noted that, in practical applications, the functions of the processing module 1, the calculating module 2, the analyzing module 3, the identifying module 4 and the managing module 5 may be implemented by a Central Processing Unit (CPU), a microprocessor unit (MPU), a Digital Signal Processor (DSP), or a programmable gate array (FPGA).
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.
Claims (10)
1. A method of identifying a base station location area cut, the method comprising:
generating a triangular network from an area served by a base station, and calculating a position area code (LAC) of each triangular vertex in the triangular network;
selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, traversing all triangles directly or indirectly connected with the selected triangle, and identifying the flower arrangement base station according to the LACs of all triangles directly or indirectly connected with the selected triangle.
2. The method of claim 1, wherein the identifying the flower arrangement base station according to the LAC of all triangles directly or indirectly connected with the selected triangle according to the selected LAC comprises:
identifying the triangle vertexes with different LACs from the selected LAC as flower arrangement base stations when the LACs of any two vertexes or three vertexes of the selected triangle are the same;
and identifying the triangle vertex of the selected LAC as a flower arrangement base station when the LAC of one vertex of the selected triangle is different from the LACs of the other two vertices of the selected triangle, the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is different from the LAC of all the triangle vertices directly or indirectly connected with the selected triangle, and the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is the same as the LAC of the two outer two vertices of the selected triangle.
3. The method of claim 1 or 2, wherein when all the triangular meshes in the selected triangular mesh are identical, the selected triangular mesh is embedded in another triangular mesh composed of triangles of the same LAC, and the LAC of the selected triangular mesh is different from the LAC of the other triangular mesh, the method further comprises:
and calculating the number of the base stations in the selected triangular net and the number of the base stations in the other triangular net, and identifying the base stations in the triangular net as the flower arrangement base station cluster when the ratio of the number of the base stations in the triangular net to the number of the base stations in the other triangular net is greater than a preset threshold value.
4. The method of claim 1 or 2, wherein after calculating the LAC of each triangle vertex in the triangular mesh, the method further comprises:
storing triangles with two vertexes or three vertexes having the same LAC as dynamic arrays;
accordingly, after traversing all triangles connected directly or indirectly to the triangle, the method further comprises:
and deleting the traversed triangles with the same LAC from the dynamic array.
5. The method of claim 4, wherein traversing is performed when the dynamic array is empty.
6. An apparatus for identifying a base station location area cut, the apparatus comprising: the device comprises a processing module, a calculating module, an analyzing module and a recognition module; wherein,
the processing module is used for generating a triangular network for the area served by the base station;
the calculation module is used for calculating the position area code LAC of each triangle vertex in the triangular net;
the analysis module is used for selecting any one triangle in the triangular net and the LAC of one vertex of the selected triangle, and traversing all the triangles directly or indirectly connected with the selected triangle;
the identification module is used for identifying the flower arrangement base station according to the selected LAC and all triangular LACs directly or indirectly connected with the selected triangle.
7. The apparatus of claim 6, wherein the identifying module is specifically configured to identify a triangle vertex with a LAC different from the selected LAC as a flower arrangement base station when the LACs of any two or three vertices of the selected triangle are the same;
and identifying the triangle vertex of the selected LAC as a flower arrangement base station when the LAC of one vertex of the selected triangle is different from the LACs of the other two vertices of the selected triangle, the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is different from the LAC of all the triangle vertices directly or indirectly connected with the selected triangle, and the LAC of all the triangle vertices directly or indirectly connected with the selected triangle is the same as the LAC of the two outer two vertices of the selected triangle.
8. The apparatus for identifying base station location area ikebana of claim 6 or 7, wherein the calculating module is further configured to calculate the number of base stations in the selected triangle and the number of base stations in the other triangle when all the triangular LACs in the selected triangle are the same, the selected triangle is embedded in the other triangle formed by triangles of the same LAC, and the LAC of the selected triangle is different from the LAC of the other triangle;
correspondingly, the identification module is further configured to identify the base station in the triangular network as a flower arrangement base station cluster when a ratio of the number of the base stations in the triangular network to the number of the base stations in the other triangular network is greater than a preset threshold value.
9. The apparatus for identifying base station location area cuttings as set forth in claim 6 or 7, wherein the apparatus further comprises: the management module is used for storing the triangles with two vertexes or three vertexes having the same LAC as a dynamic array after the calculation module calculates the LAC of each vertex of the triangle in the triangular net; and after the analysis module traverses all triangles directly or indirectly connected with the triangles, deleting the traversed triangles with the same LAC from the dynamic array.
10. The apparatus of claim 9, wherein the analysis module completes the traversal when the dynamic array is empty.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510311608.0A CN106255126B (en) | 2015-06-09 | 2015-06-09 | A kind of method and device of identification base station location area flower arrangement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510311608.0A CN106255126B (en) | 2015-06-09 | 2015-06-09 | A kind of method and device of identification base station location area flower arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106255126A true CN106255126A (en) | 2016-12-21 |
| CN106255126B CN106255126B (en) | 2019-10-25 |
Family
ID=57626716
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510311608.0A Active CN106255126B (en) | 2015-06-09 | 2015-06-09 | A kind of method and device of identification base station location area flower arrangement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106255126B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109034234A (en) * | 2018-07-19 | 2018-12-18 | 中国测绘科学研究院 | A kind of identification of adjacent area feature and automatic processing method |
| CN113923664A (en) * | 2021-11-02 | 2022-01-11 | 中国联合网络通信集团有限公司 | Method and device for identifying flower arrangement base station, electronic equipment and storage medium |
| CN113923665A (en) * | 2021-11-11 | 2022-01-11 | 中国联合网络通信集团有限公司 | Method and device for identifying flower arrangement base station, electronic equipment and storage medium |
| CN114040405A (en) * | 2021-09-18 | 2022-02-11 | 浪潮通信信息系统有限公司 | Method and device for identifying code flower arrangement cell of position area |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101453747A (en) * | 2008-10-31 | 2009-06-10 | 中国移动通信集团北京有限公司 | Telephone traffic prediction method and apparatus |
| CN101820580A (en) * | 2010-02-08 | 2010-09-01 | 刘涛 | Method for identifying and positioning unknown mobile station in special position area |
| CN103796241A (en) * | 2014-01-28 | 2014-05-14 | 工业和信息化部电信研究院 | Method for judging and positioning pseudo base station based on reported information of terminal |
| CN104270760A (en) * | 2014-09-30 | 2015-01-07 | 北京金山安全软件有限公司 | Method and device for identifying pseudo base station |
-
2015
- 2015-06-09 CN CN201510311608.0A patent/CN106255126B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101453747A (en) * | 2008-10-31 | 2009-06-10 | 中国移动通信集团北京有限公司 | Telephone traffic prediction method and apparatus |
| CN101820580A (en) * | 2010-02-08 | 2010-09-01 | 刘涛 | Method for identifying and positioning unknown mobile station in special position area |
| CN103796241A (en) * | 2014-01-28 | 2014-05-14 | 工业和信息化部电信研究院 | Method for judging and positioning pseudo base station based on reported information of terminal |
| CN104270760A (en) * | 2014-09-30 | 2015-01-07 | 北京金山安全软件有限公司 | Method and device for identifying pseudo base station |
Non-Patent Citations (1)
| Title |
|---|
| 沈敏: "不同场景GSM插花基站优化控制策略的研究", 《"智慧城市和绿色IT"2011年通信与信息技术新进展——第八届中国通信学会学术年会》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109034234A (en) * | 2018-07-19 | 2018-12-18 | 中国测绘科学研究院 | A kind of identification of adjacent area feature and automatic processing method |
| CN114040405A (en) * | 2021-09-18 | 2022-02-11 | 浪潮通信信息系统有限公司 | Method and device for identifying code flower arrangement cell of position area |
| CN114040405B (en) * | 2021-09-18 | 2023-10-20 | 浪潮通信信息系统有限公司 | Method and device for identifying flower arrangement cell by using position area code |
| CN113923664A (en) * | 2021-11-02 | 2022-01-11 | 中国联合网络通信集团有限公司 | Method and device for identifying flower arrangement base station, electronic equipment and storage medium |
| CN113923664B (en) * | 2021-11-02 | 2023-06-06 | 中国联合网络通信集团有限公司 | Flower arrangement base station identification method and device, electronic equipment and storage medium |
| CN113923665A (en) * | 2021-11-11 | 2022-01-11 | 中国联合网络通信集团有限公司 | Method and device for identifying flower arrangement base station, electronic equipment and storage medium |
| CN113923665B (en) * | 2021-11-11 | 2023-06-06 | 中国联合网络通信集团有限公司 | Flower arrangement base station identification method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106255126B (en) | 2019-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106255126B (en) | A kind of method and device of identification base station location area flower arrangement | |
| CN105163337B (en) | A method of the mobile network data geography mapping based on coverage prediction emulation | |
| CN110677859A (en) | Method and device for determining weak coverage area and computer readable storage medium | |
| CN108399652A (en) | Method, apparatus, storage medium and the terminal device of City Buried Pipeline three-dimension monitor model foundation | |
| CN105430032A (en) | Method of pushing information by combining geographic position of terminal, and server | |
| CN107368648A (en) | Municipal water supply network oriented pressure monitoring point optimal arrangement method | |
| CN105813092B (en) | A kind of building network coverage optimization method and device based on ticket | |
| CN112087708A (en) | Layout method and layout device of electronic fence and storage medium | |
| CN108242962B (en) | Indoor signal propagation loss calculation method and device based on measurement report | |
| CN109460564B (en) | Power grid tidal current graph wiring method | |
| CN110489896A (en) | A kind of temporary engineering addressing and design method based on multisource data fusion technology | |
| CN112233056A (en) | Point cloud fusion method and device for multi-source data and storage medium | |
| CN110769369A (en) | Position determination method, determination device, server, and computer-readable storage medium | |
| CN113096246A (en) | Three-dimensional map data updating method | |
| CN107798182A (en) | A kind of quick calculating of base station radiation scope and update method | |
| CN115087023B (en) | Road network analysis method and device | |
| CN113133007A (en) | Method, device and equipment for selecting address of communication station | |
| US20160245896A1 (en) | Method and device for positioning terminal location | |
| CN115474206A (en) | Real-time people number determination method and device, electronic equipment and storage medium | |
| CN103473420A (en) | Automatic positioning method of statistical graph in zonal statistic map | |
| CN111082418B (en) | System and method for analyzing topological relation of power distribution network equipment | |
| CN112020091B (en) | Weak coverage processing method and device based on digitized geographic information | |
| CN114360255B (en) | Flow determination method and device, storage medium and electronic device | |
| CN115640372A (en) | Method, device, system, equipment and medium for guiding area of indoor plane | |
| CN114372818A (en) | Method and device for selecting sites of stores and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |