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 PDF

Info

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
Application number
CN201510311608.0A
Other languages
Chinese (zh)
Other versions
CN106255126B (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 Group Hubei Co Ltd
Original Assignee
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 Group Hubei Co Ltd filed Critical China Mobile Group Hubei Co Ltd
Priority to CN201510311608.0A priority Critical patent/CN106255126B/en
Publication of CN106255126A publication Critical patent/CN106255126A/en
Application granted granted Critical
Publication of CN106255126B publication Critical patent/CN106255126B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18Network planning tools
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24Cell structures
    • H04W16/30Special 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

本发明公开了识别基站位置区插花的方法,包括:将基站服务的区域生成三角形网,计算所述三角形网中的每个三角形顶点的位置区编码(LAC);选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站。本发明还公开了一种识别基站位置区插花的装置。

The invention discloses a method for identifying flower arrangement in a location area of a base station, comprising: generating a triangular network for the area served by the base station, calculating the location area code (LAC) of each triangle vertex in the triangular network; selecting any The LAC of a triangle and a vertex of the selected triangle traverses all triangles directly or indirectly connected to the selected triangle, and identifies the flower arrangement base station according to the LAC of all triangles directly or indirectly connected to the selected LAC. The invention also discloses a device for identifying the flower arrangement in the location area of the base station.

Description

一种识别基站位置区插花的方法及装置A method and device for identifying flower arrangement in a base station location area

技术领域 technical field

本发明涉及通信技术领域,尤其涉及一种识别基站位置区插花的方法及装置。 The invention relates to the field of communication technology, in particular to a method and device for identifying flower arrangements in a base station location area.

背景技术 Background technique

移动通信网络一般由多个小区构成,为了对用户的地理位置进行定位,实现呼叫接续和短信的投递,移动通信网需要掌握用户的位置信息,即用户的位置区;目前,为了方便对位置区进行管理,将地理位置相邻近的一组小区划分为一个位置区,同一个位置区具有相同的位置区编码(location area code,LAC);这样,多个位置区构成了一个完整的移动网络。在进行网络规划时,需要先将一个地理区域,如一个城市,划分为多个位置区,再将各个小区撒入至不同的位置区,形成一张无缝的移动通信网络;之后,以划分位置区后的移动通信网络进行现场查勘;但是,由于物业等方面的原因,通常会对站点的位置进行变更,导致不同位置区之间的边界产生变形,使得一个基站与周围基站的位置区属性不同,与周围基站的位置区属性不同的基站被称之为插花站点。由于插花站点会对移动通信网络的性能产生损害,所以,需要及时识别插花站点,并调整规划方案。 The mobile communication network is generally composed of multiple cells. In order to locate the geographical location of the user and realize the delivery of call connection and short message, the mobile communication network needs to grasp the user's location information, that is, the user's location area; at present, in order to facilitate the location area For management, a group of geographically adjacent cells are divided into a location area, and the same location area has the same location area code (location area code, LAC); in this way, multiple location areas constitute a complete mobile network . When planning a network, it is necessary to first divide a geographical area, such as a city, into multiple location areas, and then distribute each cell into different location areas to form a seamless mobile communication network; Site survey of the mobile communication network behind the location area; however, due to property and other reasons, the location of the site is usually changed, resulting in deformation of the boundary between different location areas, making the location area attributes of a base station and surrounding base stations Different, a base station with location area attributes different from those of surrounding base stations is called a flower arrangement site. Since the flower arrangement site will damage the performance of the mobile communication network, it is necessary to identify the flower arrangement site in time and adjust the planning scheme.

目前,在移动通信网络一期规划的过程中,位置区的划分和小区的撒入需要经过多次迭代设计,检查多个位置区之间的边界关系;并且,这种检查需要人工在地图上核查,消耗大量的人力。 At present, in the process of the first-phase planning of the mobile communication network, the division of location areas and the addition of cells need to go through multiple iterative designs to check the boundary relationship between multiple location areas; Verification consumes a lot of manpower.

发明内容 Contents of the invention

有鉴于此,本发明实施例期望提供一种识别基站位置区插花的方法及装置,能够高效、便捷地自动识别基站位置区插花,确定LAC区域规划信息,节省时 间和人力。 In view of this, the embodiments of the present invention expect to provide a method and device for identifying flower arrangements in the base station location area, which can automatically identify flower arrangements in the base station location area efficiently and conveniently, determine LAC area planning information, and save time and manpower.

本发明实施例的技术方案是这样实现的: The technical scheme of the embodiment of the present invention is realized like this:

本发明实施例提供的识别基站位置区插花的方法,包括:将基站服务的区域生成三角形网,计算所述三角形网中的每个三角形顶点的位置区编码LAC;选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站。 The method for identifying the flower arrangement in the base station location area provided by the embodiment of the present invention includes: generating a triangular network for the area served by the base station, calculating the location area code LAC of each triangle vertex in the triangular network; selecting any The LAC of a triangle and a vertex of the selected triangle traverses all triangles directly or indirectly connected to the selected triangle, and identifies the flower arrangement base station according to the LAC of all triangles directly or indirectly connected to the selected LAC.

上述方案中,所述根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站,包括:所选择三角形的任意两个顶点或三个顶点的LAC均相同时,识别与所选择的LAC具有不同LAC的三角形顶点为插花基站;所选择的三角形的一个顶点的LAC与所选择的三角形的另外两个顶点的LAC不同、所选择的LAC与所选择的三角形直接或间接连接的所有三角形顶点的LAC均不相同、且与所选择的三角形直接或间接连接的所有三角形顶点的LAC与所选择的三角形的两外两个顶点的LAC相同时,识别所选择的LAC的三角形顶点为插花基站。 In the above solution, the identification of the flower arrangement base station according to the LAC of all triangles directly or indirectly connected to the selected LAC and the selected triangle includes: when the LACs of any two or three vertices of the selected triangle are the same, identify The triangle vertex having a different LAC from the selected LAC is the flower arrangement base station; the LAC of one vertex of the selected triangle is different from the LAC of the other two vertices of the selected triangle, the selected LAC is directly or indirectly related to the selected triangle When the LACs of all the connected triangle vertices are different, and the LACs of all the triangle vertices directly or indirectly connected with the selected triangle are the same as the LACs of the two outer vertices of the selected triangle, identify the triangle of the selected LAC The apex is the base of the flower arrangement.

上述方案中,在所选择的三角形网中的所有三角形LAC均相同、所选择的三角形网嵌入在另一个由相同LAC三角形构成的另一个三角形网内、且所选择的三角形网的LAC与另一个三角形网的LAC不同时,所述方法还包括:计算所选择的三角形网中基站的数量及另一个三角形网中基站的数量,在所述三角形网中基站的数量与所述另一个三角形网中基站的数量的比值大于预设的阈值时,识别所述三角形网内的基站为插花基站簇。 In the above scheme, the LACs of all the triangles 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 the same as that of another triangulation. When the LACs of the triangular network are different, the method also includes: calculating the number of base stations in the selected triangular network and the number of base stations in another triangular network, and the number of base stations in the triangular network is the same as that in the another triangular network When the ratio of the number of base stations is greater than a preset threshold, the base stations in the triangular network are identified as flower arrangement base station clusters.

上述方案中,所述计算所述三角形网中的每个三角形顶点的LAC之后,所述方法还包括:将两个顶点或三个顶点具有相同LAC的三角形存储为动态数组; In the above solution, after the calculation of the LAC of each triangle vertex in the triangular network, the method further includes: storing triangles with two or three vertices having the same LAC as a dynamic array;

相应的,所述遍历与所述三角形直接或间接连接的所有三角形之后,所述方法还包括:将遍历后的具有相同LAC的三角形从动态数组中删除。 Correspondingly, after traversing all the triangles directly or indirectly connected to the triangle, the method further includes: deleting the traversed triangles with the same LAC from the dynamic array.

上述方案中,在所述动态数组为空时,完成遍历。 In the above solution, when the dynamic array is empty, the traversal is completed.

本发明实施例还提供一种识别基站位置区插花的装置,所述装置包括:处理模块、计算模块、分析模块和识别模块;其中, An embodiment of the present invention also provides a device for identifying flower arrangements in a base station location area, the device comprising: a processing module, a calculation module, an analysis module, and an identification module; wherein,

所述处理模块,用于将基站服务的区域生成三角形网; The processing module is used to generate a triangular network for the area served by the base station;

所述计算模块,用于计算所述三角形网中的每个三角形顶点的位置区编码LAC; The calculation module is used to calculate the location area code LAC of each triangle vertex in the triangle network;

所述分析模块,用于选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形; The analysis module is used to select any triangle in the triangular network and the LAC of a vertex of the selected triangle, and traverse all triangles directly or indirectly connected to the selected triangle;

所述识别模块,用于根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站。 The identifying module is configured to identify the flower arrangement base station according to the LACs of all triangles directly or indirectly connected to the selected LAC and the selected triangle.

上述方案中,所述识别模块,具体用于所选择三角形的任意两个顶点或三个顶点的LAC均相同时,识别与所选择的LAC具有不同LAC的三角形顶点为插花基站;所选择的三角形的一个顶点的LAC与所选择的三角形的另外两个顶点的LAC不同、所选择的LAC与所选择的三角形直接或间接连接的所有三角形顶点的LAC均不相同、且与所选择的三角形直接或间接连接的所有三角形顶点的LAC与所选择的三角形的两外两个顶点的LAC相同时,识别所选择的LAC的三角形顶点为插花基站。 In the above scheme, the identification module is specifically used when the LACs of any two vertices or three vertices of the selected triangle are the same, identifying the triangular vertices having different LACs from the selected LAC as the flower arrangement base station; the selected triangular The LAC of one vertex of the selected triangle is different from the LAC of the other two vertices of the selected triangle, the selected LAC is different from the LAC of all triangle vertices directly or indirectly connected to the selected triangle, and is directly or indirectly connected When the LACs of all indirectly connected triangle vertices are the same as the LACs of the two outer vertices of the selected triangle, the selected triangle vertices of the LAC are identified as the flower arrangement base station.

上述方案中,所述计算模块,还用于在所选择的三角形网中的所有三角形LAC均相同、所选择的三角形网嵌入在另一个由相同LAC三角形构成的另一个三角形网内、且所选择的三角形网的LAC与另一个三角形网的LAC不同时,计算所选择的三角形网中基站的数量及另一个三角形网中基站的数量; In the above scheme, the calculation module is also used for all triangle LACs in the selected triangular network are the same, the selected triangular network is embedded in another triangular network formed by the same LAC triangle, and the selected When the LAC of the triangular network is different from the LAC of another triangular network, calculate the number of base stations in the selected triangular network and the number of base stations in another triangular network;

相应的,所述识别模块,还用于在所述三角形网中基站的数量与所述另一个三角形网中基站的数量的比值大于预设的阈值时,识别所述三角形网内的基站为插花基站簇。 Correspondingly, the identification module is further configured to identify the base station in the triangular network as a flower arrangement when the ratio of the number of base stations in the triangular network to the number of base stations in the other triangular network is greater than a preset threshold cluster of base stations.

上述方案中,所述装置还包括:管理模块,用于在计算模块计算所述三角形网中的每个三角形顶点的LAC之后,将两个顶点或三个顶点具有相同LAC的三角形存储为动态数组;以及在分析模块遍历与所述三角形直接或间接连接 的所有三角形之后,将遍历后的具有相同LAC的三角形从动态数组中删除。 In the above solution, the device further includes: a management module, configured to store triangles with two or three vertices having the same LAC as a dynamic array after the calculation module calculates the LAC of each triangle vertex in the triangular network ; and after the analysis module traverses all the triangles directly or indirectly connected to the triangle, delete the traversed triangles with the same LAC from the dynamic array.

上述方案中,在所述动态数组为空时,分析模块完成遍历。 In the above solution, when the dynamic array is empty, the analysis module completes the traversal.

本发明实施例所提供的识别基站位置区插花的方法及装置,将基站服务的区域生成三角形网,计算所述三角形网中的每个三角形顶点的LAC;选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站。其中,所述三角形网为通过三角剖分工具生成的Delaunay三角形网;如此,通过对三角形网中的三角形寻找共边共顶点的三角形,在所述三角形中一个顶点的LAC与该顶点所属三角形直接或间接连接的其他三角形的LAC均不同时,识别该顶点所代表的基站为插花基站;并且,在一个三角形网中的所有三角形LAC均相同,且该三角形网嵌入在另一个由相同LAC的三角形构成的另一个三角形网内、两个三角形网的LAC不同,且一个三角形网中基站的数量与另一个三角形网中基站的数量的比值大于预设的阈值时,识别一个三角形网内的基站为插花基站簇;实现了高效、便捷地自动识别基站位置区插花及确定LAC区域规划信息,节省了时间和人力。 The method and device for identifying flower arrangements in the base station location area provided by the embodiments of the present invention generate a triangular network for the area served by the base station, and calculate the LAC of each triangle vertex in the triangular network; select any triangle in the triangular network And the LAC of a vertex of the selected triangle, traverse all the triangles directly or indirectly connected with the selected triangle, and identify the flower arrangement base station according to the LAC of all the triangles directly or indirectly connected with the selected LAC. Wherein, the triangular network is a Delaunay triangular network generated by a triangulation tool; thus, by searching for a triangle with a common edge and a vertex for the triangles in the triangular network, the LAC of a vertex in the triangle is directly related to the triangle to which the vertex belongs. Or when the LACs of other triangles indirectly connected are different, identify the base station represented by the vertex as the flower arrangement base station; and, all the triangle LACs in a triangular network are the same, and the triangular network is embedded in another triangle with the same LAC In another triangular network formed, the LACs of the two triangular networks are different, and the ratio of the number of base stations in one triangular network to the number of base stations in another triangular network is greater than the preset threshold, identify the base station in a triangular network as Flower arrangement base station cluster; realize efficient and convenient automatic identification of base station location area flower arrangement and determination of LAC area planning information, saving time and manpower.

附图说明 Description of drawings

图1为本发明实施例识别基站位置区插花的基本处理流程示意图; FIG. 1 is a schematic diagram of a basic processing flow for identifying flower arrangements in a base station location area according to an embodiment of the present invention;

图2为本发明实施例遍历与所选择的三角形连接的三角形的第一示意图; Fig. 2 is the first schematic diagram of traversing the triangle connected with the selected triangle according to the embodiment of the present invention;

图3为本发明实施例遍历与所选择的三角形连接的三角形的第二示意图; FIG. 3 is a second schematic diagram of traversing the triangles connected to the selected triangle according to the embodiment of the present invention;

图4为本发明实施例遍历与所选择的三角形连接的三角形的第三示意图; 4 is a third schematic diagram of traversing the triangles connected to the selected triangle according to the embodiment of the present invention;

图5为本发明实施例插花基站簇的示意图; 5 is a schematic diagram of a flower arrangement base station cluster according to an embodiment of the present invention;

图6为本发明实施例识别基站位置区插花的详细处理流程示意图; FIG. 6 is a schematic diagram of a detailed processing flow for identifying flower arrangements in a base station location area according to an embodiment of the present invention;

图7为本发明实施例遍历与所选择的三角形连接的三角形示意图; Fig. 7 is a schematic diagram of traversing triangles connected with selected triangles according to an embodiment of the present invention;

图8为本发明实施例识别基站位置区插花的装置的组成结构示意图。 Fig. 8 is a schematic diagram of the composition and structure of the device for identifying flower arrangements in the base station location area according to an embodiment of the present invention.

具体实施方式 detailed description

本发明实施例中,将基站服务的区域生成三角形网,计算所述三角形网中的每个三角形顶点的LAC;选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站。 In the embodiment of the present invention, the area served by the base station is generated into a triangular network, and the LAC of each triangle vertex in the triangular network is calculated; any triangle in the triangular network and the LAC of an apex of the selected triangle are selected, All triangles directly or indirectly connected to the selected triangle are traversed, and flower arrangement base stations are identified according to the LACs of all triangles directly or indirectly connected to the selected LAC.

本发明实施例中,识别基站位置区插花的方法的基本处理流程,如图1所示,包括以下步骤: In the embodiment of the present invention, the basic processing flow of the method for identifying the flower arrangement in the location area of the base station, as shown in Figure 1, includes the following steps:

步骤101,将基站服务的区域生成三角形网; Step 101, generate a triangular network for the area served by the base station;

这里,可通过三角剖分工具将基站服务的区域生成Delaunay三角形网; Here, the area served by the base station can be generated by a triangulation tool to generate a Delaunay triangular network;

具体如何通过三角剖分工具生成三角形网属于现有技术,这里不再赘述。 Specifically, how to generate a triangular network through a triangulation tool belongs to the prior art, and will not be repeated here.

步骤102,计算所述三角形网中的每个三角形顶点的LAC; Step 102, calculating the LAC of each triangle vertex in the triangle network;

这里,在计算所述三角形网中的每个三角形顶点的LAC后,将两个顶点具有相同LAC的三角形或三个顶点具有相同LAC的三角形存储为动态数组; Here, after calculating the LAC of each triangle vertex in the triangular network, two triangles with the same LAC or three triangles with the same LAC are stored as a dynamic array;

本实施例中,具体如何计算三角形网中每个三角形顶点的LAC属于现有技术,这里不再赘述。 In this embodiment, how to specifically calculate the LAC of each triangle vertex in the triangular network belongs to the prior art, and will not be repeated here.

步骤103,选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站; Step 103, select any triangle in the triangular network and the LAC of a vertex of the selected triangle, traverse all triangles directly or indirectly connected with the selected triangle, and directly or indirectly connect the selected triangle according to the selected LAC and the selected triangle. The LACs of all triangles connected indirectly identify flower arrangement base stations;

具体地,遍历与所选择的三角形连接的三角形的第一示意图,如图2所示: Specifically, traverse the first schematic diagram of the triangles connected with the selected triangle, as shown in Figure 2:

本发明实施例中,选择三角形1,且所述三角形1的三个顶点的LAC相同;与三角形1直接连接的三角形即为与三角形1共边的三角形,包括三角形2、3、4,且三角形2、3、4的各顶点的LAC与三角形1的三个顶点的LAC相同,因此,三角形2、3、4非插花基站,将三角形2、3、4的信息在上述步骤102中存储的动态数组中删除。 In the embodiment of the present invention, triangle 1 is selected, and the LACs of the three vertices of triangle 1 are the same; the triangle directly connected to triangle 1 is a triangle with the same side as triangle 1, including triangles 2, 3, and 4, and the triangle The LAC of each apex of 2,3,4 is the same as the LAC of the three apexes of triangle 1, therefore, triangle 2,3,4 is not a flower arrangement base station, and the information of triangle 2,3,4 is dynamically stored in the above step 102 delete from the array.

遍历与所选择的三角形连接的三角形的第二示意图,如图3所示: A second diagram of traversing the triangles connected to the selected triangle is shown in Figure 3:

本发明实施例中,与所选择的三角形1间接连接的三角形包括:三角形5-12,三角形5中实心圆点代表的顶点的LAC与所述三角形网中的其他LAC均不相同,识别三角形5中实心圆点代表的基站为插花基站;三角形6-12的各顶点的LAC与三角形1的三个顶点的LAC相同,识别三角形6-12非插花基站,将三角形5-12的信息在上述步骤102中存储的动态数组中删除。 In the embodiment of the present invention, the triangles indirectly connected to the selected triangle 1 include: triangles 5-12, the LAC of the vertex represented by the solid circle in triangle 5 is different from other LACs in the triangle network, and triangle 5 is identified The base station represented by the solid circle in the center is the flower arrangement base station; the LAC of each apex of the triangle 6-12 is the same as the LAC of the three vertices of the triangle 1, and the non-flower arrangement base station of the triangle 6-12 is identified, and the information of the triangle 5-12 is used in the above steps Delete from the dynamic array stored in 102.

遍历与所选择的三角形连接的三角形的第三示意图,如图4所示: A third diagram of traversing the triangles connected to the selected triangle is shown in Figure 4:

本发明实施例中,与所选择的三角形1间接连接的三角形包括:三角形13-20,三角形13-20的各顶点的LAC与三角形1的三个顶点的LAC相同;因此,三角形13-20非插花基站,将三角形13-20的信息在上述步骤102中存储的动态数组中删除;此时,若动态数组为空,完成遍历,在该三角形网中识别出一个插花基站;若动态数组不为空,则选择一个新的三角形的一个与三角形1不同的LAC作为遍历起点,重复执行步骤103,直至动态数组为空。 In the embodiment of the present invention, the triangles indirectly connected to the selected triangle 1 include: triangle 13-20, the LAC of each vertex of triangle 13-20 is the same as the LAC of the three vertices of triangle 1; therefore, triangle 13-20 is not The flower arrangement base station deletes the information of the triangle 13-20 in the dynamic array stored in the above-mentioned step 102; at this time, if the dynamic array is empty, the traversal is completed, and a flower arrangement base station is identified in the triangular network; if the dynamic array is not If it is empty, select a LAC of a new triangle that is different from triangle 1 as the starting point of traversal, and repeat step 103 until the dynamic array is empty.

本步骤中,若一个三角形网中的三角形的LAC均相同,所述三角形网嵌入在另一个由相同LAC三角形构成的另一个三角形网内,且两个三角形网的LAC不同时,需要计算两个三角形网中基站的数量,在两个三角形网中基站的数量的比值大于预设的阈值时,识别一个三角形网内的基站为插花基站簇;其中,预设的阈值可以根据实际的布网灵活设置,如:20%等; In this step, if the LACs of the triangles in a triangular network are the same, the triangular network is embedded in another triangular network composed of triangles with the same LAC, and when the LACs of the two triangular networks are different, two The number of base stations in the triangular network, when the ratio of the number of base stations in two triangular networks is greater than the preset threshold, identify the base station in a triangular network as a flower arrangement base station cluster; where the preset threshold can be flexible according to the actual network layout Settings, such as: 20% etc.;

具体地,插花基站簇的示意图,如图5所示,第一区域用正斜线表示,包括5个基站,5个基站的LAC均为X;第一区域嵌入在第二区域内,第二区域用反斜线表示,包括50个基站,50个基站的LAC均为Y;第一区域内基站的数量与第二区域内基站的数量比为1/10,小于预设的阈值20%,则识别第一区域内的5个基站为插花基站簇。 Specifically, the schematic diagram of the flower arrangement base station cluster is shown in Figure 5. The first area is represented by a forward slash, including 5 base stations, and the LACs of the 5 base stations are all X; the first area is embedded in the second area, and the second area is embedded in the second area. The area is indicated by a backslash, including 50 base stations, and the LACs of the 50 base stations are all Y; the ratio of the number of base stations in the first area to the number of base stations in the second area is 1/10, which is less than the preset threshold of 20%. Then identify the five base stations in the first area as the flower arrangement base station cluster.

本发明实施例中,识别基站位置区插花的方法的详细处理流程,如图6所示,包括以下步骤: In the embodiment of the present invention, the detailed processing flow of the method for identifying the flower arrangement in the location area of the base station, as shown in Figure 6, includes the following steps:

步骤201,将基站服务的区域生成三角形网; Step 201, generating a triangular network for the area served by the base station;

这里,可通过三角剖分工具将基站服务的区域生成Delaunay三角形网; Here, the area served by the base station can be generated by a triangulation tool to generate a Delaunay triangular network;

具体如何通过三角剖分工具生成三角形网属于现有技术,这里不再赘述。 Specifically, how to generate a triangular network through a triangulation tool belongs to the prior art, and will not be repeated here.

步骤202,计算所述三角形网中的每个三角形顶点的LAC; Step 202, calculating the LAC of each triangle vertex in the triangle network;

这里,在计算所述三角形网中的每个三角形顶点的LAC后,将两个顶点具有相同LAC的三角形或三个顶点具有相同LAC的三角形存储为动态数组; Here, after calculating the LAC of each triangle vertex in the triangular network, two triangles with the same LAC or three triangles with the same LAC are stored as a dynamic array;

本实施例中,具体如何计算三角形网中每个三角形顶点的LAC属于现有技术,这里不再赘述。 In this embodiment, how to specifically calculate the LAC of each triangle vertex in the triangular network belongs to the prior art, and will not be repeated here.

步骤203,选择所述三角形网中的一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角形,根据三角形的LAC识别插花基站; Step 203, selecting a triangle in the triangular network and the LAC of a vertex of the selected triangle, traversing all triangles directly or indirectly connected to the selected triangle, and identifying the flower arrangement base station according to the LAC of the triangle;

具体地,如图7所示,选择三角形A及三角形A的一个顶点,即图7中实心圆点标识的顶点,选择的三角形A的顶点与三角形A的另外两个顶点LAC不同;与三角形A直接连接的三角形即为与三角形A共边的三角形,包括三角形B、C、D,且三角形B的顶点、三角形C、D中除与选择的三角形A相同的顶点外的其他顶点的LAC与三角形A的另外两个顶点LAC相同,如图7中空心圆点标识的三角形顶点;将三角形A-D在步骤202中存储的动态数据中删除;在遍历与三角形B、C、D共边的三角形,包括三角形E-L,三角形E、F、G除与三角形A相同的顶点外,其他顶点的LAC均与三角形的另外两个顶点LAC相同,将三角形E-L在步骤202中存储的动态数据中删除;识别三角形A中选择的顶点所属基站为插花基站。 Specifically, as shown in Figure 7, select triangle A and a vertex of triangle A, that is, the vertex identified by the solid circle in Figure 7, the vertex of selected triangle A is different from the other two vertices LAC of triangle A; The directly connected triangles are the triangles sharing the same side as triangle A, including triangles B, C, and D, and the LAC and triangle The other two vertices LAC of A are identical, as the triangular vertices of hollow circle mark among Fig. 7; Triangle A-D is deleted in the dynamic data stored in step 202; Traverse and triangular B, C, the triangular coedge of D, comprise Triangle E-L, triangle E, F, G except the vertex identical with triangle A, the LAC of other vertices is all identical with the other two vertices LAC of triangle, triangle E-L is deleted in the dynamic data stored in step 202; Identify triangle A The base station to which the vertex selected in is the flower arrangement base station.

为实现上述机房巡检方法,本发明实施例还提供一种识别基站位置区插花的装置,所述装置的组成结构,如图8所示,包括:处理模块1、计算模块2、分析模块3和识别模块4;其中, In order to realize the above computer room inspection method, an embodiment of the present invention also provides a device for identifying flower arrangements in the location area of a base station. The composition of the device, as shown in FIG. 8 , includes: a processing module 1, a calculation module 2, and an analysis module 3 and identification module 4; where,

所述处理模块1,用于将基站服务的区域生成三角形网; The processing module 1 is configured to generate a triangular network for the area served by the base station;

所述计算模块2,用于计算所述三角形网中的每个三角形顶点的位置区编码LAC; The calculation module 2 is used to calculate the location area code LAC of each triangle vertex in the triangle network;

所述分析模块3,用于选择所述三角形网中的任意一个三角形及所选择的三角形的一个顶点的LAC,遍历与所选择的三角形直接或间接连接的所有三角 形; The analysis module 3 is used to select any triangle in the triangular network and the LAC of a vertex of the selected triangle, and traverse all triangles directly or indirectly connected to the selected triangle;

所述识别模块4,用于根据所选择的LAC与所选择的三角形直接或间接连接的所有三角形的LAC识别插花基站; The identification module 4 is used to identify the flower arrangement base station according to the LACs of all triangles directly or indirectly connected between the selected LAC and the selected triangle;

这里,可通过三角剖分工具将基站服务的区域生成Delaunay三角形网。 Here, the area served by the base station can be generated by a triangulation tool to generate a Delaunay triangular network.

在一实施例中,所述识别模块4,具体用于所选择三角形的任意两个顶点或三个顶点的LAC均相同时,识别与所选择的LAC具有不同LAC的三角形顶点为插花基站; In one embodiment, the identification module 4 is specifically used to identify a triangle vertex having a different LAC 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;

所选择的三角形的一个顶点的LAC与所选择的三角形的另外两个顶点的LAC不同、所选择的LAC与所选择的三角形直接或间接连接的所有三角形顶点的LAC均不相同、且与所选择的三角形直接或间接连接的所有三角形顶点的LAC与所选择的三角形的另外两个顶点的LAC相同时,识别所选择的LAC的三角形顶点为插花基站。 The LAC of one vertex of the selected triangle is different from the LAC of the other two vertices of the selected triangle, the selected LAC is different from the LAC of all triangle vertices directly or indirectly connected to the selected triangle, and is different from the selected When the LACs of all the vertices of the triangles directly or indirectly connected by the triangle are the same as the LACs of the other two vertices of the selected triangle, the selected triangle vertices of the LAC are identified as the flower arrangement base station.

在一实施例中,,所述计算模块2,还用于在所选择的三角形网中的所有三角形LAC均相同、所选择的三角形网嵌入在另一个由相同LAC三角形构成的另一个三角形网内、且所选择的三角形网的LAC与另一个三角形网的LAC不同时,计算所选择的三角形网中基站的数量及另一个三角形网中基站的数量; In one embodiment, the calculation module 2 is further configured to have the same triangular LAC in the selected triangular network, and the selected triangular network is embedded in another triangular network composed of triangles with the same LAC , and when the LAC of the selected triangular network is different from the LAC of another triangular network, calculate the number of base stations in the selected triangular network and the number of base stations in another triangular network;

相应的,所述识别模块4,还用于在所述三角形网中基站的数量与所述另一个三角形网中基站的数量的比值大于预设的阈值时,识别所述三角形网内的基站为插花基站簇; Correspondingly, the identification module 4 is further configured to identify the base station in the triangular network as flower arrangement base cluster;

其中,预设的阈值可以根据实际的布网灵活设置,如:20%等。 Among them, the preset threshold can be flexibly set according to the actual network deployment, such as: 20% and so on.

在一实施例中,所述装置还包括:管理模块5,用于在计算模块计算所述三角形网中的每个三角形顶点的LAC之后,将两个顶点或三个顶点具有相同LAC的三角形存储为动态数组;以及在分析模块遍历与所述三角形直接或间接连接的所有三角形之后,将遍历后的具有相同LAC的三角形从动态数组中删除。 In one embodiment, the device further includes: a management module 5, configured to store triangles with two vertices or three vertices having the same LAC after the calculation module calculates the LAC of each triangle vertex in the triangular network is a dynamic array; and after the analysis module traverses all triangles directly or indirectly connected to the triangle, deletes the traversed triangles with the same LAC from the dynamic array.

在一实施例中,在所述动态数组为空时,分析模块3完成遍历。 In an embodiment, when the dynamic array is empty, the analysis module 3 completes the traversal.

需要说明的是,在实际应用中,所述处理模块1、计算模块2、分析模块3、 识别模块4和管理模块5的功能可由中央处理器(CPU)、或微处理器(MPU)、或数字信号处理器(DSP)、或可编程门阵列(FPGA)实现。 It should be noted that, in practical applications, the functions of the processing module 1, calculation module 2, analysis module 3, identification module 4 and management module 5 can be controlled by a central processing unit (CPU), or a microprocessor (MPU), or Digital Signal Processor (DSP), or Programmable Gate Array (FPGA) implementation.

以上所述仅为本发明的较佳实施例而已,并非用于限定本发明的保护范围。 The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection 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.
CN201510311608.0A 2015-06-09 2015-06-09 A method and device for identifying flower arrangement in a base station location area Active CN106255126B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510311608.0A CN106255126B (en) 2015-06-09 2015-06-09 A method and device for identifying flower arrangement in a base station location area

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510311608.0A CN106255126B (en) 2015-06-09 2015-06-09 A method and device for identifying flower arrangement in a base station location area

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 method and device for identifying flower arrangement in a base station location area

Country Status (1)

Country Link
CN (1) CN106255126B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
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 中国联合网络通信集团有限公司 A kind of flower arrangement base station identification method, device, 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)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
沈敏: "不同场景GSM插花基站优化控制策略的研究", 《"智慧城市和绿色IT"2011年通信与信息技术新进展——第八届中国通信学会学术年会》 *

