CN117580112A - Neighbor cell management method and device - Google Patents

Abstract

The invention discloses a neighbor cell management method and device, wherein the method comprises the following steps: determining initial neighbor cell information of a first pRRU according to pRRU groups in which the first pRRU in the plurality of pRRUs is located, wherein pRRUs in the pRRU groups share the initial neighbor cell information, and the initial neighbor cell information comprises identification of M neighbor cells; transmitting a measurement instruction to a terminal in a first pRRU coverage area through a first pRRU, and receiving N adjacent area identifications measured by the terminal in the first pRRU coverage area according to the measurement instruction; according to the identification of the M adjacent cells and the identification of the N adjacent cells, determining that the adjacent cells of the first pRRU comprise L adjacent cells, wherein the L adjacent cells belong to the M adjacent cells and the N adjacent cells at the same time. By adopting the method, the neighbor cell management based on pRRU level can be realized.

Description

Neighbor cell management method and device

Technical Field

The present disclosure relates to the field of wireless communications technologies, and in particular, to a method and an apparatus for neighbor cell management.

Background

The fifth generation mobile communication technology (English: 5th Generation Mobile Communication Technology, abbreviated as 5G) indoor distributed system is divided into three-stage architecture, which is respectively a baseband unit (English: building Base band Unit, abbreviated as BBU), an expansion unit (HUB) and a miniature remote radio frequency unit (English: picro Remote Radio Unit, abbreviated as pRRU). One BBU may be connected to one or more HUB, one HUB may be connected to a plurality of pRRU, each covering an area.

However, since the current neighbor cell management is based on the cell level, that is, a plurality of prrus deployed under the same cell may share all neighbor cells of the cell, and thus may cause abnormal handover and performance abnormality between cells and between neighbor cells.

Therefore, further research is still needed on how to manage the neighbor cells.

Disclosure of Invention

The application provides a neighbor cell management method and device, which are used for realizing neighbor cell management based on pRRU level.

In a first aspect, an embodiment of the present application provides a method for neighbor cell management, where the method may be performed by a neighbor cell management apparatus, and the method includes: determining initial neighbor cell information of a first pRRU in the plurality of pRRUs according to pRRU groups in which the first pRRU is located, wherein pRRUs in the pRRU groups share the initial neighbor cell information, and the initial neighbor cell information comprises identification of M neighbor cells; transmitting a measurement instruction to a terminal in the coverage area of the first pRRU through the first pRRU, and receiving the N adjacent cell identifications measured by the terminal according to the measurement instruction; determining that the neighbor cell of the first pRRU comprises L neighbor cells according to the identifiers of the M neighbor cells and the N neighbor cells, wherein the L neighbor cells belong to the M neighbor cells and the N neighbor cells at the same time; wherein M is an integer greater than or equal to 1, N and L are integers greater than or equal to 0, L is less than or equal to M, and L is less than or equal to N.

By adopting the neighbor cell management method in the embodiment of the application, the neighbor cell management of pRRU level can be realized, the initial neighbor cell information is determined by grouping pRRUs, pRRUs in the pRRU groups share the initial neighbor cell information, the initial neighbor cell measurement process can be simplified, the initial neighbor cell measurement time can be saved, and the neighbor cell measurement efficiency can be improved.

In one possible implementation, the method further includes: acquiring a switching failure rate corresponding to each adjacent cell of the first pRRU, wherein the switching failure rate corresponding to each adjacent cell is the switching failure rate of a terminal in the coverage area of the first pRRU to each adjacent cell in a preset time period; and if the switching failure rate corresponding to the first neighbor cell of the first pRRU is larger than a preset threshold, deleting the first neighbor cell from the neighbor cell of the first pRRU.

In one possible implementation, the method further includes: if the switching failure rate corresponding to the first neighbor cell is smaller than a preset threshold value, according to an abnormal switching scene that a terminal in the first pRRU coverage area is switched to the first neighbor cell in the preset time period, switching parameters of the first neighbor cell are adjusted.

In one possible implementation, the M neighbors include M1 neighbors and M2 neighbors; the M1 neighbor cells are determined according to neighbor cell measurement results of terminals in the first pRRU coverage area aiming at K1 frequency points, and the M2 neighbor cells are determined according to neighbor cell measurement results of terminals in other pRRU coverage areas except the first pRRU in the pRRU group aiming at K2 frequency points; m1 and M2 are integers greater than or equal to 0, and K1 and K2 are integers greater than or equal to 1.

In a possible implementation manner, the measurement instruction is used for instructing the terminal to measure for the K2 frequency points; the neighbor cells of the first pRRU further include the M1 neighbor cells.

In a possible implementation manner, according to the identifications of the L adjacent cells and the N adjacent cells, determining P adjacent cells, where the identifications of the P adjacent cells belong to the identifications of the N adjacent cells, but do not belong to the identifications of the L adjacent cells; the neighbor cells of the first pRRU further include the P neighbor cells, where P is an integer greater than or equal to 0.

In a possible implementation manner, the determining, according to the pRRU packet where the first pRRU of the plurality of prrus is located, initial neighbor information of the first pRRU includes: the first pRRU belongs to a first pRRU packet, and neighbor cell information of the first pRRU packet is first initial neighbor cell information; the second pRRU belongs to a second pRRU packet, and the neighbor cell information of the second pRRU packet is second initial neighbor cell information; and determining initial neighbor cell information of the first pRRU according to the first initial neighbor cell information and the second initial neighbor cell information, wherein the initial neighbor cell information of the first pRRU is a union set of the first initial neighbor cell information and the second initial neighbor cell information.

In a second aspect, an embodiment of the present invention provides a neighbor cell management device, where the device includes a determining module, configured to determine initial neighbor cell information of a first pRRU according to a pRRU packet in which the first pRRU is located in the multiple prrus, where the pRRU in the pRRU packet shares the initial neighbor cell information, and the initial neighbor cell information includes identifiers of M neighbor cells; the processing module is used for sending a measurement instruction to a terminal in the coverage area of the first pRRU through the first pRRU and receiving N adjacent cell identifiers measured by the terminal according to the measurement instruction; the determining module is further configured to determine, according to the identifiers of the M neighbor cells and the identifiers of the N neighbor cells, that the neighbor cell of the first pRRU includes L neighbor cells, where the L neighbor cells belong to the M neighbor cells and the N neighbor cells at the same time; wherein M is an integer greater than or equal to 1, N and L are integers greater than or equal to 0, L is less than or equal to M, and L is less than or equal to N.

