Base station site selection method and device, equipment and storage medium

By using three-dimensional model and genetic algorithm in base station site selection combined with line-of-sight probability model and ray tracing algorithm, the problem of inaccurate reception power in micro-cellular and pico-cellular systems is solved, improving the accuracy of coverage and simplifying the site selection process .

CN118921675AActive Publication Date: 2024-11-08WUHAN UNIV

Patent Information

Application Number
CN202410936428.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-12
Publication Date
2024-11-08
Estimated Expiration
2044-07-12

AI Technical Summary

Technical Problem

The existing base station site selection method calculates the sampling point reception power in the micro-cell and micro-cell systems, which leads to inaccurate coverage and large calculations, which complicates the base station site selection process.

Method used

The three-dimensional model and genetic algorithm are used to combine the line-of-sight probability model and the ray tracing algorithm to determine the coverage of the base station through the genetic algorithm, consider the impact of building occlusion on the received power, and simplify the base station site selection process.

Benefits of technology

It improves the accuracy of the received power of the sampling point and the accuracy of coverage, simplifies the base station site selection process, and reduces the computational complexity.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118921675A_ABST
    Figure CN118921675A_ABST
Patent Text Reader

Abstract

Disclosed are a base station site selection method, apparatus and device, and a storage medium, which belong to the technical field of communications, the method comprising: modeling a target area to obtain a three-dimensional model of the target area, the target area comprising a plurality of sampling points and a plurality of positions for placing base stations; a genetic algorithm is adopted, under the condition that the coverage rate of the k base stations is a first coverage rate, the positions where the k base stations are placed are determined, each chromosome in the genetic algorithm is used for indicating that the k base stations are placed at k different positions respectively, and the k different positions are any k positions in the multiple positions; the coverage rate is used for indicating the proportion of the sampling point whose receiving power is greater than or equal to a first power threshold in the plurality of sampling points, the first coverage rate is the maximum coverage rate of the k base stations in the target area, and the three-dimensional model is used for determining the receiving power of each sampling point. According to the method, the accuracy of the determined receiving power can be improved, and the site selection process of the base station is simplified.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a base station site selection method, device, equipment and storage medium. Background Art

[0002] A cellular cell refers to the area covered by a base station or a part of a base station (sector antenna) in a cellular mobile communication system, where a mobile station can reliably communicate with the base station through a wireless channel. With the development of technology, the radius of the cellular cell continues to decrease, and microcells and picocells have emerged. For microcell systems or picocell systems, base station site selection is very important.

[0003] In the related art, the base station site selection method includes: determining multiple base station candidate points and sampling points; calculating the receiving power of each sampling point when the base station is located at each base station candidate point to determine the coverage rate of the base station when the base station is located at each base station candidate point, and taking the base station candidate point with the highest coverage rate as the site selection of the base station.

[0004] However, when the above-mentioned base station site selection method is used for base station site selection, the calculated receiving power of the sampling point is not accurate enough, which leads to inaccurate calculated coverage; and the coverage rate needs to be calculated once for each base station candidate point. When there are many base stations, base station candidate points and sampling points, the amount of calculation is large, which makes the base station site selection process complicated. Summary of the invention

[0005] The present disclosure provides a base station site selection method, apparatus, device and storage medium, which can improve the accuracy of the determined received power and simplify the base station site selection process. The technical solution includes at least the following solutions:

[0006] In a first aspect, a base station site selection method is provided, comprising: modeling a target area to obtain a three-dimensional model of the target area, the target area comprising multiple sampling points and multiple positions for placing base stations; using a genetic algorithm to determine the positions at which the k base stations are placed when the coverage rate of the k base stations is a first coverage rate, each chromosome in the genetic algorithm is used to indicate that the k base stations are placed in k different positions, respectively, the k different positions are any k positions among the multiple positions, the coverage rate is used to indicate the proportion of sampling points whose receiving power is greater than or equal to a first power threshold in the multiple sampling points, the first coverage rate is the maximum coverage rate of the k base stations in the target area, and the three-dimensional model is used to determine the receiving power of each sampling point; wherein k is a positive integer and k is greater than 0.

[0007] Optionally, when the genetic algorithm is used to determine the coverage rate of k base stations as the first coverage rate, the positions at which the k base stations are placed include: determining the first receiving power of each sampling point when the k base stations are placed at the positions of the k base stations indicated by the first chromosome based on the three-dimensional model, the line of sight probability model and the ray tracing algorithm, where the first chromosome is any chromosome in any iteration; determining the coverage rate of the first chromosome based on the magnitude of the first receiving power of each sampling point and the power threshold, where the coverage rate of the first chromosome is the fitness value of the first chromosome.

[0008] Optionally, the determining, based on the three-dimensional model, the line of sight probability model and the ray tracing algorithm, of the first received power of each sampling point when k base stations are placed at the positions of the k base stations indicated by the first chromosome includes: determining, based on the three-dimensional model and the line of sight probability model, the type of line of sight path from each base station to each sampling point, the types of line of sight paths including direct line of sight paths, reflected line of sight paths and diffracted line of sight paths; determining, based on the ray tracing algorithm, the type of line of sight path and the three-dimensional model, the line of sight path from each base station to each sampling point; determining the path loss of each line of sight path; and determining the first received power of each sampling point based on the path loss of each line of sight path.

[0009] Optionally, when the genetic algorithm is used to determine that the coverage of k base stations is a first coverage rate, the positions at which the k base stations are placed also include: for the crossover in any iteration, a fourth chromosome is generated based on the second chromosome and the third chromosome, the second chromosome and the third chromosome are two different chromosomes generated in the previous iteration of any iteration, and the positions at which the k base stations indicated by the fourth chromosome are the average of the positions at which the k base stations indicated by the second chromosome and the third chromosome are placed.

[0010] Optionally, the transmission power of each base station is the same, and the sum of the transmission powers of the k base stations is the second power threshold.

