US 8,630,664 B2Grant

Access point database

Issue Date:2014-01-14

•29 Claims

•12 Drawing Sheets

Abstract

A location beacon database and server, method of building location beacon database, and location based service using same. Wi-Fi access points are located in a target geographical area to build a reference database of locations of Wi-Fi access points. At least one vehicle is deployed including at least one scanning device having a GPS device and a Wi-Fi radio device and including a Wi-Fi antenna system. The target area is traversed in a programmatic route to avoid arterial bias. The programmatic route includes substantially all drivable streets in the target geographical area and solves an Eulerian cycle problem of a graph represented by said drivable streets. While traversing the target area, periodically receive the GPS coordinates of the GPS device. While traversing the target area, detecting Wi-Fi signals from Wi-Fi access points in range of the Wi-Fi device and recording identity information of the detected Wi-Fi access point in conjunction with GPS location information of the vehicle when the detection of the Wi-Fi access point was made. The location information is used to reverse triangulate the position of the detected Wi-Fi access point; and the position of the detected access point is recorded in a reference database.

Metadata

Assignee

Skyhook Wireless, Inc.

Inventors

Farshid Alizadeh-Shabdiz
Russel K. Jones
Edward J. Morgan
Michael G. Shean

Application Information

Application Number:US 12/907,825

Filing Date:2010-10-19

Priority Date:2004-10-29

Art Unit:2642

Classifications

IPC:

H04W24/00

Patent Drawings (12 sheets)

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application is a continuation of U.S. patent application Ser. No. 11/950,242, filed Dec. 4, 2007, issuing as U.S. Pat. No. 7,818,017; which is a continuation of U.S. patent application Ser. No. 11/261,988, filed Oct. 28, 2005; which claims the benefit of the priority of U.S. Prov. App. 60/623,108, filed Oct. 29, 2004; all of which are incorporated by reference herein in their entirety for all purposes.

[0002] This application is related to the following U.S. Patent Applications:

[0003] U.S. patent application Ser. No. 11/261,848, filed Oct. 28, 2005, entitled Location Beacon Database;
[0004] U.S. patent application Ser. No. 11/261,898, filed Oct. 28, 2005, entitled Server for Updating Location Beacon Database;
[0005] U.S. patent application Ser. No. 11/261,987, filed Oct. 28, 2005, entitled Method and System for Building a Location Beacon Database; and

BACKGROUND

[0006] 1. Field of the Invention

[0007] The invention generally related to location-base services and, more specifically, to methods and systems of determining locations of Wi-Fi access points and using such information to locate a Wi-Fi-enabled device.

[0008] 2. Discussion of Related Art

[0009] 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/seek 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 the individual to know their own current location or that of someone else. To date, we all rely on asking for directions, calling someone to ask their whereabouts or having workers check-in from time to time with their position.

[0010] Location-based services are an emerging area of mobile applications that leverages the ability of new 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 approaches has its strengths and weaknesses based on the radio technology and the positioning algorithms they employ.

[0011] 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 that signal to reach 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 received with little or no interference. Weather, buildings or structures and foliage can cause interference 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.

[0012] 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.

[0013] 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.

[0014] 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, Maria Lijding, Paul Havinga, Towards Smart Surroundings: Enabling Techniques and Technologies for Localization, Lecture Notes in Computer Science, Volume 3479, Jan 2Hazas, M., Scott, J., Krumm, J.: Location-Aware Computing Comes of Age. IEEE Computer, 37(2):95-97, February 2004 005, Pa005, Pages 350-362.) 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.

[0015] Microsoft Corporation and Intel Corporation (via a research group known as PlaceLab) have deployed a Wi-Fi Location system using the 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.) Examples include WiGLE, Wi-FiMaps.com, Netstumbler.com and NodeDB. Both Microsoft and Intel have developed their own client software that utilizes this public wardriving data as reference locations. Because individuals voluntarily supply the data the systems suffer a number of performance and reliability problems. First, the data across the databases are not contemporaneous; some of the data is new while other portions are 3-4 years old. The age of the access point location is important since over time access points can be moved or taken offline. Second, the data is 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. Third, the user-supplied data suffers 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 traffic areas. Arterial bias causes a resulting location pull towards main arteries regardless of where the user is currently located causing 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 many access points are indicated as being located far from their actual locations including some access points being incorrectly indicated as if they were located in bodies of water.

[0016] There have been a number of commercial offerings of Wi-Fi location systems targeted at indoor positioning. (See, e.g., Kavitha Muthukrishnan, Maria Lijding, Paul Havinga, Towards Smart Surroundings: Enabling Techniques and Technologies for Localization, Lecture Notes in Computer Science, Volume 3479, Jan 2Hazas, M., Scott, J., Krumm, J.: Location-Aware Computing Comes of Age. IEEE Computer, 37(2):95-97, February 2004 005, Pa005, Pages 350-362.) 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.

