This disclosure relates generally to wireless networks.
Market adoption of wireless LAN (WLAN) technology has exploded, as users from a wide range of backgrounds and vertical industries have brought this technology into their homes, offices, and increasingly into the public air space. This inflection point has highlighted not only the limitations of earlier-generation systems, but also the changing role that WLAN technology now plays in people's work and lifestyles across the globe. Indeed, WLANs are rapidly changing from convenience networks to business-critical networks. Increasingly users are depending on WLANs to improve the timeliness and productivity of their communications and applications, and in doing so, require greater visibility, security, management, and performance from their network. Radio frequency (RF) coverage maps, also referred to as a heat maps, provide information regarding coverage of particular wireless access points. RF coverage maps are useful for assessing the area or region of sufficient WLAN service, and for use in locating wireless nodes. RF coverage maps are typically derived from manual site surveys and mathematical modeling techniques. Some method generate RF coverage maps based on received signal strength values associated with transmission signals exchanged between a wireless node and one or more wireless access points. Received signal strength values may be obtained at various locations to generate a coverage map for the wireless access points. RF coverage maps may also be generated by estimation algorithms using, for example, pathloss models and ray tracing. However, shadowing from nearby walls and furniture, and the multipath effects inherent to various RF environments, make high accuracy coverage maps difficult to achieve.
A. Overview
Particular embodiments of the present invention are directed to locally adjusting an RF coverage map in a wireless network. Generally, an RF coverage map is a data structure including expected or estimated received signal strength parameters for a given wireless access point at a plurality of location bins. According to one implementation, a location server obtains calibration data at selected locations corresponding to location bins of the RF coverage map. In one implementation, the calibration data may include observed received signal strength values at known locations transmitted from a wireless access point. The location server may then determine offset values at the selected location bins by comparing estimated received signal strength values in the RF coverage map to observed signal strength values. The observed signal strength values, however, may be used to adjust estimated signal strength values at surrounding locations. The location server may then generate correction cones that characterize the correction or offset to surrounding locations of the RF coverage map caused by the difference in the observed and estimated signal strength values. In one implementation, the received signal strength error changes the RF coverage map values within a radius R around a given calibration point. The amount of change at a given location equals the observed error at the center of the correction cone (also the location of the calibration point), and decreases, in one implementation, linearly from the center until it tapers to zero at the edge of the correction cone. As discussed below, the offset values that define the correction cones may be normalized and windowed. The location server then applies the correction cones to adjust one or more values of the RF coverage map.
B. Local Adjustment to RF Coverage Map
As discussed above, particular implementations of the invention are directed to adjusting one or more estimated received signal strength values in corresponding location bins of an RF coverage map.
As described in more detail below, the location server may compare estimated received signal strength values with actual/observed received signal strength data at the selected location bins calibration points). The location server may generate correction cones, which provide offset values, to adjust the estimated received signal strength values of the calibration points and location bins adjacent to the calibration points without having to measure actual/observed received signal strength values at those adjacent location bins.
The location server may then determine offset or correction values (204) at one or more of the calibration points in the RF coverage map by comparing estimated received signal strength values to the observed signal strength values. For example, an estimated received signal strength value at a given location bin may be −50 dBm, but the actual/observed received signal strength value may be −55 dBm. Accordingly, the offset or correction value at the calibration point can be computed as the difference between the two values.
In embodiment, the location server may generate correction cones (e.g. as illustrated in step 206 of
After the correction cones are generated, the location server then superimposes the correction cones (e.g. as illustrated in 208 of
When there are multiple calibration points in close proximity, the scaled cones (403)overlap and are summed at each location where there is an overlap. As well, the algorithm keeps track of the sum of unscaled cones (401), and after the cones are all overlapped, the sum of scaled cones is normalized by the sum of unscaled cones. In other words, at a given location, the value of each offset corresponding to all correction cones are summed. This value is then divided by the value of an “unscaled” correction cone (i.e., assume a correction cone having a 1 dB error at the center tapering to 0 at the radius R.)
The location server may normalize the superimposed cones in the area of the overlap (210). In other words, for each location bin where correction cones overlap, the correction value (N) from each correction cone is summed. The summed values are normalized by dividing this aggregate by the sum of the corresponding unscaled cone values (D) at a given location. Repeating this for each location results in a smoothed error matrix.
The location server applies a perimeter or window to each normalized cone (e.g. as illustrated in step 212 of
C. Example System Architecture For RF Coverage Map Generator
While particular implementations of the present invention have been described above with reference to specific embodiments, some or all of the elements or operations thereof may be implemented using a computer system having a general purpose hardware architecture.
The elements of hardware system 500 are described in greater detail below. In particular, network interface 516 provides communication between hardware system 500 and any of a wide range of networks, such as an Ethernet (e.g., IEEE 802.3) network, etc. Mass storage 518 provides permanent storage for the data and programming instructions to perform the above described functions implemented in the RF coverage map generator, whereas system memory 514 (e.g., DRAM) provides temporary storage for the data and programming instructions when executed by processor 502. I/O ports 520 are one or more serial and/or parallel communication ports that provide communication between additional peripheral devices, which may be coupled to hardware system 500.
Hardware system 500 may include a variety of system architectures; and various components of hardware system 500 may be rearranged. For example, cache 504 may be on-chip with processor 502. Alternatively, cache 504 and processor 502 may be packed together as a “processor module,” with processor 502 being referred to as the “processor core.” Furthermore, certain implementations of the present invention may not require nor include all of the above components. For example, the peripheral devices shown coupled to standard I/O bus 508 may couple to high performance I/O bus 506. In addition, in some implementations only a single bus may exist with the components of hardware system 500 being coupled to the single bus. Furthermore, hardware system 500 may include additional components, such as additional processors, storage devices, or memories.
As discussed above, in one embodiment, the operations of the RF coverage map generator described herein are implemented as a series of software routines run by hardware system 500. These software routines comprise a plurality or series of instructions to be executed by a processor in a hardware system, such as processor 502. Initially, the series of instructions are stored on a storage device, such as mass storage 518. However, the series of instructions can be stored on any suitable storage medium, such as a diskette, CD-ROM, ROM, EEPROM, etc. Furthermore, the series of instructions need not be stored locally, and could be received from a remote storage device, such as a server on a network, via network/communication interface 516. The instructions are copied from the storage device, such as mass storage 518, into memory 514 and then accessed and executed by processor 502.
An operating system manages and controls the operation of hardware system 500, including the input and output of data to and from software applications (not shown). The operating system provides an interface between the software applications being executed on the system and the hardware components of the system. According to one embodiment of the present invention, the operating system is the Windows® 95/98/NT/XP operating system, available from Microsoft Corporation of Redmond, Wash. However, the present invention may be used with other suitable operating systems, such as the Apple Macintosh Operating System, available from Apple Computer Inc. of Cupertino, Calif., UNIX operating systems, LINUX operating systems, and the like.
The present invention has been explained with reference to specific embodiments. For example, while embodiments of the present invention have been described as operating in connection with IEEE 802.11 networks, the present invention can be used in connection with any suitable wireless network environment. Other embodiments will be evident to those of ordinary skill in the art. It is therefore not intended that the present invention be limited, except as indicated by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
4254467 | Davis et al. | Mar 1981 | A |
5028848 | Bankston et al. | Jul 1991 | A |
5327144 | Stilp et al. | Jul 1994 | A |
5394158 | Chia | Feb 1995 | A |
5396582 | Kahkoska | Mar 1995 | A |
5564079 | Olsson | Oct 1996 | A |
5570412 | LeBlanc | Oct 1996 | A |
5666662 | Shibuya | Sep 1997 | A |
5717406 | Sanderford et al. | Feb 1998 | A |
5732354 | MacDonald | Mar 1998 | A |
6112095 | Wax et al. | Aug 2000 | A |
6115605 | Siccardo et al. | Sep 2000 | A |
6134338 | Solberg et al. | Oct 2000 | A |
6134448 | Shoji et al. | Oct 2000 | A |
6140964 | Sugiura et al. | Oct 2000 | A |
6167274 | Smith | Dec 2000 | A |
6198935 | Saha et al. | Mar 2001 | B1 |
6212391 | Saleh et al. | Apr 2001 | B1 |
6226400 | Doll | May 2001 | B1 |
6236365 | LeBlanc et al. | May 2001 | B1 |
6243811 | Patel | Jun 2001 | B1 |
6249252 | Dupray | Jun 2001 | B1 |
6269246 | Rao et al. | Jul 2001 | B1 |
6272541 | Cromer et al. | Aug 2001 | B1 |
6275190 | Sugiura et al. | Aug 2001 | B1 |
6282427 | Larsson et al. | Aug 2001 | B1 |
6304218 | Sugiura et al. | Oct 2001 | B1 |
6317599 | Rappaport et al. | Nov 2001 | B1 |
6317604 | Kovach, Jr. et al. | Nov 2001 | B1 |
6414634 | Tekinay | Jul 2002 | B1 |
6415155 | Koshima et al. | Jul 2002 | B1 |
6441777 | McDonald | Aug 2002 | B1 |
6456892 | Dara-Abrams et al. | Sep 2002 | B1 |
6526283 | Jang | Feb 2003 | B1 |
6556942 | Smith | Apr 2003 | B1 |
6581000 | Hills et al. | Jun 2003 | B2 |
6631267 | Clarkson et al. | Oct 2003 | B1 |
6664925 | Moore et al. | Dec 2003 | B1 |
6679903 | Kurz | Jan 2004 | B2 |
6704352 | Johnson | Mar 2004 | B1 |
6728782 | D'Souza et al. | Apr 2004 | B1 |
6754488 | Won et al. | Jun 2004 | B1 |
6766453 | Nessett et al. | Jul 2004 | B1 |
6799047 | Bahl et al. | Sep 2004 | B1 |
6804394 | Hsu | Oct 2004 | B1 |
6834180 | Marshall | Dec 2004 | B1 |
6839468 | Mitchell et al. | Jan 2005 | B1 |
6850946 | Rappaport et al. | Feb 2005 | B1 |
6990928 | Kurtgis | Jan 2006 | B2 |
7162507 | Carter | Jan 2007 | B2 |
20020045424 | Lee | Apr 2002 | A1 |
20020102988 | Myllymaki | Aug 2002 | A1 |
20020115445 | Myllymaki | Aug 2002 | A1 |
20020118118 | Myllymaki et al. | Aug 2002 | A1 |
20020154134 | Matsui | Oct 2002 | A1 |
20020168958 | Ford et al. | Nov 2002 | A1 |
20020174335 | Zhang et al. | Nov 2002 | A1 |
20020176366 | Ayyagari et al. | Nov 2002 | A1 |
20030117985 | Fujii et al. | Jun 2003 | A1 |
20030130987 | Edlund et al. | Jul 2003 | A1 |
20030135486 | Edlund et al. | Jul 2003 | A1 |
20030135762 | Macaulay | Jul 2003 | A1 |
20040066757 | Molteni et al. | Apr 2004 | A1 |
20040072577 | Myllymaki et al. | Apr 2004 | A1 |
20040111397 | Chen et al. | Jun 2004 | A1 |
20040116111 | Saunders | Jun 2004 | A1 |
20040151377 | Boose et al. | Aug 2004 | A1 |
20040166878 | Erskine et al. | Aug 2004 | A1 |
20040176108 | Misikangas | Sep 2004 | A1 |
20040186847 | Rappaport et al. | Sep 2004 | A1 |
20040198373 | Ford et al. | Oct 2004 | A1 |
20040198392 | Harvey et al. | Oct 2004 | A1 |
20040203910 | Hind et al. | Oct 2004 | A1 |
20040236547 | Rappaport et al. | Nov 2004 | A1 |
20040259554 | Rappaport et al. | Dec 2004 | A1 |
20040259555 | Rappaport et al. | Dec 2004 | A1 |
20050043933 | Rappaport et al. | Feb 2005 | A1 |
20050128139 | Misikangas et al. | Jun 2005 | A1 |
20050131635 | Myllymaki et al. | Jun 2005 | A1 |
20050136944 | Misikangas et al. | Jun 2005 | A1 |
20050185615 | Zegelin | Aug 2005 | A1 |
20050245252 | Kappes et al. | Nov 2005 | A1 |
20070206025 | Oka | Sep 2007 | A1 |
Number | Date | Country | |
---|---|---|---|
20080166973 A1 | Jul 2008 | US |