[0011] Optionally, the method also includes: when the first coverage rate is less than the coverage rate threshold, determining based on a genetic algorithm the positions at which the k+1 base stations are placed when the coverage rate of k+1 base stations is a second coverage rate, the second coverage rate being the maximum coverage rate of the k+1 base stations in the target area, and the sum of the transmission powers of the k+1 base stations being the second power threshold.

[0012] Optionally, the method also includes: when the first coverage rate is greater than the coverage rate threshold, reducing the transmission power of multiple base stations so that the sum of the transmission powers of the multiple base stations is less than the second power threshold; based on the reduced transmission power of the multiple base stations, using a genetic algorithm to determine the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is a third coverage rate, and the third coverage rate is the maximum coverage rate of the multiple base stations after the transmission power is reduced; if the third coverage rate is equal to the coverage rate threshold, using the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is the third coverage rate as the site selection for the multiple base stations.

[0013] Optionally, the modeling of the target area to obtain a three-dimensional model of the target area includes: acquiring a first aerial image set, the first aerial image set including multiple aerial images of the target area; determining first point cloud data of the target area based on the multiple aerial images; performing semantic segmentation on the first point cloud data; performing incremental reconstruction on the first point cloud data after the semantic segmentation to obtain second point cloud data; performing surface reconstruction based on the second point cloud data to obtain the three-dimensional model

[0014] In the second aspect, a base station site selection device is also provided, including: a modeling module, used to model the target area and obtain a three-dimensional model of the target area, the target area including multiple sampling points and multiple positions for placing base stations; a genetic algorithm module, used to use a genetic algorithm to determine the positions where the k base stations are placed when the coverage rate of the k base stations is a first coverage rate, each chromosome in the genetic algorithm is used to indicate that the k base stations are placed in k different positions respectively, and the k different positions are any k positions among the multiple positions, the coverage rate is used to indicate the proportion of sampling points whose receiving power is greater than or equal to a first power threshold in the multiple sampling points, the first coverage rate is the maximum coverage rate of the k base stations in the target area, and the three-dimensional model is used to determine the receiving power of each sampling point; wherein k is a positive integer and k is greater than 0.

[0015] Optionally, the genetic algorithm module is also used to determine the first receiving power of each sampling point when k base stations are placed at the positions of k base stations indicated by the first chromosome based on the three-dimensional model, the line of sight probability model and the ray tracing algorithm, and the first chromosome is any chromosome in any iteration; based on the first receiving power of each sampling point and the size of the power threshold, determine the coverage rate of the first chromosome, and the coverage rate of the first chromosome is the fitness value of the first chromosome.

[0016] Optionally, the genetic algorithm module is also used to determine the type of line-of-sight path from each base station to each sampling point based on the three-dimensional model and the line-of-sight probability model, the types of line-of-sight paths including direct line-of-sight paths, reflected line-of-sight paths and diffracted line-of-sight paths; determine the line-of-sight path from each base station to each sampling point based on the ray tracing algorithm, the type of line-of-sight path and the three-dimensional model; determine the path loss of each line-of-sight path; and determine the first received power of each sampling point based on the path loss of each line-of-sight path.

[0017] Optionally, the genetic algorithm module is also used to generate a fourth chromosome based on the second chromosome and the third chromosome for the crossover in any iteration, the second chromosome and the third chromosome are two different chromosomes generated in the previous iteration of any iteration, and the positions of the k base stations indicated by the fourth chromosome are the average of the positions of the k base stations indicated by the second chromosome and the third chromosome.

[0018] Optionally, the genetic algorithm module is also used to determine, based on a genetic algorithm, the positions at which the k+1 base stations are placed when the coverage of the k+1 base stations is a second coverage rate when the first coverage rate is less than a coverage rate threshold, the second coverage rate being the maximum coverage rate of the k+1 base stations in the target area, and the sum of the transmission powers of the k+1 base stations being the second power threshold.

[0019] Optionally, the genetic algorithm module is also used to reduce the transmission power of multiple base stations when the first coverage rate is greater than the coverage rate threshold, so that the sum of the transmission powers of the multiple base stations is less than the second power threshold; based on the reduced transmission powers of the multiple base stations, a genetic algorithm is used to determine the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is a third coverage rate, and the third coverage rate is the maximum coverage rate of the multiple base stations after the transmission powers are reduced; if the third coverage rate is equal to the coverage rate threshold, the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is the third coverage rate are used as the site selection for the multiple base stations.

[0020] Optionally, the modeling module is also used to obtain a first aerial image set, which includes multiple aerial images of the target area; based on the multiple aerial images, determine first point cloud data of the target area; perform semantic segmentation on the first point cloud data; perform incremental reconstruction on the first point cloud data after the semantic segmentation to obtain second point cloud data; and perform surface reconstruction based on the second point cloud data to obtain the three-dimensional model.

[0021] In a third aspect, a computer device is also provided, comprising: a memory and a processor, wherein at least one computer program is stored in the memory, and the at least one computer program is loaded and executed by the processor, thereby executing the base station site selection method described in the above embodiment.

[0022] In a fourth aspect, a computer-readable storage medium is also provided, wherein at least one computer program is stored in the computer-readable storage medium, and the at least one computer program is loaded and executed by a processor, thereby executing the base station site selection method described in the above embodiment.

[0023] In a fifth aspect, a computer program product is provided, comprising a computer program / instruction, wherein when the computer program / instruction is executed by a processor, the method described in the first aspect is implemented.

[0024] The beneficial effects brought by the technical solution provided by the embodiments of the present disclosure include at least:

[0025] In the disclosed embodiment, the received power of each sampling point is calculated by using the three-dimensional model of the target area, and the influence of the building's shielding on the intensity of the received power of the sampling point is taken into account, thereby improving the accuracy of the calculated received power of the sampling point and the accuracy of the calculated coverage. In addition, since a genetic algorithm is used for base station site selection, which is a typical random algorithm, when a base station site is selected by a genetic algorithm, it is not necessary to calculate the coverage for each location, which greatly simplifies the process of base station site selection. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0027] Figure 1 A flow chart of a base station site selection method provided by an exemplary embodiment of the present disclosure is shown;