In one possible implementation, the apparatus further includes: the acquisition module is used for acquiring a switching failure rate corresponding to each adjacent cell of the first pRRU, wherein the switching failure rate corresponding to each adjacent cell is the switching failure rate of a terminal in the coverage area of the first pRRU to each adjacent cell in a preset time period; the processing module is further configured to delete the first neighbor cell from the neighbor cells of the first pRRU if a handover failure rate corresponding to the first neighbor cell of the first pRRU is greater than a preset threshold.

In one possible implementation, the processing module is further configured to: if the switching failure rate corresponding to the first neighbor cell is smaller than a preset threshold value, according to an abnormal switching scene that a terminal in the first pRRU coverage area is switched to the first neighbor cell in the preset time period, switching parameters of the first neighbor cell are adjusted.

In one possible implementation, the M neighbors include M1 neighbors and M2 neighbors; the M1 neighbor cells are determined according to neighbor cell measurement results of terminals in the first pRRU coverage area aiming at K1 frequency points, and the M2 neighbor cells are determined according to neighbor cell measurement results of terminals in other pRRU coverage areas except the first pRRU in the pRRU group aiming at K2 frequency points; m1 and M2 are integers greater than or equal to 0, and K1 and K2 are integers greater than or equal to 1.

In a possible implementation manner, the measurement instruction is used for instructing the terminal to measure for the K2 frequency points; the neighbor cells of the first pRRU further include the M1 neighbor cells.

In a possible implementation manner, the determining module is further configured to determine P neighbors according to the identifiers of the L neighbors and the N neighbors, where the identifiers of the P neighbors belong to the identifiers of the N neighbors, but do not belong to the identifiers of the L neighbors; the neighbor cells of the first pRRU further include the P neighbor cells, where P is an integer greater than or equal to 0.

In a possible implementation manner, the determining module determines initial neighbor information of a first pRRU in the plurality of prrus according to a pRRU packet where the first pRRU is located, and specifically includes: the first pRRU belongs to a first pRRU packet, and neighbor cell information of the first pRRU packet is first initial neighbor cell information; the second pRRU belongs to a second pRRU packet, and the neighbor cell information of the second pRRU packet is second initial neighbor cell information; and determining initial neighbor cell information of the first pRRU according to the first initial neighbor cell information and the second initial neighbor cell information, wherein the initial neighbor cell information of the first pRRU is a union set of the first initial neighbor cell information and the second initial neighbor cell information.

In a third aspect, an embodiment of the present invention further provides a neighbor cell management apparatus, where the apparatus includes a memory and a processor, where the memory is configured to store a computer program or instructions; the processor is configured to invoke a computer program or instructions stored in the memory to perform a method as in any of the possible implementations of the first aspect.

In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium having instructions stored therein, which when read and executed by a computer, cause the computer to perform a method as in any one of the possible implementations of the first aspect.

In a fifth aspect, the present invention provides a computer program product having instructions stored therein, which when read and executed by a computer, cause the computer to perform the method of any one of the possible implementations of the first aspect.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it will be apparent that the drawings in the following description are only some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic diagram of neighbor cell deployment according to an embodiment of the present invention;

fig. 2 is a schematic diagram of another neighbor cell deployment provided in an embodiment of the present invention;

fig. 3 is a schematic flow chart corresponding to a neighbor cell management method according to an embodiment of the present invention;

fig. 4 is a schematic diagram of pRRU grouping provided in an embodiment of the present invention;

fig. 5 is a schematic diagram of an internal module of a neighboring cell management apparatus according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of a neighbor cell management apparatus according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

As communication technology advances, a 5G communication system is also gradually applied, and in the 5G communication system, a communication area covered by one base station may be divided into one or more cells. The neighbor cell management method in the existing communication system is based on the cell level, that is, each cell has a corresponding neighbor cell list, that is, all prrus deployed under the cell will share all neighbor cells of the cell. However, when all prrus deployed under a cell will share all neighbors of the cell, handover anomalies as well as performance anomalies of the terminal may result. Two possible switching anomaly scenarios are described below in connection with scenario 1 and scenario 2.

(1) Scene 1

Fig. 1 is a schematic diagram of neighbor cell deployment according to an embodiment of the present invention. As shown in fig. 1, the BBUs are connected to one HUB and one HUB is connected to 2 prrus, which 2 prrus are deployed in a building, such as pRRU1 on floor 1 and pRRU2 on floor 2 of the building. Assuming that the area where the building is located is cell 1, the neighbor cell of cell 1 includes cell 2, and since pRRU deployed below cell 1 would share all neighbor cells of the cell, both the neighbor cells of pRRU1 and pRRU2 include cell 2. Normally, the door (or outlet) of the building is set at the 1 st floor, and as pRRU1 is deployed at the 1 st floor of the building, the terminal can move out of the building through the door of the 1 st floor of the building and further move from cell 1 to cell 2, so that after the terminal moves to cell 2, the terminal can be smoothly switched to cell 2; while pRRU2 is deployed at floor 2 of the building, it is impossible for the terminal to move out of the building from floor 2 of the building, so if the terminal is located in an edge region covered by pRRU2 at floor 2 of the building (e.g., a vertical dashed region in the coverage region of pRRU2 in fig. 1), a ping-pong handover problem may occur.

In this scenario, if the handover parameters (CELL INDIVIDAL OFFSET, abbreviated as CIO) of the cell 2 are adjusted to reduce the ping-pong handover problem of the terminal located in the edge area covered by the pRRU2, the performance of the handover from the cell 1 to the cell 2 may be affected when the terminal located in the coverage area of the pRRU1 moves to the cell 2. For example, when the CIO parameter of the cell 2 is reduced and the handover difficulty of the terminal from the cell 1 to the cell 2 is increased, although ping-pong handover of the terminal located in the edge area covered by the pRRU2 can be reduced, it may also cause that the terminal located in the coverage area of the pRRU1 cannot be successfully handed over to the cell 2 when moving to the cell 2.

