Method for constructing base station coverage quasi-lattice by fusing measurement data

Abstract

The invention relates to a method for constructing a base station coverage simulation lattice by fusing measurement data. The method comprises the following steps: 1) generating a Delaunay triangular grid by using a stationary point insertion algorithm, and 2) generating a polygonal grid by using a Thiessen polygon algorithm and fusing an MR report of a base station, namely a whole network base station coverage simulation grid. According to the method, the Thiessen polygon algorithm is combined with accurate user report information, so that the accuracy of the coverage range is ensured. Secondly, data are automatically processed through an algorithm, dependence on field measurement is reduced, cost is reduced, and efficiency is improved. And furthermore, a real-time monitoring and updating mechanism is established, so that environment change and base station parameter adjustment can be quickly responded, the coverage range of the base station can be automatically recalculated and updated, and the timeliness of a drawing result is kept, thereby meeting dynamic network planning and optimization requirements. And finally, a user and an operator can conveniently inquire the base station information, carry out parameter adjustment and check the change of the coverage area in real time, so that the user experience and the convenience of network management are improved.

Description

Technical Field

[0001] The present invention belongs to the field of communication technology, and in particular relates to a method for fusing measurement data to construct a base station coverage pseudo grid. Background Art

[0002] Traditional methods based on empirical models often have poor accuracy and do not fully consider the actual terrain, buildings and other environmental factors, resulting in inaccurate definition of base station coverage. Secondly, although some field measurement methods can obtain certain actual data, they are costly and inefficient. Furthermore, existing technologies lack dynamic adaptability and are difficult to respond to environmental changes and base station parameter adjustments in real time. For example, when there are changes in terrain, construction or demolition of new buildings, changes in base station transmission power, etc., the coverage cannot be updated in time, causing network planning and optimization to lag behind. Finally, existing technologies are insufficient in visualization and interactivity, and it is difficult to provide an intuitive and clear display of base station coverage, which is not convenient for users and operators to understand and analyze, and lacks functions that facilitate users to query specific base station information, adjust parameters and other interactive operations.

[0003] 1. Method based on empirical model: The coverage radius of the base station is estimated by theoretically calculating the base station's transmission power, antenna height and other parameters, combined with certain empirical formulas and models; then an approximate circular coverage area is drawn with the base station as the center and the estimated radius as the range.

[0004] Disadvantages of this method: (1) Over-reliance on empirical formulas and theoretical calculations. It is difficult to accurately consider the impact of factors such as terrain, buildings, and climate in the actual environment on signal propagation, resulting in low coverage accuracy. (2) It cannot well reflect the changes in signal strength at different locations and cannot accurately determine the boundaries of base station coverage.

[0005] 2. Field test method: By performing a large number of signal strength measurements in the actual environment, using professional measurement equipment to collect base station signal strength data at different locations, and determining the coverage range of the base station based on the preset signal strength threshold.

[0006] Disadvantages of this method: (1) Field measurement requires a lot of manpower, material resources and time costs; (2) The measurement results are limited by the distribution and number of measurement points, making it difficult to fully and accurately reflect the actual coverage of base stations; (3) The measurement results can only reflect the coverage situation at a specific point in time and cannot dynamically adapt to environmental changes and base station parameter adjustments. Summary of the invention

[0007] In view of the problems existing in the prior art, the object of the present invention is to provide a technical solution for a method of fusing measurement data to construct a base station coverage grid.

[0008] The method for fusing measurement data to construct a base station coverage grid is characterized by comprising the following steps: 1) Generate Delaunay triangle mesh using stationary point insertion algorithm 1.1) Sort the longitude and latitude of all base stations from small to large according to longitude or latitude, and store them in the list indices; 1.2) Generate a super triangle, make all base stations inside the super triangle, put the super triangle into the list temp triangles, and also store it in the list triangles; 1.3) Generate a Delaunay triangle mesh for the base station using the station point insertion algorithm; 2) Use the Thiessen polygon algorithm to fuse the MR reports of the base stations to generate a polygonal grid, that is, a pseudo-grid covering the base stations of the entire network. 2.1) For each triangle in the generated Delaunay triangular mesh, calculate the coverage center point of the triangle; 2.2) Find the adjacent triangles of each base station; 2.3) Sort the adjacent triangles of each base station in a clockwise or counterclockwise order; 2.4) Connect the coverage center points of each adjacent triangle of the base station and save them, and you will get the Thiessen polygon, which is the coverage grid of the base station.