[0028] Figure 2 A flow chart of a base station site selection method provided by another exemplary embodiment of the present disclosure is shown;

[0029] Figure 3 Flowchart for modeling the target area;

[0030] Figure 4 Schematic diagram of the line of sight probability model;

[0031] Figure 5 This is a schematic diagram of the types of sight paths;

[0032] Figure 6 A schematic structural diagram of a base station site selection device provided by an exemplary embodiment of the present disclosure is shown;

[0033] Figure 7 It is a schematic diagram of the structure of a computer device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0034] Unless otherwise defined, the technical or scientific terms used herein shall have the usual meanings understood by persons of ordinary skill in the field to which the present disclosure belongs. The words "first", "second", "third" and similar words used in the patent application specification and claims of the present disclosure do not indicate any order, quantity or importance, but are only used to distinguish different components. Similarly, words such as "one" or "one" do not indicate a quantitative limitation, but rather indicate the presence of at least one. Words such as "include" or "comprise" and similar words mean that the elements or objects appearing before "include" or "comprises" cover the elements or objects listed after "include" or "comprises" and their equivalents, and do not exclude other elements or objects.

[0035] In order to make the objectives, technical solutions and advantages of the present disclosure more clear, the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

[0036] To facilitate understanding of the embodiments of the present disclosure, microcells and picocells are briefly described below.

[0037] At present, due to business needs, people have proposed micro-cell technology for places that cannot be covered by cellular cells. Compared with micro-cells, ordinary cellular cells are called macro-cells. Micro-cells have low transmission power and small coverage. They are generally used in places such as basements and tunnels that cannot be covered by macro-cells as a supplement to wireless coverage. Based on the same principle, there is also pico-micro-cell technology, which has even lower power and is usually used to cover communication "hotspots" such as conference rooms.

[0038] Macrocells do not need to consider the site planning of base stations, because the base stations of macrocells are often set up at high places, and the wireless signals they transmit are transmitted from high places to low places without being blocked. Microcells and picocells are usually set up at low places, such as in the middle of a city, which means that the transmitting antennas of microcell or picocell base stations may be lower than the surrounding buildings. The obstruction of buildings will greatly hinder the transmission of wireless signals, resulting in a significant reduction in the intensity of the received power at the sampling points blocked by the buildings.

[0039] The base station site selection method in the related art does not consider the impact of building shielding on the intensity of the received power at the sampling point, and the calculated received power at the sampling point is not accurate enough, which in turn leads to inaccurate calculated coverage.

[0040] Figure 1 A flowchart of a base station site selection method provided by an exemplary embodiment of the present disclosure is shown. Figure 1 , the method comprising:

[0041] In step 101, a target area is modeled to obtain a three-dimensional model of the target area.

[0042] The target area includes multiple sampling points and multiple locations for placing base stations.

[0043] The target area is an area where microcell or picocell base station site selection is required. The location of the target area can be set as required, and the embodiment of the present disclosure does not limit this.

[0044] Among the multiple positions for placing base stations, each position can be represented by (x, y, z) three-dimensional coordinates, where x is the x-axis coordinate of a certain position in the world coordinate system, y is the y-axis coordinate of a certain position in the world coordinate system, and z is the z-axis coordinate of a certain position in the world coordinate system.

[0045] Optionally, multiple sampling points and multiple locations for placing base stations are set according to actual needs, which is not limited in the embodiments of the present disclosure.

[0046] For example, the multiple locations for placing the base station may be all locations in the target area except for the locations where the base station cannot be placed.

[0047] In step 102, a genetic algorithm is used to determine the positions where the k base stations are placed when the coverage rate of the k base stations is a first coverage rate.

[0048] Each chromosome in the genetic algorithm is used to indicate that k base stations are placed in k different positions, and the k different positions are any k positions in multiple positions. The coverage rate is used to indicate the proportion of sampling points whose receiving power is greater than or equal to the first power threshold in multiple sampling points. The first coverage rate is the maximum coverage rate of k base stations in the target area. The three-dimensional model is used to determine the receiving power of each sampling point. k is a positive integer, and k is greater than 0.

[0049] Optionally, in an initial situation, for example, when performing base station site planning for a target area for the first time, k is equal to 1.

[0050] Optionally, the transmission power of each base station is the same, and the sum of the transmission powers of k base stations is the second power threshold.

[0051] In the embodiment of the present disclosure, when k is equal to 1, there is only one base station, and the transmission power of the base station is the second power threshold.

[0052] When k is greater than or equal to 2, there are k base stations, the transmission power of each base station is the same and the sum of the transmission powers of the k base stations is the second power threshold, that is, the transmission power of each base station is Here, R max That is the second power threshold.

[0053] Each chromosome in the genetic algorithm is used to indicate that k base stations are placed at k different positions, that is, each chromosome includes the three-dimensional coordinates of k positions, and each of the k positions in each chromosome is used to place a base station. Since when k is greater than or equal to 2, the transmission power of each base station is the same, it can be regarded as that each base station is the same, so when encoding or decoding the chromosome, there is no need to consider the order relationship between the k positions. The disclosed embodiment does not limit the specific chromosome encoding rules, and it is only necessary to satisfy that each chromosome can indicate k different positions.

[0054] If the received power of a certain sampling point is greater than or equal to the first power threshold, it means that the received power of the sampling point is relatively strong, so the sampling point can well receive the wireless signal sent by the base station. If the received power of a certain sampling point is less than the first power threshold, it means that the received power of the sampling point is relatively weak, that is, it is a bad receiving point. The coverage rate is the proportion of sampling points whose received power is greater than or equal to the first power threshold among all sampling points, which can be expressed by formula (1).

[0055]

[0056] In formula (1), f t is the coverage rate, N is the number of all sampling points, and n is the number of received bad points.

