CN100486380C - Automatic optimizing method for realizing CDMA neighbouring region listing - Google Patents

Automatic optimizing method for realizing CDMA neighbouring region listing Download PDF

Info

Publication number
CN100486380C
CN100486380C CNB031318258A CN03131825A CN100486380C CN 100486380 C CN100486380 C CN 100486380C CN B031318258 A CNB031318258 A CN B031318258A CN 03131825 A CN03131825 A CN 03131825A CN 100486380 C CN100486380 C CN 100486380C
Authority
CN
China
Prior art keywords
sub
district
switching
statistics
neighboring cell
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CNB031318258A
Other languages
Chinese (zh)
Other versions
CN1553609A (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.)
Global Innovation Polymerization LLC
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 CNB031318258A priority Critical patent/CN100486380C/en
Publication of CN1553609A publication Critical patent/CN1553609A/en
Application granted granted Critical
Publication of CN100486380C publication Critical patent/CN100486380C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Abstract

This invention is relative to a method for implementing the automatic optimization to neighbor list in CDMA system. The OM center makes classification and statistics to the switching data; the switch happens, records the data according to the data structure; selects a type that takes absolutely dominance in the statistic numbers to participate the decision about next neighbor. Sets the threshold among the different kind of statistic data, according to the rationality about switched statistic data and relevant threshold to the neighbor list configuration, executes the decision, gives the optimized neighbor list, according to the optimized neighbor list automatically sets up the neighbor.

Description

Realize the automatic optimization method of CDMA Neighboring Cell List
Technical field
The present invention relates to a kind of automatic optimization method of realizing code division multiple access (CDMA) honeycomb mobile communcations system Neighboring Cell List.
Background technology
Code division multiple access (CDMA) is a kind of in the mobile communication multiple access modulation technique commonly used.Fig. 1 has provided a typical C DMA honeycomb mobile communcations system structure chart.Travelling carriage (MS) 12A or 12B, by base station transceiver (BTS) 16A or 16B, 14A carries out communication with base station controller (BSC).At a time travelling carriage may be simultaneously set up linking relationship simultaneously with two, three or more base station.Base station controller carries out network communication by mobile switching centre (MSC) and PSTN or ISDN again, and a mobile switching centre (MSC) also can meet other base station controller (BSC) 14B etc. simultaneously.
Travelling carriage 12A moves to sub-district 16B from sub-district 16A in communication process, will switch.Cdma system is supported a kind of soft handover that is referred to as, and is different from the handover of other cellular communication systems.
At first soft handover is a Mobile Assisted Handover.Travelling carriage is in handover procedure, constantly to around the signal strength signal intensity of other sub-districts (adjacent area) search for, when the signal strength signal intensity of finding one or several adjacent area exceeds the setting threshold value, to current service cell 16A transmitted power measurement report message (PMM message), 16A gives base station controller (BSC) 14A with the PMM information reporting, and whether 14A decision 12A starts handover.
Second difference is in the CDMA handover procedure, travelling carriage 12A sets up linking relationship with Target cell 16B earlier, travelling carriage 12A receives the signal from 16A and two sub-districts of 16B simultaneously, 16A and 16B receive the reverse link signal from travelling carriage 12A simultaneously, when finding certain sub-district, for example the 16A signal strength signal intensity is lower than a certain setting thresholding, and travelling carriage 12A reports PMM message to give 16A and 16B, 16A and 16B report 14A simultaneously, the 14A decision linking relationship with 16A that whether breaks.
Whole handoff procedure be earlier with the Target cell link setup, again with the process of former sub-district chain rupture.User 12A in whole communication process to handover without any discovering.
The handover procedure of other honeycomb mobile communcations systems is first and former Serving cell Break Link relations, sets up new linking relationship with Target cell again, causes existing in the user's communication process being interrupted, and perceives " click clatter " sound in the handover procedure.
In soft switching process, be the variation of neighboring area signal intensity around travelling carriage 12A constantly monitors as one of necessary link.The 18A of operation maintenance center (OMC) is Neighboring Cell List of each cell maintenance among requirement Fig. 1, to guarantee the efficient of travelling carriage searching neighboring area signal intensity.
Because the wireless transmission circumstance complication in city, the adjacent area distribution is not equal to the neighbor cell in the network topological diagram; Along with the expansion of network size, the adjacent area is tending towards ever-increasing trend, prescribes a time limit on the Neighboring Cell List that exceeds the agreement regulation, because the adjacent area is not joined and will be caused switching call drop; Because the network capacity extension causes network topology structure to change, and requires Neighboring Cell List to upgrade thereupon.Therefore, it is long-term work that the adjacent area is optimized, and needs to bring in constant renewal in, and continues to optimize.In order to alleviate the work load that the adjacent area is optimized, people constantly explore Neighboring Cell List Automatic Optimal method for updating.
United States Patent (USP) has been described a kind of neighbouring areas list method of determining for No. 6360098 on the computer network emulation platform.According to the signal mode, the Neighboring Cell List of this sub-district is determined from a plurality of other cell signal strength in the frontier district of calculating certain sub-district according to the size of signal strength signal intensity.At first, because network simulation can not reflect the coverage condition of live network fully, exist than big-difference with the real network environment, the Neighboring Cell List that causes emulation platform to be determined can only need be continued to optimize in the subsequent network optimizing process as the reference of network initial adjacent area setting.Secondly, emulation platform Network Based is determined neighbouring areas list method, is difficult to accomplish automatic adjacent section tabulation optimization renewal.
United States Patent (USP) has been described a kind of unidirectional switching times and pilot frequency intensity of utilizing for No. 6119005 and has been chosen, optimized neighbouring areas list method automatically.Technical scheme is as follows: the switch data of this sub-district service travelling carriage is responsible for adding up in each sub-district.The travelling carriage of so-called this sub-district service is meant the travelling carriage nearest apart from this sub-district, and this sub-district is the strongest in a plurality of cell signals of receiving of travelling carriage in other words, defines this sub-district so and provides service for this travelling carriage.The switch data of travelling carriage comprises to the switching times of other sub-districts and receives the respective cell pilot frequency intensity, after statistics a period of time, is calculated as follows tolerance according to M i=∑ P i+ a iN i, P iThe receiving intensity (the I value is 1~512) of representing the I pilot tone, N iExpression is to the switching times of I pilot tone corresponding district.a iBe weight coefficient.Press M iSize order sorts to the sub-district, gets preceding 20 sub-districts and constitutes Neighboring Cell List.
There is following problem in the technical scheme of describing in No. the 6119005th, the patent.At first, the switching times statistics of this patent is only considered the data of unidirectional switching, but neighbor cell configuration has the demand of interworking, for example sub-district A allocating cell C is as the adjacent area, sub-district C needs allocating cell A as the adjacent area equally, the therefore foundation of selecting as the adjacent area, can not only consider A → C switching times what, also to consider the switching times statistics of C → A, otherwise can cause adjacent area interworking rate to descend.Be limited to the boundary on the Neighboring Cell List that the technical scheme that patent 6119005 is described finally provides with consensus standard, constitute Neighboring Cell List, obviously do not consider the demand of adjacent area interworking.Secondly, successful switch not merely betides between the adjacent area.When switching generation, the sub-district of service travelling carriage has a plurality of, and at this moment the adjacent area of travelling carriage is the union of the former cell neighbor list of a plurality of services.Therefore switch in the statistics and switch the statistics except comprising the adjacent area, also comprise non-adjacent area and switch, non-adjacent area is switched and is had plenty of success, has plenty of failure.For example, it is A and B that travelling carriage is served former sub-district, switches to the C sub-district.The C sub-district is the adjacent area (in the Neighboring Cell List of A) of A, but the C sub-district is not in the Neighboring Cell List of B.For current switching, base station system will be made following statistics: an adjacent area takes place and switches in A → C, and B → C once non-adjacent area takes place switches.
Summary of the invention
Based on the above-mentioned technical issues that need to address, the object of the present invention is to provide a kind of being easy to realize, the Neighboring Cell List in the cdma cellular mobile communcations system is carried out the method for Automatic Optimal.
The present invention proposes a kind of automatic optimization method of CDMA Neighboring Cell List, comprises the steps:
Step 1: according to carrier frequency, service area, switching direction, neighbor cell configuration state, switching result switch data is carried out statistic of classification by operation maintenance center, take place once to switch, press following data structure records data: switch the carrier frequency information that takes place, switch the service area information that takes place, Serving cell and switching target small area sign; The neighbor cell configuration relation of Serving cell and Target cell; Handover success and handoff failure;
Step 2: for carrier frequency, service area and the switching direction determined multiple switching statistics down, as criterion, promptly every kind switches switching times is maximum in the statistics statistic as criterion, participates in follow-up adjacent area and adjudicates with the statistic that has comparative advantage;
Step 3: in the carrier frequency classification of determining, press the switching direction classification, in each class data, thresholding is set, between different statistics classes, threshold value is set;
Step 4: according to switching statistics and dependent threshold, Neighboring Cell List configuration reasonability is implemented judgement, provide the optimization Neighboring Cell List as criterion;
Step 5: by the system operation maintenance centre according to the automatic configuring adjacent cell of Neighboring Cell List after optimizing.
The optimization method of CDMA Neighboring Cell List of the present invention is with respect to the advantage of prior art: because the adjacent area optimization method that the present invention describes is added up based on the switch data between all sub-districts, whole service district, in the optimizing neighbor list of realizing each sub-district, realized the adjacent area interworking between the sub-district.The method that the present invention describes is carried out exhaustive division to switch data, and carries out optimizing neighbor list according to classification back statistics, makes optimizing neighbor list more accurate.
Description of drawings
Fig. 1 is a cdma cellular mobile communcations system structure chart;
Fig. 2 is the flow chart of the method for the invention.
Embodiment
Below in conjunction with accompanying drawing the method for the invention is described further:
As shown in Figure 1: what provide is the cdma cellular wireless telecommunication system that is applied to a plurality of carrier frequency in certain city, a plurality of BSC.
The flow process that corresponding diagram 2 is given: the operation maintenance center in the system classifies to switch data according to carrier frequency, service area, switching direction, neighbor cell configuration state, switching result.Be divided into by carrier frequency: soft handover in the carrier frequency, direct-cut operation between carrier frequency; Press the service area classification: BSC1, BSC2 etc.; Classify by switching direction: come from the switching times statistics of sub-district A, switch to the switching times statistics of A by other sub-districts B to other sub-districts B; Press neighbor cell configuration state classification: allocating cell B in the Neighboring Cell List of sub-district A, switch the adjacent area that switches to of definition A → B, if do not have allocating cell B in the Neighboring Cell List of opposite A sub-district, defines the non-adjacent area switching of switching to of A → B; Press the switching result classification: handover success, handoff failure.
For the multiple switching statistics under carrier frequency, service area and the switching direction determined, with the statistic that has comparative advantage as criterion.Determine the carrier frequency classification, for example: with the soft handover under the carrier frequency; Determine the service area classification, for example: soft handover in the BSC1 service area; Determine the classification of switching direction, to the maximum in the switching times statistics of other sub-districts B, C, D etc. thresholding is set according to sub-district A, threshold value can be according to formula TH FromA=MAX (M A → B, M A → C, M A → D...)/15.75 obtain.According to the maximum in the switching times statistics of sub-district A thresholding being set by other sub-districts B, C, D etc., threshold value can be according to formula TH ToA=MAX (M B → A, Mc → A, M D → A...)/15.75 acquisitions.M wherein A → B, M A → C, M A → D..., M B → A, M B → A, M C → A... waiting all is the data that have overwhelming superiority in all subclasses in the corresponding classification, in other words conj.or perhaps the statistics of the subclass that a switching times statistics in the corresponding classification is maximum.For example in the adjacent area of sub-district A → B switching times statistics, may comprise subclass: handover success number of times sa and handoff failure number of times fa, if the handover success number of times is far longer than handoff failure number of times, M so A → B=max (sa, fa)=sa.In the adjacent area of B → A switching times statistics, obtain M equally B → A=max (sb, fb).Threshold T H FromAAnd TH ToAAlso can wait until that to the mean value of the switch data of other certain sub-district B, C, D etc. and other sub-districts B, C, D the mean value of the switch data of A determines in the A sub-district according to former.
According to former in the A sub-district ratio to the switch data of other certain sub-district B and corresponding other sub-districts B to the switch data of A, difference etc. thresholding N is set between different classes of data.For example: N=2, set up table 1.
The criterion table is optimized in table 1 adjacent area
Figure C03131825D00101
Last table has symmetric relation along the diagonal that 1,3,6,10 list cells constitute, and therefore only the statistics situation of 1~10 list cell is implemented following adjacent area and optimizes criterion:
Unit 1:
if(|sa-sb|<N*min(sa,sb)AND(sa>TH fromA?OR?sb>TH toA))
{ "/" }/* "/normal * of " symbolic representation neighbor cell configuration/
else
The redundant * of { " # " }/* " # " symbolic representation neighbor cell configuration/
Unit 2,3,5,8:
{ "! " }/a * "! " symbolic representation device systems problem */
Unit 4:
if(|sa-sb|<N*min(sa,sb)and(sa>TH fromA?OR?sb>TH toA))
{ "? " }/* "? " symbolic representation neighbor cell configuration need human intervention confirm */
else
{"#"}
Unit 6:
if(|sa-sb|<N*min(sa,sb)AND(sa>TH fromA?OR?sb>TH toA))
{"?"}
else
{"/"}
Unit 7
if(|sb-fa|<N*min(sb,fa)AND(sb>TH toA?OR?fa>TH fromA))
{ " * " }/* " * " symbolic representation neighbor cell configuration do not join or do not have interworking */
if(fa-sb>=N*sb?AND?fa>TH fromA)
if(sb-fa>=N*fa?AND?sb>TH toA)
{"#"}
if(fa<TH fromA?AND?sb<TH toA)
{"#"}
{ " @ " }/* " @ " symbol prompting need confirm network particular surroundings */
Unit 9
if(|fa-sb|<N*min(fa,sb)AND(fa>TH fromA?OR?sb>TH toA))
{"*"}
if(fa-sb>=N*sb?AND?fa>TH fromA)
{ " @ " }/* " @ " symbol prompting need confirm network particular surroundings */
if(sb-fa>=N*fa?AND?sb>TH toA)
{"/"}
if(fa<TH fromA?AND?sb<TH toA)
{"/"}
Unit 10
if(|fa-fb|<N*min(fa,fb)AND(fa>TH fromA?OR?fb>TH toA))
{"*"}
if(|fa-fb|<N*min(fa,fb)AND(fa>TH fromA?OR?fb>TH toA))
{"@"}
if(fa<TH fromA?AND?fb<TH toA)
{"/"}
Every kind of classifiction statistics adopts different thresholdings to carry out adjacent area optimization judgement, may produce the contradiction conclusion near threshold value.In fact, drop on the situation about threshold value, both can adjudicate " left side " also can adjudicate " right side ", not influence of systematic function; Moreover the chance that this contradiction conclusion occurs seldom.The example of the contradiction decision process that may occur the thresholding critical zone is as follows:
With A is under the situation of benchmark:
From the switching statistics that A switches away, obtain TH by all FromABy all switching statistics that switches to A, obtain TH ToAFor A-〉BB-〉situation of A implements the optimizing neighbor list judgement:
A-〉B, adopt TH FromABeing thresholding, B-〉A adopts TH ToABe thresholding, obtain Result1 as a result.
With B is under the situation of benchmark:
From the switching statistics that B switches away, obtain TH by all FromBBy all switching statistics that switches to B, obtain TH ToBFor B-〉AA-〉situation of B implements the optimizing neighbor list judgement:
B-〉A, adopt TH FromBBeing thresholding, A-〉B adopts TH ToBBe thresholding, obtain Result2. as a result
Obtain Result1 (letter is R1 in the table) and Result2 (letter is R2 in the table) like this and may have contradiction.Think that such as Result1 A and B are normal, but Result2 thinks that B and A are redundant.
The contradiction court verdict such as the following table that might produce:
Figure C03131825D00121
Last table has symmetric characteristics equally, only need analyze half table unit.The situation that the cell of all grey is represented is impossible take place.The contradiction court verdict that may occur has only 1,2,3 three table unit.Provide secondary to these three kinds possibility situations and judge, finish abnormality processing.
If(R1="/"AND?R2="#")
{"/"}
If(R1="/"AND?R2="*")
{"/"}
If(R1="?"AND?R2="#")
{"#"}
Optimize decisional table and switch data statistics according to the adjacent area, the Neighboring Cell List after the OMC of operation maintenance center can optimize each sub-district output, and according to the Neighboring Cell List in the automatic regular update database of Neighboring Cell List, finish the automatic adjacent section tabulation and optimize.
More than describe and be one of the present invention and realize example, be not the present invention protect whole, other deformation algorithm, for example: employed constant 15.75 in the change empirical equation, more for example: only utilize threshold T H FromXOr TH ToXAnd distortion, as TH FromX+ TH ToX, as decision threshold or the like all within the algorithm protection range.
Describe according to the present invention, the insider has the ability to realize the automatic adjacent section list configuration and the optimization of cdma cellular mobile communcations system fully.Can save a large amount of Neighboring Cell List maintenance workloads.

Claims (6)

1. an automatic optimization method of realizing the CDMA Neighboring Cell List comprises the steps:
Step 1: according to carrier frequency, service area, switching direction, neighbor cell configuration state, switching result switch data is carried out statistic of classification by operation maintenance center, take place once to switch, press following data structure records data: switch the carrier frequency information that takes place, switch the service area information that takes place, Serving cell and switching target small area sign; The neighbor cell configuration relation of Serving cell and Target cell; Handover success and handoff failure;
Step 2: for the multiple switching statistics under carrier frequency, service area and the switching direction determined, with the statistic that has comparative advantage as criterion, be every kind and switch the maximum statistic of switching times corresponding in the statistics, participate in the judgement of follow-up adjacent area as criterion;
Step 3: in the carrier frequency classification of determining, press the switching direction classification, in each class data, thresholding is set, between different statistics classes, threshold value is set;
Step 4: according to switching statistics and dependent threshold, Neighboring Cell List configuration reasonability is implemented judgement, provide the optimization Neighboring Cell List as criterion;
Step 5: by the system operation maintenance centre according to the automatic configuring adjacent cell of Neighboring Cell List after optimizing.
2. realize the automatic optimization method of CDMA Neighboring Cell List according to claim 1, it is characterized in that: in the described step 1 statistic of classification that switch data carried out is comprised:
Press the carrier frequency classification: soft handover in the carrier frequency, direct-cut operation between carrier frequency;
Press the service area classification: switch the minizone under the same base station controller control, and switch the minizone under the different base station controller control;
Press the switching direction classification: former switching times statistics in sub-district A to other sub-districts B, the switching times that is switched to A by other sub-districts B is added up;
Press neighbor cell configuration state classification: allocating cell B in the Neighboring Cell List of sub-district A, switch the adjacent area that switches to of definition A → B, if do not have allocating cell B in the Neighboring Cell List of opposite A sub-district, defines the non-adjacent area switching of switching to of A → B;
Press the switching result classification: handover success, handoff failure.
3. realize the automatic optimization method of CDMA Neighboring Cell List according to claim 1, it is characterized in that: the statistics in the described step 2 comprises: the adjacent area handover success, the adjacent area handoff failure, non-adjacent area handover success, non-adjacent area handoff failure, what the selection statistics number had comparative advantage from multiple statistics is a kind of, participates in the judgement of follow-up adjacent area.
4. realize the automatic optimization method of CDMA Neighboring Cell List according to claim 1, it is characterized in that: described step 3 further comprises:
Determine that carrier frequency is categorized as with the soft handover under the carrier frequency;
Determine that the service area classification is soft handover in the base station controller service area;
Determine the classification of switching direction, when switching to other sub-districts B, C, D from sub-district A, to the maximum in the switching times statistics of other sub-districts B, C, D thresholding is set according to sub-district A, threshold value can be according to formula TH FromA=MAX (M A → B, M A → C, M A → D)/15.75 obtain, wherein, and M A → B, M A → C, M A → D, be respectively by the statistics of sub-district A to the maximum subclass of a switching times statistics in the corresponding classification of other sub-districts B, C, D; When from other sub-districts B, when C, D switch to sub-district A, according to the maximum in adding up to the switching times of sub-district A by other sub-districts B, C, D thresholding is set, threshold value can be according to formula TH ToA=MAX (M B → A, M C → A, M D → A)/15.75 obtain, M B → A, M B → A, M C → ABe respectively by other sub-districts B, C, D statistics to the maximum subclass of a switching times statistics in the corresponding classification of sub-district A.
5. realize the automatic optimization method of CDMA Neighboring Cell List according to claim 1, it is characterized in that: described step 4, adopt different thresholdings to carry out the adjacent area to every kind of classifiction statistics and optimize judgement, also comprise the processing that the contradiction judgement thresholding critical zone occurred:
With sub-district A is under the situation of benchmark: from the switching statistics that sub-district A switches away, obtain TH by all FromABy all switching statistics that switches to sub-district A, obtain TH ToA. for sub-district A-〉B, sub-district B-〉situation of A implements the optimizing neighbor list judgement:
Sub-district A-〉B, adopt TH FromABeing thresholding, sub-district B-〉A adopts TH ToABe thresholding, obtain court verdict 1;
With sub-district B is under the situation of benchmark: from the switching statistics that sub-district B switches away, obtain TH by all FromBBy all switching statistics that switches to sub-district B, obtain TH ToBFor sub-district B-〉A, sub-district A-〉situation of B implements the optimizing neighbor list judgement:
Sub-district B-〉A, adopt TH FromBBeing thresholding, sub-district A-〉B adopts TH ToBBe thresholding, obtain court verdict 2;
If court verdict 1 is conflicting with court verdict 2, result 1 and result 2 are provided the secondary judgement, finish processing.
6. realize the automatic optimization method of CDMA Neighboring Cell List according to claim 1, it is characterized in that: described step 5, according to optimizing Neighboring Cell List and as the switching statistics of criterion, Neighboring Cell List after operation maintenance center can optimize each sub-district output, and, finish the automatic adjacent section tabulation and optimize according to the Neighboring Cell List in the automatic regular update database of Neighboring Cell List.
CNB031318258A 2003-06-05 2003-06-05 Automatic optimizing method for realizing CDMA neighbouring region listing Expired - Fee Related CN100486380C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB031318258A CN100486380C (en) 2003-06-05 2003-06-05 Automatic optimizing method for realizing CDMA neighbouring region listing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB031318258A CN100486380C (en) 2003-06-05 2003-06-05 Automatic optimizing method for realizing CDMA neighbouring region listing

Publications (2)

Publication Number Publication Date
CN1553609A CN1553609A (en) 2004-12-08
CN100486380C true CN100486380C (en) 2009-05-06

Family

ID=34322964

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB031318258A Expired - Fee Related CN100486380C (en) 2003-06-05 2003-06-05 Automatic optimizing method for realizing CDMA neighbouring region listing

Country Status (1)

Country Link
CN (1) CN100486380C (en)

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1775981B1 (en) * 2005-10-13 2013-07-17 Mitsubishi Electric R&D Centre Europe B.V. Method for determining if a first cell managed by a first base station is neighbour of a second cell managed by a second base station
CN100387089C (en) * 2005-10-28 2008-05-07 华为技术有限公司 Method for regulating high speed down block cut-in network coverage
CN100563396C (en) * 2006-02-13 2009-11-25 华为技术有限公司 A kind of changing method, switching device shifter and portable terminal
CN101052195B (en) * 2006-04-03 2010-05-12 中兴通讯股份有限公司 Adjacent zone configuration and optimizing method
CN1984471B (en) * 2006-04-26 2010-04-21 华为技术有限公司 Method and system for optimizing homogeneous-frequency adjacent-domain configuration
CN100466844C (en) * 2006-07-19 2009-03-04 华为技术有限公司 Detecting method and its system for missing matched adjacent zone
EP1973357B1 (en) * 2007-03-19 2017-11-29 Mitsubishi Electric R&D Centre Europe B.V. Method for updating a monitoring list of information identifying cells transferred by a base station of a wireless telecommunication network in a cell managed by the base station
CN101141777B (en) * 2007-06-26 2010-09-08 中兴通讯股份有限公司 Automatic adjacent section planning method
CN101370262B (en) * 2007-08-15 2012-02-08 中兴通讯股份有限公司 Neighbor section list updating method and system
CN101409920B (en) * 2007-10-10 2012-01-11 上海华为技术有限公司 Method, system and relevant equipment for updating neighboring area list
US8437752B2 (en) 2008-03-31 2013-05-07 Qualcomm Incorporated Method and system for facilitating execution of automatic neighbor relation functions
CN101715217B (en) * 2008-10-06 2011-12-14 中国移动通信集团设计院有限公司 Method and device for configuring neighbor cell
CN101730053B (en) * 2008-10-27 2012-05-23 中兴通讯股份有限公司 Adjacent cell relation configuring method and automatic configuration server
GB2472595B (en) * 2009-08-11 2012-01-11 Ubiquisys Ltd Creating neighbour cell lists
JP5626219B2 (en) * 2009-11-11 2014-11-19 日本電気株式会社 Wireless communication system, autonomous optimization system, wireless base station, and wireless parameter setting method
CN102640532B (en) * 2009-11-19 2015-02-18 日本电气株式会社 Wireless communication system, adjacent-cell list optimizing system, base station and adjacent-cell list updating method
CN102223656B (en) * 2010-04-13 2014-09-10 上海中兴软件有限责任公司 Wireless communication network neighborhood optimizing method and device
CN102572885B (en) * 2010-12-17 2016-01-13 上海贝尔股份有限公司 The method and apparatus of the automatic proximity relations management in minizone is carried out in self-organizing network
CN102547753A (en) * 2010-12-22 2012-07-04 中兴通讯股份有限公司 Neighbor optimization method and device
JP2012253473A (en) * 2011-06-01 2012-12-20 Nec Corp Adjacency information management device, adjacency information management system, adjacency information management method used therefor, and program thereof
CN105578443A (en) * 2014-10-09 2016-05-11 中兴通讯股份有限公司 Neighbor cell maintenance method and neighbor cell maintenance device
CN105744574B (en) * 2014-12-09 2020-11-06 中兴通讯股份有限公司 Neighbor cell optimization method and device
CN107959940B (en) * 2017-11-30 2020-12-25 Oppo广东移动通信有限公司 Detection method and device, storage medium

