CA2711947C - Channel assignment for wireless access networks - Google Patents

Channel assignment for wireless access networks Download PDF

Info

Publication number
CA2711947C
CA2711947C CA2711947A CA2711947A CA2711947C CA 2711947 C CA2711947 C CA 2711947C CA 2711947 A CA2711947 A CA 2711947A CA 2711947 A CA2711947 A CA 2711947A CA 2711947 C CA2711947 C CA 2711947C
Authority
CA
Canada
Prior art keywords
access points
network
access point
channels
access
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CA2711947A
Other languages
French (fr)
Other versions
CA2711947A1 (en
Inventor
Jorjeta Jetcheva
Ravi Prakash
Vinay Gupta
Sachin Kanodia
Mohan Natarajan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Firetide Inc
Original Assignee
Firetide Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Firetide Inc filed Critical Firetide Inc
Publication of CA2711947A1 publication Critical patent/CA2711947A1/en
Application granted granted Critical
Publication of CA2711947C publication Critical patent/CA2711947C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/27Control channels or signalling for resource management between access points
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/29Control channels or signalling for resource management between an access point and the access point controlling device
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/52Allocation or scheduling criteria for wireless resources based on load
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/121Wireless traffic scheduling for groups of terminals or users
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08Access point devices

Abstract

Channel assignment for wireless access networks is directed toward improved overall communication capability of the networks. A network is formed of wireless access points (APs) coupled via wired (and/or wireless) links and enabled to communicate with clients via radio channels of each of the APs. Local information is collected at each of the APs and processed to determine channel assignments according to a Neighbor Impact Metric (NIM) that accounts for one-hop and two-hop neighbors as well as neighbors not part of the network. Optionally, the NIM accounts for traffic load on the APs. The channel assignments are determined either on a centralized resource (such as a server or one of the APs) or via a distributed scheme across the APs. The local information includes how busy a channel is and local operating conditions such as error rate and interference levels.

Description

2
3
4 BACKGROUND
6 [0001] Field: Advancements in wireless access networks are needed to provide 7 improvements in performance, efficiency, and utility of use.

9 [0002] Related Art: Unless expressly identified as being publicly or well known, mention herein of techniques and concepts, including for context, definitions, or comparison 11 purposes, should not be construed as an admission that such techniques and concepts are 12 previously publicly known or otherwise part of the prior art. All references cited herein (if any), 13 including patents, patent applications, and publications, are hereby incorporated by reference in 14 their entireties, whether specifically incorporated or not, for all purposes.

19 [0003] The invention may be implemented in numerous ways, including as a process, an article of manufacture, an apparatus, a system, a composition of matter, and a computer 21 readable medium such as a computer readable storage medium or a computer network wherein 22 program instructions are sent over optical or electronic communication links. In this 23 specification, these implementations, or any other form that the invention may take, may be 24 referred to as techniques. The Detailed Description provides an exposition of one or more embodiments of the invention that enable improvements in performance, efficiency, and utility 26 of use in the field identified above. The Detailed Description includes an Introduction to 27 facilitate the more rapid understanding of the remainder of the Detailed Description. The 28 Introduction includes Example Embodiments of one or more of systems, methods, articles of 29 manufacture, and computer readable media in accordance with the concepts described herein.
As is discussed in more detail in the Conclusions, the invention encompasses all possible 31 modifications and variations within the scope of the issued claims.

[00041 List of Reference Symbols in Drawings Ref. Symbol Element Name 100-1 Access Node 1 100-2 Access Node 2 100-3 Access Node 3 100-4 Access Node 4 100-5 Access Node 5 200-1 Client Link 1 200-2 Client Link 2 210 Ongoing Channel Assignment Process 220 Load Balancing on APs Process 230 AP Neighbor Info + Busy Channel Assessment Process 240 Client and Traffic Load Statistics Process 250 Transmit Power Control Process 260 Initial Channel Assignment Process 300-1 Central Server Link 1 300-2 Central Server Link 2 300-3 Central Server Link 3 300-4 Central Server Link 4 300-5 Central Server Link 5 301.1 Memory Bank 1 301.2 Memory Bank 2 302 DRAM Memory Interface 305 Processor 306 Ethernet Interface 307 Ethernet Ports 306 Ethernet Interface 308 PCI Expansion Bus 309 Wireless Interface 309-A Wireless Interface A
309-N Wireless Interface N
400-1 Internet Access Link 1 400-2 Internet Access Link 2 401 Network Management System Manager 402 Network Interface Manager 403 Fault, Configuration, Accounting, Performance, and Security Manager 410 Kernel Interface 411 Routing and Transport Protocols Layer 412 Layer-2 Abstraction Layer 413 Flash File System Module 414 Ethernet Driver 415 Radio Driver 416 Flash Driver 420 Collective Hardware Interfaces 423 FLASH hardware element 500 Central Server 600-1 Client Device 1 600-2 Client Device 2 800 Internet 1000 Network 1 Brief Description of Drawings 3 [0005] Fig. 1 illustrates selected details and operating context of an embodiment of 4 wireless access points that are enabled to operate in a network according to assignments of channels.

7 [0006] Fig. 2 illustrates selected conceptual aspects of operation of an embodiment of 8 assignments of channels to access points.

[0007] Fig. 3 illustrates selected details of hardware aspects of an embodiment of an 11 access point.

13 [0008] Fig. 4 illustrates selected details of software aspects of an embodiment of an 14 access point.

18 [0009] A detailed description of one or more embodiments of the invention is provided 19 below along with accompanying figures illustrating selected details of the invention. The invention is described in connection with the embodiments. It is well established that it is 21 neither necessary, practical, or possible to exhaustively describe every embodiment of the 22 invention. Thus the embodiments herein are understood to be merely exemplary, the invention 23 is expressly not limited to or by any or all of the embodiments herein, and the invention 24 encompasses numerous alternatives, modifications and equivalents. To avoid monotony in the exposition, a variety of word labels (including but not limited to: first, last, certain, various, 26 further, other, particular, select, some, and notable) may be applied to separate sets of 27 embodiments; as used herein such labels are expressly not meant to convey quality, or any form 28 of preference or prejudice, but merely to conveniently distinguish among the separate sets. The 29 order of some operations of disclosed processes is alterable within the scope of the invention.
Wherever multiple embodiments serve to describe variations in process, method, and/or program 31 instruction features, other embodiments are contemplated that in accordance with a 32 predetermined or a dynamically determined criterion perform static and/or dynamic selection of 33 one of a plurality of modes of operation corresponding respectively to a plurality of the multiple 34 embodiments. Numerous specific details are set forth in the following description to provide a thorough understanding of the invention. These details are provided for the purpose of example 36 and the invention may be practiced according to the claims without some or all of these specific 1 details. For the purpose of clarity, technical material that is known in the technical fields related 2 to the invention has not been described in detail so that the invention is not unnecessarily 3 obscured.

INTRODUCTION

7 [0010] This introduction is included only to facilitate the more rapid understanding of 8 the Detailed Description; the invention is not limited to the concepts presented in the 9 introduction (including explicit examples, if any), as the paragraphs of any introduction are necessarily an abridged view of the entire subject and are not meant to be an exhaustive or 11 restrictive description. For example, the introduction that follows provides overview 12 information limited by space and organization to only certain embodiments.
There are many 13 other embodiments, including those to which claims will ultimately be drawn, discussed 14 throughout the balance of the specification.
16 Acronyms 18 [0011] Elsewhere herein various shorthand abbreviations, or acronyms, are used to 19 refer to certain elements. The descriptions of at least some of the acronyms follow.
Acronym Description AP Access Point CDMA Code Division Multiple Access DRAM Dynamic read/write Random Access Memory EEPROM Electrically-Erasable Programmable Read-Only Memory FCAPS Fault, Configuration, Accounting, Performance, and Security GPS Global Positioning System GSM Global System for Mobile communications NIM Neighbor Impact Metric NMS Network Management System PDA Personal Digital Assistant TCP Transmission Control Protocol TDMA Time Division Multiple Access UDP User Datagram Protocol WLAN Wireless Local Area Network 2 Terminology 4 [0012] An example of a neighbor AP is an AP that, with respect to another AP, transmits packets that are decodable by the other AP, such that the two APs are within 6 transmission/reception range of each other. An example of an internal neighbor AP, with 7 respect to another AP of a network, is a neighbor AP of the other AP that is operating (or 8 enabled for participating) in the network. The operating or participating are via any combination 9 of wired or wireless links that enable communication with the Internet and/or one or more other APs of the network. An example of an external neighbor AP, with respect to an AP of a 11 network, is a neighbor AP of the AP that is not operating (or not enabled for participating) in the 12 network. Internal neighbor APs are subject to channel assignments for the network, and operate 13 cooperatively with respect to constraints the network attempts to impose.
In contrast, external 14 neighbor APs are not subject to channel assignments for the network, and are not guaranteed to cooperate with constraints the network attempts to impose. In some situations, external 16 neighbors operate with different protocols than internal neighbors. An example of a one-hop 17 (internal) neighbor AP, with respect to a reference AP, is an AP that is within one wireless hop 18 of the reference AP. The one-hop (internal) neighbor AP and the reference AP operate (or are 19 enabled to participate) in the same network. An example of a two-hop (internal) neighbor AP, with respect to a reference AP, is an AP that is within two wireless hops of the reference AP.
21 The two-hop (internal) neighbor AP, the reference AP, and the AP forwarding between the two 22 wireless hops all operate (or are enabled to participate) in the same network. Elsewhere herein, 23 the term neighbor (AP), unless further qualified explicitly or by context, refers to a neighbor AP
24 of the aforementioned one-hop (internal) neighbor AP type.
26 [0013] An example of interference is when a transmission from a first source (such as 27 from an internal or external AP, or from a non-communication source such as a microwave 28 oven) reduces communication effectiveness of a transmission from a second source (such as an 29 AP of a network). APs that are close enough to each other to interfere with each other are examples of APs that are within interference range of each other. In some embodiments, an 31 interference range of an AP is approximately equal to twice a transmission range of the AP. APs 32 that are one-hop (internal) neighbors (and, in some situations, two-hop neighbors) with respect 33 to a particular AP, are sources of interference for the particular AP, such as when the neighbors 34 are within interference range of the particular AP. In some situations, APs that are not neighbors of a particular AP are also sources of interference for the particular AP, such as when the non-36 neighbors are within interference range of the particular AP but are not within transmission
5 1 range. Thus, according to operating environment, an AP is interfered with by one or more of 2 one-hop and two-hop neighbor APs, as well as non-neighbor APs and non-AP
emission sources.

4 [0014] Wireless access to network services and the Internet is, in some usage scenarios, provided via a network of wireless access devices. Each of the wireless access devices covers a
6 respective geographic area (referred to as a "cell") where coverage is desired. Example network
7 technologies include cellular (such as CDMA, TDMA or GSM) and WLANs (such as 802.11
8 compatible networks). Example wireless access devices include base stations (such as used in
9 cellular networks) and APs (such as used in WLANs). Hereinafter the term `AP' is used for brevity of description to refer to wireless access devices in general, including cellular network 11 base stations and WLAN APs.

13 [0015] Each AP enables connections and/or associations of wireless devices within the 14 respective cell. All of the cells taken together represent a coverage area of the network. Users or customers connect to the network via various devices having wireless communication 16 capability that is compatible with one or more of the APs, such as laptop or notebook computers, 17 PDAs, phones, and other mobile or portable devices. The connecting devices are referred to as 18 clients with respect to the network. The APs are interconnected via any combination of wired 19 and wireless links, and optionally interact with a server (such as a centralized controller). The server optionally controls some aspects of behavior and/or configuration of one or more of the 21 APs.

23 [0016] Deployment of a wireless access network, in some usage scenarios, balances 24 conflicting goals, such as overlap in cells of different APs and frequency diversity. Overlap in cells enables setting up an association with an AP in a new cell that a roaming client is moving 26 to, while the roaming client continues to use services and/or connectivity provided by a current 27 AP in a current cell. As overlap of cells increases, more time is available for a roaming client to 28 change association from a current to a new AP (note that as a roaming client moves more 29 quickly, less time is available to change associations). Frequency diversity enables APs and other wireless devices to be geographically close and operate with reduced interference between 31 each other, via links of different frequencies and/or channels. The diverse frequencies and 32 channels enable multiple simultaneous communications.

34 [0017] Thus assigning (e.g. allocating or distributing) frequencies and/or channels across APs to reduce or minimize interference beneficially enables more efficient use of the 36 frequencies and/or channels. In some usage scenarios, such as scenarios associated with certain 1 frequency bands, as few as three channels are available for assignment. In some usage 2 scenarios, such as scenarios associated with an unlicensed band, devices "external" to the 3 network (e.g. devices that are not APs and are not clients of the network) interfere with 4 communication in the network. Examples of external devices include elements of neighboring networks (such as APs of a nearby network) and non-network devices (such as microwave ovens 6 and cordless phones).

8 [0018] Network efficiency is improved, in some usage scenarios and/or embodiments, 9 when channel assignment takes into consideration various factors. The factors include how many channels are available for allocation, as well as existence and characteristics of 11 interference present on various channels. For example, identification of a time characteristic of 12 an external interference source enables more efficient channel assignment, such as not using a 13 particular channel to avoid a permanent interference source, or using a particular channel in view 14 of a transient interference source.
16 [0019] Various embodiments described herein enable improved efficiency of a network 17 having a set of APs, each AP being configured with a respective transmit power level and a 18 respective assigned set of channels. The transmit power level is determined based on coverage 19 requirements. The assigned channels are determined to maximize overall performance of the APs operating as a set in the network; e.g. to maximize communication performance of the 21 network as a whole.

26 [0020] In concluding the introduction to the detailed description, what follows is a 27 collection of example embodiments, including at least some explicitly enumerated as "ECs"
28 (Example Combinations), providing additional description of a variety of embodiment types in 29 accordance with the concepts described herein; these examples are not meant to be mutually exclusive, exhaustive, or restrictive; and the invention is not limited to these example 31 embodiments but rather encompasses all possible modifications and variations within the scope 32 of the issued claims.

1 [0021] EC1) A method comprising:
2 within an access point enabled to participate in a network, evaluating 3 communication conditions local to the access point;
4 operating the access point in accordance with a channel assignment that is a function of the evaluating; and 6 wherein the channel assignment is in accordance with optimizing overall 7 communication performance of the network at a higher priority than 8 optimizing communication performance of the access point.

[0022] EC2) The method of EC 1, wherein the access point is enabled to communicate 11 via one or more channels, and the evaluating comprises computing availability of the 12 channels with respect to the access point.

14 [0023] EC3) The method of EC2, wherein the computing availability comprises the access point determining a fraction of time each of the channels is busy.

17 [0024] EC4) The method of EC2, wherein the computing availability comprises the 18 access point recognizing reception errors.

[0025] EC5) The method of EC4, wherein the recognizing comprises classifying one 21 or more of interference, weak signal strength, unknown encoding, non-information, and 22 noise as one of the reception errors.

24 [0026] EC6) The method of EC2, wherein the computing availability comprises the access point recognizing transmissions from devices not participating in the network as 26 interference.

28 [0027] EC7) The method of EC2, wherein the computing availability comprises the 29 access point recognizing emissions from non-networking devices as interference.
31 [0028] EC8) The method of EC2, wherein the computing availability determines that a 32 particular one of the channels is not usable by the access point, and the channel 33 assignment has no assignment of the particular channel to the access point.

1 [0029] EC9) The method of EC8, further comprising operating the access point with 2 another channel assignment that has an assignment of the particular channel when the 3 particular channel is usable.

[0030] EC10) The method of EC 1, wherein the evaluating comprises determining a 6 number of neighbor access points the access point is able to communicate with in a 7 single wireless hop.

9 [0031] EC 11) The method of EC10, wherein the determining comprises passively listening and recording information about other access points of the network that are 11 within communication range of the access point.

13 [0032] EC12) The method of EC11, wherein the passively listening comprises 14 receiving control and/or data traffic from one or more of the other access points.
16 [0033] EC13) The method of EC 11, wherein the information comprises one or more of 17 an address and a signal strength.

19 [0034] EC14) The method of EC10, wherein the determining comprises actively scanning and recording information about other access points of the network that are 21 within communication range of the access point.

23 [0035] EC15) The method of EC14, wherein the actively scanning comprises sending 24 one or more probe packets to solicit one or more responses from one or more of the other access points.

27 [0036] EC16) The method of EC 14, wherein the information comprises one or more of 28 an address and a signal strength.

[0037] EC17) The method of EC10, wherein the evaluating further comprises 31 classifying the neighbor access points as enabled to participate in the network or as not 32 enabled to participate in the network, and the channel assignment is further in 33 accordance with the classifying.

[0038] EC18) The method of EC 10, further comprising spanning the single wireless 36 hop via one or more radios of the access point.

1 [0039] EC 19) The method of EC 1, wherein the evaluating comprises determining a 2 communication load of the access point.

4 [0040] EC20) The method of EC19, wherein the determining comprises recording how many clients are served by the access point during one or more time intervals.

7 [0041] EC21) The method of EC19, wherein the determining comprises recording how 8 much traffic clients that are served by the access point send and/or receive via the access 9 point during one or more time intervals.
11 [0042] EC22) The method of EC19, wherein the determining comprises recording how 12 many neighbor access points that the access point has during one or more time intervals.

14 [0043] EC23) The method of EC19, wherein the determining comprises recording how much traffic that neighbor access points of the access point have during one or more 16 time intervals.

18 [0044] EC24) The method of EC 1, wherein the access point, one or more neighbor access 19 points, and zero or more non-neighbor access points are enabled to participate in the network.
21 [0045] EC25) The method of EC24, wherein the overall communication performance 22 of the network is a function of the communication performance of the access point in 23 combination with communication performance of the neighbor and the non-neighbor 24 access points.
26 [0046] EC26) The method of EC I, wherein the overall communication performance of 27 the network is quantifiable according to bandwidth, latency, or both.

29 [0047] EC27) The method of EC 1, wherein the communication performance of the access point is quantifiable according to bandwidth, latency, or both.

32 [0048] EC28) The method of EC 1, further comprising determining the channel 33 assignment in response to one or more of a request and an event.

[0049] EC29) The method of EC 1, further comprising determining the channel 36 assignment at least in part via the access point.

2 [0050] EC30) The method of EC I, further comprising determining the channel 3 assignment at least in part via a centralized resource.

[0051] EC3 1) The method of EC30, wherein the centralized resource is all or any 6 portion of the access point.

8 [0052] EC32) The method of EC30, wherein the centralized resource is all or any 9 portion of a server.
11 [0053] EC33) The method of EC1, wherein the channel assignment is a current 12 channel assignment and is further in accordance with reducing changes between a 13 previous channel assignment and the current channel assignment.

[0054] EC34) The method of EC1, wherein the channel assignment is preferential to 16 the access point when the access point is experiencing a relatively higher 17 communication load than other access points enabled to participate in the network.

19 [0055] EC35) The method of EC1, wherein the channel assignment is in accordance with one or more fixed channel assignments.

22 [0056] EC36) A method comprising:
23 receiving communication condition information from each of a plurality of 24 access points enabled to participate in a network;
determining assignments of channels to each of the access points based at least 26 in part on the communication condition information;
27 communicating the assignments of channels to the access points; and 28 wherein the assignments of channels are in accordance with optimizing overall 29 communication performance of the network at a higher priority than optimizing communication performance of any one of the access points 31 individually.

33 [0057] EC37) The method of EC36, wherein the communication condition information 34 from a particular one of the access points comprises availability of channels with respect to the particular access point.

1 [0058] EC38) The method of EC37, wherein the availability comprises a fraction of 2 time each of the channels is not busy.

4 [0059] EC39) The method of EC37, wherein the availability comprises an indication that one or more of the channels is not usable by the particular access point, and the 6 determining avoids assigning the unusable channels to the particular access point.

8 [0060] EC40) The method of EC39, wherein the determining, after a period of time 9 has elapsed, negates the avoiding and considers the unusable channels as eligible to be assigned to the particular access point.

12 [0061] EC41) The method of EC36, wherein the communication condition information 13 from a particular one of the access points comprises a count of neighbor access points 14 the particular access point is able to communicate with in a single wireless hop.
16 [0062] EC42) The method of EC41, further comprising spanning the single wireless 17 hop via one or more radios of the particular access point.

19 [0063] EC43) The method of EC36, wherein the communication condition information from a particular one of the access points comprises a communication load of the 21 particular access point.

23 [0064] EC44) The method of EC36, wherein the communication condition information 24 from a particular one of the access points comprises a count of clients served by the particular access point.

27 [0065] EC45) The method of EC36, wherein the communication condition information 28 from a particular one of the access points comprises a quantification of traffic that 29 clients served by the particular access point send and/or receive via the particular access point.

32 [0066] EC46) The method of EC36, wherein the communication condition information 33 from a particular one of the access points comprises a count of how many other ones of 34 the access points are neighbors of the particular access point.

1 [0067] EC47) The method of EC36, wherein the communication condition information 2 from a particular one of the access points comprises a quantification of traffic of other 3 ones of the access points that are neighbors of the particular access point.

[0068] EC48) The method of EC36, wherein the communication condition information 6 from a particular one of the access points comprises information relating to one or more 7 time intervals.

9 [0069] EC49) The method of EC36, wherein the overall communication performance of the network is quantifiable according to bandwidth, latency, or both.

12 [0070] EC50) The method of EC36, wherein the communication performance of at 13 least one of the access points is quantifiable according to bandwidth, latency, or both.

[0071] EC51) The method of EC36, wherein the determining is in response to a 16 request originating from a network administrator.

18 [0072] EC52) The method of EC36, wherein the determining is in response to an event.

[0073] EC53) The method of EC52, wherein the event comprises one or more of 21 a change in an aspect of the communication condition information, 22 one of the access points becoming no longer enabled to participate in the network, and 23 a new access point becoming enabled to participate in the network.

[0074] EC54) The method of EC36, wherein at least a portion of the determining is via 26 one or more of the access points.

28 [0075] EC55) The method of EC36, wherein at least a portion of the determining is via 29 a centralized resource.
31 [0076] EC56) The method of EC55, wherein the centralized resource is all or any 32 portion of one of the access points.

34 [0077] EC57) The method of EC55, wherein the centralized resource is all or any portion of a server.

1 [0078] EC58) The method of EC36, wherein the assignment of channels to a particular 2 one of the access points is a current assignment of channels, and the determining is in 3 accordance with reducing changes between a previous assignment of channels to the 4 particular access point and the current assignment of channels.
6 [0079] EC59) The method of EC36, wherein the determining is preferential to a 7 particular one of the access points experiencing relatively higher communication load 8 than other ones of the access points.

[0080] EC60) The method of EC36, wherein the determining is in accordance with one 11 or more fixed channel assignments.

13 [0081] EC61) The method of EC36, further comprising determining at least a portion 14 of the communication condition information via at least one of the access points.
16 [0082] EC62) A method comprising:
17 computing topological metrics based at least in part on communication topology 18 of a plurality of access points enabled to participate in a network; and 19 determining, based at least in part on the topological metrics, assignments of channels to each of the access points.

22 [0083] EC63) The method of EC62, wherein the determining is further based at least in 23 part on a respective channel preference list provided by each of the access points.

[0084] EC64) The method of EC63, wherein the determining uses the channel 26 preference list of a particular one of the access points to break a tie in assigning a 27 portion of the assignment of channels of the particular access point.

29 [0085] EC65) The method of EC63, wherein the channel preference list of a particular one of the access points comprises a sorted list of ones of the channels the particular 31 access point is enabled to communicate via, and the sorting is according to channel load 32 with respect to the particular access point.

34 [0086] EC66) The method of EC63, wherein the respective channel preference lists are provided repeatedly over time.

1 [0087] EC67) The method of EC62, wherein the assignments of channels are in 2 accordance with providing overall communication capacity of the network at a higher 3 priority than providing communication capacity of any one of the access points 4 individually.
6 [0088] EC68) The method of EC62, wherein the topological metrics are per each of the 7 access points.

9 [0089] EC69) The method of EC62, wherein the topological metrics are per each of the channels.

12 [0090] EC70) The method of EC62, wherein the topological metrics are per each of the 13 access points and each of ones of the channels each respective one of the access points is 14 enabled to communicate via.
16 [0091] EC71) The method of EC62, wherein the topological metrics are weighted 17 sums of a plurality of sub-metrics.

19 [0092] EC72) The method of EC71, wherein one of the sub-metrics is an average number of access point one-hop neighbors.

22 [0093] EC73) The method of EC72, wherein the average number is computed by 23 counting each of the access point one-hop neighbors being averaged as one.

[0094] EC74) The method of EC72, wherein the average number is computed by 26 counting each of the access point one-hop neighbors being averaged as a weighted sum 27 of one or more of a constant value, a number of clients, and a traffic load.

29 [0095] EC75) The method of EC71, wherein one of the sub-metrics is an average of access point two-hop neighbors.

32 [0096] EC76) The method of EC75, wherein the average number is computed by 33 counting each of the access point two-hop neighbors being averaged as one.

1 [0097] EC77) The method of EC75, wherein the average number is computed by 2 counting each of the access point two-hop neighbors being averaged as a weighted sum 3 of one or more of a constant value, a number of clients, and a traffic load.

[0098] EC78) The method of EC71, wherein one of the sub-metrics is an average 6 number of access point external neighbors.

8 [0099] EC79) The method of EC71, wherein at least a first one of the sub-metrics is 9 with respect to access point internal neighbors, at least a second one of the sub-metrics is with respect to access point external neighbors, and the determining weights the first 11 sub-metric higher than the second sub-metric.

13 [0100] EC80) The method of EC62, wherein the computing and the determining are 14 performed initially.
16 [0101] EC81) The method of EC62, wherein the computing and the determining are 17 performed repeatedly over time.

19 [0102] EC82) A method comprising:
evaluating communication performance of a network of access points assuming 21 proposed assignments of channels to the access points;
22 determining a communication performance metric at least in part by computing an 23 average number of access point neighbors of each of the access points; and 24 wherein the evaluating is based at least in part on the determining.
26 [0103] EC83) The method of EC82, wherein the average is a weighted average of one 27 or more of 28 an average of access point one-hop neighbors, 29 an average of access point two-hop neighbors, and an average of access point external neighbors.

32 [0104] EC84) The method of EC82, wherein the neighbors are one-hop neighbors.

34 [0105] EC85) The method of EC82, wherein the neighbors are two-hop neighbors.
36 [0106] EC86) The method of EC82, wherein the neighbors are external neighbors.

2 [0107] EC87) The method of EC82, wherein the determining is based at least in part 3 on at least one channel preference list from at least one of the access points.

[0108] EC88) The method of EC82, further comprising comparing the communication 6 performance of the network to communication performance of another network, at least 7 in part by normalizing the communication performances to respective numbers of access 8 points in each respective network.

[0109] EC89) The method of EC82, further comprising comparing the communication 11 performance of the network to communication performance of another network, at least 12 in part by normalizing the communication performances to respective numbers of 13 channels available to assign in each respective network.

[0110] EC90) The method of EC82, further comprising comparing the communication 16 performance of the network to another communication performance of the network 17 assuming another proposed assignment of channels to the access points.

19 [0111] EC91) The method of EC82, further comprising operating the network.
21 [0112] EC92) The method of EC91, wherein the operating is in accordance with the 22 proposed assignments of channels.

24 [0113] EC93) The method of EC91, wherein the operating is in accordance with previous assignments of channels, and the evaluating is based at least in part on 26 communication statistics gathered during at least a portion of the operating.

28 [0114] EC94) The method of EC82, wherein the average is a weighted average 29 computed in accordance with a number of clients.
31 [0115] EC95) The method of EC82, wherein the average is a weighted average 32 computed in accordance with traffic load.

1 [0116] EC96) A system comprising:
2 means for computing a neighbor impact metric in a network of access points;
and 3 means for assigning channels to the access points, the means for assigning channels 4 being based at least in part on results of the means for computing.
6 [0117] EC97) The system of EC96, wherein the means for assigning channels is 7 further based at least in part on respective channel preference lists from each of the 8 access points.

[0118] EC98) A system comprising:
11 means for evaluating communication conditions local to an access point;
12 means for operating the access point in a network in accordance with a channel 13 assignment that is a function of the means for evaluating; and 14 wherein the channel assignment is directed to prioritize overall communication performance of the network over communication performance of the 16 access point.

18 [0119] EC99) A system comprising:
19 an access point enabled to operate in a network;
a centralized resource; and 21 wherein the centralized resource is enabled to receive communication condition 22 information from the access point and to determine a channel 23 assignment of the access point that is directed to prioritize overall 24 communication performance of the network over communication performance of the access point.

27 [0120] EC 100) The system of EC99 wherein the centralized resource is a server.

29 [0121] EC101) The system of EC99 wherein the centralized resource is another access point enabled to operate in the network.

1 [0122] EC102) A method comprising:
2 evaluating communication conditions local to an access point;
3 operating the access point in a network in accordance with a channel assignment 4 that is a function of the evaluating; and wherein the channel assignment is directed to prioritize overall communication 6 performance of the network over communication performance of the 7 access point.

9 [0123] EC 103) A computer readable medium having a set of instructions stored therein that when executed by a processing element causes the processing element to 11 perform functions comprising:
12 evaluating communication conditions local to an access point;
13 operating the access point in a network in accordance with a channel assignment 14 that is a function of the evaluating; and wherein the channel assignment is directed to prioritize overall communication 16 performance of the network over communication performance of the 17 access point.

19 [0124] EC104) A system comprising:
means for computing topological metrics based at least in part on 21 communication topology of a plurality of access points enabled to 22 participate in a network; and 23 means for determining, based at least in part on the topological metrics, 24 assignments of channels to each of the access points.
26 [0125] EC105) A system comprising:
27 a plurality of access points enabled to operate in a network;
28 a centralized resource; and 29 wherein the centralized resource is enabled to receive topological metrics computed based at least in part on communication topology of the 31 access points and to determine, based at least in part on the topological 32 metrics, assignments of channels to each of the access points.

34 [0126] EC106) The system of EC105 wherein the centralized resource is a server.

1 [0127] EC107) The system of EC105 wherein the centralized resource is one of the 2 access points.

4 [0128] EC 108) A computer readable medium having a set of instructions stored therein that when executed by a processing element causes the processing element to 6 perform functions comprising:
7 computing topological metrics based at least in part on communication topology 8 of a plurality of access points enabled to participate in a network; and 9 determining, based at least in part on the topological metrics, assignments of channels to each of the access points.

12 [0129] EC109) A system comprising:
13 means for evaluating communication performance of a network of access points 14 assuming proposed assignments of channels to the access points;
means for determining a communication performance metric at least in part by 16 computing an average number of access point neighbors of each of the 17 access points; and 18 wherein the means for evaluating is based at least in part on the means for 19 determining.
21 [0130] EC 110) A computer readable medium having a set of instructions stored therein 22 that when executed by a processing element causes the processing element to 23 perform functions comprising:
24 evaluating communication performance of a network of access points assuming proposed assignments of channels to the access points;
26 determining a communication performance metric at least in part by computing 27 an average number of access point neighbors of each of the access 28 points; and 29 wherein the evaluating is based at least in part on the determining.

3 [0131] Fig. 1 illustrates selected details and operating context of an embodiment of 4 wireless access points that are enabled to operate in a network according to assignments of channels. More specifically, APs 100-1, 100-2, 100-3, 100-4, and 100-5 are enabled to 6 participate in Network 1000. An example assignment of channels is illustrated, with AP 1 7 assigned to channel 1 (chi), AP2 assigned to channel 2 (ch2), AP3 assigned to channel 3 (ch3), 8 AP4 assigned to channel 3 (ch3) and AP5 assigned to channel 1 (chi).

[0132] Each of the APs is enabled for communication with optional Central Server 500, 11 as illustrated by couplings to the Central Server 300-1, 300-2, 300-3, 300-4, and 300-5. In some 12 embodiments, one or more of the couplings to the Central Server are wired, such as Ethernet 13 cables, and in some embodiments one or more of the couplings are wireless, such as via 802.11-14 compatible radios. The network is enabled for communication with Internet 800, as exemplified by couplings to Internet 400-1 and 400-2. Similar to the couplings to the Central Server, in 16 various embodiments some of the couplings to the Internet are wired (such as Ethernet) and 17 some of the couplings are wireless (such as 802.11 radios). In some embodiments, all APs of a 18 network have a linkage to the Internet. A portion of the APs are illustrated as being in 19 communication with clients, specifically AP4 with Laptop 600-1 (via channel 3 as illustrated by 200-1), and AP5 with Laptop 600-2 (via channel 1 as illustrated by 200-2). The figure is an 21 example only, as embodiments with any number of APs, each enabled to operate on any number 22 channels, with any number of clients, are possible.

24 [0133] Assignments of channels to various APs in a network (such as APs 100-1, 100-2, 100-3, 100-4, and 100-5 participating in Network 1000 of Fig. 1) are directed to balance 26 communication performance of the network of the APs against locally optimal channel 27 assignments for any one of the APs individually.

29 [0134] Fig. 2 illustrates selected conceptual aspects of operation of an embodiment of assignments of channels to APs. In a network of APs, a starting assignment of channels is 31 performed ("Initial Channel Assignment" 260) based on an initial determination of operating 32 conditions, such as neighbor and channel evaluation ("AP Neighbor Info +
Busy Channel 33 Assessment" 230). Subsequently, channel assignments are recomputed, wholly or in part, such 34 as in response to changes in numbers of APs in the network, interference sources, or traffic load ("Ongoing Channel Assignment" 210). Optionally, clients are spread across the APs of the 36 network (by controlling which APs the clients associate with) to form a more even distribution 1 ("Load Balancing on APs" 220). In some embodiments and/or usage scenarios, it is possible for 2 a client to simultaneously communicate via two or more APs of a network, and the client and the 3 network collaborate to share or balance load traffic between the two or more APs.
4 Communication ranges of APs are balanced with interference between APs by adjusting power output levels ("Transmit Power Control" 250). Information and statistics concerning 6 communication provided by the network is gathered and collected ("Client and Traffic Load 7 Statistics" 240) and used to influence assignments of channels over time and to balance load 8 across the APs of the network. In some embodiments, the initial operating condition 9 determination also controls transmit power.
11 [0135] The following pseudo-code is representative of processing performed in some 12 embodiments.
13 Start:
14 Collect AP operating context information (neighbors, channel assessment) 16 Determine initial channel assignments as function of 17 (context information) 18 Communicate channel assignments to APs 19 Loop:
Operate network and collect AP operating information 21 (number of clients, traffic load) 22 Reassign channels as function of (collected operating 23 information, objectives such as AP client load 24 balancing) Determine transmit power as function of (collected 26 operating information) 27 Communicate new channel assignments and transmit 28 power to APs 29 GoTo Loop Note that in some embodiments, the channel assignments are determined locally to each AP, and 31 thus are automatically known to the APs without explicit communication.

33 [0136] The following is a conceptual description of an embodiment of assigning 34 channels to APs of network. Processing begins with each AP evaluating conditions on each channel and computing local availability of each of the channels. Each respective one of the 36 APs listens on a respective one of the channels and records a fraction of time that the respective 1 channel is busy with transmissions or emissions. The respective AP records receptions errors, as 2 the errors possibly indicate presence of interferers. Interferers include devices with signals that 3 are not decodable by the respective AP (such as devices that are too far away or are encoded in a 4 manner unknown to the respective AP). Interferers further include devices having emissions that are side effects not intended to convey information (such as microwave ovens).

7 [0137] In some usage scenarios, one or more channels are too busy (such as due to 8 communication traffic and/or interference) or have too many errors, and are "blacklisted" at a 9 particular one of the APs. Subsequent processing avoids assigning the blacklisted channels to the particular AP. Each of the APs develops a respective blacklist, as appropriate, and the 11 subsequent assigning is in accordance with the respective blacklist for each of the APs. In some 12 embodiments, blacklisting "expires" after a period of time, and a previously blacklisted channel 13 is removed from a blacklist for a particular AP, thus becoming available for assignment to the 14 particular AP. The expiration of blacklisting enables using channels that become less busy and/or less interfered with over time.

17 [0138] Processing continues with each AP scanning (passively, actively, or both) to 18 detect neighbor APs, in any combination of internal/external neighbors or one-/two-hop 19 neighbors, according to various embodiments. A respective address and signal strength is recorded for each of the neighbor APs. Passive scanning includes listening for control or data 21 traffic from other APs. Active scanning includes sending one or more probe packets to solicit a 22 response from any APs that have overhead the probe packet. In some embodiments, classifying 23 an AP as a neighbor is dependent on signal levels during transmission of packets. For example, 24 a two-hop (internal) neighbor with a relatively low signal level for packets sent along the two hops, is not classified as a neighbor, since interference is less likely due to the relatively low 26 signal level. For another example, a two-hop (internal) neighbor with a relatively high signal 27 level for packets sent along the two hops, is classified as a neighbor, since interference is more 28 likely due to the relatively high signal level.

[0139] Processing further continues with each one of the respective APs collecting 31 network usage information and/or statistics for the respective AP. For example, a respective one 32 of the APs records how many clients are being served by the respective AP
over time and how 33 much traffic is sent and/or received for the clients over time. The other APs record similar 34 information.

1 [0140] Subsequent processing formulates one or more assignments of channels to all or 2 portions of the APs of the network, based on any combination of the conditions evaluated, the 3 neighbors detected, and the usage information and/or statistics collected by each of the APs. In 4 some usage scenarios, assignments of channels to APs are made over time, and in some instances are improved over time as more information is collected. For example, an initial 6 assignment of channels to a particular AP of a network is made, followed by an improved 7 assignment of channels to the particular AP. The improved assignment of channels relies, in 8 part, on usage information for the particular AP that is collected in a period of time after the 9 initial assignment of channels is made.
11 [0141] Changes to channel assignments are, in some embodiments, event driven, thus 12 reducing interruptions or disruptions in network services. Example events are an explicit 13 request, such as by a network administrator, an AP entering or exiting the network, or a 14 relatively large change (either increase or decrease) in number of clients, traffic load, or interference on one or more APs.

17 [0142] Changes to assignments of channels of one or more APs in an operating network 18 are localized, in some embodiments. For example, when a new AP joins an operating network, 19 changes to channel assignments (and computation relating thereto) are restricted to channels assigned to the new AP, or alternatively channels assigned to or affected by the new AP. For 21 another example, when a network administrator explicitly reassigns a particular AP to a new 22 channel (such as in response to the particular AP reporting a currently assigned channel as over 23 or heavily loaded), changes in channel assignment are restricted to the particular AP. For 24 another example, when an AP requests a channel reassignment due to a degradation in operating conditions for a currently assigned channel, only the requesting AP receives a new channel 26 assignment.

28 [0143] In various embodiments, channel assignments are performed in a network where 29 one or more APs of the network operate with predetermined assignments, and channel assignments are computed according to the predetermined assignments. For example, a 31 particular AP of a network is operable on only a particular channel, and channel assignments for 32 other APs of the network are in accordance with the particular AP being restricted to operating 33 on only the particular channel.

[0144] In some embodiments, channel assignments are computed by a centralized 36 resource (such as an AP or a server), based at least in part on conditions evaluated, neighbors 1 detected, and usage information and/or statistics collected by all APs of a network. The 2 centralized resource takes into account conditions across the network as a whole, such as the 3 information from all of the APs, optionally providing preferential assignments of channels to 4 APs accordingly. For example, preferential assignments are optionally provided to APs that are in higher demand or are busier (such as due to relatively more clients and/or relatively higher 6 traffic loads). For another example, preferential assignments are optionally provided to APs that 7 that have relatively more neighbors or are operating on channels that are relatively higher loaded 8 or busier.

[0145] In some embodiments, channel assignments are computed locally by each 11 respective AP using conditions evaluated, neighbors detected, and usage information and/or 12 statistics collected by the respective AP, optionally supplemented with information from 13 neighbor APs of the respective AP.

18 [0146] A channel preference list is developed for each AP in a network. The 19 preference list for a particular AP is a sorted list of all channels that the particular AP is enabled to communicate with on the network. The sorting is according to one or more channel metrics, 21 such as relative load, so that relatively more lightly loaded channels are higher on the preference 22 list than relatively more heavily loaded channels. Channel load is measured, for example, by a 23 fraction (or normalization) of time a channel is busy such that an AP would be unable to begin 24 transmitting. For another example, channel load is measured as a quantity or severity of error conditions detected on a channel. For other examples, channel load is measured with respect to 26 communication quality on the channel, or signal strength, such as that of traffic sent by a 27 neighbor AP. When a particular channel is loaded beyond a threshold, then the particular 28 channel is optionally blacklisted and thus excluded from being assigned.
The blacklisting 29 optionally expires after a period of time, with the period of time optionally increasing when a channel is blacklisted repeatedly.

32 [0147] In some embodiments, information to formulate the preference lists is 33 communicated to a centralized resource, and the central resource formulates the information into 34 (sorted) channel preference lists for APs. In some embodiments, each respective AP locally formulates a respective channel preference list, and the preference lists are optionally 36 communicated to a centralized resource.

2 [0148] AP neighbor information is developed for each AP by setting all APs of a 3 network to transmit, at maximum power, on a same channel. The APs then scan (actively or 4 passively, as described elsewhere herein) for neighbors. Internal neighbors are distinguished from external neighbors by information provided in control messages. In some embodiments, 6 two-hop neighbor information is developed locally by the APs, while in some embodiments two-7 hop neighbor information is developed by a centralized resource, based on one-hop neighbor 8 information received from the APs. In some operating environments and/or usage scenarios, 9 interference caused by two-hop neighbors is unpredictable and difficult to calculate accurately, as the interference depends on propagation conditions, locations of APs and clients, transmit 11 powers, and noise levels at various devices. In some embodiments, an estimate for two-hop 12 interference is based in part on received signal measurements across the individual hops of the 13 two-hop link. In some embodiments, interference estimation (such as for two-hop interference) 14 is based in part on absolute and/or relative location information (e.g. GPS
data), optionally in conjunction with the signal measurements.

[0149] A description of embodiments of techniques to determine assignments of 21 channels for each of a plurality of APs enabled to participate in a network follows. The 22 description is conceptual in nature, and other embodiments are contemplated. The technique 23 begins by initializing to empty a bin for each channel that is assignable.
As an AP is assigned to 24 a channel, the AP is conceptually placed into the bin for the channel. In some situations, several APs are assigned to a single channel, and if so assigned, then the bin for the single channel holds 26 the several APs. After the initializing, each (if any) of the APs with a fixed or preconfigured 27 channel assignment is placed into the bins according to the fixed or preconfigured channel 28 assignment. For example, consider a network with three APs and three assignable channels.
29 The first AP is fixed to a first channel, the second AP is preconfigured to a second channel, and the third AP is enabled to use any of the three channels. The first AP is placed in the first bin, 31 the second AP is placed in the second bin, and the third AP is, as yet, not placed in any of the 32 bins, so the third bin is empty. In some usage scenarios, APs with fixed or preconfigured 33 channel assignments are APs with disabled channel assignment, or manually specified or set 34 channel assignment.

1 [0150] The unassigned APs (APs not yet assigned to a channel and thus not yet in any 2 of the bins) are then sorted according to a non-increasing order based on one or more factors.
3 For example, sorting is first performed on a first factor, and ties are broken by examining a 4 second factor. Further ties are broken by examining a third factor, and so forth. In some embodiments, equality is considered a tie, while in other embodiments, equality within a certain 6 threshold, fraction, or percentage is considered a tie. Example factors are number of various 7 classes of APs, such as neighbor APs (without regard to internal/external or number of hops), 8 internal neighbor APs (without regard to number of hops), external neighbor APs, one-hop 9 (internal) neighbor APs, and two-hop (internal) neighbor APs. Further example factors are number of clients on an AP and traffic load (e.g. rate of packets communicated per unit time) via 11 an AP.

13 [0151] While there are unassigned APs among the sorted APs, the first of the sorted 14 APs is selected and assigned to a chosen one of the assignable channels (and placed in the bin corresponding to the chosen channel). The chosen channel is chosen such that assigning the 16 selected AP to the chosen channel is expected to result in communication performance that is 17 higher than assigning the selected AP to any other of the assignable channels. The 18 communication performance is evaluated individually with respect to each of the assignable 19 channels, with the chosen channel being selected based on all of the evaluations, and thus the communication performance is with respect to all of the assignable channels.
Each of the 21 evaluations of an individual one of the channels is collectively with respect to the selected AP
22 and all of the other APs already assigned to the individual channel being evaluated, with the 23 communication performance corresponding to a hypothetical network formed of the collective 24 APs. In some embodiments, any of the assignable channels that are blacklisted by a particular one of the APs are not assigned to the particular AP.

27 [0152] When there are no remaining unassigned APs among the sorted APs, the 28 assignments of channels is complete. Each of the bins now holds all of the APs to be assigned 29 the channel corresponding to the respective bin. The assignments of channels are then communicated to the APs, and the APs are then operated as a network according to the 31 assignments of channels.

3 [0153] A description of embodiments of evaluating the communication performance of 4 a hypothetical network follows. In some usage scenarios, the following is performed for all assignable channels of a collection of APs enabled to operate as a network.
The evaluation of 6 the communication performance of a particular channel that is being considered for assignment 7 to a particular AP begins by counting how many one-hop (internal) neighbor APs there are for 8 each of the APs currently assigned to (or assumed to be assigned to) the particular channel, 9 including the particular AP the computation is being performed for. The counts are then averaged to a single value termed "Ni".

12 [0154] The evaluation continues by counting how many two-hop (internal) neighbor 13 APs there are for each of the APs currently assigned to (or assumed to be assigned to) the 14 particular channel, including the particular AP the computation is being performed for. The counts are then averaged to a single value termed "N2".

17 [0155] The evaluation continues by counting how many external neighbor APs there 18 are for each of the APs currently assigned to (or assumed to be assigned to) the particular 19 channel, including the particular AP the computation is being performed for. The counts are then averaged to a single value termed "N3".

22 [0156] The evaluation continues by counting how many neighbor APs there are for 23 each of the APs currently assigned to (or assumed to be assigned to) the particular channel, 24 including the particular AP the computation is being performed for. A
standard deviation, termed "S 1", is then determined for the counts. The counts include internal (both one-hop and 26 two-hop) neighbors as well as external neighbors.

28 [0157] Note that the various neighbor counts are with respect to the particular channel.
29 For example, the one-hop (and external) neighbors are with respect to a single wireless hop via the particular channel. For another example, the two-hop neighbors are with respect to two 31 wireless hops, both via the particular channel.

33 [0158] The evaluation of the communication performance of the particular channel and 34 the particular AP completes by weighting the averaged counts as a so-called Neighbor Impact Metric, or NIM, e.g.:

1 NIM = w1xN1 + w2xN2 + w3xN3;where 2 w1 + w2 + w3 = 1.
3 The weights (w1, w2, and w3) are chosen according to usage scenario and embodiment.
4 Example values are 0.5, 0.3, and 0.2, respectively, for w1, w2, and w3. In some embodiments and/or usage scenarios, providing separate weights for Ni and N2 enables better approximation 6 of interference effects of two-hop neighbors in comparison to one-hop neighbors or other 7 sources of interference. In some embodiments and/or usage scenarios, setting w3 to a lower 8 value than w1 and w2 prevents external neighbors from having a relatively large influence on 9 channel assignment, providing a benefit in some situations since the external neighbors are not subject to controls provided by and are not well known by the network.

12 [0159] After the respective communication performance for each of the assignable 13 channels has been evaluated according to the above, a chosen channel for the particular AP is 14 determined by selecting the channel that the NIM is the lowest for, as reduced neighbor impact is expected to result in higher communication performance of a network. If more than one of the 16 channels has the lowest N I M, then ties are broken according to channel preference(s) of the 17 particular AP. For example, if the NIM computed for two channels is identical, then the AP is 18 assigned the one of the two channels that is ranked higher in the preference list of the AP.
19 Further tie breaking, according to various embodiments, uses number of APs on channels (e.g.
choose a channel having fewer APs), S 1 (e.g. choose a channel having a lower standard 21 deviation), or both.

23 [0160] In some embodiments, the N1 (or N2, N3, or S 1) value is a metric (or is a basis 24 for a metric) that is representative of communication topology (e.g.
"neighbor-ness") and thus is conceptually a topological (communication) metric. In some embodiments, when a new AP
26 appears (such as by being switched on, becoming operational, or moving into range of a 27 network), computations relating to Ni (or N2, N3, or S 1) are reduced by computing only with 28 respect to the APs that are appropriate neighbors of the new AP. For example, only 29 computations for APs that are within a single wireless hop of the new AP
are performed when computing N1. For another example, only computations for APs that are two wireless hops 31 away from the new AP are performed when computing N2.

33 [0161] In various usage scenarios, the hypothetical network being evaluated 34 corresponds to a physical network, or a proposed or hypothesized network.
For example, the hypothetical network corresponds to a physical network that is operating according to existing 1 assignments of channels to APs. For another example, the hypothetical network corresponds to 2 a physical network that assignments of channels are being recomputed for due to one or more 3 changes in AP operating context (such as number of clients or traffic load), mode (such as being 4 switched on or off), or AP location. For another example, the hypothetical network corresponds to a proposed network under consideration in isolation or for comparison to another network.
6 For another example, the hypothetical network corresponds to a hypothesized network that is a 7 variation of an existing or previously evaluated physical network.

9 [0162] In some usage scenarios, a network is operated for enough time and under appropriate conditions to collect operational statistics (such as number of clients, traffic load, or 11 time busy sending and/or receiving) with respect to one or more APs of the network. The 12 operational statistics are collected over one or more time intervals and optionally summarized.
13 In some embodiments, the operational statistics (or summaries thereof) are referenced when 14 evaluating the communication performance. The reference to the operational statistics enables assigning channels so that preference is given to APs that are more highly utilized (such as 16 having a relatively larger number of clients, a relatively higher traffic load, or relatively more 17 time busy sending/receiving).

19 [0163] As previously described, N1, N2, N3, and S 1 are computed by counting each AP of an appropriate type of neighbor as one. In some alternate embodiments where operational 21 statistics are collected, N1, N2, N3, and S 1 are instead computed by counting each AP of an 22 appropriate type of neighbor as a value that varies according to a weighted sum of a constant and 23 a measure of how utilized the AP being counted is. The measure of utilization is a function of 24 the operational statistics. For example, in some alternate embodiments, the value (to count each AP as) is computed as:
26 Effective-AP-Count = w4x1 + w5xNum Clients +
27 w6xTraffic Load; where 28 w4 is a base weight, 29 Num C 1 i e n t s is how many clients the AP being counted has (optionally normalized), and 31 Traffic Load is how much communication the AP is participating in (such as traffic 32 load measured in, for example, packets per unit time, or such as time the AP is 33 busy sending and/or receiving) (optionally normalized).
34 Example values of weights w4, w5, and w6, are, respectively, 0.5, 0.3, and 0.2.

1 [0164] The Effective AP Count tends to bias NIMs computed for APs having 2 highly utilized neighbor APs higher than APs not having so highly utilized neighbor APs. The 3 higher NI Ms in turn result in lower priority for selection for channel assignment (as the choice of 4 channel assignment is according to lowest NIM), thus resulting in the highly utilized neighbor APs being impacted less (or not being additional impacted) by each channel assignment 6 compared to using a count value of one.

11 [0165] Channels are optionally or selectively reassigned over time, based on 12 information gathered, collected, or tracked across a network over time and/or summaries or 13 averages thereof. For example, the aforementioned operational statistics are periodically 14 sampled and the samples are used to periodically reassign channels to one or more APs in a network. For another example, one or more channel metrics used to formulate an AP preference 16 list (or the preference list itself) are gathered, collected, or tracked over time, and used to 17 reassign channels to one or more APs in a network. Reassigning channels over time enables 18 dynamic tracking of channel assignment according to usage of the network, and also enables 19 improving channel assignment over time as more information about the network and environment the network is operating in become known.

[0166] Control of and computations relating to channel assignment vary according to 26 embodiment, with some embodiments being characterized as relatively centralized while other 27 embodiments are characterized as relatively distributed. In some centralized embodiments, a 28 centralized resource (such as a designated or preselected AP of a network, or a server) receives 29 information from all APs of the network, and then computes and communicates the assignments of channels. Examples of the received information include number and type of neighbor APs of 31 APs that are internal to the network as well as APs that are external to the network. In some 32 centralized embodiments, the centralized resource computes preference lists for each AP of a 33 network, while in other centralized embodiments, each AP computes a respective preference list 34 to provide to the centralized resource.

1 [0167] In some distributed embodiments, each AP (independently) performs portions or 2 variations of the computations relating to assignment of channels for the respective AP, subject 3 to only information known directly by the respective AP or obtainable from neighbor APs of the 4 respective AP. Examples of information known by the respective AP include channel metrics used to formulate a preference list for the respective AP, and the preference list. Examples of 6 information obtainable from the neighbor APs include client and traffic statistics, such as per 7 channel.

AP HARDWARE

12 [0168] Fig. 3 illustrates selected details of hardware aspects of an embodiment of an 13 AP, such as any of APs 100-1, 100-2, 100-3, 100-4, and 100-5 of Fig. 1. The illustrated AP
14 includes Processor 305 coupled to various types of storage, including volatile read/write memory "Memory Bank" elements 301.1-2 via DRAM Memory Interface 302, and non-volatile 16 read/write memory Flash 303 and EEPROM 304 elements. The processor is further coupled to 17 Ethernet Interface 306 providing a plurality of Ethernet Ports 307 for establishing wired links, 18 and Wireless Interfaces 309-9 and 309-N providing radio communication of packets for 19 establishing wireless links. The wired links provide communication between the illustrated AP
and, for example, other APs or a centralized resource. The wireless links provide 21 communication between the illustrated AP and, for example, another AP
and/or a client of the 22 illustrated AP. In some embodiments, some of the Wireless Interfaces are compatible with an 23 IEEE 802.11 wireless communication standard (such as any of 802.1 la, 802.1 lb, 802.11g, and 24 802.1 in). In some embodiments, one or more of the Wireless Interfaces operate (in conjunction with any combination of hardware and software elements of the AP) to collect channel metrics 26 (such as used in part to determine a preference list), and to collect information used in part to 27 determine the assignment of channels. In some embodiments, one or more of the Wireless 28 Interfaces operate in accordance with the aforementioned assignment of channels. In some 29 embodiments, one or more of the Wireless Interfaces are configurable to drop all packets below a settable Received Signal Strength Indicator (RSSI) threshold. The illustrated partitioning is 31 only one example, as other equivalent embodiments of an AP are possible.

33 [0169] In operation, the processor fetches instructions from any combination of the 34 storage elements (such as DRAM, Flash, and EEPROM) that operate as computer readable media, and executes the instructions. Some of the instructions correspond to software associated 36 with operating the AP to collect the channel metrics and the information used for the assignment 1 of channels. Some of the instructions correspond to software associated with operating the AP
2 in accordance with the assignment of channels. In various embodiments, some of the 3 instructions correspond to software associated with centralized and/or distributed channel 4 assignment. In some embodiments, some of the instructions correspond to all or any portion of software illustrated in Fig. 4, such as NMS Manager 401, Ethernet Driver 414, and Radio Driver 6 415.

11 [01701 Fig. 4 illustrates selected details of software aspects of an embodiment of an AP, 12 such as any of APs 100-1, 100-2, 100-3, 100-4, and 100-5 of Fig. 1. Various software modules 13 are illustrated in a context that conceptually illustrates AP communication and connectivity 14 capability as Hardware Interfaces 420. The illustrated software includes NMS Manager 401 interfacing to Network Interface Manager 402 and FCAPS Manager 403. In some embodiments, 16 the NMS interfaces between management software operating external to the AP
and software 17 operating internal to the AP (such as various applications and FCAPS). The Network Interface 18 Manager manages physical network interfaces, such as the Ethernet and Wireless Interfaces of 19 an AP, as illustrated by Ethernet Interface 306 (also illustrated in Fig.
3) and Wireless Interfaces 309 (representative of Wireless Interfaces 309-A ... 309-N of Fig. 3). The Network Interface 21 Manager assists the NMS in passing dynamic configuration changes (as requested by a user) 22 through the management software to FCAPS. In some embodiments, FCAPS
includes functions 23 to store and retrieve configuration information, and FCAPS functions serve all applications 24 requiring persistent configuration information. FCAPS optionally assists in collecting fault information and statistics and performance data from various operating modules of the AP.
26 FCAPS selectively passes any portion or all of the collected information, statistics, and data to 27 the NMS.

29 [01711 Kernel Interface 410 interfaces the Managers to Routing and Transport Protocols layer 411 and Flash File System module 413. The Transport Protocols include TCP
31 and UDP. The Flash File System module interfaces to Flash Driver 416 that is illustrated 32 conceptually coupled to Non-Volatile hardware element 423 that is representative of a flash file 33 system (e.g. data organized in a non-volatile memory) stored in any combination of Flash 303 34 and EEPROM 304 elements of Fig. 3. Layer-2 Abstraction Layer 412 interfaces the Routing and Transport Protocols to Ethernet and Radio Drivers 414 and 415, respectively. The Ethernet 36 Driver is illustrated conceptually coupled to Ethernet Interface 306 of Fig. 3. The Radio Driver 1 is illustrated conceptually coupled to Wireless Interfaces 309 that is representative of the 2 Wireless Interfaces 309-A ... 309-N of Fig. 3. In some embodiments, the software includes a 3 serial driver. The software is stored on a computer readable medium (e.g.
any combination of 4 the DRAM, Flash, and EEPROM elements), and is executed by a programmable element, such as Processor 305 of Fig. 3. The illustrated partitioning is an example only, as many other 6 equivalent arrangements of layers are possible.

8 [0172] In various embodiments, any combination of all or portions of software relating 9 to operating the AP to collect channel metrics and information used for the assignment of channels, operating the AP in accordance with the assignment of channels, and centralized 11 and/or distributed channel assignment, is included in any combination of NMS Manager 401, 12 Ethernet Driver 414, Radio Driver 415, and other software modules not explicitly illustrated in 13 Fig. 4.

18 [0173] Certain choices have been made in the description merely for convenience in 19 preparing the text and drawings and unless there is an indication to the contrary the choices should not be construed per se as conveying additional information regarding structure or 21 operation of the embodiments described. Examples of the choices include:
the particular 22 organization or assignment of the designations used for the figure numbering and the particular 23 organization or assignment of the element identifiers (i.e., the callouts or numerical designators) 24 used to identify and reference the features and elements of the embodiments.
26 [0174] Although the foregoing embodiments have been described in some detail for 27 purposes of clarity of description and understanding, the invention is not limited to the details 28 provided. There are many embodiments of the invention. The disclosed embodiments are 29 exemplary and not restrictive.
31 [0175] It will be understood that many variations in construction, arrangement, and use 32 are possible consistent with the description and are within the scope of the claims of the issued 33 patent. For example, interconnect and function-unit bit-widths, clock speeds, and the type of 34 technology used are variable according to various embodiments in each component block. The names given to interconnect and logic are merely exemplary, and should not be construed as 36 limiting the concepts described. The order and arrangement of flowchart and flow diagram 1 process, action, and function elements are variable according to various embodiments. Also, 2 unless specifically stated to the contrary, value ranges specified, maximum and minimum values 3 used, or other particular specifications (such as protocol standards;
communication standards;
4 networking technologies; and the number of entries or stages in registers and buffers), are merely those of the described embodiments, are expected to track improvements and changes in 6 implementation technology, and should not be construed as limitations.

8 [0176] Functionally equivalent techniques known in the art are employable instead of 9 those described to implement various components, sub-systems, functions, operations, routines, and sub-routines. It is also understood that many functional aspects of embodiments are 11 realizable selectively in either hardware (i.e., generally dedicated circuitry) or software (i.e., via 12 some manner of programmed controller or processor), as a function of embodiment dependent 13 design constraints and technology trends of faster processing (facilitating migration of functions 14 previously in hardware into software) and higher integration density (facilitating migration of functions previously in software into hardware). Specific variations in various embodiments 16 include, but are not limited to: differences in partitioning; different form factors and 17 configurations; use of different operating systems and other system software; use of different 18 interface standards, network protocols, or communication links; and other variations to be 19 expected when implementing the concepts described herein in accordance with the unique engineering and business constraints of a particular application.

22 [0177] The embodiments have been described with detail and environmental context 23 well beyond that required for a minimal implementation of many aspects of the embodiments 24 described. Those of ordinary skill in the art will recognize that some embodiments omit disclosed components or features without altering the basic cooperation among the remaining 26 elements. It is thus understood that much of the details disclosed are not required to implement 27 various aspects of the embodiments described. To the extent that the remaining elements are 28 distinguishable from the prior art, components and features that are omitted are not limiting on 29 the concepts described herein.
31 [0178] All such variations in design comprise insubstantial changes over the teachings 32 conveyed by the described embodiments. It is also understood that the embodiments described 33 herein have broad applicability to other computing and networking applications, and are not 34 limited to the particular application or industry of the described embodiments. The invention is thus to be construed as including all possible modifications and variations encompassed within 36 the scope of the claims of the issued patent.

Claims (20)

1. A system comprising:
a processor;
a memory readable by the processor;
wherein the memory stores instructions that when executed by the processor enable the processor to perform functions comprising:
receiving communication condition information from each of a plurality of access points enabled to participate in a network, the plurality of access points comprising a first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point, and determining assignments of channels to each of the access points based at least in part on the communication condition information;
and wherein the assignments of channels are based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the plurality of access points that are one and two wireless hops distant to each access point, averaging the counts over the plurality of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of any one of the access points individually.
2. The system of claim 1, wherein the determining is preferential to a particular one of the access points experiencing relatively higher communication load than other ones of the access points.
3. The system of claim 1, wherein one of the access points comprises the processor.
4. The system of claim 1, wherein a server accessible to the access points comprises the processor.
5. A computer readable medium having a set of instructions stored therein that when executed by a processing element causes the processing element to perform functions comprising:
receiving communication condition information from each of a plurality of access points enabled to participate in a network, the plurality of access points comprising a first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point;
determining assignments of channels to each of the access points based at least in part on the communication condition information; and wherein the assignments of channels are based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the plurality of access points that are one and two wireless hops distant to each access point, averaging the counts over the plurality of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of any one of the access points individually.
6. The computer readable medium of claim 5, wherein the determining is in response to an event.
7. The computer readable medium of claim 6, wherein the event comprises one or more of a change in an aspect of the communication condition information, one of the access points becoming no longer enabled to participate in the network, and a new access point becoming enabled to participate in the network.
8. The computer readable medium of claim 5, wherein one of the access points comprises the processing element.
9. The computer readable medium of claim 5, wherein a server accessible to the access points comprises the processing element.
10. A method comprising:
receiving communication condition information from each of a plurality of access points enabled to participate in a network, the plurality of access points comprising a first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point;
determining assignments of channels to each of the access points based at least in part on the communication condition information; and wherein the assignments of channels are based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the plurality of access points that are one and two wireless hops distant to each access point, averaging the counts over the plurality of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of any one of the access points individually.
11. The method of claim 10, wherein the communication condition information from a particular one of the access points comprises availability of channels with respect to the particular access point.
12. The method of claim 10, wherein the communication condition information from a particular one of the access points comprises a count of neighbor access points the particular access point is able to communicate with in a single wireless hop.
13. The method of claim 10, wherein the communication condition information from a particular one of the access points comprises a communication load of the particular access point.
14. The method of claim 10, wherein the communication condition information from a particular one of the access points comprises a count of clients served by the particular access point.
15. A system for assigning channels in a wireless access network, the system comprising:
processor means for receiving communication condition information from each of a plurality of access points enabled to participate in a network, the plurality of access points comprising a first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point;
processor means for determining assignments of channels to each of the access points based at least in part on the communication condition information; and wherein the assignments of channels are based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the plurality of access points that are one and two wireless hops distant to each access point, averaging the counts over the plurality of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of any one of the access points individually.
16. The system of claim 15, wherein the processor means for determining is preferential to particular one of the access points experiencing relatively higher communication load than other ones of the access points.
17. A method comprising:
evaluating communication conditions local to a first access point enabled to participate in a network, a plurality of access points comprising the first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point;
operating the access point in accordance with a channel assignment that is a function of the evaluating; and wherein the channel assignment is based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the plurality of access points that are one and two wireless hops distant to each access point, averaging the counts over the plurality of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of the first access point.
18. The method of claim 17, wherein the first access point is enabled to communicate via one or more channels, and the evaluating comprises computing availability of the channels with respect to the first access point.
19. A system for assigning channels in a wireless access network, the system comprising:
processor means for determining a neighbor impact metric in a network of access points comprising a first access point one wireless hop distant and two wireless hops distant respectively from a second access point and a third access point;

processor means for assigning channels to the network of access points, the processor means for assigning channels being based at least in part on results of the processor means for determining; and wherein the assignments of channels are based at least in part on, for each of the channels available for assignment, computing counts of respective subsets of the network of access points that are one and two wireless hops distant to each access point, averaging the counts over the network of access points, and weighting the averaged counts, as part of a strategy for optimizing overall communication performance of the network at a higher priority than optimizing communication performance of any one of the access points individually.
20. The system of claim 19, wherein the processor means for assigning channels is further based at least in part on respective channel preference lists from each of the access points.
CA2711947A 2008-01-24 2009-01-13 Channel assignment for wireless access networks Active CA2711947C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
IN203DE2008 2008-01-24
IN203/DEL/2008 2008-01-24
PCT/US2009/030880 WO2009094264A2 (en) 2008-01-24 2009-01-13 Channel assignment for wireless access networks

Publications (2)

Publication Number Publication Date
CA2711947A1 CA2711947A1 (en) 2009-07-30
CA2711947C true CA2711947C (en) 2016-09-13

Family

ID=40901596

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2711947A Active CA2711947C (en) 2008-01-24 2009-01-13 Channel assignment for wireless access networks

Country Status (7)

Country Link
US (5) US8830921B2 (en)
CN (1) CN101981990B (en)
CA (1) CA2711947C (en)
GB (1) GB2490607B (en)
HK (1) HK1153341A1 (en)
TW (1) TWI391014B (en)
WO (1) WO2009094264A2 (en)

Families Citing this family (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4861415B2 (en) 2005-07-20 2012-01-25 ファイアータイド、インク. Route optimization for on-demand routing protocols for mesh networks
KR101298155B1 (en) 2005-07-21 2013-09-16 파이어타이드, 인코포레이티드 Method for enabling the efficient operation of arbitrarily interconnected mesh networks
TWI323110B (en) 2005-07-30 2010-04-01 Firetide Inc System and method for a shared access network
US8948046B2 (en) 2007-04-27 2015-02-03 Aerohive Networks, Inc. Routing method and system for a wireless network
WO2009094264A2 (en) * 2008-01-24 2009-07-30 Firetide, Inc. Channel assignment for wireless access networks
US8218502B1 (en) 2008-05-14 2012-07-10 Aerohive Networks Predictive and nomadic roaming of wireless clients across different network subnets
US9674892B1 (en) 2008-11-04 2017-06-06 Aerohive Networks, Inc. Exclusive preshared key authentication
US8483194B1 (en) 2009-01-21 2013-07-09 Aerohive Networks, Inc. Airtime-based scheduling
WO2010130104A1 (en) * 2009-05-15 2010-11-18 华为终端有限公司 Method, device and system for controlling access point
US11115857B2 (en) 2009-07-10 2021-09-07 Extreme Networks, Inc. Bandwidth sentinel
US9900251B1 (en) 2009-07-10 2018-02-20 Aerohive Networks, Inc. Bandwidth sentinel
US8441997B2 (en) * 2010-04-30 2013-05-14 Juni America, Inc. Remote management system for self-organizing femtocells
TWI472190B (en) * 2010-06-29 2015-02-01 Hon Hai Prec Ind Co Ltd Cable modem and scanning method
US9002277B2 (en) 2010-09-07 2015-04-07 Aerohive Networks, Inc. Distributed channel selection for wireless networks
CN102469493B (en) * 2010-11-18 2014-07-02 杭州华三通信技术有限公司 Method and device for estimating hollow states of wireless local area network
US10091065B1 (en) 2011-10-31 2018-10-02 Aerohive Networks, Inc. Zero configuration networking on a subnetted network
JP6059241B2 (en) * 2011-11-01 2017-01-11 トムソン ライセンシングThomson Licensing Method and apparatus for selecting a channel
CN102695175B (en) * 2012-04-24 2015-04-08 华为技术有限公司 Method for distributing WLAN (Wireless Local Area Network) access channels, equipment and system for distributing WLAN access channels
EP2862301B1 (en) 2012-06-14 2020-12-02 Extreme Networks, Inc. Multicast to unicast conversion technique
CN107347185B (en) * 2012-10-26 2020-01-17 中国移动通信集团北京有限公司 Method and equipment for signal transmission
US8948044B2 (en) * 2012-10-30 2015-02-03 Toyota Jidosha Kabushiki Kaisha Weighted-fairness in message rate based congestion control for vehicular systems
US20140185443A1 (en) * 2012-12-28 2014-07-03 Futurewei Technologies, Inc. Data optimization technique for the exchange of data at the edge of a wireless local area network
US10389650B2 (en) 2013-03-15 2019-08-20 Aerohive Networks, Inc. Building and maintaining a network
US9413772B2 (en) 2013-03-15 2016-08-09 Aerohive Networks, Inc. Managing rogue devices through a network backhaul
CN104185188B (en) * 2013-05-27 2017-11-24 华为技术有限公司 Disturb processing method and equipment
CN104469959B (en) * 2013-09-12 2018-10-09 华为技术有限公司 A kind of channel arrangement method and system, access controller
US20150350925A1 (en) * 2014-05-30 2015-12-03 Geoffrey Granville Hammett Radio Frequency Space Division Multiplexing
JP6327023B2 (en) * 2014-07-04 2018-05-23 株式会社バッファロー Communication channel selection device, communication channel selection method, and communication channel selection program
US20170111821A1 (en) * 2015-10-19 2017-04-20 Relay2, Inc. Distributed load balancing for access points
US20180300190A1 (en) 2015-06-24 2018-10-18 Relay2, Inc. Mobile application service engine (mase)
EP3284279B1 (en) * 2015-09-29 2020-10-28 Hewlett-Packard Enterprise Development LP Air-time capacities
US20180027468A1 (en) * 2016-07-20 2018-01-25 Zinwave Limited Techniques for load balancing in a network environment
EP3280177B1 (en) * 2016-08-01 2019-05-22 Alcatel Lucent Control method and control system for controlling access points in a wireless network
EP3300446A1 (en) * 2016-09-22 2018-03-28 Alcatel Lucent Method and system for controlling access to a contention-based access network
US9986499B1 (en) * 2016-11-07 2018-05-29 Microsoft Technology Licensing, Llc Location-based determination of channel for initiating peer-to-peer session
US10229018B2 (en) * 2017-02-27 2019-03-12 Dell Products, Lp System and method for data restore flexibility on dual channel NVDIMMs
US20180279130A1 (en) * 2017-03-24 2018-09-27 Qualcomm Incorporated Enhanced channel selection in a network having multiple access points
US10440723B2 (en) * 2017-05-17 2019-10-08 Cisco Technology, Inc. Hierarchical channel assignment in wireless networks
WO2018229312A1 (en) * 2017-06-15 2018-12-20 Aoife Solutions, S.L. Method, system and apparatus for automatic channel assignment in wireless communication networks
US10609064B2 (en) * 2017-07-06 2020-03-31 Bank Of America Corporation Network device access control and information security
US10721752B2 (en) 2017-09-10 2020-07-21 Hewlett Packard Enterprise Development Lp Channel plan determination
US11310804B2 (en) * 2017-11-02 2022-04-19 Arris Enterprises Llc Coordinated frequency usage in multi-AP environments
WO2019127204A1 (en) * 2017-12-28 2019-07-04 华为技术有限公司 Data transmission method and device
CN110300395B (en) * 2018-03-23 2020-11-17 浙江汉朔电子科技有限公司 Resource management method, related device, system and storage medium
US11474915B2 (en) * 2018-08-28 2022-10-18 Hewlett Packard Enterprise Development Lp Cluster recovery manager to remediate failovers
US11375395B2 (en) * 2019-06-10 2022-06-28 Amazon Technologies, Inc. Centralized radio resource management (RRM) of a wireless mesh network
CN110461006B (en) * 2019-08-15 2022-10-14 普联技术有限公司 Method and device for reducing WLAN interference and terminal equipment

Family Cites Families (77)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5832384A (en) * 1993-11-12 1998-11-03 Balachandran; Kumar Method and apparatus for frequency agility in a communication system
JP2661533B2 (en) * 1993-12-27 1997-10-08 日本電気株式会社 Channel allocation method for mobile communication system
GB2303998B (en) * 1995-08-03 2000-03-01 Nokia Mobile Phones Ltd Radio telephones and methods of operation
US5987062A (en) * 1995-12-15 1999-11-16 Netwave Technologies, Inc. Seamless roaming for wireless local area networks
JP3204310B2 (en) * 1998-08-12 2001-09-04 日本電気株式会社 CDMA mobile communication system and downlink transmission power control method thereof
US6970927B1 (en) * 2000-04-18 2005-11-29 Wayport, Inc. Distributed network communication system which provides different network access features
US6944175B2 (en) * 2000-12-07 2005-09-13 Nortel Networks Limited Method and apparatus for scheduling forward link data transmissions in CDMA/HDR networks
US6757520B2 (en) * 2001-06-26 2004-06-29 Qualcomm Incorporated Method and apparatus for selecting a serving sector in a data communication system
US7813740B2 (en) * 2001-10-15 2010-10-12 Qualcomm Incorporated Method and apparatus for managing imbalance in a communication system
US6842621B2 (en) * 2001-12-21 2005-01-11 Motorola, Inc. Method and apparatus for splitting control and media content from a cellular network connection
JP3898533B2 (en) * 2002-03-11 2007-03-28 シャープ株式会社 Wireless communication system
US6993334B2 (en) * 2002-04-30 2006-01-31 Qualcomm Inc. Idle handoff with neighbor list channel replacement
GB0211286D0 (en) * 2002-05-16 2002-06-26 Nokia Corp Routing data packets through a wireless network
US7580394B2 (en) * 2002-11-27 2009-08-25 Nokia Corporation System and method for collision-free transmission scheduling in a network
US20040203828A1 (en) * 2002-12-06 2004-10-14 Vinod Mirchandani Selective channel assignment in a wireless data communications network
KR100514190B1 (en) * 2003-01-03 2005-09-13 삼성전자주식회사 method for management of the wireless channel to wireless IP terminals in the Access Point wireless LAN based
US7174170B2 (en) * 2003-02-12 2007-02-06 Nortel Networks Limited Self-selection of radio frequency channels to reduce co-channel and adjacent channel interference in a wireless distributed network
US20050003827A1 (en) * 2003-02-13 2005-01-06 Whelan Robert J. Channel, coding and power management for wireless local area networks
US20040215750A1 (en) * 2003-04-28 2004-10-28 Stilp Louis A. Configuration program for a security system
KR100999094B1 (en) * 2003-06-27 2010-12-07 삼성전자주식회사 Method and System for Wireless Local Area Network Communication Using Virtual TDMA
KR100657093B1 (en) * 2003-08-29 2006-12-12 삼성전자주식회사 Apparatus and method for controlling operational states of medium access control layer in broadband wireless access communication system
US7079552B2 (en) 2003-09-09 2006-07-18 Harris Corporation Mobile ad hoc network (MANET) with quality-of-service (QoS) protocol hierarchy and related methods
US7068605B2 (en) 2003-09-09 2006-06-27 Harris Corporation Mobile ad hoc network (MANET) providing interference reduction features and related methods
EP1515487B1 (en) * 2003-09-10 2010-05-05 Delta Networks, Inc. Qos Based load-balance policy for WLAN
KR20050028354A (en) * 2003-09-17 2005-03-23 삼성전자주식회사 System and method for dynamic channel allocation in communication system using orthogonal frequency division multiple access scheme
US7212821B2 (en) * 2003-12-05 2007-05-01 Qualcomm Incorporated Methods and apparatus for performing handoffs in a multi-carrier wireless communications system
US7738413B2 (en) * 2003-12-08 2010-06-15 The Regents Of The University Of California Minimizing power consumption in a wireless system for a sensor networks using time slots for nodes
US7260361B2 (en) 2003-12-29 2007-08-21 Intel Corporation Locating interfering devices in wireless networks using channel adaptation metrics
US20050195739A1 (en) * 2004-02-23 2005-09-08 Grover Wayne D. Protecting a network using protected working capacity envelopes
US20050265288A1 (en) * 2004-05-27 2005-12-01 Jiewen Liu Apparatus and method capable of automatic allocation of operating channels in a wireless network
US7509131B2 (en) * 2004-06-29 2009-03-24 Microsoft Corporation Proximity detection using wireless signal strengths
JP4685501B2 (en) * 2004-07-07 2011-05-18 株式会社エヌ・ティ・ティ・ドコモ Channel assignment method
CN100574501C (en) * 2004-07-27 2009-12-23 日本电气株式会社 Controlling uplink radio resource, base station equipment and radio network controller
KR101050584B1 (en) * 2004-07-30 2011-07-19 삼성전자주식회사 Apparatus and method for controlling medium access in wireless access system
WO2006036043A1 (en) * 2004-08-17 2006-04-06 Samsung Electronics Co., Ltd. Method and system for forming and transmitting/receiving neighbor base station information in a bwa communication system
CA2576720A1 (en) * 2004-08-31 2006-03-09 At&T Corp. Method and system for assigning channels in a wireless lan
US7787416B2 (en) * 2004-11-18 2010-08-31 Gidwani Sanjay M Wireless network having real-time channel allocation
KR100666983B1 (en) * 2004-12-22 2007-01-10 삼성전자주식회사 System and Method for Transferring Context of Mobile Node During Hand-over in Wireless Network
CA2886341C (en) * 2005-02-04 2015-12-22 Kabushiki Kaisha Toshiba Optimal channel assignment for multi-class, multi-channel wireless lans and the like
JP2006319676A (en) * 2005-05-12 2006-11-24 Oki Electric Ind Co Ltd Frame transmitting method, topology acquiring method and radio communication system
ATE525830T1 (en) 2005-05-12 2011-10-15 Koninkl Philips Electronics Nv DISTRIBUTED LEARNING METHOD FOR WIRELESS MESH NETWORKS
EP1884095A1 (en) * 2005-05-27 2008-02-06 Nokia Corporation Assignment of sub-channels to channels in a multi transmission-channel system
US8254360B2 (en) * 2005-06-16 2012-08-28 Qualcomm Incorporated OFDMA control channel interlacing
HUE042367T2 (en) * 2005-06-16 2019-06-28 Qualcomm Inc Negotiated channel information reporting in a wireless communication system
US7885295B2 (en) * 2005-06-17 2011-02-08 Telefonaktiebolaget Lm Ericsson (Publ) Communication resource management
KR100739725B1 (en) * 2005-08-29 2007-07-13 삼성전자주식회사 Method and apparatus for fast and efficient handover at link layer of wireless LAN
KR100615139B1 (en) * 2005-10-18 2006-08-22 삼성전자주식회사 Method and apparatus for allocating transmission period in wireless telecommunication system and therefor system
CN101341769B (en) * 2005-12-20 2012-01-25 艾利森电话股份有限公司 Resource scheduling in cellular system
CN100403719C (en) * 2006-02-10 2008-07-16 华为技术有限公司 Virtual-link set-up method and apparatus
US7936681B2 (en) 2006-03-06 2011-05-03 Cisco Technology, Inc. Cross-layer design techniques for interference-aware routing configuration in wireless mesh networks
US20070264938A1 (en) * 2006-05-10 2007-11-15 Bhaskar Srinivasan Method and system for adaptive link monitoring in wireless sensor networks
EP2033327B1 (en) * 2006-05-16 2011-04-06 Imec Digital receiver for software-defined radio implementation
JP5084373B2 (en) * 2006-07-13 2012-11-28 日本電気通信システム株式会社 Interference prediction apparatus, interference prediction method, and interference prediction program
US7881269B2 (en) * 2006-07-26 2011-02-01 Symbol Technologies, Inc. Media type access category based channel management for a wireless network
US8223715B2 (en) * 2006-08-11 2012-07-17 Polycom, Inc. Handoff method in a wireless LAN in the presence of a radar signal
US7826365B2 (en) * 2006-09-12 2010-11-02 International Business Machines Corporation Method and apparatus for resource allocation for stream data processing
US20080112358A1 (en) * 2006-11-09 2008-05-15 Broadcom Corporation, A California Corporation Cell protocol adapting between single and concurrent interfering transmissions and receptions based on channel conditions
TWI331864B (en) * 2006-12-01 2010-10-11 Cameo Communications Inc Method and device of automatic channel assign for wireless network system
US20080159207A1 (en) * 2006-12-28 2008-07-03 Motorola, Inc. Method and apparatus for cognitive spectrum assignment for mesh networks
US8031615B2 (en) * 2007-02-27 2011-10-04 Tropos Networks, Inc. Balancing clusters of a wireless mesh network
US8498356B2 (en) * 2007-04-13 2013-07-30 Samsung Electronics Co., Ltd. Apparatus and method of generating codebook for multiple input multiple output communication system
US7907562B2 (en) * 2007-06-20 2011-03-15 Microsoft Corporation Managing dense wireless access point infrastructures in wireless local area networks
EP2193680B1 (en) * 2007-08-06 2015-05-20 Telefonaktiebolaget L M Ericsson (publ) Ofdma uplink interference impact recovery in lte system
EP2186287A1 (en) * 2007-08-30 2010-05-19 Thomson Licensing A unified peer-to-peer and cache system for content services in wireless mesh networks
US7965671B2 (en) * 2007-10-01 2011-06-21 Powerwave Cognition, Inc. Dynamic channel sharing using bandwidth metrics
US7849216B2 (en) * 2007-10-31 2010-12-07 Cisco Technology, Inc. Channel assignment for a multi-channel dual-radio mesh backhaul
US8301081B2 (en) 2007-11-13 2012-10-30 Microsoft Corporation Physical and MAC adaptation for interference mitigation with cognitive radio
WO2009067259A1 (en) * 2007-11-25 2009-05-28 Trilliant Networks, Inc. Transport layer and model for an advanced metering infrastructure (ami) network
KR20090065166A (en) * 2007-12-17 2009-06-22 한국전자통신연구원 Method for broadcasting and receiving neighbor advertisiment message in broadband wireless access system, and handover method using the same
WO2009094264A2 (en) * 2008-01-24 2009-07-30 Firetide, Inc. Channel assignment for wireless access networks
US8315237B2 (en) * 2008-10-29 2012-11-20 Google Inc. Managing and monitoring emergency services sector resources
US8275404B2 (en) * 2008-10-29 2012-09-25 Google Inc. Managing and monitoring emergency services sector resources
KR101517021B1 (en) * 2008-11-10 2015-04-30 삼성전자주식회사 Apparatus and method for id cell allocation to avoid preamble pseudo noise code duplication in broadband wireless communication system
US8320967B2 (en) * 2010-12-14 2012-11-27 Telefonaktiebolaget Lm Ericsson (Publ) User location based switching between diversity and multiplexing
US9060279B2 (en) * 2012-07-31 2015-06-16 Aruba Networks, Inc. System and method for computing coverage set and resource allocations in wireless networks
US10085154B2 (en) * 2012-10-17 2018-09-25 Huawei Technologies Co., Ltd. System and method for dynamic inter-cell interference coordination
US20140302796A1 (en) * 2013-04-09 2014-10-09 Eden Rock Communications, Llc Downlink interference detection using transmission matrices

Also Published As

Publication number Publication date
US20150208426A1 (en) 2015-07-23
US20110051677A1 (en) 2011-03-03
WO2009094264A2 (en) 2009-07-30
US20210058933A1 (en) 2021-02-25
GB2490607B (en) 2013-03-20
TW200944013A (en) 2009-10-16
US20190141715A1 (en) 2019-05-09
HK1153341A1 (en) 2012-03-23
US10616900B2 (en) 2020-04-07
TWI391014B (en) 2013-03-21
US20230379952A1 (en) 2023-11-23
US11659580B2 (en) 2023-05-23
GB2490607A (en) 2012-11-07
GB201209366D0 (en) 2012-07-11
CN101981990A (en) 2011-02-23
WO2009094264A3 (en) 2009-10-29
US8830921B2 (en) 2014-09-09
US9999058B2 (en) 2018-06-12
CA2711947A1 (en) 2009-07-30
CN101981990B (en) 2015-09-23

Similar Documents

Publication Publication Date Title
US11659580B2 (en) Channel assignment for wireless access networks
Rehmani et al. SURF: A distributed channel selection strategy for data dissemination in multi-hop cognitive radio networks
US8422453B2 (en) Communication systems
US8543121B2 (en) Systems and methods for usage-based radio resource management of self-optimizing cells
US20100085884A1 (en) Dynamic topological adaptation
US20140140295A1 (en) Apparatus and Method for Proactive Inter-Cell Interference Coordination
JPWO2008004561A1 (en) Radio base station, load distribution apparatus, centralized control apparatus, radio communication system, load distribution method, and load distribution program
Bayhan et al. Optimal mapping of stations to access points in enterprise wireless local area networks
US9538387B2 (en) Radio resource assignment coordination in superdense networks
Al-Makhadmeh et al. An intelligence-based recurrent learning scheme for optimal channel allocation and selection in device-to-device communications
Chen et al. Spectrum-aware routing in discontinuous orthogonal frequency division multiplexing-based cognitive radio ad hoc networks
EP4075878A1 (en) Determining coverage access
ElBadawy Optimal RAT selection algorithm through Common Radio Resource Management in heterogeneous wireless networks
Qureshi et al. Joint energy and throughput based multichannel assignment in cognitive radio sensor network
CN114189308A (en) User terminal control method, base station and storage medium
Ting et al. Scalability study of backhaul capacity sensitive network selection scheme in LTE‐WiFi HetNet
US20240073706A1 (en) Uplink performance using multiple wireless devices
Dimitriou et al. Context-aware radio resource management in HetNets
Jingmin et al. Survey of outdoor and indoor architecture design in TVWS networks
Mayuri et al. MPGA: QOS adequacy latitude aware cooperative spectrum sensing in Cognitive Wireless Mesh Networks by Meticulous Progression based GA
Rana Fairness in Resource Allocation along with Cooperative Centralized Sensing in Cognitive Radio Networks
Mayuri QoS variance aware spectrum sensing and allocation strategy for cognitive radio wireless mesh networks
Naik et al. Utilizing the synchrony among base stations for better performance of channel assignment algorithms
Bajracharya Energy-Aware Access Point Management for Green WLAN
SURF Channel Assortment Strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks

Legal Events

Date Code Title Description
EEER Examination request

Effective date: 20131203