CN102547753A - Neighbor optimization method and device - Google Patents

Neighbor optimization method and device Download PDF

Info

Publication number
CN102547753A
CN102547753A CN2010105999470A CN201010599947A CN102547753A CN 102547753 A CN102547753 A CN 102547753A CN 2010105999470 A CN2010105999470 A CN 2010105999470A CN 201010599947 A CN201010599947 A CN 201010599947A CN 102547753 A CN102547753 A CN 102547753A
Authority
CN
China
Prior art keywords
miss
neighboring cells
adjacent zone
deletion
switching times
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.)
Pending
Application number
CN2010105999470A
Other languages
Chinese (zh)
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 CN2010105999470A priority Critical patent/CN102547753A/en
Publication of CN102547753A publication Critical patent/CN102547753A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a neighbor optimization method and a neighbor optimization device. The method comprises the following steps of: determining the number of switching times of a main cell to each configured neighbor and each missed neighbor according to a switching dataset of the main cell, and determining a neighbor deletion threshold and a neighbor addition threshold according to a maximum value of the number of switching times; determining configured neighbors to be deleted according to the number of switching times of the main cell to each configured neighbor and the neighbor deletion threshold, and simultaneously determining missed neighbors to be added according to the number of switching times of the main cell to each missed neighbor and the neighbor addition threshold; and finally determining configured neighbors to be deleted and missed neighbors to be added in the conventional configured neighbors and the missed neighbors to be added according to preset neighbor addition and deletion rules, and deleting all the configured neighbors to be deleted. The addition and deletion of the neighbors are determined according to the numbers of switching times in the switching dataset, so that the problems of incapability of meeting the requirements of neighbor configuration in different geographical environments and neighbor configuration irrationality caused by leaving scrambling multiplexing under a multilevel neighbor relationship out of consideration in the prior art are solved.

Description

Adjacent area optimization method and device
Technical field
The present invention relates to communication technical field, relate in particular to a kind of based on the adjacent area optimization method and the device that switch and virtual switching is added up.
Background technology
It is a key factor that influences network performance that the adjacent area is optimized; In the WCDMA network; Have only the minizone that has defined neighboring BS relationship just can switch; Leak configuring adjacent cell if in fact exist between two sub-districts of neighbouring relations, failure and call drop then possibly switch between these two sub-districts; If the inappropriate adjacent area of polygamy then can take the adjacent area resource again, cause the wasting of resources; Therefore, find Lou join, the polygamy adjacent area, be the vital task and the means of the network optimization.
The method of neighbor cell configuration is the adaptive threshold that goes out the geographical adjacent cell in each sub-district under the base station according to the distance calculation of minizone at present; Calculate the priority of the sub-district that satisfies condition then according to thresholding, coverage direction, therefrom find out 31 the highest sub-districts of priority again as the adjacent area.Though this method has been considered the dense degree that distance, coverage direction and the sub-district between the sub-district distributes; But consider three-dimensional position: landform, landforms, highly, obstacle etc.; Do not consider that scrambler is multiplexing under the multilayer neighboring BS relationship, can not satisfy the neighbor cell configuration of managing variously under the environment.
Summary of the invention
In view of above-mentioned analysis; The present invention aims to provide a kind of adjacent area optimization method and device, can not satisfy the neighbor cell configuration under the different geographical environments and does not consider under the multilayer neighboring BS relationship that scrambler is multiplexing and cause the irrational problem of neighbor cell configuration in order to solve existing configuring method for neighboring area.
The object of the invention is mainly realized through following technical scheme:
The invention provides a kind of adjacent area optimization method, comprising:
Steps A: according to the switch data collection of main plot, confirm this main plot, and confirm adjacent area deletion thresholding and adjacent area increase thresholding according to the peak of switching times to each matched adjacent zone and to the switching times of each miss-configured neighboring cells;
Step B: delete the matched adjacent zone that thresholding confirms to intend deletion in the switching times and the adjacent area of matched adjacent zone according to each, confirm to intend newly-increased miss-configured neighboring cells according to the switching times and the adjacent area increase thresholding of each miss-configured neighboring cells simultaneously;
Step C: in the miss-configured neighboring cells that increase finally confirm need the matched adjacent zone of deletion and the miss-configured neighboring cells that need increase at existing matched adjacent zone with intending based on being scheduled to adjacent area additions and deletions rule, and delete the matched adjacent zone that all intend deletion.
Further, said step B specifically comprises: switching times is confirmed as the miss-configured neighboring cells of intending increase greater than the miss-configured neighboring cells that the adjacent area increases thresholding, switching times is confirmed as the matched adjacent zone of intending deletion less than the matched adjacent zone of adjacent area deletion thresholding.
Further, said method also comprises:
Existing matched adjacent zone number, the number of matched adjacent zone intending newly-increased miss-configured neighboring cells number and intend deletion are added up.
Further, among the said step C, specifically comprise in existing matched adjacent zone and the step of intending the final miss-configured neighboring cells of confirming to need the matched adjacent zone of deletion and needing to increase in the miss-configured neighboring cells that increase newly based on predetermined adjacent area additions and deletions rule:
The adjacent area whether judgement " number of matched adjacent zone of miss-configured neighboring cells number-plan deletion that existing matched adjacent zone number+plan is newly-increased " is less than or equal to regulation limits the number, if all are intended the miss-configured neighboring cells that increase newly all be increased in the existing matched adjacent zone; If not; The matched adjacent zone of intending deletion is removed the matched adjacent zone from existing; Remaining other matched adjacent zone sort according to switching times with the newly-increased miss-configured neighboring cells of plan, and confirm existing matched adjacent zone and intend the matched adjacent zone of needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that needs increase according to the priority of ordering.
Further, confirm that based on the priority of ordering existing matched adjacent zone and the step of intending matched adjacent zone that needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that need to increase specifically comprise:
For intending newly-increased miss-configured neighboring cells:, join in the matched adjacent zone as newly-increased adjacent area, otherwise do not add if ordering is before limiting the number in the adjacent area; For having matched adjacent zone now: if ordering limits the number in the adjacent area before, continue to keep, delete suggestion otherwise provide.
Wherein, for matched adjacent zone, said switching times is: actual switching times, the summation of perhaps actual switching times and virtual switching times; For miss-configured neighboring cells, said switching times is: virtual switching times, the summation of perhaps actual switching times and virtual switching times.
Said adjacent area increases peak * first parameter value of thresholding=switching times; Peak * second parameter value of said adjacent area deletion thresholding=switching times.
The present invention also provides a kind of adjacent area optimization means, comprising:
Statistical module is used for the switch data collection according to the main plot, confirms each switching times of matched adjacent zone and each miss-configured neighboring cells, and confirms adjacent area deletion thresholding and adjacent area increase thresholding according to the peak of switching times;
The primary election module is used for deleting the matched adjacent zone that thresholding confirms to intend deletion in the switching times and the adjacent area of matched adjacent zone according to each, confirms to intend newly-increased miss-configured neighboring cells according to the switching times and the adjacent area increase thresholding of each miss-configured neighboring cells simultaneously;
The modeling piece was used for finally confirming the matched adjacent zone of needs deletion and the miss-configured neighboring cells of needs increase according to predetermined adjacent area additions and deletions rule in the newly-increased miss-configured neighboring cells of existing matched adjacent zone and plan, and deleted the matched adjacent zone that all intend deletion end.
Further, said statistical module also is used for, and existing matched adjacent zone number, the number of matched adjacent zone intending newly-increased miss-configured neighboring cells number and intend deletion are added up.
Further; Said whole modeling piece specifically is used for; The adjacent area whether judgement " number of matched adjacent zone of miss-configured neighboring cells number-plan deletion that existing matched adjacent zone number+plan is newly-increased " is less than or equal to regulation limits the number; If all are intended newly-increased miss-configured neighboring cells all are increased in the existing matched adjacent zone; If not; The matched adjacent zone of intending deletion is removed the matched adjacent zone from existing; Remaining other matched adjacent zone sort according to switching times with the newly-increased miss-configured neighboring cells of plan, and confirm existing matched adjacent zone and intend the matched adjacent zone of needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that needs increase according to the priority of ordering.
Beneficial effect of the present invention is following:
The present invention judges the additions and deletions of adjacent area through the switching times that adopts the real network switch data to concentrate, and has overcome existing configuring method for neighboring area and can not satisfy the neighbor cell configuration under the different geographical environments and do not consider under the multilayer neighboring BS relationship that scrambler is multiplexing and cause the irrational problem of neighbor cell configuration.
Other features and advantages of the present invention will be set forth in specification subsequently, and from specification, becoming apparent of part perhaps understood by embodiment of the present invention.The object of the invention can be realized through the structure that in the specification of being write, claims and accompanying drawing, is particularly pointed out and obtained with other advantages.
Description of drawings
Fig. 1 is the schematic flow sheet of the said method of the embodiment of the invention;
Fig. 2 is the structural representation of the said device of the embodiment of the invention.
Embodiment
Specifically describe the preferred embodiments of the present invention below in conjunction with accompanying drawing, wherein, accompanying drawing constitutes the application's part, and is used to explain principle of the present invention with embodiments of the invention.For clear and simplification purpose, when it possibly make theme of the present invention smudgy, with specifying in detail of known function and structure in the omission device described herein.
At first, be elaborated in conjunction with 1 pair of said method of the embodiment of the invention of accompanying drawing.
As shown in Figure 1, Fig. 1 is the schematic flow sheet of the said method of the embodiment of the invention, specifically can comprise the steps:
Step 101: according to the switch data collection of main plot A, confirm the collection S of matched adjacent zone and the miss-configured neighboring cells collection X of main plot, and calculate existing matched adjacent zone number m among the matched adjacent zone collection S;
Step 102: add up this main plot A and arrive each switching times and the switching times of this main plot of matched adjacent zone, therefrom find the peak of switching times, be designated as MAX to each miss-configured neighboring cells; Wherein, the main plot to certain the switching times of matched adjacent zone comprise the summation of actual switching times and virtual switching times, possibly virtual switching times be zero also, promptly only comprise actual switching times; The main plot to the switching times of certain miss-configured neighboring cells possibly comprise border switching times and virtual switching times with, possibly actual switching times be zero also, promptly comprise virtual switching times;
Need to prove; The sub-district that does not have true switching times for having only virtual switching times; The switch data that reports is concentrated does not have the sub-district id information; This just need find the sub-district according to its scrambler, if can not find corresponding district, then is thought of as interference signal and does not handle as miss-configured neighboring cells;
Step 103: the peak MAX according to switching times calculates adjacent area increase thresholding Threshold_Add and adjacent area deletion thresholding Threshold_Delete respectively, wherein,
Increase thresholding Threshold_Add=MAX*a%;
Deletion thresholding Threshold_Delete=MAX*d%; Threshold_Add and Threshold_Delete are dynamic thresholds, and wherein, parameter a is first parameter value that presets; D is second parameter value that presets; The value user of a and d can carry out oneself definition according to the network actual conditions, and the span of general a is 0.5~2, and the span of d is 6~15;
Step 104: in the collection X of miss-configured neighboring cells, find all miss-configured neighboring cells of virtual switching times>Threshold_Add and be increased to and intend among the newly-increased adjacent area collection Z, calculate these simultaneously and intend newly-increased miss-configured neighboring cells number n;
Step 105: all that in matched adjacent zone collection S, find virtual switching times<Threshold_Delete have been joined the sub-district and have been increased to and intended among the deletion adjacent area collection D, calculate the number of the matched adjacent zone k that these intend deletion simultaneously;
Step 106: finally confirm the additions and deletions of adjacent area according to predetermined adjacent area additions and deletions principle; Promptly judge the adjacent area whether (adjacent area concentrate existing adjacent area number m+ intend the adjacent area number k that newly-increased adjacent area number n-intends deletion) is less than or equal to regulation limit the number (for example 31); If be less than or equal to; Then execution in step 107, otherwise execution in step 108;
Step 107: the adjacent area that (existing matched adjacent zone number m+ intends the number of the matched adjacent zone k that newly-increased miss-configured neighboring cells number n-intends deletion) is less than or equal to regulation limits the number, and then provides the user and all are intended newly-increased miss-configured neighboring cells all is increased to the suggestion among the matched adjacent zone collection S;
Step 108: (existing matched adjacent zone number m+ intends the number of the matched adjacent zone k that newly-increased miss-configured neighboring cells number n-intends deletion) is greater than predetermined adjacent area restricting data; That matched adjacent zone that needs to intend deletion is from removing the matched adjacent zone collection S, with matched adjacent zone concentrate remaining all matched adjacent zone with intend the miss-configured neighboring cells that increase newly and sort according to switching times; For intending newly-increased miss-configured neighboring cells:, otherwise do not join among the matched adjacent zone collection S if ordering preceding 31, joins matched adjacent zone as the adjacent area that increases newly and concentrates; For existing matched adjacent zone: if ordering preceding 31, continues to be retained among the matched adjacent zone collection S, preceding 31, then provide the suggestion of user with its deletion if fall;
Step 109: the matched adjacent zone that will intend whole plan deletions of deletion adjacent area collection D is deleted.
For the ease of understanding the present invention, below will further specify with a concrete example.
1) like following table one; Switch data collection according to main plot A; Can confirm the adjacent area collection S (S1 is matched adjacent zone to S31) of A; Existing adjacent area number m among the NEIGHBOR SET S is 31, and miss-configured neighboring cells collection X (X1 is miss-configured neighboring cells to X7) is so be not counted in miss-configured neighboring cells collection X because scrambler is 77 the sub-district that in database, do not match.
Table one:
2) in the switching times of the switching times of each adjacent area and A each adjacent area in the X, find the peak of switching times in from A to S, be designated as MAX (A-X);
For example: MAX in the table one (A-X)=1786.
3) calculating the adjacent area respectively according to MAX (A-X) increases thresholding Threshold_Add and adjacent area deletion thresholding Threshold_Delete, wherein,
Increase thresholding: Threshold_Add=MAX (A-X) * a%;
Deletion thresholding: Threshold_Delete=MAX (A-X) * d%,
Here, if the parameter value that is provided with is a=10 and d=1; Then
Increase thresholding: Threshold_Add=MAX (A-X) * 10%=178.6;
Deletion thresholding: Threshold_Delete=MAX (A-X) * 1%=17.86,
4) in the collection X of miss-configured neighboring cells, find virtual switching times greater than all sub-districts that increase thresholding Threshold_Add and join and intend among the newly-increased adjacent area collection Z, calculate its number n simultaneously, these sub-districts are as intending newly-increased adjacent area;
Here, can confirm to intend newly-increased adjacent area is X1, X2, and X3, X4, X5 intends increase adjacent area number n=5;
5) in matched adjacent zone collection S, find switching times less than all sub-districts of deletion thresholding Threshold_Delete and join and intend among the deletion adjacent area collection D, calculate its number k simultaneously, these sub-districts are as intending the deletion adjacent area;
Here, confirmable plan deletion adjacent area is S29, S30, and S31 intends deletion adjacent area number k=3;
6) calculating " the newly-increased adjacent area of existing matched adjacent zone number+plans number-plans deleted the adjacent area number " is the value of m+n-k, judges that it is whether above adjacent area limit the number (for example 32):
If m+n-k≤31 then all provide the suggestion of newly-increased adjacent area with the newly-increased adjacent area of the plan among all adjacent area collection Z;
If m+n-k>31; Then remove the adjacent area collection D that will delete among the collection S of adjacent area; Sort their switching times (switching times+virtual switching times) with the adjacent area of intending among the newly-increased adjacent area collection Z together in all remaining adjacent areas; Ordering provides the suggestion of newly-increased adjacent area among the set Z in preceding 31 adjacent area; Ordering keeps as the adjacent area in preceding 31 adjacent area in the S set, and ordering provides the suggestion of deletion adjacent area 31 later adjacent areas;
Here, m+n-k=31+5-3=33
Because 33 greater than 32, therefore need be with sub-district S1~S28 and X1, X2, X3, X4, the switching times of X5 sorts, because S27 and S28 come at last, therefore need S27 and S28 be provided the suggestion of deletion adjacent area.
7) intend the adjacent area of deleting among all adjacent area collection D and all provide the deletion suggestion.
Need to prove that the adjacent area increases thresholding and adjacent area deletion thresholding only plays partial action, also having a very important restriction is exactly to guarantee that adjacent area quantity all the time can not be above 31.
The result who obtains at last is shown in table two:
Figure BSA00000394339200091
Figure BSA00000394339200101
Next combine 2 pairs of said devices of the embodiment of the invention of accompanying drawing to be elaborated.
As shown in Figure 2, Fig. 2 is the structural representation of the said device of the embodiment of the invention, specifically can comprise: statistical module, primary election module and whole modeling piece, wherein,
Statistical module according to the switch data collection of main plot, is confirmed each switching times of matched adjacent zone and each miss-configured neighboring cells, and confirms adjacent area deletion thresholding and adjacent area increase thresholding according to the peak of switching times; Statistical module also is used for, and existing matched adjacent zone number, the number of matched adjacent zone intending newly-increased miss-configured neighboring cells number and intend deletion are added up.
The primary election module is deleted the matched adjacent zone that thresholding confirms to intend deletion in the switching times and the adjacent area of matched adjacent zone according to each, confirms to intend newly-increased miss-configured neighboring cells according to the switching times and the adjacent area increase thresholding of each miss-configured neighboring cells simultaneously;
The modeling piece was confirmed the matched adjacent zone of needs deletion and the miss-configured neighboring cells of needs increase according to predetermined adjacent area additions and deletions rule is final in the miss-configured neighboring cells that existing matched adjacent zone and plan increase newly, and was deleted the matched adjacent zone of all plan deletions end; Be exactly specifically; The adjacent area whether whole modeling piece judgement " number of matched adjacent zone of miss-configured neighboring cells number-plan deletion that existing matched adjacent zone number+plan is newly-increased " is less than or equal to regulation limits the number; If all are intended newly-increased miss-configured neighboring cells all are increased in the existing matched adjacent zone; If not; The matched adjacent zone of intending deletion is removed the matched adjacent zone from existing; Remaining other matched adjacent zone sort according to switching times with the newly-increased miss-configured neighboring cells of plan, and confirm existing matched adjacent zone and intend the matched adjacent zone of needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that needs increase according to the priority of ordering.
For the concrete implementation procedure of said each module of device of the embodiment of the invention, because existing detailed description the in the said method, so locate to repeat no more.
In sum; The embodiment of the invention provides a kind of adjacent area optimization method and device; Because the said technical scheme of the embodiment of the invention is to judge the additions and deletions of adjacent area according to switching times that the switch data of real network is concentrated; Therefore it can not receive the influence of factors such as position, landform, landforms, deflection and the scrambler of sub-district be multiplexing, configures more scientific and effective adjacent area.
With respect to the optimization method that only comes configuring adjacent cell according to sub-district distance and coverage direction; The embodiment of the invention can be more accurately with the sub-district deletion that should not be configured to the adjacent area; The cell configuration that should be configured to the adjacent area is the adjacent area; Effectively utilize the adjacent area resource, avoided the waste of adjacent area resource; Optimize efficient multiplication especially, accuracy multiplication with respect to artificial adjacent area.
Through the test in a plurality of areas, adopt the said technical scheme of the embodiment of the invention, the accuracy rate that distribute rationally the adjacent area has very strong practicality up to more than 85%.
The above; Be merely the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technical staff who is familiar with the present technique field is in the technical scope that the present invention discloses; The variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.