Cited By (7)

* Cited by examiner, † Cited by third party
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 中国联合网络通信集团有限公司 A flower arrangement base station identification method, device, electronic equipment and storage medium
CN113923665A (en) * 2021-11-11 2022-01-11 中国联合网络通信集团有限公司 A kind of flower arrangement base station identification method, device, electronic equipment and storage medium
CN113923665B (en) * 2021-11-11 2023-06-06 中国联合网络通信集团有限公司 A flower arrangement base station identification method, device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN106255126B (en) 2019-10-25

Similar Documents

Publication Publication Date Title
CN107547633B (en) User constant standing point processing method and device and storage medium
CN106255126B (en) A method and device for identifying flower arrangement in a base station location area
CN105338540B (en) A kind of method and terminal of base station data modeling
CN106204446B (en) Building merging method for topographic map
CN113133007B (en) Method, device and equipment for selecting address of communication station
CN101510228B (en) Nonuniform simplifying method for STL model of products
CN104715127B (en) One kind complains hot spot region recognition methods and system
CN111859187B (en) POI query method, device, equipment and medium based on distributed graph database
CN113112603A (en) Method and device for optimizing three-dimensional model
CN105654552A (en) Fast Delaunay triangulation method for arbitrarily-distributed large-scale point cloud data
CN103377303A (en) Curve surface measurement system and method
CN110769369B (en) Position determination method, determination device, server, and computer-readable storage medium
CN107431639A (en) Shared risk group is neighbouring and method
CN109460564B (en) Power grid tidal current graph wiring method
CN113538465A (en) Automatic dividing method and device for regular and irregular polygon areas and storage medium
CN116450958A (en) Detection point address selection method and device, electronic equipment and readable storage medium
CN106339530B (en) A kind of weldment dimension information extracting method and system based on the enveloping space
Goldin et al. Georouting and delta-gathering: Efficient data propagation techniques for geosensor networks
CN107169080A (en) A kind of geospatial analysis system being combined based on GIS and spatial database
CN102968926B (en) Symbol configuration system of zonal statistical map and method thereof
CN105550256A (en) Power grid planning oriented automatic diluting method of geographical wiring diagram
CN109905883B (en) Method and terminal for connecting wireless sensor network
CN110769430A (en) Wireless sensor network relay node deployment method based on minimum circle-bounding algorithm
CN114360255B (en) Flow determination method and device, storage medium and electronic device
CN105933931A (en) Wireless base station survey terminal

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