If cell 2 is deleted from the neighbor cells of cell 1, that is, cell 2 is no longer the neighbor cell of cell 1, handover performance of the terminal located in the coverage area of pRRU1 will also be affected.

Therefore, since the neighbor cells of pRRU1 and pRRU2 deployed below cell 1 are shared, when the neighbor cell parameters of pRRU2 are changed, the neighbor cell parameters of pRRU1 are also changed.

(2) Scene 2

Fig. 2 is a schematic diagram of another neighbor cell deployment according to an embodiment of the present invention. As shown in fig. 2, the large flat layer is indicated by square areas in the figure, pRRU1, pRRU2, pRRU3 and pRRU4 are deployed at different orientations of the large flat layer, the large flat layer is located in cell 3, the neighbor of cell 3 includes cell a, cell B, cell C and cell D, and coverage areas of cell a, cell B, cell C and cell D and coverage areas of pRRU1, pRRU2, pRRU3 and pRRU4 are shown in fig. 2. If the cell frequency point and the cell physical identifier (Physical Cell Identifier, abbreviated as PCI) of the cell A and the cell C are the same, when the terminal is located in the area covered by the cell C, the acquired frequency point and PCI are reported to the BBU of the management cell 3, and the BBU queries the neighbor cell of the cell 3 according to the received frequency point and PCI, and finds that the neighbor cell A and the neighbor cell C of the cell 3 have the same frequency point and PCI, so the BBU cannot accurately judge whether the terminal should be switched to the neighbor cell A or the neighbor cell C, namely the problem of abnormal switching occurs.

One solution is to add an independent 5G module under each pRRU deployed in a cell, where the 5G module can be used to simulate a terminal to measure the neighbor cell of each pRRU, and report the neighbor cell of each pRRU to the BBU that manages the pRRU, so as to determine the neighbor cell of each pRRU respectively. However, this method greatly increases the hardware cost, and the signal receiving range is problematic.

Another solution is to have pRRU manage one cell individually, so that deploying multiple prrus in one cell is changed to deploying one pRRU in one cell, thus, the number of cells will increase greatly, since the number of cells that one BBU can manage is limited, more BBUs need to be deployed, and in addition, the more the number of cells, the more complex the operation and maintenance management of cells will be, and the management cost will increase accordingly.

Based on the foregoing, the embodiment of the invention provides a neighbor cell management method, which is used for realizing neighbor cell management based on pRRU level.

Fig. 3 is a flow chart corresponding to a neighbor cell management method according to an embodiment of the present invention. This procedure may be performed by the BBU managing pRRU. As shown in fig. 3, the process includes the steps of:

step 301, the bbu determines initial neighbor information of a first pRRU according to a pRRU packet in which the first pRRU is located in the plurality of prrus, where the prrus in the pRRU packet share the initial neighbor information, and the initial neighbor information includes identifiers of M neighbors.

Illustratively, after the plurality of pRRU deployments managed by the BBU are completed, the BBU may divide the plurality of prrus deployed in the same cell into a plurality of pRRU groups based on the location information of the plurality of pRRU deployments (or coverage areas of the plurality of prrus). For example, the BBU may divide at least one pRRU with adjacent coverage areas into the same pRRU packet, and the specific implementation of BBU division of the pRRU packet is not limited in the embodiments of the present application. It is to be appreciated that the BBU can partition any one of a plurality of prrus into one pRRU packet; alternatively, the pRRU may be divided into multiple pRRU packets, i.e., one pRRU may be added to a different pRRU packet.

Fig. 4 is a schematic diagram of pRRU packets, as shown in fig. 4, in the schematic diagram of pRRU packets, there is one BBU, one BBU is connected to one HUB, and one HUB is connected to 7 prrus, alternatively, the number of one BBU connected to one HUB may be plural, and the number of one HUB connected to one pRRU may be plural, which is not limited herein. 7 pRRU is pRRU1, pRRU 2..prru 7, the 7 pRRU is divided into three pRRU groups altogether, wherein pRRU1, pRRU2 and pRRU3 are divided into pRRU group 1; pRRU3, pRRU4, and pRRU5 are divided into pRRU group 3; pRRU5, pRRU6 and pRRU7 are divided into pRRU group 2, pRRU3 can be added to pRRU group 1 and pRRU group 3 simultaneously, pRRU5 can be added to pRRU group 3 and pRRU group 2 simultaneously.

For example, the first pRRU is pRRU1, and the pRRU packet in which the first pRRU is located is pRRU packet 1. The BBU can send a neighbor cell measurement instruction 1 to a terminal 1 in the pRRU1 coverage area through pRRU1, wherein the neighbor cell measurement instruction 1 is used for indicating the terminal to perform neighbor cell measurement aiming at K1 frequency points, and the neighbor cell measurement instruction 1 comprises frequency point information of the K1 frequency points. The number of frequency points supported by 5G and the number of pRRU in pRRU packet 1 may be determined, for example, the number of frequency points supported by 5G is divided by the number of pRRU in pRRU packet 1 to obtain K1, if the number of frequency points supported by 5G is 15 and the number of pRRU in pRRU packet 1 is 3, then measurement instruction 1 sent by the BBU through terminal 1 in the coverage area of pRRU1 includes frequency point information of 5 frequency points, and the 5 frequency points may be any 5 frequency points in 15 frequency points, and the application is not limited specifically how to allocate the 5 frequency points.

