A base station auditing method, device, and electronic device

Abstract

The present application discloses a base station auditing method, device and electronic device, which are used to audit the planning information such as frequency, station type and location of a site before a new base station is built. First, a Delaunay triangulation is generated according to the standard base station locations in the standard base station database, and then the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map are obtained by using the Delaunay triangulation. Next, the overlapping area between the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map is determined, so as to output the base station type of the planned base station with rationality according to the positional relationship between the overlapping area and the planned base station, thereby realizing the auditing of planned base stations with low labor cost and high efficiency.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and in particular, to a base station auditing method, apparatus, and electronic device. Background Art

[0002] Before building a new base station, it is necessary to plan information such as the frequency, station type, and location of the site. Since there are often unreasonable plans in the planned base station site information, it is necessary to review the planned base station site information to screen out reasonable base station sites. At present, the simple tool method and the expert review method are mainly used.

[0003] The simple tool method calculates the distance between planned sites using the minimum distance tool, then analyzes them one by one, and then screens according to the analysis results. Since the processes of analysis and screening are mainly completed manually, the screening workload is large, the labor cost is high, and there are errors in the screening results.

[0004] The expert review method mainly determines the rationality of each planned site through on-site or video review by experts in the local wireless field. Due to different scenarios in multiple localities and different capabilities of experts, the screening results may have errors, and the number of base stations is huge, so the screening takes a long time.

[0005] Both of the above two auditing methods not only have high labor costs but also have room for efficiency improvement. Summary of the Invention

[0006] This application discloses a base station auditing method, apparatus, and electronic device, which are used to output the base station type of a planned base station with rationality, so as to achieve low-labor-cost and high-efficiency planned base station auditing.

[0007] In a first aspect, this application provides a base station auditing method, and the method includes:

[0008] Generate a Delaunay triangulation based on N standard base station positions, where N is an integer greater than 3;

[0009] Generate a Delaunay circumscribed polygon buffer and a Thiessen circumscribed polygon map based on the Delaunay triangulation, and obtain the overlapping area of the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map;

[0010] Obtain the position of the base station to be planned, and determine whether the position is within the overlapping area;

[0011] If so, output the first base station type as the base station type of the base station to be planned;

[0012] If not, output the second base station type as the base station type of the base station to be planned.

[0013] Through the above method, a Delaunay triangulation is generated based on the standard base station locations in the standard base station database, and then the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map are obtained using the Delaunay triangulation. Next, the overlapping area between the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map is determined, and then whether the planned base station is reasonable is determined according to the positional relationship between the overlapping area and the planned base station, and the base station type of the reasonable planned base station is output, so as to achieve low labor cost and high-efficiency planning of base station auditing.

[0014] In a possible design, to generate the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map according to the Delaunay triangulation, the method includes:

[0015] Generate Delaunay circumscribed polygons according to the Delaunay triangulation, where the Delaunay circumscribed polygons include at least one standard base station location;

[0016] Form the Delaunay circumscribed polygon buffer according to the Delaunay circumscribed polygons, so that the minimum distance between any point on the edge of the Delaunay circumscribed polygon buffer and the edge of the Delaunay circumscribed polygon is a preset value;

[0017] Generate the Thiessen circumscribed polygon map according to the standard base station locations included in the Delaunay circumscribed polygons.

[0018] Through the above method, the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map are generated based on the Delaunay triangulation, without using a large amount of labor cost. Since the subsequent auditing of the base station type of the planned base station needs to be realized according to the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map, the method provided by this application initially provides a basis for auditing the planned base station.

[0019] In a possible design, to generate Delaunay circumscribed polygons according to the Delaunay triangulation, the method includes:

[0020] Respectively obtain the base station types corresponding to N standard base station locations, where the base station types at least include the first base station type and the second base station type;

[0021] Determine the standard base station locations with the base station type being the first base station type, and obtain i first-type standard base station locations, where i is an integer greater than 3 and less than or equal to N;

[0022] In the Delaunay triangulation, obtain the triangles that only include i first-type standard base station locations, and generate the Delaunay circumscribed polygons according to the triangle set.

[0023] Through the above method, by the method provided in this application, the Delaunay inscribed and circumscribed polygons are generated based on the standard base station positions in the standard base station database, without consuming a large amount of labor costs, and preliminarily providing a basis for auditing the to-be-planned base stations.

[0024] In a possible design, to obtain the position of the to-be-planned base station, the method includes:

[0025] Obtain a to-be-planned base station database, where the to-be-planned base station database includes at least one to-be-planned base station position;

[0026] Delete the to-be-planned base station positions in the to-be-planned base station database that do not meet the preset conditions to obtain an audited base station database;

[0027] Obtain the position of the to-be-planned base station from the audited base station database.

[0028] Through the above method, delete the to-be-planned base station positions in the to-be-planned base station database that do not meet the preset conditions, so as to realize the auditing of the to-be-planned base station database. The to-be-planned base station positions obtained from the to-be-planned base station database meet the preset longitude and latitude format requirements and are reasonable.

[0029] In a possible design, to delete the to-be-planned base station positions in the to-be-planned base station database that do not meet the preset conditions to obtain an audited base station database, the method includes:

[0030] Calculate the distances between each to-be-planned base station position in the to-be-planned base station database and N standard base station positions respectively to obtain N distances corresponding to each to-be-planned base station position;

[0031] Determine the minimum distance corresponding to each to-be-planned base station position respectively according to the N distances corresponding to each to-be-planned base station position;

[0032] Delete the to-be-planned base station positions in the to-be-planned base station database where the corresponding minimum distance is less than the preset threshold to obtain an audited base station database.

[0033] Through the above method, audit the to-be-planned base station database, delete the to-be-planned base station positions in the to-be-planned base station database that do not meet the preset conditions, so that the obtained to-be-planned base station positions meet the preset longitude and latitude format requirements and are reasonable.

[0034] In a second aspect, this application provides a base station auditing device, and the device includes:

[0035] A generation module, configured to generate a Delaunay triangulation network according to N standard base station positions, where N is an integer greater than 3;

[0036] An acquisition module, configured to generate a Delaunay circumscribed polygon buffer and a Thiessen circumscribed polygon map according to the Delaunay triangulation network, and acquire an overlapping area between the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map;

[0037] A judgment module, configured to acquire the position of a to-be-planned base station, and judge whether the position is located in the overlapping area; if so, output a first base station type as the base station type of the to-be-planned base station; if not, output a second base station type as the base station type of the to-be-planned base station.

[0038] In a possible design, the acquisition module includes:

[0039] A Delaunay circumscribed polygon generation unit, configured to generate a Delaunay circumscribed polygon according to the Delaunay triangulation network, where the Delaunay circumscribed polygon includes at least one standard base station position;

[0040] A formation unit, configured to form the Delaunay circumscribed polygon buffer according to the Delaunay circumscribed polygon, so that the minimum distance between any point on the edge of the Delaunay circumscribed polygon buffer and the edge of the Delaunay circumscribed polygon is a preset value;

[0041] A Thiessen circumscribed polygon generation unit, configured to generate the Thiessen circumscribed polygon map according to the standard base station positions included in the Delaunay circumscribed polygon.

[0042] In a possible design, the Delaunay circumscribed polygon generation unit is further configured to:

[0043] Respectively acquire the base station types corresponding to N standard base station positions, where the base station types at least include the first base station type and the second base station type;

[0044] Determine the standard base station positions with the base station type being the first base station type, and obtain i first-type standard base station positions, where i is an integer greater than 3 and less than or equal to N;

[0045] Acquire a triangle set only including i first-type standard base station positions, and generate the Delaunay circumscribed polygon according to the triangle set.

[0046] In a possible design, the judgment module includes:

[0047] A first acquisition unit, configured to acquire a to-be-planned base station database, where the to-be-planned base station database includes at least one to-be-planned base station position;

[0048] A deletion unit, configured to delete the to-be-planned base station positions in the to-be-planned base station database that do not meet the preset conditions, and obtain an audited base station database;

[0049] A second acquisition unit, configured to acquire the location of the base station to be planned from the auditing base station database.

[0050] In a possible design, the deletion unit is further configured to:

[0051] Calculate the distances between each location of the base stations to be planned in the base station database to be planned and the locations of N standard base stations respectively, to obtain N distances corresponding to each location of the base stations to be planned;

[0052] Determine the minimum distance corresponding to each location of the base stations to be planned respectively according to the N distances corresponding to each location of the base stations to be planned;

[0053] Delete the locations of the base stations to be planned in the base station database to be planned where the corresponding minimum distance is less than a preset threshold, to obtain the auditing base station database.

[0054] In a third aspect, the present application provides an electronic device, including:

[0055] A memory, configured to store a computer program;

