EP2533569B1 - Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil - Google Patents

Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil Download PDF

Info

Publication number
EP2533569B1
EP2533569B1 EP12171221.0A EP12171221A EP2533569B1 EP 2533569 B1 EP2533569 B1 EP 2533569B1 EP 12171221 A EP12171221 A EP 12171221A EP 2533569 B1 EP2533569 B1 EP 2533569B1
Authority
EP
European Patent Office
Prior art keywords
sector
candidate
pilot
neighbor
sectors
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP12171221.0A
Other languages
German (de)
English (en)
Other versions
EP2533569A1 (fr
Inventor
Vladan Jovanovic
David William Kleinbeck
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.)
Newfield Wireless Inc
Original Assignee
Newfield Wireless Inc
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 Newfield Wireless Inc filed Critical Newfield Wireless Inc
Publication of EP2533569A1 publication Critical patent/EP2533569A1/fr
Application granted granted Critical
Publication of EP2533569B1 publication Critical patent/EP2533569B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
    • H04W36/00835—Determination of neighbour cell lists
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H04W64/003—Locating users or terminals or network equipment for network management purposes, e.g. mobility management locating network equipment

Definitions

  • the invention relates generally to wireless networks, and more particularly to a method for identifying missing neighbors and for updating current neighbors in wireless networks.
  • UK Patent Publication No GB 2 331 892 describes a method of altering a neighbour cell list in a cellular communications system.
  • Each cell of a cellular communication system has a neighbour list containing the identities of neighbouring cells suitable for handover.
  • Mobile stations in a serving cell scan to detect the identities and signal strengths of other cells and report the results to the serving cell base station.
  • Other cells which are detected but are not on the neighbour list are added to the list while any cells which are on the list but not detected are deleted from the list.
  • a method for identifying a missing neighbor in a wireless network includes receiving a report about two or more pilot signals measured by a mobile station; determining that one or more of the reported pilot signals is a missing neighbor not comprised in a current neighbor list of the mobile station; choosing one or more candidate sectors having a pilot signal with the same pilot identity as the missing neighbor; and selecting a most likely sector as the missing neighbor from the one or more candidate sectors, based on calculated distances between the mobile station and a source sector, between the mobile station and at least one of the one or more candidate sectors, and between the source sector and at least one of the one or more candidate sectors, so as to identify the missing neighbor in the wireless network.
  • a method for updating a current neighbor in a wireless network includes receiving a report about two or more pilot signals measured by a mobile station; choosing one or more candidate sectors having a pilot signal with the same pilot identity as a current neighbor comprised in a current neighbor list; and for the current neighbor, selecting a most likely sector from the one or more candidate sectors, based on calculated distances between the mobile station and a source sector, between the mobile station and one or more candidate sectors, and between the source sector and at least one of the one or more candidate sectors, so that the current neighbor that was previously misidentified can be detected and updated.
  • Figure 1 is a drawing of a conceptual representation of a prior art wireless network.
  • Figure 2 is a drawing of possible embodiments of a method for identifying a missing neighbor in a wireless network.
  • Figure 3 is a drawing showing an example of embodiments of a method for identifying a missing neighbor in a wireless network.
  • Figure 4 is a table that shows an example of a neighbor list generated by a method for identifying a missing neighbor in a Code Division Multiple Access (CDMA) wireless network.
  • CDMA Code Division Multiple Access
  • Figure 5 is a flowchart showing the steps in a method for identifying a missing neighbor in a wireless network.
  • Figure 6 is a flowchart showing the steps in a method for updating a current neighbor in a wireless network.
  • Figure 7 is a flowchart showing the steps in a method for identifying a missing neighbor in a CDMA wireless network using a distance-based condition.
  • Figure 8 is a flowchart showing the steps in a method for identifying a missing neighbor in a CDMA wireless network using a power-based condition in a case where more than one candidate satisfies the distance-based condition.
  • Figure 9 is a table that shows a portion of a wireless network cell and sector database generated by a method for identifying a missing neighbor in a CDMA wireless network.
  • Figure 10 is a table that shows an example of a calculation of a missing neighbor candidate in a method for identifying a missing neighbor in a wireless network.
  • Figure 11 is a drawing schematically illustrating a method for identifying a missing neighbor in a wireless network when the missing neighbor does not belong to the nearest candidate sector.
  • Figure 12 is a drawing schematically illustrating a method for identifying a missing neighbor in a wireless network using a power-based condition in a case in which the distance-based condition gives more than one valid candidate.
  • Figure 13 is a table showing a portion of an extended wireless network cell and sector database that can be used in the received power calculations in a method for identifying a missing neighbor in a wireless network.
  • FIG. 1 is a drawing of a conceptual representation of a prior art wireless network.
  • a wireless network (WN) 100 may comprise multiple base stations (BSs) 125, 130, multiple mobile stations (MS) 140, and a Network Controller (NC) 150.
  • the MS 140 may connect wirelessly to one or more of the BSs 125, 130 via a radio frequency (RF) channel 160, which may allow for bidirectional transmission of voice or data between the MS 140 and the BSs 125, 130.
  • RF radio frequency
  • Information from the BSs 125, 130 may then be routed to the NC 150 over fixed backhaul links 170, 180.
  • NC 150 may provide further connectivity to the classical (non-wireless) telephony and data networks 190.
  • a BS 125, 130 comprised in the WN 100 may serve a certain geographic area, with a typical coverage distance of the order of a mile.
  • a WN 100 covering an area of a larger city may comprise thousands of BSs 125, 130.
  • Handoff (HO) is a procedure that enables the MS 140 to keep continuous voice or data transmission when moving out of the coverage area of one BS 125, 130 and into the coverage area of another BS 125, 130.
  • BS-specific signals known as pilot signals or reference signals
  • a typical WN 100 may have up to a few hundred distinct reference signals, depending on the specific technology and application.
  • the MS 140 searches for the pilot signals coming from the surrounding BSs 125, 130. After detecting the pilot signals, the MS 140 measures their characteristics (for example, power, signal-to-noise ratio, distance, and the like) and reports the measurement results back to the WN 100 via special MAHO measurement messages.
  • characteristics for example, power, signal-to-noise ratio, distance, and the like
  • an entity within the NC 150 may decide at some point that a new BS 125 (“Target”) is likely to provide better service than the current BS 130 ("Source” BS), and may initiate an HO execution to switch to the Target BS 125.
  • This HO process normally starts with the NC 150 informing both BSs 125, 130 about the HO decision, via special messages over backhaul links 170, 180.
  • the source BS 130 then sends to the MS 140 all the information required for setting up a new RF channel 160 on a Target BS 125, and the Target BS 125 establishes a new RF channel 160 for the MS 140.
  • the MS 140 then switches to the new RF channel 160 at the Target BS 125.
  • the Target BS 125 detects the transmissions of the MS 140 on the new RF channel 160, it informs the NC 150 about the successful HO, after which the old RF channel 160 at the Source BS 130 may be released.
  • a Neighbor List (NL, not shown), which is sent to the MS 140 by the use of special messaging over the RF channels 160.
  • An NL specific to the Source BS 130 itemizes the identifying characteristics of the pilot signals from all BSs that are likely HO candidates within its coverage area.
  • a typical NL contains up to a few tens of potential HO candidates, some adjacent to the Source BS 130 but many that are not adjacent to the Source BS 130.
  • due to RF propagation peculiarities quite distant BSs can be valid HO candidates.
  • the MS 140 has a diminished chance or no chance to detect the omitted HO candidate BS 130as an HO candidate. Further, even when the MS 140 can detect and subsequently report the reference signal of the candidate BS 125 that is not included in the NL, in operational networks, the NC 150 cannot guess to which physical BS the omitted reference signal actually belongs, because a few dozen different BS's often share that same reference signal. The reason for this is that in most WNs 100, the number of BSs served by one NC is normally much larger than the number of available cell-specific reference signals.
  • a target BS 125 may have been incorrectly identified in the past.
  • a mobile telephone may report a pilot as being at a distance of five miles, while the NL wrongly defined the pilot as belonging to a sector that has the same pilot and is located for example, twenty miles away from the mobile telephone or two miles away from the mobile telephone.
  • Misassigned pilots are very dangerous for network performance because they can create excessive interference, which can cause call failure such as call drops and failed call attempts.
  • Misassigned pilots also reduce the capacity of the WN 100 because call resources are allocated to sectors where they are not needed, and because extra power may be used in sectors different from the sector that actually comprises the real neighbor.
  • an MS 140 may report two or more BS's 125, 130 with the same pilot signal causing ambiguities in the identification of target BS 125.
  • Such problems arise due to suboptimum network planning and are often called pilot reuse problems.
  • Pilot reuse problems should be rare in well-designed WN's 300. In practice, Pilot reuse problems do occur quite frequently, most often due to simple engineering oversights, but sometimes also due to problems with running automated pilot planning tools comprised within RF prediction tools.
  • pilot misassignment should be rare in well-designed WN's 100, but in practice, pilot misassignment does occur quite frequently. Some pilot misassignments occur due to poor maintenance of neighbor lists, which may become particularly evident upon a change in network configuration, typically when new sites are added to the WN 100. Pilot misassignments also occur due to problems with running automated Neighbor List tools. Often such automated NL tools do not use distance criteria or power criteria to qualify and identify missing neighbors. Alternatively, automated Neighbor List tools may automatically assign a detected missing neighbor to the nearest sector with the reported pilot. This becomes particularly problematic when network sector databases are incomplete or inaccurate, a frequent occurrence. Except in a few blatant cases, misassigned pilots are also notoriously difficult to detect in live WNs 100.
  • any of these inaccuracies can cause serious problems with the performance and with the capacity of the WN 100.
  • data rate networks such as 1xEV-DO
  • data rate losses may occur as misassigned sectors cause extra interference.
  • Reductions in capacity may occur as more resources are required because of the lower data rates, resulting in wasted resources. If the misassigned sector becomes the dominant sector, the result can be extra dropped connections. A low rate of handoff completions may also result.
  • these inaccuracies are often difficult to recognize using currently available techniques.
  • Identification of the most likely candidate for a missing neighbor or for a misassigned neighbor would in general involve a maximization of the Maximum Likelihood (ML) or the sub-optimal Minimum Mean Square Error (MMSE) functions over the geographical area to find the most probable solution for each candidate, and then selecting the candidate giving one or more of the largest probability value and the smallest error value.
  • ML Maximum Likelihood
  • MMSE sub-optimal Minimum Mean Square Error
  • the missing neighbor identification and neighbor list verification and updating problems as described above may in practice be resolved by using one or more of the distance and power measurements from a mobile station (MS) that reported a missing handoff (HO) candidate to the various base stations (BSs) in the network, and the calculated distances between various BSs in the wireless network.
  • MS mobile station
  • HO missing handoff
  • BSs base stations
  • Embodiments of the invention are capable of attributing the missing pilot signal to the correct Target BS even when it is not the candidate nearest to the Source BS. Field data suggests that the number of such cases is significant, providing an improvement over prior art.
  • the most likely BS to which the missing neighbor belongs can be determined using the RF propagation conditions as the second step.
  • the power of the signals received from a potential candidate can be estimated based on the BS transmit power, the BS antenna type, the BS height, BS azimuth angle, BS tilt angle, BS terrain elevation, BS clutter characteristics, and the like.
  • candidate power estimates may be compared to the actual reported power measurements to determine the most likely BS.
  • candidate power estimates may be compared to the Source signal estimates to determine the most likely BS.
  • candidate power estimates may be compared between the candidates to determine the most likely BS.
  • a Network Controller may identify the Target BS candidate while the call is in progress, enabling the NC to improve or save the call while in progress, and also enabling the NC to provide updates to a Neighbor List (NL) so the NL may improve or save future calls in the same area that may experience a missing pilot signal.
  • NL Neighbor List
  • Figure 2 is a drawing of possible embodiments of a method for identifying a missing neighbor in a wireless network 200.
  • the method 200 can be used to verify and update neighbor lists in a WN 200 so that such problems can be avoided for future calls in the same geographic area that experience similar RF conditions.
  • the method can be implemented by the Network Controller (NC) 201, so that no external sources of information may be required.
  • the NC 201 can implement the method for "live" determination of the origin of a pilot signal that is missing from the Neighbor List (NL) 202.
  • NL Neighbor List
  • Such a method reduces the probability of dropped calls and interference with calls already in progress.
  • the method can reduce the probability of dropped calls and interference on future calls.
  • the method can also be implemented using a separate entity not resident in the NC 201, an optional Adjunct Processor (AP) 203, in which case the results are not used for calls in progress, but are used to adjust the NLs 202 so that they can be downloaded into the NC 201 at a later time to avoid problems with future calls.
  • AP Adjunct Processor
  • the AP 203 can use Network Controller logs 204, which provide detailed information about calls.
  • the Network Controller logs 204 comprise information about HO messages that can be used to determine the origin of the missing pilot signal.
  • Network Controller logs 204 may be referred to as "Call Detailed Logs”, “Call Detailed Records”, “Per Call Measurement Data”, and so on.
  • the messages used for missing neighbor identification can be captured by optional Network Probes 206, which decode the relevant messages by passively monitoring or "sniffing" backhaul links 207A, 207B.
  • the Network Probes 206 capture the information by passively monitoring standardized interfaces 208 between various entities within the NC 201 itself.
  • the NC 201 may comprise one or more of a mobility manager, a gateway, a radio network, a base station controller, an operations support system, and the like.
  • the resulting Network Probe Logs 209 are then fed into the AP 203 for further processing.
  • Mobile Probe logs 210 comprise Mobile Probe logs 210.
  • One or more MS units 211 and a Probe Controller 212 are comprised within a Mobile Probe 214, whose presence in the network 200 is itself optional.
  • a Global Positioning System (GPS) receiver 213 may optionally be comprised within the Mobile Probe 214.
  • Mobile Probes 214 are also variously known as Field Diagnostic Monitors and as Autonomous Wireless Probes.
  • the one or more MS units 211 operate in a special mode in which they send the messages detected over the wireless link via a dedicated interface to the Probe Controller 212.
  • the optional GPS receiver 213 facilitates the recording of the locations of the Mobile Probe 214 when messages arrive.
  • the AP 203 might also use an optional Extended Sector Database 215.
  • the Extended Sector Database 215 may contain additional information about sectors beyond the minimum set required for operation of the WN 200 and stored within the NC 201. Additional information could include the antenna types, their heights and pointing angles, geographic locations, and the like. The AP 203 can use any of these information elements in its processing.
  • a combination of one or more of the inputs 204, 209 or 210 that is, a combination of one or more of the Network Controller Logs 204, the Network Probe Logs 209, and the Mobile Probe Logs 210 can be used with the disclosed method for identifying a missing neighbor in wireless networks.
  • Embodiments of the invention may use a Code Division Multiple Access (CDMA)-based WN 200 as described for instance by IS-95, IS-2000 (3G-1X) and IS-856 (1xEV-DO) WN 200 standards.
  • Embodiments of the invention may be adapted to other WN 200 standards that employ mobile HO measurements, and can report the observed time differences of arrival (OTDOA) of the pilot signals.
  • OTDOA measurements can be reported either for HO operation itself (in WCDMA or UMTS standards and its derivatives), when the OTDOA measurements are provided as an option for support of the geographic location of emergency calls (in GSM, WiMAX and Long Term Evolution [LTE]), or when the OTDOA measurements are provided as an option for support of location-based services.
  • Figure 3 is a drawing showing an example of embodiments of a method 300 for identifying a missing neighbor in a wireless network 300 in a case in which a BS is split in three sectors per cell tower.
  • the sectors cover an area within approximately a 120° angle.
  • cell 1 is split into sectors 1, 2, and 3 with respective PN (pseudonoise) Offsets 3, 203, and 103.
  • PN pseudonoise
  • the operation of the invention is not affected by the number of sectors deployed in any of the cells.
  • one MS 211 may have RF channels 160 active on more than one source sector. In CDMA systems, such a situation is known as a soft handoff (SHO).
  • SHO soft handoff
  • Individual pilot signals may be distinguished using their PN Offsets. Networks normally use a subset of all available PN Offsets, usually selecting successive values in increments of 3, 4 or 6. For example, if the value of the PN Offset increment, known as the Pilot_Increment, is 4, then the available PN Offsets are 0, 4, 8, 12, ..., 508, for a total of 128 unique PN Offsets.
  • FIG. 3 An example of possible assignment of PN Offsets in a WN 300 is also depicted in Figure 3 .
  • a CDMA mobile station comprises a special searcher device that checks for the appearance of any new sufficiently strong pilot signals or a reduction in strength of previously detected pilot signals.
  • the MS 211 informs an entity in the NC 201 that is responsible for the mobility management via a Pilot Strength Measurement Message (PSMM) in IS-95/IS2000, or a Route Update Message (RUM) pursuant to the IS-856 suite of standards.
  • PSMM Pilot Strength Measurement Message
  • ROM Route Update Message
  • the NC 201 Upon receiving a PSMM or RUM adding a new pilot signal, the NC 201 allocates the traffic channel at the appropriate Target sector, thus enabling the communication with the sector to which the newly detected pilot signal belongs. Upon receiving a PSMM or RUM removing a pilot signal, the NC 201 disables the traffic channels at the appropriate Target sector.
  • a special "keep" indicator in the PSMM or the RUM specifies which of these two actions the MS 211 suggests to the NC 201.
  • Figure 4 is a table that shows an example 400 of an existing neighbor list 202 for sector 1 of cell 1.
  • Neighbor lists 202 for an individual sector in a CDMA system are stored by the system.
  • the stored neighbor lists 202 list the pilots to be searched by the associated PN Offsets.
  • MS 211 units list one pilot in terms of the PN Offset. This pilot is the Reference pilot, which is used by the MS 211 as its internal timing reference.
  • the other detected pilots are listed in terms of their Pilot_PN_Phase.
  • the NC 201 determines the PN Offsets using equation (1).
  • the NC 201 looks up the Source sector in the NL 202. A sample NL is depicted in Figure 4 . Via the lookup, the NC 201 determines to which cell and sector the PN Offset belongs, thereby enabling the addition or release of the corresponding traffic channel.
  • Figure 5 is a flowchart showing the steps in a method 500 for identifying a missing neighbor in a wireless network.
  • step 510 a report is received about two or more pilot signals measured by a mobile station.
  • step 520 it is determined that one or more of the reported pilot signals is a missing neighbor not comprised in a current neighbor list of the mobile station.
  • step 530 one or more candidate sectors having a pilot signal with the same pilot identity as the missing neighbor are chosen.
  • a most likely sector is selected as the missing neighbor from the one or more candidate sectors, based on calculated distances between the mobile station and a source sector, between the mobile station and at least one of the one or more candidate sectors, and between the source sector and at least one of the one or more candidate sectors, so as to identify the missing neighbor in the wireless network.
  • This step can further comprise selecting as a most likely sector a candidate sector for which a triangle inequality is satisfied to within a predetermined tolerance level, in order to accommodate random measurement errors.
  • This step can further comprise selecting as a most likely sector a candidate sector for which a triangle inequality is approximately satisfied by the distance between the mobile station and a source sector, the distance between the mobile station and the candidate sector, and the distance between the source sector and the candidate sector.
  • Certain embodiments may include an additional step of estimating power levels received at an estimated mobile station location from the missing neighbor and from the one or more candidate sectors.
  • Further embodiments may include an additional step of using the candidate sector power levels and the missing neighbor power levels to select a most likely sector.
  • Other embodiments may include an additional step of estimating a power level received from the source sector at the estimated mobile station location.
  • Still other embodiments may include an additional step of calculating the relationships between the candidate sector power levels relative to the source sector power level.
  • Certain embodiments may include an additional step of estimating the power level from the source sector and comparing relative values of the source vs. candidates power estimates with the relative source vs. missing neighbor power levels as reported by the mobile station.
  • Certain embodiments may include an additional step of transferring, by the adjunct processor, an updated neighbor list to the network controller.
  • Figure 6 is a flowchart showing the steps in a method 600 for updating a current neighbor in a wireless network.
  • step 610 a report is received about two or more pilot signals measured by a mobile station.
  • step 620 one or more candidate sectors are chosen having a pilot signal with the same pilot identity as a current neighbor comprised in a current neighbor list.
  • a most likely sector is selected from the one or more candidate sectors, based on calculated distances between the mobile station and a source sector, and between the mobile station and at least one of the one or more candidate sectors, so that the current neighbor that was previously misidentified can be detected and updated.
  • This step can comprise determining that two or more candidate sectors qualify as most likely sectors.
  • This step can further comprise determining the presence of a pilot reuse problem.
  • This step can further comprise transmitting an appropriate notification that two or more candidate sectors qualify as most likely sectors.
  • This step can further comprise transmitting an appropriate notification of a pilot reuse problem.
  • Figure 7 is a flowchart showing the steps in a method 700 for identifying a missing neighbor in a Code Division Multiple Access (CDMA) wireless network using a distance-based condition.
  • CDMA Code Division Multiple Access
  • one of the NC 201 and the AP 203 detects that the received PSMM or RUM message contains a missing pilot.
  • This step comprises calculating the PN Offset using equation (1) and the reported Pilot_PN_Phase.
  • This step preferably comprises comparing the reported PN Offset with the PN Offsets listed in the Source sector NL 202. In embodiments in which the method is implemented in the NC 201, this step is performed anyway. In embodiments in which the method is implemented in the Adjunct Processor, the Adjunct Processor can carry out this step since the messages containing the NL 202 are sent after a successful HO.
  • the RF path distance difference seen by the MS 211 between a non-reference sector and the reference sector can be calculated by multiplying the OTDOA values by the speed of electromagnetic radiation.
  • the calculated RF path distances can be slightly larger than the actual distances traversed, due to multipath propagation resulting from refractions and reflections of the RF waves; , but in practice, they tend to be quite close.
  • the strengths of the detected pilots are reported as a ratio of the measured pilot power to the total received power, analogous to the ratio Ec/lo of signal to signal-plus-interference-plus-noise.
  • At least one of the Source sectors involved in the SHO measures and reports back to the NC 201 the Round Trip Time (RTT).
  • RTT refers to the time difference between a signal's direct transmission time and the transmission time of the signals received from the MS 211 on the return RF link.
  • the RF path distance between the Source sector and the MS 211 reporting the pilots can then be calculated by multiplying one-half of the RTT time by the speed of electromagnetic radiation, giving a result that will again be very close to the actual on-the-ground distance.
  • the NC 201 or the AP 203 can determine the distances Dist Sector-MS between the MS 211 and any Source sector or Candidate sector.
  • step 730 the NC 201 or AP 203 searches the list of all sectors in the WN 300 and forms a new List of Candidate sectors that have the same PN Offset as the value calculated for the missing neighbor.
  • the network database comprises cell and sector identification numbers, the associated PN Offsets, and the associated geographic coordinates. All this information is already present in databases in any NC 201 utilizing CDMA technology under the IS-95, IS-2000 or IS-856 suite of standards, sector latitude and longitude being used for distance-based registration procedures.
  • the information is available to the AP 203 via an interface to the NC 201, or from an external source (for example, extended sector database 215 in Figure 2 ) if a direct interface is not supported.
  • step 740 using formulas from the field of geometric geodesy, the NC 201 or AP 203 calculates the distances Dist Source-Candidate between the Source Sector and a sector from the List of Candidates created in step 730.
  • step 750 at least one sector from the List of Candidate sectors is tested using the following equation to verify if the following distance condition is met: Dist Source - MS - Dist Candidate - MS 2 ⁇ Distance Source - Candidate 2 ⁇ ⁇ Dist Source - MS + Dist Candidate - MS 2
  • Condition (4) is one form of the triangle inequalities from elementary plane geometry, stating that one side of a triangle is shorter in length than the sum of the lengths of the other two sides, and that one side of a triangle is longer in length than the difference of the lengths of the other two sides.
  • Condition (4) ensures the intersection of the circles centered on the Source and candidate sector and having radii corresponding to the calculated distances between these two sectors and the MS 211.
  • the MS 211 will be located at one of the up to two possible intersection points.
  • inaccuracies can occur due to finite quantization of Pilot_PN_Phase and of RTT measurements, possible multipath conditions, stochastic errors due to noise and interferences, and the like.
  • distance Source-Candidate inaccuracies can be attributed to rounding errors and to errors in population of the geographical coordinates.
  • condition (4) Dist Source - MS - Dist Candidate - MS 2 - ⁇ 2 ⁇ Distance Source - Candidate 2 ⁇ ⁇ Dist Source - MS + Dist Candidate - MS 2 + ⁇ 2 where ⁇ is a small constant whose value depends on the accuracy of the measurements.
  • the conditions (4) or (5) for selecting a valid candidate have to be simultaneously met by all Source sectors, a condition that may be used as an additional qualification of the Candidate sectors.
  • step 750 the number N of candidate sectors that pass the distance test is counted.
  • step 760 it is queried how many candidate sectors pass the distance test, that is, it is queried what N equals.
  • N the distance condition (5)
  • step 770 the sector missing on the Source sector NL 202 is identified. Normally, the uniqueness of the missing neighbor Candidate is ensured by the PN Planning process, in which the designers and operators of the WN 300 assign the PN Offsets to the individual sectors in such a way that the sectors with the same PN Offset are sufficiently far apart geographically.
  • step 760 the answer to the question posed in step 760 is N>1, and the process proceeds to step 780.
  • step 780 using RF power propagation criteria, the NC 201 or AP 203 determines which of the candidates that satisfy condition (5) is the right one.
  • step 790 the process may proceed to step 790. Algorithmically, this step may be similar to step 770 (determination of number of candidates based on RF power propagation criteria), except that these criteria would not be applied to the set of cells that satisfy the distance criteria from step 750, but would be applied to the original set of cells from step 730.
  • Figure 8 is a flowchart showing the steps in a method for identifying a missing neighbor in a Code Division Multiple Access (CDMA) wireless network using a power-based condition in a case where more than one candidate satisfies the distance-based condition.
  • CDMA Code Division Multiple Access
  • the NC 201 or AP 203 the estimates the location of the MS 211 at the time when it reported a missing pilot in the PSMM or RUM messages. Estimation of the most likely location can be accomplished in a number of different ways, depending on the particular application. For instance, the information might be comprised in the Mobile Probe logs (item 210 in Figure 2 ) generated from the GPS measurements. Location information might be available in the NC 201 if the network support for Location Based Services is active, as specified, for example, by the IS-801 suite of standards. Alternatively, trilateration techniques can be used to make one or more location estimates, depending on the number of Source servers active. For the purposes of the disclosed method, it will normally be sufficient to estimate the distance Dist Source-MS as equal to the distance measured along the boresight of the strongest Source sector.
  • step 820 the power levels received from the Source and Candidate servers at the expected location of the MS 211 are estimated. This can be done by interfacing with an RF propagation prediction tool such as, for example, Atoll, Planet, and the like.
  • the propagation path loss from a Source or Candidate antenna can be approximated by one of several semi-empirical models, such as, for example, the Okumura-Hata model: K - 13.82 ⁇ log 10 Height Sector + 44.99 - 6.55 ⁇ log 10 Height Sector ⁇ log 10 ⁇ Dist Sector - MS where K is a constant that depends on the frequency of the RF channel 160, clutter morphology, and assumed MS 211 antenna height.
  • K is a constant that depends on the frequency of the RF channel 160, clutter morphology, and assumed MS 211 antenna height.
  • the best fit determination algorithm can comprise finding a candidate with the ratio of power difference vs. Source sector power that is closest to the ratio of the source's reported power and the missing neighbor's reported power.
  • the best fit determination algorithm can comprise finding a candidate with the strongest received power, since the probability of having two candidates of comparable power is typically very small in a WN 300 with a reasonable level of PN reuse planning.
  • Other approaches to a best fit determination algorithm are also possible according to embodiments of the invention.
  • the statistical significance of the best-fit match is evaluated.
  • the statistical significance evaluation can comprise determining the standard deviation of the estimation error of the path loss model used due to shadowing as well as determining the correlation between shadowing processes as experienced by different sectors. In the Okumura-Hata case, this standard deviation will typically be approximately 6-8dB. A typical value for the correlation between shadowing processes is approximately 0.5.
  • the statistical significance can be determined based on the power difference between the strongest candidate and the second strongest candidate. It is queried whether the best-fit candidate is statistically significant. This question can be formulated as a query as to whether the statistical difference exceeds a value of X dB, where X is a function of the shadowing standard deviation, the correlation between shadowing processes on different sectors, and the required confidence level (say 95 or 99%).
  • step 860 the candidate with the strongest power is declared to have the best fit.
  • step 850 If the answer to the question posed in step 850 is that the best fit candidate estimate is not statistically significant, then the process proceeds to step 870.
  • step 870 an indication is generated of a possible pilot PN Reuse problem.
  • the Power condition shown in Figure 8 can be used in step 790 of Figure 7 if step 770 using the Distance condition as shown in Figure 7 does not generate any likely candidates.
  • Figure 9 is a table that shows a portion of a wireless network cell and sector database 900.
  • One of the NC 201 and AP 203 searches the list of all sectors in the WN 300 and forms a new List of Candidate sectors that have the same PN Offset as the value calculated for the missing neighbor.
  • Figure 10 is a table that shows an example 1000 of a distance calculation for candidate sectors with the same PN offset and different latitudes and longitudes in a method for identifying a missing neighbor in a CDMA wireless network pursuant to step 740 in Figure 7 .
  • Figure 11 is a drawing schematically illustrating a method 1100 for identifying a missing neighbor in a wireless network when the missing neighbor does not belong to the nearest candidate sector pursuant to step 740 in Figure 7 .
  • condition (4) ensures the intersection of the circles centered on the Source and candidate sector and having radii corresponding to the calculated distances between these two sectors and the MS 211. These three candidates have the same PN offset.
  • the MS 211 will be located at one of the up to two possible intersection points.
  • Figure 12 is a drawing schematically illustrating a method 1200 for identifying a missing neighbor in a wireless network using a power-based condition in case the distance-based condition gives more than one valid candidate.
  • the actual antenna radiation patterns 12 01 , 12 02 of the two candidate sectors are superimposed.
  • both sectors satisfy the distance condition (5), the missing neighbor pilot is more likely to come from Candidate sector 1 than from Candidate sector 2. This is due to the fact that Candidate sector 2 sector points away from the source sector, and accordingly is much less likely to be present at a sufficient power level in the general area where the MS 211 is located. Another possible clue is that either of the other two sectors from the cell with Candidate sector 2 would likely be active as Source sectors if it were a real candidate.
  • the NC 201 or AP 203 can use an Extended Sector Database, such as item 215 in Figure 2 .
  • Figure 13 is a table 1300 showing a portion of such a wireless network cell and sector database ("Extended Sector Database”) that can be used in the received power calculations according to embodiments of the invention.
  • Extended Sector Database Extended Sector Database
  • Figure 13 comprises information about cell number, sector number, PN offset, latitude and longitude, deployed antenna types in the sectors, their azimuth pointing angle and tilts, heights, pilot power, horizontal antenna beamwidth, vertical antenna beamwidth, and the like.
  • Such information is relevant for RF propagation but is not always stored at the NC 201.
  • Such information is readily available in network construction databases or in databases for propagation prediction that are used in design and optimization of WNs 300, with which the AP 203 or NC 201 can easily interface.
  • a pilot signal comprises a scrambling code
  • pilot measurements are comprised in a Radio Resource Control (RRC) Measurement Report
  • missing pilots are listed in a Detected Set.
  • RRC Radio Resource Control
  • the time differences of arrival as measured by the mobiles may be reported in terms of Chip and Frame Offsets via RRC Measurement Report messages.
  • the methods disclosed above can be adjusted to account for a different Chip Offset definition and a different chip duration.
  • UMTS networks include Time Division Duplex (TDD) networks and Frequency Division Duplex (FDD) networks.
  • TDD Time Division Duplex
  • FDD Frequency Division Duplex
  • the network can measure or otherwise determine the Relative Timing Differences (RTDs) between different base stations.
  • RTDs can be sent over the air to the mobiles, via RRC Measurement Control messages, in which case embodiments of the invention may use logs from the network or mobile probes.
  • RTD values can be estimated from mobile telephones' RRC Measurement Report messages listing multiple pilots, as described in the literature. No additional information is needed from the side of the WN 301 in order to estimate the RTD values. The estimation will typically be performed by embodiments comprising an adjunct processor 203.
  • RTD values can be obtained from measurements by mobile telephones at known locations.
  • special test mobile telephones could be strategically distributed throughout the WN 300 for the purpose of facilitating such measurements.
  • a pilot signal comprises a Physical Cell Identifiers (PCI)
  • PCI Physical Cell Identifiers
  • RRC Radio Resource Control
  • missing pilots are listed in a Detected Set.
  • the methods proposed herein can be applied directly when the OTDOA measurements are provided to support emergency calls (e911) or calls with location-based services enabled, and the same would apply for other technologies with no OTDOA measurements included in standard handoff messages, such as GSM, WiMAX, etc.
  • the OTDAO measurements are generally not available in RRC Measurement Reports, but the distance from the serving cell can still be calculated based on the measured RTT values, and distance estimates based on reported powers can also be used within the same basic methodology proposed herein , Estimation of distances based on reported power levels can be carried out using path loss formulas such as the Okumura-Hata model (6).
  • path loss formulas such as the Okumura-Hata model (6).
  • Various other approaches to distance estimation based on the received powers (or e.g. one measured RTT value and differences of the reported powers), are well described in the literature.

Landscapes

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

Claims (15)

  1. Procédé d'identification d'un voisin manquant dans un réseau sans fil (300), comprenant :
    la réception (510) d'un rapport sur deux ou plusieurs signaux pilotes mesurés par une station mobile (140) ;
    la détermination (520) si un ou plusieurs des signaux pilotes rapportés est un voisin manquant non compris dans une liste de voisins actuels de la station mobile ;
    le choix (530) d'un ou plusieurs secteurs candidats présentant un signal pilote doté de la même identité pilote que le voisin manquant ; et
    la sélection (540) d'un secteur le plus vraisemblable en tant que voisin manquant à partir d'un ou plusieurs secteurs candidats, caractérisé en ce que la sélection est basée sur le calcul des distances entre la station mobile et un secteur source, entre la station mobile et au moins l'un de l'un ou plusieurs secteurs candidats, et entre le secteur source et au moins l'un de l'un ou plusieurs secteurs candidats, de manière à identifier le voisin manquant dans le réseau sans fil.
  2. Procédé selon la revendication 1, dans lequel le procédé est réalisé par un contrôleur de réseau (150).
  3. Procédé selon la revendication 1, dans lequel le procédé est réalisé par un commutateur (203) non compris dans un contrôleur de réseau.
  4. Procédé selon l'une quelconque des revendications précédentes, dans lequel l'étape de réception est réalisée en utilisant un ou plusieurs des éléments suivants : un journal de contrôleur de réseau, des journaux de sonde de réseau, un journal de sonde mobile, et une base de données de secteur étendu.
  5. Procédé selon l'une quelconque des revendications précédentes, dans lequel l'étape de sélection comprend la sélection en tant que secteur le plus vraisemblable, un secteur candidat pour lequel une inégalité triangulaire est satisfaite à l'intérieur d'un seuil de tolérance prédéterminé.
  6. Procédé selon la revendication 5, comprenant en outre :
    l'évaluation des niveaux de puissance des secteurs candidats reçus d'un ou plusieurs secteurs candidats au niveau d'un emplacement de station mobile évalué ;
    la comparaison des niveaux de puissance des secteurs candidats à un niveau de puissance de voisin manquant reçu en provenance du voisin manquant au niveau de l'emplacement de station mobile évalué ; et
    l'utilisation des niveaux de puissance des secteurs candidats et du niveau de puissance du voisin manquant pour sélectionner le secteur le plus vraisemblable.
  7. Procédé selon la revendication 6, comprenant en outre :
    l'évaluation d'un niveau de puissance de secteur source reçu du secteur source au niveau de l'emplacement de station mobile évalué ; et
    le calcul des relations entre les niveaux de puissance des secteurs candidats et le niveau de puissance de secteur source ; et
    l'utilisation des niveaux de puissance des secteurs candidats, du niveau de puissance du voisin manquant et du niveau de puissance de secteur source pour sélectionner le secteur le plus vraisemblable.
  8. Procédé selon l'une quelconque des revendications précédentes, dans lequel le réseau sans fil est un réseau à accès multiple par répartition en code, dans lequel l'identité pilote est un décalage de pseudo-bruit, et dans lequel les distances sont calculées sur la base d'au moins une des informations de temps aller-retour et des informations de phase de pseudo-bruit pilote à partir des messages de mesure d'intensité pilote ou de mise à jour de chemin.
  9. Procédé selon l'une quelconque des revendications 1 à 7, dans lequel le réseau sans fil est un réseau du Système universel de télécommunications mobiles (UMTS - Universal Mobile Telecommunications System), dans lequel l'identité pilote est un code de brouillage, et dans lequel les distances sont calculées sur la base d'au moins une des informations de temps aller-retour obtenues à partir d'un message de mesure de commande de ressource radio et des informations de décalage de bribe et de trame obtenues à partir d'un message de mesure de contrôle de ressource radio.
  10. Procédé selon la revendication 9, dans lequel le réseau du Système universel de télécommunications mobiles est non synchronisé, comprenant en outre une étape consistant à calculer les distances entre le secteur source et au moins l'un de l'un ou plusieurs secteurs candidats sur la base de différences de synchronisation relatives.
  11. Procédé selon l'une quelconque des revendications 1 à 7, dans lequel le réseau sans fil est un réseau à évolution à long terme, et dans lequel l'identité pilote est un identifiant de cellule physique, et les distances sont calculées sur la base d'un temps aller-retour et des mesures de puissance à partir du message de rapport de mesure de contrôle de ressource radio.
  12. Procédé (600) de mise à jour un voisin actuel dans un réseau sans fil, comprenant :
    la réception (610) d'un rapport sur deux ou plusieurs signaux pilotes mesurés par une station mobile ;
    le choix (620) d'un ou plusieurs secteurs candidats présentant un signal pilote doté de la même identité pilote qu'un voisin actuel compris dans une liste de voisins actuels ; et
    pour le voisin actuel, la sélection (630) d'un secteur le plus vraisemblable à partir d'un ou plusieurs secteurs candidats, caractérisé en ce que la sélection est basée sur le calcul des distances entre la station mobile et un secteur source, entre la station mobile et un ou plusieurs secteurs candidats, et entre le secteur source et au moins l'un de l'un ou plusieurs secteurs candidats, de telle sorte que le voisin actuel qui a été mal identifié précédemment, peut être détecté et mis à jour.
  13. Procédé selon la revendication 12, dans lequel l'étape de sélection comprend la détermination si deux ou plusieurs secteurs candidats se qualifient en tant que secteurs les plus vraisemblables.
  14. Procédé selon la revendication 13, dans lequel l'étape de sélection comprend en outre la transmission d'une notification appropriée selon laquelle deux ou plusieurs secteurs candidats se qualifient en tant que secteurs les plus vraisemblables.
  15. Procédé selon la revendication 14, dans lequel l'étape de sélection comprend l'une des étapes suivantes :
    a) la détermination de la présence d'un problème de réutilisation de pilote ; et
    b) la détermination de la présence d'un problème de réutilisation de pilote et la transmission d'une notification appropriée concernant un problème de réutilisation de pilote.