Neighbor cell measurement typically includes two steps, the first step: aiming at K1 frequency points included in the neighbor cell measurement instruction 1, the terminal 1 firstly and simultaneously measures PCI values under the K1 frequency points, and the second step is that: and carrying out neighbor cell measurement one by one according to the measured multiple { frequency points and PCI }. Assuming that the terminal 1 is responsible for measuring the frequency point information of the frequency points 1-5, if the frequency point 1, the PCI value 100, the frequency point 3 and the PCI value 120 are measured, then carrying out neighbor cell measurement one by one according to { frequency point 1, PCI 100} and { frequency point 3, PCI120 }. Since the neighbor cell measurement includes two steps, and the PCI measurement is only the first step in the neighbor cell measurement, the neighbor cell measurement has more steps than the PCI measurement, i.e., the complexity of the neighbor cell measurement is higher than the complexity of the PCI measurement.

If the terminal measures M1 neighboring cells for K1 frequency points, the neighboring cell measurement result can be reported to the BBU through pRRU1, and the neighboring cell measurement result can comprise related information of the M1 neighboring cells. The related information of the M1 neighbor cells may include information such as identifiers of the M1 neighbor cells and CIO parameters, and the identifiers of the neighbor cells may include frequency point information and PCI of the neighbor cells.

The BBU can send a neighbor cell measurement instruction 2 to a terminal 2 in the pRRU2 coverage area through pRRU2, wherein the neighbor cell measurement instruction 2 is used for indicating the terminal 2 to perform neighbor cell measurement aiming at K21 frequency points, and the neighbor cell measurement instruction 2 comprises frequency point information of the K21 frequency points; correspondingly, if M21 neighbor cells are obtained by measurement for K21 frequency points, the terminal 2 may report a neighbor cell measurement result to the BBU through pRRU2, where the neighbor cell measurement result may include related information of the M21 neighbor cells.

The BBU can send a neighbor cell measurement instruction 3 to a terminal 3 in the pRRU3 coverage area through pRRU3, wherein the neighbor cell measurement instruction 3 is used for instructing the terminal 3 to perform neighbor cell measurement aiming at K22 frequency points, and the neighbor cell measurement instruction 3 comprises frequency point information of the K22 frequency points; correspondingly, if M22 neighbor cells are measured for K22 frequency points, the terminal 3 may report a neighbor cell measurement result to the BBU through the pRRU3, where the neighbor cell measurement result may include information about the M22 neighbor cells. Wherein m21+m22=m2, k21+k22=k2.

Therefore, the BBU can aggregate related information of neighbor cells reported by terminals in all pRRU coverage areas in pRRU packet 1 and share the information to the pRRU in pRRU packet 1, so that each neighbor cell of the pRRU in pRRU packet 1 includes M neighbor cells. The M neighbor cells include M1 neighbor cells and M2 neighbor cells, wherein the M1 neighbor cells are determined according to neighbor cell measurement results of terminals in the pRRU1 coverage area for K1 frequency points, and the M2 neighbor cells are determined according to neighbor cell measurement results of terminals in other pRRU coverage areas except for pRRU1 in the pRRU packet for K2 frequency points (including K21 frequency points and K22 frequency points).

For example, if the K1 frequency points include frequency points 1-5, the frequency point of each of the M1 neighboring cells may be any one of the frequency points 1-5; the K21 frequency points comprise frequency points 6-10, and the frequency point of each adjacent cell in the M21 adjacent cells can be any frequency point in the frequency points 6-10; the K22 frequency points include frequency points 11-15, and the frequency point of each of the M22 neighboring cells may be any one of the frequency points 11-15.

It can be understood that in the embodiment of the present application, the case where each pRRU in the pRRU packet performs neighbor measurement for a different frequency point is described as an example, and in other possible embodiments, each pRRU in the pRRU packet may also perform neighbor measurement according to all frequency points. For example, the number of frequency points supported by 5G is 15, the 15 frequency points are frequency points 1 to 15, 3 pRRU are in the pRRU1 group, so that pRRU1 can perform neighbor cell measurement according to frequency points 1 to 15, and pRRU2 and pRRU3 can also perform neighbor cell measurement according to frequency points 1 to 15.

Alternatively, in other possible embodiments, only one pRRU1 in the pRRU packet may perform neighbor measurement according to all frequency points. For example, the number of frequency points supported by 5G is 15, the 15 frequency points are frequency points 1 to 15, and prru1 can perform neighbor cell measurement according to the frequency points 1 to 15.

Neighbor cell information of each pRRU can be accurately determined by carrying out neighbor cell measurement on all frequency points through pRRUs in pRRU groups, but the neighbor cell measurement efficiency for all frequency points supported by 5G is lower due to more neighbor cell measurement steps. Therefore, by sharing neighbor cell information measured by terminals in pRRU coverage areas except pRRU1 in pRRU groups to pRRU1 in pRRU groups and combining neighbor cell information measured by terminals in pRRU1 coverage areas, pRRU1 obtains neighbor cell information of M initial neighbor cells, neighbor cell measurement efficiency can be greatly improved, and especially in the case of more frequency points to be measured and more neighbor cells, neighbor cell measurement efficiency is improved more obviously.

In step 302, the bbu sends a measurement instruction to a terminal in a first pRRU coverage area through a first pRRU, and receives N neighbor cell identifiers measured by the terminal in the first pRRU coverage area according to the measurement instruction.

For example, the BBU may send, through the first pRRU, a measurement instruction to a terminal in the coverage area of the first pRRU, where the measurement instruction may be a PCI measurement instruction, and the measurement instruction is used to instruct the terminal in the coverage area of the first pRRU to perform a PCI measurement.

In one example, the PCI measurement instruction is to instruct terminals within the coverage area of the first pRRU to perform PCI measurements for K2 frequency points. Correspondingly, the terminal can perform PCI measurement on K2 frequency points according to the PCI measurement instruction, if the terminal obtains N adjacent area identifiers through measurement, the N adjacent area identifiers can be reported to the BBU through the first pRRU, and the N adjacent area identifiers comprise the frequency points and PCI information of the N adjacent areas.

For example, if the first pRRU is pRRU1, and assuming that the terminal in the pRRU1 coverage area performs the neighbor measurement for the frequency points 1-5, the terminal in the pRRU2 coverage area performs the neighbor measurement for the frequency points 6-10, and the terminal in the pRRU3 coverage area performs the neighbor measurement for the frequency points 11-15, the PCI measurement instruction sent by the BBU to the terminal in the pRRU1 coverage area through the pRRU1 may be used to instruct the terminal in the pRRU1 coverage area to perform the measurement for K2 frequency points, where K2 frequency points include the frequency points 6-15. That is, the frequency point of each frequency point in the N neighboring cells may be any one of the frequency points 6 to 15.