[0056] A processor, configured to implement the above method steps when executing the computer program stored on the memory.

[0057] In a fourth aspect, the present application provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and the computer program implements the above method steps of image feature extraction when executed by a processor.

[0058] For the various aspects in the second to fourth aspects above and the possible technical effects that each aspect may achieve, please refer to the description of the possible technical effects that can be achieved in the first aspect or various possible solutions in the first aspect above, and details will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 is a flowchart of a base station auditing method provided by the present application;

[0060] Figure 2 is a schematic diagram of a Delaunay triangulation provided by the present application;

[0061] Figure 3 is a schematic diagram of a circumscribed polygon of a Delaunay triangulation provided by the present application;

[0062] Figure 4 is a schematic diagram of a buffer area of a circumscribed polygon of a Delaunay triangulation provided by the present application;

[0063] Figure 5 is a schematic diagram of a Voronoi polygon provided by the present application;

[0064] Figure 6 A schematic diagram of a circumscribed polygon of a Delaunay triangulation provided for this application;

[0065] Figure 7 A schematic diagram of an overlapping area provided for this application;

[0066] Figure 8 A schematic structural diagram of a control device provided for this application;

[0067] Figure 9 A schematic structural diagram of an electronic device provided for this application. Detailed implementation manners

[0068] In order to make the objectives, technical solutions and advantages of this application clearer, the following will further describe this application in detail with reference to the accompanying drawings. The specific operation methods in the method embodiments can also be applied to the device embodiments or system embodiments. It should be noted that in the description of this application, "a plurality of" is understood as "at least two". "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist simultaneously, and B exists alone. The connection between A and B may represent: two situations where A is directly connected to B and A is connected to B through C. In addition, in the description of this application, terms such as "first" and "second" are only used for the purpose of distinguishing descriptions, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying an order.

[0069] The following will describe the embodiments of this application in detail with reference to the accompanying drawings.

[0070] Before building a new base station, it is necessary to plan information such as the frequency, station type, and location of the site. Since there are often unreasonable plans in the planned base station site information, it is necessary to audit the planned base station site information and output the base station type of the base station to be planned. The existing base station audit methods not only have high labor costs but also have room for efficiency improvement.

[0071] To solve the above problems, this application provides a base station auditing method. First, a Delaunay triangulation is generated based on the standard base station locations in the standard base station database. Then, the Delaunay circumscribed polygon buffer and the Delaunay triangulation circumscribed polygon map are obtained using the Delaunay triangulation. Next, the overlapping area between the Delaunay circumscribed polygon buffer and the Delaunay triangulation circumscribed polygon map is determined. Then, based on the positional relationship between the overlapping area and the planned base station, the base station type of the base station to be planned with rationality is output, thereby realizing the auditing of base station planning with low labor costs and high efficiency.

[0072] As Figure 1 shown, it is a flowchart of a base station auditing method provided by an embodiment of this application, which specifically includes the following steps:

[0073] Step S11, generate a Delaunay triangulation based on the positions of N standard base stations;

[0074] In order to audit the base station to be planned according to the positions of N standard base stations in the standard base station database, it is first necessary to generate a Delaunay triangulation.

[0075] In an embodiment provided by the present application, the edge expansion method is adopted for the positions of N standard base stations to generate a Delaunay triangulation. Figure 2 This is a schematic diagram of a Delaunay triangulation provided by the present application, as Figure 2 shown, the dots represent the positions of the standard base stations in the standard base station database.

[0076] Specifically, randomly select a point from the N dots as the starting point p1, select the point closest to the starting point from the N dots as the second point p2, and then according to the Delaunay rule, judge whether there is a point on the right side of the connection line p1-p2 between the starting point p1 and the second point p2 that forms the largest angle with the connection line p1-p2 as the third point p3. If it exists, the connection line p1-p2 satisfies the expansion condition of the Delaunay triangle, and a triangle formed by the connection line p1-p2 and the third point is formed. If it does not exist, no expansion is performed according to the connection line p1-p2.

[0077] Similarly, according to the Delaunay rule, judge whether there is a point on the right side of the connection line p2-p1 between the second point p2 and the starting point p1 that forms the largest angle with the connection line p2-p1 as the fourth point p4. If it exists, the connection line p2-p1 satisfies the expansion condition of the Delaunay triangle, and a triangle formed by the connection line p2-p1 and the fourth point is formed. If it does not exist, no expansion is performed according to the connection line p2-p1.

[0078] And so on, expand the connection lines between the initial point and the third point p1-p3, the third point and the second point p3-p2, the second point and the fourth point p2-p4, and the fourth point and the first point p4-p1 through the above method. Specifically, when expanding the connection line that meets the expansion condition for the (k-2)th time, select the kth point as the expansion point to form a Delaunay triangle, and then generate two connection lines pi-pk and pk-pj based on the kth point, and use these two connection lines as the next expansion objects, and then expand through the above method until there is no connection line that meets the expansion condition but has not been expanded among the N dots.

[0079] Record each triangle obtained by expanding from the N dots to generate a Delaunay triangulation.

[0080] Step S12, generate a Delaunay circumscribed polygon buffer and a Thiessen circumscribed polygon map based on the Delaunay triangulation, and obtain the overlapping area of the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map;

[0081] In an embodiment provided by the present application, in order to obtain the coverage areas of urban-type base stations and county-type base stations in the standard base station database, it is necessary to first generate a Delaunay circumscribed polygon buffer and a Thiessen circumscribed polygon map based on the Delaunay triangulation of the standard base station positions, which specifically includes the following steps:

[0082] Step S21: Generate a Delaunay circumscribed polygon according to the Delaunay triangulation.

[0083] Specifically, each standard base station position in the standard base station database corresponds to a base station type respectively. The base station types are at least divided into two types: the first base station type and the second base station type. In the embodiment of the present application, the first base station type is the urban base station type, and the second base station type is the rural base station type. Among them, the urban base station type at least includes the urban area base station type and the county base station type.

[0084] Based on the above situation, the base station types corresponding to N standard base station positions are obtained respectively. Then, the standard base station positions with the base station type of the first base station type are determined, and i first-type standard base station positions are obtained. Finally, in the Delaunay triangulation, a triangle set that only includes i first-type standard base station positions is obtained, and a Delaunay circumscribed polygon is generated according to the triangle set.

[0085] Specifically, Figure 3 For a schematic diagram of the Delaunay triangulation circumscribed polygon provided by the present application, as Figure 3 shown, the hollow dots represent the first-type standard base station positions, and the solid dots represent the second-type standard base station positions. In the embodiment provided by the present application, the number of hollow dots representing the first-type standard base station positions is 8. Therefore, there are a total of 8 first-type standard base station positions in the standard base station database.

[0086] Then, a triangle set that only includes hollow dots is obtained. In the embodiment of the present application, the triangle set includes 8 Delaunay triangles. Finally, a Delaunay circumscribed polygon as shown in Figure 3 is formed according to the triangle set.

[0087] Through the method provided by the present application, a Delaunay circumscribed polygon is generated according to the standard base station positions in the standard base station database, without consuming a large amount of labor costs, and preliminarily provides a basis for auditing the base stations to be planned.

[0088] Step S22: Form a Delaunay circumscribed polygon buffer according to the Delaunay circumscribed polygon, so that the minimum distance between any point on the edge of the Delaunay circumscribed polygon buffer and the edge of the Delaunay circumscribed polygon is a preset value;

[0089] Specifically, buffer zones are created outward based on the Delaunay inscribed and circumscribed polygons, such that the minimum distance from any point on the edge of the obtained Delaunay inscribed and circumscribed polygon buffer zone to the edge of the Delaunay inscribed and circumscribed polygon is a preset value k. Figure 4 This is a schematic diagram of a Delaunay inscribed and circumscribed polygon buffer zone provided by the present application, as Figure 4 shown, the Delaunay inscribed and circumscribed polygon buffer zone is the area represented by the irregular figure in the drawing;

[0090] Step S23: Generate the Voronoi circumscribed polygon map based on the standard base station positions included in the Delaunay inscribed and circumscribed polygons.

[0091] In an embodiment provided by the present application, the Voronoi circumscribed polygon map is generated based on the Delaunay inscribed and circumscribed polygons.

[0092] Specifically, first obtain the circumcenter of the circumcircle of each Delaunay triangle in the Delaunay triangulation, and then connect the circumcenters of all adjacent Delaunay triangles. All the connecting lines obtained form the Voronoi polygon, as Figure 5 shown, which is a schematic diagram of a Voronoi polygon provided by the present application;