[0057] In the disclosed embodiment, the solution target of the genetic algorithm is to maximize the coverage rate, so the first coverage rate is the coverage rate when k base stations are respectively located in the k positions indicated by the optimal solution of the genetic algorithm.

[0058] In the disclosed embodiment, the received power of each sampling point is calculated by using the three-dimensional model of the target area, and the influence of the building's shielding on the intensity of the received power of the sampling point is taken into account, thereby improving the accuracy of the calculated received power of the sampling point and the accuracy of the calculated coverage. In addition, since a genetic algorithm is used for base station site selection, which is a typical random algorithm, when a base station site is selected by a genetic algorithm, it is not necessary to calculate the coverage for each location, which greatly simplifies the process of base station site selection.

[0059] Figure 2 A flowchart of a base station site selection method provided by an exemplary embodiment of the present disclosure is shown. The method can be executed by a computer device. Figure 2 , the method comprising:

[0060] In step 201, a target area is modeled to obtain a three-dimensional model of the target area.

[0061] The relevant contents of the target area refer to the aforementioned step 101, and the detailed description is omitted here.

[0062] Figure 3 A flowchart for modeling the target area, such as Figure 3 As shown, optionally, step 201 includes the following steps ae:

[0063] Step a: acquiring a first aerial image set.

[0064] The first aerial image set includes multiple aerial images of the target area. Exemplarily, the first aerial image set can be obtained by aerial photography of the target area.

[0065] Step b: determining first point cloud data of the target area based on multiple aerial images.

[0066] Optionally, the first point cloud data of the target area is determined based on multiple aerial images by means of Sfm (Structure from motion).

[0067] Sfm is a traditional 3D reconstruction method that performs 3D reconstruction based on images from multiple perspectives. 3D information is inferred from multiple 2D images in a time series. The first point cloud data obtained by Sfm belongs to sparse point cloud data. The number of points in sparse point cloud data is small, and the distance between points is large. Therefore, the accuracy is insufficient. 3D modeling cannot be performed directly through sparse point cloud data, and subsequent processing of sparse point cloud data is required.

[0068] There are many methods for implementing Sfm in the related technologies, so detailed description is omitted here.

[0069] Step c: performing semantic segmentation on the first point cloud data.

[0070] After obtaining the first point cloud data, it is impossible to determine which point cloud data in the first point cloud data belong to the same building or object. Therefore, it is necessary to perform semantic segmentation on the first point cloud data. This step is equivalent to classifying the point cloud data and assigning labels to the point cloud data based on the classification. The labels of the same type of point cloud data are the same. The same type of point cloud data is used to describe the same building or object.

[0071] There are many methods for implementing semantic segmentation of the first point cloud data in the related art, and detailed description is omitted here.

[0072] Step d: incrementally reconstruct the first point cloud data after semantic segmentation to obtain second point cloud data.

[0073] Incremental reconstruction of the first point cloud data is essentially a process of incremental processing of sparse point cloud data. The second point cloud data obtained in this way belongs to dense point cloud data, and three-dimensional modeling can be performed based on the dense point cloud data.

[0074] There are many methods for implementing incremental reconstruction in the related art, and the detailed description is omitted here.

[0075] Step e: reconstructing the surface based on the second point cloud data to obtain a three-dimensional model.

[0076] Optionally, step e includes: using a plane extraction method to perform surface reconstruction based on the second point cloud data, thereby obtaining a three-dimensional model, which is a triangular mesh model.

[0077] Optionally, step e also includes: simplifying the triangular mesh model, for example, simplifying the triangular mesh model by using a quadratic edge collapse extraction algorithm (also known as an edge collapse algorithm based on quadratic metric error). Since the three-dimensional model generated based on dense point cloud data is relatively complex and has many triangular meshes, which may lead to a large amount of subsequent calculations, the triangular mesh model can also be simplified and the simplified triangular mesh model can be used as the three-dimensional model of the target area.

[0078] There are many implementation methods of the plane extraction algorithm and the secondary edge collapse extraction algorithm in the related technologies, so the detailed description is omitted here.

[0079] In the embodiment of the present disclosure, through the above steps ae, a three-dimensional model of the target area can be obtained relatively simply and accurately.

[0080] In step 202, a genetic algorithm is used to determine the positions where the k base stations are placed when the coverage rate of the k base stations is a first coverage rate.

[0081] When the genetic algorithm is used to determine the coverage rate of k base stations as the first coverage rate, multiple iterations are required when placing the positions of the k base stations.

[0082] Before the first iteration of multiple iterations, it is necessary to set the chromosome encoding based on the cellular coverage problem and complete the population initialization. For the relevant content of the chromosome encoding, please refer to the aforementioned step 102, and the detailed description is omitted here. After determining the chromosome encoding rules, some initial chromosomes can be randomly generated to complete the population initialization.

[0083] Any iteration of the multiple iterations using the genetic algorithm includes: determining the fitness of each chromosome among the multiple chromosomes generated in the previous iteration, and replicating, crossing over and mutating the chromosomes in the previous generation population based on the fitness of each chromosome in the previous generation population.

[0084] Among them, for the first iteration, the fitness of each chromosome among the multiple chromosomes generated in the previous iteration is determined, that is, the fitness of each chromosome in the initial population is determined.

[0085] In the disclosed embodiment, the fitness of a chromosome is the coverage rate when k base stations are respectively placed in the k positions indicated by the chromosome. Optionally, step fg is used to determine the fitness of each chromosome.

[0086] Step f, based on the three-dimensional model, the line of sight probability model and the ray tracing algorithm, determining the first receiving power of each sampling point when the k base stations are placed at the positions of the k base stations indicated by the first chromosome.

[0087] The first chromosome is any chromosome in any iteration.

[0088] Optionally, step f includes the following four steps:

[0089] In the first step, based on the three-dimensional model and the line-of-sight probability model, the type of line-of-sight path from each base station to each sampling point is determined.

