IP Library Granted Patent US 11,229,000
Granted Patent B2
US 11,229,000 · App. 16/831,213 · Granted Jan 18, 2022

Automatic location of access points in a network

Inventors: Vikram Raghu (Santa Clara, CA); Eldad Perahia (Park City, UT); Sachin Ganu (Santa Clara, CA); Sai Pradeep Venkatraman (Santa Clara, CA); Charles Lukaszewski (Santa Clara, CA)
Assignee: Hewlett Packard Enterprise Development LP
H04W64/003G06F17/16G06T17/05H04W4/023H04W40/248H04W64/006H04W88/08
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 11,229,000
App. No.
16/831,213
Granted
Jan 18, 2022
Kind
B2
Abstract

Embodiments are directed to automatic location of access points in a network. An embodiment of one or more non-transitory computer-readable storage mediums includes instructions for transmitting a request from a computing device to multiple access points in a network to determine a distance between each pair of access points of the multiple access points; receiving at the computing device the determined distances between each pair of access points; generating a proximity matrix containing the determined distances between each pair of access points; solving the proximity matrix to automatically generate a set of locations for the multiple access points; and orienting the generated set of locations for the multiple access points based on known locations of one or more anchor points in a subset of the access points.

Claims (51)

1. One or more non-transitory computer-readable storage mediums having stored thereon executable computer program instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

transmitting a request from a computing device to a plurality of access points in a network to determine a distance between each pair of access points of the plurality of access points;

receiving at the computing device the determined distances between each pair of access points of the plurality of access points;

generating a proximity matrix containing the determined distances between each pair of access points of the plurality of access points;

solving the proximity matrix to automatically generate a set of locations for the plurality of access points;

orienting the generated set of locations for the plurality of access points based on known locations of one or more anchor points in a subset of the plurality of access points;

identifying one or more missing distances between one or more pairs of access points in the proximity matrix; and

calculating or estimating the missing distances based on other distances in the proximity matrix.

2. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein the determination of the distance between each pair of access points includes measurement of time of flight of signals transmitted between each pair of access points.

3. The one or more non-transitory computer-readable storage mediums of claim 2 , wherein the determination of the distance between each pair of access points includes performance of fine timing measurement (FTM) by the plurality of access points.

4. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein solving the proximity matrix to generate the set of locations for the plurality of access points includes application of MDS (Multidimensional Scaling).

5. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein estimating the missing distances includes estimating a distance between a first access point and a second access point based on a shortest alternative path between the first access point and the second access point.

6. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein solving the proximity matrix with the missing distances includes:

dividing the proximity matrix into a plurality of cliques containing less than all values of the proximity matrix;

solving each of plurality of cliques; and

combining the solutions for the plurality of cliques.

7. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein the instructions further include instructions for:

generating a map of the plurality of access points based on the set of locations.

8. The one or more non-transitory computer-readable storage mediums of claim 7 , wherein the map of the plurality of access points is a three-dimensional (3D) map.

9. The one or more non-transitory computer-readable storage mediums of claim 8 , wherein a number of anchor points is at least three.

10. The one or more non-transitory computer-readable storage mediums of claim 1 , wherein the instructions further include instructions for:

repeating the generation of the set of locations for the plurality of access points upon a change in the network.

11. A computing device comprising:

one or more processors;

a memory to store data; and

a transmitter and receiver;

wherein the computing device is to:

transmit a request to a plurality of access points in a network to determine a distance between each pair of access points of the plurality of access points;

receive the determined distances between each pair of access points of the plurality of access points;

generate a proximity matrix containing the determined distances between each pair of access points of the plurality of access points;

solve the proximity matrix to automatically generate a set of locations for the plurality of access points;

orient the generated set of locations for the plurality of access points based on known locations of one or more anchor points in a subset of the plurality of access points;

identify one or more missing distances between one or more pairs of access points in the proximity matrix; and

calculate or estimate the missing distances based on other distances in the proximity matrix.

12. The computing device of claim 11 , wherein the determination of the distance between each pair of access points includes measurement of time of flight of signals transmitted between each pair of access points.

13. The computing device of claim 12 , wherein the determination of the distance between each pair of access points includes performance of fine timing measurement (FTM) by the plurality of access points.

14. The computing device of claim 11 , wherein solving the proximity matrix to generate the set of locations for the plurality of access points includes application of MDS (Multidimensional Scaling) by the computing device.

15. The computing device of claim 11 , wherein solving the proximity matrix with the missing distances includes the computing device to:

divide the proximity matrix into a plurality of cliques containing less than all values of the proximity matrix;

solve each of plurality of cliques; and

combine the solutions for the plurality of cliques.

16. A method for automatic generation of access point locations comprising:

transmitting a request from a computing device to a plurality of access points in a network to determine a distance between each pair of access points of the plurality of access points, wherein the determination of the distance between each pair of access points includes measurement of time of flight of signals transmitted between each pair of access points;

receiving at the computing device the determined distances between each pair of access points of the plurality of access points;

generating a proximity matrix containing the determined distances between each pair of access points of the plurality of access points;

solving the proximity matrix to automatically generate a set of locations for the plurality of access points;

orienting the generated set of locations for the plurality of access points based on known locations of one or more anchor points in a subset of the plurality of access points;

identifying one or more missing distances between one or more pairs of access points in the proximity matrix; and

calculating or estimating the missing distances based on other distances in the proximity matrix.

17. The method of claim 16 , wherein the determination of the distance between each pair of access points includes performance of fine timing measurement (FTM) by the plurality of access points.

18. The method of claim 16 , wherein solving the proximity matrix to generate the set of locations for the plurality of access points includes application of MDS (Multidimensional Scaling).

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 3, 2020
From: RAGHU, VIKRAM; PERAHIA, ELDAD; GANU, SACHIN; VENKATRAMAN, SAI PRADEEP; LUKASZEWSKI, CHARLES
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 052303/0820 →
Continuity (1)
Related Publication 20210306975A1 · Sep 30, 2021