Wireless station location detection

• US 8,238,942 B2
• Filed: 11/21/2007
• Issued: 08/07/2012
• Est. Priority Date: 11/21/2007
• Status: Active Grant

• Current Assignee: Trapeze Networks Incorporated (Juniper Networks Incorporated)
• Original Assignee: Trapeze Networks Incorporated (Juniper Networks Incorporated)
• Inventors: Gast, Matthew Stuart
• Primary Examiner(s): Patel, Nimesh
• Application Number:
  US11/944,346
• Publication Number:
  US 20090131082A1
• Time in Patent Office: 1,721 Days
• Field of Search: 455/457, 455/67.14, 455/522, 370/324, 370/331, 370/37, 370/519
• US Class Current: 455/457
• CPC Class Codes: G01S 5/0205 Details
• CPC Class Codes: G01S 5/14 Determining absolute distances from a plurality of spaced points of known location
• CPC Class Codes: H04W 12/12 Detection or prevention of fraud
• CPC Class Codes: H04W 12/122 Counter-measures against attacks; Protection against rogue devices
• CPC Class Codes: H04W 12/61 Time-dependent
• CPC Class Codes: H04W 12/63 Location-dependent; Proximity-dependent
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management

Abstract

A technique for locating a device uses connectivity to find a distance between an access point (AP) and a device. The AP transmits a frame to a device and receives an acknowledgement frame from the device. The amount of time for a signal to pass between the AP and the device is estimated and multiplied by the speed of light to find the distance between the AP and the device.

Claims

1. A system, comprising:

an access point (AP), wherein, in operation;

the AP transmits a frame;

stores a time of beginning of transmission, t₀;

if an acknowledgement frame is received the AP stores a time of completion of receiving, t₁; and

if the acknowledgement frame is not received after one or more frame transmissions, the AP denies future requests for access to a network from the station and sends an instruction to a network management module (NMM) to broadcast an address of the station to other APs in the network to allow the other APs to deny the station access; and

the NMM, coupled to the AP, including;

memory having a value, t_fixed, stored therein, representing a known frame exchange component period of time, and a value, c, representing the speed of light;

a distance calculation engine, in operation, the distance calculation engine determining a distance, d, using a formula d=[(t₁−

t₀−

t_fixed)/2]·

c, d representing an estimated distance of the AP from the station; and

a graphical display engine, wherein, in operation, the graphical display engine displays one or more predicted locations the distance, d, from the AP in a graphically rendered environment.

2. The system of claim 1 wherein, in operation, the AP transmits a plurality of frames, receives a responding acknowledgement paired to each frame transmitted;

and wherein, in operation, the distance calculating engine calculates a plurality of distance values for paired frames from the plurality of times for t₀ and t₁ and averages the plurality of distance values to find an estimated distance.

3. The system of claim 1 wherein the graphically rendered environment is two dimensional.

4. The system of claim 1 wherein the one or more predicted locations are displayed on a circle, a location of the AP being at a center of the circle, the circle having a radius of length d.

5. The system of claim 1 further comprising:

a second AP, wherein, in operation, the second AP transmits a second frame;

stores a second time of beginning of transmission, t₀′

;

receives a second acknowledgement frame from the station;

stores a second time of completion of receiving, t₁′

;

wherein, in operation, the distance calculating engine calculates a second distance d′

using a second formua d′

=[(t₁′

−

t₀′

−

t_fixed)/2]·

c and d′

is used to reduce the one or more predicted locations to two or fewer predicted locations;

wherein the two or fewer predicted locations are displayed at intersecting points of two circles, a location of the AP being at a center of a first circle having a radius of length d, a second location of the second AP being at a second center of the second circle having a radius of length d′

.

6. The system of claim 5 further comprising:

a third AP;

wherein, in operation, the third AP transmits a third frame;

stores a third time of beginning of transmission, t₀′

;

receives a third acknowledgement frame from the station;

stores a third time of completion of receiving, t₁′

wherein, in operation, the distance calculating engine is used to calculate a third distance d″ and

the third distance d″

is used to reduce the one or more predicted locations to one location;

the one location is at a point a distance d from the AP, a distance d′

from the second AP, and a distance d″

from the third AP.

