Hierarchical channel assignment in wireless networks

Abstract

Aspects of the disclosed technology address the problems of calculating and performing channel assignments for access points (APs) in a wireless network. In some aspects, a process for performing channel assignment can include steps for identifying multiple APs in a network, each of the wireless APs being associated with an initial channel assignment, selecting an AP from among the wireless APs in the network, determining a channel quality for the initial channel assignment associated with the AP, and selecting a new channel for the AP based on the channel quality. In some aspects, the process further includes steps for selecting a second AP, determining a channel quality for the initial channel assignment associated with the second AP, and selecting a new channel for the second AP based on the channel quality. Systems and machine-readable media are also provided.

Description

BACKGROUND

1. Technical Field

The subject technology provides solutions for performing wireless channel assignments in a wireless network and in particular, for determining optimal channel assignments for hierarchical groups of access points (APs).

2. Introduction

In general, IEEE 802.11 Wireless Local Area Network (WLAN) designs are much simpler than that of the 3G networks because the IEEE 802.11 standard was devised to serve a confined area (e.g., a link distance of at most several hundred meters) with stationary and slow-moving users, while the 3G specifications were developed for greater flexibility, coverage and mobility. As a result, the IEEE 802.11 network can support data rates higher than those by the 3G networks.

Networks based on the IEEE 802.11 standard operate in the unlicensed Industrial, Scientific and Medical (ISM) band. Despite the relatively abundant spectrum (i.e., a total of 75 MHz in the 2.4 GHz Band) at the ISM band, as IEEE 802.11 networks are deployed widely, they start to interfere with each other. Such interference leads to a degradation in network throughput.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only example aspects of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:

FIG. 1 illustrates an example wireless network environment in which some aspects of the technology can be implemented.

FIG. 2A conceptually illustrates a channel calculation performed on a node-by-node basis, using a hierarchical channel assignment algorithm of the subject technology.

FIG. 2B conceptually illustrates a one-hop-neighbor channel calculation performed using a hierarchical channel assignment algorithm of the subject technology.

FIG. 2C conceptually illustrates a two-hop-neighbor channel calculation performed using a hierarchical channel assignment algorithm of the subject technology.

FIGS. 3A and 3B illustrate steps of example processes for implementing hierarchical channel reassignment techniques, according to some aspects of the technology.

FIG. 4 illustrates an example network device on which some aspects of the technology can be implemented.

DETAILED DESCRIPTION

The detailed description set forth below is intended as a description of various configurations of the subject technology and is not intended to represent the only configurations in which the subject technology can be practiced. The appended drawings are incorporated herein and constitute a part of the detailed description. The detailed description includes specific details for the purpose of providing a more thorough understanding of the subject technology. However, it will be clear and apparent that the subject technology is not limited to the specific details set forth herein and may be practiced without these details. In some instances, structures and components are shown in block diagram form in order to avoid obscuring the concepts of the subject technology.

Overview:

Frequency planning, i.e., allocation of a limited number of frequencies, for an IEEE 802.11 network is different from that of a traditional cellular network. In typical cellular networks, such as those based on the Global System for Mobile Communications (GSM) and Enhanced Data GSM Evolution (EDGE) standards, two separate radio channels, namely the traffic and control channels, are used to carry user data and control traffic. After the information is successfully received and processed by a base station (BS), the terminal is assigned with a specific traffic channel for transmitting its data traffic.

There is no such distinction between control and traffic channels in IEEE 802.11 networks. Instead, all user data and control information (in both directions between terminals and APs) are carried on the same physical channel. Access to the channel by multiple transmitters is coordinated by the MAC protocol, e.g., the well-known, Carrier Sense Multiple Access (CSMA) protocol with collision avoidance feature. Although the MAC CSMA protocol helps to mitigate much of the co-channel interference in large multi-cell IEEE 802.11 networks, network performance is still often degraded by adjacent-channel interference.