Claims (10)

1. an adjacent area optimization method is characterized in that, comprising:
Steps A: according to the switch data collection of main plot, confirm this main plot, and confirm adjacent area deletion thresholding and adjacent area increase thresholding according to the peak of switching times to each matched adjacent zone and to the switching times of each miss-configured neighboring cells;
Step B: delete the matched adjacent zone that thresholding confirms to intend deletion in the switching times and the adjacent area of matched adjacent zone according to each, confirm to intend newly-increased miss-configured neighboring cells according to the switching times and the adjacent area increase thresholding of each miss-configured neighboring cells simultaneously;
Step C: in the miss-configured neighboring cells that increase finally confirm need the matched adjacent zone of deletion and the miss-configured neighboring cells that need increase at existing matched adjacent zone with intending based on being scheduled to adjacent area additions and deletions rule, and delete the matched adjacent zone that all intend deletion.
2. method according to claim 1; It is characterized in that; Said step B specifically comprises: switching times is confirmed as the miss-configured neighboring cells of intending increase greater than the miss-configured neighboring cells that the adjacent area increases thresholding, switching times is confirmed as the matched adjacent zone of intending deletion less than the matched adjacent zone of adjacent area deletion thresholding.
3. method according to claim 1 is characterized in that, said method also comprises:
Existing matched adjacent zone number, the number of matched adjacent zone intending newly-increased miss-configured neighboring cells number and intend deletion are added up.
4. method according to claim 3; It is characterized in that; Among the said step C, final in the newly-increased miss-configured neighboring cells confirm that the matched adjacent zone of needs deletion and the step of the miss-configured neighboring cells of needs increase specifically comprise at existing matched adjacent zone with intending according to predetermined adjacent area additions and deletions rule:
The adjacent area whether judgement " number of matched adjacent zone of miss-configured neighboring cells number-plan deletion that existing matched adjacent zone number+plan is newly-increased " is less than or equal to regulation limits the number, if all are intended the miss-configured neighboring cells that increase newly all be increased in the existing matched adjacent zone; If not; The matched adjacent zone of intending deletion is removed the matched adjacent zone from existing; Remaining other matched adjacent zone sort according to switching times with the newly-increased miss-configured neighboring cells of plan, and confirm existing matched adjacent zone and intend the matched adjacent zone of needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that needs increase according to the priority of ordering.
5. based on the described method of claim 4, it is characterized in that, confirm that based on the priority of ordering existing matched adjacent zone and the step of intending matched adjacent zone that needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that need to increase specifically comprise:
For intending newly-increased miss-configured neighboring cells:, join in the matched adjacent zone as newly-increased adjacent area, otherwise do not add if ordering is before limiting the number in the adjacent area; For having matched adjacent zone now: if ordering limits the number in the adjacent area before, continue to keep, delete suggestion otherwise provide.
6. according to claim 1,2 or 4 described methods, it is characterized in that for matched adjacent zone, said switching times is: actual switching times, the summation of perhaps actual switching times and virtual switching times; For miss-configured neighboring cells, said switching times is: virtual switching times, the summation of perhaps actual switching times and virtual switching times.
7. method according to claim 1 and 2 is characterized in that, said adjacent area increases peak * first parameter value of thresholding=switching times; Peak * second parameter value of said adjacent area deletion thresholding=switching times.
8. an adjacent area optimization means is characterized in that, comprising:
Statistical module is used for the switch data collection according to the main plot, confirms each switching times of matched adjacent zone and each miss-configured neighboring cells, and confirms adjacent area deletion thresholding and adjacent area increase thresholding according to the peak of switching times;
The primary election module is used for deleting the matched adjacent zone that thresholding confirms to intend deletion in the switching times and the adjacent area of matched adjacent zone according to each, confirms to intend newly-increased miss-configured neighboring cells according to the switching times and the adjacent area increase thresholding of each miss-configured neighboring cells simultaneously;
The modeling piece was used for finally confirming the matched adjacent zone of needs deletion and the miss-configured neighboring cells of needs increase according to predetermined adjacent area additions and deletions rule in the newly-increased miss-configured neighboring cells of existing matched adjacent zone and plan, and deleted the matched adjacent zone that all intend deletion end.
9. device according to claim 8 is characterized in that said statistical module also is used for, and existing matched adjacent zone number, the number of matched adjacent zone intending newly-increased miss-configured neighboring cells number and intend deletion are added up.
10. device according to claim 9; It is characterized in that; Said whole modeling piece specifically is used for; The adjacent area whether judgement " number of matched adjacent zone of miss-configured neighboring cells number-plan deletion that existing matched adjacent zone number+plan is newly-increased " is less than or equal to regulation limits the number, if all are intended the miss-configured neighboring cells that increase newly all be increased in the existing matched adjacent zone; If not; The matched adjacent zone of intending deletion is removed the matched adjacent zone from existing; Remaining other matched adjacent zone sort according to switching times with the newly-increased miss-configured neighboring cells of plan, and confirm existing matched adjacent zone and intend the matched adjacent zone of needs deletion in the newly-increased miss-configured neighboring cells and the miss-configured neighboring cells that needs increase according to the priority of ordering.
CN2010105999470A 2010-12-22 2010-12-22 Neighbor optimization method and device Pending CN102547753A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010105999470A CN102547753A (en) 2010-12-22 2010-12-22 Neighbor optimization method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010105999470A CN102547753A (en) 2010-12-22 2010-12-22 Neighbor optimization method and device

