US 8,983,493 B2Grant

Method and system for selecting and providing a relevant subset of Wi-Fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources

Issue Date:2015-03-17

•17 Claims

•23 Drawing Sheets

Abstract

A method of providing a relevant subset of information to a client device is based in part on scanning for Wi-Fi access points within range of the client device, using a Wi-Fi database that covers a large target region to retrieve information about these access points, using this information to estimate the position of the mobile client device, selecting a limited region in the vicinity of the estimated location of the client device, and providing information about Wi-Fi access points within this limited region to the client. For efficient transfer and maintenance of data, the target region may be divided into a hierarchy of fixed geographical tiles.

Metadata

Assignee

Skyhook Wireless, Inc.

Inventors

Nicolas Brachet
Farshid Alizadeh-Shabdiz
Joel N. Nelson
Russel K. Jones

Application Information

Application Number:US 13/758,154

Filing Date:2013-02-04

Priority Date:2004-10-29

Art Unit:2642

Classifications

IPC:

H04W24/00H04W4/02G01S5/02H04W48/20H04W16/18H04W48/08H04W48/14H04W64/00H04W84/12

Patent Drawings (23 sheets)

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application is a continuation of and claims priority under 35 U.S.C. §120 to U.S. patent application Ser. No. 11/966,673 (U.S. Pat. No. 8,369,264), filed on Dec. 28, 2007, entitled “Method and System for Selecting and Providing a Relevant Subset of Wi-Fi Location Information to a Mobile Client Device So the Client Device May Estimate its Position with Efficient Utilization of Resources,” which is a continuation-in-part of U.S. patent application Ser. No. 11/261,898 (U.S. Pat. No. 7,414,988), filed on Oct. 28, 2005, entitled “Server for Updating Location Beacon Database,” which claims priority from U.S. Provisional Patent Application No. 60/623,108, filed on Oct. 29, 2004, entitled “Wireless data scanning network for building location beacon database,” which are incorporated herein by reference in their entirety.

BACKGROUND

[0002] 1. Field of the Invention

[0003] The invention generally relates to methods and systems for determining the location of a Wi-Fi-enabled device, and, more specifically, to methods and systems for efficiently managing and distributing Wi-Fi location data to a mobile client device so the client can use such information to estimate its position.

[0004] 2. Discussion of Related Art

[0005] In recent years the number of mobile computing devices has increased dramatically, creating the need for more advanced mobile and wireless services. Mobile email, walkie-talkie services, multi-player gaming and call-following are examples of how new applications are emerging on mobile devices. In addition, users are beginning to demand and seek out applications that not only utilize their current location but also share that location information with others. Parents wish to keep track of their children, supervisors need to track the location of the company's delivery vehicles, and a business traveler looks to find the nearest pharmacy to pick up a prescription. All of these examples require an individual to know his own current location or that of someone else. To date, we all rely on asking for directions, calling people to ask their whereabouts, or having workers check-in from time to time with their position.

[0006] Location-based services represent an emerging class of mobile applications that leverage the ability of devices to calculate their current geographic position and report that to a user or to a service. Some examples of these services include local weather, traffic updates, driving directions, child trackers, buddy finders and urban concierge services. These new location sensitive devices rely on a variety of technologies that all use the same general concept: using radio signals coming from known reference points, these devices can mathematically calculate the user's position relative to these reference points. Each of these technologies has strengths and weaknesses according to the specific radio technologies and positioning algorithms it employs.

[0007] The Global Positioning System (GPS) operated by the US Government leverages dozens of orbiting satellites as reference points. These satellites broadcast radio signals that are picked up by GPS receivers. The receivers measure the time it took for a received signal to travel to the receiver. After receiving signals from three or more GPS satellites the receiver can triangulate its position on the globe. For the system to work effectively, the radio signals must reach the receiver with little or no interference. Weather, buildings or structures, and foliage can interfere with this process because the receivers require a clear line-of-sight to three or more satellites. Interference can also be caused by a phenomenon known as multi-path. The radio signals from the satellites bounce off physical structures causing multiple signals from the same satellite to reach a receiver at different times. Since the receiver's calculation is based on the time the signal took to reach the receiver, multi-path signals confuse the receiver and cause substantial errors.

[0008] Cell tower triangulation is another method used by wireless and cellular carriers to determine a user or device's location. The wireless network and the handheld device communicate with each other to share signal information that the network can use to calculate the location of the device. This approach was originally seen as a superior model to GPS since these signals do not require direct line of site and can penetrate buildings better. Unfortunately these approaches have proven to be suboptimal due to the heterogeneous nature of the cellular tower hardware along with the issues of multi-path signals and the lack of uniformity in the positioning of cellular towers.

[0009] Assisted GPS is a newer model that combines both GPS and cellular tower techniques to produce a more accurate and reliable location calculation for mobile users. In this model, the wireless network attempts to help GPS improve its signal reception by transmitting information about the clock offsets of the GPS satellites and the general location of the user based on the location of the connected cell tower. These techniques can help GPS receivers deal with weaker signals that one experiences indoors and helps the receiver obtain a ‘fix’ on the closest satellites quicker providing a faster “first reading”. These systems have been plagued by slow response times and poor accuracy—greater than 100 meters in downtown areas.

[0010] There have been some more recent alternative models developed to try and address the known issues with GPS, A-GPS and cell tower positioning. One of them, known as TV-GPS, utilizes signals from television broadcast towers (see, e.g., Muthukrishnan, K. et al., Towards Smart Surroundings Enabling Techniques and Technologies for Localization, from Location-and Context-Awareness, Springer Berlin, Heidelberg, May 2005). The concept relies on the fact that most metropolitan areas have 3 or more TV broadcast towers. A proprietary hardware chip receives TV signals from these various towers and uses the known positions of these towers as reference points. The challenges facing this model are the cost of the new hardware receiver and the limitations of using such a small set of reference points. For example, if a user is outside the perimeter of towers, the system has a difficult time providing reasonable accuracy. The classic example is a user along the shoreline. Since there are no TV towers out in the ocean, there is no way to provide reference symmetry among the reference points resulting in a calculated positioning well inland of the user.

[0011] Microsoft Corporation and Intel Corporation (through a research group known as PlaceLab) have deployed a Wi-Fi location system using a database of access point locations acquired from amateur scanners (known as “wardrivers”) who submit their Wi-Fi scan data to public community web sites (see, e.g., LaMarca, A. et al., Place Lab: Device Positioning Using Radio Beacons in the Wild, in Proceedings of the Third International Conference on Pervasive Computing, May 2005). Examples include WiGLE, Wi-FiMaps.com, Netstumbler.com and NodeDB. Both Microsoft and Intel have developed their own client software that uses the Wi-Fi information submitted by wardrivers as a reference in estimating the location of a client device.

[0012] Because individuals voluntarily supply the data, these systems suffer from a number of performance and reliability problems. First, the data across the databases are not contemporaneous; some of the data are new while other portions are 3-4 years old. The age of Wi-Fi location data is important, since over time access points can be moved or taken offline. Second, the data are acquired using a variety of hardware and software configurations. Every 802.11 radio and antenna has different signal reception characteristics affecting the representation of the strength of the signal. Each scanning software implementation scans for Wi-Fi signals in different ways during different time intervals. As a result, the access point information in the database lacks a common standard of reference. Third, the user-supplied data suffer from arterial bias. Because the data is self-reported by individuals who are not following designed scanning routes, the data tends to aggregate around heavily trafficked areas. Arterial bias causes location estimates to be “pulled” towards main arteries, resulting in substantial accuracy errors. Fourth, these databases include the calculated position of scanned access points rather than the raw scanning data obtained by the 802.11 hardware. Each of these databases calculates the access point location differently and each with a rudimentary weighted average formula. The result is that the location estimates for some access points in the database are highly inaccurate.

[0013] There have been a number of commercial offerings of Wi-Fi location systems targeted at indoor positioning (see, e.g., Muthukrishnan, K., et al., Towards Smart Surroundings: Enabling Techniques and Technologies for Localization, Lecture Notes in Computer Science, Vol. 3479, pp. 350-362, January 2005; Hazas, M., et al., Location-Aware Computing Comes of Age, IEEE Computer, Vol. 37(2), pp. 95-97, February 2004, both of which are incorporated by reference herein). These systems are designed to address asset and people tracking within a controlled environment like a corporate campus, a hospital facility or a shipping yard. The classic example is having a system that can monitor the exact location of the crash cart within the hospital so that when there is a cardiac arrest the hospital staff doesn't waste time locating the device. The accuracy requirements for these use cases are very demanding typically calling for 1-3 meter accuracy. These systems use a variety of techniques to fine tune their accuracy including conducting detailed site surveys of every square foot of the campus to measure radio signal propagation. They also require a constant network connection so that the access point and the client radio can exchange synchronization information similar to how A-GPS works. While these systems are becoming more reliable for these indoor use cases, they are ineffective in any wide-area deployment. It is impossible to conduct the kind of detailed site survey required across an entire city and there is no way to rely on a constant communication channel with 802.11 access points across an entire metropolitan area to the extent required by these systems. Most importantly outdoor radio propagation is fundamentally different than indoor radio propagation rendering these indoor positioning algorithms almost useless in a wide-area scenario.

[0014] There are numerous 802.11 location scanning clients available that record the presence of 802.11 signals and associate this information with a GPS location reading. These software applications are operated manually and produce a log file of the readings. Examples of such applications are Netstumber, Kismet and Wi-FiFoFum. Some hobbyists use these applications to mark the locations of 802.11 access point signals they detect and share them with each other. The management of this data and the sharing of the information is performed on an ad hoc basis. These applications do not perform any calculation as to the physical location of the access point; they merely record the location from which the access point was detected.

[0015] Using data gathered by any of these systems requires access to either the raw data that were gathered or the calculated locations for each of the access points. Devices that require the use of these data must somehow gain access to the data. This access is generally accomplished in one of two ways: (i) by means of a network request-response interaction between the mobile device and a networked server; or (ii) by storing a Wi-Fi access point database on the mobile device itself.

[0016] Software that operates on mobile devices is often constrained by the limited physical capabilities of such devices and the cost of mobile resources and services. These constraints include both hardware (memory capacity, power storage and consumption, CPU speed, network capacity and availability) as well as cost constraints for network access and bandwidth consumption. These limitations place a burden on any solution that intends to make use of the available resources, and in particular, create an optimization problem for efficiently managing and distributing Wi-Fi location data.

[0017] This optimization problem is compounded by the fact that the Wi-Fi location database itself requires frequent updates. This is a result of the transient nature of Wi-Fi access points, which are often moved or decommissioned. Thus, the database must be updated regularly to ensure that it contains relatively current Wi-Fi location information.

SUMMARY OF THE INVENTION

[0018] The invention provides methods and systems for selecting and providing a relevant subset of Wi-Fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources.

[0019] Under one aspect of the invention, a method of selecting and providing a relevant subset of Wi-Fi location information includes scanning for Wi-Fi access points within range of a client device, using a Wi-Fi database that covers a large target region to retrieve information about these access points, using this information to estimate the position of the mobile client device, selecting a limited region in the vicinity of the estimated location of the client device, and providing information about Wi-Fi access points within this limited region to the client.

[0020] Under another aspect of the invention, the target region of the database is partitioned into a set of fixed geographical partitions according to a prearranged scheme, and the limited region is comprised of one or more of these partitions.

[0021] Under another aspect of the invention, the target region of the database is partitioned into a set of geometrically similar, polygonal tiles.

[0022] Under another aspect of the invention, the polygonal tiles form a hierarchy in which smaller tiles are nested within larger tiles.

[0023] Under another aspect of the invention, a maximum number of Wi-Fi access points that may be contained within a single polygonal tile is selected, and the size of the polygonal tiles is determined according to this maximum.

[0024] Under another aspect of the invention, each polygonal tile is associated with a timestamp that reflects the most recent update to the access points within that tile, and this timestamp is used to determine whether the data that is cached on the client device is up-to-date.

[0025] Under another aspect of the invention, the estimated speed and direction of the client device is used in determining the limited region.

[0026] Under another aspect of the invention, the predicted route of the client device is used in determining the limited region.

[0027] Under another aspect of the invention, the amount of available memory on the client device is used in determining the limited region.

[0028] Under another aspect of the invention, the speed of the communication between the client device and the database is used in determining the limited region.

[0029] Under another aspect of the invention, the client device is initialized with a portion of the Wi-Fi data that corresponds to a specified geographical region, and this data is updated by communicating with the Wi-Fi database.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

[0030] For a more complete understanding of various embodiments of the present invention, reference is now made to the following descriptions taken in connection with the accompanying drawings, in which:

[0031] FIG. 1 depicts certain embodiments of a Wi-Fi positioning system;

[0032] FIG. 2 depicts scanning vehicles including scanning devices according to certain embodiments of the invention;

[0033] FIG. 3 depicts an example of a scanning scenario to illustrate the problem of arterial bias in data collection;

[0034] FIG. 4 depicts an example using a programmatic route for a scanning vehicle according to certain embodiments of the invention;

[0035] FIG. 5 depicts an example scenario to illustrate the problem of lack of reference symmetry of Wi-Fi access points in locating a user device;

[0036] FIG. 6 depicts an example scenario to illustrate reference symmetry of Wi-Fi access points in locating a user device;

[0037] FIG. 7 depicts scanning vehicles including scanning devices according to certain embodiments of the invention;

[0038] FIG. 8 depicts a central network server including a central database of Wi-Fi access points according to certain embodiments of the invention;

[0039] FIG. 9 depicts an exemplary architecture of positioning software according to certain embodiments of the invention;

[0040] FIG. 10 depicts an exemplary architecture of a scanning client according to certain embodiments of the invention;

[0041] FIG. 11 compares and contrasts the effects of a random scanning model with one using a model from the Chinese postman routing algorithm;

[0042] FIG. 12 depicts certain embodiments of a Wi-Fi positioning system;

[0043] FIG. 13 depicts the client component of a Wi-Fi positioning system, according to certain embodiments of the invention;

[0044] FIG. 14 depicts the server component of a Wi-Fi positioning system, according to certain embodiments of the invention;

[0045] FIG. 15 depicts the operation of the client component of a Wi-Fi positioning system in response to a location request from a client application, according to certain embodiments of the invention;

[0046] FIG. 16 depicts the operation of the server component of a Wi-Fi positioning system in response to a location request from the client component, according to certain embodiments of the invention;