Due to the multiplicity of available channels (frequency bands), APs in conventional wireless deployments typically select an initial channel, and change selections only when significant interference is detected. Due to the potentially large number of nodes in a wireless network, and changing network conditions (e.g., the addition and subtraction of nodes), it is computationally difficult to determine optimal channel assignments for each wireless node in the network. The computation difficulty of optimal channel assignment calculations increases quickly with each added node, making the problem “NP-complete.” The problem is made further intractable by the dynamic nature of modern wireless deployments; the need for more frequent channel re-assignment is increased as nodes join, leave, and move within the network.

DESCRIPTION

Aspects of the disclosed technology provide solutions for calculating channel assignments for network nodes (e.g., APs), which can be performed quickly and therefore more frequently, to accommodate changing network characteristics. In some approaches, channel assignments/re-assignments can be calculated in an ordered hierarchy, wherein each “layer” of channel calculation hierarchy is performed with concurrent consideration of channel performance of a selected node and each peer node in a defined group, for example, that is based on network distance.

As discussed in further detail below, a process of channel assignment/re-assignment of the disclosed technology can include steps for identifying a multitude of wireless access points (APs) in a wireless network, each of the wireless APs being associated with an initial channel assignment, selecting an AP in the network, determining a channel quality for the channel assignment associated with the AP, and selecting a new channel for the AP based on the channel quality for the initial channel assignment associated with the first AP. In some aspects, the process can further include steps for selecting a second AP from among the APs in the network, determining a channel quality for the channel assignment associated with the second AP, and selecting a new channel for the second AP based on the channel quality for the initial channel assignment associated with the second AP.

FIG. 1 illustrates an example wireless network environment 100 in which some aspects of the technology can be implemented. Environment 100 includes multiple wireless nodes, such as access points (APs) 110, and access terminals (ATs) 120. Access points 110 can communicate, e.g., according to an IEEE 802.11 protocol, with one or more corresponding ATs 120 on a respective downlink and uplink.

The downlink (i.e., forward link) is the communication link from a given access point 110 to the respectively serviced access terminal 120, and the uplink (i.e., reverse link) is the communication link from one of access terminals 120 to the respective access point 110. In the illustrated example, AP 110a is associated with ATs 120a and 120b; AP110b is associated with ATs 120c and 120d; AP 110c is associated with AT 120e; and AP 110d is associated with AT 120f. It is understood that an AT may also communicate peer-to-peer with another ATs. A system controller 130 couples to and provides coordination and control for the APs. Additionally APs 110 can communicate with other devices coupled to a backbone network (not shown).

In environment 100, each of APs 110a, 110b, and 110c are configured for wireless communication with one another. That is, AP 110d communicates directly with AP 110c. Communication between AP 110d and 110a is facilitated via an intervening node, i.e., AP 100c. In this configuration, each of APs 110a, 110b, and 110c, are “one-hop” neighbors, i.e., they are in direct communication, without intervening network nodes. However, access point 110d is a “two-hop” neighbor of APs 110a, and 110b, since any transmissions sent/received at AP 110d must pass through an intervening node, i.e., AP 110c.

In practice, communication amongst ATs 120 is facilitated by wireless connectivity between APs 110. To reduce the occurrence of wireless collisions, each AP 110 is assigned to an initial channel that corresponds with a specific frequency band in which the AP operates. As discussed above, the likelihood of packet collisions increases if two proximately positioned APs share similar or adjacent channels.

To ensure that channel assignments of adjacent APs afford a high channel quality, a channel reassignment process of the subject technology can be utilized in which channel assignments are made based on a hierarchy of node groupings. In some implementations, channel assignments are made one an AP-by-AP basis, and subsequently updated, for example, by calculating channel assignments of all one-hop neighbors, and the two-hop neighbors, etc.

