CN113038486B - Neighboring area planning method and device, computing device, and computer storage medium - Google Patents

Abstract

The invention discloses a method and a device for planning adjacent cells, computing equipment and a computer storage medium, wherein the method comprises the following steps: acquiring planning cell and whole network engineering parameter data; obtaining a preliminary neighbor cell list according to the coverage range of the planning cell; judging a coverage area scene; selecting at least one segmentation angle of the coverage range, and segmenting the coverage range respectively; and counting the cell distance in each partition sub-range, sequencing the cells according to the cell distance, converging the cells in each partition sub-range according to a set layer number threshold corresponding to the partition sub-range and a sequencing result to obtain the neighbor relation of the planning cell. By using the scheme of the invention, the adjacent cells which can be switched are arranged in each cell, thereby ensuring that the adjacent cells are not missed and the results that the adjacent cells are not too many and the whole adjacent cells are distributed more uniformly are also ensured.

Description

Neighboring area planning method and device, computing device, and computer storage medium

technical field

The present invention relates to the field of communication technologies, and in particular, to a method and device for planning a neighboring cell, a computing device, and a computer storage medium.

Background technique

Before the 5G base station is opened, it is necessary to plan the cell data in advance. Neighbor cells are a relatively important planning data in the cell data. In the initial construction stage of 5G, 5G base stations are built in NSA (non-independent networking) mode, and the adjacent area planning is divided into 5-5 adjacent area planning and anchor point planning. 5G users can access the 5G site only after accessing the anchor station. The adjacent area provides a continuous switching function for the user's mobile phone or other devices that need to be connected to the mobile network to maintain normal calls or Internet services during the move. If too many neighboring cells are planned, more measurement time is required and more network system resources are consumed; if too few neighboring cells are planned, it is easy to cause problems such as dropped calls, dropped calls, and poor user perception. Therefore, planning a reasonable neighbor relationship is an important task to ensure that the mobile communication network provides high-quality services for users.

Since 5G is in the early stage of network construction, there is no user terminal support, so there is no MR (Measurement Report, measurement report) related data. The neighboring cell planning scheme in the prior art mainly combines the base station industrial parameter data, and plans the neighboring cell relationship through the distance between two cells, the fixed distance hierarchy, and the angle relationship. This scheme has the following disadvantages:

Because there are often uneven distribution of sites in the neighboring area planning, some areas are densely located, and some areas are sparse. Many neighboring cells in a certain area are missing configuration, so the neighboring cells planned from the fixed distance layer, angle, and distance cannot meet the actual normal operation requirements of the network. Further, the existing planning scheme does not consider the priority addition of adjacent cells of the same site, and the same site is often missed due to certain errors in longitude and latitude and the influence of angles; the existing planning scheme does not consider the direction of forward coverage or backward coverage of cells. , or only determine the coverage by the artificially set value, there is a large error with the actual main coverage; the existing planning scheme is planned from the perspective of a large area as a whole, and it is easy to miss the neighboring areas or areas of a certain area. The neighbors of a certain area are redundant; the existing planning scheme does not consider the planning of the anchor station, because in the 5G NSA (Non-Stand Alone, non-independent networking) scheme, the planning of the anchor station is a very important task. Without anchor points, 5G users cannot access the 5G network and cannot switch.

Fig. 1 shows a schematic diagram of adjacent area planning in the prior art. As shown in Fig. 1, there are many adjacent areas in areas C and D, and base stations A and B in the north-south direction are relatively close to base stations in areas C and D due to their distances. If it is slightly far away and has a large deviation from the planned site cell angle, it will be omitted. However, the north-south direction belongs to the site sparse scenario. When planning the cell, these two cells need to be added as adjacent cells for continuous handover.

SUMMARY OF THE INVENTION

In view of the above problems, the present invention is proposed in order to provide a neighbor planning method and apparatus, a computing device, and a computer storage medium that overcome the above problems or at least partially solve the above problems.

According to one aspect of the present invention, there is provided a neighboring area planning method, comprising:

Obtain the planning community and the whole network engineering parameter data;

Obtain a preliminary neighbor list according to the coverage of the planned cell;

According to the cell site density within the coverage of the planned cell, determine the coverage area scenario;

According to the determination result of the coverage area scene, at least one segmentation angle of the coverage area is selected, and the coverage area is divided according to the at least one segmentation angle to obtain several segmentation sub-ranges;

Count the distances of the cells in each sub-range and sort the cells according to the distances of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are aggregated according to the sorting result, and the planned cells are obtained. Neighborhood relations.