EP12171221.0A 2011-06-07 2012-06-07 Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil Active EP2533569B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US201161520275P 2011-06-07 2011-06-07

Publications (2)

Publication Number Publication Date
EP2533569A1 EP2533569A1 (fr) 2012-12-12
EP2533569B1 true EP2533569B1 (fr) 2013-08-21

Family

ID=46229315

Family Applications (1)

Application Number Title Priority Date Filing Date
EP12171221.0A Active EP2533569B1 (fr) 2011-06-07 2012-06-07 Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil

Country Status (2)

Country Link
US (1) US8606275B2 (fr)
EP (1) EP2533569B1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106792789A (zh) * 2015-11-24 2017-05-31 中国移动通信集团安徽有限公司 一种识别漏配邻区的方法及装置

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9025527B2 (en) * 2012-12-13 2015-05-05 Qualcomm Incorporated Adaptive channel reuse mechanism in communication networks
EP2983413B1 (fr) * 2013-04-03 2019-06-05 LG Electronics Inc. Procédé de recherche de station de base au sein d'une pluralité de systèmes de communication et appareil associé
EP3070971B1 (fr) * 2013-12-12 2018-09-19 Huawei Technologies Co., Ltd. Procédé et dispositif d'optimisation de relation de voisinage
US9319979B2 (en) 2014-01-20 2016-04-19 Nokia Solutions And Networks Oy Resolving identification code ambiguities in wireless access networks
EP3158797B1 (fr) * 2014-06-18 2018-01-17 Telefonaktiebolaget LM Ericsson (publ) Détection de relation de cellules voisines
US9173064B1 (en) 2014-10-06 2015-10-27 Polaris Wireless, Inc. Estimating proximity to a mobile station by manipulating an interfering signal
US9402157B1 (en) * 2014-10-21 2016-07-26 Polaris Wireless, Inc. Estimating proximity to a mobile station by manipulating a signal that is decodable, but unexpected in the wireless network serving the mobile station
US9980187B2 (en) 2016-05-25 2018-05-22 Cellwize Wireless Technologies Ltd. Method of optimizing a cellular network and system thereof
CN106792840A (zh) * 2017-03-30 2017-05-31 徐康庭 邻区漏配定位方法及系统
EP3700234A1 (fr) * 2019-02-19 2020-08-26 Koninklijke Philips N.V. Système de mesure de distance sécurisée

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5646632A (en) 1994-11-14 1997-07-08 Lucent Technologies Inc. Method and apparatus for a portable communication device to identify its own location
GB2331892A (en) * 1997-11-26 1999-06-02 Motorola Ltd Method of altering a neighbour cell list in a cellular communication system
US6721561B1 (en) 1999-10-19 2004-04-13 Samsung Electronics Co., Ltd. Method for building a home-zone database using measured power strength
US20020025822A1 (en) * 2000-08-18 2002-02-28 Hunzinger Jason F. Resolving ambiguous sector-level location and determining mobile location
US7127257B2 (en) * 2001-12-27 2006-10-24 Qualcomm Incorporated Use of mobile stations for determination of base station location parameters in a wireless mobile communication system
US7660588B2 (en) 2002-10-17 2010-02-09 Qualcomm Incorporated Method and apparatus for improving radio location accuracy with measurements
EP1872150B9 (fr) * 2005-04-08 2013-04-10 WaveMarket, Inc. (d/b/a Location Labs) Localisation d'unite mobile
US20060270400A1 (en) 2005-05-31 2006-11-30 Lucent Technologies Inc. Methods and structures for improved monitoring and troubleshooting in wireless communication systems
US8054803B2 (en) 2005-08-29 2011-11-08 Ktfreetel Co., Ltd. Method and apparatus for optimizing neighbor list automatically in synchronous CDMA network
JP4674176B2 (ja) * 2006-03-14 2011-04-20 株式会社日立製作所 無線通信システム、このシステムでの隣接局情報の管理方法、及びその管理装置
US7826847B1 (en) 2006-07-14 2010-11-02 Carrier Iq, Inc. Neighbor list generation in wireless networks
US20080113670A1 (en) 2006-11-14 2008-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Method for managing a list of neighboring cells in a cellular telecommunications network
US8351943B2 (en) * 2006-12-28 2013-01-08 Alcatel Lucent Method and apparatus for handoff in a wireless network
US8391906B2 (en) 2007-11-16 2013-03-05 Qualcomm Incorporated Basing neighbor list updates on a radio link failure
US20100113021A1 (en) * 2008-10-31 2010-05-06 Nokia Corporation Association of Network Cells with Location Information
US20110039575A1 (en) * 2009-08-14 2011-02-17 Manuel Del Castillo Method and system for positioning neighbor cells in a cellular network using learned cell data
US8938262B2 (en) * 2011-06-03 2015-01-20 Apple Inc. Neighbor cell location averaging

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106792789A (zh) * 2015-11-24 2017-05-31 中国移动通信集团安徽有限公司 一种识别漏配邻区的方法及装置
CN106792789B (zh) * 2015-11-24 2020-08-18 中国移动通信集团安徽有限公司 一种识别漏配邻区的方法及装置