[0017] There are numerous 802.11 location scanning clients available that record the presence of 802.11 signals along with a GPS location reading. These software applications are operated manually and produce a log file of the readings. Examples of these 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 all done manually. These application do not perform any calculation as to the physical location of the access point, they merely mark the location from which the access point was detected.

[0018] Performance and reliability of the underlying positioning system are the key drivers to the successful deployment of any location based service. Performance refers to the accuracy levels that the system achieves for that given use case. Reliability refers to the percentage of time that the desired performance levels are achieved.

[0019]


Performance	Reliability


Local Search/Advertising	<100	meters	85% of the time
E911	<150	meters	95% of the time
Turn-by-turn driving	10-20	meters	95% of the time
directions
Gaming	<50	meters	90% of the time
Friend finders	<500	meters	80% of the time
Fleet management	<10	meters	95% of the time
Indoor asset tracking	<3	meters	95% of the time

SUMMARY

[0020] The invention provides a location beacon database and server, method of building location beacon database, and location based service using same.

[0021] Under another aspect of the invention, a user-device having a Wi-Fi radio may be located. A reference database of calculated locations of Wi-Fi access points in a target area is provided. In response to a user application request to determine a location of a user-device having a Wi-Fi radio, the Wi-Fi device is triggered to transmit a request to all Wi-Fi access points within range of the Wi-Fi device. Messages are received from the Wi-Fi access points within range of the Wi-Fi device, each message identifying the Wi-Fi access point sending the message. The signal strength of the messages received by the Wi-Fi access points is calculated. The reference database is accessed to obtain the calculated locations for the identified Wi-Fi access points. Based on the number of Wi-Fi access points identified via received messages, choosing a corresponding location-determination algorithm from a plurality of location-determination algorithms, said chosen algorithm being suited for the number of identified Wi-Fi access points. The calculated locations for the identified Wi-Fi access points and the signal strengths of said received messages and the chosen location-determination algorithm are used to determine the location of the user-device.

[0022] Under another aspect of the invention, the calculated locations for the identified Wi-Fi access points are filtered to determine if the corresponding Wi-Fi access points have moved since the time the information about the Wi-Fi access points was included in the reference database.

[0023] Under another aspect of the invention, the plurality of location-determination algorithms includes a simple signal strength weighted average model.

[0024] Under another aspect of the invention, the plurality of location-determination algorithms includes a nearest neighbor model.

[0025] Under another aspect of the invention, the plurality of location-determination algorithms includes a triangulation technique.

[0026] Under another aspect of the invention, the plurality of location-determination algorithms includes an adaptive smoothing technique based on the device velocity.

[0027] Under another aspect of the invention, the choice of location-determination algorithm is further based on the user application making the location request.

BRIEF DESCRIPTION OF DRAWINGS

[0028] In the drawing,

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

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

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

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

[0033] 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;

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

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

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

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

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

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

DETAILED DESCRIPTION

[0040] Preferred embodiments of the present invention provide a system and a methodology for gathering reference location data to enable a commercial positioning system using public and private 802.11 access points. Preferably, the data is gathered in a programmatic way to fully explore and cover the streets of a target region. The programmatic approach identifies as many Wi-Fi access points as possible. By gathering location information about more access points, preferred embodiments not only provide a larger collection of location information about access points, but the location information for each access point may be calculated with more precision. Subsequently this larger set of more precise data may be used by location services to more precisely locate a user device utilizing preferred embodiments of the invention. Certain embodiments use techniques to avoid erroneous data in determining the Wi-Fi positions and use newly-discovered position information to improve the quality of previously gathered and determined position information. Certain embodiments use location-determination algorithms based on the context of the user device at the time the user requests a location. For example, the location-determination algorithm will be based on the number of Wi-Fi access points identified or detected when a location request is made, or based on the application making the request.

[0041] FIG. 1 depicts a portion of a preferred embodiment of a Wi-Fi positioning system (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.

[0042] 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.

[0043] 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.

[0044] 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.

[0045] 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

[0046] 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.

[0047] 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.

Higher Quality AP Locations

[0048] 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.

[0049] 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 overlayed, 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.

Reference Symmetry

[0050] 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.

Scanning Device

[0051] 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.

[0052] 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

[0053] 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.

[0054] 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.

[0055] 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.

Central Network Server

[0056] 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].

[0057] 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.

[0058] 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.

[0059] 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.

[0060] 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. RSS value of access points are shown as follows:

[0061] {RSS₁, RSS₂, . . . RSS_n}

[0062] 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:

[0063]

{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}}}

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

[0065] 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.,

[0066]

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

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

[0067] 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.

[0068] 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.

[0069] 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.

[0070] 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.

[0071] 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 database of identified wireless access points in at least one target area having a radius on the order of at least miles, said database comprising:

a plurality of database records recorded in a non-transitory computer-readable medium for substantially all of the identified wireless access points in the target area,

each database record including for one of the identified wireless access points, identification information, and

access point position information for the one of the identified wireless access points calculated from readings of the one of the identified wireless access points from a plurality of observation points distributed around more than one side of the one of the identified wireless access points to reduce negative effects of arterial bias in the access point position information calculated therefrom.