In an optional manner, after the preliminary neighbor cell list is obtained according to the coverage of the planned cell, the method further includes: removing the same-site neighbor cell from the preliminary neighbor cell list;

The aggregation of the cells in each of the divided sub-ranges according to the sorting results to obtain the neighbor relationship of the planned cells further includes:

According to the sorting result, the cells of each divided sub-range are aggregated to obtain the list of neighbors to be selected, and the neighbors of the same site are added to the list of neighbors to be selected to obtain the list of forward neighbors, and the list of negative neighbors is added to the list of forward neighbors. To the neighbors, get the complete list of neighbors.

In an optional manner, the same-site neighboring cells include: cells within a circle with the planned cell location as the center and the preset distance as the radius; and cells with the same base station ID as the planned cell.

In an optional manner, the method further includes: determining forward coverage and backward coverage of the planned cell;

The determining the coverage area scenario according to the cell site density within the coverage area of the planned cell further includes:

Calculate the cell site density within the forward coverage and the backward coverage of the planned cell, and determine a site dense scene and/or a site sparse scene according to the site density;

According to the determination result of the coverage area scene, at least one division angle of the coverage area is selected, and the coverage area is divided according to the at least one division angle, and obtaining several divided sub-ranges further includes:

According to the site dense scene and/or the site sparse scene, respectively select the forward coverage area and the backward coverage area segmentation angle, and divide the forward coverage area and the backward coverage area according to the respective segmentation angles, and obtain several Sub-ranges are divided; wherein, the division angle of the coverage area corresponding to the dense site scene is smaller than the division angle of the coverage area corresponding to the site sparse scene.

In an optional manner, according to the set layer number threshold corresponding to the divided sub-ranges, the aggregation of the cells of each divided sub-range according to the sorting result further includes:

According to the set threshold of the number of layers corresponding to the divided sub-ranges, and according to the sorting result, the cells whose number of layers is less than or equal to the set threshold of the number of layers are aggregated to obtain a list of neighbor cells to be selected.

In an optional manner, the obtaining the neighbor relationship of the planned cell further includes: planning an anchor station, and obtaining the neighbor relationship of the planned cell according to the anchor station and the complete neighbor list .

According to another aspect of the present invention, there is provided a neighbor planning device, comprising:

The data acquisition module is used to acquire the planned community and the whole network industrial parameter data;

a preliminary processing module, configured to obtain a preliminary neighbor list according to the coverage of the planned cell;

a scenario determination module, configured to determine the coverage area scenario according to the cell site density within the coverage area of the planned cell;

a segmentation module, configured to select at least one segmentation angle of the coverage area according to the coverage area scene determination result, and divide the coverage area according to the at least one segmentation angle to obtain several segmentation sub-ranges;

The neighbor determination module is used to count the distances of the cells in each sub-range and sort the cells according to the distance of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are aggregated according to the sorting result. , to obtain the neighbor relationship of the planned cell.

In an optional manner, the apparatus further includes: a coverage calculation module, configured to calculate the coverage of the planned cell, where the coverage of the planned cell includes forward coverage and backward coverage;

The scene determination module is specifically configured to: calculate the forward coverage of the planned cell and the cell site density within the backward coverage, and determine a site dense scene and/or a site sparse scene according to the site density;

The segmentation module is further used for: according to the site-intensive scene and/or the site-sparse scene, respectively selecting the forward coverage area and the backward coverage area segmentation angle, respectively, with the respective described segmentation angles for the forward coverage area and the backward coverage area. The coverage area is divided to obtain several divided sub-ranges; wherein, the division angle of the coverage area corresponding to the dense site scene is smaller than the division angle of the coverage area corresponding to the site sparse scene.

According to yet another aspect of the present invention, a computing device is provided, comprising: a processor, a memory, a communication interface, and a communication bus, and the processor, the memory, and the communication interface complete mutual communication through the communication bus. communication;

The memory is used for storing at least one executable instruction, and the executable instruction enables the processor to perform operations corresponding to the above neighbor planning method.

According to yet another aspect of the present invention, a computer storage medium is provided, wherein the storage medium stores at least one executable instruction, and the executable instruction enables a processor to perform operations corresponding to the above neighbor planning method.

After determining the coverage of the planned cell, the present invention determines the coverage area scenarios of the coverage area, and the planning result is more accurate and closer to the actual coverage situation; through the determination results, different coverage area scenarios are divided according to different granularity. Divide, and then take the distance bottomT cell in each divided sub-range as the adjacent area, in which the set layer threshold of each divided sub-range can be dynamically set, so that there are adjacent areas that can be switched in each small area, which not only guarantees This ensures that the adjacent cells will not miss the allocation, and also ensures that the adjacent cells will not be too many and the overall adjacent cells will be distributed evenly.