[0093] Since the Voronoi circumscribed polygon map only includes the standard base station positions included in the Delaunay inscribed and circumscribed polygons, and since the Delaunay inscribed and circumscribed polygons only include the first type of standard base station positions, select the polygon that only includes the hollow dots representing the first type of standard base station positions in the Voronoi polygon to form the Voronoi circumscribed polygon, as Figure 6 shown, Figure 6 which is a schematic diagram of a Voronoi circumscribed polygon provided by the present application;

[0094] Through the method provided by the present application, a Delaunay inscribed and circumscribed polygon buffer zone and a Voronoi circumscribed polygon map are generated based on the Delaunay triangulation, without consuming a large amount of labor costs. Since the subsequent auditing of the base station types of the to-be-planned base stations needs to be realized based on the Delaunay inscribed and circumscribed polygon buffer zone and the Voronoi circumscribed polygon map, the method provided by the present application preliminarily provides a basis for auditing the to-be-planned base stations.

[0095] In the embodiments provided by the present application, both the Delaunay inscribed and circumscribed polygon buffer zone and the Voronoi circumscribed polygon map represent the coverage areas of the first type of standard base station positions. Since in the process of forming the Delaunay inscribed and circumscribed polygons, when creating buffer zones outward based on the Delaunay inscribed and circumscribed polygons, the second type of standard base station positions may be introduced, as Figure 4 shown, the gray solid dots are the second type of standard base station positions introduced into the Delaunay inscribed and circumscribed polygon buffer zone.

[0096] To exclude the positions of the second type of standard base stations that may be included in the inscribed and circumscribed polygon buffers of Delaunay, the overlapping area between the inscribed and circumscribed polygon buffers of Delaunay and the Voronoi diagram is obtained, and the overlapping area is used as the coverage area of the more accurate positions of the first type of standard base stations after correction. As Figure 7 shown, it is a schematic diagram of an overlapping area provided by this application. Only the positions of the first type of standard base stations are included in the overlapping area, and the positions of the second type of standard base stations in the inscribed and circumscribed polygon buffers of Delaunay are excluded.

[0097] Step S13: Obtain the position of the base station to be planned, and determine whether the position is within the overlapping area;

[0098] Before auditing the base station to be planned, it is necessary to obtain the position of the base station to be planned, which specifically includes the following steps:

[0099] Step S31: Obtain the database of base stations to be planned;

[0100] In the embodiment provided by this application, the database of base stations to be planned includes at least one position of a base station to be planned, and each position of a base station to be planned includes at least the longitude and latitude of the base station to be planned.

[0101] Step S32: Delete the positions of the base stations to be planned that do not meet the preset conditions in the database of base stations to be planned, and obtain the audited base station database;

[0102] Specifically, first calculate the distances between each position of the base station to be planned in the database of base stations to be planned and the positions of N standard base stations respectively, and obtain N distances x 1 、x 2 、……、x n corresponding to each position of the base station to be planned respectively. Then determine the smallest x 1 、x 2 、……、x n in each x min corresponding to each position of the base station to be planned respectively as the minimum distance corresponding to each position of the base station to be planned.

[0103] Finally, delete the positions of the base stations to be planned in the database of base stations to be planned where the corresponding minimum distance x min is less than the preset threshold k, and obtain the audited base station database.

[0104] Through the method provided by this application, the database of base stations to be planned is audited, and the positions of the base stations to be planned that do not meet the preset conditions in the database of base stations to be planned are deleted, and the audited base station database is obtained, so that the positions of the base stations to be planned obtained from the audited base station database not only meet the requirements of the preset longitude and latitude format, but also are reasonable.

[0105] Step S33: Obtain the location of the base station to be planned from the auditing base station database.

[0106] Through the method provided in this application, the locations of the base stations to be planned in the base station to be planned database that do not meet the preset conditions are deleted, thereby realizing the auditing of the base station to be planned database. The locations of the base stations to be planned obtained from the base station to be planned database meet the requirements of the preset longitude and latitude format and are reasonable.

[0107] Furthermore, since in the embodiments provided in this application, the overlapping area represents the coverage area of the first type of standard base station location, it is possible to determine whether the type of the base station to be planned is the first base station type according to whether the location of the base station to be planned is located in the overlapping area.

[0108] If the location of the base station to be planned is within the overlapping area, then execute step S14.

[0109] Step S14: Output the first base station type as the base station type of the base station to be planned;

[0110] In the embodiments provided in this application, the first base station type is the urban base station type. The urban base station type includes at least the urban area base station type and the county town base station type. When the base station type of the base station to be planned is output as the first base station type, the frequency of the base station to be planned can be 3.5 GHz, and the station type of the base station to be planned can be selected as 64TR or 32TR.