AP channel calculations are performed in a hierarchy of “layers”, in which channel assignments are determined for each node (or group of nodes) in a selected layer, and then re-iterated for each lower layer in the hierarchy. After channel calculations are performed for the selected layer (and iterated for all layers beneath the selected layer), channel calculations can then be made for the next layer up the hierarchy. By way of example, channel calculations begin at the lowest layer in the channel hierarchy (i.e., “layer 0”), in which channel determinations are made for each individual node. Because layer 0 represents the lowest layer in the channel hierarchy, the layer 0 calculation ends after each individual AP channel assignment has been made. Channel calculations are subsequently made for higher layers in the channel hierarchy, that is, the calculation process proceeds up to “layer 1.”

In the layer 1 calculation, channel determinations are performed for groups of nodes, for example, all one-hop neighbors of a selected node. After, one-hop group channel assignments have been made, layer 0 calculations are re-iterated, and the layer 1 calculation is complete. The channel calculation algorithm then proceeds up the hierarchy, e.g., to “layer 2” in which channel determinations are performed for groups of nodes comprising all two-hop neighbors of a selected node, followed by layer 1 calculations, and ending with layer 0 calculations. Those of skill in the art will recognize that there are no inherent limitations to the size of groups for which channel calculations can be performed. That is, there are no inherent limitations to the number of layers in a channel hierarchy, and channel calculations could be performed at a hierarchical layer in which a selected group includes every node in the network, without departing from the scope of the technology.

Additionally, in some aspects, the periodicity for computing channel assignments for a particular layer can vary on a layer-by-layer basis. By way of non-limiting example, layer 0 calculations may be performed with a periodicity of p0. Layer 1 calculations (including re-calculations of layer 0) may be performed with a periodicity of p1; and layer 2 calculations (including re-calculations for layer 1 and layer 0) performed with a periodicity of p2, where p0, p1, and p2 are all configured for different time values, such as, 15 minutes, 3 hours, and 1 day, respectively.

FIG. 2A conceptually illustrates four independent channel calculations performed, using a hierarchical channel assignment algorithm of the technology. In particular, FIG. 2A illustrates an example of a layer 0 channel calculation in which channel determinations for each AP are made on a node-by-node basis.

As illustrated, channel determinations for each of APs 210a, 210b, 210c, and 210d are independently determined, without regard to joint channel switching. For example, a channel is selected for AP 210a, based on frequency availability and other quality metrics with respect to AP 210a, but without consideration for the potential of switching to any currently assigned channels for APs 210b, 210c, or 210d. Similarly independent channel determinations are made for each of APs 210b, 210c, and 210d. Once new channel determinations have been made for each AP in the network, all layer 0 channel assignments are complete, and the process can move up to layer 1.

Using the layer 0 calculation illustrated in FIG. 2A, channel assignments for each AP are locally optimized, but channel selection is not coordinated between different APs. For example, AP 210a and AP 210b could be assigned to channels 6, and 8, respectively. AP 210a and AP 201b may both perform better on channels 8, and 6 respectively. However, due to the fact that channels 6 and 8 are currently occupied, channel assignments for both APs are constrained to only available channels.

FIG. 2B conceptually illustrates a one-hop neighbor (layer 1) channel calculation performed after all layer 0 calculations are complete. In the illustrated example, layer 1 channel re-assignments begin with the selection of AP 210a, and its one-hop network neighbors, i.e., APs 210b, and 210c. Channel calculations for each of APs 210a, 210b, and 210c, i.e., are performed to determine respective frequency assignments that concurrently maximize channel quality for each AP, that is, while taking consideration of the performance gains that may be realized by performing channel swaps between APs in the one-hop group. In this way, AP channel assignments are locally maximized for the assigned group consisting of the selected AP and all one-hop network neighbors.