The above description is only an overview of the technical solutions of the present invention, in order to be able to understand the technical means of the present invention more clearly, it can be implemented according to the content of the description, and in order to make the above and other purposes, features and advantages of the present invention more obvious and easy to understand , the following specific embodiments of the present invention are given.

Description of drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are for the purpose of illustrating preferred embodiments only and are not to be considered limiting of the invention. Also, the same components are denoted by the same reference numerals throughout the drawings. In the attached image:

Fig. 1 shows the schematic diagram of adjacent area planning in the prior art;

2 shows a flowchart of an embodiment of a neighboring cell planning method according to the present invention;

Fig. 3 shows the neighboring cell result obtained by utilizing the neighboring cell planning method of the embodiment of the present invention;

Fig. 4 shows the flow chart of another embodiment of the neighboring cell planning method of the present invention;

FIG. 5 shows a schematic diagram of vertical and horizontal half-power angles in an embodiment of the present invention;

6 shows a schematic diagram of a cell coverage area scenario according to an embodiment of the present invention;

FIG. 7 shows a schematic diagram of selecting a division angle of the coverage of an embodiment of the present invention;

FIG. 8 shows a schematic diagram of determining the number of layers of adjacent cells according to an embodiment of the present invention;

FIG. 9 shows a schematic diagram of a neighboring cell planning result in an embodiment of the present invention;

10 shows a schematic diagram of an anchor station and control signaling and data service transmission under the NSA networking according to an embodiment of the present invention;

11 shows a schematic structural diagram of an embodiment of an apparatus for planning a neighboring cell according to the present invention;

FIG. 12 shows a schematic structural diagram of an embodiment of a computing device of the present invention.

Detailed ways

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 by the embodiments set forth herein. Rather, these embodiments are provided so that the present invention will be more thoroughly understood, and will fully convey the scope of the present invention to those skilled in the art.

FIG. 2 shows a flowchart of an embodiment of a neighbor cell planning method according to the present invention. As shown in Figure 2, the method includes the following steps:

Step 210: Acquiring the planned cell and the industrial parameter data of the whole network;

Step 220: Obtain a preliminary neighbor cell list according to the coverage of the planned cell;

Step 230: Determine the coverage area scenario according to the cell site density within the coverage area of the planned cell;

Step 240: According to the determination result of the coverage area scene, select at least one segmentation angle of the coverage area, and divide the coverage area by at least one segmentation angle to obtain several segmentation sub-ranges;

Step 250: Count the distances of the cells in each sub-range and sort the cells according to the distances of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are aggregated according to the sorting result, and the planned cells are obtained. neighbor relationship.

This embodiment provides a 5G neighbor cell planning method based on the division of the planned cell coverage and the dynamic setting of the threshold for the number of layers. In step 210, the operating parameter data of the mobile base station is obtained, and then various parameters of the planned cells, such as Longitude and latitude (cell location data) and azimuth, horizontal half-power angle, vertical half-power angle determine the coverage of the planned cell; in step 220, obtain a list of all cells within the coverage of the planned cell, as a preliminary neighbor list; in step In 230, a coverage area scenario is determined according to the density of cell sites within the coverage area of the planned cell, and the coverage area scenario includes a site dense scenario and/or a sparse site scenario; in step 240, for different coverage area scenarios, select different coverage scenarios. Divide the angle to divide the coverage area; in step 250, dynamically set the set layer threshold of each divided sub-range, and aggregate the bottomT cells of each divided sub-range through the layer number algorithm of dynamic distance to obtain the planned community The final more reasonable neighbor relationship. The adjacent cell planning method provided in this embodiment can solve the problems of missing adjacent cells, too many adjacent cells, and too few adjacent cells in the prior art. Fig. 3 shows the neighboring cell results obtained by using the neighboring cell planning method according to the embodiment of the present invention, the base stations A and B in the north-south direction can be planned into the neighboring cell relationship, and the neighboring cells distributed in the two regions C and D are more reasonable , there will be no redundant neighbors.

Fig. 4 shows a flow chart of another embodiment of the neighbor cell planning method of the present invention. As shown in Figure 4, the method includes the following steps:

Step 401: Acquire planning cell and network-wide engineering parameter data.

First, obtain 5G industrial parameter data to plan 5G neighboring areas. 5G industrial parameter data includes 5G base station name, 5G base station ID, cell name, cell CELLID, coverage scenario, cell coverage type, azimuth, latitude and longitude (cell location), station High and down angle. Then, the 4G industrial parameter data is obtained to plan the anchor station of the 5G base station. The 4G industrial parameter data includes the 4G base station name, 4G base station ID, cell name, cell CELLID, coverage scenario, cell coverage type, azimuth, latitude and longitude, station High and down angle.