It is to be appreciated that in other examples, the PCI measurement instruction is to instruct terminals within the coverage area of the first pRRU to perform PCI measurements for all frequency points (i.e., k1+k2 frequency points). In this case, the frequency point of each frequency point in the N neighboring cells may be any one of the frequency points 1 to 15. That is, terminals within the coverage area of pRRU1 may measure for K2 frequency points, or may measure for all frequency points (k1+k2 frequency points). Since the terminal in the pRRU1 coverage area has performed one neighbor measurement for K1 frequency points in S301 and the first step of the neighbor measurement is PCI measurement, the terminal in the pRRU1 coverage area has performed one PCI measurement for K1 frequency points in S301, and thus, if measurements are performed for all frequency points (k1+k2 frequency points), there will be repeated measurements for K1 frequency points.

In addition, taking pRRU1 as an example, the terminal for performing neighbor measurement and the terminal for performing PCI measurement in the coverage area of pRRU1 may be the same terminal, or may be different terminals, which is not limited in the embodiment of the present application.

Step 303, determining that the neighbor cell of the first pRRU includes L neighbor cells according to the identifiers of the M neighbor cells and the identifiers of the N neighbor cells, where the L neighbor cells belong to the M neighbor cells and the N neighbor cells at the same time.

For example, if the PCI measurement instruction is used to instruct the terminal in the coverage area of the first pRRU to perform PCI measurement for all frequency points (i.e., k1+k2 frequency points), the BBU may compare the identifiers of the M neighboring cells with the identifiers of the N neighboring cells, and further, keep the identifiers of the M neighboring cells with the same frequency point and the same PCI value in the identifiers of the N neighboring cells, that is, keep L neighboring cells that belong to the M neighboring cells and the N neighboring cells at the same time, and determine that the neighboring cells of the first pRRU include the L neighboring cells.

If the PCI measurement instruction is used for indicating that the terminal in the coverage area of the first pRRU performs PCI measurement for K2 frequency points, the BBU may compare the identifier of the M2 neighboring cells with the identifier of the N neighboring cells, so as to keep the identifiers of the M2 neighboring cells and the neighboring cells with the same frequency points and the same PCI value in the identifiers of the N neighboring cells, that is, keep L neighboring cells that belong to the M2 neighboring cells and the N neighboring cells at the same time, and determine that the neighboring cells of the first pRRU include the M1 neighboring cells and the L neighboring cells.

For example, pRRU1 of pRRU packet 1 has M neighbors, which may be neighbor 1 with frequency point 1 and PCI value 100; a frequency point is 5, a PCI value is 150, a neighboring cell 2 and a frequency point is 10, and a PCI value is 120, wherein the frequency point is 1, the PCI value is 100, the neighboring cell 1 and the frequency point are 5, the PCI value is 150, the neighboring cell 2 is the neighboring cell of pRRU1 shared by other two pRRU2 and pRRU3 except pRRU1 in pRRU1, the frequency point is 10, and the PCI value is 120, the neighboring cell 3 is the neighboring cell information measured by the terminal in pRRU1 coverage area. Namely, the M (3) neighboring cells include M1 (1) neighboring cell 3 with a pci value of 120, and M2 (2) neighboring cells 1 with a frequency point of 1, a pci value of 100, and a neighboring cell 2 with a frequency point of 5 and a pci value of 150, respectively.

pRRU1 also has N neighbors, where only 1 neighbor is used to represent N neighbors, and if pRRU1 has neighbor 1 with a frequency point of 1 and a pci value of 100. Comparing the identifications of the M adjacent cells with the identifications of the N adjacent cells, and reserving adjacent cells with the same frequency point and the same PCI value in the identifications of the M adjacent cells and the identifications of the N adjacent cells to obtain L adjacent cells simultaneously belonging to the M adjacent cells and the N adjacent cells, namely obtaining an adjacent cell 1 with the frequency point of 1 and the PCI value of 100. For the neighbor cell 2 with the frequency point of 5 and the PCI value of 150, deleting the neighbor cell from the neighbor cell of pRRU1, and for the neighbor cell 3 with the frequency point of 10 and the PCI value of 120, reserving the neighbor cell.

In a possible manner, since the identities of N neighbors of the pRRU1 are measured by the terminal in the coverage area of the pRRU1 for K2 frequency points, and the M neighbors include M2 neighbors, and the identities of M2 neighbors are measured by the terminal in the coverage area of the pRRU other than the pRRU1 in the pRRU packet for K2 frequency points, the identities of N neighbors may include the same frequency point as the identities of M2 neighbors, and the identities of the neighboring neighbors with different PCI values. If the identifiers of N neighboring cells of pRRU1 include identifiers with the same frequency point as the identifiers of M neighboring cells but different PCI values, for example, the M neighboring cells include neighboring cell 1 with the frequency point of 1 and the PCI value of 100, but the N neighboring cells include neighboring cell 4 with the frequency point of 1 and the PCI value of 10, and since the two neighboring cells have the same frequency point but different PCI values, the neighboring cell 1 with the frequency point of 1 and the PCI value of 100 in the M initial neighboring cells is deleted from the initial neighboring cell list of pRRU1, and for the neighboring cell 4 with the frequency point of 1 and the PCI value of 10, the neighboring cell of pRRU1 is added.

It will be appreciated that one pRRU may also belong to a different pRRU packet, as shown in fig. 4, pRRU3 belongs to pRRU packet 1, and also to pRRU packet 3, pRRU packet 1 includes pRRU1, pRRU2 and pRRU3; pRRU group 3 includes pRRU3, pRRU4, and pRRU5. The pRRU3 has first initial neighbor information and second initial neighbor information, wherein the first initial neighbor information is obtained by neighbor measurement of terminals in a pRRU3 coverage area, terminals in a pRRU1 coverage area and terminals in a pRRU2 coverage area, and the second initial neighbor information is obtained by neighbor measurement of terminals in a pRRU3 coverage area, terminals in a pRRU4 coverage area and terminals in a pRRU5 coverage area.