[0047] FIG. 17 depicts the operation of the client component of a Wi-Fi positioning system upon receipt of a list of tile identifiers, according to certain embodiments of the invention;

[0048] FIG. 18 depicts the operation of the server component of a Wi-Fi positioning system in response to a tile request from the client component, according to certain embodiments of the invention;

[0049] FIG. 19 depicts the method by which the server component of a Wi-Fi positioning system uses the density of Wi-Fi access points to determine an appropriate tile size, according to certain embodiments of the invention;

[0050] FIG. 20 depicts a scheme for partitioning the surface of the Earth into a hierarchy of polygonal tiles and a scheme for generating a global unique identifier corresponding to each of these tiles;

[0051] FIG. 21 depicts the communications between various components of a Wi-Fi positioning system during normal operation, according to certain embodiments of the invention; and

[0052] FIG. 22 depicts some of the tiles recommended by the server component of a Wi-Fi positioning system in response to a client location request, according to certain embodiments of the invention.

DETAILED DESCRIPTION

Introduction

[0053] Preferred embodiments of the present invention provide a Wi-Fi positioning system (WPS) used to estimate the geographic location of mobile devices. A WPS includes a database of known access point (AP) locations that are used as reference points in estimating the client's location. Preferred embodiments maintain a cache of Wi-Fi access point data on the client device. Under this approach, the server sends the client a subset of the Wi-Fi access point database containing Wi-Fi access points that are in the general vicinity of the client device. The client stores this information in its local memory cache, where it can be used to satisfy subsequent location requests. If the client device finds that the cache does not contain the information necessary to locate itself or that the data in the cache is out-of-date, or if the client anticipates that more data will be needed in the near future, it supplements the cache by downloading the required data from the access point database. In certain embodiments, this process is streamlined by grouping the access points into “tiles” that correspond to fixed geographical regions.

[0054] FIG. 1 depicts a portion of a preferred embodiment of a WPS. The positioning system includes positioning software [103] that resides on a computing device [101]. Throughout a particular coverage area there are fixed wireless access points [102] that broadcast information using control/common channel broadcast signals. The client device monitors the broadcast signal or requests its transmission via a probe request. Each access point contains a unique hardware identifier known as a MAC address. The client positioning software receives signal beacons from the 802.11 access points in range and calculates the geographic location of the computing device using characteristics from the signal beacons. Those characteristics include the unique identifier of the 802.11 access point, known as the MAC address, and the strengths of the signal reaching the client device. The client software compares the observed 802.11 access points with those in its reference database [104] of access points, which may or may not reside on the device as well. The reference database contains the calculated geographic locations or power profile of all the access points the gathering system has collected. The power profile is a collection of readings that represent the power of the signal from various locations. Using these known locations, the client software calculates the relative position of the user device [101] and determines its geographic coordinates in the form of latitude and longitude readings. Those readings are then fed to location-based applications such as friend finders, local search web sites, fleet management systems and E911 services.

[0055] The positioning software is described in greater detail with reference to FIG. 9, which depict exemplary components of positioning software 103. Typically there is an application or service [901] that utilizes location readings to provide some value to an end user (example, driving directions). This location application makes a request of the positioning software for the location of the device at that particular moment. That request initiates the scanner [902], which makes a “scan request” to the 802.11 radio [903] on the device. The 802.11 radio sends out a probe request to all 802.11 access points [904] within range. According to the 802.11 protocol, those access points in receipt of a probe request will transmit a broadcast beacon containing information about the access point. That beacon includes the MAC address of the device, the network name, the precise version of the protocol that it supports and its security configuration along with information about how to connect to the device. The 802.11 radio collects this information from each access point that responds, calculates the signal strength of each access point and sends that back to the scanner.

[0056] The scanner passes this array of access points to the Locator [906] which checks the MAC addresses of each observed access point against the Access Point Reference Database [905]. This database can either be located on the device or remotely over a network connection. The Access Point Reference Database returns the location data for each of the observed access points that are known to the system. The Locator passes this collection of location information along with the signal characteristics returned from each access point to the Bad Data Filter [907]. This filter applies a number of comparison tests against each access point to determine if any of the access points have moved since they were added to the access point database. After removing bad data records, the Filter sends the remaining access points to the Location Calculation component [908]. Using the reference data from the access point database and the signal strength readings from the Scanner, the Location Calculation component computes the location of the device at that moment. Before that location data is sent back to the Locator, it is processed by the Smoothing engine [909] which averages a past series of location readings to remove any erratic readings from the previous calculation. The adjusted location data is then sent back to the Locator.

[0057] The calculated location readings produced by the Locator are communicated to these location-based applications [901] through the Application Interface [910] which includes an application programming interface (API) or via a virtual GPS capability [911]. GPS receivers communicate their location readings using proprietary messages or using the location standard like the one developed by the National Marine Electronics Association (NMEA). Connecting into the device using a standard interface such as a COM port on the machine retrieves the messages. Certain embodiments of the invention include a virtual GPS capability that allows any GPS compatible application to communicate with this new positioning system without have to alter the communication model or messages.

[0058] The location calculations are produced using a series of positioning algorithms intended to turn noisy data flows into reliable and steady location readings. The client software compares the list of observed access points along with their calculated signal strengths to weight the location of user to determine precise location of the device user. A variety of techniques are employed including simple signal strength weighted average models, nearest neighbor models combined with triangulation techniques and adaptive smoothing based on device velocity. Different algorithms perform better under different scenarios and tend to be used together in hybrid deployments to product the most accurate final readings. Preferred embodiments of the invention can use a number of positioning algorithms. The decision of which algorithm to use is driven by the number of access points observed and the user case application using it. The filtering models differ from traditional positioning systems since traditional systems rely on known reference points that never move. In the model of preferred embodiments, this assumption of fixed locations of access points is not made; the access points are not owned by the positioning system so they may move or be taken offline. The filtering techniques assume that some access points may no longer be located in the same place and could cause a bad location calculation. So the filtering algorithms attempt to isolate the access points that have moved since their position was recorded. The filters are dynamic and change based on the number of access points observed at that moment. The smoothing algorithms include simple position averaging as well as advanced Bayesian logic including Kalman filters. The velocity algorithms calculate device speed by estimating the Doppler effect from the signal strength observations of each access point.

Gathering of Scan Data to Build Reference Database

[0059] FIG. 2 depicts the components used to gather location information for the various access points. A large fleet of vehicles [201] is deployed to build the reference database (104 of FIG. 1) for the positioning system. These vehicles 201 follow a programmatic route through target scan areas to gather data in the most optimal fashion producing the highest quality data. The target scan areas typically represent a large metropolitan area including every single drivable street in 15-20 mile radius. These vehicles are equipped with scanning devices [202] designed to record the locations and characteristics of 802.11 signals while traversing the coverage area. The scanning devices track the location of the scanning vehicle every second using signal from GPS satellites [204]. The scanning device also tracks the presence of any 802.11 access point within range and records the radio characteristics of that access point signal along with the GPS location of the scanning vehicle. The quality of the data collected is greatly affected by the scanning methodology employed by the scanning vehicles. Each model has its own benefits and limitations. One approach, known as the Random Model, places scanning devices in vehicles as they are conducting daily activities for business or personal use. These vehicles could be delivery trucks, taxi cabs, traveling salesman or just hobbyists. The concept is that over time these vehicles will cover enough streets in their own random fashion in order to build a reliable reference database. The model does in fact provide a simple means to collect data but the quality of the resulting data is negatively affected due to issues of “arterial bias”. FIG. 3 describes the challenge of the random model. When scanning vehicles traverse routes designed to solve other problems than gathering data (e.g. delivering packages, people commuting to and from work) they tend to follow destination routes. A destination route is when a driver needs to get from A to B and seeks the fastest route to get there. So the driver looks for the shortest route to the nearest main artery whether it be a highway or a main thoroughfare. As a result, over time the random driving covers more and more ground by the cumulative coverage shows a bias to the main roads, or arteries at the expense of the smaller and surrounding roads. In FIG. 3, arteries [304] and [305] are heavily traversed by the scanning vehicles resulting in a healthy amount of scanning data for those streets. But streets [306] and [307] are rarely, if ever, covered because there is no frequent destination on those streets and the arteries are more optimal travel roads. The result is that access points [308] and [309] are not scanned at all by the scanning vehicles so the positioning system will struggle to identify a user who is traveling on streets [306] and [307]. The result is that when the system attempts to calculate the location of the access point from the scan data it is limited to a biased collection of input data. FIG. 11 shows the difference in resulting data quality. As the scanning vehicle drives near the Access Point [1101], it records a reading and its location continuously. The positioning system must then calculate the location of the Access Point [1102] using the entire set of observed data [1103]. In the Random Scanning model the set of data is limited to one main road passing by the access point. That forces the system to calculate the access point's location near that road rather than close to the access point itself.

[0060] Another approach is develop routing algorithms that include every single street in the target area so as to avoid arterial bias in the resulting collection of data thus producing a more reliable positioning system for the end users. FIG. 4 describes an optimized routing algorithm known as the Chinese Postman to calculate the most efficient driving route for covering every single street in a target area. The Chinese Postman routing algorithm is a known technique used by postal agencies, utilities and census agencies and is a variant of the Eulerian cycle problem. The Eulerian cycle is a problem asking for the shortest tour of a graph which visits each edge at least once. (See, e.g., Kwan, M. K. “Graphic Programming Using Odd or Even Points.” Chinese Math. 1, 273-277, 1962.) Preferred embodiments of the invention include a methodology for identifying a target region for coverage and then using the Chinese Postman routing algorithm for planning the vehicle route. The scanning vehicle [401] follows the optimal route according to the algorithm showing no bias to any street ensuring that all observable access points are detected and mapped by the system. So, by way of example, access points [408] and [409] are added to the access point database using the Chinese Postman model but would have been missed using the Random model. Referring back to FIG. 11, with the Chinese Postman Scanning model, the vehicle travels every single road getting as complete a set of scanning records [1106] for the Access Point [1104]. The system can then calculate the location [1105] of the access point with less error since it has a more uniform distribution of scan data for access point 1104 than for access 1102. So the Chinese Postman Scanning model not only gathers more access points uniformly across a target area but the resulting data produces more accurate calculations of access point locations.

[0061] Higher Quality AP Locations

[0062] Once collected (or partially collected), the scanning data is uploaded back to a central access point database (described later in this application) where it is processed. The raw observation points for each access point are used to reverse triangulate the actual physical location of the access points or create a power profile representing the radio propagation of that access point. In order to produce the most accurate calculated location for a particular access points or to create the most accurate power profile, the scanning vehicle must observe the access point from as many different angles as possible. In the random model [FIG. 3], many access points are observed from only one street forcing the system to calculate their location directly on the street [303]. These locations exhibit a directional bias and are significantly different than the actual locations of these access points [302]. Errors are introduced into a positioning system when its reference point locations are inaccurate. So in this positioning system, the accuracy of the access point locations play a large role in the accuracy of the end user positioning accuracy. Using the Chinese Postman model [FIG. 4] the scanning vehicles detect a particular access point from as many sides as possible of the building housing the access point. This additional data greatly improves the results of the reverse triangulation formula used to calculate the location of the access points [403]. More details on the access point location quality is described in connection with FIG. 11.

[0063] The scanning data collected from this system represents a reliable proxy for the signal propagation pattern for each access point in its specific environment. Every radio device and associated surrounding environment produces a unique signal fingerprint showing how far the signal reaches and how strong the signal is in various locations within the signal fingerprint. This fingerprint data is used in conjunction with the calculated access point location to drive high accuracy for the positioning system. This fingerprint is also known as a “power profile” since the signal strengths at each position is measured as signal power in watts. The positioning system can interpret the fingerprint data to indicate that a particular signal strength of an 802.11 access point radio is associated with a particular distance from that access point. Signal fingerprinting techniques are used in indoor Wi-Fi positioning but have proved difficult to replicate in the wider area outdoor environments because the difficulty associated with collecting the fingerprint data. When the fingerprints or power profiles of multiple access points are overlaid, the positioning system can determine a device location merely by finding the one position where the observed signal strengths match the combined fingerprints. Preferred embodiments of this invention provide a reliable system for obtaining this fingerprint data across a massive coverage area with millions of access points in order to utilize fingerprint-based positioning algorithms.

[0064] Reference Symmetry

[0065] Positioning systems typically work by having three or more reference points around the device being tracked. These positioning systems use the radio signals from these reference points in various ways to calculate the device's current location. Significant errors occur when there are an insufficient number of reference points or when the reference points lack balance or symmetry around the user. As illustrated in FIG. 5, the arterial bias that emerges from the random model introduces many scenarios where the end user [501] moves into physical areas in which there are only recorded access point locations [502] on one side of them. This lack of symmetry in the distribution of reference points around the end user causes the positioning algorithms to calculate the device location [503] with a great deal of error. With Chinese Postman model of scanning for access points, the user typically encounters a physical location [FIG. 6] in which there are numerous access point locations [602] on all sides of the user [601] within the range [604] of the device's 802.11 radio. The resulting position calculation [603] has reduced location bias and is more accurate as a result. FIG. 11 is another example showing the impact of quality location calculations.

[0066] Scanning Device

[0067] FIG. 7 depicts the details of a preferred embodiment of a scanning device 702 used to detect and identify the various Wi-Fi access points. A scanning vehicle [701] contains a scanning device [702] that continuously scans the airways for radio signals from GPS satellites [708] and 802.11 access points [707]. The scanning device runs the scanning client software [704] that controls the entire process. The scanning client activates both the GPS receiver [705] and the 802.11 radio [706]. The GPS receiver is set into a continuous reception mode calculating the geographic location of the device every second. That calculation is read by the scanning client and stored in the local data storage [703]. The scanning client initiates the 802.11 radio and begins sending out 802.11 probe requests using directional antennas [709]. Any 802.11 access point [707] within range of that probe request responds with a signal beacon as per the 802.11 protocol. The responding signal beacons contains the network name of the access point (known as an SSID), the MAC address of the access point device as well as other meta information about the access point. The responding signals reach each of the directional antennas with a different strength of signal based on the vector of origin and the proximity of the access point. That vector is recorded along with the identifier of that particular antenna and the meta information about the access point. This probe-receive-record process occurs continuously every tenth of a second. The scanning device deployed is a combination of the iPAQ 4155 Pocket PC and Powered GPS PDA Mount Cradle with integrated SiRF II type GPS receiver with XTrac v. 2.0 firmware.