[0090] The types of line-of-sight paths include direct line-of-sight paths, reflected line-of-sight paths, and diffracted line-of-sight paths.

[0091] Figure 4 is a schematic diagram of the line of sight probability model, see Figure 4 In the line of sight probability model, the center of the circle represents the base station 401, and multiple dense line of sight paths 402 are emitted from the base station 401. The starting point of each line of sight path is the base station 401, and the end point of each line of sight path is a sampling point. The line of sight probability model can predict the type of line of sight path from each base station to each sampling point based on the starting point, end point and three-dimensional model of the line of sight path. The line of sight path can represent the propagation path of the wireless signal. Among them, the three-dimensional model includes multiple models, such as model 403.

[0092] Figure 5 Schematic diagram of the types of sight paths. Figure 5 Part (a) of is a schematic diagram of the direct line of sight path, as shown in Figure 5 As shown in part (a), a certain direct line of sight path has a starting point RS and an end point R0, and the starting point to the end point of the direct line of sight path is not blocked by the three-dimensional model.

[0093] Figure 5 Part (b) of is a schematic diagram of the reflected line of sight path, as shown in Figure 5 As shown in part (b), there are two reflection surfaces, namely the first reflection surface P1 and the second reflection surface P2. The line of sight is emitted from the source point S (also the starting point), and reaches the receiving point R (also the focus) after multiple reflections from the first reflection surface P1 and the second reflection surface P2. Among them, the image point M1 is symmetrical with the source point S through the first reflection surface P1, and the image point M2 is symmetrical with the source point S through the second reflection surface P2; the secondary image point m1 is symmetrical with the image point M1 through the second reflection surface P2, and the secondary image point m2 is symmetrical with the image point M2 through the first reflection surface P1. After determining the source point S, the receiving point R, the first reflection surface P1, the second reflection surface P2, the image point M1, the image point M2, the secondary image point m1 and the secondary image point m2, the reflected line of sight path emitted from the source point S and reaching the receiving point S after reflections from the first reflection surface P1 and the second reflection surface P2 can be determined.

[0094] Figure 5 Part (c) of is a schematic diagram of the diffraction line of sight path, as shown in Figure 5 As shown in part (c) of FIG. 1 , the incident plane of a diffraction sight path is the plane where TxD1B1 is located, and the starting point Tx of the diffraction sight path is located in the incident plane. After the diffraction sight path is emitted from the starting point, it passes through I diffraction planes and finally reaches the end point Rx. Among them, D1B1D2B2 is a diffraction plane.

[0095] There are many methods for implementing the line of sight probability model in the related art, and the detailed description is omitted here.

[0096] In the second step, based on the ray tracing algorithm, the type of line of sight path and the three-dimensional model, the line of sight path from each base station to each sampling point is determined.

[0097] After the type of the line of sight path is determined, the line of sight path from each base station to each sampling point can be determined based on the three-dimensional model using a ray tracing algorithm according to the type of the line of sight path.

[0098] For example, there are k base stations and n sampling points, where k and n are both positive integers. For each of the k base stations, it is necessary to determine the line of sight path from the base station to the n sampling points. In this way, a total of k times n line of sight paths are determined.

[0099] There are many methods for implementing the ray tracing algorithm in the related art, so the detailed description is omitted here.

[0100] If the line of sight path from each base station to each sampling point is determined directly based on the three-dimensional model by a ray tracing algorithm without considering the influence of the type of the line of sight path, the calculated line of sight path will have errors. In the embodiment of the present disclosure, the type of the line of sight path is determined by a line of sight probability model. After the type of the line of sight path is determined, the line of sight path from each base station to each sampling point is determined by a ray tracing algorithm according to the type of the line of sight path, which can effectively improve the accuracy of the determined line of sight path.

[0101] In the disclosed embodiment, since each chromosome needs to use a ray tracing algorithm when calculating fitness, it is necessary to improve the execution efficiency of the ray tracing algorithm as much as possible, thereby improving the execution efficiency of the genetic algorithm. For example, the execution efficiency of the ray tracing algorithm can be improved by increasing parallel processing tasks.

[0102] The third step is to determine the path loss of each line-of-sight path.

[0103] After the line-of-sight path has been determined, the path loss generated when the wireless signal propagates from the base station to the sampling point along the line-of-sight path can be calculated.

[0104] Optionally, for a direct line-of-sight path, the path loss is calculated using a free space attenuation model; for a reflected line-of-sight path, the path loss is calculated using geometric optics theory; for a diffracted line-of-sight path, the path loss is calculated using the principle of consistent diffraction.

[0105] Among them, for the calculation of path loss through geometric optics theory, take a certain reflected line of sight path after one reflection as an example, at this time the path loss of the line of sight path is: the sum of the path loss from the starting point to the reflection point, the signal strength at the reflection point, and the path loss from the reflection point to the end point. Among them, the path loss from the starting point to the reflection point and the path loss from the reflection point to the end point can be calculated by the free space attenuation model.

[0106] When the frequency of the wireless signal is high enough, the wavelength of the wireless signal is much smaller than the edge length of the urban building, so the reflection path of the wireless signal is similar to the reflection of light waves, and the strength formula of the wireless signal at the reflection point is similar to the strength formula of the light wave reflection signal, that is, the signal strength at the reflection point = the incident signal strength × the reflection coefficient. The reflection coefficient is determined according to the actual situation, and the embodiments of the present disclosure do not limit this.

[0107] There are many methods for implementing the free space attenuation model and the consistent diffraction principle in the related technologies, and detailed description is omitted here.

[0108] The fourth step is to determine the first received power of each sampling point based on the path loss of each line of sight path.

[0109] The first received power of each sampling point is calculated by formula (2):

[0110] P1=P0-P2 (2)

[0111] Wherein, P1 is the first receiving power, P0 is the transmitting power of each base station, and P2 is the path loss of the line-of-sight path.

[0112] Step g: determining the coverage rate of the first chromosome based on the magnitude of the first received power of each sampling point and the power threshold, where the coverage rate of the first chromosome is the fitness value of the first chromosome.

[0113] The coverage rate of the first chromosome can be calculated by formula (1). Here, the first received power of each sampling point has been calculated in step f, and the number of sampling points whose first received power is less than the power threshold is the number of received bad points. The number of all sampling points is known. Therefore, the coverage rate of the first chromosome can be achieved by formula (1). The determined coverage rate of the first chromosome is the fitness value of the first chromosome.

[0114] After determining the fitness of each chromosome, multiple chromosomes in this iteration can be replicated, crossed over, mutated, and so on based on the fitness.

[0115] Optionally, for the crossover in any iteration, a fourth chromosome is generated based on the second chromosome and the third chromosome.

[0116] The second chromosome and the third chromosome are two different chromosomes generated in the previous iteration of any iteration, and the positions of the k base stations indicated by the fourth chromosome are the average of the positions of the k base stations indicated by the second chromosome and the third chromosome.

[0117] For example, the second chromosome is used to indicate that a base station is placed at (x1, y1, z1), the third chromosome is used to indicate that the base station is placed at (x2, y2, z2), and the fourth chromosome is used to indicate that the base station is placed at Place.

[0118] In the disclosed embodiment, the fourth chromosome is generated based on the second chromosome and the third chromosome during crossover, and the number of chromosomes generated is reduced compared to the conventional crossover method. In order to ensure that the number of chromosomes in the population does not change, the fourth chromosome is replicated in the disclosed embodiment, which is equivalent to obtaining two fourth chromosomes after crossover, thereby ensuring that the population number does not change.

[0119] Optionally, for the replication and mutation in any iteration, commonly used replication and mutation methods can be used. For example, when replicating, chromosomes with higher fitness in the previous generation of any iteration can be selected for replication and retention; and when mutating, single-point mutation or multi-point mutation can be used. The embodiments of the present disclosure do not limit the implementation methods of replication and mutation.

[0120] After multiple iterations using the genetic algorithm, an optimal solution can be obtained, and the fitness value of the optimal solution is the first coverage rate. At this time, it is necessary to determine the relationship between the first coverage rate and the coverage rate threshold. If the first coverage rate is greater than the coverage rate threshold, execute step 204; if the first coverage rate is less than the coverage rate threshold, execute step 203; if the first coverage rate is equal to the coverage rate threshold, execute step 206.

[0121] In step 203, based on the genetic algorithm, the positions where the k+1 base stations are placed are determined when the coverage rate of the k+1 base stations is the second coverage rate.

[0122] The second coverage rate is the maximum coverage rate of k+1 base stations in the target area, and the sum of the transmission powers of the k+1 base stations is the second power threshold.

[0123] The essence of step 203 is to execute step 202 after k is equal to k+1, and detailed description is omitted here. After step 203 is executed, an optimal solution can also be obtained. At this time, it is still necessary to determine the relationship between the fitness value of the optimal solution and the coverage threshold. If the fitness value of the optimal solution is less than the coverage threshold, step 203 is repeated until the fitness value of the optimal solution obtained in a certain iteration is greater than or equal to the coverage threshold.

[0124] If the fitness value of the optimal solution obtained in a certain iteration is greater than the coverage threshold, step 204 is executed; if the fitness value of the optimal solution obtained in a certain iteration is equal to the coverage threshold, step 206 is executed.

[0125] In step 204, the transmission power of the multiple base stations is reduced so that the sum of the transmission power of the multiple base stations is less than the second power threshold.

[0126] When executing step 204, the optimal solution may be k base stations, or k+1 base stations, or k+2 base stations, etc. The following is described by taking the case where the optimal solutions are k base stations as an example.

[0127] Exemplarily, the transmission power of each base station is Then reducing the transmission power of multiple base stations can be done by setting the transmission power of each base station to Among them, P n That is, the value by which the transmission power of each base station is reduced. nThe specific value of can be set according to experience, and the embodiments of the present disclosure do not limit this.

[0128] In step 205, based on the reduced transmission power of the multiple base stations, a genetic algorithm is used to determine the positions where the multiple base stations are placed when the coverage rate of the multiple base stations is a third coverage rate.

[0129] The third coverage rate is the maximum coverage rate after the multiple base stations reduce the transmission power.

[0130] Step 205 is essentially to set the transmission power of each base station. Step 202 is performed based on , and detailed description is omitted here.

[0131] After executing step 205, an optimal solution can be obtained, and the fitness value of the optimal solution is the third coverage rate.

[0132] If the third coverage ratio is greater than the coverage ratio threshold, steps 204 - 205 are repeated until the third coverage ratio is equal to the coverage ratio threshold.

[0133] Through steps 204-205, when the fitness value of the iterative optimal solution is greater than the coverage threshold, the transmission power of the base station can be effectively reduced, thereby enabling the most economical base station site selection.

[0134] In step 206, the locations where the multiple base stations are placed indicated by the optimal solution are used as the locations of the multiple base stations.

[0135] When the third coverage rate is equal to the coverage rate threshold, step 206 is to use the locations where the multiple base stations are placed when the coverage rate of the multiple base stations is the third coverage rate as the site selection for the multiple base stations.

[0136] Optionally, the coverage range of each base station is 30 cm.

[0137] Those skilled in the art may know that the coverage rate equal to the coverage rate threshold in the embodiments of the present disclosure actually refers to a solution in which the coverage rate is closest to the coverage rate threshold, and is not limited to making the coverage rate completely equal to the coverage rate threshold.

[0138] The following are device embodiments of the present application. For details not described in detail in the device embodiments, reference may be made to the above method embodiments.

[0139] Figure 6 A schematic diagram of the structure of a base station site selection device provided by an exemplary embodiment of the present disclosure is shown. Figure 6 The base station site selection device 600 includes: a modeling module 601 and a genetic algorithm module 602.