For example, if the number of frequency points supported by 5G is 15, such as frequency points 1-15, all prrus in pRRU group 1 need to measure neighbor information under the 15 frequency points in total, and pRRU in pRRU group 3 needs to measure neighbor information under the 15 frequency points. Firstly, the BBU sends a measurement instruction 3 through a terminal 3 in the pRRU3 coverage area, the measurement instruction 3 comprises frequency point information of 5 frequency points in 15 frequency points, such as frequency points 11-15, the terminal 3 performs neighbor measurement on the frequency points 11-15, secondly, the BBU distributes neighbor information under the rest frequency points (frequency points 1-10) to terminals in pRRU1 and pRRU2 coverage areas except pRRU3 in pRRU group 1 for measurement, and distributes terminals in pRRU4 and pRRU5 coverage areas except pRRU3 in pRRU group 3 for measurement. If the terminal 3 in the pRRU3 coverage area is aimed at the frequency points 11-15, measuring to obtain neighbor information of M22 neighbor cells, sharing the neighbor information of the M22 neighbor cells to pRRU1 and pRRU2 in pRRU group 1, and sharing the neighbor information of the M22 neighbor cells to pRRU4 and pRRU5 in pRRU group 3, and if the terminal in the pRRU1 coverage area is measured to obtain neighbor information of the M1 neighbor cells; terminal measurement in pRRU2 coverage area obtains neighbor cell information of M21 neighbor cells; terminal measurement in pRRU4 coverage area obtains X1 pieces of neighbor information; terminal in pRRU5 coverage area measures and obtains X2 pieces of adjacent cell information, then initial adjacent cell information of pRRU1 is adjacent cell information of M1+M21+M22 adjacent cells; the initial neighbor information of pRRU2 is neighbor information of M1+M21+M22 neighbors; the first initial neighbor information of the pRRU3 is neighbor information of X neighbors, the second initial neighbor information of the pRRU3 is neighbor information of Y neighbors, where x=m22+m1+m2, y=m22+x1+x2, because the same neighbors may exist in the X neighbors and the Y neighbors, the same neighbors need to be removed when determining the initial neighbor of the pRRU3, and therefore, the initial neighbor information of the pRRU3 includes M neighbor information, where the M neighbor information is a union of the neighbor information of the X neighbors and the neighbor information of the Y neighbors; the initial neighbor information of pRRU4 is neighbor information of M22+X1+X2 neighbors; the initial neighbor information of pRRU5 is neighbor information of m22+x1+x2 neighbors.

Further, taking pRRU3 as an example, PCI measurement is performed on frequency points 1-10 by a terminal in the pRRU3 coverage area to obtain N adjacent cell identifiers, and L adjacent cells of pRRU3 are determined according to the adjacent cell identifiers in M adjacent cell information and the N adjacent cell identifiers, wherein the L adjacent cells belong to the M adjacent cells and the N adjacent cells at the same time. And determining L adjacent cells of pRRU3 according to the adjacent cell identifiers in the M adjacent cell information and the N adjacent cell identifiers, wherein the adjacent cells in the L adjacent cells are contained in the adjacent cell information of the M adjacent cells and also contained in the adjacent cell information of the N adjacent cells. Thus, the neighbor cells of pRRU3 include M22 neighbor cells and L neighbor cells.

In addition, terminals in the coverage area of pRRU3 may be responsible for measuring neighbor information under different frequency points in pRRU packet 1 and pRRU packet 3, for example, the number of frequency points supported by 5G is frequency points 1-15, terminals in the coverage area of pRRU3 in pRRU1 packet 1 are responsible for measuring neighbor information under frequency points 11-15, terminals in the coverage area of pRRU1 and pRRU2 are responsible for measuring neighbor information under frequency points 1-10, terminals in the coverage area of pRRU3 in pRRU1 packet 3 may be responsible for measuring neighbor information under frequency points 1-5, terminals in the coverage area of pRRU1 and pRRU2 are responsible for measuring neighbor information under frequency points 6-15, and thus, the first initial neighbor information and the second initial neighbor information of pRRU3 and neighbor information of pRRU1, pRRU2, pRRU4 and pRRU5 may also be determined.

In summary, the determining the neighbor information of the first pRRU in the pRRU packet includes the following steps (this step is the case that the first pRRU belongs to one pRRU packet or the first pRRU belongs to two pRRU packets, but a terminal in the coverage area of the first pRRU is responsible for measuring the neighbor information under the same frequency point in the two pRRU packets):

1. a terminal in the first pRRU coverage area obtains neighbor cell information of M1 neighbor cells by measurement according to K1 frequency points; terminals in pRRU coverage areas except pRRU1 in pRRU groups commonly measure and obtain neighbor cell information of M2 neighbor cells according to K2 frequency points, wherein the M2 neighbor cell information can be obtained by commonly measuring a plurality of pRRU groups, and the M2 neighbor cell information does not contain the same neighbor cell information;

2. a terminal in the first pRRU coverage area obtains N { frequency points and PCI } through measurement according to K2 frequency points;

3. comparing { frequency point, PCI } in M2 pieces of neighbor cell information with N { frequency points, PCI } and selecting the same { frequency point, PCI } neighbor cell information to determine L pieces of neighbor cell information;

4. measuring neighbor cell information under the rest { frequency points and PCI } except { frequency points and PCI } which are the same as those in M2 neighbor cell information in N { frequency points and PCI } to determine P neighbor cell information;

5. and determining the L adjacent cell information, the P adjacent cell information and the M1 adjacent cell information as the adjacent cell information of pRRU 1.

After determining the neighbor cell of the first pRRU in step 303, the BBU may further optimize the neighbor cell of the first pRRU. For example, the BBU may collect a handover report of the terminal in each neighbor cell of the first pRRU, where the handover report includes information such as the number of handovers between each neighbor cell of the first pRRU, a handover failure rate (or a handover success rate), and the handover failure rate is a failure rate of the terminal in the coverage area of the first pRRU to each neighbor cell in a preset period of time. The preset time period may be one hour, one day or other time periods, and is not particularly limited herein.