2. The database of claim 1 wherein the identified wireless access points are Wi-Fi access points.

3. The database of claim 1 wherein the identified wireless access points provide reference symmetry relative to a user device.

4. The database of claim 1 wherein the plurality of observation points distributed around the one of the identified wireless access points provide readings scanned from at least three observation points at different angles around the one of the identified wireless access points.

5. The database of claim 1 wherein the plurality of observation points distributed around the one of the identified wireless access points provide readings from substantially all drivable streets in the target area.

6. The database of claim 5 wherein the identified wireless access points provide reference symmetry relative to a user device.

7. The database of claim 1 wherein the readings of the one of the identified wireless access points have been taken from one or more predetermined routes on drivable streets in the target area to distribute the observation points around the one of the identified wireless access points.

8. The database of claim 1 wherein the readings of the one of the identified wireless access points have been taken from one or more non-random routes on drivable streets in the target area to distribute the observation points around the one of the identified wireless access points.

9. The database of claim 1 wherein the readings of the one of the identified wireless access points have been taken from one or more routes determined by a routing algorithm used to distribute the observation points around the one of the identified wireless access points.

10. The database of claim 9 wherein the routing algorithm is a solution to a Eulerian cycle problem.

11. The database of claim 10 wherein the routing algorithm is an instance of a Chinese Postman routing algorithm.

12. The database of claim 1 wherein access point position information for the one of the identified wireless access points is calculated from readings of the one of the identified wireless access points from a plurality of observation points distributed at a plurality of angles to the one of the identified wireless access points to reduce negative effects of arterial bias in the access point position information calculated therefrom.

13. The database of claim 12 wherein access point position information for the one of the identified wireless access points is calculated from readings of the plurality of observation points distributed at as many angles to the one of the wireless access points as possible by scanning readings from substantially all drivable streets in the target area.

14. The database of claim 1 wherein the readings have been reviewed to verify uniform coverage around the one of the identified wireless access points to avoid arterial bias in the access point position information.

15. The database of claim 1 wherein the Wi-Fi access points operate according to an 802.11 standard.

16. A database of WI-FI access points for at least one target area having a radius on the order of at least miles, said database being recorded in a non-transitory computer-readable medium and including database records for substantially all of the identified WI-FI access points in the target area, each database record comprising:

identification information for a corresponding WI-FI access point; and

calculated position information for the corresponding WI-FI access point,

wherein said calculated position information is obtained from recording multiple readings of the WI-FI access point from a plurality of observation locations when calculating the position of the WI-FI access point in order to reduce arterial bias in the calculated position information.

17. A server comprising:

a data communications module including hardware configured to receive scanning data for a plurality of identified wireless access points in a target area, the target area including area within a radius of at least miles, and

a database configured to store a plurality of database records based on the scanning data, the database records including for each one of the identified wireless access points,

identification information for the one of the identified wireless access points, and

access point position information for the one of the identified wireless access points calculated from readings for the one of the identified wireless access points from a plurality of observation points distributed around more than one side of the one of the identified wireless access points to reduce negative effects of arterial bias in the access point position information.

18. The server of claim 17 wherein the identified wireless access points are Wi-Fi access points.

19. The server of claim 17 wherein the identified wireless access points provide reference symmetry relative to a user device.

20. The server of claim 17 wherein the plurality of observation points distributed around the one of the identified wireless access points provide readings from drivable streets in the target area.

21. The server of claim 17 wherein the plurality of observation points distributed around the one of the identified wireless access points are along one or more predetermined routes on drivable streets in the target area.

22. The server of claim 17 wherein the plurality of observation points distributed around the one of the identified wireless access points are along one or more routes determined by a routing algorithm, wherein the routing algorithm is a solution to a Eulerian cycle problem.

23. A method comprising:

receiving, at a server, scanning data for a plurality of identified wireless access points in a target area, the target area including area within a radius of at least miles;

calculating, by the server, a position for each of the plurality of identified wireless access points in the target area based on the scanning data, the calculating to utilize for each one of the identified wireless access points readings for the one of the identified wireless access points from a plurality of observation points distributed around more than one side of the one of the identified wireless access points to reduce negative effects of arterial bias; and

storing, in a database, a plurality of database records for the plurality of identified wireless access points in the target area, the database records including identification information and access point position information for the identified wireless access points based on the calculating.

24. The method of claim 23 wherein the identified wireless access points are Wi-Fi access points.

25. The method of claim 24 wherein the Wi-Fi access points operate according to an 802.11 standard.

26. The method of claim 23 wherein the identified wireless access points provide reference symmetry relative to a user device.

27. The system of claim 23 wherein the plurality of observation points distributed around the one of the identified wireless access points provide readings from drivable streets in the target area.

28. The system of claim 23 wherein the plurality of observation points distributed around the one of the identified wireless access points are along one or more predetermined routes on drivable streets in the target area.

29. The system of claim 23 wherein the plurality of observation points distributed around the one of the identified wireless access points are along one or more routes determined by a routing algorithm, wherein the routing algorithm is a solution to a Eulerian cycle problem.