7. The system of claim 1 wherein the graphically rendered environment is rendered in three dimensions.

8. The system of claim 1 further comprising:

a second AP, wherein, in operation, the second AP transmits a second frame;

stores a second time of beginning of transmission, t₀′

;

receives a second acknowledgement frame from the station;

stores a second time of completion of receiving, t₁′

;

a third AP a third AP;

wherein, in operation, the third AP transmits a third frame;

stores a third time of beginning of transmission, t₀″

;

receives a third acknowledgement frame from the station;

stores a second time of completion of receiving, t₁″

;

a fourth AP a fourth AP;

wherein, in operation, the fourth AP transmits a fourth frame;

stores a fourth time of beginning of transmission, t₀′

″

;

receives a fourth acknowledgement frame from the station;

stores a second time of completion of receiving, t₁′

″

;

wherein in operation, the second AP calculates a second distance d′

=[(t₁′

−

t₀′

−

t_fixed)/2]·

c, the third AP calculates a third distance d″

=[(t₁″

−

t₀″

−

t_fixed)/2]·

c, the fourth AP calculates a fourth distance d′

″

=[(t₁′

″

−

t₀′

″

−

t_fixed)/2]·

c;

wherein the distance d, the second distance d′

, the third distance d″

, and the fourth distance d′

″

are used to identify a single point on the graphically rendered environment as a location of a station;

the one location is at a point a distance d from the AP, a distance d′

from the second AP, a distance d″

from the third AP, and a distance d′

″

from the fourth AP.

9. The system of claim 1 wherein the frame is a null frame.

10. A method, comprising:

transmitting a first message from a first access point (AP);

if a second message, associated with the first message, is not received from the station, (1) disabling future access to a network by a station and (2) broadcasting an address of the station to a second AP in the network to allow the second AP to deny the station access; and

predicting a location of the station if the second message is received from the station, comprising;

calculating a time difference, Δ

t, between the start of transmission of the first message, t₀ and receipt of the second message, t₁, wherein Δ

t=t₀−

t₁.

calculating roundtrip propagation time by subtracting one or more fixed periods of time from Δ

t for one or more components of a frame exchange;

determining a distance d by multiplying the speed of light by half the round trip propagation time; and

predicting a location of the station based on d.

11. The method of claim 10 wherein the one or more fixed periods time subtracted from Δ

t include times used to prepare the first message for transmission and to prepare the second message for transmission.

12. The method of claim 10 wherein the one or more components of the frame exchange comprise:

a transmission frame physical layer convergence procedure;

a transmission frame mac header;

a transmission frame check sequence;

a short inter-frame space;

an acknowledge frame physical layer convergence procedure;

an acknowledge frame mac header;

an acknowledge frame check sequence.

13. The method of claim 10 wherein the method is performed in numerous iterations and an estimated distance is found by averaging the distance d from each of the numerous iterations.

14. The method of claim 10 wherein the first message includes a header and a body, and the body is null.

15. A device, comprising:

a radio;

a propagation distance calculating engine;

wherein, in operation;

the radio sends a frame to a station,

the propagation distance calculating engine records a time of start of transmission of the frame,

when the radio does not receive an acknowledgement frame from the station, the device (1) denies future access to a network by the station through the device and (2) broadcasts an address of the station to other devices in the network to allow the other devices to deny access to the network by the station; and

when the radio receives an acknowledgement frame from the station;

the propagation distance calculating engine stores a time of completion of receiving the acknowledgement frame, and

the propagation distance calculating engine calculates a distance by d=[(Δ

t−

t_fixed)/2]·

c, c being the speed of light, Δ

t being the time of completion of receiving minus the time of start of transmission, and t_fixed being a known frame exchange component period of time.

16. The device of claim 15 wherein, in operation, the radio sends a plurality of frames, the propagation distance calculating engine calculates a plurality of distance values, and the propagation distance calculating engine averages the distance values to calculate an estimate of the distance d.

17. The device of claim 15 wherein t_fixed includes time components for a transmission frame physical layer convergence procedure, a transmission frame mac header, a transmission frame check sequence, a short inter-frame space, an acknowledgement frame physical layer convergence procedure, an acknowledge frame mac header, an acknowledge frame check sequence.

18. The device of claim 15 wherein the frame is a data null frame.