Furthermore, taking the first neighbor cell of the first pRRU as an example, if the handover failure rate of the first neighbor cell is greater than or equal to the preset threshold 1, the BBU may delete the first neighbor cell from the neighbor cells of the first pRRU, that is, the first neighbor cell is no longer used as the neighbor cell of the first pRRU.

If the switching failure rate of the first neighbor cell is smaller than the preset threshold value 1, the BBU can adjust the switching parameters of the first neighbor cell according to the abnormal switching scene of the terminal in the coverage area of the first pRRU to switch to the first neighbor cell. The abnormal switching scene may include ping-pong switching, early switching, and late switching.

If the number of times of abnormal switching from the terminal in the coverage area of the first pRRU to the first neighbor cell is smaller than a preset threshold value 2, the switching parameters of the first neighbor cell of the first pRRU are not optimized; the abnormal switching may be one or more of the above abnormal switching scenes, and the preset threshold 2 may be a threshold of ping-pong switching times, or a threshold of early switching times or a threshold of too late switching times. If the number of abnormal switching times in the switching report of the first neighbor cell of the first pRRU is greater than or equal to a preset threshold value 2, the switching parameters of the first neighbor cell of the first pRRU are optimized. If the abnormal switching scene is ping-pong switching, if the ping-pong switching times in the switching report of the first neighbor cell of the first pRRU is greater than the threshold value of the ping-pong switching times, the switching parameter of the first neighbor cell of the first pRRU may be adjusted, specifically, the CIO parameter of the first neighbor cell may be adjusted down.

According to the neighbor cell management method, a plurality of neighbor cells can be accurately added into the neighbor cells of the pRRU, neighbor cell management based on pRRU level is achieved, so that the neighbor cells of each pRRU can be different, if the first neighbor cell of the pRRU is abnormal in switching, the first neighbor cell can be deleted or the switching parameters of the first neighbor cell can be optimized, the neighbor cell switching problem of other pRRUs is not influenced, and the problem in the scene 1 can be solved. For scene 2, if adjacent cells with the same frequency point and PCI value are divided into different groups, one adjacent cell with the same frequency point and PCI value of pRRU will not appear, and the situation of confusing adjacent cells in scene 2 will not appear. Further, the situation of detecting neighbor cell loss does not occur.

Fig. 5 is a schematic diagram of an internal module of a neighbor cell management device 5000 according to an embodiment of the present invention. As shown in fig. 5, the apparatus may include: the determining module 501, the processing module 502 and the obtaining module 503, and optionally further include a storage module, where the storage module is used to store computer instructions or programs, and the processing module 502 may call the computer instructions or programs in the storage module.

A determining module 501, configured to determine initial neighbor information of a first pRRU in the plurality of prrus according to a pRRU packet in which the first pRRU is located, where the prrus in the pRRU packet share the initial neighbor information, and the initial neighbor information includes identifiers of M neighbors; a processing module 502, configured to send a measurement instruction to a terminal in the first pRRU coverage area through the first pRRU, and receive N identifiers of neighboring cells measured by the terminal in the first pRRU coverage area according to the measurement instruction; the determining module 501 is further configured to determine, according to the M neighbor cells and the N neighbor cells, that the neighbor cell of the first pRRU includes L neighbor cells, where the L neighbor cells belong to the M neighbor cells and the N neighbor cells at the same time; wherein M is an integer greater than or equal to 1, N and L are integers greater than or equal to 0, L is less than or equal to M, and L is less than or equal to N.

In one possible implementation, the apparatus further includes: an obtaining module 503, configured to obtain a handover failure rate corresponding to each neighboring cell of the first pRRU, where the handover failure rate corresponding to each neighboring cell is a handover failure rate of a terminal in the coverage area of the first pRRU to each neighboring cell in a preset period of time; the processing module 502 is further configured to delete the first neighbor cell from the neighbor cells of the first pRRU if the handover failure rate corresponding to the first neighbor cell of the first pRRU is greater than a preset threshold.

In one possible implementation, the processing module 502 is further configured to: if the switching failure rate corresponding to the first neighbor cell is smaller than a preset threshold value, according to an abnormal switching scene that a terminal in the first pRRU coverage area is switched to the first neighbor cell in the preset time period, switching parameters of the first neighbor cell are adjusted.

In one possible implementation, the M neighbors include M1 neighbors and M2 neighbors; the M1 neighbor cells are determined according to neighbor cell measurement results of terminals in the first pRRU coverage area aiming at K1 frequency points, and the M2 neighbor cells are determined according to neighbor cell measurement results of terminals in other pRRU coverage areas except the first pRRU in the pRRU group aiming at K2 frequency points; m1 and M2 are integers greater than or equal to 0, and K1 and K2 are integers greater than or equal to 1.

In a possible implementation manner, the measurement instruction is used for instructing the terminal to measure for the K2 frequency points; the neighbor cells of the first pRRU further include the M1 neighbor cells.

In a possible implementation manner, the determining module 501 is further configured to determine P neighbors according to the identifiers of the L neighbors and the N neighbors, where the identifiers of the P neighbors belong to the identifiers of the N neighbors, but do not belong to the identifiers of the L neighbors; the neighbor cells of the first pRRU further include the P neighbor cells, where P is an integer greater than or equal to 0.

In a possible implementation manner, the determining module 501 is further configured to determine, according to a pRRU packet in which a first pRRU of the plurality of prrus is located, initial neighbor information of the first pRRU, where the determining module specifically includes: the first pRRU belongs to a first pRRU packet, and neighbor cell information of the first pRRU packet is first initial neighbor cell information; the second pRRU belongs to a second pRRU packet, and the neighbor cell information of the second pRRU packet is second initial neighbor cell information; and determining initial neighbor cell information of the first pRRU according to the first initial neighbor cell information and the second initial neighbor cell information, wherein the initial neighbor cell information of the first pRRU is a union set of the first initial neighbor cell information and the second initial neighbor cell information.

Fig. 6 is a schematic structural diagram of a neighbor cell management device 6000 according to an embodiment of the present invention. As shown in fig. 6, the device includes at least one processor 601 and a memory 602 connected to the at least one processor 601, in this embodiment of the present application, a specific connection medium between the processor 601 and the memory 602 is not limited, and in fig. 6, the processor 601 and the memory 602 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.

In the embodiment of the present invention, the memory 602 stores instructions executable by the at least one processor 601, and the at least one processor 601 may implement the steps of the neighbor cell management method by executing the instructions stored in the memory 602.

Where the processor 601 is the control center of the computer device, various interfaces and lines may be utilized to connect various portions of the computer device for resource setting by executing or executing instructions stored in the memory 602 and invoking data stored in the memory 602. Alternatively, the processor 601 may include one or more processing units, and the processor 601 may integrate an application processor and a modem processor, wherein the application processor primarily processes operating systems, user interfaces, application programs, and the like, and the modem processor primarily processes wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 601. In some embodiments, processor 601 and memory 602 may be implemented on the same chip, or they may be implemented separately on separate chips in some embodiments.

The processor 601 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, that can implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.

The memory 602 is a non-volatile computer readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs, and modules. The Memory 602 may include at least one type of storage medium, which may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 602 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 602 in the present embodiment may also be circuitry or any other device capable of implementing a memory function for storing program instructions and/or data.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.

Claims (10)

1. A method for neighbor cell management, the method being applied to a baseband unit for managing a plurality of micro remote radio units pRRU, the method comprising:

determining initial neighbor cell information of a first pRRU in the plurality of pRRUs according to pRRU groups in which the first pRRU is located, wherein pRRUs in the pRRU groups share the initial neighbor cell information, and the initial neighbor cell information comprises identification of M neighbor cells;

transmitting a measurement instruction to a terminal in the first pRRU coverage area through the first pRRU, and receiving N adjacent area identifications measured by the terminal in the first pRRU coverage area according to the measurement instruction;

determining that the neighbor cell of the first pRRU comprises L neighbor cells according to the identifiers of the M neighbor cells and the N neighbor cells, wherein the L neighbor cells belong to the M neighbor cells and the N neighbor cells at the same time; wherein M is an integer greater than or equal to 1, N and L are integers greater than or equal to 0, L is less than or equal to M, and L is less than or equal to N.

2. The method according to claim 1, wherein the method further comprises:

acquiring a switching failure rate corresponding to a first neighbor cell of the first pRRU, wherein the switching failure rate corresponding to the first neighbor cell is the switching failure rate of a terminal in the coverage area of the first pRRU to the first neighbor cell in a preset time period;

And if the switching failure rate corresponding to the first neighbor cell is larger than a preset threshold value, deleting the first neighbor cell from the neighbor cell of the first pRRU.

3. The method according to claim 2, wherein the method further comprises:

if the switching failure rate corresponding to the first neighbor cell is smaller than a preset threshold value, according to an abnormal switching scene that a terminal in the first pRRU coverage area is switched to the first neighbor cell in the preset time period, switching parameters of the first neighbor cell are adjusted.

4. A method according to any one of claims 1 to 3, wherein the M neighbors comprise M1 neighbors and M2 neighbors;

the M1 neighbor cells are determined according to neighbor cell measurement results of terminals in the first pRRU coverage area aiming at K1 frequency points, the M2 neighbor cells are determined according to neighbor cell measurement results of terminals in other pRRU coverage areas except the first pRRU in the pRRU group aiming at K2 frequency points, M1 and M2 are integers larger than or equal to 0, and K1 and K2 are integers larger than or equal to 1.

5. The method according to claim 4, wherein the measurement instruction is configured to instruct the terminal to measure for the K2 frequency points;

The neighbor cells of the first pRRU further include the M1 neighbor cells.

6. The method of claim 5, wherein P neighbors are determined based on the identities of the L neighbors and the N neighbors, the identities of the P neighbors belonging to the identities of the N neighbors but not to the identities of the L neighbors;

the neighbor cells of the first pRRU further include the P neighbor cells, where P is an integer greater than or equal to 0.

7. The method of claim 1, wherein the determining initial neighbor information for a first pRRU of the plurality of prrus from a pRRU packet in which the first pRRU is located comprises:

the first pRRU belongs to a first pRRU packet, and neighbor cell information of the first pRRU packet is first initial neighbor cell information;

the second pRRU belongs to a second pRRU packet, and the neighbor cell information of the second pRRU packet is second initial neighbor cell information;

and determining initial neighbor cell information of the first pRRU according to the first initial neighbor cell information and the second initial neighbor cell information, wherein the initial neighbor cell information of the first pRRU is a union set of the first initial neighbor cell information and the second initial neighbor cell information.

8. A neighbor cell management apparatus, comprising:

A determining module, configured to determine initial neighbor cell information of a first pRRU in the plurality of prrus according to a pRRU packet in which the first pRRU is located, where the prrus in the pRRU packet share the initial neighbor cell information, and the initial neighbor cell information includes identifiers of M neighbor cells;

the processing module is used for sending a measurement instruction to a terminal in the first pRRU coverage area through the first pRRU and receiving N adjacent area identifications measured by the terminal in the first pRRU coverage area according to the measurement instruction;

the determining module is further configured to determine, according to the identifiers of the M neighboring cells and the identifiers of the N neighboring cells, that the neighboring cells of the first pRRU include L neighboring cells, where the L neighboring cells belong to the M neighboring cells and the N neighboring cells at the same time, M is an integer greater than or equal to 1, N and L are integers greater than or equal to 0, L is less than or equal to M, and L is less than or equal to N.

9. A neighbor cell management apparatus, comprising:

a memory for storing a computer program or instructions;

a processor for invoking a computer program or instructions stored in the memory to perform the method of any of claims 1-7.

10. A computer readable storage medium having instructions stored therein which, when read and executed by a computer, cause the computer to perform the method of any one of claims 1 to 7.