CN118139067A - Regional core coverage site identification method and device and computer equipment - Google Patents
Regional core coverage site identification method and device and computer equipment Download PDFInfo
- Publication number
- CN118139067A CN118139067A CN202211530759.1A CN202211530759A CN118139067A CN 118139067 A CN118139067 A CN 118139067A CN 202211530759 A CN202211530759 A CN 202211530759A CN 118139067 A CN118139067 A CN 118139067A
- Authority
- CN
- China
- Prior art keywords
- area
- polygonal
- cell
- base station
- polygonal area
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 101
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 73
- 238000004891 communication Methods 0.000 claims abstract description 19
- 238000003745 diagnosis Methods 0.000 claims description 6
- 238000011156 evaluation Methods 0.000 claims description 6
- 238000002601 radiography Methods 0.000 claims 2
- 238000010586 diagram Methods 0.000 description 11
- 102100040401 DNA topoisomerase 3-alpha Human genes 0.000 description 6
- 101000611068 Homo sapiens DNA topoisomerase 3-alpha Proteins 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000001154 acute effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 208000018910 keratinopathic ichthyosis Diseases 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention relates to the technical field of communication and discloses a method for identifying a regional core coverage site, which comprises the following steps: determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; determining an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area. Through the mode, the method and the device for identifying the regional core site quickly and accurately achieve quick and accurate identification of the regional core site.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method and a device for identifying a regional core coverage site, computer equipment and a computer readable storage medium.
Background
At present, after entering the 5G era, more than 70% of 5G applications such as smart home, smart factory, AR/VR occur indoors, and together with the increase of user service demands, the indoor will become a main battlefield with competitive advantage for the operator 5G network. The 5G urban area has basically achieved full coverage, and the residential area is a high-rise area for coverage and network problems. Signals of the residential area are usually covered by peripheral macro stations, and coverage optimization for the residential area requires sites and cells which explicitly cover the residential area. For identifying coverage cells around residential areas, the following methods are generally adopted in the prior art: (1) And displaying the sites on a map by using map tools such as MapInfo, google Earth and the like, and confirming the coverage sites corresponding to the residential area by a manual observation mode. (2) To the site, a survey of the surrounding environment and the sky of the base station is conducted to confirm whether the site can cover the residential area. (3) And entering the residential area to perform DT or CQI test, and collecting signals occupied in the area to determine the actual coverage site of the residential area. By determining the potential coverage sites of the residential area in the above manner, and then performing special treatment work on the coverage sites, network coverage of the residential area is improved, and 5G user experience of the residential area is improved.
However, the present inventors have found that the existing area coverage site identification method has the following disadvantages: the existing technical scheme is mainly based on a manual confirmation mode and comprises methods of manually judging coverage sites of areas based on work parameter data and map information, performing on-site investigation to confirm coverage sites of residential areas aiming at residential areas and surrounding areas, performing CQT test to confirm that residential areas actually occupy cells aiming at the interior of the residential areas and the like. The traditional methods have the problems of low recognition efficiency and high recognition cost, and can not carry out the recognition work of the regional coverage site on a large scale. In addition, the existing technical scheme does not have unified area coverage site identification judgment standard, different people have different judgment logics, and because engineering parameters of the base station are in dynamic change, the accuracy and timeliness of manual identification cannot be effectively ensured, and the identification result cannot effectively guide residential area coverage optimization. Therefore, the existing core cell identification has the technical problems of low identification efficiency and poor accuracy.
Disclosure of Invention
In view of the above problems, embodiments of the present invention provide a method, an apparatus, a computer device, and a computer readable storage medium for identifying a regional core coverage site, which are used to solve the technical problems of low identification efficiency and poor accuracy in the existing core cell identification in the prior art.
According to an aspect of the embodiment of the present invention, there is provided a method for identifying a coverage site of an area core, the method including:
Determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
Determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
Calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
Determining an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
In an alternative manner, before determining the base stations in each polygonal area by a ray method, the method includes:
determining a plurality of polygonal areas based on the frame vertex longitude and latitude sequences corresponding to the geographic position areas;
and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell.
In an alternative manner, the determining, by a ray method, the base station in each polygonal area includes:
Constructing rays from each base station as a starting point;
Determining the number of intersection points of each base station and each side of the polygonal area;
And determining whether each base station is in the polygonal area according to the number of the intersection points.
In an optional manner, the calculating, by a polygon tangential algorithm, an initial azimuth range of each of the potential coverage base stations covering the polygon area includes:
Respectively calculating the direction angles from the potential coverage base station to each vertex of the polygonal area by taking the potential coverage base station as a center to obtain a direction angle sequence;
sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences;
Clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences;
and obtaining the initial azimuth angle range according to the starting point and the ending point.
In an optional manner, the determining, according to the initial azimuth angle range and the angle offset value, an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station includes:
Calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm;
generating an angle offset value according to the minimum distance and a dynamic azimuth offset algorithm;
Determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value;
And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range.
In an optional manner, after determining the out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value, the method further includes:
acquiring the information of occupied cells corresponding to each building in each polygonal area;
and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell.
In an optional manner, after generating the cell data corresponding to the polygonal area on the map according to the occupied cell information, the intra-area core cell and the extra-area core cell, the method further includes:
Evaluating the network of the polygonal area according to the cell data;
and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result.
According to another aspect of the embodiment of the present invention, there is provided an area core coverage site identification apparatus, including:
the first determining module is used for determining base stations in each polygonal area through a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
a second determining module, configured to determine at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
the calculating module is used for calculating the initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
The third determining module is used for determining an out-of-area core cell corresponding to the polygonal area from all cell sectors of all the potential coverage base stations according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
According to another aspect of an embodiment of the present invention, there is provided a computer apparatus including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
The memory is configured to store at least one executable instruction that causes the processor to perform the operations of the area core coverage site identification method.
According to yet another aspect of an embodiment of the present invention, there is provided a computer readable storage medium having stored therein at least one executable instruction that, when executed on a computer device, causes the computer device to perform the operations of the area core coverage site identification method.
According to the embodiment of the invention, the base stations in each polygonal area are determined by a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value. According to the embodiment of the invention, the geographic position of the area is determined through the longitude and latitude sequences of the polygon vertexes of the area, then the attribution relation of the base station in the area is accurately matched through a set of geometric algorithm flow by combining the accurate positioning data of the building MR according to the longitude and latitude of the physical point, the azimuth angle of the cell, the central frequency point of the cell and other data in the engineering parameter data of the base station, and the area core coverage site can be rapidly and accurately identified. In addition, the embodiment of the invention standardizes the regional core site identification algorithm, the identification result can rapidly respond to the dynamic change of the data source, and the intelligent matching of the core coverage sites of any regional scene can be realized.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific embodiments of the present invention are given for clarity and understanding.
Drawings
The drawings are only for purposes of illustrating embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
fig. 1 is a schematic flow chart of a method for identifying a coverage site of a regional core according to an embodiment of the present invention;
FIG. 2 is a schematic diagram showing a ray-line intersection algorithm in a method for identifying a regional core coverage site according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a ray algorithm in a method for identifying a coverage site of an area core according to an embodiment of the present invention;
Fig. 4 is a schematic diagram of delaunay triangulation in a regional core coverage site identification method according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a polygon tangent algorithm in a method for identifying a coverage site of a regional core according to an embodiment of the present invention;
Fig. 6 is a schematic diagram of a polygon minimum distance algorithm in a method for identifying a coverage site of a regional core according to an embodiment of the present invention;
fig. 7 is a schematic diagram of an azimuth offset algorithm in the method for identifying a regional core coverage site according to an embodiment of the present invention;
Fig. 8 shows a schematic diagram of relevant accurate building coverage in the method for identifying regional core coverage sites according to the embodiment of the present invention;
Fig. 9 is a schematic structural diagram of an area core coverage site identification device according to an embodiment of the present invention;
Fig. 10 shows a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein.
Fig. 1 shows a flowchart of a method for identifying a coverage site of an area core, which is provided by an embodiment of the present invention, and the method is executed by a computer device. The computer device may be a personal computer, a desktop computer, an intelligent terminal, a communication device, a graphics processing device, etc., and embodiments of the present invention are not limited in particular. As shown in fig. 1, the method comprises the steps of:
Step 110: and determining the base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area.
The polygonal area is a geographic position area divided according to longitude and latitude. Before determining a base station in a polygonal area, determining a plurality of polygonal areas based on a frame vertex longitude and latitude sequence corresponding to a geographic position area; and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell. The polygonal area is a scene area, and can be a residential area, such as a certain district, a market, an industrial park, or the like. Wherein, the region scene data and the cell data can be visualized in advance. In the embodiment of the invention, the map data visual library is adopted to realize the presentation of residential areas and cells in the map. The fosium is built on the data application capabilities of the Python ecosystem and the mapping capabilities of the leaf. The data was manipulated in Python and then visualized in Leaflet map by means of a fourier. Specifically, a polygonal area may be generated on a map according to area data in a visual library of map data, where the area data includes basic information of each scene area and scene frame vertex longitude and latitude sequence (geometry) field information of the scene area, a polygonal area corresponding to the scene area is generated based on the scene frame vertex longitude and latitude sequence field information of the scene area, and attribute information, such as name, ID, longitude and latitude information, area information, and the like, of the scene area is added to the polygonal area, so that the view on the map is facilitated. Table 1 is basic information of each scene area in the area data, and scene frame vertex longitude and latitude sequence (geometry) field information of the scene area.
Table 1:
In the embodiment of the invention, the longitude and latitude sequence of the sector boundary of the cell is determined according to the basic industrial parameter information contained in the cell data, and the sector coverage area of the cell is generated. Specifically, because the cell data contains basic industrial parameter information of the cell, as shown in table 2, based on the longitude and latitude and azimuth information of the cell in the basic industrial parameter information, a trigonometric function algorithm is utilized to iteratively generate a longitude and latitude sequence of a sector boundary of the cell, a sector coverage area of the cell is generated on a map based on the longitude and latitude sequence by using a folium, and relevant attribute information of the cell is added on a corresponding sector, so that the view on the map is facilitated.
Table 2:
| Field name | Data |
| NRCELL name | H11538817-Xiaoshan sunny village CRANA@financial and Hunan domain bay-H5H-26101-311 |
| CGI | 460-00-11538817-311 |
| Azimuth angle | 60 |
| Longitude and latitude | 120.24829 |
| Latitude of latitude | 30.153321 |
After generating a polygonal area corresponding to the scene area and a sector coverage area of the cell, establishing a scene area and a sector layer model of the cell on a map through the regional frame vertex longitude and latitude sequence and the cell azimuth angle, longitude and latitude information.
After obtaining a plurality of polygonal areas and sector coverage areas of cells, determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area. Since each cell of the base station in the polygonal area covers the polygonal area, the cell is determined by the positional relationship between the base station and the polygon when determining at least one core cell in the polygonal area. Specifically, the kernel site identification in the area is to actually judge whether a point (taking the longitude and latitude of the base station as a point) is in the polygon, wherein rays are constructed from each base station as a starting point; determining the number of intersection points of each base station and each side of the polygonal area; and determining whether each base station is in the polygonal area according to the number of the intersection points. Specifically, a ray method is adopted, a ray is taken in the horizontal direction to the right (or left) from a base station as a starting point, the number of intersection points of the ray and each side of the polygon is calculated, if the number of intersection points is odd, the ray is positioned in the polygon area, and if the number of intersection points is even, the ray is positioned outside the polygon area.
As shown in fig. 2, a method of determining whether or not an intersection exists between a ray starting from a base station and each side of a polygonal area is as follows. Assuming that the point X (,)、Y(,) is two adjacent vertices of a polygon area, the point Z (,) is two base stations near the polygon area, and XY is one edge of the polygon area. The specific process of whether the ray algorithm point Z has an intersection point with XY in the forward direction is as follows:
First, it is ensured that the latitude of the input point Z is between the two vertices of the edge XY, namely:
Y≤Z≤X
Then comparing the ray at the point Z with the slope tan beta of the side line XY to judge whether the ray at the point Z intersects the side line XY, wherein the calculation formula of tan beta is as follows:
tanβ＝(Y()-X())/(Y()-X())
Assuming that the input point Z is at the position shown by Z a in fig. 2, the calculation formula of the slope tan θ of the line XZ a is:
tanθ＝(Za()-X())/(Za(lng)-X())
Assuming that the input point Z is at the position shown by Z b in fig. 2, the calculation formula of the slope tan α of the line XZ b is:
tanα＝(Zb(lat)-X(lat))/(Zb()-X())
As can be seen from fig. 2, since the slope tan θ of XZ a is smaller than the slope tan β of XY, the ray at point Z a has no intersection with the edge XY, and the slope tan α of XZ b is larger than the slope tan β of XY, so that the ray at Z b has an intersection point P with the edge XY.
As shown in fig. 3, intersection points are calculated for the lines composed of the vertices of the polygon in a counterclockwise or clockwise order. If the number of the intersecting points of the points and the polygon is odd, judging that the points are in the polygon; if the number of points of intersection with the polygon is even, the point (base station) is judged to be outside the polygon area. By the method, the core coverage sites in the polygonal area can be identified. After each base station in the area is determined, all cells of the base stations in each area are determined as intra-area core cells in the polygonal area. And when the corresponding base station does not exist in a certain polygonal area, determining that no area core cell exists in the polygonal area.
In this way, the irregular polygon or the composite polygon can be accurately judged, and whether the base station is in the specified area range can be accurately judged.
Step 120: at least one potential coverage base station outside the polygonal area is determined based on a triangulation algorithm.
Wherein, after identifying the core sites in the polygonal area, a circle of base stations around the polygonal area can be further determined, because the part of base stations are the sites most likely to cover the residential area.
In the embodiment of the invention, a triangulation method is adopted to determine at least one potential coverage base station outside the polygonal area. Specifically, based on Delaunay triangulation algorithm, firstly, calculating the longitude and latitude of the center of a polygonal area through the longitude and latitude sequences of the frames of the polygonal area, then adding the longitude and latitude of the center of the area into the longitude and latitude sequences of physical points of a base station to construct an intra-Delaunay triangulation network, finally searching triangular sequences related to the longitude and latitude of the center of the area in all intra-Delaunay triangulation relations, and marking the physical points of the base station in the triangular sequences as potential coverage base stations of the polygonal area.
As shown in fig. 4, triangulation may decompose a network coverage area into multiple triangles with base stations as vertices. The minimum interior angle and the maximum triangle can be obtained by adopting the deluo-internal algorithm, and the shape is close to the ideal cellular coverage of the base station. And carrying out Deluo internal triangulation on the polygonal area, and carrying out co-vertex triangle search on the longitude and latitude of the center of the area to obtain a circle of base station. And then, screening the triangular sequence related to the longitude and latitude of the center of the area from the triangular network to obtain at least one potential coverage base station outside the polygonal area. The triangulation algorithm is suitable for the situation that a plurality of polygonal areas and a plurality of base stations exist, and at least two base stations can be determined through the triangulation algorithm. For the case that the number of base stations outside the polygonal area is small, for example, one or two base stations are not needed to be adopted, and whether the base stations are outside the area or not is directly determined according to the distance and azimuth angle range without adopting a triangulation algorithm.
Step 130: and calculating the initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm.
In the embodiment of the invention, the potential coverage base station is taken as a center, and the direction angles from the potential coverage base station to each vertex of the polygonal area are calculated respectively to obtain a direction angle sequence; sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences; clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences; and obtaining the initial azimuth angle range according to the starting point and the ending point. Specifically, the algorithm for searching the tangent is similar to the algorithm for searching the extreme point (the extreme point of the convex polygon), the angles between the longitude and latitude of each vertex of the polygonal area and the longitude and latitude of the base station are calculated respectively, the extreme point of the tangent angle is searched, and the maximum and minimum angle values are the initial azimuth angle range of each potential coverage base station covering the polygonal area. As shown in fig. 5, the vertex sequence of the polygonal area is [ a, b, c, d, e ], the direction angles from the point P (longitude and latitude of a certain potential coverage base station) outside the polygonal area to each vertex of the polygonal area are calculated respectively by taking the point P as the center, a direction angle sequence [ α a,αb,αc,αd,αe ] is obtained, the direction angle sequence is ordered according to the angle size to obtain an ordered direction angle sequence [ α b,αa,αe,αc,αd ], the ordered direction angle sequence is ordered clockwise by a binary ordering method after a person, and the ordering algorithm is as follows: if (α a-αb) <180, α b is a clockwise start, otherwise α a is a clockwise start. And the starting point and the end point of the direction angle sequence are divided into [ alpha b,αd ] by the same method, namely the point P is the tangential angle extreme point of the polygonal area, so that the initial azimuth angle range [ alpha b,αd ] is obtained.
Step 140: and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value.
Wherein the angle offset value is determined according to the distance between the potential coverage base station and the polygonal area.
If the azimuth angle of a certain cell of the point P is within the tangential angle extreme point interval [ α b,αd ], the site cell can be considered as a core coverage cell of the area. On the basis, the embodiment of the invention also sets an angle offset value, namely: on the basis of the initial azimuth, the azimuth range is enlarged to a certain extent by increasing the angle offset value, so that the outer core cell corresponding to the polygonal area can be determined more reasonably from each cell sector of each potential coverage base station.
The calculation process of the angle offset value comprises the following steps: calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm; and generating an angle offset value according to the minimum distance and a dynamic azimuth angle offset algorithm. Specifically, the minimum distance algorithm of the polygon finds the nearest distance between the point and the polygon, and as shown in fig. 6, the boundary lines of the polygon area are respectively [ C 1,C2,C3,C4,C5 ], and the distance between the set point P (the potential coverage base station) and each boundary line of the polygon of the area is recorded as l= [ L 1,L2,L5,L4,L5 ]. An obtuse angle between triangles 1, b 1 and C 1, so the closest distance L 1＝B1 from point P to C 1; for example, the angles between triangle 2, B 1 and A 2 and C 2 are acute angles, so the closest distance L 2＝D2 from point P to C 2 is the same. The distances from the point P to other edges are sequentially calculated, and similarly, the minimum distance L min of the minimum distance of the potential coverage base station from the polygonal area is determined from the distances l= [ L 1,L2,L3,L4,L5 ] from each edge, and is denoted as d.
After the minimum distance d is obtained, a correlation between the distance and the angle offset, namely an angle offset value, is defined through a linear regression equation by combining a preset maximum coverage distance d max and a maximum coverage angle offset alpha max-offset of the base station, and the definition formula is as follows:
And d is the minimum distance between the current potential coverage base station and the polygonal area, and the cell under the current potential coverage base station can be obtained by substituting the minimum distance into the above formula, wherein the angle offset value alpha offset which needs to be increased above the initial azimuth angle range. The maximum coverage distance d max and the maximum coverage angle bias α max-offset of the base station may be flexibly configured according to practical situations, and the embodiment of the present invention is not limited in particular. For example, in one embodiment of the present invention, the maximum coverage distance d max of the base station is 600m. And for the potential coverage base stations with the distance of more than 600m, deleting the potential coverage base stations from the potential coverage base stations if the potential coverage base stations are considered to be far away from the polygonal area, and not serving as core base stations outside the area.
After the angle offset value is obtained, determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value. Specifically, the azimuth range is enlarged according to the angle offset value on the basis of the initial azimuth range. And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range. For example, as shown in fig. 7, the initial azimuth ranges of the potential coverage base station 1 and the polygonal area are [ α1 min,α2max],α1min and α2 max, respectively, which are extreme points of tangential angles of the potential coverage base station 1. It can be seen from the figure that the direction angles of cell 1, cell 2 and cell 3 of the potential coverage base station 1 are not within the initial azimuth angle range [ α1 min,α2max ], but the azimuth angle reasonable range of the potential coverage base station 1 covering the polygonal area is [ α1 min-1offset,1max+1offset ] because the distance d1 of the potential coverage base station 1 from the polygonal area is smaller, and the angle offset value is α1 offset by calculation. As can be seen from the figure, after increasing the angle offset value, the azimuth angles of the cell 2 and the cell 3 can fall into the reasonable range of the azimuth angles, so as to obtain the core coverage cells of the polygonal area of the cell 2 and the cell 3. The distance d2 between the potential coverage base station 2 and the polygonal area is larger, and the calculated angle offset is only alpha 2 offset smaller, so that the reasonable direction angle range of the potential coverage base station 2 covering the polygonal area is [ alpha 2 min-2offset,2max+2offset ], and as can be seen from the figure, all the cell 4, the cell 5 and the cell 6 of the potential coverage base station 2 cannot be included as the core coverage cell of the polygonal area.
By the method, the effective coverage azimuth interval of the first circle of coverage sites outside the polygonal area can be accurately identified, the wireless characteristics of base station coverage are fully considered, the distance relation between the base station and the polygonal area is used as a variable, the effective coverage azimuth range of each base station is dynamically adjusted, and therefore the core coverage cells outside the polygonal area can be accurately identified.
In the embodiment of the invention, after the intra-area core cell and the outer-area core cell corresponding to the polygonal area are obtained, the embodiment of the invention also obtains the occupied cell information corresponding to each building in each polygonal area; and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell. Specifically, as shown in fig. 8, the building is divided into corresponding scene areas, such as residential areas, by using the data of building longitude and latitude, TOP3 occupied cell, average level and the like in the accurate positioning data through a ray algorithm, and a building coverage map based on the average level is presented on a map. Comparing the occupied area of the building TOP3 with the core coverage areas identified in the previous steps, performing color distinction on the layer model according to different conditions, and outputting the data of the potential coverage areas and the actual occupied areas of the residential areas in the standardized format. (1) The cell belongs to a delta relationship site in a de-network, the azimuth angle of the cell is in the effective coverage range, but the cell occupied by the TOP3 which does not belong to a building is marked as 0, and the cell is represented by red in a layer model; (2) The cell belongs to a delta relationship site in a de-network, the azimuth angle of the cell is not in the effective coverage range, the cell occupied by the TOP3 belonging to a building is marked as 1, and the cell is represented by blue in a layer model; (3) The cell belongs to a delta relationship site in a de-network, the azimuth angle of the cell is in the effective coverage range, the cell occupied by the TOP3 belonging to the building is marked as 2, and the cell is represented by green in a layer model; (4) The cell does not belong to the delta site, but belongs to the building TOP3 occupied cell, which is marked 4, and is indicated by yellow in the layer model.
In the embodiment of the invention, after the cell data on the map are obtained, the network of the polygonal area is evaluated according to the cell data; and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result. The identification of the polygonal area core coverage site is the basis for optimizing the wireless structure of the residential area, and is also the basis for evaluating various KPIs and KQI indexes of the residential area network. After the cell data is obtained, each cell can be evaluated according to the distribution condition of the cells, so that the cells are optimized.
According to the embodiment of the invention, the base stations in each polygonal area are determined by a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value. According to the embodiment of the invention, the geographic position of the area is determined through the longitude and latitude sequences of the polygon vertexes of the area, then the attribution relation of the base station in the area is accurately matched through a set of geometric algorithm flow by combining the accurate positioning data of the building MR according to the longitude and latitude of the physical point, the azimuth angle of the cell, the central frequency point of the cell and other data in the engineering parameter data of the base station, and the area core coverage site can be rapidly and accurately identified. In addition, the embodiment of the invention standardizes the regional core site identification algorithm, the identification result can rapidly respond to the dynamic change of the data source, and the intelligent matching of the core coverage sites of any regional scene can be realized.
Fig. 9 is a schematic structural diagram of an area core coverage site identification apparatus according to an embodiment of the present invention. As shown in fig. 9, the apparatus 300 includes:
A first determining module 310, configured to determine base stations in each of the polygonal areas by using a ray method, so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
A second determining module 320, configured to determine at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
a calculating module 330, configured to calculate an initial azimuth angle range of each of the potential coverage base stations covering the polygonal area by using a polygonal tangential algorithm;
A third determining module 340, configured to determine, according to the initial azimuth angle range and the angle offset value, an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
In an alternative manner, before determining the base stations in each polygonal area by a ray method, the method includes:
determining a plurality of polygonal areas based on the frame vertex longitude and latitude sequences corresponding to the geographic position areas;
and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell.
In an alternative manner, the determining, by a ray method, the base station in each polygonal area includes:
Constructing rays from each base station as a starting point;
Determining the number of intersection points of each base station and each side of the polygonal area;
And determining whether each base station is in the polygonal area according to the number of the intersection points.
In an optional manner, the calculating, by a polygon tangential algorithm, an initial azimuth range of each of the potential coverage base stations covering the polygon area includes:
Respectively calculating the direction angles from the potential coverage base station to each vertex of the polygonal area by taking the potential coverage base station as a center to obtain a direction angle sequence;
sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences;
Clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences;
and obtaining the initial azimuth angle range according to the starting point and the ending point.
In an optional manner, the determining, according to the initial azimuth angle range and the angle offset value, an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station includes:
Calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm;
generating an angle offset value according to the minimum distance and a dynamic azimuth offset algorithm;
Determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value;
And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range.
In an optional manner, after determining the out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value, the method further includes:
acquiring the information of occupied cells corresponding to each building in each polygonal area;
and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell.
In an optional manner, after generating the cell data corresponding to the polygonal area on the map according to the occupied cell information, the intra-area core cell and the extra-area core cell, the method further includes:
Evaluating the network of the polygonal area according to the cell data;
and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result.
According to the embodiment of the invention, the base stations in each polygonal area are determined by a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value. According to the embodiment of the invention, the geographic position of the area is determined through the longitude and latitude sequences of the polygon vertices of the area, and then the attribution relation of the base station in the area is accurately matched through a set of geometric algorithm flow by combining the accurate positioning data of the building MR according to the longitude and latitude of the physical point, the azimuth angle of the cell, the central frequency point of the cell and other data in the engineering parameter data of the base station, so that the quick and accurate identification of the area core coverage site can be realized. In addition, the embodiment of the invention standardizes the regional core site identification algorithm, the identification result can rapidly respond to the dynamic change of the data source, and the intelligent matching of the core coverage sites of any regional scene can be realized.
Fig. 10 is a schematic structural diagram of a computer device according to an embodiment of the present invention, and the specific embodiment of the present invention is not limited to the specific implementation of the computer device.
As shown in fig. 10, the computer device may include: a processor 402, a communication interface (Communications Interface) 404, a memory 406, and a communication bus 408.
Wherein: processor 402, communication interface 404, and memory 406 communicate with each other via communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically perform the relevant steps in the above-described embodiment of the method for identifying a coverage site of a regional core.
In particular, program 410 may include program code including computer-executable instructions.
The processor 402 may be a central processing unit CPU, or an Application-specific integrated Circuit ASIC (Application SPECIFIC INTEGRATED Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The one or more processors included in the computer device may be the same type of processor, such as one or more CPUs; but may also be different types of processors such as one or more CPUs and one or more ASICs.
Memory 406 for storing programs 410. Memory 406 may comprise high-speed RAM memory or may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
Program 410 may be specifically invoked by processor 402 to cause a computer device to:
Determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
Determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
Calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
Determining an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
In an alternative manner, before determining the base stations in each polygonal area by a ray method, the method includes:
determining a plurality of polygonal areas based on the frame vertex longitude and latitude sequences corresponding to the geographic position areas;
and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell.
In an alternative manner, the determining, by a ray method, the base station in each polygonal area includes:
Constructing rays from each base station as a starting point;
Determining the number of intersection points of each base station and each side of the polygonal area;
And determining whether each base station is in the polygonal area according to the number of the intersection points.
In an optional manner, the calculating, by a polygon tangential algorithm, an initial azimuth range of each of the potential coverage base stations covering the polygon area includes:
Respectively calculating the direction angles from the potential coverage base station to each vertex of the polygonal area by taking the potential coverage base station as a center to obtain a direction angle sequence;
sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences;
Clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences;
and obtaining the initial azimuth angle range according to the starting point and the ending point.
In an optional manner, the determining, according to the initial azimuth angle range and the angle offset value, an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station includes:
Calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm;
generating an angle offset value according to the minimum distance and a dynamic azimuth offset algorithm;
Determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value;
And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range.
In an optional manner, after determining the out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value, the method further includes:
acquiring the information of occupied cells corresponding to each building in each polygonal area;
and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell.
In an optional manner, after generating the cell data corresponding to the polygonal area on the map according to the occupied cell information, the intra-area core cell and the extra-area core cell, the method further includes:
Evaluating the network of the polygonal area according to the cell data;
and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result.
According to the embodiment of the invention, the base stations in each polygonal area are determined by a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value. According to the embodiment of the invention, the geographic position of the area is determined through the longitude and latitude sequences of the polygon vertices of the area, and then the attribution relation of the base station in the area is accurately matched through a set of geometric algorithm flow by combining the accurate positioning data of the building MR according to the longitude and latitude of the physical point, the azimuth angle of the cell, the central frequency point of the cell and other data in the engineering parameter data of the base station, so that the quick and accurate identification of the area core coverage site can be realized. In addition, the embodiment of the invention standardizes the regional core site identification algorithm, the identification result can rapidly respond to the dynamic change of the data source, and the intelligent matching of the core coverage sites of any regional scene can be realized.
The embodiment of the invention provides a computer readable storage medium, which stores at least one executable instruction, and the executable instruction when running on a computer device, causes the computer device to execute the method for identifying the coverage site of the regional core in any of the method embodiments.
The executable instructions may be particularly useful for causing a computer device to:
Determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
Determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
Calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
Determining an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
In an alternative manner, before determining the base stations in each polygonal area by a ray method, the method includes:
determining a plurality of polygonal areas based on the frame vertex longitude and latitude sequences corresponding to the geographic position areas;
and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell.
In an alternative manner, the determining, by a ray method, the base station in each polygonal area includes:
Constructing rays from each base station as a starting point;
Determining the number of intersection points of each base station and each side of the polygonal area;
And determining whether each base station is in the polygonal area according to the number of the intersection points.
In an optional manner, the calculating, by a polygon tangential algorithm, an initial azimuth range of each of the potential coverage base stations covering the polygon area includes:
Respectively calculating the direction angles from the potential coverage base station to each vertex of the polygonal area by taking the potential coverage base station as a center to obtain a direction angle sequence;
sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences;
Clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences;
and obtaining the initial azimuth angle range according to the starting point and the ending point.
In an optional manner, the determining, according to the initial azimuth angle range and the angle offset value, an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station includes:
Calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm;
generating an angle offset value according to the minimum distance and a dynamic azimuth offset algorithm;
Determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value;
And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range.
In an optional manner, after determining the out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value, the method further includes:
acquiring the information of occupied cells corresponding to each building in each polygonal area;
and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell.
In an optional manner, after generating the cell data corresponding to the polygonal area on the map according to the occupied cell information, the intra-area core cell and the extra-area core cell, the method further includes:
Evaluating the network of the polygonal area according to the cell data;
and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result.
According to the embodiment of the invention, the base stations in each polygonal area are determined by a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude; determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm; calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm; and determining the outer core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value. According to the embodiment of the invention, the geographic position of the area is determined through the longitude and latitude sequences of the polygon vertices of the area, and then the attribution relation of the base station in the area is accurately matched through a set of geometric algorithm flow by combining the accurate positioning data of the building MR according to the longitude and latitude of the physical point, the azimuth angle of the cell, the central frequency point of the cell and other data in the engineering parameter data of the base station, so that the quick and accurate identification of the area core coverage site can be realized. In addition, the embodiment of the invention standardizes the regional core site identification algorithm, the identification result can rapidly respond to the dynamic change of the data source, and the intelligent matching of the core coverage sites of any regional scene can be realized.
The embodiment of the invention provides a regional core coverage site identification device which is used for executing the regional core coverage site identification method.
The embodiment of the invention provides a computer program which can be called by a processor to enable a computer device to execute the method for identifying the coverage site of the regional core in any of the method embodiments.
An embodiment of the present invention provides a computer program product, including a computer program stored on a computer readable storage medium, the computer program including program instructions which, when run on a computer, cause the computer to perform the area core coverage site identification method in any of the method embodiments described above.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general-purpose systems may also be used with the teachings herein. The required structure for a construction of such a system is apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It will be appreciated that the teachings of the present invention described herein may be implemented in a variety of programming languages, and the above description of specific languages is provided for disclosure of enablement and best mode of the present invention.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., the claimed invention requires more features than are expressly recited in each claim.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component, and they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.
Claims (10)
1. A method for identifying regional core coverage sites, the method comprising:
Determining base stations in each polygonal area by a ray method to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
Determining at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
Calculating an initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
Determining an out-of-area core cell corresponding to the polygonal area from each cell sector of each potential coverage base station according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
2. The method of claim 1, wherein prior to determining base stations within each of the polygonal areas by radiography, the method comprises:
determining a plurality of polygonal areas based on the frame vertex longitude and latitude sequences corresponding to the geographic position areas;
and determining the coverage area corresponding to each cell according to the cell longitude and latitude and azimuth information of the cell.
3. The method of claim 1, wherein said determining base stations within each of said polygonal areas by radiography comprises:
Constructing rays from each base station as a starting point;
Determining the number of intersection points of each base station and each side of the polygonal area;
And determining whether each base station is in the polygonal area according to the number of the intersection points.
4. The method of claim 1, wherein said calculating an initial azimuth range for each of said potential coverage base stations to cover said polygonal area by a polygonal tangential algorithm comprises:
Respectively calculating the direction angles from the potential coverage base station to each vertex of the polygonal area by taking the potential coverage base station as a center to obtain a direction angle sequence;
sorting the direction angle sequences according to the angle sizes to obtain sorted direction angle sequences;
Clockwise ordering the ordered direction angle sequences according to a binary ordering method to obtain a starting point and an ending point of the direction angle sequences;
and obtaining the initial azimuth angle range according to the starting point and the ending point.
5. The method according to any one of claims 1-4, wherein the determining, from each cell sector of each of the potential coverage base stations, an out-of-area core cell corresponding to the polygonal area according to the initial azimuth range and the angle offset value includes:
Calculating the minimum distance between the coverage of the potential coverage base station and the polygonal area through a polygonal minimum distance algorithm;
generating an angle offset value according to the minimum distance and a dynamic azimuth offset algorithm;
Determining an azimuth reasonable range of the potential coverage base station covering the polygonal area according to the initial azimuth range and the angle offset value;
And determining the outer core cell corresponding to the polygonal area from all cell sectors of the potential coverage base station according to the azimuth reasonable range.
6. The method according to any one of claims 1-4, wherein after determining the out-of-area core cell corresponding to the polygonal area from each cell sector of each of the potential coverage base stations according to the initial azimuth range and the angle offset value, the method further comprises:
acquiring the information of occupied cells corresponding to each building in each polygonal area;
and generating cell data corresponding to the polygonal area on a map according to the occupied cell information, the regional core cell and the regional outer core cell.
7. The method of claim 6, wherein the generating the cell data corresponding to the polygonal area on the map according to the occupied cell information, the intra-area core cell, and the extra-area core cell further comprises:
Evaluating the network of the polygonal area according to the cell data;
and carrying out fault diagnosis on the network of the polygonal area according to the evaluation result.
8. An area core coverage site identification apparatus, the apparatus comprising:
the first determining module is used for determining base stations in each polygonal area through a ray method so as to obtain at least one intra-area core cell in the polygonal area; the polygonal area is a geographic position area divided according to longitude and latitude;
a second determining module, configured to determine at least one potential coverage base station outside the polygonal area based on a triangulation algorithm;
the calculating module is used for calculating the initial azimuth angle range of each potential coverage base station covering the polygonal area through a polygonal tangent algorithm;
The third determining module is used for determining an out-of-area core cell corresponding to the polygonal area from all cell sectors of all the potential coverage base stations according to the initial azimuth angle range and the angle offset value; the angle offset value is determined from the distance of the potential coverage base station from the polygonal area.
9. A computer device, comprising: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to perform the operations of the area core coverage site identification method according to any one of claims 1 to 7.
10. A computer readable storage medium having stored therein at least one executable instruction which, when executed on a computer device, causes the computer device to perform the operations of the regional core coverage site identification method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211530759.1A CN118139067A (en) | 2022-12-01 | 2022-12-01 | Regional core coverage site identification method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211530759.1A CN118139067A (en) | 2022-12-01 | 2022-12-01 | Regional core coverage site identification method and device and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN118139067A true CN118139067A (en) | 2024-06-04 |
Family
ID=91246217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211530759.1A Pending CN118139067A (en) | 2022-12-01 | 2022-12-01 | Regional core coverage site identification method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118139067A (en) |
-
2022
- 2022-12-01 CN CN202211530759.1A patent/CN118139067A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10034141B2 (en) | Systems and methods to identify home addresses of mobile devices | |
| CN106488400B (en) | Generate the method and device of geography fence | |
| CN107959919B (en) | The localization method of mobile terminal, calculates equipment and storage medium at device | |
| CN112348836B (en) | Method and device for automatically extracting building outline | |
| CN112203293B (en) | Cell over-coverage identification method, device, equipment and computer storage medium | |
| CN111935820B (en) | Positioning implementation method based on wireless network and related equipment | |
| CN107247791B (en) | Parking lot map data generation method and device and machine-readable storage medium | |
| CN116543091B (en) | Visualization method, system, computer equipment and storage medium for power transmission line | |
| CN112328728A (en) | Clustering method and device for mining traveler track, electronic device and storage medium | |
| CN106488401B (en) | Generate the method and device of seamless adjacent geography fence | |
| CN111880144A (en) | Positioning method, device, equipment and storage medium | |
| CN117171288B (en) | Grid map analysis method, device, equipment and medium | |
| CN112020091B (en) | Weak coverage processing method and device based on digitized geographic information | |
| CN118139067A (en) | Regional core coverage site identification method and device and computer equipment | |
| CN117079148A (en) | Urban functional area identification method, device, equipment and medium | |
| CN116528282A (en) | Coverage scene recognition method, device, electronic equipment and readable storage medium | |
| CN110309244B (en) | Target point positioning method and device | |
| CN113074735B (en) | Processing method of map data structure | |
| CN113971348B (en) | Source end power short-term prediction method based on comprehensive energy system | |
| CN108055638A (en) | Obtain method, apparatus, computer-readable medium and the equipment of target location | |
| CN111460057B (en) | POI (Point of interest) coordinate determining method, device and equipment | |
| CN115412928B (en) | Flower arrangement base station identification method and device based on space technology | |
| CN110674843A (en) | Method and system for generating parking lot entity | |
| CN115687805B (en) | Meteorological data query method and system based on position | |
| CN117807518B (en) | Automatic identification method, system and equipment for slot line or shear line on conventional weather diagram |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination |