This invention relates generally to the field of wireless communications, and more particularly to synchronization and transmission power management of fixed location wireless devices to facilitate channel selection.
Initial channel selection by fixed location devices such as access points in a wireless network such as a WLAN can be problematic. Many access points are configured to attempt to begin operation on a particular channel, regardless of vendor. If there is a loss of power to the WLAN and all access point s initially attempt to begin operation on a single channel then there is likely to be interference and poor performance. Even if the WLAN is configured to migrate access points to other channels over time, such as under the control of a server, significant delay may be experienced before the WLAN settles into a relatively stable configuration.
Referring to
As described in co-pending U.S. patent application Ser. No. 10/780,841, METHOD FOR SCANNING RADIO FREQUENCY CHANNELS, filed Feb. 18, 2004, which is incorporated by reference, initial channel selection includes a plurality of sequential steps (intervals) which are executed by the access points (100-114). From the perspective of access point (104), for example, in the scan interval the access point scans potential radio frequency channels and listens for messages from other access points on those radio frequency channels. Messages received from other access points during channel selection, e.g., access points (100, 102, 106, 108), are used by the access point (104) to construct a scan table having an entry for each access point from which a message is received during the scan interval. The access point also maintains a channel map having an entry for each of the radio frequency channels on which a message was received. Each entry contains the device ID of the access point that sent a message on the corresponding channel. The access point (104) sorts the channel map into a triplet channel map, wherein each successive group of three entries is associated with three successive channels, and wherein the average power is stored in the entry for each channel. The access point then selects, from the triplet channel map, the channel with the lowest center average power. The access point then transmits preclaim messages on the selected channel during a preclaim interval, and listens for messages on the selected channel. The scan table is updated based on each message received on the selected channel during the preclaim interval. The access point also calculates an adjacency vector sum which represents the sum of all average power levels on all channels. During a claim interval, the access point transmits claim messages on the selected channel. The claim messages including the adjacency vector sum. The access point also listens for, and records, messages from other access points on the selected channel, including adjacency vector sums. The access point maintains a claim table having an entry for each device ID that sent a message on the selected channel during the claim interval, and evaluates the claim table at the end of the claim interval. The evaluation includes the following steps:
The above-described procedure functions quite well where the access points are identical and the WLAN operates in “clean air,” i.e., without interference from other devices. However, if the access points are not identical then differences in reboot speed and software execution speed can result in asynchronous operation. This can happen because different access points utilize different operating systems and different hardware. In extreme cases, one access point may complete channel selection before another access point has even begun channel selection. Further, interference caused by other devices may degrade the exchange of messages on which the procedure is partially based. The result is often a non-ideal channel selection.
Referring to
State 2 provides synchronization of transition of the access points between State 1 and State 3. When the access point is in State 2, it continues to transmit pre-scan frames. However, the pre-scan frames now have the sync-mark bit set in order to indicate that the access point is in State 2. The access point continues to listen for pre-scan frames from other access points to determine whether those access points have transitioned to State 2, i.e., by reading the sync-mark bit in the received frames. The access point transitions to State 3 when one of three conditions occurs. The first condition is when all detected access points have transmitted pre-scan frames with the sync-mark bit set, i.e., when all detected access points have signaled readiness to move to State 3. The second condition is when the max pre-scan time has elapsed. The third condition is when countdown messages are received from another access point, thereby indicating that some access points has moved to State 3.
State 3 provides further synchronization. In State 3 the access point begins a countdown to transition to the scan interval, e.g., a 50 ms timer. While counting down, the access point continues to transmit pre-scan frames. However, the pre-scan frames now advertise the state of the countdown timer, e.g., 10 ms until transition to scan interval. The access point continues to listen for pre-scan frames from other access points. If differences in the countdown state are detected, e.g., because of clock speed, the access points re-synchronize. Resynchronization can be accomplished by adopting the countdown state of the slowest clock, i.e., the access point advertising the greatest amount of time remaining until transition to the scan interval. As already discussed, access points in State 1 and State 2 that detect the countdown will immediately transition to State 3, thereby providing further synchronization. When the countdown has elapsed, e.g., when the timer reaches 0, the access point transitions to the scan interval and proceeds with channel selection as already discussed above.
The access points may be further synchronized on the basis of scan cycle time, as advertised in the pre-scan frame (300). As discussed, the scan interval follows the pre-scan interval. In particular, an access point executes pre-scan once, followed by one or more scans. The scan cycle time is the total time required for an access point to go through one channel selection cycle, i.e., from scan to preclaim to claim. Since different access points may be built using different platforms that differ in terms of CPU, OS etc., the different access points can have different scan cycle times. In order for access points that need more than one scan cycle to select a channel, a procedure is executed to cause the access points to synchronize at the end of each scan cycle so that all access points re-enter the scan state contemporaneously. As already described, access points advertise their scan cycle time in the pre-scan frames during the pre-scan interval. In order to synchronize on the basis of scan cycle time, each receiving access point is operative in response to the advertised scan cycle time received from other access points to compare the advertised scan cycle time with the scan cycle time of the receiving access point. If the scan cycle time of the receiving access point is longer than the advertised scan cycle time the receiving access point continues to use its own scan cycle time, and to advertise that scan cycle time in subsequent pre-scan frames. However, if the received scan cycle time is longer then the access point adopts the longer scan cycle time as its own, and advertises that longer scan cycle time in subsequent pre-scan frames. Therefore, all access points eventually converge on the longest scan cycle time, as can be verified by examining the pre-scan frames from all the access points.
While the invention is described through the above exemplary embodiments, it will be understood by those of ordinary skill in the art that modification to and variation of the illustrated embodiments may be made without departing from the inventive concepts herein disclosed. Moreover, while the preferred embodiments are described in connection with various illustrative structures, one skilled in the art will recognize that the system may be embodied using a variety of specific structures. Accordingly, the invention should not be viewed as limited except by the scope and spirit of the appended claims.
A claim of priority is made to U.S. Provisional Patent Application 60/733,142, filed Nov. 3, 2005, entitled CHANNEL SELECTION—INITIAL CHANNEL SELECTION, which is incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5212831 | Chuang et al. | May 1993 | A |
5345597 | Strawczynski et al. | Sep 1994 | A |
5345598 | Dent | Sep 1994 | A |
5386589 | Kanai | Jan 1995 | A |
5475864 | Hamabe | Dec 1995 | A |
5493694 | Vlcek et al. | Feb 1996 | A |
5524280 | Douthitt et al. | Jun 1996 | A |
5541954 | Emi | Jul 1996 | A |
5551057 | Mitra | Aug 1996 | A |
5574968 | Olds et al. | Nov 1996 | A |
5574982 | Almgren et al. | Nov 1996 | A |
5606727 | Ueda | Feb 1997 | A |
5633888 | Stewart | May 1997 | A |
5724346 | Kobayashi et al. | Mar 1998 | A |
5740534 | Ayerst et al. | Apr 1998 | A |
5815811 | Pinard et al. | Sep 1998 | A |
5845212 | Tanaka | Dec 1998 | A |
5852780 | Wang et al. | Dec 1998 | A |
5886988 | Yun et al. | Mar 1999 | A |
5923702 | Ueda | Jul 1999 | A |
5924030 | Rautiola et al. | Jul 1999 | A |
5933420 | Jaszewski et al. | Aug 1999 | A |
5963848 | D'Avello | Oct 1999 | A |
5987062 | Engwer et al. | Nov 1999 | A |
6018663 | Karlsson et al. | Jan 2000 | A |
6029074 | Irvin | Feb 2000 | A |
6052562 | Dorenbosch | Apr 2000 | A |
6052596 | Barnickel | Apr 2000 | A |
6111867 | Mann | Aug 2000 | A |
6131015 | Hill et al. | Oct 2000 | A |
6144855 | Slovin | Nov 2000 | A |
6157626 | Nakamura et al. | Dec 2000 | A |
6195554 | H'mimy et al. | Feb 2001 | B1 |
6198924 | Ishii et al. | Mar 2001 | B1 |
6208629 | Jaszewski et al. | Mar 2001 | B1 |
6208631 | Kim | Mar 2001 | B1 |
6215779 | Bender | Apr 2001 | B1 |
6215811 | Yuen | Apr 2001 | B1 |
6259918 | Labonte et al. | Jul 2001 | B1 |
6266537 | Kashitani et al. | Jul 2001 | B1 |
6301482 | Shohara | Oct 2001 | B1 |
6332007 | Wu et al. | Dec 2001 | B1 |
6332077 | Wu et al. | Dec 2001 | B1 |
6334047 | Andersson et al. | Dec 2001 | B1 |
6374085 | Saints et al. | Apr 2002 | B1 |
6430408 | Dorenbosch | Aug 2002 | B1 |
6452498 | Stewart | Sep 2002 | B2 |
6515971 | Nelson et al. | Feb 2003 | B2 |
6522875 | Dowling et al. | Feb 2003 | B1 |
6522881 | Feder et al. | Feb 2003 | B1 |
6542716 | Dent et al. | Apr 2003 | B1 |
6560462 | Ravi et al. | May 2003 | B1 |
6574474 | Nielsen | Jun 2003 | B1 |
6574477 | Rathunde | Jun 2003 | B1 |
6580700 | Pinard et al. | Jun 2003 | B1 |
6580704 | Wellig et al. | Jun 2003 | B1 |
6591103 | Dunn et al. | Jul 2003 | B1 |
6597671 | Ahmadi et al. | Jul 2003 | B1 |
6633765 | Maggenti | Oct 2003 | B1 |
6636737 | Hills et al. | Oct 2003 | B1 |
6639904 | Boyer et al. | Oct 2003 | B1 |
6657981 | Lee et al. | Dec 2003 | B1 |
6681256 | Kuntze et al. | Jan 2004 | B1 |
6690944 | Lee et al. | Feb 2004 | B1 |
6693915 | Lappetelainen et al. | Feb 2004 | B1 |
6729929 | Sayers et al. | May 2004 | B1 |
6732163 | Halasz | May 2004 | B1 |
6738599 | Black et al. | May 2004 | B2 |
6741863 | Chiang et al. | May 2004 | B1 |
6757319 | Parsa et al. | Jun 2004 | B1 |
6760746 | Schneider | Jul 2004 | B1 |
6760748 | Hakim | Jul 2004 | B1 |
6760877 | Lappetelainen et al. | Jul 2004 | B1 |
6788940 | Bhatoolaul et al. | Sep 2004 | B2 |
6795407 | Chesson | Sep 2004 | B2 |
6801777 | Rusch | Oct 2004 | B2 |
6850499 | Wheatley et al. | Feb 2005 | B2 |
6870815 | McFarland et al. | Mar 2005 | B2 |
6888792 | Gronke | May 2005 | B2 |
6898198 | Ryan et al. | May 2005 | B1 |
6904021 | Belcea | Jun 2005 | B2 |
6905021 | Polumbaum et al. | Jun 2005 | B2 |
6907229 | Shpak | Jun 2005 | B2 |
6930986 | Dempo et al. | Aug 2005 | B2 |
6941143 | Mathur | Sep 2005 | B2 |
6954646 | Churt | Oct 2005 | B2 |
6959001 | Parks | Oct 2005 | B1 |
6973316 | Hayakawa | Dec 2005 | B1 |
6993334 | Andrus et al. | Jan 2006 | B2 |
6996127 | Rezaiifar et al. | Feb 2006 | B2 |
7016696 | Vincent et al. | Mar 2006 | B2 |
7020439 | Sinivaara et al. | Mar 2006 | B2 |
7035314 | Linsky | Apr 2006 | B1 |
7050479 | Kim | May 2006 | B1 |
7054640 | Bing et al. | May 2006 | B2 |
7076220 | Backes et al. | Jul 2006 | B2 |
7133386 | Holur et al. | Nov 2006 | B2 |
7136665 | Ida et al. | Nov 2006 | B2 |
7146300 | Zammit et al. | Dec 2006 | B2 |
7162507 | Carter | Jan 2007 | B2 |
7167696 | Backes et al. | Jan 2007 | B2 |
7173918 | Awater et al. | Feb 2007 | B2 |
7206297 | Backes | Apr 2007 | B2 |
7206840 | Choi et al. | Apr 2007 | B2 |
7215661 | Backes et al. | May 2007 | B2 |
7269260 | Adachi et al. | Sep 2007 | B2 |
7280520 | Melville et al. | Oct 2007 | B2 |
7359363 | Sakai | Apr 2008 | B2 |
7486616 | Kitchin | Feb 2009 | B2 |
20010010460 | Miller et al. | Aug 2001 | A1 |
20010046879 | Schramm et al. | Nov 2001 | A1 |
20010048744 | Kimura | Dec 2001 | A1 |
20020012332 | Tiedemann et al. | Jan 2002 | A1 |
20020016180 | Derosier et al. | Feb 2002 | A1 |
20020038336 | Abileah et al. | Mar 2002 | A1 |
20020042268 | Cotanis | Apr 2002 | A1 |
20020060995 | Cervello et al. | May 2002 | A1 |
20020065081 | Barany et al. | May 2002 | A1 |
20020085719 | Crosbie | Jul 2002 | A1 |
20020090966 | Hansen et al. | Jul 2002 | A1 |
20020097696 | Kossi et al. | Jul 2002 | A1 |
20020141368 | Cheung et al. | Oct 2002 | A1 |
20020141375 | Choi | Oct 2002 | A1 |
20020142771 | Saifullah et al. | Oct 2002 | A1 |
20020147031 | Hood, III | Oct 2002 | A1 |
20020172186 | Larsson | Nov 2002 | A1 |
20020176437 | Busch et al. | Nov 2002 | A1 |
20020181417 | Malhotra et al. | Dec 2002 | A1 |
20020188723 | Choi et al. | Dec 2002 | A1 |
20020191554 | Kondo | Dec 2002 | A1 |
20020191561 | Chen et al. | Dec 2002 | A1 |
20020193113 | Sayeedi et al. | Dec 2002 | A1 |
20020193133 | Shibutani | Dec 2002 | A1 |
20030002456 | Soomro et al. | Jan 2003 | A1 |
20030012174 | Bender et al. | Jan 2003 | A1 |
20030022686 | Soomro et al. | Jan 2003 | A1 |
20030022692 | Ueno | Jan 2003 | A1 |
20030035442 | Eng | Feb 2003 | A1 |
20030036374 | English et al. | Feb 2003 | A1 |
20030040319 | Hansen et al. | Feb 2003 | A1 |
20030050066 | Tobe et al. | Mar 2003 | A1 |
20030076852 | Fukui | Apr 2003 | A1 |
20030081654 | Cooklev et al. | May 2003 | A1 |
20030083095 | Liang | May 2003 | A1 |
20030086437 | Benveniste | May 2003 | A1 |
20030087646 | Funato et al. | May 2003 | A1 |
20030100328 | Klein et al. | May 2003 | A1 |
20030134642 | Kostic et al. | Jul 2003 | A1 |
20030174667 | Krishnamurthi et al. | Sep 2003 | A1 |
20030181211 | Razavilar et al. | Sep 2003 | A1 |
20030185233 | Ji et al. | Oct 2003 | A1 |
20030190915 | Rinne et al. | Oct 2003 | A1 |
20030198305 | Taylor et al. | Oct 2003 | A1 |
20030207699 | Shpak | Nov 2003 | A1 |
20030223354 | Olszewski | Dec 2003 | A1 |
20030231655 | Kelton et al. | Dec 2003 | A1 |
20030236064 | Shiohara et al. | Dec 2003 | A1 |
20040001467 | Cromer et al. | Jan 2004 | A1 |
20040003285 | Whelan et al. | Jan 2004 | A1 |
20040008645 | Janevski et al. | Jan 2004 | A1 |
20040014422 | Kallio | Jan 2004 | A1 |
20040022219 | Mangold et al. | Feb 2004 | A1 |
20040023629 | Klank | Feb 2004 | A1 |
20040023674 | Miller | Feb 2004 | A1 |
20040027284 | Leeper et al. | Feb 2004 | A1 |
20040037247 | Ngo | Feb 2004 | A1 |
20040038697 | Attar et al. | Feb 2004 | A1 |
20040039817 | Lee et al. | Feb 2004 | A1 |
20040047335 | Proctor et al. | Mar 2004 | A1 |
20040054767 | Karaoguz et al. | Mar 2004 | A1 |
20040054774 | Barber et al. | Mar 2004 | A1 |
20040057507 | Rotstein et al. | Mar 2004 | A1 |
20040066759 | Molteni et al. | Apr 2004 | A1 |
20040071110 | Guey et al. | Apr 2004 | A1 |
20040095902 | Larola et al. | May 2004 | A1 |
20040121749 | Cui et al. | Jun 2004 | A1 |
20040121765 | Idnani et al. | Jun 2004 | A1 |
20040132458 | Bing et al. | Jul 2004 | A1 |
20040137915 | Diener et al. | Jul 2004 | A1 |
20040146021 | Fors et al. | Jul 2004 | A1 |
20040151137 | McFarland et al. | Aug 2004 | A1 |
20040156336 | McFarland et al. | Aug 2004 | A1 |
20040157613 | Steer et al. | Aug 2004 | A1 |
20040160908 | Perlman | Aug 2004 | A1 |
20040162084 | Wang | Aug 2004 | A1 |
20040165557 | Backes et al. | Aug 2004 | A1 |
20040166849 | Hawe | Aug 2004 | A1 |
20040166867 | Hawe | Aug 2004 | A1 |
20040174852 | Backes et al. | Sep 2004 | A1 |
20040192279 | Backes et al. | Sep 2004 | A1 |
20040202141 | Sinivaara et al. | Oct 2004 | A1 |
20040203783 | Wu et al. | Oct 2004 | A1 |
20040203828 | Mirchandani et al. | Oct 2004 | A1 |
20040203863 | Huomo | Oct 2004 | A1 |
20040208151 | Haverinen et al. | Oct 2004 | A1 |
20040214572 | Thompson et al. | Oct 2004 | A1 |
20040214590 | Al-Housami et al. | Oct 2004 | A1 |
20040219920 | Love et al. | Nov 2004 | A1 |
20040266351 | Chuah et al. | Dec 2004 | A1 |
20050003827 | Whelan | Jan 2005 | A1 |
20050013275 | Black et al. | Jan 2005 | A1 |
20050026610 | Backes et al. | Feb 2005 | A1 |
20050032506 | Walker | Feb 2005 | A1 |
20050047354 | Zeira et al. | Mar 2005 | A1 |
20050074030 | Cho et al. | Apr 2005 | A1 |
20050090250 | Backes | Apr 2005 | A1 |
20050117524 | Lee et al. | Jun 2005 | A1 |
20050118981 | Laroia et al. | Jun 2005 | A1 |
20050124335 | Cave et al. | Jun 2005 | A1 |
20050130677 | Muenier et al. | Jun 2005 | A1 |
20050148336 | Nagato et al. | Jul 2005 | A1 |
20050152480 | Chang et al. | Jul 2005 | A1 |
20050180356 | Gillies et al. | Aug 2005 | A1 |
20050190730 | Dore et al. | Sep 2005 | A1 |
20050195786 | Shpak | Sep 2005 | A1 |
20050232200 | Jeong et al. | Oct 2005 | A1 |
20050245269 | Demirhan et al. | Nov 2005 | A1 |
20050250511 | Xiao et al. | Nov 2005 | A1 |
20060013179 | Yamane | Jan 2006 | A1 |
20060068781 | Lam | Mar 2006 | A1 |
20060082489 | Liu et al. | Apr 2006 | A1 |
20060089138 | Smith et al. | Apr 2006 | A1 |
20060094371 | Nguyen | May 2006 | A1 |
20060120302 | Poncini et al. | Jun 2006 | A1 |
20070041398 | Benveniste | Feb 2007 | A1 |
20070058581 | Benveniste | Mar 2007 | A1 |
20070111730 | Baker et al. | May 2007 | A1 |
20070286143 | Olson et al. | Dec 2007 | A1 |
20070286425 | Adachi et al. | Dec 2007 | A1 |
Number | Date | Country |
---|---|---|
WO 2004059933 | Jul 2004 | WO |
Entry |
---|
IEEE, Wireless LAN Mediumj Access Control (MAC) and Physical Layer (PHY) specifications, Standard 802.11, 1999 edition, Reference No. ISO/IEC 8802-11:1999(E), 528 Pages. |
Michael Barr, Toward a Smaller Java, Embedded.com, Jun. 14, 2002, pp. 1-9. |
Moustafa Youssef, “Handling Samples Correlation in the Horus System”, IEEE INFOCOM 2004. |
Kin K. Leung “Integrated Link Adaptation and Power Control for Wireless IP Networks”, At&T Labs—research, Jan. 19, 2000. |
Ana Zapater et al., “Development and implementation of a Bluetooth Networking Infrastructure for the a Notebook—University Scenario”, Institute of Communications Engineering, University of Hannover, May 13, 2003. |
Walter Klotz, “Graph Coloring Algorithms”, 1999. |
Brent N. Chun et. Al., “Market-based Proportional esource Sharing for Flusters”, University of California at Berkeley computer Science Division, Sep. 1999. |
The Four Color Theorem, Web page, author(s) unknow, updated Nov. 13, 1995. |
IEEE Std 802.11h-2003, IEEE Standard for Information technology Telecommunications and Information exchange between systems Local and metropolitan area networks Specific requirements, Oct. 14, 2003, 59 pages. |
U.S. Appl. No. 10/781,204, Apparatus for Adjusting Channel Interference between Devices in a Wireless Network. |
U.S. Appl. No. 10/781,159, Patent No. 7,215,973, Apparatus for Adjusting Channel Interference between Access Points in a Wireless Network. |
U.S. Appl. No. 10/781,219, Patent No. 7,369,858, Apparatus for Self-Adjusting Power at a Wireless Station to Reduce Inter-channel Interference. |
U.S. Appl. No. 10/781,535, Patent No. 7,228,149, Method for Adjusting Channel Interference between Devices in a Wireless Network. |
U.S. Appl. No. 10/781,474, Patent No. 7,221,954, Method for Adjusting Channel Interference between Access Points in a Wireless Network. |
U.S. Appl. No. 10/780,775, Patent No. 7,295,537, Method for Self-Adjusting Power at a Wireless Station to Reduce Inter-channel Interference. |
U.S. Appl. No. 10/781,191, Patent No. 7,653,407, Program for Adjusting Channel Interference between Devices in a Wireless Network. |
U.S. Appl. No. 10/781,137, Program for Adjusting Channel Interference between Access Points in a Wireless Network. |
U.S. Appl. No. 10/781,536, Patent No. 7,149,539, Program for Self-Adjusting Power at a Wireless Station to Reduce Inter-channel Interference. |
U.S. Appl. No. 12/652,146, Program for Adjusting Channel Interference between Access Points in a Wireless Network. |
U.S. Appl. No. 12/437,085, Program for Adjusting Channel Interference between Devices in a Wireless Network. |
U.S. Appl. No. 12/359,683, Program for Selecting an Optimum Access Point in a Wireless Network. |
U.S. Appl. No. 12/359,545, Method for Selecting an Optimum Access Point in a Wireless Network on a Common Channel. |
U.S. Appl. No. 11/866,445, Wireless Network Apparatus and System Filed of the Invention. |
U.S. Appl. No. 11/676,542, Program for Distributed Channel Selection, Power Adjustment and Load Balancing Decisions in a Wireless Network. |
U.S. Appl. No. 10/673,636, Patent No. 7,606,573, a Wireless Switched Network. |
Number | Date | Country | |
---|---|---|---|
20070097940 A1 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
60733142 | Nov 2005 | US |