[0009] The method for fusing measurement data to construct a base station coverage pseudo-grid is characterized in that: using a stationary point insertion algorithm, the process of generating a Delaunay triangular mesh for the base station is as follows: 1.3.1) Traverse the sorted base stations, that is, traverse the list indices; 1.3.1.1) Create edge buffer array; 1.3.1.2) Traverse each triangle in the list temp triangles; 1.3.1.2.1) Calculate the center and radius of the circumscribed circle of the currently traversed temporary triangle; 1.3.1.2.2) If the currently traversed base station is on the right side of the circumscribed circle: the temporary triangle is a Delaunay triangle, which is saved in the list triangles and removed from the list temp triangles; return to 1.3.1.2); 1.3.1.2.3) If the currently traversed base station is within the circumscribed circle: the temporary triangle is not a Delaunay triangle, and the three edges are saved to the edge buffer array and removed from the list temp triangles; return to 1.3.1.2); 1.3.1.2.4) For other conditions, no processing is performed; return to 1.3.1.2); 1.3.1.3) De-duplicate the edge buffer array; 1.3.1.4) Combine the edges in the edge buffer array and the currently traversed base station into several triangles and save them to the list temp triangles; return to 1.3.1); 1.3) Merge the list triangles with the list temp triangles; 1.4) Delete the super triangle and the triangles related to the super triangle.

[0010] The method for fusing measurement data to construct a base station coverage pseudo-grid is characterized in that: for each triangle in the generated Delaunay triangular mesh, the process of calculating the coverage center point of the triangle is as follows: 2.1.1) First calculate the coverage center point of a vertex of the triangle and filter out the MR reports of this base station within the triangle; 2.1.2) Calculate the distance from the latitude and longitude in the MR report to the base station, and then count the number of distance ranges; 2.1.3) Calculate the arithmetic average of the reported longitudes and latitudes with the largest number of statistics to calculate the coverage center of this base station; 2.1.4) Follow the steps in 2.1.1) to calculate the coverage centers of the other two points of the triangle; 2.1.5) Take the arithmetic average of the coverage centers of the three vertices of this triangle and calculate the coverage center point of this triangle.

[0011] The present invention uses the Thiessen polygon algorithm combined with accurate user-reported information to ensure the accuracy of coverage. Secondly, the algorithm automatically processes data to reduce reliance on field measurements, reduce costs and improve efficiency. Furthermore, a real-time monitoring and update mechanism is established to quickly respond to environmental changes and base station parameter adjustments, automatically recalculate and update base station coverage, and maintain the timeliness of drawing results to meet dynamic network planning and optimization needs. Finally, it is convenient for users and operators to query base station information, adjust parameters and view changes in coverage in real time, thereby improving user experience and the convenience of network management. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 A schematic diagram of processing a base station P; Figure 2 Schematic diagram to determine how base station P connects to other base stations; Figure 3 Schematic diagram for deleting AB edge; Figure 4 To form a triangle diagram; Figure 5 This is a schematic diagram of point A with 5 adjacent triangles; Figure 6 This is the obtained Thiessen polygon effect diagram; Figure 7 It is a flow chart of the present invention. DETAILED DESCRIPTION

[0013] The present invention will be further described below in conjunction with the accompanying drawings: A method for fusing measurement data to construct a base station coverage grid, such as Figure 7 As shown, the following steps are included: 1) Generate Delaunay triangle mesh using stationary point insertion algorithm 1.1) Sort the longitude and latitude of all base stations from small to large according to longitude or latitude, and store them in the list indices; 1.2) Generate a super triangle, make all base stations inside the super triangle, put the super triangle into the list temp triangles, and also store it in the list triangles; 1.3) Use the station point insertion algorithm to generate a Delaunay triangle mesh for the base station. The process is as follows: 1.3.1) Traverse the sorted base stations, that is, traverse the list indices, such as Figure 1 ; 1.3.1.1) Create edge buffer array; 1.3.1.2) Traverse each triangle in the list temp triangles; 1.3.1.2.1) Calculate the center and radius of the circumscribed circle of the currently traversed temporary triangle; 1.3.1.2.2) If the currently traversed base station is on the right side of the circumscribed circle: then the temporary triangle is a Delaunay triangle, saved to the list triangles, and removed from the list temp triangles, such as Figure 2 ; Return to 1.3.1.2); 1.3.1.2.3) If the currently traversed base station is within the circumscribed circle: the temporary triangle is not a Delaunay triangle, and the three edges are saved to the edge buffer array and removed from the list temp triangles, such as Figure 2 ; Return to 1.3.1.2); 1.3.1.2.4) For other conditions, no processing is performed; return to 1.3.1.2); 1.3.1.3) De-duplicate the edge buffer array, such as Figure 3 ; 1.3.1.4) Combine the edges in the edge buffer array and the currently traversed base station into several triangles and save them in the list temp triangles; Figure 4 , return 1.3.1); 1.3) Merge the list triangles with the list temp triangles; 1.4) Delete the super triangle and the triangles related to the super triangle.

[0014] 2) Use the Thiessen polygon algorithm to fuse the MR reports (Measurement Report, referred to as MR, which records the measurement data between mobile devices such as mobile phones and base stations, including signal strength, quality, mobile device location and other information) of base stations to generate polygonal grids, that is, the pseudo-grid of base station coverage of the entire network. 2.1) For each triangle in the generated Delaunay triangular mesh, calculate the coverage center point of the triangle; the process is as follows: 2.1.1) First calculate the coverage center point of a vertex of the triangle (i.e., the base station), and filter out the MR reports of this base station within the triangle; 2.1.2) Calculate the distance from the latitude and longitude in the MR report to the base station, and then count the number of distance ranges; 2.1.3) Calculate the arithmetic average of the reported longitudes and latitudes with the largest number of statistics to calculate the coverage center of this base station; 2.1.4) Follow the steps in 2.1.1) to calculate the coverage centers of the other two points of the triangle; 2.1.5) Take the arithmetic average of the coverage centers of the three vertices of the triangle and calculate the coverage center point of the triangle; 2.2) Find the adjacent triangles of each base station; Figure 5 ; 2.3) Sort the adjacent triangles of each base station in a clockwise or counterclockwise order; 2.4) Connect the coverage center points of each adjacent triangle of the base station and save them, and you will get the Thiessen polygon, which is the pseudo-grid of the base station, such as Figure 6 .

[0015] Key points of the invention 1.1. Algorithm fusion innovation: The core innovation of this proposal is to combine the Thiessen polygon algorithm with the MR report. The Thiessen polygon algorithm can divide the space according to the base station location, while the MR report provides actual user measurement data. The fusion of the two can more accurately depict the base station coverage. This innovative combination can give full play to the advantages of each and improve the accuracy and reliability of coverage mapping.

[0016] 1.2. Dynamic adaptability: The proposal takes into account the dynamic changes of the actual network environment. As the user moves, base station parameters are adjusted, and environmental factors change, the data reported by the MR will be continuously updated. By using this dynamic data source and combining it with the flexibility of the Thiessen polygon algorithm, the base station coverage can be updated in real time, improving the adaptability and stability of the network.

[0017] The present invention intends to protect the following points: 2.1. Algorithm fusion technology: Protect the unique technical method of combining Thiessen polygon algorithm with MR report. Prevent other competitors from using the same or similar algorithm fusion method to draw base station coverage without authorization, and ensure the innovation and competitive advantage of this proposal.

[0018] 2.2. Dynamic update mechanism: Protect the real-time update mechanism of base station coverage. Ensure that when the environment changes and base station parameters are adjusted, this proposal can quickly and accurately update the coverage, providing timely support for network planning and optimization. This includes the protection of key links such as data monitoring and algorithm trigger updates.