By way of example, suppose that APs 210a, AP 210b, and AP 210c are assigned to channels 2, 4, and 6, respectively. However, channel calculations indicate that the optimal assignment would be to move APs 210a, 210b, and 210c to channels 6, 4, and 2. Based on the channel availability created by concurrent channel swapping, APs 210a, 210b, and 210c can be reassigned to channels 6, 4, and 2, without any conflict. That is, by taking consideration of each channel change jointly (as a layer 1 group), channel re-assignments can be made for each of APs 210a, 210b, and 210c, thereby optimizing the selected group.

Subsequently, any node that has not been re-assigned can be selected, i.e., AP 210d. In this example, AP 210 exists in a layer 1 (one-hop neighbor) group with AP 210b. However, since the channel with AP 210b has already been re-assigned in layer 1, channel reassignment calculations are only performed for AP 210d. Once the channel assignments are determined for one-hop groups across the network, layer 0 calculations can be re-iterated, as discussed above, completing channel computation for layer 1 of the hierarchy. Subsequently, layer 2 calculations can be performed, for example, in which channel calculations are performed for groups of two-hop neighbors, followed by re-calculation of layer 1 assignments, and terminating with re-calculation of layer 0 assignments, respectively.

The channel calculation process for any hierarchical layer can begin with the selection of a random network node. That is, multiple rounds of channel assignments can be simulated, e.g., by computing assignments for different groups through the selection of different initial nodes. In such approaches, different network-wide channel assignment solutions can be computed and compared without actual deployment, for example, to determine the optimal network-wide channel configuration. Once the optimal configuration is determined, changes can be physically deployed to the network.

FIG. 2C conceptually illustrates a two-hop neighbor (layer 2) channel calculation performed using a hierarchical channel assignment algorithm of the technology. In this example, since APs 210a, 210b, 210c, and 210d are all within a two-hop neighbor radius, the calculation of each new channel assignment is performed taking consideration of the channel quality metrics of each node, and permitting channel swapping between nodes in common two-hop groupings. That is, channel selections for each of APs 210a, 210b, 210c, and 210d are made taking consideration of channel quality for each node, for example, channel selections for each of APs 210a, 210b, 210c, and 210d are made jointly considered as a group. Subsequently, as discussed above, layer 1 calculations are re-iterated, followed by layer 0 channel calculations.

Any number of higher-layer channel calculations can be performed, e.g. considering three-hop, four-hop, or five-hop neighbors, etc., without departing from the technology. It is understood that, given enough computing resources, channel assignments for each node in entire network may be computed.

As would be understood by those of skill in the art, performance for any given node, groups of nodes, or network-wide performance, can depend on virtually any measurable network parameters. As such, channel performance calculations may vary depending on the desired implementation.

In some aspects, a utility function can be used to estimate performance on a channel c with channel width cw using the relationship of equation (1):

$\begin{array}{cc}\mathrm{NodeP}\left(c,\mathrm{cw}\right)=\prod _{b=20\mathrm{MHz}}^{\mathrm{cw}}{\mathrm{channel}}_{—}{\mathrm{metric}\left(c,b\right)}^{\mathrm{load}\left(b\right)}& \left(1\right)\end{array}$

where channel_metric(c,b)=airtime(c,b)×capacity(c,b), and where airtime (c,b) represents an estimated proportion of airtime th expected for a given node (AP) on a particular channel c with channel width b, and is calculated based on the channel utilization of the neighboring APs. In this example, capacity(c,b) can be estimated using the channel quality, non-wifi interference, and/or channel width, where load(b) is the channel usage, and is proportional to the number of associated clients with maximum channel width b. In the relationship provided by equation (1), NodeP can have two important properties: (i) if channel c is heavily utilized or there are many neighboring APs on the same channel, NodeP will quickly approach 0; and (ii) if associated clients do not support wider channel width, NodeP will not increase for wider channels. In such instances, an AP can avoid adjusting its channel width according to the client's capability.

Additionally, in some aspects, overall network performance (NetP) can be calculated using the relationship of equation (2):

$\begin{array}{cc}\mathrm{NetP}=\underset{r\in R}{\Pi }\mathrm{NodeP}& \left(2\right)\end{array}$

where NetP is the product of channel_metric weighted proportionally by load. In some implementations, this performance function can provide several benefits. First, per-client usage fairness can be maintained. The metric prefers to assign wider channels to APs with higher client density and usage. Second, single node failure is avoided. If spectrum coverage or total network throughput is the performance function, it is easy to have a high metric despite assigning poor channels to several nodes. In contrast, NetP will approach 0 as a single NodeP approaches 0.

FIG. 3A illustrates an example process 300 for implementing a hierarchical channel reassignment technique and in particular, steps for performing a layer 0 channel assignment, according to some aspects of the technology. Process 300 begins with step 302, in which multiple access points (APs) in a wireless network identified for channel re-assignment. Depending on implementation, every AP in the network may be a candidate for channel reassignment; however, a subset of APs may be identified/selected without departing from the scope the technology.

In step 304, a first AP is selected from among the identified APs in step 302. A channel quality for the currently assigned channel (i.e., the initial channel assignment) of the first AP is determined. Channel quality determinations can be based on essentially any measure or parameter that can be used to infer wireless signal quality at the AP. By way of non-limiting example, channel quality can be determined based on one or more of: received signal strength, bit or frame error rate, and/or packet loss metrics, etc.

In step 306 a first new channel for the first AP is selected, based on the channel quality determination made in step 304. In some instances, the determined channel quality for the initial channel assignment (step 304) may be compared to channel quality metrics computed for other available channels in the wireless medium. Therefore, the first new channel selected can be based on a comparison of quality metrics between current and available channel options.

Channel selection can also take into consideration a channel change penalty, such that different channels with equal, or only incrementally better quality metrics may not be preferred over a current channel assignment. Channel change penalties can prevent channel reassignment loops, for example, whereby AP channel assignments bounce between channels of comparable quality. In some aspects, channel change penalties can be function of various network parameters. For example, channel change penalties may be a function of a number of connected client nodes, or bandwidth of active traffic flows, etc.

In step 308, a second AP is selected, and a channel quality for the initial channel assignment for the second AP is determined. Similar to the process described above with respect to step 304, channel quality for the initial channel assignment associated with the second AP can be based on one or more metrics from which a received signal quality at the second AP is inferred.

In step 310, a second new channel for the second AP is selected based on the channel quality for the initial channel assignment of the second AP. As discussed above with respect to FIGS. 2A-2C, the AP selection and channel update process of steps 302-310 can be performed for each AP identified in step 302. Once the layer 0, channel calculation process has completed, layer 1 channel calculations can be computed, i.e., considering each AP group with its one-hop network neighbors.

FIG. 3B illustrates an example process 301 for implementing a hierarchical channel re-assignment technique and in particular, for performing a layer 1 channel re-assignment. Process 301 begins with step 312 which the first AP is selected, and each one-hop neighbor of the first AP is identified. As discussed above, one-hop neighbors of the first AP include all nodes in direct communication with the first AP, e.g., without any intervening network nodes.

In step 316, a channel quality is determined for the first new channel associated with the first AP, and each of the one-hop neighbors. That is, channel quality assessment at the layer 1 level are made with respect to groups of APs, which include a selected AP and each of this immediate network neighbors.

By considering channel re-selection for groups of nodes, as opposed to a node-by-node basis, improved channel assignments can be made with respect to layer 0 calculations. For example, layer 1 calculations compute channel re-assignments that can depend on channel swapping between currently assigned channels for different APs. As such, channel quality determinations can be made with respect to channels that would have been deemed unavailable at the layer 0 calculation.

In step 318, a second new channel for the first AP is selected based on the channel quality for the first new channel associated with the first AP and the channel quality of the respective channel assignment of each of the single hop neighbors. Because channel selection can be performed without regard to channel occupancy of neighboring devices in the group (i.e., the group consisting of the first AP and all one-hop neighbors), better channel selections can be made for benefit of the entire group.

By way of further example, if a first AP is assigned to channel 6, and a second AP is assigned to channel 8, then channel calculations made only for the first AP would exclude channel 8, which is already assigned. Conversely, channel calculations made only for the second AP would exclude channel 6, which is also assigned. However, at the layer 1 calculation level, by performing channel selections that optimize channel quality for all nodes in the group, better channel selections can be made at the network level.

Layer 1 calculations, as described with respect to steps 312-318, can be iterated until all APs in the network have been re-assigned. It is understood that any APs that share one-hop group membership with multiple nodes in the network may be re-assigned once at the layer 1 calculation level. That is, APs are not given multiple channel re-assignments on any given calculation layer. Once all channel assignments have been made for one-hop neighbor groups across the network, layer 0 calculations can be re-iterated, e.g., as described in steps 302-310, discussed in reference to FIG. 3A, concluding the layer 1 calculation.

It is understood that any number of additional higher layer calculations can be performed, without departing from the scope of the technology. For example, selection of a particular AP and all of its two-hop network neighbors can be performed in a layer 2 calculation. Similarly, selection of an AP and its three-hop network neighbors can be performed in a layer 3 calculation. Depending on implementation and the availability of computing resources, channel calculation and selection may be performed for an entire network, i.e., all wireless nodes.

Additionally, as discussed above, multiple iterations of channel assignment calculations may be performed at each hierarchical level, without pushing the physical channel assignments to the network. That is, different channel assignment configurations can be simulated and compared to determine optimal AP channel assignment associations before network changes are deployed.

Performing channel calculations on a hierarchical basis vastly reduces the computational difficulty of the channel selection process and enables channel re-assignment to be performed more quickly and frequently, while also providing assignments that optimize frequency utilization at a network (global) level.

FIG. 4 illustrates an example network device 410 that can be used to implement one or more APs as discussed above. Network device 410 includes master central processing unit (CPU) 462, interfaces 468, and a bus 415 e.g., a Peripheral Computer Interconnect (PCI) bus. CPU 462 can be configured to perform monitoring for one or more virtual network functions under the control of software including an operating system and any appropriate applications software. CPU 462 can include one or more processors 463, such as processors from the Intel, ARM, and/or Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, processor 463 is specially designed hardware for controlling the operations of network device 410. In a specific embodiment, a memory 461 (such as non-volatile RAM and/or ROM) also forms part of CPU 462. However, there are many different ways in which memory could be coupled to the system.

Interfaces 468 can be provided as wireless interface cards (sometimes referred to as “network interface cards” (NICs) or “line cards”). Generally, they control the sending and receiving of data packets over a wireless network and sometimes support other peripherals used with device 410. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, Digital Subscriber Line (DSL) interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces can be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, Asynchronous Transfer Mode (ATM) interfaces, High Speed Serial Interfaces (HSSIs), Point of Sale (POS) interfaces, Fiber Distributed Data Interface (FDDIs), and the like. Generally, these interfaces can include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 462 to efficiently perform routing computations, network diagnostics, security functions, etc.

Although the system shown in FIG. 4 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc. is often used. Further, other types of interfaces and media could also be used with the router.

Regardless of the network device's configuration, it may employ one or more non-transitory memories or memory modules (including memory 461) configured to store program instructions for general-purpose network operations and mechanisms necessary to implement one or more steps of a service chain auto-tuning process of the subject technology.

For example, memory 461 can include a non-transitory computer-readable medium that includes instructions for causing CPU 462 to execute operations for identifying a plurality of wireless access points (APs) in the wireless network, each of the wireless APs being associated with an initial channel assignment, selecting a first AP from among the plurality of wireless APs in the wireless network, determining a channel quality for the initial channel assignment associated with the first AP, and selecting a first new channel for the first AP based on the channel quality for the initial channel assignment associated with the first AP. In some aspect, CPU 462 can further be configured to execute operations including selecting a second AP from among the plurality of wireless APs in the wireless network, determining a channel quality for the initial channel assignment associated with the second AP, and selecting a first new channel for the second AP based on the channel quality for the initial channel assignment associated with the second AP.

As discussed above, CPU 462 can also be configured to perform higher layer channel assignment calculations. For example, CPU 462 can be configured to execute operations including selecting the first AP from among the plurality of wireless APs in the wireless network, identifying one or more one-hop neighbors of the first AP, wherein each of the one or more one-hop neighbors is directly connected to the first AP in the wireless network, determining a channel quality for the first new channel associated with the first AP, determining a channel quality for a respective channel assignment of each of the one-hop neighbors of the first AP, and selecting a second new channel for the first AP based on the channel quality for the first new channel associated with the first AP, and the channel quality of the respective channel assignment of each of the one or more one-hop neighbors.

It is understood that any specific order or hierarchy of steps in the processes disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged, or that only a portion of the illustrated steps be performed. Some of the steps may be performed simultaneously. For example, in certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but are to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.”

A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa.

The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.

Claims

1. A computer-implemented method for performing channel assignments in a wireless network, the method comprising: identifying a plurality of wireless access points (APs) in the wireless network, each of the wireless APs being associated with an initial channel assignment;selecting a first AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the first AP;first selecting a first new channel for the first AP based on the channel quality for the initial channel assignment associated with the first AP;selecting a second AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the second AP; andsecond selecting a first new channel for the second AP based on the channel quality for the initial channel assignment associated with the second AP;wherein each of the first and second selecting comprises: estimating for a particular AP as Node P performance on a channel c with channel width cw using the relationship of

2. The computer-implemented method of claim 1, further comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more one-hop neighbors of the first AP, wherein each of the one or more one-hop neighbors is directly connected to the first AP in the wireless network;determining a channel quality for the first new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one-hop neighbors of the first AP; andselecting a second new channel for the first AP based on the channel quality for the first new channel associated with the first AP, and the channel quality of the respective channel assignment of each of the one or more one-hop neighbors.

3. The computer-implemented method of claim 2, wherein selecting the second new channel for the first AP further comprises: selecting a new channel assignment for each of the one-hop neighbors of the first AP.

4. The computer-implemented method of claim 2, further comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more two-hop neighbors of the first AP, wherein each of the one or more two-hop neighbors is connected to the first AP via one other node in the wireless network;determining a channel quality for the second new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one or more two-hop neighbors of the first AP; andselecting a third new channel for the first AP based on the channel quality for the second new channel associated with the first AP, and the channel quality of the respective channel assignment for each of the one or more two-hop neighbors.

5. The computer implemented method of claim 4, wherein selecting the third new channel for the first AP further comprises: selecting a new channel assignment for each of the two-hop neighbors of the first AP.

6. The method of claim 1, wherein determining the channel quality for the initial channel assignment associated with the first AP is further based on a channel switch penalty.

7. The method of claim 1, wherein determining the channel quality for the initial channel assignment associated with the second AP is further based on a channel switch penalty.

8. A system comprising: one or more processors;a network interface coupled to the processors, the network interface configured for exchanging data with a wireless computer network; anda non-transitory computer-readable medium comprising instructions stored therein, which when executed by the processors, cause the processors to perform operations comprising: identifying a plurality of wireless access points (APs) in the wireless network, each of the wireless APs being associated with an initial channel assignment;selecting a first AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the first AP;first selecting a first new channel for the first AP based on the channel quality for the initial channel assignment associated with the first AP;selecting a second AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the second AP; andsecond selecting a first new channel for the second AP based on the channel quality for the initial channel assignment associated with the second AP;wherein each of the first and second selecting comprises: estimating for a particular AP as Node P performance on a channel c with channel width cw using the relationship of