Publications (1)

Publication Number Publication Date
CN102547753A true CN102547753A (en) 2012-07-04

Family

ID=46353455

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010105999470A Pending CN102547753A (en) 2010-12-22 2010-12-22 Neighbor optimization method and device

Country Status (1)

Country Link
CN (1) CN102547753A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104301902A (en) * 2014-09-05 2015-01-21 中国联合网络通信集团有限公司 Adjacent region configuration method and device
CN105578443A (en) * 2014-10-09 2016-05-11 中兴通讯股份有限公司 Neighbor cell maintenance method and neighbor cell maintenance device
WO2016086595A1 (en) * 2014-12-04 2016-06-09 中兴通讯股份有限公司 Method and apparatus for solving wireless communication network scrambling code conflict, and computer storage medium
CN105744574A (en) * 2014-12-09 2016-07-06 中兴通讯股份有限公司 Adjacent region optimization method and apparatus
WO2016119428A1 (en) * 2015-01-27 2016-08-04 中兴通讯股份有限公司 Neighbouring cell optimization method, terminal and computer storage medium
CN106332136A (en) * 2016-08-24 2017-01-11 上海华为技术有限公司 Data processing method and wireless network controller
WO2017004941A1 (en) * 2015-07-08 2017-01-12 中兴通讯股份有限公司 Method and device for neighbor cell configuration
CN108271223A (en) * 2016-12-31 2018-07-10 中国移动通信集团吉林有限公司 A kind of neighbor cell optimizing method and electronic equipment

