CN107920370B - Method and device for optimizing neighbor relation - Google Patents
Method and device for optimizing neighbor relation Download PDFInfo
- Publication number
- CN107920370B CN107920370B CN201610878924.0A CN201610878924A CN107920370B CN 107920370 B CN107920370 B CN 107920370B CN 201610878924 A CN201610878924 A CN 201610878924A CN 107920370 B CN107920370 B CN 107920370B
- Authority
- CN
- China
- Prior art keywords
- neighbor
- switching
- relation
- relations
- cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0055—Transmission or use of information for re-establishing the radio link
- H04W36/0061—Transmission or use of information for re-establishing the radio link of neighbour cell information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
Abstract
The embodiment of the invention provides a method and a device for optimizing a neighboring cell relation, wherein the method comprises the following steps: acquiring a current neighbor relation table of a serving cell; acquiring the switching times and the switching success rate of each pair of adjacent relations and/or acquiring the adjacent discovery times of each pair of adjacent relations; and optimizing the current neighbor relation table of the serving cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations, so that switching of unreasonable neighbor intervals automatically added in actual network application by the conventional ANR function is reduced, and redundant neighbors are reduced.
Description
Technical Field
The present invention relates to the field of wireless technologies, and in particular, to a method and an apparatus for optimizing a neighbor relation.
Background
ANR (Automatic neighbor Relation), namely "Automatic neighbor Relation", means that the network side can automatically complete the configuration and optimization of the neighbor Relation table by means of the function of measuring and reporting the PCI (physical layer cell identity) and CGI (cell unique identity) of the surrounding neighbor cells by the UE.
Referring to fig. 1, a complete automatic ANR neighbor adding process is shown, and the process is simultaneously applicable to adding an intra-frequency neighbor and an inter-frequency neighbor.
After the UE accesses the network, the base station will issue measurement configuration (generally, a3 measurement event parameter) to the UE as a threshold and basis for neighbor measurement and reporting.
After the UE reports the PCI of the neighboring cell through an MR (measurement report) message, if the base station where the serving cell is located finds that the cell reported by the UE is an unknown neighboring cell (i.e., the neighboring cell relation table does not have information of the cell), the UE is instructed to read the CGI (including a PLMN (public land mobile network) number and a cell ID) of the cell through an RRC (radio resource control) reconfiguration message. After obtaining the CGI reported by the UE, the base station obtains the basic information of the cell, and adds the cell to the neighbor cell relation table.
The neighbor relation table records all neighbor information of a certain cell, including cell ID and corresponding neighbor relation attributes. The management of the neighbor relation table is mainly realized by setting the neighbor relation attribute. The neighbor relation attributes defined in the 3GPP protocol include three types:
no HO (handover prohibited): if a certain neighbor cell of a cell is set to "No HO," the UE cannot be handed over from the serving cell to the neighbor cell.
No X2 (prohibited X2): if a certain neighbor cell of a cell is set to "No X2", No procedures related to X2 will be allowed between the two cells, for example, through X2 port handover, mutual interference and load messages, etc.
No Remove (delete prohibited): if a certain neighbor of a cell is set to "No Remove", the neighbor relation cannot be deleted from the table in any case.
The three attributes can be manually set by network management personnel, and can also be automatically set by the system according to a certain algorithm.
When the existing ANR function is found in actual network application, after the function is started, a system may automatically add some unnecessary ultra-far neighbors (handover overlay cells) or other types of redundant neighbors, and the addition of the redundant neighbors may cause a decrease in the success rate of UE handover in the area or increase unnecessary handover, and occupy negative effects such as neighbor list resources.
Disclosure of Invention
In view of the foregoing technical problems, embodiments of the present invention provide a method and an apparatus for optimizing a neighbor relation, so as to reduce switching between unreasonable neighbor intervals that are automatically added in an actual network application by an ANR function in the prior art, and reduce redundant neighbors.
The embodiment of the invention provides a method for optimizing a neighboring cell relation, which comprises the following steps:
acquiring a current neighbor relation table of a serving cell;
acquiring the switching times and the switching success rate of each pair of adjacent relations and/or acquiring the adjacent discovery times of each pair of adjacent relations;
and optimizing the current neighbor relation table of the service cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations.
Optionally, the obtaining of the number of times of switching and the success rate of switching of each pair of neighboring cell relationships includes:
and taking the first preset time interval as a KPI (key performance indicator) switching statistical period, and counting the switching times and the switching success rate of each pair of adjacent relations.
Optionally, the obtaining of the number of times of discovering the neighboring cells of each pair of neighboring cell relationships includes:
and taking the second preset time interval as a neighbor discovery frequency counting period, and counting the neighbor discovery frequency of each pair of neighbor relations.
Optionally, performing optimization processing on the current neighboring cell relationship of the serving cell according to the switching times and the switching success rate of each pair of neighboring cell relationships, including:
and if the switching times of the adjacent cell relation are larger than a preset switching time threshold value and the switching success rate of the adjacent cell relation is smaller than a preset switching success rate threshold value, setting the attribute of the adjacent cell relation as switching prohibition and deletion prohibition.
Optionally, performing optimization processing on the current neighboring cell relationship of the serving cell according to the switching times and the switching success rate of each pair of neighboring cell relationships and the neighboring cell discovery times of each pair of neighboring cell relationships, including:
and if the switching times of the adjacent cell relations are less than or equal to a preset switching time threshold, the switching success rate of the adjacent cell relations is greater than or equal to a preset switching success rate threshold, and the adjacent cell discovery times of the adjacent cell relations are less than a preset adjacent cell discovery time threshold, setting the adjacent cell relation attributes as forbidden switching.
Optionally, after setting the neighbor relation attribute to prohibit handover, the method further includes:
and if the attribute of the neighbor relation is deletion prohibition, releasing the deletion prohibition attribute of the neighbor relation, and putting the neighbor relation into a list of neighbor relations to be deleted.
Optionally, the neighbor cell relations in the neighbor cell list to be deleted are arranged in the order of the number of neighbor cell discovery times from large to small.
Optionally, the method further comprises:
and if the triggering condition of the operation of deleting the neighbor relation is met, deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell.
The embodiment of the invention also provides a device for optimizing the relation of adjacent cells, which comprises:
a first obtaining module, configured to obtain a current neighbor relation table of a serving cell;
the second acquisition module is used for acquiring the switching times and the switching success rate of each pair of adjacent area relations and/or acquiring the adjacent area discovery times of each pair of adjacent area relations;
and the optimizing module is used for optimizing the current neighbor relation table of the serving cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations.
Optionally, the second obtaining module includes:
and the first statistic unit is used for taking the first preset time interval as a statistic period of the switching KPI, and counting the switching times and the switching success rate of each pair of adjacent area relations.
Optionally, the second obtaining module further includes:
and the second counting unit is used for counting the adjacent region discovery times of each pair of adjacent region relations by taking a second preset time interval as a counting period of the adjacent region discovery times.
Optionally, the optimization module comprises:
and the first optimization unit is used for setting the attribute of the neighboring cell relationship as switching prohibition and deletion prohibition if the switching times of the neighboring cell relationship are greater than a preset switching time threshold and the switching success rate of the neighboring cell relationship is less than a preset switching success rate threshold.
Optionally, the optimization module further comprises:
and the second optimization unit is used for setting the attribute of the neighboring cell relation as forbidden switching if the switching times of the neighboring cell relation are less than or equal to a preset switching time threshold, the switching success rate of the neighboring cell relation is greater than or equal to a preset switching success rate threshold, and the neighboring cell discovery times of the neighboring cell relation are less than a preset neighboring cell discovery time threshold.
Optionally, the apparatus further comprises:
and the canceling module is used for canceling the deletion prohibiting attribute of the neighboring cell relation and putting the neighboring cell relation into a neighboring cell relation list to be deleted if the neighboring cell relation attribute is deletion prohibiting.
Optionally, the neighbor cell relations in the neighbor cell list to be deleted are arranged in the order of the number of neighbor cell discovery times from large to small.
Optionally, the apparatus further comprises:
and the deleting module is used for deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell if the triggering condition of the operation of deleting the neighbor relation is met.
One of the above technical solutions has the following advantages or beneficial effects: the embodiment of the invention can automatically optimize the relation attribute of the adjacent cells and delete unnecessary redundant adjacent cells, reduce the switching of unreasonable adjacent cells automatically added in the actual network application by the conventional ANR function, and reduce redundant adjacent cells. Therefore, the switching success rate of the whole network is improved, the switching times are reduced, the number of adjacent cells in the adjacent cell relation table is reduced, and the resource consumption of the memory of the base station equipment is reduced.
Drawings
Fig. 1 is a schematic diagram of a normal ANR neighbor automatic addition process in the prior art;
FIG. 2 is a flowchart of a method for optimizing a neighboring cell relation according to a first embodiment of the present invention;
FIG. 3 is a flowchart of a method for optimizing a neighboring cell relation according to a second embodiment of the present invention;
fig. 4 is a flowchart of a method for optimizing deletion of a neighboring cell relation in a second embodiment of the present invention;
fig. 5 is a block diagram of a structure of an apparatus for optimizing a neighboring cell relation according to a third embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present invention may be embodied as a system, apparatus, device, method, or computer program product. Thus, embodiments of the invention may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
It should be noted that the terms first, second and the like in the description and in the claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises" and "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a series of steps or elements are included, but other steps or elements not expressly listed or inherent to such process, method, article, or apparatus may be included.
It should be noted that the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict. The technical solution of the present invention will be described in detail with reference to the accompanying drawings in conjunction with embodiments.
Example one
Referring to fig. 2, a method for optimizing a neighboring cell relation is shown, which includes the following specific steps:
in this embodiment, the current neighbor relation table of the serving cell may be obtained by using an existing obtaining manner, which is not described herein again.
for example, the first predetermined time interval is used as a handover KPI counting period to count the number of handovers and the handover success rate of each pair of neighboring relations, alternatively, the first predetermined time interval may be in units of hours, for example, 1 hour, but is not limited thereto.
For example, the second predetermined time interval is taken as a neighbor discovery number counting period to count the neighbor discovery number of each pair of neighbor relations, optionally, the second predetermined time interval may be taken in units of days, for example, 1 day, and of course, the present invention is not limited thereto.
And 203, optimizing the current neighbor relation table of the serving cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations.
And if the switching times of the adjacent cell relation are larger than a preset switching time threshold value and the switching success rate of the adjacent cell relation is smaller than a preset switching success rate threshold value, setting the attribute of the adjacent cell relation as switching prohibition and deletion prohibition.
And if the neighbor discovery frequency of the neighbor relation is less than a preset neighbor discovery frequency threshold, setting the neighbor relation attribute as forbidden switching. The number of times of discovering the neighboring cell is defined as the number of samples, in a statistical period, that the neighboring cell is measured by the terminal and the absolute level of the neighboring cell (e.g., Reference Signal Receiving Power) in the measurement report is greater than the RSRP threshold value RSRP Thresh.
Further, if the switching times of the neighboring cell relations are less than or equal to a preset switching time threshold, the switching success rate of the neighboring cell relations is greater than or equal to a preset switching success rate threshold, and the neighboring cell discovery times of the neighboring cell relations are less than a preset neighboring cell discovery time threshold, the neighboring cell relation attributes are set to forbid switching.
In this embodiment, optionally, after setting the neighbor relation attribute to prohibit handover, the method further includes:
and if the attribute of the neighbor relation is deletion prohibition, releasing the deletion prohibition attribute of the neighbor relation, and putting the neighbor relation into a list of neighbor relations to be deleted.
In this embodiment, optionally, the neighboring cell relationships in the neighboring cell list to be deleted are arranged in the descending order of the neighboring cell discovery times.
In this embodiment, optionally, the method further includes:
and if the triggering condition of the operation of deleting the neighbor relation is met, deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell.
Optionally, the neighbor relation ranked last in the neighbor list to be deleted in the serving cell neighbor relation table is deleted.
The triggering condition for deleting the neighboring relationship includes, but is not limited to:
the neighbor relation table of the serving cell is full and other neighbor relations need to be added;
the number of the adjacent cells in the service cell adjacent cell relation table reaches the set adjacent cell number threshold value for immediately cleaning the redundant adjacent cells;
manually triggering redundant neighbor cell deletion operation on the neighbor cell relation table of the serving cell;
and periodically triggering the redundant adjacent cell deletion operation of the adjacent cell relation table of the service cell, wherein the number of the adjacent cells in the adjacent cell relation table of the service cell reaches the set adjacent cell number threshold value for periodically cleaning the redundant adjacent cells.
The embodiment of the invention can automatically optimize the relation attribute of the adjacent cells and delete unnecessary redundant adjacent cells, reduce the switching of unreasonable adjacent cells automatically added in the actual network application by the conventional ANR function, and reduce redundant adjacent cells. Therefore, the switching success rate of the whole network is improved, the switching times are reduced, the number of adjacent cells in the adjacent cell relation table is reduced, and the resource consumption of the memory of the base station equipment is reduced.
Example two
Referring to fig. 3, a processing flow of the method for automatically optimizing the neighbor relation attribute is shown, and the specific steps are as follows:
301, acquiring a current neighbor relation table of a serving cell;
and 308, finishing the neighbor relation table after the cycle optimization adjustment of the neighbor relation table of the service cell.
Referring to fig. 4, a processing flow of the method for automatically optimizing and deleting the neighboring cell relation is shown, and the specific steps are as follows:
in the periodic KPI statistics and the automatic optimization and adjustment process of the neighbor cell attribute of the neighbor cell relation table of the serving cell, if the neighbor cell relation needs to be deleted for some reason, the following steps 401 to 402 are executed to delete the neighbor cell relation. The condition for triggering the operation of deleting the neighboring relationship includes, but is not limited to:
the neighbor relation table of the serving cell is full and other neighbor relations need to be added;
the number of the adjacent cells in the service cell adjacent cell relation table reaches the set adjacent cell number threshold value for immediately cleaning the redundant adjacent cells;
manually triggering redundant neighbor cell deletion operation on the neighbor cell relation table of the serving cell;
periodically triggering redundant neighbor cell deletion operation on the serving cell neighbor cell relation table, wherein the number of neighbor cells in the serving cell neighbor cell relation table reaches a set neighbor cell number threshold value for periodically cleaning the redundant neighbor cells;
The embodiment of the invention can automatically optimize the relation attribute of the adjacent cells and delete unnecessary redundant adjacent cells, reduce the switching of unreasonable adjacent cells automatically added in the actual network application by the conventional ANR function, and reduce redundant adjacent cells. Therefore, the switching success rate of the whole network is improved, the switching times are reduced, the number of adjacent cells in the adjacent cell relation table is reduced, and the resource consumption of the memory of the base station equipment is reduced.
EXAMPLE III
Referring to fig. 5, a structure of an apparatus for optimizing a neighboring cell relation is shown, where the apparatus 500 includes:
a first obtaining module 501, configured to obtain a current neighbor relation table of a serving cell;
a second obtaining module 502, configured to obtain the number of times of switching and the success rate of switching of each pair of neighboring relationships, and/or obtain the number of times of discovering the neighboring relationships of each pair of neighboring relationships;
and an optimizing module 503, configured to perform optimization processing on the current neighbor relation table of the serving cell according to the number of times of switching and the success rate of switching of each pair of neighbor relations, and/or the number of times of discovering neighbor of each pair of neighbor relations.
In this embodiment, optionally, the second obtaining module includes:
and the first statistic unit is used for taking the first preset time interval as a statistic period of the switching KPI, and counting the switching times and the switching success rate of each pair of adjacent area relations.
In this embodiment, optionally, the second obtaining module further includes:
and the second counting unit is used for counting the adjacent region discovery times of each pair of adjacent region relations by taking a second preset time interval as a counting period of the adjacent region discovery times.
In this embodiment, optionally, the optimization module includes:
and the first optimization unit is used for setting the attribute of the neighboring cell relationship as switching prohibition and deletion prohibition if the switching times of the neighboring cell relationship are greater than a preset switching time threshold and the switching success rate of the neighboring cell relationship is less than a preset switching success rate threshold.
In this embodiment, optionally, the optimization module further includes:
and the second optimization unit is used for setting the attribute of the neighboring cell relation as forbidden switching if the switching times of the neighboring cell relation are less than or equal to a preset switching time threshold, the switching success rate of the neighboring cell relation is greater than or equal to a preset switching success rate threshold, and the neighboring cell discovery times of the neighboring cell relation are less than a preset neighboring cell discovery time threshold.
In this embodiment, optionally, the apparatus further includes:
and the canceling module is used for canceling the deletion prohibiting attribute of the neighboring cell relation and putting the neighboring cell relation into a neighboring cell relation list to be deleted if the neighboring cell relation attribute is deletion prohibiting.
In this embodiment, optionally, the neighboring cell relationships in the neighboring cell list to be deleted are arranged in the descending order of the neighboring cell discovery times.
In this embodiment, optionally, the apparatus further includes:
and the deleting module is used for deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell if the triggering condition of the operation of deleting the neighbor relation is met.
The embodiment of the invention can automatically optimize the relation attribute of the adjacent cells and delete unnecessary redundant adjacent cells, reduce the switching of unreasonable adjacent cells automatically added in the actual network application by the conventional ANR function, and reduce redundant adjacent cells. Therefore, the switching success rate of the whole network is improved, the switching times are reduced, the number of adjacent cells in the adjacent cell relation table is reduced, and the resource consumption of the memory of the base station equipment is reduced.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In various embodiments of the present invention, it should be understood that the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention
In addition, the terms "system" and "network" are often used interchangeably herein.
It should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
In the embodiments provided herein, it should be understood that "B corresponding to a" means that B is associated with a from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may be determined from a and/or other information.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the transceiving method according to various embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the preferred embodiments of the present invention have been described, it should be understood that modifications and adaptations to those embodiments may occur to one skilled in the art without departing from the principles of the present invention and are within the scope of the present invention.
Claims (12)
1. A method for optimizing a neighbor relation, the method comprising:
acquiring a current neighbor relation table of a serving cell;
acquiring the switching times and the switching success rate of each pair of adjacent relations and/or acquiring the adjacent discovery times of each pair of adjacent relations;
and optimizing the current neighbor relation table of the serving cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations, including:
if the switching times of the adjacent cell relation are larger than a preset switching time threshold value and the switching success rate of the adjacent cell relation is smaller than a preset switching success rate threshold value, setting the attribute of the adjacent cell relation as switching prohibition and deletion prohibition; and if the attribute of the neighbor relation is deletion prohibition, releasing the deletion prohibition attribute of the neighbor relation, and putting the neighbor relation into a list of neighbor relations to be deleted.
2. The method of claim 1, wherein obtaining the handover times and handover success rate for each pair of neighboring cell relations comprises:
and taking the first preset time interval as a KPI (key performance indicator) switching statistical period, and counting the switching times and the switching success rate of each pair of adjacent relations.
3. The method according to claim 1 or 2, wherein obtaining the number of neighbor discovery times for each pair of neighbor relations comprises:
and taking the second preset time interval as a neighbor discovery frequency counting period, and counting the neighbor discovery frequency of each pair of neighbor relations.
4. The method of claim 1, wherein optimizing the current neighbor relation of the serving cell according to the handover times and handover success rates of each pair of neighbor relations and the neighbor discovery times of each pair of neighbor relations comprises:
if the switching times of the adjacent cell relations are less than or equal to a preset switching time threshold, the switching success rate of the adjacent cell relations is greater than or equal to a preset switching success rate threshold, and the adjacent cell discovery times of the adjacent cell relations are less than a preset adjacent cell discovery time threshold, setting the adjacent cell relation attributes as forbidden switching;
and if the attribute of the neighbor relation is deletion prohibition, releasing the deletion prohibition attribute of the neighbor relation, and putting the neighbor relation into a list of neighbor relations to be deleted.
5. The method according to claim 4, wherein the neighbor cell relations in the neighbor cell list to be deleted are arranged in descending order of the number of neighbor cell discovery times.
6. The method of claim 4, further comprising:
and if the triggering condition of the operation of deleting the neighbor relation is met, deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell.
7. An apparatus for optimizing neighbor relations, the apparatus comprising:
a first obtaining module, configured to obtain a current neighbor relation table of a serving cell;
the second acquisition module is used for acquiring the switching times and the switching success rate of each pair of adjacent area relations and/or acquiring the adjacent area discovery times of each pair of adjacent area relations;
the optimization module is used for optimizing the current neighbor relation table of the serving cell according to the switching times and the switching success rate of each pair of neighbor relations and/or the neighbor discovery times of each pair of neighbor relations;
the optimization module comprises:
the first optimization unit is used for setting the attribute of the adjacent cell relation as switching prohibition and deletion prohibition if the switching times of the adjacent cell relation are larger than a preset switching time threshold and the switching success rate of the adjacent cell relation is smaller than a preset switching success rate threshold;
and the canceling module is used for canceling the deletion prohibiting attribute of the neighboring cell relation and putting the neighboring cell relation into a neighboring cell relation list to be deleted if the neighboring cell relation attribute is deletion prohibiting.
8. The apparatus of claim 7, wherein the second obtaining module comprises:
and the first statistic unit is used for taking the first preset time interval as a statistic period of the switching KPI, and counting the switching times and the switching success rate of each pair of adjacent area relations.
9. The apparatus of claim 7 or 8, wherein the second obtaining module further comprises:
and the second counting unit is used for counting the adjacent region discovery times of each pair of adjacent region relations by taking a second preset time interval as a counting period of the adjacent region discovery times.
10. The apparatus of claim 7, wherein the optimization module further comprises:
the second optimization unit is used for setting the attribute of the neighbor relation as forbidden switching if the switching times of the neighbor relation are less than or equal to a preset switching time threshold, the switching success rate of the neighbor relation is greater than or equal to a preset switching success rate threshold, and the neighbor discovery times of the neighbor relation are less than a preset neighbor discovery time threshold;
and the canceling module is used for canceling the deletion prohibiting attribute of the neighboring cell relation and putting the neighboring cell relation into a neighboring cell relation list to be deleted if the neighboring cell relation attribute is deletion prohibiting.
11. The apparatus according to claim 7, wherein the neighbor relations in the neighbor list to be deleted are arranged in an order from a large neighbor discovery number to a small neighbor discovery number.
12. The apparatus of claim 7, further comprising:
and the deleting module is used for deleting at least part of the neighbor relation in the list to be deleted in the neighbor relation table of the serving cell if the triggering condition of the operation of deleting the neighbor relation is met.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610878924.0A CN107920370B (en) | 2016-10-08 | 2016-10-08 | Method and device for optimizing neighbor relation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610878924.0A CN107920370B (en) | 2016-10-08 | 2016-10-08 | Method and device for optimizing neighbor relation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107920370A CN107920370A (en) | 2018-04-17 |
| CN107920370B true CN107920370B (en) | 2020-09-25 |
Family
ID=61891610
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610878924.0A Active CN107920370B (en) | 2016-10-08 | 2016-10-08 | Method and device for optimizing neighbor relation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107920370B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111935787B (en) * | 2019-05-13 | 2021-10-01 | 大唐移动通信设备有限公司 | Method and device for adding neighbor cells |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101778412A (en) * | 2010-02-25 | 2010-07-14 | 华为技术有限公司 | Method and device for optimizing relation between neighbor cells |
| CN101959222A (en) * | 2009-07-13 | 2011-01-26 | 中兴通讯股份有限公司 | Method and system for self-optimizing wireless communication network neighbor list |
| CN103188741A (en) * | 2011-12-29 | 2013-07-03 | 中兴通讯股份有限公司 | Neighboring cell optimization method and neighboring cell optimization base station in mobile communication network |
| CN103220699A (en) * | 2012-01-19 | 2013-07-24 | 华为技术有限公司 | Method and device for evaluating network performance |
| CN104618937A (en) * | 2015-02-15 | 2015-05-13 | 上海大唐移动通信设备有限公司 | Neighboring area automatic optimization method and apparatus |
| WO2015085546A1 (en) * | 2013-12-12 | 2015-06-18 | 华为技术有限公司 | Method and device for optimizing neighbour relation |
| CN105578443A (en) * | 2014-10-09 | 2016-05-11 | 中兴通讯股份有限公司 | Neighbor cell maintenance method and neighbor cell maintenance device |
-
2016
- 2016-10-08 CN CN201610878924.0A patent/CN107920370B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959222A (en) * | 2009-07-13 | 2011-01-26 | 中兴通讯股份有限公司 | Method and system for self-optimizing wireless communication network neighbor list |
| CN101778412A (en) * | 2010-02-25 | 2010-07-14 | 华为技术有限公司 | Method and device for optimizing relation between neighbor cells |
| CN103188741A (en) * | 2011-12-29 | 2013-07-03 | 中兴通讯股份有限公司 | Neighboring cell optimization method and neighboring cell optimization base station in mobile communication network |
| CN103220699A (en) * | 2012-01-19 | 2013-07-24 | 华为技术有限公司 | Method and device for evaluating network performance |
| WO2015085546A1 (en) * | 2013-12-12 | 2015-06-18 | 华为技术有限公司 | Method and device for optimizing neighbour relation |
| CN105578443A (en) * | 2014-10-09 | 2016-05-11 | 中兴通讯股份有限公司 | Neighbor cell maintenance method and neighbor cell maintenance device |
| CN104618937A (en) * | 2015-02-15 | 2015-05-13 | 上海大唐移动通信设备有限公司 | Neighboring area automatic optimization method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107920370A (en) | 2018-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8995925B2 (en) | Performing inter-frequency measurements in a mobile network | |
| KR102004414B1 (en) | Method and system for cell identifier optimization | |
| JP5629005B2 (en) | Method and apparatus for limiting neighbor cell measurement reporting | |
| CN101978733B (en) | Mobile station and radio base station | |
| CN101553020B (en) | Closed user group subdistrict access method based on evolution base station under connecting mode | |
| US8731554B2 (en) | Cell reselecting method and mobile station device | |
| US20160073312A1 (en) | Integrated idle mode and active mode traffic management | |
| US10334490B2 (en) | Overall network performance and/or overall quality of service of a mobile communication network by assigning a physical cell identifier information to a plurality of radio cells | |
| CN102196415B (en) | Method and equipment for triggering interference coordination of terminal in idle mode | |
| WO2020164538A1 (en) | Reporting method and configuration method for minimization of drive tests information, terminal and network device | |
| CN101867966A (en) | Method for reporting measurement report of closed user group cell | |
| RU2523030C2 (en) | Radio base station, mobile station and communication control method | |
| EP3910992A1 (en) | Cell measurement method and apparatus | |
| WO2019119866A1 (en) | Method and device for automatic addition of neighboring cell | |
| US20190320372A1 (en) | Cell Measurement Reporting Method and User Equipment | |
| CN101873612A (en) | Method and system measuring Home NB cell | |
| CN101541009A (en) | Method, device and system for optimizing neighbor cell list | |
| CN102572926A (en) | Method and device for reporting neighbor information | |
| JP5636494B2 (en) | Statistical method and apparatus for reselection frequency between systems | |
| CN107920370B (en) | Method and device for optimizing neighbor relation | |
| CN102100100A (en) | Mobile station and standby method | |
| EP3598789A1 (en) | Optimized determination method and device for pci confusion | |
| CN111787582A (en) | Network switching processing method and device | |
| US20210185596A1 (en) | Network reporting in a cellular network | |
| CN106550431B (en) | UTRAN PLMN searching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |