WO2013160708A1 - Identification automatique de voisins dans un réseau wcdma - Google Patents

Identification automatique de voisins dans un réseau wcdma Download PDF

Info

Publication number
WO2013160708A1
WO2013160708A1 PCT/HR2012/000011 HR2012000011W WO2013160708A1 WO 2013160708 A1 WO2013160708 A1 WO 2013160708A1 HR 2012000011 W HR2012000011 W HR 2012000011W WO 2013160708 A1 WO2013160708 A1 WO 2013160708A1
Authority
WO
WIPO (PCT)
Prior art keywords
cell
synchronization
topological
cells
relations
Prior art date
Application number
PCT/HR2012/000011
Other languages
English (en)
Inventor
Smiljan PILIPOVIC
Original Assignee
Ericsson Nikola Tesla D.D.
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 Ericsson Nikola Tesla D.D. filed Critical Ericsson Nikola Tesla D.D.
Priority to PCT/HR2012/000011 priority Critical patent/WO2013160708A1/fr
Publication of WO2013160708A1 publication Critical patent/WO2013160708A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
    • H04W36/0085—Hand-off measurements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
    • H04W36/00835—Determination of neighbour cell lists

Definitions

  • Present invention belongs to the field of communication technique, specifically to selecting arrangements to which subscribers are connected via radio links that enable completing call to or from mobile subscribers, and more specifically to handover arrangements and data processing thereof.
  • WCDMA Wideband Code Division Multiple Access
  • SC scrambling code
  • WCDMA network enables 512 different scrambling codes in the downlink that can be used, and evidently there is a need for the repetition of the same code across the network.
  • the necessity -of scrambling code repetitions across the network has significant impact in network planning, i.e. physical reuse of the same SC should be planned for the places with maximum possible mutual distance. This is extremely challenging. requirement, especially in the dense urban areas, where the cells are. very close to each other.
  • the SC reuse pattern is too tight and the signal originating cell cannot be easily identified solely by SC.
  • the observed problem is prominent during a handover procedure.
  • Any UE constantly measures signals strength received not only from the currently serving cell but also from the neighboring cells, and said UE reports back the signals in a form of Measurement Report (MR) .
  • MR Measurement Report
  • Each MR contains the measured quantities of all present signals and their identities expressed in form of their SC.
  • NCELLs neighbor relations
  • HCell home cell
  • NCell list of neighbor cells
  • RNC Radio Network Controller
  • UE can also measure and report the signals with the SC that do not belong to any of the neighbors listed for the serving cell. Recorded event is classified as a "detected neighbor" and does not result with the handover. Namely, if RNC using the SC cannot identify to which cell the call has to be handed over, the handover is not executed, and that might result in eventual loss of the signal and the dropped calls.
  • the present invention solves mentioned handover problem, i.e. "detected neighbor” and improves mobility despite tight SC reuse pattern via enlargement of identification space from WCD A standard 512 SCs to maximum possible 131072, via further cells discrimination. Discrimination is performed by further characterization of each SC with possible 256 observed different time constants expressed in terms of frames and referenced to one arbitrary cell within network. Such improved cell characterization is used for forming unique synchronization topological object using neighbor cells relations and measurement reports. In addition, said relations being adequately processed by the data-processing system are used for merging, learning and optimization of synchronization topological object handled by the data-processing system.
  • Method (i) optimizing the neighbor list is a challenging task since the length of the neighbor list is limited to 31 neighbors and usually, operator puts extra limitations like mutuality of neighbors, inter-frequency rules etc.
  • the WCDMA networks are dynamic networks as they are constantly built, expanded and the users' behavior change over the course of the year, weeks and even days. In order to achieve good optimal neighbor list and to minimize the detected neighbor events, constant and real time optimization of the neighbor list is required and that is not fully achievable.
  • Method (ii) taking the handover candidates with the same SC within the same RNC has few problems - it may happen that in said RNC is more than one cell with the same SC beside one already being reported. It that case, it is not possible to identify the actual serving cell unambiguously. Additionally, in 20-30% of the cases, the actual serving cell is controlled by another RNC and Iur handover should occur, as known in the art. If method (ii) is used, 20%-30% of handovers will still be missing due to the fact that Iur candidates are not considered. Moreover, if all of the possible handover candidates are used, the downlink resources in the system are wasted as the actual downlink capacity is needed from one or from none of those possible handover candidates.
  • Method (iii) using a geographical data and guessing the candidate based on the location and directiveness of the candidates can be effective, but the source of the data is troublesome.
  • RNC does not contain the accurate geographical locations of transmitters and even rough information about location cannot be transferred over the Iur interface. So, even if the whereabouts of the own controlled cells are known, the lack of the information about the neighboring cells, controlled by neighboring RNCs will introduce the same level of uncertainty as described previously in Method (ii) . Beside the general approaches described above, a lot of efforts have been done to solve observed problems in handover . procedures . These efforts are documented in form of patent and non-patent literature.
  • the international patent application PCT/KR2006/003389 (KIM, Shin- Jae), filed on June 28, 2006 and published as WO 2007/027034 Al teaches about method and apparatus for optimizing neighbor list automatically in asynchronous WCDMA network.
  • the described method includes the steps of: collecting neighbor list data, call fault data, handover statistical data, base station location data and PSC (primary scrambling code) information data of each base station sub- cell (or, sector) in a nationwide network; extracting all target sub-cells (or, sectors) available for handover by analyzing the collected data; endowing a weighting factor to the extracted target sub-cells (or, sectors) according to importance and then sorting calculated results so as to determine priorities; and subsequently inputting the target sub-cell (or, sector) information to the neighbor list according to the priorities; as described in paragraph 18.
  • the cited document describes general state of the art. This method is similar to above mentioned method (i) .
  • Document PCT/US2009/041297 (CATOVIC, A. et all) filed on April 21, 2009 and published as WO 2009/132034 Al teaches about systems and methods that facilitate management of automatic neighbor relation functions in wireless networks.
  • the system can include components and/or devices that ascertain whether or not to add or remove a neighbor relation based on information associated with an operations and management system, wherein the operations and management system dispatches add or remove requests to a base station that establishes, updates, and/or maintains a neighbor relations table and/or set of neighbor relations that includes neighbor relations between cells.
  • the cited document describes general state of the art .
  • EP-A-1722588 Korean patent application published as EP-A-1722588 (KIM, Young-Hun) , assigned to Samsung Electronics Co., Ltd., filed on May 11, 2006 that teaches about hard handover method and Radio Network Controller (RNC) therefore in a mobile telecommunication system.
  • the document discloses information regarding improved performances of an interfrequency hard handover.
  • the RNC stores information about a timing difference between first and second Node Bs for supporting a soft handover.
  • the RNC computes information about a timing difference between the Node Bs for the hard handover using the information about the timing difference between the Node Bs stored at a soft handover time.
  • the essential calculation process performed by the "calculator for computing timing difference" is disclosed in paragraphs 0093 and 0094 of EP-A-1722588.
  • the present invention uses similar calculation process for establishing sub-tree relations to referent cell. Besides the fact that the mentioned prior art in EP-A-1722588 applies on interfrequency, while the present invention applies on intrafrequency handovers, it does not teach about non-trivial features of the present invention that can be summarized below:
  • synchronization tree formation i.e. formation of synchronization topological object or objects from various sub-trees by merging
  • Present invention solves before listed technical problems via method of operating data-processing system for automatic identification of neighbors in WCDMA network, said method comprising steps of: (I) receiving measurement report by a RNC obtained from user equipment serviced by the cell A being characterized by its scrambling code containing reports of some set of cells B j . characterized by their individual scrambling codes;
  • a (Ci->U) (A (Ci) -A (U) ) for each Ci from the set ⁇ A, Bi, B 2 , ... ⁇ , where U is an arbitrary reference cell from the set ⁇ A, ⁇ , B 2 , ... ⁇ , and constructed sub-tree ST j is being defined by the cell set ⁇ A, Bi,..., B n ⁇ j and set of relations A (Ci->U) ;
  • step (IV) merging of any previously formed synchronization topological objects or newly recorded sub-tree STi from step (III) to existed synchronization topological objects; sub-trees, branches, islands or trees; handled by the serving RNC, using data relations obtained from step (III) to form larger synchronization topological objects; wherein said larger synchronization topological objects have each cell listed only once and characterized by used scrambling code and ⁇ relations with the neighboring cells forming said topological object; by maintaining the values of relations ⁇ between the said topological cell neighbors constant; and
  • (V) providing simplification of each synchronization topological object by selecting referent cell U to which each other cells in the synchronization topological object are referenced; and performing summation of all interconnected cell relations A(Ci->C j ) along the connecting path between any desired cell M and the selected referent cell U within the synchronization topological object, using shortest path possible and counting the directions of the inter-relations that influence a +/- sign in the sum; and where A(M->U) is being defined via relation :
  • ⁇ ( ⁇ -> ⁇ ) ((A(M-»Ci) + A(C ! ⁇ C 2 ) + ... + ⁇ (C n -»U) ) mod 256 where said steps (I)-(V) are executed independently or as a part of the decision algorithm stored also in said data-processing system applied to data extracted from measurements report or part of the data from the measurement report taken in step (I) .
  • WCDMA network should be able to perform process of learning, merging and synchronization of topological object hand-in-hand with the identification of missing neighbors. This task is possible to perform via algorithm depicted on Figure 10 and explained in detail in the following text.
  • Figure 2 depicts typical handover position of the UE moving from the serving cell 1 to another cell 2.
  • Figure 3 shows establishing of the cell relation ⁇ ( ⁇ -> ⁇ ) as the difference between beginning of next frame in uplink transmission occurred in time T(UE_Tx) and the downlink signal frames began at times (Rx_SFN_Cell_A) and T (Rx_SFN_Cell_B) .
  • Figure 4 shows the subtree formation by referencing cells B and C to the referent cell A.
  • Figure 5 describes picking the information from various MR reports in time
  • Figure 6 describes the way RNC being part of data- processing means can merge various sub-trees into larger topological object.
  • Figure 7 describes a possible way of referencing each cell within synchronization topological object to only one cell of the same object, i.e. cell A.
  • Figure 8 shows a complex structure obtained from all MR reports received and added to the single synchronization tree in service RNC.
  • Figure 9 shows a closed loop used for fine tuning of some synchronization topological object.
  • Figure 10 represents the algorithm for learning/guessing missing neighbors, merging and further optimization of the synchronization topological objects by each recorded measurement report.
  • Mobility presumes various types of handovers between cells, described and defined in the art (cf. H. Kaaranen, A. Ahtiainen, L. Laitinen, S. Naghian and V. Niemi; "UMTS Networks", 2 nd Edition; 2005, John Wiley & Sons, Ltd.) Standard handover situation is depicted in Figure 2.
  • Mobile UE (3) is moving in direction (4) while connected to RBS A (1) and being within the signal range of RBS B (2) .
  • RBS A (1) is served by the RNC (8) connected to the said RBS A (1) via connection (9) .
  • the UE (3) is permanently measuring downlink signal (6) from the RBS A (1), downlink signal (7) from the RBS B (2), and any other downlink signal that can be detected.
  • the UE (3) reports the signal quality, SC and the frame offset in the form of the MR sent via uplink connection (5) to RBS A (1) ; and RBS A (1) transmits the information via connection (9) to the RNC (8) .
  • WCDMA network has standardized frame structure that is divided into 15 slots, each of length 2/3 ms and, thus, the total frame length is 10 ms . Based on this, one WCDMA frame is able to handle 38400 chips.
  • System chip rate (SCR) is expressed as 3,84 Mchip/s, and chip is a pulse of a direct-sequence spread spectrum (DSSS) code that is well defined in the art.
  • DSSS direct-sequence spread spectrum
  • WCDMA network is based on precise timing and the present invention exploits information which is included in the MR and sent by the UE.
  • T(UE_Tx) Beginning of next frame in uplink transmission occurred in time T(UE_Tx) and the downlink signal frames began at times T (Rx_SFN_Cell_A) and T (Rx_SFN_Cell_B) as shown on Figure 3.
  • Tx and Rx are used in common sense.
  • the MR of signals consist inter alia of particular SCs, signal strength and the time differences observed between SFN (system frame number) and CFN (connection frame number), according to the 3GPP 25.215 specification details.
  • the SFN-CFN observed time difference ⁇ to cell Z, ⁇ ( ⁇ ) expressed in frames, is defined as:
  • Variable OFF is defined as:
  • CFN_Tx is the connection frame number for the UE transmission of an uplink DPCCH frame at the time T(UE_Tx)
  • SFN_Cell_Z is the system frame number for the neighbouring P-CCPCH frame received in the UE at the time T (Rx_SFN_ Rx_SFN_Cell_Z)
  • DPCCH stands for Dedicated Physical Control Channel
  • P-CCPCH for Primary Physical Common Control Channel, both being defined in the art.
  • Information ⁇ ( ⁇ -> ⁇ ) has a value within the range [0,255]. Its value depends on the location of the UE in relation to the transmitters locations, but its integer value should be stabile irrespectively where UE is located.
  • RBSes are synchronized to the network and are also having accurate synchronizing clock. Because of that, the information ⁇ ( ⁇ -> ⁇ ) is usually changed only during the RBS restart, but the present invention provides the methodology how to address the issue of RBS restart. How this information can be helpful in determination of missing neighbor?
  • the whole procedure is possible to carry out in several phases. It is necessary to emphasize that the calculations are to be performed by serving RNC.
  • the mentioned phases are learning, merging and synchronization of formed topological object.
  • STEP I receiving measurement report obtained from user equipment serviced by the cell A being characterized by its scrambling code containing reports of some set of cells Bi characterized by their individual scrambling codes;
  • STEP I I detecting the actual transmitting cells of received signals, based on the reported scrambling codes and querying the available monitored set data for cells with the same scrambling code;
  • STEP III forming a sub-tree ST j where said RNC extracts a corresponding tree relations ⁇ ( ( ⁇ -> ⁇ ) among all sub-tree STj constituents, defined as:
  • A(Ci ⁇ U) (A(Ci)-A(U)) for each Cj from the set ⁇ A, ⁇ , B 2 , ... ⁇ , where U is an arbitrary reference cell from the set ⁇ A, ⁇ , B 2 , ... ⁇ , and constructed sub-tree ST j is being defined by the cell set ⁇ A, Bi,..., B n ⁇ j and set of relations ⁇ (Ci- U) .
  • Mod 256 has been introduced to keep the relation information ⁇ ( ⁇ ) within the prescribed range [0,255], otherwise data are being useless. Mod 256 as used in this specification keeps decimal fractions intact.
  • each cell is characterized by its own scrambling code and reference relation to some referent cell; each cell is being mentioned only once within optimized synchronization topological object.
  • STEP IV merging of any previously formed synchronization topological objects or newly recorded sub-tree STi from STE P III to existing synchronization topological objects; sub-trees, branches, islands or trees; handled by the serving RNC, using data relations obtained from step III to form larger synchronization topological objects; wherein said larger synchronization topological objects have each cell listed only once and characterized by used scrambling code and ⁇ relations with the neighboring cells forming said topological object; by maintaining the values of relations ⁇ between the said topological cell neighbors constant (please compare cell D relations on Figures 5 and 6 ) ; and
  • STEP V providing simplification of each synchronization topological object by selecting referent cell U to which each other cells in the synchronization topological object are referenced; and performing summation of all interconnected cell relations A ( Ci->C j ) along the connecting path between any desired cell M and the selected referent cell U within the synchronization topological object, using shortest path possible and counting the directions of the inter-relations that influence a +/- sign in the sum; and where ⁇ ( ⁇ -> ⁇ ) is being defined via relation:
  • FIG. 8 shows a complex structure obtained from various MR reports received and added to the single synchronization tree in service RNC. All cells should be listed, not only from own RNC but also from neighboring RNCs allowing the relations ⁇ to be uniquely established across the entire WCDMA network. In practice, each RNC will collect information about its own cells and all cells where calls initiated from that RNC may end up.
  • WCDMA network Being dynamical system, WCDMA network should be able to perform process of learning, merging and synchronization of topological object already described hand-in-hand with the identification of missing neighbors. This task is possible to perform via algorithm depicted on Figure 10 divided hereby in four steps, branching at step 2:
  • STEP 1 Let the MR from particular UE to be received by the RNC. Let said MR reports SC Y from some, at the moment unidentified, cell W.
  • RNC is aware of the active communication performed via service Cell A with the SC X, and about the position of cell A within synchronization topological object.
  • RNC is able to extract frame difference relation ⁇ (W- A) , and the unknown cell W has been characterized now by the SC Y and with the relation ⁇ (W- A) .
  • cell W can be also referenced to the root of the synchronization object U by:
  • A(W- U) Round (A(W-»A) + ⁇ (A- U) ) mod 256 STEP 2 : RNC will consult the list of all available cells in the monitored set and check if there is any cell in monitored set with the scrambling code Y, let us say cell B.
  • STEP 3 If cell in STEP 2 exists, the information about the cell and the offset from measurement report will be used in the learning process. Learning process is further divided in two branches by checking the topological position of the cell B (cell ) regarding the cell A;
  • phase drift ⁇ may occur between newly recorded relation ⁇ ( ⁇ -> ⁇ ) and actually obtained relation calculating the closed loop via referent cell U, as shown on Figure 9. Phase drift may occur for various reasons, for instance upon restarting RBS that transmits the cell or similar event that causes that the initial conditions recorded by the RNC were obsolete.
  • cells A and B are not close to the reference cell U and measurement reports - being physical data - may introduce error in frame number counting, or cell being rather unstable in time .
  • phase drift ( ⁇ ( ⁇ ) - ⁇ ( ⁇ -> ⁇ )) - ⁇ ( ⁇ ) were ⁇ ( ⁇ - ⁇ ) and ⁇ (A- U) are information from synchronization topological object and the ⁇ (B->A) is from the measurement report, and update previously recorded values ⁇ ( ⁇ -> ⁇ ), ⁇ ( ⁇ -> ⁇ ) ⁇ with the new values ⁇ ( ⁇ -» ⁇ )', ⁇ (A->U) ' ⁇ defined as:
  • ⁇ ( ⁇ - ⁇ )' ( ⁇ ( ⁇ ) + ⁇ - ⁇ /2) mod 256 where ⁇ is the tuning speed factor having values within the range [0.0 - 1.0] .
  • exemplary embodiments of the present invention improve the performance of a handover and increase a handover success probability.
  • exemplary embodiments of the present invention improve the performance of cell recognition not only via SC but also via synchronization topological object based on the introduced ⁇ relations that enlarge the characterization space within WCDMA network .
  • NCell - neighbouring cell second member of the pair NCELL

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention se rapporte à un procédé pour l'identification automatique de voisins dans un réseau WCDMA. Le procédé selon l'invention est caractérisé en outre par le fait qu'une discrimination de cellules est caractérisée au moyen d'un code de brouillage. Le procédé selon l'invention exécute un calcul des différences de temps SFN-CFN de chacune des cellules qui sont répertoriées dans un rapport de mesure, de sorte à former des relations par rapport à certaines cellules de référence à l'intérieur de l'objet de synchronisation topologique. Le procédé selon l'invention consiste par ailleurs : à former un élément d'un sous-arbre de synchronisation de base; et à fusionner, à optimiser, et à adapter avec précision les objets de synchronisation topologiques. Pour cela, on augmente le volume de données qui sont enregistrées et traitées par le système de gestion de données. La présente invention permet ainsi d'améliorer la recherche de voisins manquants, au cours d'une procédure de transfert intercellulaire. L'invention permet également d'améliorer la réussite d'un transfert intercellulaire dans la zone où un motif de réutilisation d'un code de brouillage est trop étroit et où la cellule à l'origine du signal ne peut pas être aisément identifiée uniquement par les codes de brouillage.
PCT/HR2012/000011 2012-04-23 2012-04-23 Identification automatique de voisins dans un réseau wcdma WO2013160708A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/HR2012/000011 WO2013160708A1 (fr) 2012-04-23 2012-04-23 Identification automatique de voisins dans un réseau wcdma

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/HR2012/000011 WO2013160708A1 (fr) 2012-04-23 2012-04-23 Identification automatique de voisins dans un réseau wcdma

Publications (1)

Publication Number Publication Date
WO2013160708A1 true WO2013160708A1 (fr) 2013-10-31

Family

ID=46514703

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/HR2012/000011 WO2013160708A1 (fr) 2012-04-23 2012-04-23 Identification automatique de voisins dans un réseau wcdma

Country Status (1)

Country Link
WO (1) WO2013160708A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015109314A1 (fr) * 2014-01-20 2015-07-23 Eden Rock Communications, Llc Gestion de liste de voisins automatisée dynamique dans un réseau d'auto-optimisation
WO2015108571A1 (fr) * 2014-01-20 2015-07-23 Eden Rock Communications, Llc Résolution des ambiguïtés d'un code d'identification dans des réseaux d'accès sans fil

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20060003389A (ko) 2004-07-06 2006-01-11 (주)한국해외기술공사 체결봉이 매설된 피 에스 씨 빔의 제작방법
EP1722588A1 (fr) 2005-05-11 2006-11-15 Samsung Electronics Co., Ltd. Procédé de transfert avec coupure et un controleur de réseau radio associé dans un système de télécommunications mobiles
WO2007027034A1 (fr) 2005-08-29 2007-03-08 Ktfreetel Co., Ltd. Procede et appareil pour optimiser automatiquement la liste de voisinage dans un reseau amrc a bande large asynchrone
WO2009132034A1 (fr) 2008-04-21 2009-10-29 Qualcomm Incorporated Procédé et appareil de gestion d'une fonction de relation de voisinage automatique dans des réseaux sans fil
US20110312339A1 (en) * 2009-03-09 2011-12-22 Telefonaktiebolaget L M Ericsson (Publ) Methods and Arrangements in a Wireless Communication System

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20060003389A (ko) 2004-07-06 2006-01-11 (주)한국해외기술공사 체결봉이 매설된 피 에스 씨 빔의 제작방법
EP1722588A1 (fr) 2005-05-11 2006-11-15 Samsung Electronics Co., Ltd. Procédé de transfert avec coupure et un controleur de réseau radio associé dans un système de télécommunications mobiles
WO2007027034A1 (fr) 2005-08-29 2007-03-08 Ktfreetel Co., Ltd. Procede et appareil pour optimiser automatiquement la liste de voisinage dans un reseau amrc a bande large asynchrone
WO2009132034A1 (fr) 2008-04-21 2009-10-29 Qualcomm Incorporated Procédé et appareil de gestion d'une fonction de relation de voisinage automatique dans des réseaux sans fil
US20110312339A1 (en) * 2009-03-09 2011-12-22 Telefonaktiebolaget L M Ericsson (Publ) Methods and Arrangements in a Wireless Communication System

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
H. KAARANEN; A. AHTIAINEN; L. LAITINEN; S. NAGHIAN; V. NIEMI: "UMTS Networks, 2" Edition;", 2005, JOHN WILEY & SONS, LTD
H. KAARANEN; A. AHTIAINEN; L. LAITINEN; S. NAGHIAN; V. NIEMI: "UMTS Networks, 2" Edition;", 2005, JOHN WILEY & SONS, LTD.
QUALCOMM INCORPORATED [RAPPORTEUR]: "Report for [e-mail #03]: TP for Rel-11 Macro to HNB hand-in for Legacy UEs", 3GPP DRAFT; R3-112886_E-MAIL 03_TP_REL-11_MACRO2HNB_LEGACYUES.DOC, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG3, no. San Francisco, USA; 20111114 - 20111118, 5 November 2011 (2011-11-05), XP050566224 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015109314A1 (fr) * 2014-01-20 2015-07-23 Eden Rock Communications, Llc Gestion de liste de voisins automatisée dynamique dans un réseau d'auto-optimisation
WO2015108571A1 (fr) * 2014-01-20 2015-07-23 Eden Rock Communications, Llc Résolution des ambiguïtés d'un code d'identification dans des réseaux d'accès sans fil
US9319979B2 (en) 2014-01-20 2016-04-19 Nokia Solutions And Networks Oy Resolving identification code ambiguities in wireless access networks
CN106465156A (zh) * 2014-01-20 2017-02-22 诺基亚通信公司 自优化网络中的动态自动邻居列表管理
US9591535B2 (en) 2014-01-20 2017-03-07 Nokia Solutions And Networks Oy Dynamic automated neighbor list management in self-optimizing network
US9699717B2 (en) 2014-01-20 2017-07-04 Nokia Solutions And Networks Oy Resolving identification code ambiguities in wireless access networks

Similar Documents

Publication Publication Date Title
EP3269171B1 (fr) Améliorer la performance globale d'un réseau et/ou la qualité globale de service d'un réseau de communication mobile en attribuant des informations d'identifiant de cellule physique à une pluralité de cellules radio
EP0895435B1 (fr) Analyse des cellules avoisinantes dans un système de télécommunication cellulaire
EP1929668B1 (fr) Procede et appareil pour optimiser automatiquement la liste de voisinage dans un reseau amrc a bande large asynchrone
EP1493293B1 (fr) Procede et systeme pour optimiser des listes de cellules voisines
JP4790017B2 (ja) 同期式ｃｄｍａ網における隣接リストの自動最適化方法及び装置
EP1915880B1 (fr) Procédé d'attribution de codes de brouillage à des cellules d'un réseau de communication mobile cellulaire CDMA
EP0982962B1 (fr) Methode et appareil pour déterminer si une station sans fils est active dans une region géographique préscrité
CN103945469B (zh) 一种确定目标小区的方法及设备
EP2533571A1 (fr) Contrôle de transfert
EP2533569B1 (fr) Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil
CN104205964A (zh) 移动地理定位
KR20020026423A (ko) 반경이 크게 차이나는 셀들 사이에서 소프트 핸드오프를실행하기 위한 방법 및 장치
US8351943B2 (en) Method and apparatus for handoff in a wireless network
US20040203882A1 (en) Location services
EP2943009B1 (fr) Dispositif côté réseau et procédé de commutation de macro-station de base à micro-station de base
WO2013160708A1 (fr) Identification automatique de voisins dans un réseau wcdma
CN101959169A (zh) 一种相邻小区的优化方法及装置
CN104488317B (zh) 扰码解析
EP3598789A1 (fr) Procédé et dispositif de détermination optimisée pour une confusion d'identité pci
EP2749101B1 (fr) Première rnc, seconde rnc, station de base, n ud oam et procédés s'y rapportant pour gérer une réutilisation d'un code de brouillage dans un réseau cellulaire
KR20050034822A (ko) Ｗｃｄｍａ 망에서 무선 환경 분석 시스템 및 방법
US9699717B2 (en) Resolving identification code ambiguities in wireless access networks
KR100653529B1 (ko) 비동기식 ｗｃｄｍａ망에서의 네이버 리스트 자동 최적화방법 및 장치
WO2014175794A1 (fr) Procédés et appareil pour la détermination d'une cellule voisine à partir de mesures d'ue
CN102711168A (zh) 移动终端、网络实体及其相关方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12735618

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12735618

Country of ref document: EP

Kind code of ref document: A1