Citations (3)

* 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
CN101478739A (en) * 2008-01-04 2009-07-08 上海华为技术有限公司 Method, system and related device for optimizing cell neighboring relation list
CN101668307A (en) * 2008-09-02 2010-03-10 华为技术有限公司 Method, system and equipment for communication

Patent Citations (3)

* 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
CN101478739A (en) * 2008-01-04 2009-07-08 上海华为技术有限公司 Method, system and related device for optimizing cell neighboring relation list
CN101668307A (en) * 2008-09-02 2010-03-10 华为技术有限公司 Method, system and equipment for communication

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104301902A (en) * 2014-09-05 2015-01-21 中国联合网络通信集团有限公司 Adjacent region configuration method and device
CN104301902B (en) * 2014-09-05 2018-08-10 中国联合网络通信集团有限公司 A kind of configuring method for neighboring area and equipment
CN105578443A (en) * 2014-10-09 2016-05-11 中兴通讯股份有限公司 Neighbor cell maintenance method and neighbor cell maintenance device
WO2016086595A1 (en) * 2014-12-04 2016-06-09 中兴通讯股份有限公司 Method and apparatus for solving wireless communication network scrambling code conflict, and computer storage medium
CN105722108A (en) * 2014-12-04 2016-06-29 中兴通讯股份有限公司 Method and device for overcoming scrambling code conflict in wireless communication network
CN105722108B (en) * 2014-12-04 2020-03-27 中兴通讯股份有限公司 Method and device for solving scrambling conflict of wireless communication network
CN105744574A (en) * 2014-12-09 2016-07-06 中兴通讯股份有限公司 Adjacent region optimization method and apparatus
WO2016119428A1 (en) * 2015-01-27 2016-08-04 中兴通讯股份有限公司 Neighbouring cell optimization method, terminal and computer storage medium
CN105992244A (en) * 2015-01-27 2016-10-05 中兴通讯股份有限公司 Neighboring cell optimization method and terminal
WO2017004941A1 (en) * 2015-07-08 2017-01-12 中兴通讯股份有限公司 Method and device for neighbor cell configuration
CN106332136A (en) * 2016-08-24 2017-01-11 上海华为技术有限公司 Data processing method and wireless network controller
CN108271223A (en) * 2016-12-31 2018-07-10 中国移动通信集团吉林有限公司 A kind of neighbor cell optimizing method and electronic equipment