[0111] If the location of the base station to be planned is not within the overlapping area, then execute step S15.

[0112] Step S15: Output the second base station type as the base station type of the base station to be planned;

[0113] In the embodiments provided in this application, the second base station type is the rural base station type. When the base station type of the base station to be planned is output as the second base station type, the frequency of the base station to be planned can be 3.5 GHz or 2.1 GHz, and the station type of the base station to be planned can be selected as 8TR or 4TR.

[0114] Through the method provided in this application, the planning information such as the frequency, station type, and location of the site is audited before building a new base station. First, a Delaunay triangulation is generated based on the standard base station locations in the standard base station database, and then the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map are obtained using the Delaunay triangulation. Next, the overlapping area of the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map is determined, so as to output the reasonable base station type of the planned base station according to the position relationship between the overlapping area and the planned base station, thereby realizing the auditing of the planned base station with low labor cost and high efficiency.

[0115] Based on the same inventive concept, this application also provides a control device, such asFigure 8 As shown in the figure, it is a schematic structural diagram of a control device in the present application. The device includes:

[0116] A generation module 101, configured to generate a Delaunay triangulation according to N standard base station positions, where N is an integer greater than 3;

[0117] An acquisition module 102, configured to generate a circumscribed polygon buffer of the Delaunay and a Voronoi circumscribed polygon map according to the Delaunay triangulation, and acquire an overlapping area between the circumscribed polygon buffer of the Delaunay and the Voronoi circumscribed polygon map;

[0118] A judgment module 103, configured to acquire the position of the to-be-planned base station, and judge whether the position is within the overlapping area; if so, output a first base station type as the base station type of the to-be-planned base station; if not, output a second base station type as the base station type of the to-be-planned base station.

[0119] In a possible design, the acquisition module includes:

[0120] A Delaunay circumscribed polygon generation unit, configured to generate a Delaunay circumscribed polygon according to the Delaunay triangulation, where the Delaunay circumscribed polygon includes at least one standard base station position;

[0121] A formation unit, configured to form the circumscribed polygon buffer of the Delaunay according to the Delaunay circumscribed polygon, so that the minimum distance between any point on the edge of the circumscribed polygon buffer of the Delaunay and the edge of the Delaunay circumscribed polygon is a preset value;

[0122] A Voronoi circumscribed polygon generation unit, configured to generate the Voronoi circumscribed polygon map according to the standard base station positions included in the Delaunay circumscribed polygon.

[0123] In a possible design, the Delaunay circumscribed polygon generation unit is further configured to:

[0124] Respectively acquire the base station types corresponding to N standard base station positions, where the base station types at least include the first base station type and the second base station type;

[0125] Determine the standard base station positions with the base station type being the first base station type, and obtain i first-type standard base station positions, where i is an integer greater than 3 and less than or equal to N;

[0126] Acquire multiple triangles that only include i first-type standard base station positions, and generate the Delaunay circumscribed polygon according to the multiple triangle sets.

[0127] In a possible design, the judgment module includes:

[0128] A first acquisition unit, configured to acquire a database of base stations to be planned, where the database of base stations to be planned includes at least one position of a base station to be planned;

[0129] A deletion unit, configured to delete the positions of the base stations to be planned in the database of base stations to be planned that do not meet the preset conditions, so as to obtain an audited base station database;

[0130] A second acquisition unit, configured to acquire the positions of the base stations to be planned from the audited base station database.

[0131] In a possible design, the deletion unit is further configured to:

[0132] Calculate the distances between each position of the base station to be planned in the database of base stations to be planned and N standard base station positions respectively, so as to obtain N distances corresponding to each position of the base station to be planned;

[0133] Determine the minimum distance corresponding to each position of the base station to be planned respectively according to the N distances corresponding to each position of the base station to be planned;

[0134] Delete the positions of the base stations to be planned in the database of base stations to be planned where the corresponding minimum distance is less than a preset threshold, so as to obtain an audited base station database.

[0135] Through the control device provided in this application, the planning information such as frequency, station type, and position of the site is audited before a new base station is built. First, a Delaunay triangulation is generated according to the standard base station positions in the standard base station database, and then the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map are obtained by using the Delaunay triangulation. Next, the overlapping area between the Delaunay circumscribed polygon buffer and the Thiessen circumscribed polygon map is determined, so as to output the base station type of the planned base station with rationality according to the positional relationship between the overlapping area and the planned base station, thereby realizing the auditing of the planned base station with low labor cost and high efficiency.

[0136] Based on the same inventive concept, an electronic device is further provided in an embodiment of this application. The electronic device can implement the functions of the foregoing base station auditing device. Refer to Figure 9 , the electronic device includes:

[0137] At least one processor 91, and a memory 92 connected to at least one processor 91. In the embodiment of this application, the specific connection medium between the processor 91 and the memory 92 is not limited. Figure 9 In, it is taken as an example that the processor 91 and the memory 92 are connected through a bus 90. The bus 90 is Figure 9 represented by a thick line in. The connection manners between other components are only for illustrative purposes and are not limited thereto. The bus 90 can be divided into an address bus, a data bus, a control bus, etc. For the convenience of representation, Figure 9It is represented by only one thick line, but it does not mean that there is only one bus or one type of bus. Alternatively, the processor 91 may also be referred to as a controller, and there is no restriction on the name.

[0138] In the embodiment of the present application, the memory 92 stores instructions that can be executed by at least one processor 91. By executing the instructions stored in the memory 92, the at least one processor 91 can execute the base station auditing method described above. The processor 91 can implement Figure 9 the functions of each module in the device shown.

[0139] Among them, the processor 91 is the control center of the device, and can connect various parts of the entire control device through various interfaces and lines. By running or executing the instructions stored in the memory 92 and calling the data stored in the memory 92, various functions of the device and process data, so as to monitor the device as a whole.

[0140] In a possible design, the processor 91 may include one or more processing units. The processor 91 may integrate an application processor and a modem processor. Among them, the application processor mainly processes the operating system, user interface, application programs, etc., and the modem processor mainly processes wireless communication. It can be understood that the above modem processor may not be integrated into the processor 91. In some embodiments, the processor 91 and the memory 92 may be implemented on the same chip. In some embodiments, they may also be implemented separately on independent chips.

[0141] The processor 91 may be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the base station auditing method disclosed in combination with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.

[0142] The memory 92 serves as a non-volatile computer-readable storage medium and can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The memory 92 can include at least one type of storage medium. For example, it can include flash memory, hard disks, multimedia cards, card-type memories, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic memories, magnetic disks, optical disks, and so on. The memory 92 is any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory 92 in the embodiments of the present application can also be a circuit or any other device capable of implementing a storage function, for storing program instructions and / or data.

[0143] By designing and programming the processor 91, the code corresponding to the base station auditing method introduced in the foregoing embodiments can be solidified into the chip, so that the chip can execute Figure 1 the steps of the base station auditing method of the illustrated embodiment when running. How to design and program the processor 91 is a well-known technology to those skilled in the art and will not be elaborated here.

[0144] Based on the same inventive concept, the embodiments of the present application also provide a storage medium storing computer instructions, which, when run on a computer, cause the computer to execute the base station auditing method discussed above.

[0145] In some possible implementation manners, each aspect of the base station auditing method provided by the present application can also be implemented in the form of a program product, which includes program code. When the program product runs on a device, the program code is used to cause the control device to execute the steps of the base station auditing method according to various exemplary embodiments of the present application described above in this specification.

[0146] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0147] The present application is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, as well as the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices generate means for implementing the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or combinations of blocks.

[0148] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including instruction means that implement the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or combinations of blocks.

[0149] These computer program instructions can also be loaded onto a computer or other programmable data processing device, such that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or combinations of blocks.

[0150] Obviously, those skilled in the art can make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these modifications and variations.

Claims

1. A base station auditing method, characterized in that, the method includes: generating a Delaunay triangulation based on N standard base station positions, where N is an integer greater than 3; generating a Delaunay circumscribed polygon based on the Delaunay triangulation, where the Delaunay circumscribed polygon includes at least one standard base station position; forming a buffer zone of the Delaunay circumscribed polygon according to the Delaunay circumscribed polygon, so that the minimum distance between any point on the edge of the Delaunay circumscribed polygon buffer zone and the edge of the Delaunay circumscribed polygon is a preset value; generating a Thiessen circumscribed polygon map according to the standard base station positions included in the Delaunay circumscribed polygon; obtaining the overlapping area between the Delaunay circumscribed polygon buffer zone and the Thiessen circumscribed polygon map; obtaining the position of the to-be-planned base station, and determining whether the position is located in the overlapping area; if so, outputting a first base station type as the base station type of the to-be-planned base station; if not, outputting a second base station type as the base station type of the to-be-planned base station.