[0068] The Scanning Client 704 of certain embodiments is described in connection with FIG. 10. The client consist of three main components, the Data Manager [1001], the System Manager [1002] and the Upload Manager [1003]. The Data Manager [1001] controls the operations of both the GPS radio [1006] and the 802.11 radio [1007]. The Data Manager controls when and how often these radios scan for signals and process those signals. The GPS radio once activated receives signals from GPS satellites [1004] and calculates its geographic location. The GPS recorder [1008] logs all of those readings every second and sends them to the File Manager [1010]. The Wi-Fi Recorder [1009] activates the 802.11 Radio to scan every tenth of a second, and associates those 802.11 readings with the GPS readings coming from the GPS radio and sends the resulting data to the File Manager. The File Manager receives scan data from both the GPS Recorder and Wi-Fi Recorder and creates storage files on the device. This process continues the entire time the device is operational and both radios are functioning

[0069] In the Upload Manager [1003] there is a Hotspot Detector [1017] that monitors the 802.11 scanning results to look for the configured network of public hotspots [1024] (e.g. T-mobile) that the device is authorized to access. Once it detects a valid Hotspot it notifies the user of its presence. The user can select to connect to the hotspot by activating the Create Connection component [1018]. This component associates with the hotspot's access point and creates an 802.11 connection. Then the Hotspot Authentication module [1019] supplies valid authentication information for the device. The hotspot validates the account and then provides network access to the device. The Upload Manager then initiates the Upload Server Authentication process [1020] to connect to the Central Network Server [1025] and provides valid authentication information. Once authenticated, the Upload & Data Verification module [1021] is initiated. This module retrieves the scan data from the Scanning Data store [1011] and uploads the data to the Central Network Server using FTP. The Central Network Server initiates a process to store all the data in the Central Access Point Database. After the upload is complete the upload process moves the scan data from the Scanning Data store [1011] to the Backup Data store [1012] on the device. Once the upload is completed and verified, the New Version module [1022] checks the Central Network Server to determine if there is a new version of the client software available for the device. If there is a new version, the software is downloaded and the New Version Installation [1023] process begins to upgrade the client software. Once the installation process is completed the connection with the Central Network Server is terminated, the connection with the hotspot is terminated and the device returns to normal scanning operation.

[0070] Included in the Scanning Client 704 are a set of utilities that help to manage the device and reduce system errors. The Radio Manager [1013] monitors the operation of the GPS Radio and the Wi-Fi Radio to make sure they are functioning properly. If the Radio Manager encounters a problem with one of the radios, it will restart the radio. The User Interface Controller [1014] presents the tools and updates to the user so they can operate the device effectively. The Error Handling and Logging [1015] records all system issues to the device and alerts the user so they can address. The System Restart module [1016] is called when issues cannot be resolved. This module shuts down the device and restarts the hardware, operating system and scanning client to ensure proper operation.

[0071] The 1/10 of a second 802.11 scanning interval was chosen since it provides the optimal scanning period for 802.11 under these conditions using off the shelf hardware. 802.11b/g/n operates using 14 channels of the unlicensed spectrum. An individual access point broadcasts its signal beacon over one of those channels at any given time. The scanning device needs to survey each channel in order to observe as many access points as possible. The scanning interval is correlated with the average speed of the scanning vehicle to optimize how the scanning client covers the frequency real estate of a particular region.

[0072] Central Network Server

[0073] With reference to FIG. 8, the fleet of vehicles perform their scanning routines while driving their pre-designed routes. Periodically each vehicle [801] will connect to an available 802.11 access point and authenticate with the Data Communications Module [807] of the Central Network Server. Typically the access points used for communicating with the Central Network Server are public hotspots like those operated by T-Mobile ensuring reliable and metered access. The provisioning of this connection could be done via any available public access point. The scanning vehicle stops at a nearby hotspot location and begins the process of connecting to the access point. Once authenticated, the scanning client [704] identifies all the recently collected scan data from the local storage [703] and uploads that data to the Central Network Database [802].

[0074] Once the data has been uploaded to the database, the Parser and Filter process [803] begins. The Parser and Filter process reads all of the upload scanning data and loads it up into the appropriate tables of the database. During this exercise the data is evaluated for quality issues. In some cases the GPS receiver may record erroneous or error records for some period of time, which could negatively affect the final access point location calculation. The parser and filter process identifies these bad records and either corrects them or removes them from the system. The filtering process users clustering techniques to weed out error prone GPS readings. For example, if 90% of the readings are within 200 meters of each other but the remaining 10% of the readings are 5 kilometers away then those outliers are removed by the filter and stored in a corrupted table of the database for further analysis. In particular, the system first calculates the weighted centroid for the access point using all reported data. It then determines the standard deviation based on the distribution of the reported locations. The system uses a definable threshold based on the sigma of this distribution to filter out access points that are in error. Once these error records are marked, the centroid is recalculated with the remaining location records to determine the final centroid using the Reverse Triangulation method described below.

[0075] Note that the error records may be the result of an access point that has moved. In this instance, the centroid for the access points will quickly “snap” to the new location based on the preponderance of records. An additional enhancement to the algorithm would include a weighting value based on the age of the records such that new records represent a more significant indication of the present location for a given access point.

[0076] Once the parsing process has been completed the central network system initiates the Reverse Triangulation model [804] begins processing the new data. During this process 1) new access points are added to the database and their physical location is calculated and 2) existing access points are repositioned based on any new data recorded by the scanners. The reverse triangulation algorithm factors in the number of records and their associated signal strengths to weight stronger signal readings more than weaker signals with a quasi weighted average model.

[0077] During data gathering, a WPS user is equipped with a Wi-Fi receiver device which measures Received Signal Strength (RSS) from all the available Wi-Fi access points, and then extracts location information of corresponding access points. The measured RSS value of access point i is denoted RSS_i.

[0078] If the corresponding recorded GPS location of access point i is denoted by {Lat_i, Long_i}, and the calculated access point location is denoted by {Lat_i, Long_i}, the triangulated position is found by applying the algorithm as follows:

[0079]

{Lat}_{u} = \frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}} {Lat}_{i}}{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}

{Long}_{u} = \frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}} {Long}_{i}}{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}

[0080] The quad root of power is selected to ease the implementation of the algorithm, since quad root is synonymous to taking two square roots.

[0081] The second point is referring to adjusting the dynamic range of coefficients. If the dynamic range of coefficients is a concern, the coefficient of the algorithm can be divided by a constant number, e.g.,

[0082]

{Lat}_{u} = \frac{\frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}{C} {Lat}_{i}}{\frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}{C}}

{Long}_{u} = \frac{\frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}{C} {Long}_{i}}{\frac{\sum_{i = 1}^{n} \sqrt[4]{10^{{RSS}_{i} / 10}}}{C}}

[0083] The Parameter C can be any number and it does not impact the results, theoretically. Since, the weighted average is based on the ratio of the coefficients and not the absolute value, theoretically, dividing all the coefficients by a constant value, C, does not impact the results, but it changes the dynamic range of the coefficient values.

[0084] This final {Lat_i, Long_i} is then used as the final centroid value for the location of that access point. The latitude and longitude will then be stored in the database including a timestamp to indicate the freshness of the triangulation calculation.

[0085] After the Central Network Database has been updated and each access point has been repositioned, the Data Pack Builder [805] creates subsets of the database based on regions of the country or world. The pack builder facilitates distribution of the database for a variety of use cases in which only region certain geographies are of interest. The pack builder is configured with region coordinates representing countries, time zones and metropolitan areas. Utilizing this technique a user can download just the location data for the west coast of the United States. The pack builder segments the data records and then compresses them.

[0086] The Fleet Management Module [806] helps operations personnel manage the scanning vehicles and ensure they are adhering the routing procedures. This module processes all the scan data and builds the location track for each vehicle in the system. The operations manager can create maps of the vehicle track using the Map Builder [808] to visually inspect the coverage for a particular region. The GPS tracking data from each device is reviewed with route mapping software to verify completion of coverage and to identify missed areas. This ability to audit and verify uniform coverage ensures that the system is getting the best data possible. The module also calculates the driving time of the vehicle to determine average speed and to subtract any idle time. These outputs are used to monitor efficiency of the overall system and in planning of future coverage.

Related Methods and Techniques

[0087] The techniques disclosed herein can be used with methods, systems, and devices described in related applications discussed below, all of which are incorporated by reference herein. As set forth above, embodiments of the invention select position estimation techniques based on the number of detected access points within range of the client device. Such techniques can include those set forth in U.S. patent application Ser. No. 11/430,222, entitled Estimation of Position Using WLAN Access Point Radio Propagation Characteristics In a WLAN Positioning System, filed on May 8, 2006, and U.S. patent application Ser. No. 11/774,392, entitled System and Method of Gathering WLAN Packet Samples to Improve Position Estimates Of WLAN Positioning Device, filed on Jul. 6, 2007. For example, those applications describe methods and systems for determining anticipated received signal strength readings for a given Wi-Fi Access Point depending on the client device's position relative to a particular Wi-Fi Access Point. In addition, those applications disclose techniques for improving the position estimates of a client device by evaluating multiple packet transmissions from a single access point.

[0088] While embodiments of the invention described herein are presented as useful for estimating the position of a user device, embodiments can also be used in combination with techniques disclosed in U.S. patent application Ser. No. 11/430,079, entitled Estimation Of Speed and Direction of Travel In A WLAN Positioning System, filed on May 8, 2006, U.S. patent application Ser. No. 11/696,832, entitled Time Difference of Arrival Based Estimation of Speed in a WLAN Positioning System, filed on Apr. 5, 2007, and U.S. patent application Ser. No. 11/696,833, entitled Time Difference of Arrival Based Estimation of Direction of Travel in a WLAN Positioning System, filed on Apr. 5, 2007. Those applications describe methods of determining the speed and direction of travel of the user device. As discussed in more detail below, techniques set forth in the present application describe methods of subdividing the collection of Wi-Fi Access Point information into subsets for use by a client device. The methods and systems for determining the speed and/or direction of travel of the client device in the above incorporated application can be used to prioritize which subsets of Wi-Fi Access Point information should be provided to the client device. For example, information about Wi-Fi Access Points in an area into which the client device is likely to arrive, based on the device's current speed and direction of travel, can be provided to the client device in advance of its arrival in that particular area.

[0089] In addition, access points in the database may move, or new access points may be detected in the area of interest by client devices. The information associated with such access points may be corrected or updated, or the access point information may be disregarded for location estimation purposes, according to the techniques disclosed in U.S. patent application Ser. No. 11/359,154, entitled Continuous Data Optimization of Existing Access Points In Positioning Systems, filed on Feb. 22, 2006. As described in greater detail below, aspects of the present invention include designating when information about a particular access point has been changed or updated. Thus, the techniques described in the above application can also be used in conjunction with these aspects. Similarly, embodiments described in U.S. patent application Ser. No. 11/678,301, entitled Methods and Systems For Estimating a User Position In a WLAN Position System Based On User Assigned Access Point Locations, filed on Feb. 23, 2007, can also be used in combination with the techniques discussed herein to estimate the position of the client device.

[0090] U.S. patent application Ser. No. 11/430,224, entitled Calculation of Quality of WLAN Access Point Characterization for Use In a WLAN Positioning System, filed on May 8, 2006, and U.S. patent application Ser. No. 11/625,450, entitled System and Method for Estimating Positioning Error within a WLAN Based Positioning System, filed on Jan. 22, 2007, disclose techniques for evaluating the quality of information about a given access point and for determining the positioning error associated with a given position estimation. These techniques can be used with embodiments of the present invention. For example, certain Wi-Fi Access Point information may not be provided to the client device because the information has been determined to be of low quality and, therefore, of low reliability for use in position estimation. Likewise, the error associated with a given position estimation can be a factor in determining what subset of access point information to provide to a client device.

[0091] The information about Wi-Fi Access Points may be encoded and compressed as set forth in U.S. patent application Ser. No. 11/365,540, entitled Encoding and Compressing a WiFi Access Point Database, filed on Mar. 1, 2006.

Efficient Management and Distribution of Wi-Fi Access Point Data

[0092] Preferred embodiments of the present invention also provide a system and a methodology for efficiently managing and distributing Wi-Fi location data among the various components of a Wi-Fi positioning system. In such embodiments, the client stores a cache of Wi-Fi access point data that it uses to locate itself. As mentioned above, Wi-Fi access point data is constantly changing as the access points themselves are activated, moved, and decommissioned. Client devices must be made aware of these changes in an efficient manner to ensure that the WPS functions at a high level of accuracy.

[0093] FIG. 12 depicts a common scenario of use for certain embodiments of the invention. A mobile user [1202], making use of a mobile device [1203], requires information related to the device's (i.e., the user's) current geographic location. A client device is generally a mobile computing device (e.g. a mobile phone) that is being operated by the mobile user. The client device is equipped with WPS client software [1204]. The WPS client software has the capability to operate autonomously or by communicating with a WPS server [1208].

[0094] The WPS client can also operate semi-autonomously by receiving Wi-Fi access point data from the server corresponding to a set of “tiles” that represent Wi-Fi data for a limited geographic area. This data is then stored locally on the client device in the Tile Store [1206], which the WPS client may then use to estimate its location autonomously.

[0095] The client may also be preinstalled with Wi-Fi data corresponding to a specified geographical region. The client may then use the database to update this preinstalled data, ensuring that its location estimates are based on the most current data.

[0096] WPS Tiles and TileIDs

[0097] The basic unit for access point information transfer between the Network Server [1208] and the Mobile Device [1203] is a Wireless Positioning Tile (WPS Tile). A WPS Tile (or simply a “tile”) is a geographically bounded subset of the Wi-Fi Access Point Location Database, that refers to a set of Wi-Fi access points that are within a bounded geographic region, defined by reference to latitude and longitude coordinates.

[0098] While the access point database may include elevation information, making it possible to locate client devices in three dimensions, the tiling system partitions the database using only the longitude and latitude dimensions. Since all Wi-Fi access points are relatively close to the ground, it is not necessary for the tiling system to take the elevation dimension into account, though elevation information may still be used in estimating the location of a client device.

[0099] Tiles have several properties that are necessary for creation, identification and maintenance. These properties include:

Stability—identifiers for tiles remain the same over time;

Divisibility—Tiles can be subdivided or recomposed as needed for storage space and density requirements;

Composability—Tiles can be composed into their parent tiles using reproducible identifiers. Child tiles can easily identify their parent tiles and vice versa; and

Universality—Tiles must be able to represent all geographic latitude and longitude coordinates within the coverage of the WPS system.

[0100] WPS Tiles are generated based on a method (described below) for dynamically subdividing the database based on the capacity and needs of a client device as well as the density of the Wi-Fi access points in a given geographic region. WPS Tiles are generated on the Central Server and distributed to Client Devices.

[0101] While a specific method of implementing tiles that satisfies this set of requirements is demonstrated in this document, there are a number of different algorithms which can be employed to achieve the same purpose. The present method represents only one of many possible embodiments of this aspect of the invention that satisfies the desired characteristics of stability, divisibility, composability, and universality.

[0102] A tile is referenced by a WPS Tile Identifier called a TileID. The TileIDs formed using the process described herein encode not only a latitude and a longitude but also the size minimum bounding rectangle (MBR) for the region of the corresponding tile by identifying the “level” of the corresponding tile. In this embodiment, tiles are arranged in a hierarchy, in which each tile has a prescribed “level”. A level-0 tile contains multiple level-1 tiles; a level-1 tile contains multiple level-2 tiles, etc. The method described herein stores and manipulates TileIDs in hexadecimal format, using the digits 0-9 and A-F.

[0103] Level-0 tiles (the largest WPS Tiles) are bounded by integer degree of latitude/longitude as illustrated in FIG. 20—i.e. each tile is a rectangle whose left and right sides represent exactly one degree of longitude and whose top and bottom sides represent exactly one degree of latitude. There are 180 degrees of longitude and 360 degrees of latitude; hence, there are 180*360=64,800 Level 0 Tile IDs in the world. Level 0 TileIDs are numbered from left to right (west to east) and bottom to top (south to north). The first level-0 tile, ordered by TileID, is at latitude −90 and longitude −180 [2001]. The last level-0 tile is at latitude 89 and longitude 179 [2004]. The formula for calculating Level-0 TileIDs given a latitude and longitude is:
Tile ID(lat,lon)=360*floor(90+lat)+floor(180+lon)

[0104] As described above and illustrated in FIG. 20, level-N tiles can be subdivided into multiple sub-tiles of level N+1. The particular implementation described herein divides level-N tiles into 16 (4×4) level-N+1 sub-tiles [2006]. Sub-tiles are numbered from left to right (west to east) and bottom to top (south to north), using the hexadecimal digits 0-9 and A-F. Sub-sub-tiles of sub-tiles are numbered by simply adding the appropriate hexadecimal digit to the Sub-tileID. For example, the TileID BAOC.76D refers to one of the 16 sub-tiles of the tile whose TileID is BAOC.76. Thus, the number of digits that appear after the “.” in the TileID is equal to the level of the corresponding tile.

[0105] Subdivision of each tile into 16 sub-tiles has several advantages. First, it provides for automatic decomposition of the tiles, allowing for a quick subdivision of the world into tiles with the desired average number of access points per tile. If, after more access points are activated, the density of access points per tile exceeds the maximum desired density, tiles at a higher level (i.e. smaller tiles) can be used. If enough access points are decommissioned to bring the number of access points below the minimum desired density, lower-level tiles (i.e. larger tiles) may be used. This gradual decomposition provides for a suitable distribution of the access point data set based on the variations in density of access points found throughout the world.

[0106] Second, the use of 16 sub-tiles per tile provides an encoding that is optimized for computer manipulation. Each of the 16 sub-tiles can be encoded in a single hexadecimal digit (0-F), optimized for binary encoding in as few as 4 bits. This encoding provides optimum efficiency in both storing and processing WPS TileIDs. Further, the encoding is such that the TileIDs of tiles at level N have one fewer hexadecimal digit than tiles at level N+1. Thus, the level of a tile is easily identifiable based on the number of digits in the corresponding TileID.

[0107] A further desirable property of the described TileID system is that when a first TileID is the prefix of a second TileID, the first tile contains the second tile. For example, the tile identified by TileID BAOC.76 contains all 16 sub-tiles that begin with the same prefix: BAOC.760, BAOC.761, . . . , BAOC.76F.

[0108] Each tile is also associated with version information that reflects the characteristics of the tile at each time the tile data was updated. This information may include: (i) the time the tile data was updated (i.e. the tile timestamp). This can be used to quickly determine whether the client has the latest tile data in its Tile Store; (ii) metrics indicating how often the environment within the tile changes, e.g. the rates at which new Wi-Fi access points enter the tile, leave the tile, or move within the tile. This can be used by the client to autonomously estimate the rate at which the tile data is aging; (iii) identifiers which compactly indicate the set of access points within the tile, e.g. Bloom Filters or other set encodings, or one-way hashes (such as MD5, SHA-1) of the MAC addresses and locations of the Wi-Fi access points. This can be used to determine the best method to update the client's cache, i.e. whether to incrementally update the tile data (see below), or to replace the tile data entirely with a new tile sent by the server.

[0109] The version information is used to ensure that the client does not use cached information that is out-of-date when estimating its location, and to facilitate the tile data transfer process. For a given tile in the Tile Store, the client may request that the server send the tile's version information. The version information returned by the server in combination with the version information on the client indicates whether new tile data must be loaded into the client, as well as the best method to use in performing the update. In one embodiment, if the timestamp information indicates that the tile data on the database server is newer than the tile data in the client's Tile Store, the client might update its cache by downloading the newer version from the database server. This process may be triggered periodically by the WPS Client Software, or as needed to satisfy a Location Request.