[0140] The modeling module 601 is used to model the target area to obtain a three-dimensional model of the target area. The target area includes multiple sampling points and multiple positions for placing base stations.

[0141] The genetic algorithm module 602 is used to use a genetic algorithm to determine the positions of the k base stations when the coverage of the k base stations is a first coverage rate. Each chromosome in the genetic algorithm is used to indicate that the k base stations are placed at k different positions, respectively. The k different positions are any k positions among multiple positions. The coverage rate is used to indicate the proportion of sampling points whose receiving power is greater than or equal to the first power threshold among multiple sampling points. The first coverage rate is the maximum coverage rate of the k base stations in the target area. The three-dimensional model is used to determine the receiving power of each sampling point; wherein k is a positive integer and k is greater than 0.

[0142] Optionally, the genetic algorithm module 602 is also used to determine the first received power of each sampling point when k base stations are placed at the positions of the k base stations indicated by the first chromosome based on a three-dimensional model, a line of sight probability model and a ray tracing algorithm, where the first chromosome is any chromosome in any iteration; based on the magnitude of the first received power of each sampling point and a power threshold, determine the coverage rate of the first chromosome, where the coverage rate of the first chromosome is the fitness value of the first chromosome.

[0143] Optionally, the genetic algorithm module 602 is also used to determine the type of line-of-sight path from each base station to each sampling point based on the three-dimensional model and the line-of-sight probability model, the types of line-of-sight paths including direct line-of-sight paths, reflected line-of-sight paths, and diffracted line-of-sight paths; determine the line-of-sight path from each base station to each sampling point based on the ray tracing algorithm, the type of line-of-sight path, and the three-dimensional model; determine the path loss of each line-of-sight path; and determine the first received power of each sampling point based on the path loss of each line-of-sight path.

[0144] Optionally, the genetic algorithm module 602 is also used to generate a fourth chromosome based on the second chromosome and the third chromosome for the crossover in any iteration, the second chromosome and the third chromosome are two different chromosomes generated in the previous iteration of any iteration, and the positions of the k base stations indicated by the fourth chromosome are the average of the positions of the k base stations indicated by the second chromosome and the third chromosome.

[0145] Optionally, the genetic algorithm module 602 is also used to determine, based on a genetic algorithm, the positions at which the k+1 base stations are placed when the coverage of the k+1 base stations is a second coverage when the first coverage is less than a coverage threshold, the second coverage is the maximum coverage of the k+1 base stations in the target area, and the sum of the transmission powers of the k+1 base stations is a second power threshold.

[0146] Optionally, the genetic algorithm module 602 is also used to reduce the transmission power of multiple base stations when the first coverage rate is greater than the coverage rate threshold, so that the sum of the transmission powers of the multiple base stations is less than a second power threshold; based on the reduced transmission power of the multiple base stations, a genetic algorithm is used to determine the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is a third coverage rate, and the third coverage rate is the maximum coverage rate after the transmission powers of the multiple base stations are reduced; if the third coverage rate is equal to the coverage rate threshold, the locations at which the multiple base stations are placed when the coverage rate of the multiple base stations is the third coverage rate are used as the site selection for the multiple base stations.

[0147] Optionally, the modeling module 601 is also used to obtain a first aerial image set, the first aerial image set including multiple aerial images of the target area; determine first point cloud data of the target area based on the multiple aerial images; perform semantic segmentation on the first point cloud data; perform incremental reconstruction on the first point cloud data after semantic segmentation to obtain second point cloud data; perform surface reconstruction based on the second point cloud data to obtain a three-dimensional model.

[0148] It should be noted that: when the base station site selection device provided in the above embodiment performs base station site selection, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the base station site selection device provided in the above embodiment and the base station site selection method embodiment belong to the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0149] The division of modules in the embodiments of the present disclosure is schematic and is only a logical function division. There may be other division methods in actual implementation. In addition, each functional module in each embodiment of the present disclosure may be integrated into a processor, or may exist physically separately, or two or more modules may be integrated into one module. The above-mentioned integrated modules may be implemented in the form of hardware or in the form of software functional modules.

[0150] If the integrated module is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a terminal device (which can be a personal computer, a mobile phone, or a communication device, etc.) or a processor (processor) to perform all or part of the steps of the method of each embodiment of the present disclosure. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program code.

[0151] Figure 7 Schematic diagram of the structure of the computer device provided by the embodiment of the present disclosure. Figure 7 As shown, the computer device 700 includes: a processor 701 and a memory 702 .

[0152] The processor 701 may include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 701 may be implemented in at least one hardware form of DSP (Digital Signal Processing), FPGA (Field-Programmable Gate Array), and PLA (Programmable Logic Array). The processor 701 may also include a main processor and a coprocessor. The main processor is a processor for processing data in the awake state, also known as a CPU (Central Processing Unit); the coprocessor is a low-power processor for processing data in the standby state. In some embodiments, the processor 701 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content to be displayed on the display screen. In some embodiments, the processor 701 may also include an AI (Artificial Intelligence) processor, which is used to process computing operations related to machine learning.

[0153] The memory 702 may include one or more computer-readable storage media, which may be non-transitory. The memory 702 may also include a high-speed random access memory, and a non-volatile memory, such as one or more disk storage devices, flash memory storage devices. In some embodiments, the non-transitory computer-readable storage medium in the memory 702 is used to store at least one instruction, which is used to be executed by the processor 701 to implement the base station site selection method provided in the embodiment of the present disclosure.

[0154] Those skilled in the art will understand that Figure 7 The structure shown in the figure does not constitute a limitation on the computer device 700, and the computer device 700 may include more or less components than shown in the figure, or combine some components, or adopt a different arrangement of components.

[0155] The embodiment of the present disclosure also provides a non-temporary computer-readable storage medium. When the instructions in the storage medium are executed by a processor of a computer device, the computer device is enabled to execute the base station site selection method provided in the embodiment of the present disclosure.

[0156] The embodiments of the present disclosure also provide a computer program product, including a computer program / instruction, which, when executed by a processor, implements the base station site selection method provided in the embodiments of the present disclosure.

[0157] The above description is only an optional embodiment of the present disclosure and is not intended to limit the present disclosure. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A base station site selection method, characterized in that: The method comprises: Modeling a target area to obtain a three-dimensional model of the target area, wherein the target area includes a plurality of sampling points and a plurality of positions for placing base stations; Using a genetic algorithm to determine the positions at which the k base stations are placed when the coverage rate of k base stations is a first coverage rate, each chromosome in the genetic algorithm is used to indicate that the k base stations are respectively placed in k different positions, the k different positions are any k positions among the multiple positions, the coverage rate is used to indicate the proportion of sampling points whose received power is greater than or equal to a first power threshold in the multiple sampling points, the first coverage rate is the maximum coverage rate of the k base stations in the target area, and the three-dimensional model is used to determine the received power of each sampling point; Wherein, k is a positive integer and k is greater than 0.

2. The method according to claim 1, characterized in that In the case where the genetic algorithm is used to determine that the coverage rate of the k base stations is a first coverage rate, the positions where the k base stations are placed include: Determine, based on the three-dimensional model, the line-of-sight probability model and the ray tracing algorithm, a first received power of each sampling point when the k base stations are placed at the positions of the k base stations indicated by the first chromosome, where the first chromosome is any chromosome in any iteration; Based on the magnitude of the first received power of each sampling point and the power threshold, the coverage rate of the first chromosome is determined, and the coverage rate of the first chromosome is the fitness value of the first chromosome.

3. The method according to claim 2, characterized in that The determining, based on the three-dimensional model, the line of sight probability model and the ray tracing algorithm, a first receiving power of each sampling point when the k base stations are placed at the positions of the k base stations indicated by the first chromosome comprises: Based on the three-dimensional model and the line of sight probability model, determining the type of the line of sight path from each base station to each sampling point, the type of the line of sight path including a direct line of sight path, a reflected line of sight path, and a diffraction line of sight path; Determine a line of sight path from each base station to each sampling point based on the ray tracing algorithm, the type of the line of sight path, and the three-dimensional model; determining a path loss for each of said line-of-sight paths; The first receiving power of each sampling point is determined based on the path loss of each line-of-sight path.

4. The method according to any one of claims 1 to 3, characterized in that: The genetic algorithm is used to determine the positions of the k base stations when the coverage of k base stations is a first coverage rate, including: for the crossover in any iteration, a fourth chromosome is generated based on the second chromosome and the third chromosome, the second chromosome and the third chromosome are two different chromosomes generated in the previous iteration of any iteration, and the positions of the k base stations indicated by the fourth chromosome are the average of the positions of the k base stations indicated by the second chromosome and the third chromosome.

5. The method according to any one of claims 1 to 3, characterized in that: The transmission power of each base station is the same, and the sum of the transmission powers of the k base stations is the second power threshold.

6. The method according to claim 5, characterized in that The method further comprises: When the first coverage rate is less than the coverage rate threshold, based on the genetic algorithm, the coverage rate of k+1 base stations is determined to be the second coverage rate. The positions at which the k+1 base stations are placed, the second coverage rate is the maximum coverage rate of the k+1 base stations in the target area, and the sum of the transmission powers of the k+1 base stations is the second power threshold.

7. The method according to claim 5, characterized in that The method further comprises: When the first coverage rate is greater than the coverage rate threshold, reducing the transmit power of multiple base stations so that the sum of the transmit powers of the multiple base stations is less than the second power threshold; Based on the reduced transmit power of the multiple base stations, using a genetic algorithm, determine the positions at which the multiple base stations are placed when the coverage of the multiple base stations is a third coverage rate, and the third coverage rate is the maximum coverage rate after the transmit power of the multiple base stations is reduced; If the third coverage rate is equal to the coverage rate threshold, the locations where the multiple base stations are placed are used as the site selections for the multiple base stations when the coverage rates of the multiple base stations are the third coverage rate.

8. The method according to any one of claims 1 to 3, characterized in that: The step of modeling the target area to obtain a three-dimensional model of the target area includes: Acquire a first aerial image set, where the first aerial image set includes a plurality of aerial images of the target area; Based on the multiple aerial images, determining first point cloud data of the target area; Performing semantic segmentation on the first point cloud data; Performing incremental reconstruction on the first point cloud data after the semantic segmentation to obtain second point cloud data; Surface reconstruction is performed based on the second point cloud data to obtain the three-dimensional model.

9. A base station site selection device, characterized in that: The device comprises: A modeling module, used to model a target area to obtain a three-dimensional model of the target area, wherein the target area includes a plurality of sampling points and a plurality of positions for placing base stations; A genetic algorithm module, used to use a genetic algorithm to determine the positions at which the k base stations are placed when the coverage rate of the k base stations is a first coverage rate, each chromosome in the genetic algorithm is used to indicate that the k base stations are placed in k different positions, respectively, the k different positions are any k positions among the multiple positions, the coverage rate is used to indicate the proportion of sampling points whose received power is greater than or equal to a first power threshold in the multiple sampling points, the first coverage rate is the maximum coverage rate of the k base stations in the target area, and the three-dimensional model is used to determine the received power of each sampling point; Wherein, k is a positive integer and k is greater than 0.

Citation Information

Patent Citations

  • Base station site selection method and device

    CN112020072A

  • Base station deployment method and device and computer readable storage medium

    CN112243236A

  • Urban base station construction method based on 5G technology and electronic equipment

    CN117041992A

  • Base station site selection method based on improved mayfly naiad algorithm

    CN117596604A

  • Base station site selection optimization method and device, equipment, storage medium and product

    CN117793722A

Cited By

  • Broadcast radio positioning system base station site selection analysis and evaluation method and system

    CN120201448A

  • A method and system for analyzing and evaluating the site selection of base stations in a broadcast radio positioning system

    CN120201448B