[0019] Advantages of the present invention: 1. Stronger dynamic adaptability Existing technologies may have difficulty responding to environmental changes and base station parameter adjustments in real time, resulting in delayed updates of coverage. This application proposal utilizes the real-time nature of MR reports, combined with the flexibility of the Thiessen polygon algorithm, to quickly perceive and adapt to various changes. When the user moves, the base station transmit power is adjusted, or new obstacles appear, the system can update the base station coverage in a timely manner, ensuring that network planning and optimization are always based on the latest actual conditions.

[0020] 2. Higher accuracy By combining the Thiessen polygon algorithm with the MR report, this application proposal can more accurately divide the base station coverage area. The Thiessen polygon algorithm can perform spatial division according to the base station location, and the actual measurement data in the MR report can further refine and correct the boundaries of the coverage area, making the drawn base station coverage area more consistent with the actual situation and reducing errors and uncertainties.

Claims

1. A method for fusing measurement data to construct a base station coverage grid, characterized by comprising the following steps: 1) Generate Delaunay triangle mesh using stationary point insertion algorithm 1.1) Sort the longitude and latitude of all base stations from small to large according to longitude or latitude, and store them in the list indices; 1.2) Generate a super triangle, make all base stations inside the super triangle, put the super triangle into the list temp triangles, and also store it in the list triangles; 1.3) Generate a Delaunay triangle mesh for the base station using the station point insertion algorithm; 2) Use the Thiessen polygon algorithm to fuse the MR reports of the base stations to generate a polygonal grid, that is, a pseudo-grid covering the base stations of the entire network. 2.1) For each triangle in the generated Delaunay triangular mesh, calculate the coverage center point of the triangle; 2.2) Find the adjacent triangles of each base station; 2.3) Sort the adjacent triangles of each base station in a clockwise or counterclockwise order; 2.4) Connect the coverage center points of each adjacent triangle of the base station and save them, and you will get the Thiessen polygon, which is the coverage grid of the base station.

2. The method for constructing a base station coverage grid by fusing measurement data according to claim 1, characterized in that: Using the station point insertion algorithm, the process of generating a Delaunay triangle mesh for the base station is as follows: 1.3.1) Traverse the sorted base stations, that is, traverse the list indices; 1.3.1.1) Create edge buffer array; 1.3.1.2) Traverse each triangle in the list temp triangles; 1.3.1.2.1) Calculate the center and radius of the circumscribed circle of the currently traversed temporary triangle; 1.3.1.2.2) If the currently traversed base station is on the right side of the circumscribed circle: the temporary triangle is a Delaunay triangle, saved to the list triangles, and removed from the list temp triangles; Return 1.3.1.2); 1.3.1.2.3) If the currently traversed base station is within the circumscribed circle: the temporary triangle is not a Delaunay triangle, and the three edges are saved to the edge buffer array and removed from the list temp triangles; return to 1.3.1.2); 1.3.1.2.4) For other conditions, no processing is performed; return to 1.3.1.2); 1.3.1.3) De-duplicate the edge buffer array; 1.3.1.4) Combine the edges in the edge buffer array and the currently traversed base station into several triangles and save them in the list temp triangles; Return to 1.3.1); 1.3) Merge the list triangles with the list temp triangles; 1.4) Delete the super triangle and the triangles related to the super triangle.

3. The method for constructing a base station coverage grid by fusing measurement data according to claim 1, characterized in that: For each triangle in the generated Delaunay triangular mesh, the process of calculating the coverage center point of the triangle is as follows: 2.1.1) First calculate the coverage center point of a vertex of the triangle and filter out the MR reports of this base station within the triangle; 2.1.2) Calculate the distance from the latitude and longitude in the MR report to the base station, and then count the number of distance ranges; 2.1.3) Calculate the arithmetic average of the reported longitudes and latitudes with the largest number of statistics to calculate the coverage center of this base station; 2.1.4) Follow the steps in 2.1.1) to calculate the coverage centers of the other two points of the triangle; 2.1.5) Take the arithmetic average of the coverage centers of the three vertices of this triangle and calculate the coverage center point of this triangle.

Images