[0110] Although TileIDs may be trivially compared to determine which tiles are contained by other tiles, there may also be a need to determine the set of tiles adjacent to a given tile contained within the database server. Given that the adjacent tiles may be of an unknown and unbounded level, in some preferred embodiments of the tile database (either the server database or the client's Tile Store), there is no trivial way to make this determination. Some methods include: (i) searching for access points that are in the general vicinity of a tile, and retrieving the corresponding TileIDs; (ii) searching for tiles at higher levels, and incrementally expanding the search to tiles at higher levels; (iii) using a database with spatial indexing capabilities.

[0111] System Description

[0112] FIG. 13 illustrates the various components of one embodiment of the WPS Client software [1303] in more detail. The Location Request Manager (LRM) [1304] receives location requests from applications running on the client device. The LRM manages the tasks necessary to resolve the request, including initiating scans using the Scanner Module [1305], controlling the Data Communications Manager (DCM) [1306], and initiating location estimation using the Location Estimation Module (LEM) [1308]. The LRM is also responsible for coordinating the storage of cached Wi-Fi access point data using the Tile Manager [1307].

[0113] The 802.11 Scanner Module resides on the client device and manages the process of gathering information about the radio environment in which the client device operates. The scanner begins this process by directing the 802.11 network adapter to scan for all access points within range of the device. Access points that are within range respond to the scan by providing a unique identifier called a MAC address, according to the 802.11 protocol. Alternatively, the scanner can also operate in passive mode, relying on the default broadcast signal that is communicated by access points within range. The scanner records the identifier provided by each access point along with the strength of the signal received. The scanner then passes this information to the LEM, which compares the MAC address of each observed access point against the MAC addresses of the access points stored in the Tile Store [209]. The Tile Store returns the location data for each of the observed access points that are known to the system, which is then used by the Location Estimation Module (LEM) [208] to estimate the location of the mobile device.

[0114] The LEM is responsible for estimating the location of the client device based on the Wi-Fi access point information contained in the Tile Store. The required input consists of a set of Wi-Fi access points identified by their MAC address and their respective received signal strength information. Additional inputs may include previous location(s) of the client device, direction, velocity and other relevant data that may be available. Using this data, the LEM may estimate the location of the client device using any combination of the location algorithms presented earlier and incorporated herein by reference (see “Related Methods and Techniques,” supra).

[0115] The Data Communication Manager (DCM) [1306] is initiated by the Location Request Manager [1304] when there is insufficient local information necessary to resolve the location of the client device or when the local information is outdated. The DCM initiates communication with the Central Server using the Data Network Adapter [1310], providing to the server client attributes (e.g. client resource constraints), in addition to information gathered by the Scanner module. The Central Server will provide an initial location as well as a prioritized set of TileIDs corresponding to tiles which the server has determined to be appropriate for client-side location resolution. The DCM continues to communicate with the Central Server to retrieve the tiles in priority order as desired.

[0116] The Tile Manager [1307] is responsible for organizing, adding, removing, and accessing WPS Tiles that are kept in the Tile Store [1309]. The Tile Manager can determine if the local set of WPS Tiles are insufficient to resolve a location request and notifies the Location Request Manager that more tiles are required. The Tile Manager is also responsible for managing the resource utilization of the Client Device by removing outdated information as well as data that are not likely to be required in the near future for subsequent Location Requests. The Tile Manager can proactively request Tiles that may be necessary in future location requests based on gathered information such as the velocity and direction of the client travel, or based on information that is provided by the client application that initiated the Location Request.

[0117] One embodiment of the invention provides a method for incremental resolution of WPS Tiles. This process provides an initial set of access point location information that provides a lower accuracy location estimation, but accuracy improves as subsequent resolution levels are received from the server. This process can be used to provide high resolution near the projected location of the device, with lower resolution towards the extremities, thus reducing the amount of network transfer that is required to achieve initial location estimations with little loss in generality of the overall solution. Incremental resolution can be used within a single tile or amongst a set of tiles, e.g. the primary tile is retrieved at full resolution while secondary tiles are initially retrieved at a lower resolution.

[0118] In order to conserve memory on the client device, the Tile Manager may also remove tiles from the Tile Store that are no longer needed. A number of factors may be used in determining when a tile is no longer needed. In one embodiment, the Tile Manager uses a Least Recently Used algorithm to remove cached tiles that have remained unused for the longest time period. Other caching algorithms may be used to enhance and optimize the storage for particular applications. Additionally, tiles that are used frequently, such as the tile that contains the device owner's home address, may be “pinned” in the cache, indicating to the Tile Manager that they should not be removed. The speed and direction of the client device may also be used in determining when a tile is no longer needed. Also, geographic features such as roads may be used to predict which tiles will probably not be needed in the near future. In certain embodiments, the history of movement of a client device is recorded and this information is used to determine the likelihood that a given tile will be needed in the future.

[0119] The Data Network Adapter (DNA) [1310] provides a method for transmitting and receiving data between the client device and the Central Network Server. The DNA is generally a wireless network adapter but could under certain embodiments be a wired network adapter instead. The 802.11 network adapter used for scanning may double as the data network adapter in certain embodiments. The DCM determines the appropriate communications mechanism and manages the connection and data transfer between the client and the server.

[0120] FIG. 14 illustrates the various components of the WPS Network Server [1401] in more detail. The Network Server maintains the Master Wi-Fi Access Point Location Database [1406]. It is responsible for server-side location resolution as well as WPS Tile creation and distribution. The Network Server is the central managing component of the entire WPS system, coordinating the activities of the various client devices while maintaining the central radio beacon location database, optimizing data for distribution, and refreshing the database with new information related to the 802.11 access points.

[0121] The Wi-Fi location database [1406] resides on the Central Server and consists of geolocation information (e.g. latitude and longitude), confidence factors related to the accuracy of the location estimates of each of the known Wi-Fi access points, timestamps representing the time at which the various data were gathered, and TileID information used to uniquely identify each tile (as described in more detail below and illustrated in FIG. 20).

[0122] The Location Request Handler [1404] accepts requests from client devices for location resolution. This component will respond with location and/or WPS Tile information necessary to resolve the location request. While the Location Request Handler responds to requests for tile locations, the Tile Request Handler [1407] accepts requests from client devices for specific WPS Tiles. This component will respond with the requested WPS Tile if available. If a client requests a tile that is no longer valid, the server will respond with appropriate error information including the WPS Tile or Tiles that have replaced the requested WPS Tile.

[0123] The WPS Tile Generator [1408] is responsible for determining the proper polygonal size of each tile within the coverage area for the WPS system. The system calculates the density of the access points and subdivides the world on a geographic (latitude and longitudinal) basis, optimizing the polygons for storage size and Wi-Fi access point density.

[0124] Communication of WPS Tiles to the client is handled by the WPS Tile Distributor [1409]. After authenticating the request, the Distributor packages a given WPS Tile for distribution to the requesting WPS Client.

[0125] The Data Communications Manager (DCM) [1403] on the Network Server communicates with the DCM on the client WPS device. The two modules manage the authentication process and monitor the connection to ensure that data is transferred correctly over the network, validated and persisted on the local device.

[0126] Creating Tiles

[0127] FIG. 19 depicts the process by which appropriate tile sizes are generated and access points are assigned to a designated tile. The Network Server periodically determines which Tiles need adjusting [1901]. This is accomplished by identifying access points that have been added to the tile or removed from the tile, as well as those access points that have been moved within the tile. Identifying the Level 0 tile for each of these access points is simply a matter of truncating the latitude and longitude values for each access point and determining the distinct set of Level 0 tiles that result. For optimization, and to enable efficient determination of these tiles, the current implementation will modify an access point's TileID by setting it to null whenever an action is performed on that access point (e.g. the position of the AP is modified). This same process can be used to identify new Tiles [802] that now need to be created due to the movement or the addition of access points.

[0128] For each TileID as identified above, the algorithm recursively subdivides each tile until each tile has reached the desired density (e.g. number of access points within the bounds of the tile's geographic region) or until it has reached the maximum level of granularity (in the particular implementation that is described herein, tiles at level 4 represent the smallest tiles that are practically employed). For each of these optimal tiles, the access points within the MBR are assigned to the corresponding TileID.

[0129] In general, the desired average density of access points per tile is optimized to maximize efficiency and speed according to a specific embodiment. One preferred embodiment uses the density limit of 8000 access points per tile, which ensures encoded file size of around 50 KB per tile. If a level-N tile contains more than 8000 access points, the entire region is subdivided into tiles of level N+1. The minimum viable density is 1 AP per tile—level-0 tiles that contain no access points are simply ignored.

[0130] Some embodiments may use additional factors to determine the size of the WPS Tiles. For example, the tile size may be chosen according to the client device's movement history, its memory capacity, or the available network bandwidth.

[0131] Interaction Timeline

[0132] FIGS. 15 and 17 depict the operation of the client system. FIGS. 16 and 18 depict the operation of the server system. The following description refers to these diagrams and describes the interaction among the various system components.

[0133] First, a software application executing on a mobile device requests location information from the WPS system [1501]. The WPS System's Location Request executes a Client Scan [1503], gathering information about the Wi-Fi access points that can be received by the client device's 802.11 network adapter. The WPS client software first attempts to resolve the location of the device using WPS Tiles previously retrieved [1505][1506]. If the information is not present on the local device, the WPS client software continues. The WPS client software will make a request to the WPS Central Server via the Data Communications Manager and the Data Network Adapter to retrieve its current location and information regarding WPS Tiles that are necessary for subsequent location requests [1511][1512].

[0134] The Central Server receives the Tile Location request in the Data Communications Manager and hands the request to the Location Request Handler, which: (i) determines the location of the client [1603] using the list of access points that the client software has sent; (ii) determines the WPS Tile(s) necessary to resolve this and future location requests [1607]; and (iii) responds with the current location and a list of WPS Tiles and the timestamp of the most recent update to each WPS Tile through the Location Request Handler and the Data Communications Manager. Each tile in this list is assigned a priority estimate based on the likelihood that the client will need this tile to locate itself autonomously in the near future [1608].

[0135] More specifically, the tile that contains the estimated location of the WPS client device is assigned the highest priority, and the surrounding tiles are then assigned priority based on the probability that the client device will be in or near that tile in the future. The surrounding tiles are found by modifying the TileID of the central tile according to the TileID scheme presented above.

[0136] Also, the list of recommended TileIDs sent to the client may include more than just the tile in which the client device is located and the immediately surrounding tiles. The WPS software may make use of additional information, such as the velocity and bearing of the user device to preemptively request additional tile information. Additionally, the WPS software may make use of geographic attributes such as roads to more accurately predict the future position of the client device. The ability to proactively predict future locations increases the amount of time during which the client device will be able to function autonomously, and thereby reduces load on the network server and the communications network itself. The limitations of the client device, including memory capacity, battery life, and network speed and cost, may also be used to determine the list of TileIDs that are recommended by the server.

[0137] Each TileID in the list is associated with a priority, which may be determined according to a number of factors, including the location history of the client device, geographical features such as roads, the network bandwidth that is available, and the speed and direction of the user device. For example, if the client were traveling on a road that would not allow the client to travel to tile X before traveling to tile Y, tile Y may be assigned a higher priority than tile X.

[0138] The client WPS software examines the list of TileIDs provided by the server to determine which of the corresponding tiles are needed. This determination may also make use of information such as the velocity and bearing of the client, roads and other geographic attributes, and the physical limitations of the client device itself.

[0139] When the client has selected a set of TileIDs, it formats a request [1709] to the WPS Server for each of these tiles. The WPS Central Server authenticates each WPS Tile Request and generates the requested WPS Tile [1805] if necessary. The process of authentication ensures that unauthorized client devices cannot download tiles from the central server. For example, one embodiment of the tile fetching system operates over the HTTP protocol, and standard HTTP authentication schemes may be used to ensure that all client requests are transmitted by properly authorized clients.

[0140] The requested WPS Tile is then packaged [1804] and returned to the WPS Client. The WPS Tile Manager on the client device ensures that the new WPS Tile will fit within the available resources (e.g. memory or data storage) and removes old or non-essential WPS Tiles as necessary.

[0141] Example Intended Use

[0142] The following illustrates an example projected use of certain embodiments of the invention. In this example scenario, the user of a mobile device equipped with WPS software lives in a suburb of a city but works downtown. In the morning, the user asks the device (via a User Application such as navigation software) to determine the current location. This action triggers the WPS software to activate.

[0143] In this scenario, the User Application requests the location from the WPS Location Provider. The WPS Location Request Manager makes a request to the Client Device Location Estimation Module. If the LEM is unable to provide a location autonomously, the Location Request Manager passes control to the Data Communication Manager to request and retrieve location and WPS Tiles as necessary from the Central Server. The results of a Wi-Fi scan are passed to the server and the server responds with a list of recommended TileIDs that are prioritized according to the factors listed above. The client then sends a Tile Request for each of the TileIDs desired, and upon receiving a sufficient number of tiles from the Server, the Location Request Manager once again requests a location from the Location Estimation Module. This time, the necessary information is present on the local device, and the location of the client device is thereby determined.

[0144] As the person travels into the city, the device will move towards the boundary of the WPS Tiles that are stored on the client device. The WPS Client Software is able to calculate the boundaries of the cached region from the TileIDs of the cached tiles. When the estimated location of the client device is within a threshold distance of the cache boundaries, the Tile Manager will inform the Location Request Manager that additional tiles are required. This initiates another series of communications between the client Data Communication Module and the Central Server to retrieve additional tiles. This process repeats as needed based on the movements of the person and the constraints of the client device (such as storage and network capacity).

[0145] The threshold distance used to trigger the pre-fetching of additional tiles may depend on a variety of factors, including, e.g., the size of the relevant tiles, the memory capacity of the client device, and the estimated velocity of the user device. For example, if the client device is moving quickly toward a boundary, it is logical to request additional tiles sooner, to ensure that the user does not cross the boundary before the necessary tiles have been downloaded. When the client device is stationary, the need for additional tiles is less urgent, and the threshold distance might be correspondingly lower.

[0146] The client device may also proactively request tiles that may not be of immediate use. This act of pre-fetching can depend on a number of factors such as the size of current tiles, the memory capacity of the client device, the estimated velocity of the user device, and the bandwidth of the network connection to the server. For example, a large number of tiles may be pre-fetched when a high-capacity network is present, to reduce the cost and improve the execution speed when the device must connect to the server over a more limited network. Additional factors may also be used for pre-fetching, including geographical features like roads, the history of movement of the client device, the required accuracy of the user application, and physical constraints such as bridges and mode of transportation.

[0147] It will be appreciated that the scope of the present invention is not limited to the above described embodiments, but rather is defined by the appended claims; and that these claims will encompass modifications of and improvements to what has been described.

Claims

What is claimed is:

1. A method of selecting and providing, to at least one mobile client device, a subset of WiFi access point information to be used to estimate a position of the mobile client device, the method comprising:

providing access to a reference database of Wi-Fi access point information recorded in a non-transitory computer-readable medium and containing information about Wi-Fi access points within a target region;

providing a set of geographical regions, each geographical region being a subdivision of the target region, and each geographical region containing a plurality of the Wi-Fi access points;

selecting at least one geographical region from the set of geographical regions;

selecting from the reference database a subset of Wi-Fi access points that are contained in the at least one selected geographic region; and

providing to the mobile client device information from said reference database about the subset of Wi-Fi access points that are located within the at least one selected geographical region, the information including identifiers for corresponding Wi-Fi access points in the at least one selected geographical region and including estimated geographic locations of the corresponding Wi-Fi access points so the mobile client device may subsequently estimate its position using the estimated geographic location of at least one of the Wi-Fi access points in the at least one geographical region.

2. The method according to claim 1 further including partitioning the target region into the set of geographical regions according to a prearranged scheme.

3. The method according to claim 2 wherein the prearranged partitioning scheme divides the target area into a set of geometrically similar, polygonal tiles.

4. The method according to claim 3 wherein the polygonal tiles form a hierarchy in which smaller tiles are nested within larger tiles.

5. The method according to claim 3 further including selecting a maximum number of WiFi access points that may be contained within a single polygonal tile, and choosing the size of the polygonal tiles such that no tile contains more than said maximum.

6. The method according to claim 3 that further includes storing, for each of the polygonal tiles, a time of a most recent update to reference database records corresponding to Wi-Fi access points within the tile, and using the time of the most recent update to determine whether the Wi-Fi access point data stored on the client device is up-to-date.

7. The method according to claim 1 further including estimating the speed and direction of the client device, and using said estimates in selecting the at least one selected geographical region.

8. The method according to claim 1 further including predicting a route along which the client device is traveling, and using this predicted route in selecting the at least one selected geographical region.

9. The method according to claim 1 wherein the client device has allocated a limited amount of memory for storing Wi-Fi access point data, and the at least one selected geographical region is selected according to the amount of memory that has been allocated by the client device.

10. The method according to claim 1 wherein the transfer of information between the client device and the access point reference database may not exceed a certain maximum speed, and the at least one selected geographical region is selected according to this maximum speed of communication between the client device and the reference database.

11. The method according to claim 1 wherein the estimation of the location of the mobile client device is performed by the mobile client device.

12. The method according to claim 1 wherein the mobile client device is equipped with information about an initial set of Wi-Fi access points that are located within a specified geographical region.

13. The method according to claim 1 further comprising:

extracting information from signals from at least one Wi-Fi access point currently in range of the mobile client device and detected by the mobile client device identifying the at least one Wi-Fi access point;

wherein the selection of the at least one selected geographical region is based on the at least one identified Wi-Fi access point.

14. The method according to claim 1 further comprising:

estimating the location of the mobile client device;

wherein the selection of the at least one selected geographical region is based on the estimated location of the mobile client device.

15. The method according to claim 14, the estimating the location of the mobile client device including:

identifying at least one Wi-Fi access point that is currently within range of the client device and detected by the mobile client device;

obtaining Wi-Fi access point information for the identified Wi-Fi access points; and

estimating the location of the mobile client device using the obtained information.

16. The method of claim 1, further comprising determining the set of geographical regions by subdividing at least a portion of the target region, the subdividing being based on criteria independent of the coverage area of Wi-Fi access points.

17. The method of claim 1, further comprising determining the set of geographical regions by subdividing at least a portion of the target region, the subdividing being based on at least one of a density of Wi-Fi access points in the geographical regions, a total number of WiFi access points in the geographical regions, a memory capacity of the mobile client device, and a mode of communication of the mobile client device.

Patent Citations (313)

Patent	Date	Inventor	Cited By
US3881060(A)	1975-04-01	Connell et al.	Applicant
US4310726(A)	1982-01-01	Asmuth	Applicant
US4415771(A)	1983-11-01	Martinez	Applicant
US4757267(A)	1988-07-01	Riskin	Applicant
US4924491(A)	1990-05-01	Compton et al.	Applicant
US4991176(A)	1991-02-01	Dahbura et al.	Applicant
US5043736(A)	1991-08-01	Darnell et al.	Applicant
US5095505(A)	1992-03-01	Finucane et al.	Applicant
US5119504(A)	1992-06-01	Durboraw, III	Applicant
US5161180(A)	1992-11-01	Chavous	Applicant
US5235630(A)	1993-08-01	Moody et al.	Applicant
US5235633(A)	1993-08-01	Dennison et al.	Applicant
US5315636(A)	1994-05-01	Patel	Applicant
US5334974(A)	1994-08-01	Simms et al.	Applicant
US5353023(A)	1994-10-01	Mitsugi	Applicant
US5379337(A)	1995-01-01	Castillo et al.	Applicant
US5389935(A)	1995-02-01	Drouault et al.	Applicant
US5414432(A)	1995-05-01	Penny, Jr. et al.	Applicant
US5564121(A)	1996-10-01	Chow et al.	Applicant
US5832381(A)	1998-11-01	Kauppi	Applicant
US5940825(A)	1999-08-01	Castelli et al.	Applicant
US5946615(A)	1999-08-01	Holmes et al.	Applicant
US6134448(A)	2000-10-01	Shoji et al.	Applicant
US6192312(B1)	2001-02-01	Hummelsheim	Applicant
US6246884(B1)	2001-06-01	Karmi et al.	Applicant
US6249252(B1)	2001-06-01	Dupray	Applicant
US6262741(B1)	2001-07-01	Davies	Applicant
US6272405(B1)	2001-08-01	Kubota et al.	Applicant
US6393294(B1)	2002-05-01	Perez-Breva et al.	Applicant
US6438491(B1)	2002-08-01	Farmer	Applicant
US6484034(B1)	2002-11-01	Tsunehara et al.	Applicant
US6556943(B2)	2003-04-01	Kuwahara et al.	Applicant
US6625647(B1)	2003-09-01	Barrick, Jr. et al.	Applicant
US6664925(B1)	2003-12-01	Moore et al.	Applicant
US6665658(B1)	2003-12-01	DaCosta et al.	Applicant
US6674403(B2)	2004-01-01	Gray et al.	Applicant
US6678611(B2)	2004-01-01	Khavakh et al.	Applicant
US6741188(B1)	2004-05-01	Miller et al.	Applicant
US6754488(B1)	2004-06-01	Won et al.	Applicant
US6757518(B2)	2004-06-01	Spratt et al.	Applicant
US6789102(B2)	2004-09-01	Gotou et al.	Applicant
US6799049(B1)	2004-09-01	Zellner et al.	Applicant
US6862524(B1)	2005-03-01	Nagda et al.	Applicant
US6888811(B2)	2005-05-01	Eaton et al.	Applicant
US6915123(B1)	2005-07-01	Daudelin et al.	Applicant
US6915128(B1)	2005-07-01	Oh	Applicant
US6946950(B1)	2005-09-01	Ueno et al.	Applicant
US6956527(B2)	2005-10-01	Rogers et al.	Applicant
US6978023(B2)	2005-12-01	Dacosta	Applicant
US6990351(B2)	2006-01-01	Tsunehara et al.	Applicant
US6990428(B1)	2006-01-01	Kaiser et al.	Applicant
US7042391(B2)	2006-05-01	Meunier et al.	Applicant
US7046657(B2)	2006-05-01	Harrington et al.	Applicant
US7086089(B2)	2006-08-01	Hrastar et al.	Applicant
US7116988(B2)	2006-10-01	Dietrich et al.	Applicant
US7120449(B1)	2006-10-01	Muhonen et al.	Applicant
US7123928(B2)	2006-10-01	Moeglein et al.	Applicant
US7130642(B2)	2006-10-01	Lin	Applicant
US7130646(B2)	2006-10-01	Wang	Applicant
US7155239(B2)	2006-12-01	Zeng et al.	Applicant
US7167715(B2)	2007-01-01	Stanforth	Applicant
US7167716(B2)	2007-01-01	Kim et al.	Applicant
US7197556(B1)	2007-03-01	Short et al.	Applicant
US7206294(B2)	2007-04-01	Garahi et al.	Applicant
US7242950(B2)	2007-07-01	Suryanarayana et al.	Applicant
US7250907(B2)	2007-07-01	Krumm et al.	Applicant
US7254405(B2)	2007-08-01	Lin et al.	Applicant
US7257411(B2)	2007-08-01	Gwon et al.	Applicant
US7269427(B2)	2007-09-01	Hoctor et al.	Applicant
US7271765(B2)	2007-09-01	Stilp et al.	Applicant
US7277404(B2)	2007-10-01	Tanzella et al.	Applicant
US7299058(B2)	2007-11-01	Ogino	Applicant
US7305245(B2)	2007-12-01	Alizadeh-Shabdiz et al.	Applicant
US7317914(B2)	2008-01-01	Adya et al.	Applicant
US7319878(B2)	2008-01-01	Sheynblat et al.	Applicant
US7323991(B1)	2008-01-01	Eckert et al.	Applicant
US7333816(B2)	2008-02-01	Filizola et al.	Applicant
US7373154(B2)	2008-05-01	Sharony et al.	Applicant
US7389114(B2)	2008-06-01	Ju et al.	Applicant
US7397424(B2)	2008-07-01	Houri	Applicant
US7403762(B2)	2008-07-01	Morgan et al.	Applicant
US7412246(B2)	2008-08-01	Lewis et al.	Applicant
US7414988(B2)	2008-08-01	Jones et al.	Applicant
US7417961(B2)	2008-08-01	Lau	Applicant
US7426197(B2)	2008-09-01	Schotten et al.	Applicant
US7433673(B1)	2008-10-01	Everson et al.	Applicant
US7433694(B2)	2008-10-01	Morgan et al.	Applicant
US7433696(B2)	2008-10-01	Dietrich et al.	Applicant
US7440755(B2)	2008-10-01	Balachandran et al.	Applicant
US7471954(B2)	2008-12-01	Brachet et al.	Applicant
US7474897(B2)	2009-01-01	Morgan et al.	Applicant
US7474988(B2)	2009-01-01	Kamisuwa et al.	Applicant
US7492315(B2)	2009-02-01	Verechtchiagine	Applicant
US7493127(B2)	2009-02-01	Morgan et al.	Applicant
US7502620(B2)	2009-03-01	Morgan et al.	Applicant
US7515578(B2)	2009-04-01	Alizadeh-Shabdiz et al.	Applicant
US7519372(B2)	2009-04-01	MacDonald et al.	Applicant
US7522908(B2)	2009-04-01	Hrastar	Applicant
US7525484(B2)	2009-04-01	Dupray et al.	Applicant
US7551579(B2)	2009-06-01	Alizadeh-Shabdiz et al.	Applicant
US7551929(B2)	2009-06-01	Alizadeh-Shabdiz et al.	Applicant
US7616965(B2)	2009-11-01	Rudravaram et al.	Applicant
US7636576(B1)	2009-12-01	Pfister et al.	Applicant
US7672675(B2)	2010-03-01	Pande et al.	Applicant
US7706814(B2)	2010-04-01	Sillasto et al.	Applicant
US7764231(B1)	2010-07-01	Karr et al.	Applicant
US7768963(B2)	2010-08-01	Alizadeh-Shabdiz	Applicant
US7769396(B2)	2010-08-01	Alizadeh-Shabdiz et al.	Applicant
US7800533(B2)	2010-09-01	Harper et al.	Applicant
US7818017(B2)	2010-10-01	Alizadeh-Shabdiz et al.	Applicant
US7835754(B2)	2010-11-01	Alizadeh-Shabdiz et al.	Applicant
US7853250(B2)	2010-12-01	Harvey et al.	Applicant
US7856209(B1)	2010-12-01	Rawat	Applicant
US7856234(B2)	2010-12-01	Alizadeh-Shabdiz et al.	Applicant
US7873368(B2)	2011-01-01	Goren	Applicant
US7916661(B2)	2011-03-01	Alizadeh-Shabdiz et al.	Applicant
US7948433(B2)	2011-05-01	Seatovic et al.	Applicant
US8014788(B2)	2011-09-01	Alizadeh-Shabdiz et al.	Applicant
US8090386(B2)	2012-01-01	Alizadeh-Shabdiz et al.	Applicant
US8106828(B1)	2012-01-01	Do et al.	Applicant
US8121609(B2)	2012-02-01	Bosnjakovic et al.	Applicant
US8130148(B2)	2012-03-01	Alizadeh-Shabdiz	Applicant
US8144673(B2)	2012-03-01	Alizadeh-Shabdiz	Applicant
US8185129(B2)	2012-05-01	Alizadeh-Shabdiz	Applicant
US8229455(B2)	2012-07-01	Alizadeh-Shabdiz	Applicant
US8244272(B2)	2012-08-01	Morgan et al.	Applicant
US8315233(B2)	2012-11-01	Alizadeh-Shabdiz	Applicant
US8340685(B2)	2012-12-01	Cochran et al.	Applicant
US8369264(B2)	2013-02-01	Brachet et al.	Applicant
US2001/0022558(A1)	2001-09-01	Karr et al.	Applicant
US2001/0053999(A1)	2001-12-01	Feinberg	Applicant
US2002/0055956(A1)	2002-05-01	Krasnoiarov et al.	Applicant
US2002/0080063(A1)	2002-06-01	Bloebaum et al.	Applicant
US2002/0154056(A1)	2002-10-01	Gaal et al.	Applicant
US2002/0173317(A1)	2002-11-01	Nykanen et al.	Applicant
US2002/0184331(A1)	2002-12-01	Blight et al.	Applicant
US2003/0008668(A1)	2003-01-01	Perez-Breva et al.	Applicant
US2003/0028319(A1)	2003-02-01	Khavakh et al.	Applicant
US2003/0043073(A1)	2003-03-01	Gray et al.	Applicant
US2003/0069024(A1)	2003-04-01	Kennedy	Applicant
US2003/0087647(A1)	2003-05-01	Hurst	Applicant
US2003/0098811(A1)	2003-05-01	Nikolai et al.	Applicant
US2003/0114206(A1)	2003-06-01	Timothy et al.	Applicant
US2003/0125045(A1)	2003-07-01	Riley et al.	Applicant
US2003/0146835(A1)	2003-08-01	Carter	Applicant
US2003/0186679(A1)	2003-10-01	Challener	Applicant
US2003/0225893(A1)	2003-12-01	Roese et al.	Applicant
US2004/0019679(A1)	2004-01-01	E et al.	Applicant
US2004/0039520(A1)	2004-02-01	Khavakh et al.	Applicant
US2004/0058640(A1)	2004-03-01	Root et al.	Applicant
US2004/0068364(A1)	2004-04-01	Zhao et al.	Applicant
US2004/0072577(A1)	2004-04-01	Myllymaki et al.	Applicant
US2004/0081133(A1)	2004-04-01	Smavatkul et al.	Applicant
US2004/0087317(A1)	2004-05-01	Caci	Applicant
US2004/0102192(A1)	2004-05-01	Serceki	Applicant
US2004/0124977(A1)	2004-07-01	Biffar	Applicant
US2004/0157624(A1)	2004-08-01	Hrastar	Applicant
US2004/0162896(A1)	2004-08-01	Cen et al.	Applicant
US2004/0193367(A1)	2004-09-01	Cline	Applicant
US2004/0203847(A1)	2004-10-01	Knauerhase et al.	Applicant
US2004/0203904(A1)	2004-10-01	Gwon et al.	Applicant
US2004/0204063(A1)	2004-10-01	Van Erlach	Applicant
US2004/0205234(A1)	2004-10-01	Barrack et al.	Applicant
US2004/0248589(A1)	2004-12-01	Gwon et al.	Applicant
US2004/0263388(A1)	2004-12-01	Krumm et al.	Applicant
US2005/0020266(A1)	2005-01-01	Backes et al.	Applicant
US2005/0021781(A1)	2005-01-01	Sunder et al.	Applicant
US2005/0037775(A1)	2005-02-01	Moeglein et al.	Applicant
US2005/0043040(A1)	2005-02-01	Contractor	Applicant
US2005/0055374(A1)	2005-03-01	Sato	Applicant
US2005/0105600(A1)	2005-05-01	Culum et al.	Applicant
US2005/0108306(A1)	2005-05-01	Martizano Catalasan	Applicant
US2005/0136845(A1)	2005-06-01	Masuoka et al.	Applicant
US2005/0164710(A1)	2005-07-01	Beuck	Applicant
US2005/0192024(A1)	2005-09-01	Sheynblat	Applicant
US2005/0227711(A1)	2005-10-01	Orwant et al.	Applicant
US2005/0232189(A1)	2005-10-01	Loushine	Applicant
US2005/0251326(A1)	2005-11-01	Reeves	Applicant
US2006/0002326(A1)	2006-01-01	Vesuna	Applicant
US2006/0009235(A1)	2006-01-01	Sheynblat et al.	Applicant
US2006/0040640(A1)	2006-02-01	Thompson et al.	Applicant
US2006/0046709(A1)	2006-03-01	Krumm et al.	Applicant
US2006/0058957(A1)	2006-03-01	Hickenlooper et al.	Applicant
US2006/0058958(A1)	2006-03-01	Galbreath et al.	Applicant
US2006/0061476(A1)	2006-03-01	Patil et al.	Applicant
US2006/0078122(A1)	2006-04-01	Dacosta	Applicant
US2006/0089157(A1)	2006-04-01	Casey et al.	Applicant
US2006/0089160(A1)	2006-04-01	Othmer	Applicant
US2006/0092015(A1)	2006-05-01	Agrawal et al.	Applicant
US2006/0095348(A1)	2006-05-01	Jones et al.	Applicant
US2006/0095349(A1)	2006-05-01	Morgan et al.	Applicant
US2006/0106850(A1)	2006-05-01	Morgan et al.	Applicant
US2006/0128397(A1)	2006-06-01	Choti et al.	Applicant
US2006/0193258(A1)	2006-08-01	Ballai	Applicant
US2006/0194568(A1)	2006-08-01	Sharony	Applicant
US2006/0197704(A1)	2006-09-01	Luzzatto et al.	Applicant
US2006/0200843(A1)	2006-09-01	Morgan et al.	Applicant
US2006/0217131(A1)	2006-09-01	Alizadeh-Shabdiz et al.	Applicant
US2006/0221918(A1)	2006-10-01	Wang	Applicant
US2006/0240840(A1)	2006-10-01	Morgan et al.	Applicant
US2006/0270421(A1)	2006-11-01	Phillips et al.	Applicant
US2006/0293064(A1)	2006-12-01	Robertson et al.	Applicant
US2007/0004427(A1)	2007-01-01	Morgan et al.	Applicant
US2007/0004428(A1)	2007-01-01	Morgan et al.	Applicant
US2007/0077945(A1)	2007-04-01	Sheynblat	Applicant
US2007/0097511(A1)	2007-05-01	Das et al.	Applicant
US2007/0100955(A1)	2007-05-01	Bodner	Applicant
US2007/0110053(A1)	2007-05-01	Soni et al.	Applicant
US2007/0121560(A1)	2007-05-01	Edge	Applicant
US2007/0126635(A1)	2007-06-01	Houri	Applicant
US2007/0149240(A1)	2007-06-01	Brok	Applicant
US2007/0150516(A1)	2007-06-01	Morgan et al.	Applicant
US2007/0178911(A1)	2007-08-01	Baumeister et al.	Applicant
US2007/0184846(A1)	2007-08-01	Horton et al.	Applicant
US2007/0210961(A1)	2007-09-01	Romijn	Applicant
US2007/0232892(A1)	2007-10-01	Hirota	Applicant
US2007/0258420(A1)	2007-11-01	Alizadeh-Shabdiz et al.	Applicant
US2007/0270157(A1)	2007-11-01	Kim et al.	Applicant
US2008/0004888(A1)	2008-01-01	Davis et al.	Applicant
US2008/0008117(A1)	2008-01-01	Alizadeh-Shabdiz	Applicant
US2008/0008121(A1)	2008-01-01	Alizadeh-Shabdiz	Applicant
US2008/0033646(A1)	2008-02-01	Morgan et al.	Applicant
US2008/0045234(A1)	2008-02-01	Reed	Applicant
US2008/0108371(A1)	2008-05-01	Alizadeh-Shabdiz et al.	Applicant
US2008/0132170(A1)	2008-06-01	Alizadeh-Shabdiz et al.	Applicant
US2008/0133124(A1)	2008-06-01	Sarkeshik	Applicant
US2008/0133336(A1)	2008-06-01	Altman et al.	Applicant
US2008/0139217(A1)	2008-06-01	Alizadeh-Shabdiz et al.	Applicant
US2008/0139219(A1)	2008-06-01	Boeiro et al.	Applicant
US2008/0176583(A1)	2008-07-01	Brachet et al.	Applicant
US2008/0188242(A1)	2008-08-01	Carlson et al.	Applicant
US2008/0248741(A1)	2008-10-01	Alizadeh-Shabdiz	Applicant
US2008/0248808(A1)	2008-10-01	Alizadeh-Shabdiz	Applicant
US2008/0261622(A1)	2008-10-01	Lee et al.	Applicant
US2008/0274752(A1)	2008-11-01	Houri	Applicant
US2008/0288493(A1)	2008-11-01	Yang et al.	Applicant
US2009/0017841(A1)	2009-01-01	Lewis et al.	Applicant
US2009/0075672(A1)	2009-03-01	Jones et al.	Applicant
US2009/0147767(A1)	2009-06-01	Lee	Applicant
US2009/0149197(A1)	2009-06-01	Morgan et al.	Applicant
US2009/0175189(A1)	2009-07-01	Alizadeh-Shabdiz et al.	Applicant
US2009/0252138(A1)	2009-10-01	Alizadeh-Shabdiz et al.	Applicant
US2009/0286504(A1)	2009-11-01	Krasner et al.	Applicant
US2009/0286549(A1)	2009-11-01	Canon et al.	Applicant
US2009/0303112(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303113(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303114(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303115(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303119(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303120(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0303121(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0310585(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0312035(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2009/0312036(A1)	2009-12-01	Alizadeh-Shabdiz	Applicant
US2010/0052983(A1)	2010-03-01	Alizadeh-Shabdiz	Applicant
US2011/0012780(A1)	2011-01-01	Alizadeh-Shabdiz	Applicant
US2011/0012784(A1)	2011-01-01	Alizadeh-Shabdiz	Applicant
US2011/0021207(A1)	2011-01-01	Morgan et al.	Applicant
US2011/0034179(A1)	2011-02-01	David et al.	Applicant
US2011/0035420(A1)	2011-02-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0045840(A1)	2011-02-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0058495(A1)	2011-03-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0074626(A1)	2011-03-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0080317(A1)	2011-04-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0080318(A1)	2011-04-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0080841(A1)	2011-04-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0084881(A1)	2011-04-01	Fischer	Applicant
US2011/0164522(A1)	2011-07-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0176494(A1)	2011-07-01	Huang et al.	Applicant
US2011/0235532(A1)	2011-09-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0235623(A1)	2011-09-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0287783(A1)	2011-11-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0298659(A1)	2011-12-01	Alizadeh-Shabdiz	Applicant
US2011/0298660(A1)	2011-12-01	Alizadeh-Shabdiz	Applicant
US2011/0298663(A1)	2011-12-01	Alizadeh-Shabdiz	Applicant
US2011/0298664(A1)	2011-12-01	Alizadeh-Shabdiz	Applicant
US2011/0306357(A1)	2011-12-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0306358(A1)	2011-12-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0306359(A1)	2011-12-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0306360(A1)	2011-12-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0306361(A1)	2011-12-01	Alizadeh-Shabdiz et al.	Applicant
US2011/0317579(A1)	2011-12-01	Jones et al.	Applicant
US2012/0007775(A1)	2012-01-01	Alizadeh-Shabdiz	Applicant
US2012/0071175(A1)	2012-03-01	Skibiski et al.	Applicant
US2012/0100872(A1)	2012-04-01	Alizadeh-Shabdiz et al.	Applicant
US2012/0108260(A1)	2012-05-01	Alizadeh-Shabdiz	Applicant
US2012/0112958(A1)	2012-05-01	Alizadeh-Shabdiz et al.	Applicant
US2012/0178477(A1)	2012-07-01	Morgan et al.	Applicant
US2012/0196621(A1)	2012-08-01	Alizadeh-Shabdiz et al.	Applicant
US2012/0280866(A1)	2012-11-01	Alizadeh-Shabdiz	Applicant
US2012/0284118(A1)	2012-11-01	Mamich, Jr. et al.	Applicant
US2012/0309420(A1)	2012-12-01	Morgan et al.	Applicant
US2013/0072227(A1)	2013-03-01	Morgan et al.	Applicant
CA2056203	1992-07-01		Applicant
EP493896	1992-08-01		Applicant
EP1359714	2003-11-01		Applicant
JP3-235562	1991-10-01		Applicant
JP4-035345	1992-02-01		Applicant
JP2-107443	2002-04-01		Applicant
JP2-223218	2002-08-01		Applicant
JP3-198571	2003-07-01		Applicant
JP5-291793	2005-10-01		Applicant
WO-03/021851	2003-03-01		Applicant
WO-2004/002185	2003-12-01		Applicant
WO-2004036240	2004-04-01		Applicant
WO-2005/004527	2005-01-01		Applicant
WO-2006096416(A2)	2006-09-01		Applicant
WO-2006/110181	2006-10-01		Applicant
WO-2007081356	2007-07-01		Applicant
WO-2007101107	2007-09-01		Applicant
WO-2009086278(A1)	2009-07-01		Applicant
WO-2011119575	2011-09-01		Applicant
WO-2011156549	2011-12-01		Applicant

Non-Patent Literature (134)

“Terminal Equipment and Protocols for Telematic Services: Information Technology-Digital Compression and Coding of Continuous-Tome Still Images—Requirements and Guidelines,” International Telecommunication Union, Sep. 1992, 186 pages.Applicant
Castro, “A Probabilistic Room Location Service for Wireless Networked Environments,” Ubicomp 2001: Ubiquitous Computing, International Conference, Atlanta, Georgia, Sep. 30-Oct. 2, 2001, Proceedings, 10 pages.Applicant
Curran, et al., “Pinpointing Users with Location Estimation Techniques and Wi-Fi Hotspot Technology,” International Journal of Network Management, 2008, DOI: 10.1002/nem.683, 15 pages.Applicant
Griswold et al., “ActiveCampus—Sustaining Educational Communities through Mobile Technology.” UCSD CSE Technical Report #CS200-0714, 2002, 19 pages.Applicant
Griswold et al., “ActiveCampus: Experiments in Community-Oriented Ubiquitous Computing,” IEEE, Oct. 2004, pp. 73-81.Applicant
Hazas et al., “Location-Aware Computing Comes of Age,” IEEE, vol. 37, Feb. 2004, 3 pages.Applicant
Hellebrandt, et al., “Estimating Position and Velocity of Mobiles in a Cellular Radio Network,” IEEE Transactions on Vehicular Technology, vol. 46, No. 1, Feb. 1997, pp. 65-71.Applicant
International Search Report and Written Opinion of the International Searching Authority, The United States Patent and Trademark Office, for International Application No. PCT/US2006/06041, dated Nov. 16, 2007, 4 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, The United States Patent and Trademark Office, for International Application No. PCT/US2008/058345, dated Jun. 30, 2008, 7 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, The United States Patent and Trademark Office, for International Application No. PCT/US2010/045438, dated Oct. 6, 2010, 9 pages.Applicant
International Search Report and Written Opinion of the Searching Authority, the United States Patent and Trademark Office, for International Patent Application No. PCT/US08/87969, mailed Mar. 10, 2009, 7 pages.Applicant
International Search Report and Written Opinion of the Searching Authority, the United States Patent and Trademark Office, for International Application No. PCT/US2006/045327, dated Jun. 24, 2008, 6 pages.Applicant
International Search Report and Written Opinion of the Searching Authority, the United States Patent and Trademark Office, for International Application No. PCT/US05/39208, mailed Jan. 29, 2008, 4 pages.Applicant
Zhou, R. “Wireless Indoor Tracking System (WITS),” Jul. 2006, retrieved on May 11, 2011 from the internet: <URLhttp://www.ks.uni-freiburg.de/assist/rui/index.php?page=publications>, entire document, 15 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, the United States Patent and Trademark Office, for International Application No. PCT/US2011/029379, dated Jun. 1, 2011, 15 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, the United States Patent and Trademark Office, for International Application No. PCT/US2011/039717, dated Dec. 20, 2011, 13 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, the United States Patent and Trademark Office, for International Application No. PCT/US07/62721, mailed Nov. 9, 2007, 8 pages.Applicant
International Search Report and Written Opinion of the International Searching Authority, the United States Patent and Trademark Office, for PCT/US2006/07299, dated Feb. 11, 2008, 7 pages.Applicant
Kawabata, et al., “Estimating Velocity Using Diversity Reception,” IEEE, 1994, 4 pages.Applicant
Kim, et al., “Risks of Using AP Locations Discovered through War Driving,” Lecture Notes in Computer Science, vol. 3968, 2006, 15 pages.Applicant
Kirsner, “One More Way to Find Yourself,” The Boston Globe, May 23, 2005, retrieved from www.boston.com, 2 pages.Applicant
Krumm, et al., “LOCADIO: Inferring Motion and Location from Wi-Fi Signal Strengths,” Mobiquitous 2004, First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, Aug. 22-26, 2004, 10 pages.Applicant
Kwan, “Graphic Programming Using Odd or Even Points,” Chinese Mathematics, vol. 1, No. 3, 1962, Translation of ACTA Mathematica Sinica, 10, No. 3, 1960, 7 pages.Applicant
LaMarca, et al., “Place Lab: Device Positioning Using Radio Beacons in the Wild,” Intel Corporation, 2004, 18 pages.Applicant
LaMarca, et al., “Self-Mapping in 802.11 Location Systems,” Ubicomp 2005: Ubiquitous Computing, Aug. 23, 2005, pp. 87-104.Applicant
Muthukrishnan, et al., “Towards Smart Surroundings: Enabling Techniques and Technologies for Localization,” Lecture Notes in Computer Science, vol. 3479, May 2005, 11 pages.Applicant
Schilit, et al., “Challenge: Ubiquitous Location-Aware Computing and the ”Place Lab“ Initiative,” WMASH'03, Sep. 2003, San Diego, CA, 7 pages.Applicant
Supplementary European Search Report for European Application No. 07757413, dated Apr. 6, 2010, 10 pages.Applicant
Weisstein, Eric W., “Chinese Postman Problem,” Mathword—A Wolfram Web Resource, retrieved from http://mathworld.wolfram.com/ChinesePostmanProblem.html, 2010, 1 page.Applicant
Wikipedia entry for “Huffman coding,” http://en.wikipedia.org/wiki/Huffman—coding, 2006. 10 pgs.Applicant
Wikipedia entry for “Delta Encoding,” http://en.wikipedia.org/wiki/Delta—coding, 2006 (5 pgs.).Applicant
Adelstein, Frank, et al., “Physically Locating Wireless Intruders,” Journal of Universal Computer Science, vol. 11, No. 1, Jan. 28, 2005, pp. 1-16.Applicant
Algorithms, “Eulerian Cycle/Chinese Postman,” http://www.2.toki.or.id/bookl AlqDesignManual/BOOKIBOOK4/NODE165.HTM, Jun. 2, 1997, pp. 1-4.Applicant
Ambrosch, Wolf-Dietrich et al., “The Intelligent Network: A Joint Study by Bell Atlantic, IBM and Siemens, Chapter 9. ERS Service Description”, 1989, pp. 162-177.Applicant
“A Practical Approach to Identifying and Tracking Unauthorized 802.11 Cards and Access Points,” Interlink Networks, Inc., 2002, pp. 1-20.Applicant
Bahl, Paramvir et al. “RADAR: An In-Building RF-based User Location and Tracking System”, Microsoft Research, 2000, pp. 1-10.Applicant
Bahl, Paramvir et al. “A Software System for Locating Mobile Users: Design, Evaluation, and Lessons”, Microsoft Research, University of California at San Diego, 2000, pp. 1-13.Applicant
Balachandran, Anand, et al., “Wireless Hotspots: Current Challenges and Future Directions,” WMASH'03, San Diego, California, ACM, Sep. 19, 2003, pp. 1-9.Applicant
Battiti, Roberto, et al., “Wireless LANs: From WarChalking to Open Access Networks,” Mobile Networks and Applications 10, Springer Science + Business Media, Inc., The Netherlands, Jun. 2005, pp. 275-287.Applicant
“Best Practices for Hunting Down & Terminating Rogue Wireless LANs (WLANs),” AirDefense, Inc., 2004, pp. 1-7.Applicant
Bhasker, Ezekiel S. et al. “Employing User Feedback for Fast, Accurate, Low-Maintenance Geolocationing”, Department of Computer Science and Engineering, University of California, San Diego, 2004, pp. 1-10.Applicant
Bjorndahl, Per, et al. “CME20—A Total Solution for GSM Networks”, Ericsson Review No. 3, Jun. 1991, pp. 72-79.Applicant
“Bluesoft, Inc.'s Aeroscout,” Bluesoft, Inc., available at least as early as Aug. 2003, 1 page.Applicant
Bogue, Robert L., “Using NetStumbler and MiniStumbler to find Rogue Access Points on Wireless Networks,” CIO Top 50 6th Annual Event 2012, Oct. 3, 2012, pp. 1-5.Applicant
Brackenridge, Eloise, “The New Urban Infrastructure: Cities and Telecommunications”, University of Texas at Austin, Center for Research on Communication, Technology and Society, 1990, pp. 77-100.Applicant
Branch, Joel W., et al., “Automatic 802.11 Wireless LAN Security Auditing,” Making Wireless Works, IEEE Security & Privacy, May-Jun. 2004, pp. 1-10.Applicant
Buccafurno, Mary, “The Philadelphia Story”, TE&M Special Report 911, Dec. 15, 1987, pp. 68-72.Applicant
Byers, Simon, et al., “802.11B Access Point Mapping,” Communications of the ACM, vol. 46, No. 5, ACM, May 2003, pp. 41-46.Applicant
“California Legislature Senate Committee on Energy and Public Utilities and Joint Committee on Fire, Police, Emergency and Disaster Services, Joint Interim Hearing on the 911 Emergency Response System—An Overview of its Effectiveness,” Los Angeles California, Nov. 21, 1990, pp. 1-107.Applicant
Capkun, Srdjan, et al., “GPS-free Positioning in Mobile Ad Hoc Networks,” Cluster Computing 5, Kluwer Academic Publishers, The Netherlands, 2002, pp. 1-11.Applicant
Cellison, “Exploiting and Protecting 802.11b Wireless Networks,” ExtremeTech, Sep. 4, 2001, pp. 1-8.Applicant
Chawathe, Yatin et al., “A Case Study in Building Layered DHT Applications”, Intel Research Seattle, University of California, San Diego, Intel Research Berkeley, ICSI, 2005, pp. 1-15.Applicant
Cheng , Yu-Chung et al., “Accuracy Characterization for Metropolitan-scale Wi-Fi Localization” University of California, San Diego; Intel Research Seattle; Microsoft Corporation, 2005, pp. 1-13.Applicant
Connelly, Kay et al., “A Toolkit for Automatically Construction Outdoor Radio Maps” Proceedings of the Intl. Conference on Information Technology, Coding and Computing, Apr. 2005, pp. 1-7.Applicant
Crow, Owen, “Auditing for Rogue Wireless Access Points in a Large Corporate Campus,” Global Information Assurance Certification Paper, Copyright SANS Institute, Sep. 18, 2003, pp. 1-21.Applicant
Dayharsh , Thomas et al., “Update on the National Emergency No. 911”, IEEE Transactions on Vehicular Technology, vol. VT-28, No. 4, Nov 1979, pp. 1-6.Applicant
Delong, Edgar S. Jr. “Making 911 even better” Telephony Integrating Voice and Data Communications, An Intertec Publication, Dec. 14, 1987, pp. 60-63.Applicant
Denigris, Ernest, et al. “Enhanced 911: emergency calling with a plus” Bell Laboratories Record, Mar. 1980, pp. 74-79.Applicant
“Distributed Wireless Security Auditor,” IBM Research and the IBM PC Division, http://www.research.ibm.com/gsal/dwsa, retrieved on Nov. 12, 2012, pp. 1-3.Applicant
Eckerson, Wayne, “Users test toll-free net access options”, Management Strategies, Network World, Dec. 30, 1991-Jan. 6, 1992, pp. 17-18.Applicant
“Ekahau, Ekahau Client 3.0 ” available at least as early as Oct. 2003, pp. 1-6.Applicant
“Ekahau, Ekahau Positioning Engine 2.1,” available at least as early as Oct. 2003, pp. 1-9.Applicant
“Ekahau, Ekahau Site Survey 1.0,” available at least as early as Oct. 2003, pp. 1-4.Applicant
“Ekahau Positioning Engine 2.0: 802.11-based Wireless LAN Positioning System,” An Ekahau Technology Document, Ekahau, Inc., Nov. 2002, pp. 1-19.Applicant
Elnahrawy, Eiman, et al. “Using Areabased Presentations and Metrics for Localization Systems in Wireless LANs” Proceedings of the 29th Annual IEEE Intl. Conference on Local Computer Networks, IEEE Computer Society Press LCN'04, Nov. 2004, pp. 1-9.Applicant
European Search Report and Written Opinion for EP12172473.6-2412, dated Nov. 19, 2012, 17 pages.Applicant
Supplementary European Search Report, European Application No. 08866698.7-1857 / 2235980, PCT/US2008/087969, Applicant: Skyhook Wireless, Inc., Date of Mailing: Jul. 17, 2014, pp. 1-6.Applicant
Etter, Andrew, “A Guide to Wardriving and Detecting Wardrivers,” SANS Institute InfoSec Reading Room, Copyright SANS Institute, 2002, pp. 1-16.Applicant
Foust, Robert, “Identifying and Tracking Unauthorized 802.11 Cards and Access Points, ” LOGIN: The Magazine of Usenix & Sage, vol. 27, No. 4, Aug. 2002, pp. 1-13.Applicant
Frederickson, Greg N., “Approximation Algorithms for Some Postman Problems,” Journal of the Association for Computing Machinery, vol. 26, No. 3, Jul. 1979, pp. 538-554.Applicant
“GPSdrive,” man2html, http://www.gpsdrive.sourceforge.net/gpsdrive—manual-en.html, Sep. 3, 2009, pp. 1-13.Applicant
Harvey, Dean et al. “Call Center Solutions” Intelligent Networking: Business Communications Systems, AT&T Technical Journal, vol. 70, No. 5, Sep./Oct. 1991, pp. 1-11.Applicant
Hatami, Ahmad et al. “A Comparative Performance Evaluation of RSS-Based Positioning Algorithms Used in WLAN Networks” 2005 IEEE Wireless Communications and Networking Conference, I EEE Communications Society, WCNC vol. 4, Mar. 13-17, 2005, pp. 1-8.Applicant
Head, Charles, “Intelligent Network: A Distributed System” IEEE Communications Magazine, Dec. 1988, pp. 16-20.Applicant
Henderson, Tristan, et al., “The Changing Usage of a Mature Campus-wide Wireless Network,” ACM, MobiCom '04, Philadelphia, Pennsylvania, USA, Sep. 26-Oct. 1, 2004, pp. 1-15.Applicant
Hightower, Jeffrey et al., “A Survey and Taxonomy of Location Systems for Ubiquitous Computing”, University of Washington, Aug. 24, 2001, pp. 1-29.Applicant
Hightower, Jeffrey, et al., “Location Sensing Techniques,” University of Washington, Computer Science and Engineering, Jul. 30, 2011, pp. 1-8.Applicant
Hightower, Jeffrey, et al., “The Location Stack,” Intel Research, Intel Corporation, Jul. 2003, pp. 1-13.Applicant
Hoeschen, “NetStumbler.org Forums: Calculate AP Physical Location,” phpBB Group, Mar. 5, 2004, pp. 1-8.Applicant
Honig, William et al. “The Realities of Service Creation on Switching Systems Through Attached Processors” XII International Switching Symposium, vol. VI, May 27-Jun. 1,1990, pp. 51-54.Applicant
Hong, Jason, et al., “Privacy and Client-based Discovery Location,” Computer Science Division, University of California, Berkeley, http://www.cs.cmu.edu/˜jasonh/publications/puc2004-placelab.pdf, 2004, pp. 1-10.Applicant
Hong, Jason I., et al., “Privacy and Security in the Location-enhanced World Wide Web,” In Proceedings of the Workshop on Privacy at Ubicomp, Oct. 2003, pp. 1-5.Applicant
Hunter, Paul, “The Sources of Innovation in New Jersey Bell Switching Services,” Master of Science Thesis, Massachusetts Institute of Technology, Jun. 1991, pp. 1-105.Applicant
Hurley, Chris et al., “War Driving Drive, Detect, Defend a Guide to Wireless Security”, Syngress Publishing, Inc., 2004, pp. 1-515.Applicant
“Implementing 9-1-1 Systems in Texas: Legal and Institutional Background” Texas Advisory Commission on Intergovernmental Relations, Jun. 1998, pp. 1-61.Applicant
“Indoor Radio Propagation,” Spread Spectrum Scene, SSS Online, Inc., http://www.sss-mag.com/indoor.html, Dec. 10, 1998, pp. 1-7.Applicant
Jin, Ming-Hui et al., “802.11-based Positioning System for Context Aware Applications” GLOBECOM, IEEE 2003, 2003, pp. 1-5.Applicant
Kang, Jong Hee et al. “Extracting Places from Traces of Locations” Dept. of Computer Science and Engineering, University of Washington, WMASH '04, Oct. 1, 2004, pp. 110-118.Applicant
Kent, C. A. et al., “Position Estimation of Access Points in 802.11 Wireless Network” Lawrence Livermore National Laboratory, Jan. 21, 2004, pp. 1-10.Applicant
Kirtner, Jody L., M. A., et al., “The Application of Land Use/Land Cover Data to Wireless Communication System Design,” EDX Engineering, Inc., http://proceedings.esri.com/library/userconf/proc98/PROCEED/TO550/PAP525/P525.HTM, 1998, pp. 1-16.Applicant
“Kismet,” Kismet Wirelss, Inc., http://www.kismetwirelss.net/documentaion.shtml, retrieved on Nov. 11, 2012, pp. 1-47.Applicant
Komar, Can, et al., “Location Tracking and Location Based Service Using IEEE 802.11 WLAN Infrastructure,” European Wireless 2004, Barcelona Spain, Feb. 24-27, 2004, pp. 1-7.Applicant
Krumm, John et al. “The NearMe Wireless Proximity Server” UbiComp 2004, LNCS 3205, 2004, pp. 283-300.Applicant
Kucan, Berislav, “WarDriving: Drive, Detect, Defend, A Guide to Wireless Security,” Help Net Security, Oct. 12, 2004, pp. 1-3.Applicant
Kwan, Robert K., “Globalstar: Linking the World via Mobile Connections”, IEEE Intl Symposium on Personal, Indoor & Mobile Radio Communications, Sep. 24-25, 1991, pp. 318-323.Applicant
Lackey, Dr. Joshua, Phd. et al. “Wireless Intrusion Detection,” IBM Global Services, IBM Corporation, Apr. 2003, pp. 1-16.Applicant
Lamarca, Anthony, et al., “Finding Yourself: Experimental Location Technology Relies on Wi-Fi and Cellphone Signals Instead of Orbiting Satellites,” Resources, IEEE Spectrum, Dec. 2004, pp. 1-3.Applicant
Lamarca, Anthony, et al., “Place Lab: Bootstrapping Where-ware,” http://www.powershow.com/view/aae05-ZGI1Y/Place—Lab—Bootstrapping—Whereware—powerpoint—ppt—presentation, 2003, pp. 1-19.Applicant
Lamarca, Anthony et al., “Place Lab: Device Positioning Using Radio Beacons in the Wild” Pervasive 2005, LNCS 3468, co. 116-133, 2005, pp. 1-18.Applicant
Lamarca, A., et al., “Place Lab: Device Positioning Using Radio Beacons in the Wild,” Pervasive Computing, Intel Corporation, Oct. 2004, pp. 116-133.Applicant
Lamarca, Anthony, et al., “Place Lab's First Step: A Location-Enhanced Conference Guide,” Demonstration at UbiComp 2003, Oct. 2003, pp. 1-3.Applicant
Leslie, David, “Rouge Wireless Access Point Detection and Remediation,” SANS GSEC (v 1.4) Option 1, Global Information Assurance Certification Paper, Copyright SANS Institute, Sep. 9, 2004, pp. 1-15.Applicant
Letchner, Julia, et al., “Large-Scale Localization from Wireless Signal Strength,” Proc. of the National Conference on Artificial Intelligence (AAAI), American Association for Artificial Intelligence, Jul. 2005, pp. 1-6.Applicant
“LocalePoints,” Newbury Networks, available at least as early as Oct. 2004, 1 page.Applicant
LocaleServer, Newbury Networks, available at least as early as Oct. 2004, 1 page.Applicant
Lorinez, Konrad et al., “MoteTrack: A Robust, Decentralized Approach to RFBased Location Tracking” LoCA 2005, LNCS 3479, May 2005, pp. 63-82.Applicant
Mallinder, Bernard J.T., “The Final Countdown to GSM”, 1991 Pan European Digital Cellular Radio Conference, Acropolis Conference Center, Nice, France, Feb. 5, 1991, pp. 1-12.Applicant
Milner, Marius, “NetStumbler v0.4.0 Release Notes,” http://www.netstumbler.org/netstumbler-faqs/official-netstumbler-0-4-0-readme-t10366.html, Apr. 21, 2004, pp. 1-10.Applicant
Myllymaki, Jussi, et al., “Location Aggregation from Multiple Sources,” Mobile Data Management, 2002 Proceedings, Third International Conference, IEEE, Jan. 8-11, 2002, pp. 1-8.Applicant
“PanGo Mobile Applications Suite,” Pango, available at least as early as Aug. 2003, pp. 1-2.Applicant
“PanGo Proximity Platform,” Pango, available at least as early as Oct. 2003, pp. 1-2.Applicant
Papadimitriou, Christos H., “On the Complexity of Edge Traversing,” Journal of the Association for Computing Machinery, vol. 23, No. 3, Jul. 1976, pp. 544-554.Applicant
Raniwala, Ashish, et al., “Deployment Issues in Enterprise Wireless LANs,” Department of Computer Science, Stony Brook University, Mar. 31, 2009, pp. 1-36.Applicant
Robinson, Michael et al. “Received Signal Strength Based Location Estimation of a Wireless Lan Client” 2005 IEEE Wireless Communications and Networking Conference, IEEE Communications Society, WCNC vol. 4, Mar. 13-17 2005, pp. 1-6.Applicant
Russell, Dr. Steve, “Detecting and Locating Rogue Access Points,” CprE 537, Spring 2003, Apr. 28, 2003, pp. 1-40.Applicant
Saha, Siddhartha et al. “Location Determination of a Mobile Device Using IEEE 802.11b Access Point Signals” 2003 IEEE Wireless Communications and Networking Conference, IEEE Communications Society, Mar. 16-20, 2003, pp. 1987-1992.Applicant
Schilit, Bill N. et al., “Bootstrapping the Location-enhanced Word Wide Web” Intel Research Seattle; University of Washington; University of California at San Diego; University of California at Berkeley , 2003, pp. 1-4.Applicant
Schilit, Bill, Location Enhanced Web Services, “Computer Science & Engineering Colloquium Series,” Intel Research, Seattle, transcript by Henderson Legal Services, Inc., 2003, pp. 1-58.Applicant
Shih, Johnny, “Wireless LAN Location System,” School of Information Technology and Electrical Engineering, The University of Queensland, Nov. 21, 2003, pp. 1-98.Applicant
Shipley, Peter, “802.11b War Driving and LAN Jacking”, DEFCON 9 Conference, Las Vegas, Nevada, USA, Jul. 13-15, 2001, pp. 1-39.Applicant
Shipley, Peter, “Open WLANs the early results of war Driving” DEFCON9 Conference 802.11 b War Driving Presentation, Jul. 13, 2001, pp. 1-49.Applicant
Small, Jason, et al., “Determining User Location for Context Aware Computing Through the Use of a Wireless LAN Infrastructure,” submitted for publication to ACM Mobile Networks and Applications, vol. 6, 2001, pp. 1-8.Applicant
Spielman, Sue and Philip Brittan, “Java and GIS, Part 1: Intro to GIS,” Feb. 16, 2004, pp. 1-4.Applicant
Spielman, Sue and Simon Brown, “Java and GIS, Part 2: Mobile LBS,” Apr. 1, 2004, pp. 1-6.Applicant
Sterling, David et al. “The Iridium System—A Revolutionary satellite Communications System Developed with Innovative Applications of Technology”, IEEE Communications Society, MILCOM '91,1991, pp. 0436-0440.Applicant
Stone, Anthony, “Kismet & GPSdrive: Wireless Network Sniffing with Open Source Software,” UKUUG Leeds, 2004, pp. 1-32.Applicant
Taheri, Ali, et al. Location Fingerprinting on Infrastructure 802.11 Wireless Local Area Networks (WLANs) using Locus, 29th Conference on Local Computer Networks, IEEE Communications Society, Nov. 16-18, 2004, pp. 1-9.Applicant
Torrone, Phillip, “How-To Tuesday: War Kayaking,” Engadget, AOL, Inc., http://www.engadget.com/2004/06/22/how-to-Tuesday-war-kayaking/, Jun. 22, 2004, pp. 1-5.Applicant
Wallace, Bob, “Domino's delivers using new call routing service” Network World, vol. 8, No. 32, Aug. 12, 1991, pp. 1-2.Applicant
Wang, Yufei, et al., “Two New Algorithms for Indoor Wireless Positioning System (WPS),” Proceedings of the 17th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS 2004), Long Beach, CA, Sep. 2004, pp. 1-8.Applicant
“Wardriving as a Proxy for Wi-Fi GPS Location” Netstumbler Blog Posting, http://www.netstumbler.org/news/wardriving-as-a-proxy-for-wi-fi-gps-locationt10762.html, May 2004, pp. 1-7.Applicant
Welch, Colonel Donald J., Ph.D., et al., “A Survey of 802.11a Wireless Security Threats and Security Mechanisms,” A Technical Report to the Army G6, Technical Report ITOC-TR-2003-101, Unclassified, Information Technology and Operations Center, Department of Electrical Engineering and Computer Science, United States Military Academy, West Point, New York, 2003, pp. 1-20.Applicant
Workman, Alexandra et. al. “International Applications of AT&T's Intelligent Network Platforms”, AT&T Technical Journal, 1991, vol. 70, No. 34, 1991, pp. 4-57.Applicant
Zobel, D.J., Memorandum of Decision, United States District Court District of Massachusetts, Civil Action No. 10-11S71-RWZ, Skyhook Wireless, Inc. v. Google, Inc., Sep. 14, 2012.Applicant

Abstract