Also Published As

Publication number Publication date
US20120315895A1 (en) 2012-12-13
US8606275B2 (en) 2013-12-10
EP2533569A1 (fr) 2012-12-12

Similar Documents

Publication Publication Date Title
EP2533569B1 (fr) Procédé permettant d'identifier les voisins manquants et d'actualiser les voisins actuels dans des réseaux sans fil
US9900809B2 (en) Methods and arrangements in a telecommunication system
US9288783B2 (en) Methods and apparatuses for reduction of interference during positioning measurements
AU2008242924B2 (en) Sparsed U-TDOA wireless location networks
AU2008242838B2 (en) Sparsed U-TDOA wireless location networks
US8738010B2 (en) Cooperating receiver selection for UMTS wireless location
US8290496B2 (en) Cooperating receiver selection for UMTS wireless location
AU2008242835B2 (en) Sparsed U-TDOA Wireless Location Networks
US8045506B2 (en) Sparsed U-TDOA wireless location networks
US10809350B2 (en) Hybrid fingerprinting/OTDOA positioning techniques and systems
US9229094B2 (en) Method and device using observed time difference of arrival for positioning mobile station
EP2602634A1 (fr) Géolocalisation mobile
US20150133157A1 (en) Positioning Method, Control Device, and Mobile Communications System
WO2005002124A2 (fr) Procedes apportant des ameliorations de precision du deploiement de reseau epars
EP2600654A1 (fr) Station de base sans fil et son procédé de commande
US20170150436A1 (en) Apparatuses and Methods therein for Positioning Measurements
EP2880896A2 (fr) Proximité de positionnement dans des réseaux sans fil
Dev et al. NRPos: A multi-RACH framework for 5G NR positioning
US20220022182A1 (en) Apparatus and method to estimate ue position
KR20080075382A (ko) Ｃｄｍａ 가입자 단말의 위치 측정 장치 및 그 측정 방법
Koudouridis et al. A method for the generation of radio signal coverage maps for dense networks

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