Patent Citations (204)

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
US5136636(A)	1992-08-01	Wegrzynowicz	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
US5526357(A)	1996-06-01	Jandrell	Examiner
US5564121(A)	1996-10-01	Chow et al.	Applicant
US5614895(A)	1997-03-01	Ohomori et al.	Examiner
US5796613(A)	1998-08-01	Kato et al.	Examiner
US5890092(A)	1999-03-01	Kato et al.	Examiner
US5940825(A)	1999-08-01	Castelli et al.	Applicant
US5946615(A)	1999-08-01	Holmes et al.	Applicant
US5992737(A)	1999-11-01	Kubota	Examiner
US6104978(A)	2000-08-01	Harrison et al.	Examiner
US6134448(A)	2000-10-01	Shoji et al.	Applicant
US6192312(B1)	2001-02-01	Hummelsheim	Applicant
US6262741(B1)	2001-07-01	Davies	Applicant
US6272405(B1)	2001-08-01	Kubota et al.	Applicant
US6330446(B1)	2001-12-01	Mori	Examiner
US6434479(B1)	2002-08-01	Kondou et al.	Examiner
US6438491(B1)	2002-08-01	Farmer	Applicant
US6484034(B1)	2002-11-01	Tsunehara et al.	Applicant
US6606553(B2)	2003-08-01	Zobell et al.	Examiner
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
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
US6915128(B1)	2005-07-01	Oh	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
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
US7130464(B2)	2006-10-01	Wang	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
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
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	Morean et al.	Applicant
US7433696(B2)	2008-10-01	Dietrich et al.	Applicant
US7440755(B2)	2008-10-01	Balachandran et al.	Applicant
US7474897(B2)	2009-01-01	Morgan et al.	Applicant
US7474988(B2)	2009-01-01	Kamisuwa et al.	Applicant
US7493127(B2)	2009-02-01	Morgan et al.	Applicant
US7502620(B2)	2009-03-01	Morgan 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
US7672675(B2)	2010-03-01	Pande et al.	Applicant
US7764231(B1)	2010-07-01	Karr et al.	Applicant
US7853250(B2)	2010-12-01	Harvey et al.	Applicant
US7856209(B1)	2010-12-01	Rawat	Applicant
US2001/0053999(A1)	2001-12-01	Feinberg	Applicant
US2002/0055956(A1)	2002-05-01	Krasnoiarov 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/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/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/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/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
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/0126635(A1)	2007-06-01	Houri	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
US2008/0004888(A1)	2008-01-01	Davis et al.	Applicant
US2008/0043758(A1)	2008-02-01	Giaretta et al.	Examiner
US2008/0045234(A1)	2008-02-01	Reed	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
US2009/0017841(A1)	2009-01-01	Lewis et al.	Applicant
US2009/0075672(A1)	2009-03-01	Jones et al.	Applicant
US2009/0149197(A1)	2009-06-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
JP3235562	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
WO3/021851	2003-03-01		Applicant
WO-03/021851	2003-03-01		Applicant
WO2004/002185	2003-12-01		Applicant
WO-2004/002185	2003-12-01		Applicant
WO2005/004527	2005-01-01		Applicant
WO-2005/004527	2005-01-01		Applicant
WO-2006/096416	2006-09-01		Applicant
WO-2006/110181	2006-10-01		Applicant
WO-2007/081356	2007-07-01		Applicant

Non-Patent Literature (223)

