CN105744574A - Adjacent region optimization method and apparatus - Google Patents

Adjacent region optimization method and apparatus Download PDF

Info

Publication number
CN105744574A
CN105744574A CN201410751303.7A CN201410751303A CN105744574A CN 105744574 A CN105744574 A CN 105744574A CN 201410751303 A CN201410751303 A CN 201410751303A CN 105744574 A CN105744574 A CN 105744574A
Authority
CN
China
Prior art keywords
cell
adjacent area
relation table
neighboring relation
switching
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.)
Granted
Application number
CN201410751303.7A
Other languages
Chinese (zh)
Other versions
CN105744574B (en
Inventor
王志强
刘杰
柳海辉
丁丁
马媛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201410751303.7A priority Critical patent/CN105744574B/en
Priority to PCT/CN2015/077544 priority patent/WO2016090813A1/en
Publication of CN105744574A publication Critical patent/CN105744574A/en
Application granted granted Critical
Publication of CN105744574B publication Critical patent/CN105744574B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/0005Control or signalling for completing the hand-off
    • H04W36/0055Transmission or use of information for re-establishing the radio link
    • H04W36/0061Transmission or use of information for re-establishing the radio link of neighbour cell information

Abstract

The invention discloses an adjacent region optimization method and apparatus. During adjacent region optimization, cell switching information of a target cell and a current adjacent region relation list are obtained; on the basis of the obtained cell switching information, adjacent regions in the adjacent region relation list of the target cell are optimized to obtain an optimized adjacent region relation list; and before implementation of the optimized adjacent region relation list after optimization, matching correction processing is carried out on the adjacent regions in the obtained optimized adjacent region relation list to obtain a first correction adjacent region relation list. Therefore, after optimization of the adjacent regions in the adjacent region relation list of the target cell, matching correction processing is carried out to check the effectiveness, so that accuracy and effectiveness of the adjacent cell optimization can be improved; and new problems that are caused by direct implementation of the optimized adjacent region relation list can be solved, so that the satisfaction degree of the user experience can be enhanced.

Description

A kind of neighbor cell optimizing method and device
Technical field
The present invention relates to the communications field, be specifically related to a kind of neighbor cell optimizing method and device.
Background technology
Neighborhood Optimization is one of important content of the network optimization, UMTS UMTS network workload of about 30% during engineering optimization is concentrated on Neighborhood Optimization, arrive the O&M stage, this numeral rises to 80% especially, it may be said that, Neighborhood Optimization is most important content in UMTS network Optimization Work, and neighboring BS relationship configuration accurately is an up the important means of network quality.By the neighboring BS relationship that Optimized Measures configures, system internal interference will be greatly reduced, improve soft handover success rate, reduce cutting off rate.But Optimized Measures is unreasonable, adjacent area leakage can be caused to join, the signal interference ratio causing user in call is declined, mobile phone transmission power lifting, and be therefore likely to cause speech service quality poor, data service rate declines, serious miss-configured neighboring cells will cause dropped calls, cause customer complaint.But, some current neighboring BS relationship optimization methods are after optimization completes, it does not have result carries out validity check and just directly implements, and cause that new problem occurs in optimum results application.
Summary of the invention
The main technical problem to be solved in the present invention is to provide a kind of neighbor cell optimizing method and device, solves existing adjacent area and optimum results does not carry out the problem that after validation checking is just directly implemented to cause to implement, a new problem arose.
For solving above-mentioned technical problem, the present invention provides a kind of neighbor cell optimizing method, including:
Obtain the cell handover information of Target cell and current Neighboring Relation Table;
It is optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell to obtain optimizing Neighboring Relation Table;
Adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process and obtains the first correction Neighboring Relation Table.
In an embodiment of the present invention, it is optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell to include:
When the soft handover number of times of switching cell is less than the first soft handover frequency threshold value in described cell handover information, it is judged that this switching cell is whether in described Neighboring Relation Table, in this way, this switching cell in described Neighboring Relation Table is labeled as deletion;When the soft handover number of times of switching cell is be more than or equal to described first soft handover frequency threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell;
When the virtual switching times of switching cell is be more than or equal to described first virtual switching times threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell.
In an embodiment of the present invention, also including the particular cell list information obtaining described Target cell, described particular cell list information includes black list information, Red List information;
Described described switching cell is labeled as deletion before, also include judging that described switching cell is whether in described Red List information, as no, then is labeled as deletion by described switching cell;
Before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging that described switching cell is whether in described black list information, in this way, does not add to this switching cell in described Neighboring Relation Table.
In an embodiment of the present invention, described particular cell list information also includes restriction optimization list information, isolation list information;Described restriction optimizes each community comprised in list information and does not allow to delete or increase, and the adjacent area of the Target cell in described isolation list information is only the community specified in region;
Described described switching cell is labeled as deletion before, also include judging whether described switching cell optimizes in list information in described restriction, as no, more described switching cell be labeled as deletion;
Before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging whether described switching cell optimizes in list information in described restriction, as no, judge that described switching cell is whether in the appointment region of described Target cell further according to isolation list information, in this way, in described Neighboring Relation Table, this switching cell is configured to the newly-increased adjacent area of described Target cell.
In an embodiment of the present invention, described described switching cell is labeled as deletion before, also include:
Obtain the primary importance information of the base station of described Target cell and the second position information of the base station of described switching cell;
Judging that whether the distance between the base station of described Target cell and the base station of described switching cell is less than super neighbour district distance threshold according to described primary importance information and described second position information, as no, ability is described is labeled as deletion by described switching cell.
In an embodiment of the present invention, before being optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell, also include the interference data in described cell handover information and hash carries out filtering operation.
In an embodiment of the present invention, adjacent area in described optimization Neighboring Relation Table carries out interworking correcting process obtain the first correction Neighboring Relation Table and be: the adjacent area newly increased in described optimization Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
The adjacent area for main plot, with described Target cell for described main plot with the adjacent area that respectively newly increases respectively;
If using the described Target cell adjacent area as described main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from described optimization Neighboring Relation Table;
If described Target cell is in the Neighboring Relation Table of described main plot, and described main plot is not labeled as deletion when described optimization process, it is determined that for completing interworking;
If described Target cell is in the Neighboring Relation Table of described main plot, and when described optimization process, described main plot is labeled as deletion, then cancel the deletion labelling of this main plot in described optimization Neighboring Relation Table;
If described Target cell has had been configured as the newly-increased adjacent area of described main plot in the optimization process of described main plot, it is determined that for completing interworking.
In an embodiment of the present invention, described method also includes:
Described first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table.
In an embodiment of the present invention, described method also includes:
Revise Neighboring Relation Table to described second to be carried out in a network;
The new cell handover information of described Target cell after the described second correction Neighboring Relation Table of acquisition enforcement;
New cell handover information according to described Target cell and described cell handover information judge whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes correctly.
In an embodiment of the present invention, the described first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table and be: revise, to described first, the adjacent area newly increased in list and carry out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted described first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in described first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
In an embodiment of the present invention, new cell handover information according to described Target cell and described cell handover information judge whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes: judge that whether the adjacent area newly increased in described second correction Neighboring Relation Table is correct according to the new cell handover information of described Target cell and described cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described n1, n2 are more than 0, less than or equal to 1;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of m1* virtual switching times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of m2* virtual switching times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described m1, m2 are more than 0, less than or equal to 1.
In order to solve the problems referred to above, present invention also offers a kind of Neighborhood Optimization device, including:
Data obtaining module, for obtaining the cell handover information of Target cell and current Neighboring Relation Table;
Optimization process module, obtains optimizing Neighboring Relation Table for being optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell;
Interworking correcting module, obtains the first correction Neighboring Relation Table for the adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process.
In an embodiment of the present invention, described optimization process module includes soft handover optimization submodule and virtual handover optimization submodule;
Described soft handover optimizes submodule for when the soft handover number of times of switching cell is less than the first soft handover frequency threshold value in described cell handover information, judge that this switching cell is whether in described Neighboring Relation Table, in this way, this switching cell in described Neighboring Relation Table is labeled as deletion;When the soft handover number of times of switching cell is be more than or equal to described first soft handover frequency threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell;
Described virtual handover optimization submodule is for when the virtual switching times of switching cell is be more than or equal to described first virtual switching times threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell.
In an embodiment of the present invention, also including list acquisition module, for obtaining the particular cell list information of described Target cell, described particular cell list information includes black list information, Red List information;
Before described switching cell being labeled as deletion described in described soft handover optimization submodule and/or described virtual handover optimization submodule, also include judging that described switching cell is whether in described Red List information, as no, then is labeled as deletion by described switching cell;
Described soft handover optimizes submodule and/or described virtual handover optimization submodule by before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging that described switching cell is whether in described black list information, in this way, this switching cell is not added in described Neighboring Relation Table.
In an embodiment of the present invention, adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process and obtains the first correction Neighboring Relation Table and be by described interworking correcting module: the adjacent area newly increased in described optimization Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
The adjacent area for main plot, with described Target cell for described main plot with the adjacent area that respectively newly increases respectively;
If using the described Target cell adjacent area as described main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from described optimization Neighboring Relation Table;
If described Target cell is in the Neighboring Relation Table of described main plot, and described main plot is not labeled as deletion when described optimization process, it is determined that for completing interworking;
If described Target cell is in the Neighboring Relation Table of described main plot, and when described optimization process, described main plot is labeled as deletion, then cancel the deletion labelling of this main plot in described optimization Neighboring Relation Table;
If described Target cell has had been configured as the newly-increased adjacent area of described main plot in the optimization process of described main plot, it is determined that for completing interworking.
In an embodiment of the present invention, also include scrambler multiplexing correcting module, carry out scrambler multiplexing correction for the adjacent area revised in list to described first and obtain the second correction Neighboring Relation Table.
In an embodiment of the present invention, also include implementing module and correction verification module:
Described enforcement module is carried out in a network for revising Neighboring Relation Table to described second;
Described correction verification module is implemented described second revise the new cell handover information of described Target cell after Neighboring Relation Table for being obtained, and judges that described second revises in Neighboring Relation Table whether the adjacent area after optimization optimizes correctly according to the new cell handover information of described Target cell and described cell handover information.
In an embodiment of the present invention, described first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table and be by described scrambler multiplexing interworking correcting module: revises, to described first, the adjacent area newly increased in list and carries out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted described first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in described first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
In an embodiment of the present invention, with described cell handover information, described correction verification module judges whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes according to the new cell handover information of described Target cell: judge that whether the adjacent area newly increased in described second correction Neighboring Relation Table is correct according to the new cell handover information of described Target cell and described cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described n1, n2 are more than 0, less than or equal to 1;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of m1* virtual switching times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of m2* virtual switching times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described m1, m2 are more than 0, less than or equal to 1.
The invention has the beneficial effects as follows:
Neighbor cell optimizing method provided by the invention and device, when Neighborhood Optimization, obtain the cell handover information of Target cell and current Neighboring Relation Table;It is optimized process based on the adjacent area in the cell handover information the got Neighboring Relation Table to this Target cell to obtain optimizing Neighboring Relation Table;Before the optimization Neighboring Relation Table that optimization is obtained is carried out example, the adjacent area optimized in Neighboring Relation Table obtained is carried out interworking correcting process and obtains the first correction Neighboring Relation Table.Namely after the present invention provides adjacent area in the Neighboring Relation Table to Target cell to be optimized process, also it is carried out interworking correcting process so that effectiveness to be checked, accuracy and the effectiveness of Neighborhood Optimization can be promoted, avoid directly implementing to optimize Neighboring Relation Table and cause that after enforcement, a new problem arose, and then promote the satisfaction of Consumer's Experience.
Accompanying drawing explanation
The Fig. 1 neighbor cell optimizing method schematic flow sheet one for providing in the embodiment of the present invention one;
The Fig. 2 neighbor cell optimizing method schematic flow sheet two for providing in the embodiment of the present invention one;
The Fig. 3 neighbor cell optimizing method schematic flow sheet three for providing in the embodiment of the present invention one;
The Fig. 4 Neighborhood Optimization apparatus structure schematic diagram one for providing in the embodiment of the present invention two;
The Fig. 5 Neighborhood Optimization apparatus structure schematic diagram two for providing in the embodiment of the present invention two;
The Fig. 6 Neighborhood Optimization apparatus structure schematic diagram three for providing in the embodiment of the present invention two;
The Fig. 7 Neighborhood Optimization apparatus structure schematic diagram four for providing in the embodiment of the present invention two.
Detailed description of the invention
The present invention is described in further detail in conjunction with accompanying drawing below by detailed description of the invention.
Embodiment one:
Shown in Figure 1, the neighbor cell optimizing method in the present embodiment includes procedure below:
Step 101: obtain the cell handover information of Target cell and current Neighboring Relation Table;
Target cell herein refers to the community of pending Neighborhood Optimization, and it can Serving cell;Cell handover information herein is the community switch data of this Target cell, comprises virtual switch data and soft handoff data;Neighboring Relation Table herein comprises the adjacent area list that described Target cell is current;
Step 102: be optimized process based on the adjacent area in the cell handover information the obtained Neighboring Relation Table to Target cell and obtain optimizing Neighboring Relation Table;
Step 103: the adjacent area optimized in Neighboring Relation Table obtained is carried out interworking correcting process and obtains the first correction Neighboring Relation Table.
Visible, in the present embodiment, after adjacent area in the Neighboring Relation Table to Target cell is optimized process, at least also it is carried out interworking correcting process so that effectiveness to be checked, accuracy and the effectiveness of Neighborhood Optimization can be promoted, avoid directly implementing to optimize Neighboring Relation Table and cause that after enforcement, a new problem arose, and then promote the satisfaction of Consumer's Experience.
Shown in Figure 2, the present embodiment neighbor cell optimizing method, after above-mentioned steps 103, also includes:
Step 104: the obtain first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table.
The optimum results obtained is carried out further scrambler multiplexing correction and can promote effectiveness and the accuracy of the adjacent area after optimization further.
Neighbor cell optimizing method in the present embodiment, after above-mentioned steps 104, also includes the process being carried out final optimum results and verification optimum results, shown in Figure 3, including:
Step 105: revise Neighboring Relation Table to obtain second and be carried out in a network;
Step 106: the new cell handover information of Target cell after acquisition enforcement the second correction Neighboring Relation Table;
Step 107: judge whether the adjacent area after optimizing in the second correction Neighboring Relation Table optimizes correctly according to the new cell handover information of Target cell and the cell handover information of acquisition in step 101.
Visible, the present invention is after the result of final optimization pass is carried out, the new cell handover information obtained after being also based on enforcement and historical cell handover information carry out the accuracy verification of Neighborhood Optimization, when checking configuration is inaccurate, can carry out reporting to the police or further optimizing and revising, and then ensure the effect of optimization of adjacent area.
In above-mentioned steps 102, the process that the adjacent area in the Neighboring Relation Table of Target cell is optimized process by the cell handover information of based target community includes:
When in the cell handover information of Target cell, the soft handover number of times of switching cell is less than the first soft handover frequency threshold value, judge that this switching cell is whether in the Neighboring Relation Table of Target cell, in this way, this switching cell in Neighboring Relation Table is labeled as deletion, as no, then not using the newly-increased adjacent area as Target cell, this switching cell;When the soft handover number of times of switching cell is be more than or equal to the first soft handover frequency threshold value, judge that this switching cell is whether in Neighboring Relation Table, as no, this switching cell is configured to the newly-increased adjacent area of described Target cell by Neighboring Relation Table, otherwise, in Neighboring Relation Table, retain the newly-increased adjacent area as Target cell, this switching cell;
When the virtual switching times of switching cell is be more than or equal to the first virtual switching times threshold value, judge that this switching cell is whether in Neighboring Relation Table, as no, this switching cell is configured to the newly-increased adjacent area of described Target cell by Neighboring Relation Table, otherwise, in Neighboring Relation Table, retain the newly-increased adjacent area as Target cell, this switching cell.
In the present embodiment, the true switching occurred between soft handover Zhi Liangge community, adjacent area when the two minizone is likely to, it is also possible to be not also adjacent area.The community ID showing as adjacent cell in switch data is clear and definite.
Virtual switching refers to that virtual to switch in switch data performance be that adjacent cell has not known concrete ID, only have recorded scrambler (PSC), think that scrambler is identical with the PSC in handover information when analyzing, and the community nearest with the main plot in handover information is exactly the adjacent cell in virtual switching record.
It should be appreciated that the first virtual switching times threshold value and specifically setting of the first soft handover frequency threshold value in the present embodiment can select to set according to concrete network environment or concrete application scenarios.
In the present embodiment, when Neighborhood Optimization is had particular/special requirement by Target cell, also set particular cell list information for this Target cell, above-mentioned steps 101 also can obtain the particular cell list information of this Target cell, certainly also can obtaining this particular cell list information before or after above-mentioned steps 101 (before being optimized process), the particular cell list information of acquisition includes black list information and Red List information;
Before now switching cell being labeled as deletion in above-mentioned optimization process, also include judging that this switching cell is whether in Red List information, in this way, then this switching cell labelling is not deleted, as no, then this switching cell is labeled as deletion;
Before switching cell is configured to the newly-increased adjacent area of Target cell by above-mentioned optimization process, also include judging that this switching cell is whether in black list information, in this way, this switching cell is not added in Neighboring Relation Table, as no to, then this switching cell is added the Neighboring Relation Table newly-increased adjacent area as this Target cell.
In the present embodiment, list information in particular cell also can farther include restriction optimization list information, isolation list information;Restriction optimizes each community comprised in list information and does not allow to delete or increase, and the adjacent area of the Target cell in isolation list information is only the community specified in region;
Now in above-mentioned optimization process, before switching cell is labeled as deletion, also includes judging whether this switching cell optimizes in list information in restriction, as no, then this switching cell is labeled as deletion;
In above-mentioned optimization process, before switching cell is configured to the newly-increased adjacent area of Target cell, also include judging whether this switching cell optimizes in list information in restriction, as no, judge that switching cell is whether in the appointment region of described Target cell further according to isolation list information, in this way, in the Neighboring Relation Table of Target cell, this switching cell is configured to the newly-increased adjacent area of this Target cell.
In order to be better understood from the present invention, illustrative for a kind of concrete particular cell list information below, refer to shown in table one:
Table one
In the present embodiment, in above-mentioned optimization process, before switching cell is labeled as deletion, also include:
Obtain the primary importance information of the base station of Target cell and the second position information of the base station of switching cell;Specifically can pass through to obtain the engineering parameter data of network in above-mentioned steps 101, from the engineering parameter data acquisition obtained to the positional information of each base station;
Whether the distance judging between the base station of Target cell and the base station of this switching cell according to the primary importance information obtained and second position information is less than super neighbour district distance threshold, in this way, show that the two is super close distance adjacent area, this switching cell can not be deleted, as no, just described switching cell is labeled as deletion.
In the present embodiment, before being optimized process based on the adjacent area in the cell handover information the obtained Neighboring Relation Table to Target cell, in order to promote efficiency and the accuracy of follow-up optimization, in advance the interference data in cell handover information and hash can being filtered operation, this filters operation and specifically comprises the steps that
Switching times virtual in cell handover information is deleted less than the record of certain soft-handoff threshold less than the record of certain virtual switching threshold and the soft handover number of times of non-neighboring BS relationship, in order to remove interference data or hash.It is verified.Additionally, in the present embodiment before calling particular cell list information, also the community list in this particular cell list information can be verified, prevent each list in this particular cell list information from colliding with each other, after verifying entry/exit conflicts, it is possible to delete the community list of conflict or only delete one of them in two conflict districts.
In above-mentioned steps 103, the adjacent area optimized in Neighboring Relation Table carries out interworking correcting process obtain the first correction Neighboring Relation Table and be: the adjacent area (it should be understood that being for all adjacent areas) newly increased optimized in Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
A: the adjacent area for main plot, with Target cell for described main plot with the adjacent area that respectively newly increases respectively;
B: if using the Target cell adjacent area as main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from optimizing Neighboring Relation Table;
C: if Target cell is in the Neighboring Relation Table of main plot, and main plot is not labeled as deletion when optimization process, it is determined that for completing interworking;
D: if Target cell is in the Neighboring Relation Table of main plot, and when optimization process, main plot is labeled as deletion, then cancel and optimize the deletion labelling of this main plot in Neighboring Relation Table;
E: if Target cell has had been configured as the newly-increased adjacent area of main plot in the optimization process of main plot, it is determined that for completing interworking;
Also can farther include:
F: if Target cell needs to increase the interworking adjacent area of other adjacent areas, community several, but its adjacent area number that can increase is less than this number, then take bigger several of switching times and accompany adjacent area as the adjacent area of this Target cell mutually when increasing.
It should be appreciated that mentioned above principle all can carry out, according to concrete application scenarios, the adjustment that adapts to.
In the present embodiment, the Neighboring Relation Table of all communities all can obtain from the radio configuration data of network, and specifically can obtain in above-mentioned steps 101;The configuration data and the engineering parameter data that obtain in the present embodiment are all the data after latest update, to ensure that in configuration data and engineering parameter, simultaneous field has same value.
In above-mentioned steps 104, first adjacent area revised in list carries out scrambler multiplexing correction obtain the second correction Neighboring Relation Table and be: revise, to first, the adjacent area (it should be understood that being for all adjacent areas) newly increased in list and carry out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in the first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.Illustrate with a concrete example below, with A-B represents that newly-increased adjacent area illustrates, and refers to shown in table two:
Table two
Above table causes scrambler multiplexed path number maximum for A-> B, delete this neighboring BS relationship of A-> B, then recalculate, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
In above-mentioned steps 107, new cell handover information according to Target cell and cell handover information judge whether the adjacent area after optimizing in the second correction Neighboring Relation Table optimizes: judge that whether the adjacent area (it should be understood that being for all adjacent areas) newly increased in the second correction Neighboring Relation Table is correct according to the new cell handover information of Target cell and cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;N1, n2 in the present embodiment is more than 0, and less than or equal to 1, the two can take identical value, it is also possible to takes different values, for instance both of which can be taken as 25%, and its concrete value can be modified according to concrete application scenarios, arrange certainly.The first success rate threshold value in the present embodiment can be modified according to concrete application scenarios, arrange, for instance could be arranged to 99%;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in new cell handover information is whether more than this adjacent area of m1* virtual switching times in cell handover information, whether this adjacent area soft handover number of times proportion in new cell handover information is more than this adjacent area of m2* virtual switching times proportion in cell handover information, and whether the handover success rate that this adjacent area is in new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;M1, m2 in the present embodiment is more than 0, and less than or equal to 1, the two can take identical value, it is also possible to takes different values, for instance the two also all can be taken as 25%, and its concrete value can be modified according to concrete application scenarios, arrange certainly.The second success rate threshold value in the present embodiment can also be modified according to concrete application scenarios, arrange, for instance it can also be provided that 99%.
Based on the scheme that the present embodiment provides, the UMTS network of Shenzhen is carried out Neighborhood Optimization by February, 2014, generates new Neighborhood Optimization list, and we are for illustrating in RNC345.First, obtain the related data of RNC345, as: community switch data, radio configuration data, engineering parameter file, the adjacent area red and black list of configuration this area, and data are gone hash or the pretreatment of interference data.Soft handoff data ratio between adjacent area, 345-18231 and 6, cell-of-origin and record number meet the adjacent area set and delete thresholding (thresholding setting herein: ratio is as 0.5%, record number is 600) requirement, but due to community to (345-18231 and 345-49721) in the Red List of adjacent area, do not allow to delete, so all the other 5 adjacent areas are deleted in actual optimization result.Virtual switch data ratio and the record number of (345-18231 and 345-42921) are satisfied by thresholding (the thresholding setting herein: ratio is 3% that adjacent area increases by community, record number is 150) requirement, but owing to it is in the blacklist of adjacent area, it is impossible to increase.Then carrying out interworking process, according to interworking principle, the newly-increased adjacent area (491-12521,485-22021) of community (345-18231) with the addition of reverse adjacent area.Finally carry out scrambler inspection, find to cause the scrambler multiplexing in path, 43 adjacent areas according to the neighboring BS relationship (345-18231 and 491-12521) that switch data is newly-increased, adjacent area (491-12521 and 345-18231) according to interworking increase causes the scrambler multiplexing in path, 11 adjacent areas, removes the operation of then two newly-increased neighboring BS relationship.Application final optimization pass result, is undertaken adding adjacent accuracy testing by up-to-date community switch data and the community switch data used when analyzing, it has been found that meet algorithm requirement.Therefore this optimum results is feasible, effectively.
Embodiment two:
Shown in Figure 4, the Neighborhood Optimization device in the present embodiment includes:
Data obtaining module 1, for obtaining the cell handover information of Target cell and current Neighboring Relation Table;Target cell herein refers to the community of pending Neighborhood Optimization, and it can Serving cell;Cell handover information herein is the community switch data of this Target cell, comprises virtual switch data and soft handoff data;Neighboring Relation Table herein comprises the adjacent area list that described Target cell is current;
Optimization process module 2, obtains optimizing Neighboring Relation Table for being optimized process based on the adjacent area in the cell handover information the obtained Neighboring Relation Table to Target cell;
Interworking correcting module 3, obtains the first correction Neighboring Relation Table for the adjacent area optimized in Neighboring Relation Table is carried out interworking correcting process.
Visible, in the present embodiment, after adjacent area in the Neighboring Relation Table to Target cell is optimized process, at least also by interworking correcting module 3, it is carried out interworking correcting process so that effectiveness to be checked, accuracy and the effectiveness of Neighborhood Optimization can be promoted, avoid directly implementing to optimize Neighboring Relation Table and cause that after enforcement, a new problem arose, and then promote the satisfaction of Consumer's Experience.
Shown in Figure 5, the Neighborhood Optimization device in the present embodiment also includes scrambler multiplexing correcting module 4, carries out scrambler multiplexing correction for the adjacent area revised in list to first and obtains the second correction Neighboring Relation Table.The optimum results obtained is carried out further scrambler multiplexing correction and can promote effectiveness and the accuracy of the adjacent area after optimization further.
Shown in Figure 6, Neighborhood Optimization device also includes implementing module 5 and correction verification module 6:
Implement module 5 to be carried out in a network for revising Neighboring Relation Table to second;
Correction verification module 6 implements the new cell handover information of Target cell after the second correction Neighboring Relation Table for obtaining, and judges in the second correction Neighboring Relation Table whether the adjacent area after optimization optimizes correctly according to the new cell handover information of Target cell and cell handover information.
Visible, the present invention is after the result of final optimization pass is carried out, the new cell handover information obtained after being also based on enforcement and historical cell handover information carry out the accuracy verification of Neighborhood Optimization, when checking configuration is inaccurate, can carry out reporting to the police or further optimizing and revising, and then ensure the effect of optimization of adjacent area.
In the present embodiment, optimization process module 2 includes soft handover optimization submodule and virtual handover optimization submodule;
Soft handover optimizes submodule for when the soft handover number of times of switching cell is less than the first soft handover frequency threshold value in the cell handover information of Target cell, judge that this switching cell is whether in the Neighboring Relation Table of Target cell, in this way, this switching cell in Neighboring Relation Table is labeled as deletion, as no, then not using the newly-increased adjacent area as Target cell, this switching cell;When the soft handover number of times of switching cell is be more than or equal to the first soft handover frequency threshold value, judge that this switching cell is whether in Neighboring Relation Table, as no, this switching cell is configured to the newly-increased adjacent area of described Target cell by Neighboring Relation Table, otherwise, in Neighboring Relation Table, retain the newly-increased adjacent area as Target cell, this switching cell;
Virtual handover optimization submodule is for when the virtual switching times of switching cell is be more than or equal to the first virtual switching times threshold value, judge that this switching cell is whether in Neighboring Relation Table, as no, this switching cell is configured to the newly-increased adjacent area of described Target cell by Neighboring Relation Table, otherwise, in Neighboring Relation Table, retain the newly-increased adjacent area as Target cell, this switching cell.
It should be appreciated that the first virtual switching times threshold value and specifically setting of the first soft handover frequency threshold value in the present embodiment can select to set according to concrete network environment or concrete application scenarios.
In the present embodiment, when Neighborhood Optimization is had particular/special requirement by Target cell, also set particular cell list information for this Target cell.Shown in Figure 7, Neighborhood Optimization device also includes list acquisition module 7, and for obtaining the particular cell list information of Target cell, this particular cell list information includes black list information, Red List information;
Soft handover optimization submodule also includes judging that this switching cell is whether in Red List information before switching cell being labeled as deletion in optimization process, in this way, then this switching cell labelling is not deleted, as no, then this switching cell is labeled as deletion;
Before soft handover optimizes submodule and/or virtual handover optimization submodule just switching cell is configured to the newly-increased adjacent area of Target cell in optimization process, also include judging that this switching cell is whether in black list information, in this way, this switching cell is not added in Neighboring Relation Table, as no to, then this switching cell is added the Neighboring Relation Table newly-increased adjacent area as this Target cell.
In the present embodiment, list information in particular cell also can farther include restriction optimization list information, isolation list information;Restriction optimizes each community comprised in list information and does not allow to delete or increase, and the adjacent area of the Target cell in isolation list information is only the community specified in region;
Now in above-mentioned optimization process, before switching cell is labeled as deletion by soft handover optimization submodule and/or virtual handover optimization submodule, also include judging whether this switching cell optimizes in list information in restriction, as no, then this switching cell is labeled as deletion;
In above-mentioned optimization process, before switching cell is configured to the newly-increased adjacent area of Target cell by soft handover optimization submodule and/or virtual handover optimization submodule, also include judging whether this switching cell optimizes in list information in restriction, as no, judge that switching cell is whether in the appointment region of described Target cell further according to isolation list information, in this way, in the Neighboring Relation Table of Target cell, this switching cell is configured to the newly-increased adjacent area of this Target cell.
In the present embodiment, in above-mentioned optimization process, soft handover optimization submodule and/or virtual handover optimization submodule also include before switching cell is labeled as deletion:
Obtain the primary importance information of the base station of Target cell and the second position information of the base station of switching cell;Specifically can pass through to obtain the engineering parameter data of network, from the engineering parameter data acquisition obtained to the positional information of each base station;
Whether the distance judging between the base station of Target cell and the base station of this switching cell according to the primary importance information obtained and second position information is less than super neighbour district distance threshold, in this way, show that the two is super close distance adjacent area, this switching cell can not be deleted, as no, just described switching cell is labeled as deletion.
In the present embodiment, before being optimized process based on the adjacent area in the cell handover information the obtained Neighboring Relation Table to Target cell, in order to promote efficiency and the accuracy of follow-up optimization, in advance the interference data in cell handover information and hash can being filtered operation, this filters operation and specifically comprises the steps that
Switching times virtual in cell handover information is deleted less than the record of certain soft-handoff threshold less than the record of certain virtual switching threshold and the soft handover number of times of non-neighboring BS relationship, in order to remove interference data or hash.It is verified.Additionally, in the present embodiment before calling particular cell list information, also the community list in this particular cell list information can be verified, prevent each list in this particular cell list information from colliding with each other, after verifying entry/exit conflicts, it is possible to delete the community list of conflict or only delete one of them in two conflict districts.
In the present embodiment, the adjacent area optimized in Neighboring Relation Table is carried out interworking correcting process and obtains the first correction Neighboring Relation Table and be by interworking correcting module 3: the adjacent area (it should be understood that being for all adjacent areas) newly increased optimized in Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
A: the adjacent area for main plot, with Target cell for described main plot with the adjacent area that respectively newly increases respectively;
B: if using the Target cell adjacent area as main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from optimizing Neighboring Relation Table;
C: if Target cell is in the Neighboring Relation Table of main plot, and main plot is not labeled as deletion when optimization process, it is determined that for completing interworking;
D: if Target cell is in the Neighboring Relation Table of main plot, and when optimization process, main plot is labeled as deletion, then cancel and optimize the deletion labelling of this main plot in Neighboring Relation Table;
E: if Target cell has had been configured as the newly-increased adjacent area of main plot in the optimization process of main plot, it is determined that for completing interworking;
Also can farther include:
F: if Target cell needs to increase the interworking adjacent area of other adjacent areas, community several, but its adjacent area number that can increase is less than this number, then take bigger several of switching times and accompany adjacent area as the adjacent area of this Target cell mutually when increasing.
It should be appreciated that mentioned above principle all can carry out, according to concrete application scenarios, the adjustment that adapts to.In the present embodiment, the Neighboring Relation Table of all communities all can obtain from the radio configuration data of network, the configuration data and the engineering parameter data that obtain in the present embodiment are all the data after latest update, to ensure that in configuration data and engineering parameter, simultaneous field has same value.
In the present embodiment, the first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table and be by scrambler multiplexing interworking correcting module 4: revises, to first, the adjacent area (it should be understood that being for all adjacent areas) newly increased in list and carries out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in the first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
In the present embodiment, with cell handover information, correction verification module 6 judges whether the adjacent area after optimizing in the second correction Neighboring Relation Table optimizes according to the new cell handover information of Target cell: judge that whether the adjacent area (it should be understood that being for all adjacent areas) newly increased in the second correction Neighboring Relation Table is correct according to the new cell handover information of Target cell and cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;N1, n2 in the present embodiment is more than 0, and less than or equal to 1, the two can take identical value, it is also possible to takes different values, for instance both of which can be taken as 25%, and its concrete value can be modified according to concrete application scenarios, arrange certainly.The first success rate threshold value in the present embodiment can be modified according to concrete application scenarios, arrange, for instance could be arranged to 99%;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in new cell handover information is whether more than this adjacent area of m1* virtual switching times in cell handover information, whether this adjacent area soft handover number of times proportion in new cell handover information is more than this adjacent area of m2* virtual switching times proportion in cell handover information, and whether the handover success rate that this adjacent area is in new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;M1, m2 in the present embodiment is more than 0, and less than or equal to 1, the two can take identical value, it is also possible to takes different values, for instance the two also all can be taken as 25%, and its concrete value can be modified according to concrete application scenarios, arrange certainly.The second success rate threshold value in the present embodiment can also be modified according to concrete application scenarios, arrange, for instance it can also be provided that 99%.
Visible, the solution of the present invention is before the optimization Neighboring Relation Table that optimization is obtained is carried out example, it is carried out again after the adjacent area optimized in Neighboring Relation Table obtained is carried out interworking correcting process and scrambler multiplexing correcting process, accuracy and the effectiveness of Neighborhood Optimization can be promoted, it is to avoid directly implement to optimize Neighboring Relation Table and cause that after enforcement, a new problem arose;Also according to being implement Hou Xin community switch data and historical cell switch data optimum results carries out correct regular inspection survey after enforcement, can promote the satisfaction of Consumer's Experience further simultaneously.
Above content is in conjunction with specific embodiment further description made for the present invention, it is impossible to assert that specific embodiment of the invention is confined to these explanations.For general technical staff of the technical field of the invention, without departing from the inventive concept of the premise, it is also possible to make some simple deduction or replace, protection scope of the present invention all should be considered as belonging to.

Claims (19)

1. a neighbor cell optimizing method, it is characterised in that including:
Obtain the cell handover information of Target cell and current Neighboring Relation Table;
It is optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell to obtain optimizing Neighboring Relation Table;
Adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process and obtains the first correction Neighboring Relation Table.
2. neighbor cell optimizing method as claimed in claim 1, it is characterised in that be optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell and include:
When the soft handover number of times of switching cell is less than the first soft handover frequency threshold value in described cell handover information, it is judged that this switching cell is whether in described Neighboring Relation Table, in this way, this switching cell in described Neighboring Relation Table is labeled as deletion;When the soft handover number of times of switching cell is be more than or equal to described first soft handover frequency threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell;
When the virtual switching times of described switching cell is be more than or equal to described first virtual switching times threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell.
3. neighbor cell optimizing method as claimed in claim 2, it is characterised in that also including the particular cell list information obtaining described Target cell, described particular cell list information includes black list information, Red List information;
Described described switching cell is labeled as deletion before, also include judging that described switching cell is whether in described Red List information, as no, then is labeled as deletion by described switching cell;
Before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging that described switching cell is whether in described black list information, in this way, does not add to this switching cell in described Neighboring Relation Table.
4. neighbor cell optimizing method as claimed in claim 3, it is characterised in that described particular cell list information also includes restriction and optimizes list information, isolation list information;Described restriction optimizes each community comprised in list information and does not allow to delete or increase, and the adjacent area of the Target cell in described isolation list information is only the community specified in region;
Described described switching cell is labeled as deletion before, also include judging whether described switching cell optimizes in list information in described restriction, as no, more described switching cell be labeled as deletion;
Before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging whether described switching cell optimizes in list information in described restriction, as no, judge that described switching cell is whether in the appointment region of described Target cell further according to isolation list information, in this way, in described Neighboring Relation Table, this switching cell is configured to the newly-increased adjacent area of described Target cell.
5. neighbor cell optimizing method as claimed in claim 2, it is characterised in that described described switching cell is labeled as deletion before, also include:
Obtain the primary importance information of the base station of described Target cell and the second position information of the base station of described switching cell;
Judging that whether the distance between the base station of described Target cell and the base station of described switching cell is less than super neighbour district distance threshold according to described primary importance information and described second position information, as no, ability is described is labeled as deletion by described switching cell.
6. neighbor cell optimizing method as claimed in claim 2, it is characterized in that, before being optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell, also include the interference data in described cell handover information and hash carries out filtering operation.
7. the neighbor cell optimizing method as described in any one of claim 2-6, it is characterized in that, adjacent area in described optimization Neighboring Relation Table carries out interworking correcting process obtain the first correction Neighboring Relation Table and be: the adjacent area newly increased in described optimization Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
The adjacent area for main plot, with described Target cell for described main plot with the adjacent area that respectively newly increases respectively;
If using the described Target cell adjacent area as described main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from described optimization Neighboring Relation Table;
If described Target cell is in the Neighboring Relation Table of described main plot, and described main plot is not labeled as deletion when described optimization process, it is determined that for completing interworking;
If described Target cell is in the Neighboring Relation Table of described main plot, and when described optimization process, described main plot is labeled as deletion, then cancel the deletion labelling of this main plot in described optimization Neighboring Relation Table;
If described Target cell has had been configured as the newly-increased adjacent area of described main plot in the optimization process of described main plot, it is determined that for completing interworking.
8. the neighbor cell optimizing method as described in any one of claim 2-6, it is characterised in that described method also includes:
Described first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table.
9. neighbor cell optimizing method as claimed in claim 8, it is characterised in that described method also includes:
Revise Neighboring Relation Table to described second to be carried out in a network;
The new cell handover information of described Target cell after the described second correction Neighboring Relation Table of acquisition enforcement;
New cell handover information according to described Target cell and described cell handover information judge whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes correctly.
10. neighbor cell optimizing method as claimed in claim 8, it is characterized in that, described first adjacent area revised in list carries out scrambler multiplexing correction obtain the second correction Neighboring Relation Table and be: revise, to described first, the adjacent area newly increased in list and carry out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted described first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in described first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
11. neighbor cell optimizing method as claimed in claim 9, it is characterized in that, new cell handover information according to described Target cell and described cell handover information judge whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes: judge that whether the adjacent area newly increased in described second correction Neighboring Relation Table is correct according to the new cell handover information of described Target cell and described cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described n1, n2 are more than 0, less than or equal to 1;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of m1* virtual switching times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of m2* virtual switching times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described m1, m2 are more than 0, less than or equal to 1.
12. a Neighborhood Optimization device, it is characterised in that including:
Data obtaining module, for obtaining the cell handover information of Target cell and current Neighboring Relation Table;
Optimization process module, obtains optimizing Neighboring Relation Table for being optimized process based on the adjacent area in the described cell handover information Neighboring Relation Table to described Target cell;
Interworking correcting module, obtains the first correction Neighboring Relation Table for the adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process.
13. Neighborhood Optimization device as claimed in claim 12, it is characterised in that described optimization process module includes soft handover and optimizes submodule and virtual handover optimization submodule;
Described soft handover optimizes submodule for when the soft handover number of times of switching cell is less than the first soft handover frequency threshold value in described cell handover information, judge that this switching cell is whether in described Neighboring Relation Table, in this way, this switching cell in described Neighboring Relation Table is labeled as deletion;When the soft handover number of times of switching cell is be more than or equal to described first soft handover frequency threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell;
Described virtual handover optimization submodule is for when the virtual switching times of described switching cell is be more than or equal to described first virtual switching times threshold value, judge that this switching cell is whether in described Neighboring Relation Table, as no, this switching cell is configured to by described Neighboring Relation Table the newly-increased adjacent area of described Target cell.
14. Neighborhood Optimization device as claimed in claim 13, it is characterised in that also include list acquisition module, for obtaining the particular cell list information of described Target cell, described particular cell list information includes black list information, Red List information;
Before described switching cell being labeled as deletion described in described soft handover optimization submodule, also include judging that described switching cell is whether in described Red List information, as no, then is labeled as deletion by described switching cell;
Described soft handover optimizes submodule and/or described virtual handover optimization submodule by before the described newly-increased adjacent area that switching cell is configured to described Target cell, also include judging that described switching cell is whether in described black list information, in this way, this switching cell is not added in described Neighboring Relation Table.
15. the Neighborhood Optimization device as described in claim 13 or 14, it is characterized in that, adjacent area in described optimization Neighboring Relation Table is carried out interworking correcting process and obtains the first correction Neighboring Relation Table and be by described interworking correcting module: the adjacent area newly increased in described optimization Neighboring Relation Table is carried out interworking correcting process, and interworking correcting process follows following principle:
The adjacent area for main plot, with described Target cell for described main plot with the adjacent area that respectively newly increases respectively;
If using the described Target cell adjacent area as described main plot, when the adjacent area number of this main plot is more than predetermined number threshold value, then be judged to can not interworking, this main plot is deleted from described optimization Neighboring Relation Table;
If described Target cell is in the Neighboring Relation Table of described main plot, and described main plot is not labeled as deletion when described optimization process, it is determined that for completing interworking;
If described Target cell is in the Neighboring Relation Table of described main plot, and when described optimization process, described main plot is labeled as deletion, then cancel the deletion labelling of this main plot in described optimization Neighboring Relation Table;
If described Target cell has had been configured as the newly-increased adjacent area of described main plot in the optimization process of described main plot, it is determined that for completing interworking.
16. the Neighborhood Optimization device as described in claim 13 or 14, it is characterised in that also include scrambler multiplexing correcting module, carry out scrambler multiplexing correction for the adjacent area revised in list to described first and obtain the second correction Neighboring Relation Table.
17. Neighborhood Optimization device as claimed in claim 16, it is characterised in that also include implementing module and correction verification module:
Described enforcement module is carried out in a network for revising Neighboring Relation Table to described second;
Described correction verification module is implemented described second revise the new cell handover information of described Target cell after Neighboring Relation Table for being obtained, and judges that described second revises in Neighboring Relation Table whether the adjacent area after optimization optimizes correctly according to the new cell handover information of described Target cell and described cell handover information.
18. Neighborhood Optimization device as claimed in claim 16, it is characterized in that, described first adjacent area revised in list is carried out scrambler multiplexing correction and obtains the second correction Neighboring Relation Table and be by described scrambler multiplexing interworking correcting module: revises, to described first, the adjacent area newly increased in list and carries out scrambler multiplexing correction, including:
The path, adjacent area calculating newly-increased neighboring BS relationship place causes scrambler multiplexed path number;
Revise list is deleted described first and cause the neighboring BS relationship that scrambler multiplexed path number is maximum, then the path, adjacent area recalculating remaining newly-increased neighboring BS relationship place causes scrambler multiplexed path number, and deletion causes the neighboring BS relationship that scrambler multiplexed path number is maximum in described first correction list, until newly-increased neighboring BS relationship will not cause scrambler multiplexing, obtain the second correction Neighboring Relation Table.
19. Neighborhood Optimization device as claimed in claim 17, it is characterized in that, with described cell handover information, described correction verification module judges whether the described second adjacent area revised after optimizing in Neighboring Relation Table optimizes according to the new cell handover information of described Target cell: judge that whether the adjacent area newly increased in described second correction Neighboring Relation Table is correct according to the new cell handover information of described Target cell and described cell handover information, including:
Increase newly as adjacent area for soft handover number of times be more than or equal to the first soft handover frequency threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of n1* soft handover number of times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of n2* soft handover number of times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default first success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described n1, n2 are more than 0, less than or equal to 1;
Increase newly as adjacent area for virtual switching times be more than or equal to the first virtual switching times threshold value, judge that this adjacent area soft handover number of times in described new cell handover information is whether more than this adjacent area of m1* virtual switching times in described cell handover information, whether this adjacent area soft handover number of times proportion in described new cell handover information is more than this adjacent area of m2* virtual switching times proportion in described cell handover information, and whether the handover success rate that this adjacent area is in described new cell handover information is more than default second success rate threshold value;As no, sentence the newly-increased mistake of this adjacent area;Described m1, m2 are more than 0, less than or equal to 1.
CN201410751303.7A 2014-12-09 2014-12-09 Neighbor cell optimization method and device Active CN105744574B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201410751303.7A CN105744574B (en) 2014-12-09 2014-12-09 Neighbor cell optimization method and device
PCT/CN2015/077544 WO2016090813A1 (en) 2014-12-09 2015-04-27 Neighbour cell optimization method, storage medium and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410751303.7A CN105744574B (en) 2014-12-09 2014-12-09 Neighbor cell optimization method and device

Publications (2)

Publication Number Publication Date
CN105744574A true CN105744574A (en) 2016-07-06
CN105744574B CN105744574B (en) 2020-11-06

Family

ID=56106554

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410751303.7A Active CN105744574B (en) 2014-12-09 2014-12-09 Neighbor cell optimization method and device

Country Status (2)

Country Link
CN (1) CN105744574B (en)
WO (1) WO2016090813A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107682883A (en) * 2017-10-19 2018-02-09 中国电信股份有限公司南京分公司 A kind of grand micro- collaboration neighbor cell configuration and optimization method
CN108076473A (en) * 2016-11-15 2018-05-25 中国移动通信集团广东有限公司 A kind of adjacent domain optimization processing method and device
CN108235389A (en) * 2016-12-22 2018-06-29 大唐移动通信设备有限公司 A kind of method and apparatus of dynamic configuration adjacent cell
CN108632847A (en) * 2017-03-20 2018-10-09 中国移动通信集团浙江有限公司 A kind of method and device of Neighborhood Optimization
CN111479300A (en) * 2019-01-24 2020-07-31 大唐移动通信设备有限公司 Method and device for updating neighbor relation

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1553609A (en) * 2003-06-05 2004-12-08 中兴通讯股份有限公司 Automatic optimizing method for realizing CDMA neighbouring region listing
CN101299834A (en) * 2008-06-24 2008-11-05 中国移动通信集团四川有限公司 Method for checking base station position
CN101459916A (en) * 2009-01-05 2009-06-17 普天信息技术研究院有限公司 Method for determining priority of adjacent domain
CN101594618A (en) * 2008-05-27 2009-12-02 中兴通讯股份有限公司 Adaptive configuring method for neighboring area in a kind of wireless network
CN101715217A (en) * 2008-10-06 2010-05-26 中国移动通信集团设计院有限公司 Method and device for configuring neighbor cell
CN101730053A (en) * 2008-10-27 2010-06-09 中兴通讯股份有限公司 Adjacent cell relation configuring method and automatic configuration server
CN101778412A (en) * 2010-02-25 2010-07-14 华为技术有限公司 Method and device for optimizing relation between neighbor cells
CN102036212A (en) * 2009-09-29 2011-04-27 中兴通讯股份有限公司 Method for updating neighbor cell list of home base station
US20110250890A1 (en) * 2008-12-26 2011-10-13 Xin Chen Method and apparatus for neighbor cell configuration and method and apparatus for femtocell base station configuration
CN102307370A (en) * 2011-08-09 2012-01-04 华南理工大学 Handover measurement control method for mobile communication system
CN102547753A (en) * 2010-12-22 2012-07-04 中兴通讯股份有限公司 Neighbor optimization method and device
US20130143558A1 (en) * 2010-08-13 2013-06-06 Hua Ni Method and device for managing adjacent relation among cells
CN103703809A (en) * 2013-09-10 2014-04-02 华为技术有限公司 Sector configuration method, service switching method, device and base station
CN103747460A (en) * 2009-10-27 2014-04-23 中兴通讯股份有限公司 Method for updating neighbor list and wireless parameters of home base station

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103945423A (en) * 2013-01-21 2014-07-23 京信通信系统(中国)有限公司 Method for optimizing neighbor cell list of base station and base station

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1553609A (en) * 2003-06-05 2004-12-08 中兴通讯股份有限公司 Automatic optimizing method for realizing CDMA neighbouring region listing
CN101594618A (en) * 2008-05-27 2009-12-02 中兴通讯股份有限公司 Adaptive configuring method for neighboring area in a kind of wireless network
CN101299834A (en) * 2008-06-24 2008-11-05 中国移动通信集团四川有限公司 Method for checking base station position
CN101715217A (en) * 2008-10-06 2010-05-26 中国移动通信集团设计院有限公司 Method and device for configuring neighbor cell
CN101730053A (en) * 2008-10-27 2010-06-09 中兴通讯股份有限公司 Adjacent cell relation configuring method and automatic configuration server
US20110250890A1 (en) * 2008-12-26 2011-10-13 Xin Chen Method and apparatus for neighbor cell configuration and method and apparatus for femtocell base station configuration
CN101459916A (en) * 2009-01-05 2009-06-17 普天信息技术研究院有限公司 Method for determining priority of adjacent domain
CN102036212A (en) * 2009-09-29 2011-04-27 中兴通讯股份有限公司 Method for updating neighbor cell list of home base station
CN103747460A (en) * 2009-10-27 2014-04-23 中兴通讯股份有限公司 Method for updating neighbor list and wireless parameters of home base station
CN101778412A (en) * 2010-02-25 2010-07-14 华为技术有限公司 Method and device for optimizing relation between neighbor cells
US20130143558A1 (en) * 2010-08-13 2013-06-06 Hua Ni Method and device for managing adjacent relation among cells
CN102547753A (en) * 2010-12-22 2012-07-04 中兴通讯股份有限公司 Neighbor optimization method and device
CN102307370A (en) * 2011-08-09 2012-01-04 华南理工大学 Handover measurement control method for mobile communication system
CN103703809A (en) * 2013-09-10 2014-04-02 华为技术有限公司 Sector configuration method, service switching method, device and base station

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108076473A (en) * 2016-11-15 2018-05-25 中国移动通信集团广东有限公司 A kind of adjacent domain optimization processing method and device
CN108235389A (en) * 2016-12-22 2018-06-29 大唐移动通信设备有限公司 A kind of method and apparatus of dynamic configuration adjacent cell
CN108632847A (en) * 2017-03-20 2018-10-09 中国移动通信集团浙江有限公司 A kind of method and device of Neighborhood Optimization
CN108632847B (en) * 2017-03-20 2021-11-09 中国移动通信集团浙江有限公司 Method and device for optimizing neighbor cell
CN107682883A (en) * 2017-10-19 2018-02-09 中国电信股份有限公司南京分公司 A kind of grand micro- collaboration neighbor cell configuration and optimization method
CN107682883B (en) * 2017-10-19 2020-12-01 中国电信股份有限公司南京分公司 Macro-micro cooperative neighbor configuration and optimization method
CN111479300A (en) * 2019-01-24 2020-07-31 大唐移动通信设备有限公司 Method and device for updating neighbor relation
CN111479300B (en) * 2019-01-24 2021-07-20 大唐移动通信设备有限公司 Method and device for updating neighbor relation

Also Published As

Publication number Publication date
WO2016090813A1 (en) 2016-06-16
CN105744574B (en) 2020-11-06

Similar Documents

Publication Publication Date Title
CN105744574A (en) Adjacent region optimization method and apparatus
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
CN109982352B (en) Pilot frequency switching method and device in TDD-LTE network
US9769681B2 (en) Apparatus, method, and non-transitory computer readable medium for self-organizing network
CN102726098B (en) Operator public land mobile network identification delivery method, base station and subscriber equipment
EP3152957B1 (en) Method for improving overall network performance and/or overall quality of service of user equipments in a mobile communication network, system for improving overall network performance and/or overall quality of service of user equipments in a mobile communication network, mobile communication network, program and computer program product
CN103108351A (en) Wireless link failure statistical method, relevant device and communication system
US9148834B2 (en) Method and apparatus for managing handover of a mobile station from a macro cell to a femto cell
CN102075902B (en) Method and device for determining new neighbor cell of serving cell
US20160066238A1 (en) Radio Network Information Management Method and Network Device
CN102045749A (en) Method, device and system for realizing optimization of neighbor cell
CN103607730A (en) Regional control method and system of mobile device communication
CN111328078B (en) Method and device for positioning pseudo base station
CN104602277B (en) A kind of optimized treatment method switched extremely and system
EP2480041A1 (en) Base station and neighbor base station information transmission method
CN102547764B (en) Method, system and device for improving mobile robustness
US9326196B1 (en) Updating an out-of-date source neighbor list
CN102187707B (en) Communication system, secondary base station, wireless communication method, communication program, communication circuit, and wireless relay device
CN102131256A (en) Method and base station for implementing cell reselection parameter negotiation
US9538486B1 (en) Dynamic power boosting based on contiguous and non-contiguous coverage
CN104066131A (en) Cell reselection parameter configuration method and base station
CN102740347A (en) Method, apparatus and system for acquiring signal quality information of unknown neighbor
CN102104898B (en) A kind of mobility parameter matching performance detection method and system
CN103945397A (en) Method, device and system for scale networking adjacent region configuration
CN107682883B (en) Macro-micro cooperative neighbor configuration and optimization method

Legal Events

Date Code Title Description
C06 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