17P Request for examination filed

Effective date: 20130412

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 36/00 20090101AFI20130425BHEP

Ipc: H04W 64/00 20090101ALN20130425BHEP

Ipc: H04W 24/02 20090101ALN20130425BHEP

INTG Intention to grant announced

Effective date: 20130517

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 64/00 20090101ALN20130508BHEP

Ipc: H04W 36/00 20090101AFI20130508BHEP

Ipc: H04W 24/02 20090101ALN20130508BHEP

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 628712

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130915

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602012000222

Country of ref document: DE

Effective date: 20131017

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20130821

Ref country code: AT

Ref legal event code: MK05

Ref document number: 628712

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130821

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131223

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130918

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131121

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131221

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131122

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602012000222

Country of ref document: DE

Representative=s name: K & H BONAPAT, DE

26N No opposition filed

Effective date: 20140522

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602012000222

Country of ref document: DE

Representative=s name: K & H BONAPAT PATENTANWAELTE KOCH - VON BEHREN, DE

Effective date: 20140702

Ref country code: DE

Ref legal event code: R081

Ref document number: 602012000222

Country of ref document: DE

Owner name: TEKTRONIX, INC., BEAVERTON, US

Free format text: FORMER OWNER: NEWFIELD WIRELESS, INC., BERKELEY, CALIF., US

Effective date: 20140702

Ref country code: DE

Ref legal event code: R082

Ref document number: 602012000222

Country of ref document: DE

Representative=s name: K & H BONAPAT, DE

Effective date: 20140702

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20140717 AND 20140723

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602012000222

Country of ref document: DE

Effective date: 20140522

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: TEKTRONIX, INC., US

Effective date: 20140903

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20140607

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140607

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150630

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150630

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 5

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20120607

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20160628

Year of fee payment: 5

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20170427 AND 20170503

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20180228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130821

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230626

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230627

Year of fee payment: 12