9. The system of claim 8, wherein the instructions are further configured to cause the processors to perform operations comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more one-hop neighbors of the first AP, wherein each of the one or more one-hop neighbors is directly connected to the first AP in the wireless network;determining a channel quality for the first new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one-hop neighbors of the first AP; andselecting a second new channel for the first AP based on the channel quality for the first new channel associated with the first AP, and the channel quality of the respective channel assignment of each of the one or more one-hop neighbors.

10. The system of claim 9, wherein selecting the second new channel for the first AP further comprises: selecting a new channel assignment for each of the one-hop neighbors of the first AP.

11. The system of claim 9, wherein the instructions are further configured to cause the processors to perform operations comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more two-hop neighbors of the first AP, wherein each of the one or more two-hop neighbors is connected to the first AP via one other node in the wireless network;determining a channel quality for the second new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one or more two-hop neighbors of the first AP; andselecting a third new channel for the first AP based on the channel quality for the second new channel associated with the first AP, and the channel quality of the respective channel assignment for each of the one or more two-hop neighbors.

12. The system of claim 11, wherein selecting the third new channel for the first AP further comprises: selecting a new channel assignment for each of the two-hop neighbors of the first AP.

13. The system of claim 8, wherein determining the channel quality for the initial channel assignment associated with the first AP is further based on a channel switch penalty.

14. The system of claim 8, wherein determining the channel quality for the initial channel assignment associated with the second AP is further based on a channel switch penalty.

15. A non-transitory computer-readable storage medium comprising instructions stored therein, which when executed by one or more processors, cause the processors to perform operations comprising: identifying a plurality of wireless access points (APs) in a wireless network, each of the wireless APs being associated with an initial channel assignment;selecting a first AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the first AP;first selecting a first new channel for the first AP based on the channel quality for the initial channel assignment associated with the first AP;selecting a second AP from among the plurality of wireless APs in the wireless network;determining a channel quality for the initial channel assignment associated with the second AP; andsecond selecting a first new channel for the second AP based on the channel quality for the initial channel assignment associated with the second AP;wherein each of the first and second selecting comprises: estimating for a particular AP as Node P performance on a channel c with channel width cw using the relationship of

16. The non-transitory computer-readable storage medium of claim 15, wherein the instructions are further configured to cause the processors to perform operations comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more one-hop neighbors of the first AP, wherein each of the one or more one-hop neighbors is directly connected to the first AP in the wireless network;determining a channel quality for the first new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one-hop neighbors of the first AP; andselecting a second new channel for the first AP based on the channel quality for the first new channel associated with the first AP, and the channel quality of the respective channel assignment of each of the one or more one-hop neighbors.

17. The non-transitory computer-readable storage medium of claim 16, wherein selecting the second new channel for the first AP further comprises: selecting a new channel assignment for each of the one-hop neighbors of the first AP.

18. The non-transitory computer-readable storage medium of claim 16, wherein the instructions are further configured to cause the processors to perform operations comprising: selecting the first AP from among the plurality of wireless APs in the wireless network;identifying one or more two-hop neighbors of the first AP, wherein each of the one or more two-hop neighbors is connected to the first AP via one other node in the wireless network;determining a channel quality for the second new channel associated with the first AP;determining a channel quality for a respective channel assignment of each of the one or more two-hop neighbors of the first AP; andselecting a third new channel for the first AP based on the channel quality for the second new channel associated with the first AP, and the channel quality of the respective channel assignment for each of the one or more two-hop neighbors.

19. The non-transitory computer-readable storage medium of claim 18, wherein selecting the third new channel for the first AP further comprises: selecting a new channel assignment for each of the two-hop neighbors of the first AP.

20. The non-transitory computer-readable storage medium of claim 15, wherein determining the channel quality for the initial channel assignment associated with the first AP is further based on a channel switch penalty.