2. The method according to claim 1, characterized in that, generating a Delaunay circumscribed polygon based on the Delaunay triangulation includes: respectively obtaining the base station types corresponding to the N standard base station positions, where the base station types at least include the first base station type and the second base station type; determining the standard base station positions with the base station type being the first base station type, and obtaining i first-type standard base station positions, where i is an integer greater than 3 and less than or equal to N; in the Delaunay triangulation, obtaining a triangle set that only includes the i first-type standard base station positions, and generating the Delaunay circumscribed polygon according to the triangle set.

3. The method according to claim 1, characterized in that, obtaining the position of the to-be-planned base station includes: obtaining a to-be-planned base station database, where the to-be-planned base station database includes at least one to-be-planned base station position; deleting the to-be-planned base station positions that do not meet the preset conditions in the to-be-planned base station database, and obtaining an audited base station database; obtaining the position of the to-be-planned base station from the audited base station database.

4. The method according to claim 3, characterized in that, deleting the to-be-planned base station positions that do not meet the preset conditions in the to-be-planned base station database, and obtaining an audited base station database includes: respectively calculating the distances between each to-be-planned base station position in the to-be-planned base station database and the N standard base station positions, and obtaining N distances corresponding to each to-be-planned base station position; respectively determining the minimum distance corresponding to each to-be-planned base station position according to the N distances corresponding to each to-be-planned base station position; deleting the to-be-planned base station positions in the to-be-planned base station database whose corresponding minimum distance is less than a preset threshold, and obtaining an audited base station database.

5. A base station auditing device, characterized in that, the device includes: a generating module, configured to generate a Delaunay triangulation based on N standard base station positions, where N is an integer greater than 3; An acquisition module, configured to generate a Delaunay circumscribed polygon based on the Delaunay triangulation network, wherein the Delaunay circumscribed polygon includes at least one standard base station location; form a buffer zone of the Delaunay circumscribed polygon according to the Delaunay circumscribed polygon, so that the minimum distance between any point on the edge of the buffer zone of the Delaunay circumscribed polygon and the edge of the Delaunay circumscribed polygon is a preset value; generate a Thiessen circumscribed polygon map according to the standard base station locations included in the Delaunay circumscribed polygon; and obtain an overlapping area between the buffer zone of the Delaunay circumscribed polygon and the Thiessen circumscribed polygon map; A judgment module, configured to obtain the location of the to-be-planned base station, and judge whether the location is within the overlapping area; if so, output a first base station type as the base station type of the to-be-planned base station; if not, output a second base station type as the base station type of the to-be-planned base station.

6. The apparatus according to claim 5, wherein, the Delaunay circumscribed polygon generation unit is further configured to: respectively obtain the base station types corresponding to N standard base station locations, wherein the base station types at least include the first base station type and the second base station type; determine the standard base station locations with the base station type being the first base station type, and obtain i first-type standard base station locations, where i is an integer greater than 3 and less than or equal to N; obtain a triangle set only including i first-type standard base station locations, and generate the Delaunay circumscribed polygon according to the triangle set.

7. The apparatus according to claim 5, wherein, the judgment module includes: a first acquisition unit, configured to obtain a to-be-planned base station database, wherein the to-be-planned base station database includes at least one to-be-planned base station location; a deletion unit, configured to delete the to-be-planned base station locations that do not meet the preset conditions in the to-be-planned base station database, and obtain an audited base station database; a second acquisition unit, configured to obtain the location of the to-be-planned base station from the audited base station database.

8. The apparatus according to claim 7, wherein, the deletion unit is further configured to: respectively calculate the distances between each to-be-planned base station location in the to-be-planned base station database and N standard base station locations, and obtain N distances corresponding to each to-be-planned base station location; respectively determine the minimum distance corresponding to each to-be-planned base station location according to the N distances corresponding to each to-be-planned base station location; delete the to-be-planned base station locations in the to-be-planned base station database whose corresponding minimum distance is less than a preset threshold, and obtain an audited base station database.

9. An electronic device, wherein, it includes: a memory, configured to store a computer program; a processor, configured to implement the method steps described in any one of claims 1-4 when executing the computer program stored on the memory.

10. A computer-readable storage medium, wherein, the computer-readable storage medium stores a computer program, and the computer program implements the method steps described in any one of claims 1-4 when being executed by a processor.

Images