Ahmad Hatami et al. “A Comparative Performance Evaluation of RSS-Based Positioning Algorithms Used in WLAN Networks” 2005 IEEE Wireless Communications and Networking Conference, IEEE Communications Society, WCNC vol. 4 (Mar. 13-17, 2005).Applicant
Alexandra Workman et. al. “International Applications of AT&T's Intelligent Network Platforms”, AT&T Technical Journal, 1991, vol. 70, No. 34, pp. 4-57 (1991).Applicant
Ali Taheri, 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).Applicant
Anthony LaMarca et al. “Place Lab: Device Positioning Using Radio Beacons in the Wild” Intel Research Seattle; Intel Research Cambridge; UC San Diego; University of Washington; Information School, University of Washington (2004).Applicant
Anthony LaMarca et al. “Place Lab: Device Positioning Using Radio Beacons in the Wild” Pervasive 2005, LNCS 3468, pp. 116-133 (2005).Applicant
Bernard J.T. Mallinder, “The Final Countdown to GSM”, 1991 Pan European Digital Cellular Radio Conference, Acropolis Conference Center, Nice, France (Feb. 5, 1991).Applicant
Bill N. Schilit et al. “Challenge: Ubiquitous Location-Aware Computing and the “Place Lab” Initiative” Dept. of Computer Science and Engineering, University of Washington, WMASH '03, pp. 29-35 (Sep. 19, 2003).Applicant
Bill N. Schilit 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).Applicant
Bluesoft, Inc., Aeroscout (available at least as early as Aug. 2003) (see http://replay.waybackmachine.org/20030802052607/http://bluesoftinc.com/wlan.asp, last accessed Apr. 14, 2011).Applicant
Bob Wallace “Domino's delivers using new call routing service” Network World, vol. 8, No. 32 (Aug. 12, 1991).Applicant
C. A. Kent et al. “Position Estimation of Access Points in 802.11 Wireless Network” Lawrence Livermore National Laboratory (Jan. 21, 2004).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).Applicant
Charles Head “Intelligent Network: A Distributed System” IEEE Communications Magazine, pp. 16-20, (Dec. 1988).Applicant
Chris Hurley et al., “War Driving Drive, Detect, Defend a Guide to Wireless Security”, Syngress Publishing, Inc. (2004).Applicant
David Sterling et al. “The Iridium System—A Revolutionary satellite Communications System Developed with Innovative Applications of Technology”, IEEE Communications Society, pp. 0436-0440, MILCOM '91 (1991).Applicant
Dean Harvey et al. “Call Center Solutions” Intelligent Networking: Business Communications Systems, AT&T Technical Journal, vol. 70, No. 5 (Sep./Oct. 1991).Applicant
Edgar S. Delong, Jr. “Making 911 even better” Telephony Integrating Voice and Data Communications, An Intertec Publication, pp. 60-63 (Dec. 14, 1987).Applicant
Eiman Elnahrawy, 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).Applicant
Ekahau, Ekahau Client 3.0 (available at least as early as Oct. 2003) (see http://replay.waybackmachine.org/20031008125411/ http://www.ekahau.com/products/, http://replay.waybackmachine.org/20031004002735/http://www.ekahau.com/products/client/, and http://replay.waybackmachine.org/20030929003821/http://www.ekahau.com/products/client/ReleaseNotes3—0.html, last accessed Apr. 14, 2011).Applicant
Ekahau, Ekahau Positioning Engine 2.1 (available at least as early as Oct. 2003) (see http://replay.waybackmachine.org/20031008125411/http://www.ekahau.com/products/, http://replay.waybackmachine.org/20031004002510/http://www.ekahau.com/products/positi oningengine/, http://replay.waybackmachine.org/20031011143106/http://www.ekahau.com/products/positioningengine/epe20—features.html, http://replay.waybackmachine.org/20031011193911/,http://www.ekahau.com/products/positioningengine/epe20—specifications.html, http://replay.waybackmachine.org/20031208195116/,http://www.ekahau.com/products/positioningengine/epe20—requirements.html, and http://replay.waybackmachine.org/20031217181553/http://www.ekahau.com/products/positioningengine/epe20—casestudies.html, last accessed Apr. 14, 2011).Applicant
Ekahau, Ekahau Site Survey 1.0 (available at least as early as Oct. 2003) (see http://replay.waybackmachine.org/20031008125411/http://www.ekahau.com/products/, http://replay.waybackmachine.org/20030807204446/http://www.ekahau.com/products/sitesurvey/, and http://replay.waybackmachine.org/20030801080918/http://www.ekahau.com/products/sitesurvey/ess10—why.html, last accessed Apr. 14, 2011).Applicant
Eloise Brackenridge The New Urban Infrastructure: Cities and University of Texas at Austin, Center for Research on Communication, Technology and Society, pp. 77-100 (1990).Applicant
Ernest DeNigris, et al. “Enhanced 911: emergency calling with a plus” Bell Laboratories Record, pp. 74-79 (Mar. 1980).Applicant
Ezekiel S. Bhasker et al. “Employing User Feedback for Fast, Accurate, Low-Maintenance Geolocationing”, Department of Computer Science and Engineering, University of California, San Diego (2004).Applicant
Jeffrey Hightower et al. “A Survey and Taxonomy of Location Systems for Ubiquitous Computing”, University of Washington (Aug. 24, 2001).Applicant
John Krumm et al. “The NearMe Wireless, Proximity Server” UbiComp 2004, LNCS 3205, pp. 283-300 (2004).Applicant
Jong Hee Kang et al. “Extracting Places from Traces of Locations” Dept. of Computer Science and Engineering, University of Washington, WMASH '04, pp. 110-118 (Oct. 1, 2004).Applicant
Kay Connelly et al. “A Toolkit for Automatically Construction Outdoor Radio Maps” Proceedings of the Intl. Conference on Information Technology: Coding and Computing (2005).Applicant
Konrad Lorinez et al. “MoteTrack: A Robust, Decentralized Approach to RFBased Location Tracking” LoCA 2005, LNCS 3479, pp. 63-82 (2005).Applicant
Mary Buccafurno, “The Philadelphia Story”, TE&M Special Report 911, pp. 68-72 (Dec. 15, 1987).Applicant
Michael Robinson 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).Applicant
Ming-Hui Jin et al. “802.11-based Positioning System for Context Aware Applications” GLOBECOM, IEEE 2003 (2003).Applicant
Netstumbler Blog Posting,“Wardriving as a Proxy for Wi-Fi GPS Location” (May 11-17, 2004) (available at http://www.netstumbler.org/news/wardriving-as-a-proxy-for-wi-fi-gps-locationt10762.html, last accessed Apr. 13, 2004).Applicant
Newbury Networks, LocalePoints (available at least as early as Oct. 2004) (see http://replay.waybackmachine.org/20041009170934/http://www.newburynetworks.com/products/coretech.php?localepoints, last accessed Apr. 14, 2011).Applicant
Newbury Networks, Newbury Networks' LocaleServer (available at least as early as Oct. 2004) (see http://replay.waybackmachine.org/20041010054718/http://www.newburynetworks.com/products/coretech.php, last accessed Apr. 14, 2011).Applicant
Pango, PanGo Mobile Applications Suite (available at least as early as Aug. 2003) (see http://replay.waybackmachine.org/20030825161534/http://www.pangonetworks.com/mobile.htm and http://replay.waybackmachine.org/20031002103310/http://pangonetworks.com/products.htm, last accessed Apr. 14, 2011).Applicant
Pango, PanGo Proximity Platform (available at least as early as Oct. 2003) (see http://replay.waybackmachine.org/20031002102757/http://pangonetworks.com/proximity.htm and http://replay.waybackmachine.org/20031002103310/http://pangonetworks.com/products.htm, last accessed Apr. 14, 2011).Applicant
Paramvir Bahl et al. “A Software System for Locating Mobile Users: Design, Evaluation, and Lessons”, Microsoft Research, University of California at San Diego (2000).Applicant
Paramvir Bahl et al. “RADAR: An In-Building RF-based User Location and Tracking System”, Microsoft Research (2000).Applicant
Paul Castro, et al. “A Probabilistic Room Location Service fro Wireless Networked Environments” Ubicomp 2001: Ubiquitious Computing, Intl. Conference Atlanta, GA, Sep. 30-Oct. 2, 2001, pp. 19-34 (2001).Applicant
Paul Hunter “The Sources of Innovation in New Jersey Bell Switching Services” Master of Science Thesis, Massachusetts Institute of Technology, (Jun. 1991).Applicant
Per Bjorndahl, et al. “CME20—A Total Solution for GSM Networks”, Ericsson Review No., 3, 1991, pp. 72-79 (Jun. 1991).Applicant
Peter Shipley, “802.11b War Driving and LAN Jacking”, DEFCON 9 Conference, Las Vegas, Nevada, USA (Jul. 13-15, 2001) (available at http://www.defcon.org/html/links/dcarchives/dc-9-archive.html, last accessed Apr. 13, 2011), video and transcript.Applicant
Peter Shipley, “Open WLANs the early results of war Driving” DEFCON9 Conference 802.11b War Driving Presentation (Jul. 13, 2001).Applicant
Robert K. Kwan “GLOBALSTAR: Linking the World via Mobile Connections”, IEEE Intl. Symposium on Personal, Indoor & Mobile Radio Communications, pp. 318-323, (Sep. 24-25, 1991).Applicant
Siddhartha Saha 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, pp. 1987-1992, (Mar. 16-20, 2003).Applicant
Sue Spielman and Philip Brittan, “Java and GIS, Part 1: Intro to GIS” (Feb. 16, 2004) (available at http://today.java.net/pub/a/today/2004/02/16/gis.html, last accessed Apr. 14, 2011).Applicant
Sue Spielman and Simon Brown, “Java and GIS, Part 2: Mobile LBS” (Apr. 1, 2004) (available at http://today.java.net/pub/a/today/2004/04/01/gis.html, last accessed Apr. 14, 2011).Applicant
Texas Advisory Commission on Intergovernmental Relations, “Implementing 9-1-1 Systems in Texas: Legal and Institutional Background” (Jun. 1998).Applicant
Thomas Dayharsh et al. “Update on the National Emergency No. 911”, IEEE Transactions on Vehicular Technology, vol. VT-28, No. 4 (Nov. 1979).Applicant
Wayne Eckerson, “Users test toll-free net access options”, Management Strategies, Network World, pp. 17-18 (Dec. 30, 1991/Jan. 6, 1992).Applicant
William Honig et al. “The Realities of Service Creation on Switching Systems Through Attached Processors” XII International Switching Symposium, vol. VI, pp. 51-54, (May 27-Jun. 1, 1990).Applicant
Wolf-Dietrich Ambrosch et al. “The Intelligent Network: A Joint Study by Bell Atlantic, IBM and Siemens, Chapter 9. ERS Service Description”, pp. 162-177 (1989).Applicant
Yatin Chawathe et al. “A Case Study in Building Layered DHT Applications”, Intel Research Seattle, University of California, San Diego, Intel Research Berkeley, ICSI (2005).Applicant
Yu-Chung Cheng et al. “Accuracy Characterization for Metropolitan-scale Wi-Fi Localization” University of California, San Diego; Intel Research Seattle; Microsoft Corporation (2005).Applicant
Complaint for Patent Infringement (6 Exhibits) (Sep. 15, 2010).Applicant
Corporate Disclosure Statement (Sep. 15, 2010).Applicant
Summons to Google (Sep. 16, 2010).Applicant
Summons to Google w. Proof of Service (Sep. 21, 2010).Applicant
Google Answer and Counterclaims to Complaint (Oct. 19, 2010).Applicant
Assented to Motion to Extend Time to Answer (Oct. 27, 2010).Applicant
Notice of Scheduling Conference (Nov. 2, 2010).Applicant
Google Corporate Disclosure Statement (Nov. 3, 2010).Applicant
Skyhook Answer to Google Counterclaims (Nov. 22, 2010).Applicant
Joint Statement (w 2 Exhibits) (Dec. 7, 2010).Applicant
Skyhook Preliminary Infringement Disclosure (w 4 Exhibits) (Feb. 14, 2011).Applicant
Google Preliminary Non Infingement Contentions Apr. 15, 2011).Applicant
Google Preliminary Invalidity Contentions (1 Exhibit) (Apr. 15, 2011).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
Brewin, Bob, “IBM Develops Tool to Detect Rogue Wireless LAN Access Points,” Computerworld, Inc., Jun. 17, 2002, pp. 1-5.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
Castro , Paul, et al. “A Probabilistic Room Location Service fro Wireless Networked Environments” Ubicomp 2001: Ubiquitious Computing, Intl. Conference Atlanta, GA, Sep. 30-Oct. 2, 2001, pp. 19-34.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
“Delta Encoding”, Wikipedia, retrieved from http://en.wikipedia.org/wiki/Delta—encoding, Mar. 2006, pp. 1-5.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
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
Griswold et al., “ActiveCampus—Sustaining Educational Communities through Mobile Technology,” UCSD CSE Technical Report #CS200-0714, Jul. 2002, 19 pages.Applicant
Griswold, William G., et al., “ActiveCampus: Experiments in Community-Oriented Ubiquitous Computing,” IEEE Computer Society, Oct. 2004, pp. 1-9.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
Hazas, M., et al., “Location-Aware Computing Comes of Age,” IEEE, vol. 37, Feb. 2004, pp. 95-97.Applicant
Head, Charles, “Intelligent Network: A Distributed System” IEEE Communications Magazine, Dec. 1988, pp. 16-20.Applicant
Hellebrandt, M., et al., “Estimating Position and Velocity of Mobile in a Cellular Radio Network,” IEEE Transactions on Vehicular Technology, vol. 46, No. 1, Feb. 1997, pp. 65-71.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 Computinq”, 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, 2003, Oct. 2003, pp. 1-5.Applicant
“Huffman Coding”, Wikipedia, retrieved from http://en.wikipedia.org/wiki/Huffman—coding, Mar. 2006, pp. 1-10.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
International Search Report and Written Opinion, International Application No. PCT/US05/39208, mailed Jan. 29, 2008, 3 pages.Applicant
International Search Report and Written Opinion, International Application No. PCT/US08/87969, mailed Mar. 10, 2009, 7 pages.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
Kawabata, K., “Estimating Velocity Using Diversity Reception,” IEEE, Mar. 1994, pp. 371-374.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
Kim, M., et al., “Risks of using AP locations discovered through war driving,” Lecture Notes in Computer Science, vol. 3968, Pervasive Computing, May 19, 2006, pp. 67-81.Applicant
Kirsner, S “One more way to find yourself,” The Boston Globe, May 23, 2005, Retrieved from www.boston.com, 2 pages.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, J., et al., “LOCADIO: Inferring Motion and Location from Wi-Fi Signal Strengths,” First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, Aug. 2004, 10 pages.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, M., “Graphic Programming Using Odd or Even Points,” Chinese Math. 1, 1962, pp. 273-277.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” Intel Research Seattle; Intel Research Cambridge; UC San Diego; University of Washington; Information School, University of Washington, 2004, pp. 1-20.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
Lamarca, A., et al., “Self-Mapping in 802.11 Location Systems,” Ubicomp 2005: Ubiquitous Computing, Intel Corporation, Aug. 23, 2005, pp. 87-104.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
Muthukrishnan, K., et al., “Towards Smart Surroundings: Enabling Techniques and Technologies for Localization,” Lecture Notes in Computer Science, vol. 3479, May 2005, 11 pages.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 N. et al., “Challenge: Ubiquitous Location-Aware Computing and the “Place Lab” Initiative” Dept. of Computer Science and Engineering, University of Washington, WMASH '03, Sep. 19, 2003, pp. 29-35.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.11b War Driving Presentation, Jul. 13, 2001, pp. 1-49.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Complaint for Patent Infringement against Google, Inc. (with 6 Exhibits), filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 15, 2010, pp. 1-89.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Answer to Complaint, with Jury Demand, Counterclaim against Skyhook Wireless, Inc. By Google, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 29, 2010, pp. 1-9.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Answer to Counterclaim by Skyhook Wireless, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Nov. 22, 2010, pp. 1-4.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Joint Submission pursuant to Local Rule 16.1 Joint Statement by Google, Inc. (with Exhibit A-B) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Dec. 7, 2010, pp. 1-17.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Notice by Skyhook Wireless, Inc. of Preliminary Infringement Disclosure (Redacted) (with 4 Exhibits) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Feb. 14, 2011, pp. 1-39.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Notice by Google, Inc. of Preliminary Non-Infringement Contentions (Redacted) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Apr. 15, 2011, pp. 1-14.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Notice by Google, Inc. of Preliminary Invalidity Contentions (with Exhibit A) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Apr. 15, 2011, pp. 1-81.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Motion for Summary Judgment of Indefiniteness by Google, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-4.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Memorandum in Support re: Motion for Summary Judgment of Indefiniteness and, in the Alternative, Opening Claim Construction Brief filed by Google, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-41.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Anthony S. Acampora, Ph.D. By Google, Inc. (with Exhibit 1) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-114.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Statement of facts re: Motion for Summary Judgment of Indefiniteness Pursuant to Local Rule 56.1 filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-12.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Susan Baker Manning in Support of Google Inc.'s Motion for Summary Judgement of Indefiniteness and, in the Alternative, Opening Claim Construction Brief by Google, Inc. (with Exhibits A-F) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-118).Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Susan Baker Manning in Support of Google Inc.'s Motion for Summary Judgement of Indefiniteness and, in the Alternative, Opening Claim Construction Brief by Google, Inc. (with Exhibits G-L) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-105.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Susan Baker Manning in Support of Google Inc.'s Motion for Summary Judgement of Indefiniteness and, in the Alternative, Opening Claim Construction Brief by Google, Inc (with Exhibits M-S) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-107.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Susan Baker Manning in Support of Google Inc.'s Motion for Summary Judgement of Indefiniteness and, in the Alternative, Opening Claim Construction Brief by Google, Inc. (with Exhibit T-BB) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-92.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Preliminary Claim Construction Briefs by Skyhook Wireless, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-45.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Affidavit in Support re: Preliminary Claim Construction Briefs (with 15 Exhibits) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2011, pp. 1-140.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Opposition re Motion for Summary Judgment of Indefiniteness and Skyhook's Reply Claim Construction Brief filed by Skyhook Wireless, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 28, 2011, pp. 1-34.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Reply to Preliminary Claim Construction Briefs by Google, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 28, 2011, pp. 1-31.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration of Catherine R. Murphy in Support of Google Inc.'s Opposition to Skyhook Wireless, Inc.'s Opening Claim Construction Brief by Google, Inc. (with Exhibits A-C) filed on Sep. 28, 2011, pp. 1-30.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Affidavit of Samuel K. Lu re: Opposition to Motion by Skyhook Wireless, Inc. (with Exhibits A-M) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 28, 2011, pp. 1-254.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Statement of Material Facts L.R. 56.1 re: Motion for Summary Judgment of Indefiniteness filed by Skyhook Wireless, Inc. filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 28, 2011, pp. 1-12.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Affidavit of Dr. David Kotz re Opposition to Motion by Skyhook Wireless, Inc. (with 1 Exhibit) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 28, 2011, pp. 1-70.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Preliminary Invalidity and Non-Infringement Contentions by Google, Inc. (with 1 Exhibit) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 7, 2011, pp. 1-108.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Joint Claim Construction and Prehearing Statement by Skyhook Wireless, Inc. (with 49 Exhibits) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 13, 2011, pp. 1-744.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Reply to Response to Motion for Summary Judgment of Indefiniteness filed by Google, Inc filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 18, 2011, pp. 1-22.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Declaration re Reply to Response to Motion for Summary Judgment of Indefiniteness by Google, Inc. (with 5 Exhibits) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 18, 2011, pp. 1-213.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Motion to Strike by Skyhook Wireless, Inc. (with 1 Exhibit) filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 20, 2011, pp. 1-13.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Judge Rya W. Zobel: Memorandum & Decision entered granting in part and denying in part Motion for Summary Judgment filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Sep. 14, 2012, pp. 1-37.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Joint Statement re scheduling conference filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Oct. 4, 2012, pp. 1-7.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Amended Document by Google, Inc. Amendment to Preliminary Non-Infringement Contentions filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Nov. 13, 2012, pp. 1-13.Applicant
Skyhook Wireless, Inc. v. Google, Inc., Second Amended Document by Google, Inc. Amendment to Preliminary Invalidity Contentions filed in the United States District Court of Massachusetts, Case No. 1:10-cv-11571-RWZ, on Nov. 13, 2012, pp. 1-77.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
“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, pp. 1-186.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
Weisstein, Eric W., “Chinese Postman Problem,” Mathworld—A Wolfman Web Resource, retrieved from http://mathworld.wolfram.com/ChinesePostmanProblem.html, 2010, 1 page.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
Theodoridis, S. et al., “Pattern Recognition, Clustering: Basic Concepts,” Academic Press, San Diego, California, US, Jan. 1, 1999, pp. 372-373 and p. 387.Applicant