The present invention relates to power management in wireless local area networks (WLANs), and more particularly to a dynamic per-client power management in WLANs.
Wireless local area network (WLAN) is an important technology, for providing Internet access to users. Managed WLANs refer to deployments in which all access points (APs) are under the same administrative domain. Example of such managed WLANs include small-range corporate networks and campus networks, hot-spot networks, such as T-mobile, and city-wide networks, such as Google's Wifi, MIT's roofnet, and Houston's urban network. In order to provide maximal coverage, such networks often contain multiple APs with overlapping transmission and frequency ranges. While coverage depends on the transmission ranges of the APs, the performance of each AP depends on the inference ranges of neighboring APs. Greater overlap of interference and transmission ranges can lead to increased contention for transmission channels and increased packet collisions. As a result, in a dense deployment of APs for maximal coverage, each AP often operates at sub-optimal performance due to interference from neighboring APs, thereby reducing overall network throughput.
Conventional approaches for mitigating interference and improving spatial reuse (i.e., increasing the number of simultaneous AP-client transmissions) include using non-overlapping transmission channels for interfering APs, and tuning each AP's transmission power to an optimum level. The approach of using non-overlapping transmission channels suffers from a scarcity of non-overlapping channels in the 802.11a/b/g standard, which is commonly used for WLANs. The approach of tuning each AP's transmission power level to an optimum level requires an AP to use the same power level to transmit to all of its clients.
The present invention is directed to a system and method that provide improved spatial reuse in a wireless local area network (WLAN) by dynamically tuning an access point's (AP) transmission power on a per-client basis. According to embodiments of the present invention, APs can transmit data packets to a client at the lowest transmission power at which the client can successfully receive the data packets.
According to one embodiment of the present invention, an AP in a WLAN services multiple clients. The AP associates each of its clients with a minimum power level. The AP transmits data packets, at each of multiple scheduled power levels, to clients associated with a minimum power level that is less than the scheduled power level. The AP can also generate refinement hints for adjusting the schedule of power levels, and upgrade the minimum power levels associated with its clients.
According to another embodiment of the present invention, a WLAN includes multiple APs, each servicing multiple clients, and a central controller. Each AP associates each of its clients with a minimum power level. The central controller generates a schedule for transmission at each of multiple transmission power levels for a corresponding transmission time. Based on the schedule, each AP transmits at each of the transmission power levels for the corresponding transmission time. Each AP transmits data packets, at the scheduled transmission power level, to clients associated with a minimum power level that is less than the scheduled power level. Each AP can transmit refinement hints to the central controller, and the central controller can refine the global schedule based on the refinement hints. Each AP can also upgrade the minimum power levels associated with its clients.
These and other advantages of the invention will be apparent to those of ordinary skill in the art by reference to the following detailed description and the accompanying drawings.
The present invention is directed to improving spatial reuse in a wireless local area network (WLAN) by per-client dynamic power management. Embodiments of the present invention are directed to per-client dynamic power management in a managed WLAN, in which all of access points (APs) are under the same administrative control.
The APs 104, 106, and 108 and the controller 102 of
According to an embodiment of the present invention, an AP in a WLAN can transmit data packets at different power levels for different clients. However, when multiple APs vary power levels independently of each other, asymmetric links and increased hidden nodes can occur.
In the hidden node problem of
As illustrated in
At step 404, at each AP, each client of the AP is associated with a minimum power level. Each AP maps each of its clients to a minimum power level at which the delivery ratio is greater than a threshold value.
Returning to
T represents the period of the envelope 602. According to an embodiment of the present, the envelope can be generated with the times τk initially set to a default allocation of T/n, such that the amount of time scheduled for each power level is equal n the initial envelope.
Returning to
A client performance monitor 720 stores client performance data, such as delivery ratios, which is used to generate refinement hints which are transmitted to the central control (steps 410 and 412). The client performance data is also used by a client to power application 722 to map clients to the minimum power levels 708, 710, and 712 (step 402), and determine whether to upgrade a minimum power level of a client (step 414).
Returning to
At step 410, refinement hints are transmitted from each AP to the central controller. Each AP determines refinement hints to adjust the envelope to better meet requirements of the AP's clients (including their position, traffic, etc.) referring again to
where ρi represents the maximum transmission rate at power level Pi, and T represents the period of the envelope. Each AP transmits the refinement hints indicating determined by that AP to the controller.
At step 412, the schedule for the power levels is refined by the controller based on the refinement hints received at the controller from each of the APs. In refining the envelope, the central controller first assigns a minimum time allocation to each power level. The controller can calculate the minimum time allocation for the APs to transmit at each power level as:
where tkj represents the time
at power level Pk requested by AP j in the refinements hints. Once the controller has assigned a minimum allocation to each power level, the controller distributes the remaining time out of the period T among power levels that require more than the minimum allocation. Let S=T−Σkτk represent the total slack out of the period T, where Σkτk denotes the total time used up in allocating the minimum time for each power level. Further, let Dk=(∀j MAX(tkj))−τk denote the deficit at each power level. The total slack can be distributed by iterating over the power levels with non-zero deficit and fulfilling the deficit of the highest power level in each iteration until all the residual slack is allocated, or there exists no more power levels with non-zero deficit. The remaining slack, if any can be distributed among all of the power levels proportional to their current allocation.
The controller sends the new (refined) envelope to each of the APs, with a new real-time far enough in the future that every AP received the new envelope before their clocks reach the real-time. Accordingly, the method returns to step 408, and at the specified real-time, each AP transmits data packets based on the refined schedule.
At step 414, for each AP, it is determined whether the delivery ratio for any client is less than a threshold. If the delivery ratio is not less than the threshold for any clients of an AP, the method returns to step 408, and the AP continues transmitting data packets based on the same minimum power levels. If the delivery ratio for a client is less than the threshold, the method proceeds to step 416.
At step 416, the AP upgrades the minimum power level for the client. The AP can monitor delivery ratios of its clients at regular intervals, and if the delivery ratio for a client falls below a certain threshold, the AP associates the client with the minimum power level that is one higher than the client's previous minimum power level. The method then returns to step 408, and the AP transmits data packets to the client based on the upgraded minimum power level for the client. According to a possible implementation, the client can then be downgraded to its default minimum power level at regular intervals to ensure that clients will not be permanently upgraded to higher power levels due to transient problems in delivery ratio.
The foregoing Detailed Description is to be understood as being in every respect illustrative and exemplary, but not restrictive, and the scope of the invention disclosed herein is not to be determined from the Detailed Description, but rather from the claims as interpreted according to the full breadth permitted by the patent laws. It is to be understood that the embodiments shown and described herein are only illustrative of the principles of the present invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention. Those skilled in the art could implement various other feature combinations without departing from the scope and spirit of the invention.
This application claims the benefit of U.S. Provisional Application No. 60/868,416 filed Dec. 4, 2006, the disclosure of which is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5530918 | Jasinski | Jun 1996 | A |
6728550 | Bohnke et al. | Apr 2004 | B1 |
6907229 | Shpak | Jun 2005 | B2 |
6987738 | Subramanian et al. | Jan 2006 | B2 |
7383057 | Senarath et al. | Jun 2008 | B1 |
7403499 | Shapira | Jul 2008 | B2 |
7627336 | Carlsson et al. | Dec 2009 | B2 |
7647516 | Ranganathan et al. | Jan 2010 | B2 |
7702351 | Soliman | Apr 2010 | B2 |
7756542 | Kaiser et al. | Jul 2010 | B1 |
7756548 | Laroia et al. | Jul 2010 | B2 |
20030022686 | Soomro | Jan 2003 | A1 |
20040082356 | Walton | Apr 2004 | A1 |
20040142715 | Oses | Jul 2004 | A1 |
20050041605 | Benson | Feb 2005 | A1 |
20050197147 | Stephens | Sep 2005 | A1 |
20060120338 | Hwang | Jun 2006 | A1 |
20060193296 | Zhong | Aug 2006 | A1 |
20070002803 | Destino | Jan 2007 | A1 |
20070091853 | Carlsson et al. | Apr 2007 | A1 |
20070201540 | Berkman | Aug 2007 | A1 |
20070224936 | Desai | Sep 2007 | A1 |
20070230392 | Adams | Oct 2007 | A1 |
20080248760 | Booker et al. | Oct 2008 | A1 |
20100214966 | Hu et al. | Aug 2010 | A1 |
Number | Date | Country | |
---|---|---|---|
20080130541 A1 | Jun 2008 | US |
Number | Date | Country | |
---|---|---|---|
60868416 | Dec 2006 | US |