Step 402: Obtain a preliminary neighbor cell list according to the coverage of the planned cell.

Acquire the location data of the planned cell, and acquire the data of all cells within a circle with the location of the planned cell as the center of the circle and the distance L as the radius. Because the coverage methods of the macro cell and the indoor distribution are different, the macro cell is directional coverage and has a large coverage radius, and the indoor distribution antenna is generally omnidirectional and has a small coverage radius. Therefore, the subsequent processing should be slightly different according to the different planned cell types.

Assuming that the current planned cell is a macro cell, its coverage radius is L, the longitude and latitude of the cell is (lg1, lt1), and the longitude and latitude of the nearby cell B is (lg2, lt2), then the distance between cells A and B is DL, and it is determined whether cell B is in The formula for the coverage of cell A is as follows:

DL=R*arccos(coslt2*cos lt1*cos(lg2–lg1)+sin lt2*sin lt1)*PI/180

where R is the mean radius of the Earth. For the case of DL=L, it can be determined as appropriate whether it is within the coverage of the planned cell.

Further, according to different cell types, all cells within the coverage area of the planned cell can be classified by macro station and room division to obtain a preliminary neighbor cell list of a macro cell and a preliminary neighbor cell list of room division.

Step 403: Planning the same-site adjacent area.

Because several cells of the same base station may have deviations due to the latitude and longitude during planning, it is easy to miss during planning, so it is necessary to add the cells of the same base station as adjacent cells of the same site first, and also plan the cells 50 meters away from the cell. If the handover has a large impact, it needs to be added to the adjacent cell of the same site. That is, the same-site adjacent area includes: cells within a circle with the planned cell location as the center and the preset distance as the radius; and cells with the same base station ID as the planned cell.

In the preliminary neighbor list obtained in step 402, the neighbors of the same site are eliminated.

Step 404: For the macro cell, determine its forward coverage and backward coverage.

For a macro cell, the forward direction of the cell is the direction in which the antenna energy of the cell is stronger. Previously, it was subjectively judged by humans, and the accuracy was poor. This embodiment utilizes the half power angle to determine forward and backward directions.

The half-power angle is the angle at which the power on the main lobe drops to half (3dB) in the strongest direction (main lobe direction). Most antennas have a half-power angle of 90 degrees, that is to say, from the main direction to 45 degrees to the left and right, the power decreases. half. The half power angle reflects the concentration of the antenna energy, so the selected cell antenna half power angle is the size of the forward coverage angle of the cell antenna, and the area outside the half power angle is the size of the cell backward coverage angle. FIG. 5 shows a schematic diagram of vertical and horizontal half-power angles in an embodiment of the present invention.

Assuming that the antenna azimuth angle of cell A is a, the half-power angle is t, the value ranges of the forward coverage angle n and the backward coverage angle m of cell A are as follows:

Step 405: Determine the coverage area scenarios of the forward coverage area and the backward coverage area.

After obtaining the forward coverage and backward coverage of the planned cell, calculate the forward coverage of the planned cell and the cell site density within the backward coverage, and determine the coverage area scenario according to the site density.

The cell site density f is the number of cells per square kilometer. If the density f is greater than the density threshold f _k , the coverage area scenario is a site dense scenario, otherwise it is a site sparse scenario.

Assuming that the forward opening angle of the planned cell A is φ, and the number of cells in the sector area formed by its position as the center and the radius as L is q, the calculation formula of the cell site density f of its forward coverage area is as follows:

FIG. 6 shows a schematic diagram of a cell coverage area scenario according to an embodiment of the present invention. As shown in FIG. 6 , the forward coverage of the cell is a dense site (base station) scenario, and the cell backward coverage is a sparse site (base station) scenario.

Step 406: Select the division angle of the coverage area.

In order to make the neighbor relationship of the planned cells more reasonably distributed, and in the case of not adding more or less neighbors, and ensuring that users can have relay cells in each direction for handover, this embodiment is based on the dense site scenario and/or In the case of sparse sites, the forward coverage and the backward coverage are selected respectively, and the forward coverage and the backward coverage are divided according to their respective segmentation angles, and several sub-ranges are obtained to refine the coverage. For multiple directions, it can ensure that the user has neighbor cell handover when moving in different directions. Wherein, the segmentation angle of the coverage corresponding to the dense site scene is smaller than the segmentation angle of the coverage corresponding to the sparse site scene.

FIG. 7 shows a schematic diagram of the selection of the division angle of the coverage area according to the embodiment of the present invention. As shown in FIG. 7 , in this example, the division angle N of the scene with dense sites is 10 degrees, and the value of the division angle N of the scene with sparse sites is 10 degrees. is 20 degrees. This embodiment of the present invention does not limit this, and the splitting angle can be set according to actual needs.

Step 407: Forward and backward preliminary neighbor list

The macro cell counts the preliminary neighboring cells within their respective ranges according to the forward and backward directions (excluding the neighboring cells of the same site), and the room cell counts its own preliminary neighboring cells according to the circular range (regardless of the forward and backward directions) (excluding the same-site neighboring cells). same-station neighbors). The preliminary neighbor cell list is divided into a macro station preliminary neighbor cell list and a room division preliminary neighbor cell list.

Step 408: Set the threshold for the number of forward and backward layers.

Set the backward and forward layer thresholds C according to the requirements of each scenario. In a specific example of this embodiment, the threshold of the number of layers in the forward direction of the macro cell is set to 2 layers, and the threshold of the number of layers in the back direction is set to 2 layers; The significance of setting the number of layers to 2 is that after the adjacent cells of one layer fail, the adjacent cells of the other layer can be used for continuous switching. In the present invention, the layer number threshold can be set according to actual requirements, and the present invention does not limit the value.

Step 409: Determine the number of layers of adjacent cells.

Divide the planned cell forward or backward coverage into several sub-ranges according to the division angle N, then count the cell distances in each sub-sub-range and sort the cells according to the cell distance. The cell distance refers to the cells in the sub-sub-range. The distance from the location of the planned cell, the cells are sorted according to the distance from small to large, and the cell with the distance bottomT (that is, the smallest distance T) is taken as the adjacent cell, where T is the number of adjacent cell layers, If the threshold for the number of forward layers set in step 408 is 2, then T is 2 here.

FIG. 8 shows a schematic diagram of determining the number of layers of adjacent cells according to an embodiment of the present invention. As shown in FIG. 8 , the number of layers of adjacent cells in each divided sub-range is different.

Step 410: Count the neighboring cells in each layer.

After dividing the forward coverage and backward coverage of the planned cell, sort the preliminary neighboring cells in each divided sub-range by distance. According to the set threshold of the number of floors corresponding to the divided sub-range, according to the sorting result, the number of floors is less than or a cell equal to the set threshold of the number of layers, and then aggregate the adjacent cells in each divided sub-range to obtain a list of adjacent cells to be selected within the threshold of the set number of layers.

For example, the threshold of the number of forward layers of a macro cell A is 2 layers (in base stations), and the threshold of the number of back layers is 1 (in units of base stations). The specific implementation method: first, take cell A as the center , obtain its forward coverage angle and backward coverage angle range values according to the algorithm mentioned above; then divide its forward coverage angle and backward coverage angle by 10 degrees (assuming that both the forward and backward scenarios are densely stationed) Scenario) is a number of sub-ranges. In each sub-range divided in the forward coverage, take the two closest sites (bottom2), and then the set of neighbors of each sub-range in the forward coverage is Plan the forward two-layer neighbors of the cell, take the nearest site (bottom1) for each sub-range divided in the back coverage area, and then set the neighbors of each sub-area in the back coverage area. That is, the neighboring area on the first floor facing away from the planned area.

If the forward coverage angle and the backward coverage angle of the planned cell A are divided by 10 degrees, the number of small-scale area blocks divided by the forward and backward divisions are x, z respectively:

a) Forward coverage neighbor set S _x :

S _x ={C ₁ ,C ₂ ......C _x }

b) Backward coverage neighbor set S _z :

S _z = {B ₁ , B ₂ ......B _z }

c) The list S of the neighbors to be selected for the planned cell:

S=S _x ∪S _z

FIG. 9 shows a schematic diagram of a neighbor planning result in an embodiment of the present invention. As shown in Figure 9, the black sector map base station cell is the planned adjacent cell, there is no missing adjacent cells, the number of adjacent cells is reasonable, and it also ensures that there are adjacent cells in all directions of the planned cell for continuous handover.

Step 411: Add reverse neighbors.

Add the same-site neighbors to the list of neighbors to be selected to obtain the forward neighbors list, and add the reverse neighbors to the forward neighbors list to obtain the complete neighbors list.

The complete forward neighbor list is obtained by merging the neighbors on the same site obtained in step 403 and the list of neighbors to be selected in step 410, and then adding its reverse neighbors (because neighbors are generally bidirectional neighbors), After A adds B neighbors, B also adds A neighbors, and finally obtains a complete reverse neighbor relationship.

Step 412: Anchor point planning.

An anchor station is planned, and the neighbor relationship of the planned cell is obtained according to the anchor station and the complete neighbor list.

FIG. 10 shows a schematic diagram of an anchor station and transmission of control signaling and data services under an NSA networking according to an embodiment of the present invention. In addition to planning 5-5 neighboring cells, the neighbor relationship of the NSA 5G base station cell also needs to plan the anchor station of the 5G base station (the anchor station can be a 4G base station). After the anchor station is transformed (the specific transformation method does not belong to the present invention) The scope of protection will not be introduced in detail, and the transformation method of the existing technology can be used), 5G users can access the 5G NR cell after accessing the anchor station first. Therefore, after the 5G base station cell has planned 5-5 adjacent cells, Anchor stations also need to be planned.

The anchor point planning method is as follows: First, filter out FDD1800 and F-band base station information from the mobile 4G industrial parameter data as 4G engineering data; plan 5-4G adjacent cells according to the above steps 401 to 411, and the 4G adjacent cell sites are used as 5G base stations The anchor site; the planned anchor site cells need to add 5G cells as the neighbor relationship.

Finally, merging the neighbors in the forward neighbor list and the reverse neighbor list is the complete 5-5 neighbor relationship of the planned cell; the anchor point planned in step 412 is used as the 5G anchor station; the anchor point to 5G The neighbor relationship is 4-5 neighbors.

This embodiment defines the concept of co-site adjacent cells, and preferentially adds co-site adjacent cells as adjacent cells to avoid the situation of missed allocation of co-site adjacent cells; this embodiment uses the cell half-power angle to divide forward coverage and Backward coverage, and the forward coverage and backward coverage coverage scenarios are judged, and the planning results are more accurate and closer to the actual coverage; this embodiment uses the judgment results. Different segmentation granularities are divided, and then the distance bottomT cell in each sub-range is taken as the adjacent cell, so that there are adjacent cells that can be switched in each small area, which not only ensures that the adjacent cells will not miss allocation, but also guarantees The result is that there are not too many neighbors and the overall distribution of neighbors is more uniform. This embodiment provides an anchor point planning method for a 5G base station while planning a 5G base station adjacent area, and solves the problems of 5G adjacent area planning and anchor point planning in a 5G NSA networking situation as a whole.

FIG. 11 shows a schematic structural diagram of an embodiment of an apparatus for planning a neighboring cell according to the present invention. As shown in FIG. 11 , the apparatus includes: a data acquisition module 1101 , a preliminary processing module 1102 , a scene determination module 1103 , a segmentation module 1104 and a neighbor determination module 1105 .

The data acquisition module 1101 is used to acquire the planned community and the whole network industrial parameter data;

A preliminary processing module 1102, configured to obtain a preliminary neighbor list according to the coverage of the planned cell;

Scenario determination module 1103, configured to determine the coverage area scenario according to the cell site density within the coverage area of the planned cell;

The segmentation module 1104 is configured to select at least one segmentation angle of the coverage area according to the coverage area scene determination result, and divide the coverage area according to the at least one segmentation angle to obtain several segmentation sub-ranges;

The neighbor determination module 1105 is used to count the distances of the cells in each sub-range and sort the cells according to the distances of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are sorted according to the sorting result. Aggregate to obtain the neighbor relationship of the planned cell.

In an optional manner, the preliminary processing module 1102 is further configured to: remove the same-site neighboring cells from the preliminary neighboring cell list. The neighbor cell determination module 1105 is further configured to: aggregate the cells of each divided sub-range according to the sorting result to obtain a list of neighbor cells to be selected, and add the neighbor cells of the same site to the list of neighbor cells to be selected to obtain a list of forward neighbor cells, Add reverse neighbors to the forward neighbor list to get the complete neighbor list.

In an optional manner, the same-site neighboring cells include: cells within a circle with the planned cell location as the center and the preset distance as the radius; and cells with the same base station ID as the planned cell.

In an optional manner, the apparatus further includes: a coverage calculation module 1106, configured to calculate the coverage of the planned cell, where the planned cell is a macro cell, and the coverage of the planned cell includes Towards coverage and backwards coverage;

The scene determination module 1103 is specifically configured to: calculate the forward coverage of the planned cell and the cell site density within the backward coverage, and determine the site dense scene and/or the site sparse scene according to the site density;

The segmentation module 1104 is further configured to: according to the site-intensive scene and/or the site-sparse scene, respectively select the forward coverage area and the backward coverage area segmentation angle, and use the respective segmentation angles to separate the forward coverage area and the backward coverage area respectively. The coverage area is divided to obtain several divided sub-ranges; wherein, the segmentation angle of the coverage area corresponding to the dense site scene is smaller than the segmentation angle of the coverage area corresponding to the site sparse scene.

In an optional manner, the adjacent cell determination module 1105 is further configured to: according to the set threshold of the number of layers corresponding to the divided sub-ranges, according to the sorting result, aggregate the cells whose number of layers is less than or equal to the set threshold of the number of layers to obtain the waiting list. List of selected neighbors.

In an optional manner, the neighbor determination module 1105 is further configured to: plan an anchor station, and obtain the neighbor relationship of the planned cell according to the anchor station and the complete neighbor list.

In this embodiment of the device, the adjacent cells of the same site are preferentially added as adjacent cells, so as to avoid the situation of missing configuration in the adjacent cells of the same site; the embodiment of the device divides the forward coverage range and the backward coverage range for the macro cell, and the forward The coverage area and the coverage area scenarios that are opposite to the coverage area are determined, and the planning results are more accurate and closer to the actual coverage situation; the embodiment of the device divides different coverage area scenarios according to different segmentation granularities through the determination results, and then The distance bottomT cell in each sub-range is taken as the adjacent cell, so that there are adjacent cells that can be switched in each small area, which not only ensures that the adjacent cells will not miss allocations, but also ensures that there will not be too many adjacent cells. The overall neighborhood distribution is more evenly distributed. In the embodiment of the apparatus, while planning the adjacent area of the 5G base station, the anchor point of the 5G base station is also planned, which solves the problems of 5G adjacent area planning and anchor point planning in the 5G NSA networking situation as a whole.

An embodiment of the present invention provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction can execute the neighbor planning method in any of the foregoing method embodiments.

FIG. 12 shows a schematic structural diagram of an embodiment of a computing device of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the computing device.

As shown in FIG. 12 , the computing device may include: a processor (processor) 1202 , a communications interface (Communications Interface) 1204 , a memory (memory) 1206 , and a communication bus 1208 .

The processor 1202 , the communication interface 1204 , and the memory 1206 communicate with each other through the communication bus 1208 . The communication interface 1204 is used to communicate with network elements of other devices such as clients or other servers. The processor 1202 is configured to execute the program 1210, and specifically may execute the relevant steps in the foregoing embodiments of the neighbor-based planning method.

Specifically, the program 1210 may include program code including computer operation instructions.

The processor 1202 may be a central processing unit (CPU), or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention. The one or more processors included in the computing device may be the same type of processors, such as one or more CPUs; or may be different types of processors, such as one or more CPUs and one or more ASICs.

The memory 1206 is used to store the program 1210 . Memory 1206 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk memory.

The program 1210 may be specifically configured to cause the processor 1202 to execute the neighbor cell planning method in any of the foregoing method embodiments.

The algorithms or displays provided herein are not inherently related to any particular computer, virtual system, or other device. Various general-purpose systems can also be used with teaching based on this. The structure required to construct such a system is apparent from the above description. Furthermore, embodiments of the present invention are not directed to any particular programming language. It is to be understood that various programming languages may be used to implement the inventions described herein, and that the descriptions of specific languages above are intended to disclose the best mode for carrying out the invention.

In the description provided herein, numerous specific details are set forth. It will be understood, however, 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 is to be understood that, in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together into a single implementation in order to simplify the invention and to aid in the understanding of one or more of the various aspects of the invention. examples, figures, or descriptions thereof. This disclosure, however, should not be construed as reflecting an intention that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the Detailed Description are hereby expressly incorporated into this Detailed Description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art will understand that the modules in the device in the embodiment can be adaptively changed and arranged in one or more devices different from the embodiment. The modules or units or components in the embodiments may be combined into one module or unit or component, and further they may be divided into multiple sub-modules or sub-units or sub-assemblies. All features disclosed in this specification (including accompanying claims, abstract and drawings) and any method so disclosed may be employed in any combination, unless at least some of such features and/or procedures or elements are mutually exclusive. All processes or units of equipment are combined. Each feature disclosed in this specification (including accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, it will be understood by those skilled in the art that although some of the embodiments herein include certain features, but not others, included in other embodiments, that combinations of features of the different embodiments are intended to be within the scope of the present invention And form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.

Various component embodiments of the present invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will understand that a microprocessor or a digital signal processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components according to the embodiments of the present invention. The present invention can also be implemented as apparatus or apparatus programs (eg, computer programs and computer program products) for performing part or all of the methods described herein. Such a program implementing the present invention may be stored on a computer-readable medium, or may be in the form of one or more signals. Such signals may be downloaded from Internet sites, or provided on carrier signals, or in any other form.

It should be noted that the above-described embodiments illustrate rather than limit the invention, and that alternative embodiments may be devised by those skilled in the art 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 can be implemented by means of hardware comprising several different elements and by means of a suitably programmed computer. In a unit claim 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, and third, etc. do not denote any order. These words can be interpreted as names. The steps in the above embodiments should not be construed as limitations on the execution order unless otherwise specified.

Claims (8)

1. a neighboring area planning method, is characterized in that, comprises: Obtain the planning community and the whole network engineering parameter data; Obtain a preliminary neighbor list according to the coverage of the planned cell; determining the forward coverage and the backward coverage of the planned cell; Calculate the cell site density within the forward coverage and the backward coverage of the planned cell, and determine a site dense scene and/or a site sparse scene according to the site density; According to the site dense scene and/or the site sparse scene, respectively select the forward coverage area and the backward coverage area segmentation angle, and divide the forward coverage area and the backward coverage area according to the respective segmentation angles, and obtain several dividing sub-ranges; wherein, the division angle of the coverage corresponding to the site-dense scene is smaller than the division angle of the coverage corresponding to the site-sparse scene; Count the distances of the cells in each sub-range and sort the cells according to the distances of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are aggregated according to the sorting result, and the planned cells are obtained. Neighborhood relations. 2 . The neighbor cell planning method according to claim 1 , wherein, after the preliminary neighbor cell list is obtained according to the coverage of the planned cell, the method further comprises: removing from the preliminary neighbor cell list. 3 . Neighboring area of the same station; The aggregation of the cells in each of the divided sub-ranges according to the sorting results to obtain the neighbor relationship of the planned cells further includes: According to the sorting result, the cells of each divided sub-range are aggregated to obtain the list of neighbors to be selected, and the neighbors of the same site are added to the list of neighbors to be selected to obtain the list of forward neighbors, and the list of negative neighbors is added to the list of forward neighbors. To the neighbors, get the complete list of neighbors. 3. The adjacent area planning method according to claim 2, wherein the adjacent area on the same site comprises: a small area within a circular range with the planned area as the center and the preset distance as the radius; A cell with the same base station ID. 4. The neighboring cell planning method according to claim 1, wherein, according to the set layer number threshold corresponding to the divided sub-range, and according to the sorting result, the cells of each divided sub-range are aggregated further comprising: According to the set threshold of the number of layers corresponding to the divided sub-ranges, and according to the sorting result, the cells whose number of layers is less than or equal to the set threshold of the number of layers are aggregated to obtain a list of neighbor cells to be selected. 5. The neighbor planning method according to claim 2, wherein the obtaining the neighbor relationship of the planned cell further comprises: planning an anchor station, according to the anchor station and the complete neighbor list Obtain the neighbor relationship of the planned cell. 6. An adjacent area planning device, characterized in that, comprising: The data acquisition module is used to acquire the planned community and the whole network industrial parameter data; a preliminary processing module, configured to obtain a preliminary neighbor list according to the coverage of the planned cell; a coverage calculation module, configured to calculate the coverage of the planned cell, where the coverage of the planned cell includes forward coverage and backward coverage; a scene determination module, configured to calculate the forward coverage of the planned cell and the cell site density within the backward coverage, and to determine the site dense scene and/or the site sparse scene according to the site density; The segmentation module is used to select the segmentation angles of the forward coverage area and the backward coverage area respectively according to the dense site scene and/or the sparse site scene, and perform the forward coverage area and the backward coverage area respectively according to the respective segmentation angles. segmentation to obtain several segmentation sub-ranges; wherein, the segmentation angle of the coverage area corresponding to the dense site scene is smaller than the segmentation angle of the coverage area corresponding to the site sparse scene; The neighbor determination module is used to count the distances of the cells in each sub-range and sort the cells according to the distance of the cells. According to the set threshold of the number of layers corresponding to the sub-range, the cells of each sub-range are aggregated according to the sorting result. , to obtain the neighbor relationship of the planned cell. 7. A computing device, comprising: a processor, a memory, a communication interface and a communication bus, the processor, the memory and the communication interface complete mutual communication through the communication bus; The memory is used for storing at least one executable instruction, and the executable instruction enables the processor to perform an operation corresponding to the neighbor planning method according to any one of claims 1-5. 8. A computer storage medium, wherein at least one executable instruction is stored in the storage medium, and the executable instruction enables a processor to perform operations corresponding to the neighbor planning method according to any one of claims 1-5 .

Images