Also Published As

Publication number Publication date
CN1553609A (en) 2004-12-08

Similar Documents

Publication Publication Date Title
CN100486380C (en) Automatic optimizing method for realizing CDMA neighbouring region listing
US6449481B1 (en) Method for determining execution time of inter-frequency hard handoff and establishing the hard handoff environment
US7065361B1 (en) Method of tuning handoff neighbor lists
US5912884A (en) Overload cell control method in a CDMA mobile system
US6393003B1 (en) Semi-soft handoff method that uses multiple common frequency
CN1348666B (en) Location update method and inter core network entity handover method
US5852778A (en) Method and system for providing communications service to a coverage hole
CN101124845B (en) Control unit and method for controlling load in mobile telecom network
CN102083145A (en) Energy saving method and equipment
WO2006017983A1 (en) A method of load handover of mobile communication system
US5991629A (en) Cellular networks with spare base and satellite stations
CN1147060C (en) Adaptive power margin for hard handoffs in code division multiple access based systems
AU3235599A (en) Soft handoff method in a CDMA cellular mobile communication system
CN100493254C (en) Heterofrequency blind switch-over method in WCDMA system
WO2003021996A1 (en) Paging area optimisation in a cellular communications network
KR100196447B1 (en) Active set maintenance method in cdma system by controlling handoff area
CN100397943C (en) Different frequency switching method in CDMA communication system
KR20050006643A (en) Method for effective serving radio network subsystem relocation in w-cdma system
CHEN et al. Future Vision on Artificial Intelligence Assisted Green Energy Efficiency Network
CN101854681A (en) Method and device for determining number of cells in preparation set
CN102281560B (en) Neighbor optimization method and device for communication system
KR102441024B1 (en) Apparatus and Method for Power Saving of Base Station
CN101998541B (en) Receding method and system of video phone (VP) service in process of switching 3G system to 2G system
Sadhukhan et al. A methodology for WLAN planning under 3G network
CN117837266A (en) System and method for implementing interworking in an ad hoc network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20180703

Address after: California, USA

Patentee after: Global innovation polymerization LLC

Address before: Department of law law ZTE building 518057 Shenzhen City, Nanshan District hi tech Industrial Development Zone

Patentee before: ZTE Corp.

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090506

CF01 Termination of patent right due to non-payment of annual fee