Similar Documents

Publication Publication Date Title
CN102547753A (en) Neighbor optimization method and device
CN107547633B (en) User constant standing point processing method and device and storage medium
CN103188741B (en) Neighbor cell optimizing method and base station in a kind of mobile communications network
Mongiovi et al. Efficient multicasting for delay tolerant networks using graph indexing
Cetinkaya et al. On the fitness of geographic graph generators for modelling physical level topologies
Ma et al. State estimation over a semi-Markov model based cognitive radio system
CN108566618A (en) Obtain method, apparatus, equipment and storage medium that user is resident rule
CN100452926C (en) A method and apparatus for configuration of 2G neighbor cell for 3G cell
CN101883015A (en) Method and system for filtering construction alarms
CN103902636A (en) Method and server for pushing information based on filtering and clustering method
Trivedi et al. Performability modelling of wireless communication systems
CN105187548A (en) Cluster monitoring information collection method and system
CN102420797B (en) Topology mapping method and system
CN113133064A (en) Switching method and device, storage medium and electronic equipment
CN108271181B (en) PCI (peripheral component interconnect) optimization method and device for wireless network
CN109101682B (en) Road network dual topological structure establishing method
CN103179607B (en) A kind of Optimal Configuration Method of network scrambler and device
CN104219622B (en) Number assay method and crowd situation monitoring method and system based on LAC
CN104242993B (en) Mesolow power communication Access Network bandwidth prediction method
CN104333875B (en) A kind of frequency method of adjustment and device
CN105472627A (en) 4G network program and optimization method based on cycle flower arrangement algorithm
CN103226611B (en) A kind of combined body method for service selection based on tabu search
WO2016065759A1 (en) Method and apparatus for optimizing neighbour cell list
Liu et al. Distribution system outage and restoration analysis using a wireless AMR system
CN109768878A (en) A kind of network work order calculation method and device based on big data

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20120704