IP Library Granted Patent US 8,606,275
Granted Patent B2
US 8,606,275 · App. 13/490,879 · Granted Dec 10, 2013

Method for identifying missing neighbors and for updating current neighbors in wireless networks

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,606,275
App. No.
13/490,879
Granted
Dec 10, 2013
Kind
B2
Abstract

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.

Claims (29)

1. A method for identifying a missing neighbor in a wireless network, comprising:

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.

2. The method of claim 1 , wherein the method is performed by a network controller.

3. The method of claim 1 , wherein the method is performed by an adjunct processor not comprised in a network controller.

4. The method of claim 1 , wherein the step of receiving is performed using one or more of a network controller log, network probe logs, a mobile probe log, and an extended sector database.

5. The method of claim 1 , wherein the step of selecting comprises selecting as a most likely sector a candidate sector for which a triangle inequality is satisfied to within a predetermined tolerance level.

6. The method of claim 5 , further comprising:

estimating candidate sector power levels received from the one or more candidate sectors at an estimated mobile station location;

comparing candidate sector power levels to a missing neighbor power level received from the missing neighbor at the estimated mobile station location; and

using the candidate sector power levels and the missing neighbor power level to select a most likely sector.

7. The method of claim 6 , further comprising:

estimating a source sector power level received from the source sector at the estimated mobile station location; and

calculating the relationships between the candidate sector power levels relative to the source sector power level; and

using the candidate sector power levels, the missing neighbor power level, and the source sector power level to select a most likely sector.

8. The method of claim 1 , wherein the wireless network is a Code Division Multiple Access (CDMA) network, wherein the pilot identity is a PN (Pseudonoise) Offset, and wherein the distances are calculated based on at least one of Round Trip Time information and pilot PN phase information from the Pilot Strength Measurement or Route Update messages.

9. The method of claim 1 , wherein the wireless network is a Universal Mobile Telecommunications System (UMTS) network, wherein the pilot identity is a Scrambling Code, and wherein the distances are calculated based on at least one of Round Trip Time information obtained from a Radio Resource Control (RRC) Measurement message and chip and frame offset information obtained from an RRC Measurement message.

10. The method of claim 9 , wherein the UMTS network is unsynchronized, further comprising the step of computing the distances between the source sector and at least one of the one or more candidate sectors based on Relative Timing Differences (RTDs).

11. The method of claim 1 , wherein the wireless network is a Long Term Evolution (LTE) network, and wherein the pilot identity is a Physical Cell Identifier (PCI), and distances are calculated based on RTT and power measurements from the RRC Measurement Report message.

12. A method for updating a current neighbor in a wireless network, comprising:

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.

13. The method of claim 12 , wherein the step of selecting comprises determining that two or more candidate sectors qualify as most likely sectors.

14. The method of claim 13 , wherein the step of selecting further comprises transmitting an appropriate notification that two or more candidate sectors qualify as most likely sectors.

15. The method of claim 14 , wherein the step of selecting comprises determining the presence of a pilot reuse problem.

16. The method of claim 15 , wherein the step of selecting further comprises transmitting an appropriate notification of a pilot reuse problem.

Assignments (8)
CHANGE OF NAME Recorded Sep 6, 2016
From: TEKTRONIX TEXAS, LLC
To: NETSCOUT SYSTEMS TEXAS, LLC
Reel/Frame 039919/0208 →
CHANGE OF NAME Recorded Aug 12, 2016
From: TEKTRONIX TEXAS, LLC
To: NETSCOUT SYSTEMS TEXAS, LLC
Reel/Frame 039665/0256 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2015
From: TEKTRONIX, INC.
To: TEKTRONIX TEXAS, LLC
Reel/Frame 036355/0563 →
SECURITY INTEREST Recorded Aug 14, 2015
From: NETSCOUT SYSTEMS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 036355/0586 →
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE NAME PREVIOUSLY RECORDED ON REEL 032913 FRAME 0887. ASSIGNOR(S) HEREBY CONFIRMS THE TEXT OF THE ORIGINAL ASSIGNMENT AND ARE SUBMITTING AN ASSIGNMENT IDENTIFYING THE CORRECT ASSIGNEE NAME AND ADDRESS. Recorded May 27, 2014
From: NEWFIELD WIRELESS, INC.
To: TEKTRONIX, INC.
Reel/Frame 033026/0102 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2014
From: NEWFIELD WIRELESS, INC.
To: TEKTRONIX COMMUNICATIONS
Reel/Frame 032913/0887 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 11, 2012
From: JOVANOVIC, VLADAN; KLEINBECK, DAVID WILLIAM
To: NEWFIELD WIRELESS
Reel/Frame 028351/0640 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 7, 2012
From: JOVANOVIC, VLADAN; KLEINBECK, DAVID WILLIAM
To: NEWFIELD WIRLESS
Reel/Frame 028336/0339 →