Basic Service Set Color-Based Isotope Radiated Power Assignment for Enterprise Networks

Abstract

A method for assigning effective isotope radiation power to access points in a wireless network is provided. In one aspect, a method includes determining weights for neighboring access points in a wireless network based on channel frequency and basic service set color assignments. For a particular access point, a first path loss based on the determined weights and a second path loss based on neighboring access points are calculated. First and second effective isotope radiation power values ​​are calculated based on the respective first and second path losses. The effective isotope radiation power of the particular access point is adjusted based on the lower of the first and second calculated effective isotope radiation power values. Systems and machine-readable media are also provided.

Description

Background Art

[0001] Basic Service Set (BSS) color and channel assignments are provided by IEEE 802.11 as fields in wireless packets. Multiple available values ​​of BSS color can be assigned to channels, where BSS color is used to identify and distinguish overlapping signals. Each access point in a wireless network has associated color, channel, and effective isotope radiated power (EIRP) attributes. For any particular access point, if color and channel assignments have been given, it is usually difficult to assign EIRP to a particular access point.

[0002] The description provided in the background section should not be admitted to be prior art merely because it is mentioned in or related to the background section.The background section may include information describing one or more aspects of the subject technology. Summary of the invention

[0003] According to certain aspects of the present disclosure, a method is provided. The disclosed method provides for using a network device to determine a weight for each of the plurality of neighboring access points in the radio frequency neighborhood of a particular access point based at least on a basic service set color and a channel frequency of the plurality of neighboring access points in the radio frequency neighborhood of the particular access point. The method also calculates a first path loss from the neighboring access point based on the determined weight of each neighboring access point, and also calculates a second path loss based on the neighboring access point. The method also calculates first and second effective isotope radiation power values ​​based on the calculated first and second path losses. The method also adjusts the effective isotope radiation power associated with the particular access point based on the lower value between the first effective isotope radiation power and the second effective isotope radiation power.

[0004] According to certain aspects of the present disclosure, a system is provided. The disclosed system provides a memory and a processor, the processor being configured to execute instructions to determine and adjust the effective isotope radiation power associated with a specific access point in a wireless network. The system determines one of a first weight, a second weight, a third weight, a third priority weight, a fourth weight, and a fourth priority weight for each of the plurality of neighboring access points in the radio frequency neighborhood of the specific access point. The weight is based at least on the basic service set color and the channel frequency of each neighboring access point. The system also calculates a first path loss from the neighboring access point based on the determined weight of each neighboring access point, and also calculates a second path loss based on the neighboring access point. The system also calculates a first and a second effective isotope radiation power value based on the calculated first and second path losses. Then, the system adjusts the effective isotope radiation power associated with the specific access point based on the smaller of the first and second effective isotope radiation power values.

[0005] According to certain aspects of the present disclosure, a machine-readable storage medium is provided. The disclosed machine-readable storage medium has instructions that cause a processor to determine and adjust an effective isotope radiation power associated with a specific access point in a wireless network. The processor determines a weight for each neighboring access point in the radio frequency neighborhood of the specific access point. The weight is based at least on a basic service set color and a channel frequency of each neighboring access point. The processor also calculates a first path loss from the neighboring access point based on the determined weight of each neighboring access point, and also calculates a second path loss based on the neighboring access point. The processor also calculates first and second effective isotope radiation power values ​​based on the calculated first and second path losses. The processor also adjusts the effective isotope radiation power associated with the specific access point based on the smaller of the first and second effective isotope radiation power values.

[0006] It should be understood that other configurations of the subject technology will be readily apparent to those skilled in the art from the following detailed description, wherein various configurations of the subject technology are illustrated and described by way of illustration. As will be appreciated, the subject technology can have other and different configurations, and its several details can be modified in various other aspects, all without departing from the scope of the subject technology. Therefore, the drawings and detailed description are considered to be illustrative rather than restrictive in nature. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] The accompanying drawings, which are included to provide a further understanding and are incorporated in and constitute a part of this specification, illustrate the disclosed embodiments and, together with the description, serve to explain the principles of the disclosed embodiments. In the drawings:

[0008] Figure 1 An example architecture for providing BSS color based EIRP assignment is shown.

[0009] Figure 2 is an illustration according to certain aspects of the present disclosure from Figure 1 A block diagram of an example client device, access point, and network device of an architecture.

[0010] Figure 3 Shown for use Figure 2 The example client / server provides an example procedure for BSS color-based EIRP assignment.

[0011] Figure 4A-4C is with Figure 3 An example of an example process associated with the example is shown.

[0012] Figure 5 is a block diagram illustrating an example computer system, wherein Figure 2 The client devices, access points, and network devices of the present invention may be implemented using the example computer system.

[0013] In one or more embodiments, all of the components depicted in each figure may not be required, and one or more embodiments may include additional components not shown in the figures. Changes in the arrangement and type of components may be made without departing from the scope of the present subject disclosure. Additional components, different components, or fewer components may be used within the scope of the present subject disclosure. DETAILED DESCRIPTION

[0014] The detailed description set forth below is intended as a description of various implementations, and is not intended to represent the only implementation scheme that can practice the subject technology. As will be appreciated by those skilled in the art, the described implementations can be modified in various different ways, all of which do not depart from the scope of the present disclosure. Therefore, the drawings and descriptions are considered to be illustrative and not restrictive in nature.

[0015] General Overview

[0016] The disclosed system provides for assigning EIRP in a wireless network (e.g., IEEE 802.11ax) when BSS color and channel assignments are already given or known. A wireless network includes a radio frequency (RF) neighborhood, where an RF neighborhood is a set of access points that can physically hear each other's neighboring messages above a specified noise floor (e.g., -95dBm). For any particular access point in the wireless network, neighboring access points may change channels and / or colors. The system calculates the EIRP to be assigned to a particular access point based on the probability of a neighboring access point having the same channel and color attributes as the particular access point.

[0017] Thus, the system can assign an EIRP to each access point in a wireless network or a specified subset of a wireless network. The system calculates and assigns EIRPs to achieve multiple optimization goals. One optimization goal is to achieve good spatial reuse with existing channel and color assignments to maintain network performance. In addition, if any event such as radar and / or noise detection is triggered at a particular access point, forcing the particular access point to change channels, another optimization goal is to ensure that neighboring access points are not affected by the change. In addition, since there is a mechanism in IEEE 802.11ax that can be used to change colors for access points without changing channels, access points can change their colors based on certain implementation-based events. Therefore, another optimization goal achieved by the system is to minimize the impact of network outages caused by access points changing colors. Another optimization goal of the system is to assign EIRPs to access points without affecting the roaming process.

[0018] The disclosed system provides improvements to computer network functionality by providing a centralized way to assign EIRPs to specific access points in a wireless network based on BSS color assignments. While there are basic methods that handle different aspects of assigning EIRPs to access nodes, there is no centralized solution based on BSS color assignments. Therefore, the disclosed system and method improve computer network functionality by using spatial reuse with existing channel and BSS color assignments to maintain each in network performance, assuming that if a specific access point is forced to change its channel, neighboring access points are not affected, minimizing the impact of disruption from the access point changing its BSS color, and not affecting the roaming process.

[0019] For example, in a typical computer network with hundreds or thousands of access points, it is apparent that monitoring and assigning EIRPs to each access point each time a network parameter changes is far beyond the capabilities of an individual or team to handle. Thus, the disclosed system provides a heretofore unknown centralized method for dynamically assigning EIRPs to access points as network parameters continually change (e.g., access points are added or removed, the channel and / or BSS color of any given access point changes due to network conditions), thereby greatly improving computer network functionality.

[0020] Example system architecture

[0021] Figure 1 An example architecture 100 for assigning EIRPs in a wireless network is shown. The architecture 100 includes a network device 130, an access point 120, and a client device 110 connected via a network 150.

[0022] At least one network device 130 is configured to host an EIRP assignment application that calculates and adjusts the EIRP of a particular access point 120 in a wireless network based on the channel and color attributes of neighboring access points 120. For load balancing purposes, multiple network devices 130 may host the EIRP assignment application. The network device 130 may be any device with an appropriate processor, memory, and communication capabilities for hosting the EIRP assignment application. For example, the network device 130 may be any device, including but not limited to an access point, a wireless controller, a network controller, a server, and any form of virtualized computing device.

[0023] The EIRP assignment application on the network device 130 determines, for a particular access point 120, a weight for each neighboring access point 120 based on the channel and color for the assigned access point 120. The EIRP assignment application on the network device 130 also calculates a plurality of effective EIRPs based on different path losses with the neighboring access points 120. Thus, the disclosed system may, for example, calculate an EIRP assigned to a particular access point 120. As a result, the EIRP of the particular access point 120 may be adjusted by the network device 130 120 in order to achieve one or more optimization goals.

[0024] The client devices 110 to which the network devices 130 and the access points 120 are connected via the network 150 may be, for example, desktop computers, mobile computers, tablet computers (e.g., including e-book readers), mobile devices (e.g., smart phones or PDAs), set-top boxes (e.g., for televisions), video game consoles, or any other device with appropriate processor, memory, and communication capabilities. In some aspects, one or more of the network devices 130 may be cloud computing servers of Infrastructure as a Service (IaaS), and may be capable of supporting Platform as a Service (PaaS) and Software as a Service (SaaS) services.

[0025] The network 150 may include, for example, any one or more of a personal area network (PAN), a local area network (LAN), a campus area network (CAN), a metropolitan area network (MAN), a wide area network (WAN), a broadband network (BBN), the Internet, etc. In addition, the network 150 may include, but is not limited to, any one or more of the following network topologies, including a bus network, a star network, a ring network, a mesh network, a star bus network, a tree or hierarchical network, etc.

[0026] Example EIRP Assignment System

[0027] Figure 2 is a diagram showing some aspects of the present disclosure Figure 1 1 is a block diagram of an example network device 130, access point 120, and client device 110 in architecture 100.

[0028] The client device 110, the access point 120, and the network device 130 are connected through the network 150 via corresponding communication modules 212, 214, and 216. The communication modules 212, 214, and 216 are configured to interface with the network 150 to send and receive information, such as data, requests, responses, and commands, to and from other devices on the network. The communication modules 212, 214, and 216 may be, for example, modems or Ethernet cards.

[0029] The network device 130 includes a processor 226, a communication module 216, and a memory 236 including an EIRP assignment application 246. As described above, the network device 130 can be any of an access point, a wireless controller, a network controller, and a server. The processor 226 of the network device 130 is configured to execute instructions, such as instructions physically encoded into the processor 226, instructions received from software in the memory 236, or a combination of both. For example, the processor 226 of the network device 130 executes instructions from the EIRP assignment application 246 to determine, for a particular access point 120, a weight for each of a plurality of neighboring access points 120 in a radio frequency (RF) neighborhood based on a color and a channel assigned to each access point 120, calculate a first path loss based on the weight of each neighboring access point 120, calculate a second path loss from all neighboring access points 120, calculate a first EIRP based on the first path loss, calculate a second EIRP based on the second path loss, and adjust the EIRP associated with the particular access point 120 based on one of the first and second EIRPs.

[0030] The memory 236 of the network device 130 may store network attributes (e.g., BSS color, channel, EIRP) of access points 120 in an RF neighborhood, RF group, or the entire wireless network. The memory 236 also stores instructions for performing the following process: determining and assigning EIRPs to access points 120 in a wireless network based on BSS color assignments.

[0031] The memory 236 also stores weights associated with the access points 120. For example, the memory 236 may store six weights based on different access point parameters. The first weight is based on neighboring access points 120 having the same assigned channel and the same assigned basic service set color as the particular access point 120. The second weight is based on neighboring access points 120 having the same assigned channel and a different assigned basic service set color as the particular access point 120. The second weight is proportional to the sensitivity of the effective isotope radiated power to changes in the basic service set color with respect to the multiple basic service set colors available to the neighboring access points 120.

[0032] The third weight is based on neighboring access points having different assigned channels and the same assigned basic service set color as the particular access point 120. The third weight is proportional to the sensitivity of the effective isotope radiated power to channel variations with respect to the number of channels available to the neighboring access point 120. In the event that the access point 120 includes a DFS channel, the priority third weight is proportional to the sensitivity of the effective isotope radiated power to DFS channel variations with respect to the number of non-DFS channels available to the neighboring access point.

[0033] The fourth weight is based on neighboring access points 120 having different assigned channels and different assigned basic service set colors for a particular access point 120. The fourth weight is equal to the second weight multiplied by the third weight. In the case where the access point 120 includes a DFS channel, the fourth priority weight is equal to the second weight multiplied by the third priority weight. Therefore, the determined weights (e.g., the first weight, the second weight, the third weight, the third priority weight, the fourth weight, the fourth priority weight) are mapped to each neighboring access point 120, and the weight map is stored in the memory 236. The processor 226 uses the stored weights to calculate the path loss and EIRP values.

[0034] The memory 236 stores the path loss and EIRP values ​​calculated by the processor 226. The first path loss is based on a plurality of first neighboring access points 120, the first path loss being equal to the sum of the weights assigned to each of the first neighboring access points and the path loss from the corresponding first neighboring access point 120 to the specific access point 120, divided by the sum of the weights assigned to each of the first neighboring access points 120. For example, the first neighboring access point 120 may be an access point 120 that most affects the specific access point 120 or is most affected by the specific access point 120 based on the weight. However, a group of first access points 120 may be determined by any desired process, such as selecting a subset or the entire group of access points 120 sorted by any metric, including but not limited to path loss values. Based on the first path loss, the first EIRP is equal to the first path loss plus the signal-to-noise ratio minus the noise floor value. The noise floor value may be any desired value, such as -95 dBm. The second path loss is based on a plurality of second neighboring access points 120, the second path loss being equal to the sum of the path losses from each second neighboring access point 120 to the particular access point 120 divided by the number of second neighboring access points 120. For example, the second neighboring access point 120 may be any access point 120 in the RF neighborhood. However, a set of second access points 120 may be determined by any desired process, such as selecting a subset or the entire set of access points 120 ordered by any metric, including but not limited to residing within the RF neighborhood. The second EIRP is equal to the second path loss plus the signal-to-noise ratio minus the noise floor value.

[0035] The processor 226 also determines the smaller value between the calculated first and second EIRPs and assigns the smaller EIRP value to the particular access point 120, which is also stored in the memory 236. The processor 226 may repeat the above process for each of the remaining access points 120 in the RF neighborhood so that each access point 120 in the RF neighborhood has an assigned EIRP based on the BSS color. The processor 226 may perform the above process as an initial access point configuration and / or as an improved access point configuration based on changing access point or wireless network conditions.

[0036] The client device 110 includes a processor 222, a communication module 212, and a memory 220 including client data and applications 242. The access point 120 includes a processor 224, a communication module 214, and a memory 234 including a configuration database 244. For example, the configuration database 244 may include configuration properties for the access point 120, such as BSS color assignments, channel assignments, and EIRP assignments. An access point is a network device that allows Wi-Fi devices to connect to a network. An access point can be connected to a router as a standalone device, or the access point can be an integral part of a router.

[0037] The techniques described herein may be implemented as a method performed by a physical computing device; as one or more non-transitory computer-readable storage media storing instructions that, when executed by a computing device, result in the performance of the method; or, as a physical computing device specifically configured with a combination of hardware and software that results in the performance of the method.

[0038] Figure 3 Shown for use Figure 2 Example access point 120 and network device 130 assign EIRP to access point in wireless network. Figure 2 describe Figure 3 , which should be executable by other systems Figure 3 The processing steps.

[0039] Process 300 begins at step 302 by determining a weight for each neighboring access point within the RF neighborhood of a particular access point. The weight of an access point is determined based on the BSS color and channel frequency assigned to the access point. For example, if there are eight other access points in the RF neighborhood for a particular access point, a weight is determined for each of the eight neighboring access points.

[0040] Process 300 continues in step 304 by calculating a first path loss from a plurality of selected neighboring access points based on a weight of each selected neighboring access point in the plurality of neighboring access points. Calculating a second path loss from the plurality of neighboring access points occurs in step 306. Continuing in step 308, a first EIRP is calculated based on the first path loss, and in step 310, a second EIRP is calculated based on the second path loss. Process 300 ends in step 312 by adjusting the EIRP associated with the particular access point based on the lower value between the first EIRP and the second EIRP.

[0041] Figure 3 Describes the use of Figure 2 Example access point 120 and network device 130 of the exemplary process 300 of assigning EIRP to access points in a wireless network. Figure 3The example process 300 is used to describe the example, as shown in FIG. Figure 4A-4C shown.

[0042] Figure 4A-4C A network of nine access points labeled AP1 to AP9 is shown. Each access point has an assigned channel and an assigned BSS color, which is represented as channel / color. Figure 4A , AP1 has an assigned channel 36 and an assigned color 1 (eg, 36 / 1). In this example, the EIRP will be assigned to access point AP1, but the same method can also be used to assign EIRPs to any other access points AP2-AP9.

[0043] like Figure 4B As shown, the dashed curve shows the range where access point AP1 has the greatest impact relative to spatial reuse based on the assigned channel and BSS color. In other words, the correct BSS color at access point AP1 can be used to mitigate Wi-Fi interference in the area. In addition, other access points in the area can also mitigate Wi-Fi interference of access point AP1 by using the correct BSS color. Here, the exemplary process 300 begins with the assumption that the right channel and right BSS color have been assigned to each access point AP1-AP9 via any known method.

[0044] To calculate the EIRP for access point AP1, path loss is used as a proxy for distance, assuming that path loss is a very consistent metric in a given frequency band. Thus, example process 300 determines a representative path loss from access point AP1, which is represented by Figure 4B The dashed curve marks the area of ​​greatest influence of the neighboring access points within the area. This is achieved by assigning different weights to the neighboring access points AP2-AP9. The weight assigned to a neighboring access point is determined by the probability that the neighboring access point has the same channel and BSS color as access point AP1.

[0045] The marking weights are such that W1 indicates that the associated access point has the same channel and the same BSS color as access point AP1, W2 indicates that the associated access point has the same channel and a different BSS color as access point AP1, W3 indicates that the associated access point has a different channel and the same BSS color as access point AP1, and W4 indicates that the associated access point has a different channel and a different BSS color than access point AP1.

[0046] The value of weight W1 is the maximum weight, because it is least desirable to have two access points with the same channel and BSS color coexist as much as possible, so W1 is assigned to 1 (e.g., W1=1). For weight W2, assuming that the number of BSS colors available to the neighboring access point is n, the associated access point has W2∝1 / n. Therefore, in general, it can be derived that W2=β / n, where β=the sensitivity of EIRP to BSS color changes, which can be user-defined.

[0047] For weight W3, assuming the number of channels available to neighboring access points is m, the associated access point has W3∝1 / m. Similarly, in the general case, it can be concluded that W3=γ / n, where γ=the sensitivity of EIRP to channel changes, which can be user-defined. For access points operating on DFS channels, the access point has a much higher probability of encountering an event that may force it to change channels. Within all access points falling within weight W3, the process prioritizes access points operating on DFS channels by increasing the priority to W3′∝1 / m′, where m′ is the number of non-DFS channels available to the access point, so m′≤m. In the general case, it can be concluded that W3′=γ′ / n′, where γ′=the sensitivity of EIRP to DFS channel changes, which can be user-defined. Common sense and field experience dictate that γ′>γ.

[0048] For weight W4, assuming that the number of channels available to neighboring access points and the number of BSS colors are m and n respectively, then W4∝1 / (mxn). In the general case, it can be concluded that W4=(βxγ) / (mxn), where β and γ are defined as above. When simplified, it can be concluded that W4=W2x W3. For access points operating on DFS channels, the access point has a much higher probability of encountering events that may force it to change channels. Among all access points falling within weight W4, the process prioritizes access points operating on DFS channels by increasing the priority to W4′∝1 / (m′xn), where m′ is the number of non-DFS channels available to the access point, so m′≤m. When simplified, it can be concluded that W4′=W2x W3′.

[0049] There is a special case where spatial reuse is disabled at the access point. If spatial reuse is disabled, the process only considers one color to be available for all access points (e.g., n=1). In this case, W1=1, W2=1, W3=γ / m, W3′∝1 / m′, W4=1x W3, and W4′=1x W3′.

[0050] like Figure 4CAs shown, weights have been assigned to eight neighboring access points AP2-AP9. Based on the weights assigned to neighboring access points within the range of influence (e.g., weights for neighboring access points AP3 and AP5-AP9), exemplary process 300 now calculates the path loss (Pc) for the coloring that access point AP1 has the most influence and is most affected with respect to channel and BSS color. Here, Pc roughly represents the "center of gravity" or "center of greatest influence." Therefore,

[0051]

[0052] Where n is the number of the first n neighboring access points of access point AP1, Pc is the colored path loss in dB, and W i is the weight assigned to access point AP1 from {W1, W2, W3, W3′, W4, W4′}, and P i From the access point AP i The path loss to access point AP1 is in dB. For example, the first n neighboring access points can be selected as Figure 4C All neighboring access points AP3 and AP5-AP9 within the impact range are shown.

[0053] The process also calculates the colorless path loss (P). This value is used to ensure that STAs associated with access point AP1 can roam normally and is calculated as follows:

[0054]

[0055] Where n is the number of the second n neighboring access points of access point AP1, and Pi is the number of the n neighboring access points from access point AP1. i The path loss to access point AP1 is in dB. For example, the second n neighboring access points can be selected as Figure 4C All neighboring access points AP2-AP9 of access point AP1 are shown in .

[0056] Next, two EIRP values ​​are calculated. The first EIRP is calculated by Pc and is called the colored EIRP (EIRP c ). The second EIRP is calculated from P and is called the path loss P(EIRP p )’s EIRP.

[0057] Calculating EIRP c and assigns it to access point AP1 to ensure that P c The location of the point giving a signal-to-noise ratio (SNR) of S dBm is configurable and takes into account a reasonable negative 95 dBm noise floor as follows:

[0058] EIRPc (in dBm) = Pc +S-95.

[0059] Similarly, EIRP p The calculation is as follows:

[0060] EIRP p (in dBm) = P + S - 95.

[0061] This example is based on a noise floor value of negative 95 dBm, but in other cases the noise floor value may be different, wherein any suitable noise floor value may be selected.

[0062] The example process 300 then compares the EIRP c and EIRP p , and choose the smaller of the two, so as to choose the larger one with less impact on performance or roaming.

[0063] Hardware Overview

[0064] Figure 5 is a block diagram illustrating an example computer system 500 that can Figure 2 The client device 110, access point 120 and network device 130. In some aspects, the computer system 500 can be implemented using hardware or a combination of software and hardware, either in a dedicated server or integrated into another entity or distributed across multiple entities.

[0065] The computer system 500 (e.g., client device 110, access point 120, or network device 130) includes a bus 508 or other communication mechanism for transmitting information, and a processor 502 (e.g., processors 222, 224, and 226) coupled to the bus 508 for processing information. According to one aspect, the computer system 500 is implemented as one or more special-purpose computing devices. The special-purpose computing device can be hard-wired to perform the disclosed technology, or can include digital electronic devices, such as one or more application-specific integrated circuits (ASICs) or field-programmable gate arrays (FPGAs) that are permanently programmed to perform the technology, or can include one or more general-purpose hardware processors that are programmed to perform the technology according to program instructions in firmware, memory, other storage devices, or a combination. Such a special-purpose computing device can also combine customized hard-wired logic, ASICs, or FPGAs with customized programming to implement these technologies. The special-purpose computing device can be a desktop computer system, a portable computer system, a handheld device, a network device, or any other device that contains hard-wired and / or program logic to implement these technologies. For example, the computer system 500 can be implemented with one or more processors 502. Processor 502 may be a general purpose microprocessor, microcontroller, digital signal processor (DSP), ASIC, FPGA, programmable logic device (PLD), controller, state machine, gated logic, discrete hardware components, or any other suitable entity that can perform computations or other manipulations of information.

[0066] In addition to hardware, the computer system 500 may also include code that creates an execution environment for the computer program in question, such as code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of the codes stored in the included memory 504 (e.g., memory 232, 234, and 236), such as random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory (PROM), erasable PROM (EPROM), registers, hard disk, removable disk, CD-ROM, DVD, or any other suitable storage device, which is coupled to the bus 508 for storing information and instructions to be executed by the processor 502. The processor 502 and the memory 504 may be supplemented by or incorporated into a dedicated logic circuit. Expansion memory may also be provided and connected to the computer system 500 through an input / output module 510, which may include, for example, a SIMM (single in-line memory module) card interface. Such expansion memory may provide additional storage space for the computer system 500, or may also store applications or other information for the computer system 500. Specifically, the expansion memory may include instructions for executing or supplementing the above-described processes, and may also include security information. Thus, for example, the expansion memory may be provided as a security module for the computer system 500, and may be programmed with instructions that allow secure use of the computer system 500. In addition, security applications and additional information may be provided via a SIMM card, such as placing identification information on a SIMM card in a non-hackable manner.

[0067] Instructions may be stored in memory 504 and implemented in one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium for execution or control of operation by computer system 500 and in accordance with any method known to those skilled in the art, including but not limited to computer languages ​​such as data-oriented languages ​​(e.g., SQL, dBase), system languages ​​(e.g., C, Objective-C, assembly), framework languages ​​(e.g., Java, .NET), and application languages ​​(e.g., PHP, Ruby, Perl, Python). The instructions may also be implemented in a computer language, such as an array language, an aspect-oriented language, an assembly language, an authoring language, a command line interface language, a compiled language, a concurrent language, a brace language, a data flow language, a data structure language, a declarative language, an esoteric language, an extended language, a fourth generation language, a functional language, an interactive mode language, an interpreted language, an iterative language, a list-based language, a small language, a logic-based language, a machine language, a macro language, a metaprogramming language, a multi-paradigm language, a numerical analysis, a non-English-based language, an object-oriented class-based language, an object-oriented prototype-based language, a rule-deviating language, a procedural language, a reflective language, a rule-based language, a scripting language, a stack-based language, a synchronous language, a syntax processing language, a visual language, a wirth language, an embeddable language, and an xml-based language. The memory 504 may also be used to store temporary variables or other intermediate information during the execution of instructions to be executed by the processor 502.

[0068] The computer programs discussed here do not necessarily correspond to files in a file system. A program may be stored in a portion of a file that stores other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions). A computer program may be deployed to execute on a computer or on multiple computers located on a site or distributed on multiple sites and interconnected by a communication network. The processes and logic flows described in this specification may be performed by one or more programmable processors that execute one or more computer programs to perform functions by operating on input data and generating outputs.

[0069] The computer system 500 also includes a data storage device 506, such as a disk or optical disk, which is coupled to the bus 508 for storing information and instructions. The computer system 500 can be coupled to various devices via an input / output module 510. The input / output module 510 can be any input / output module. The example input / output module 510 includes a data port such as a USB port. In addition, the input / output module 510 can be provided with communication with the processor 502 to implement near-field communication between the computer system 500 and other devices. The input / output module 510 can provide, for example, wired communication in some implementations, or wireless communication in other implementations, and multiple interfaces can also be used. The input / output module 510 is configured to be connected to a communication module 512. The example communication module 512 (e.g., communication modules 212, 214, and 216) includes a network interface card, such as an Ethernet card and a modem.

[0070] The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). The communication network (e.g., network 150) may include, for example, any one or more of a PAN, a LAN, a CAN, a MAN, a WAN, a BBN, the Internet, etc. In addition, the communication network may include, but is not limited to, for example, any one or more of the following network topologies, including a bus network, a star network, a ring network, a mesh network, a star bus network, a tree or hierarchical network, etc.

[0071] For example, in some aspects, the communication module 512 can provide a two-way data communication coupled to a network link connected to a local network. Wireless links and wireless communications can also be implemented. Wireless communications can be provided under various modes or protocols, such as GSM (Global System for Mobile Communications), Short Message Service (SMS), Enhanced Message Service (EMS) or Multimedia Message Service (MMS) message transmission, CDMA (Code Division Multiple Access), Time Division Multiple Access (TDMA), Personal Digital Cellular (PDC), Broadband CDMA, General Packet Radio Service (GPRS) or LTE (Long Term Evolution), etc. This communication can occur, for example, through a radio frequency transceiver. In addition, short-range communication may occur, such as using Bluetooth, WI-FI or other such transceivers.

[0072] In any such implementation, the communication module 512 sends and receives electrical, electromagnetic or optical signals carrying digital data streams representing various types of information. Network links typically provide data communications to other data devices through one or more networks. For example, the network link of the communication module 512 can provide a connection to a host computer or a data device operated by an Internet Service Provider (ISP) through a local network. The ISP then provides data communication services through a global packet data communication network commonly referred to as the Internet. Both the local network and the Internet use electrical, electromagnetic or optical signals carrying digital data streams. The signals through various networks and the network links and through the communication module 512 are example forms of transmission media, and the signals carry digital data to and from the computer system 500.

[0073] Computer system 500 may send messages and receive data, including program code, through the network, network links, and communications module 512. In a process example, network device 130 may send code to adjust the assigned EIRP through the network, Internet, ISP, local network, and communications module 512. The received code may be executed by processor 502 as it is received and / or stored in data storage 506 for later execution.

[0074] In some aspects, the input / output module 510 is configured to connect to multiple devices, such as input devices 514 and / or output devices 516. Example input devices 514 include styluses, fingers, keyboards, and pointing devices, such as mice or trackballs, through which a user can provide input to the computer system 500. Other types of input devices 514 can also be used to provide interaction with the user, such as tactile input devices, visual input devices, audio input devices, or brain-computer interface devices. For example, the feedback provided to the user can be any form of sensory feedback, such as visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, voice, tactile, or brainwave input. Example output devices 516 include display devices, such as LED (light emitting diodes), CRT (cathode ray tubes), LCD (liquid crystal display) screens, TFT LCD (thin film transistor liquid crystal display) or OLED (organic light emitting diode) displays, for displaying information to the user. The output device 516 can include appropriate circuitry for driving the output device 516 to present graphics and other information to the user.

[0075] According to one aspect of the present disclosure, in response to the processor 502 executing one or more sequences of one or more instructions contained in the memory 504, the computer system 500 can be used to implement the client device 110, the access point 120, and the network device 130. These instructions can be read into the memory 504 from another machine-readable medium (e.g., a data storage device 506). Executing the sequence of instructions contained in the main memory 504 causes the processor 502 to perform the processing steps described herein. One or more processors in a multi-processing arrangement can also be used to execute the sequence of instructions contained in the memory 504. In alternative aspects, hard-wired circuits can be used instead of software instructions or in combination with software instructions to implement various aspects of the present disclosure. Therefore, aspects of the present disclosure are not limited to any specific combination of hardware circuitry and software.

[0076] Various aspects of the subject matter described in this specification can be implemented in a computing system that includes a back-end component (e.g., a data server) or includes a middleware component (e.g., an application server) or includes a middleware component (e.g., an application server), or includes a front-end component (e.g., a client computer with a graphical user interface or a web browser through which a user can interact with an implementation of the subject matter described in this specification), or includes any combination of one or more such back-end, middleware, or front-end components.

[0077] Computing system 500 may include a client and a server. The client and the server are usually far away from each other and usually interact through a communication network. The relationship between the client and the server is generated by means of a computer program that runs on each computer and has a client-server relationship with each other. Computer system 500 can be, for example but not limited to, a desktop computer, a laptop computer or a tablet computer. Computer system 500 can also be embedded in another device, for example but not limited to a mobile phone, a personal digital assistant (PDA), a mobile audio player, a global positioning system (GPS) receiver, a video game console and / or a TV set-top box.

[0078] The term "machine-readable storage medium" or "computer-readable medium" as used herein refers to any medium or media that participates in providing instructions or data to processor 502 for execution. The term "storage medium" as used herein refers to any non-transitory medium that stores data and / or instructions that cause a machine to operate in a specific manner. Such media can take many forms, including but not limited to non-volatile media, volatile media, and transmission media. Non-volatile media include, for example, optical disks, magnetic disks, or flash memory, such as data storage device 506. Volatile media include dynamic memory, such as memory 504. Transmission media include coaxial cables, copper wires, and optical fibers, including the wires of bus 508. Common forms of machine-readable media include, for example, floppy disks, disks, hard disks, magnetic tape, any other magnetic media, CD-ROMs, DVDs, any other optical media, punch cards, paper tape, any other physical medium with a pattern of holes, RAM, PROMs, EPROMs, flash EPROMs, any other memory chips or cassettes, or any other medium that a computer can read. The machine-readable storage medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them.

[0079] As used in this specification of the present application, the terms "computer-readable storage medium" and "computer-readable medium" are entirely limited to tangible, physical objects that store information in a computer-readable form. These terms do not include any wireless signals, wired download signals, and any other transient signals. Storage media are different from but can be used in conjunction with transmission media. Transmission media participate in the transmission of information between storage media. For example, transmission media include coaxial cables, copper wires, and optical fibers, including wires that comprise bus 508. Transmission media can also take the form of sound waves or light waves, such as those generated during radio wave and infrared data communications. In addition, as used in this specification of the present application, the terms "computer", "server", "processor", and "memory" all refer to electronic or other technical devices. These terms do not include people or groups of people. For the purposes of the specification, the term display or display unit is displayed on an electronic device.

[0080] In one aspect, a method may be an operation, an instruction, or a function, and vice versa. In one aspect, a clause or claim may be modified to include some or all of the words (e.g., instructions, operations, functions, or components) recited in one or more clauses, one or more words, one or more sentences, one or more phrases, one or more paragraphs, and / or one or more claims.

[0081] To illustrate the interchangeability of hardware and software, items such as various illustrative blocks, modules, components, methods, operations, instructions, and algorithms have been described generally in terms of functionality. Whether this functionality is implemented as hardware, software, or a combination of hardware and software depends on the specific application and design constraints imposed on the overall system. A skilled person may implement the described functionality in varying ways for each specific application.

[0082] As used herein, the phrase "at least one of" preceding a series of items, with the terms "and" or "or" separating any items, modifies the list as a whole, rather than modifying each member of the list (i.e., each item). The phrase "at least one of" does not require selection of at least one item; rather, the phrase allows for a meaning that includes any one of at least one of the items, and / or at least one of any combination of the items, and / or at least one of each of the items. For example, the phrase "at least one of A, B, and C" or "at least one of A, B, or C" each refers to only A, only B, or only C; any combination of A, B, and C; and / or at least one of each of A, B, and C.

[0083] To the extent that the terms "including", "having", etc. are used in the specification or claims, the terms are intended to be included in a manner similar to the term "comprising", which is interpretative when used as a conventional word in the claims. Phrases such as aspect, the aspect, another aspect, some aspects, one or more aspects, implementation, the implementation, another implementation, some implementations, one or more implementations, embodiment, the embodiment, another embodiment, some embodiments, one or more embodiments, configuration, the configuration, another configuration, some configurations, one or more configurations, subject technology, the disclosure, the present disclosure, other variations, etc. are for convenience and do not imply that the disclosure associated with such phrases is essential to the subject technology or that such disclosure applies to all configurations of the subject technology. The disclosure associated with such phrases may apply to all configurations or one or more configurations. The disclosure associated with such phrases may provide one or more examples. Phrases such as aspect or some aspects may refer to one or more aspects and vice versa, and this applies similarly to the other aforementioned phrases.

[0084] Unless otherwise specified, references to singular elements are not intended to mean "one and only one", but "one or more". The term "some" means one or more. Underlined and / or italicized headings and subheadings are for convenience only, do not limit the subject technology, and do not refer to the interpretation of the description of the subject technology. Relational terms such as first and second can be used to distinguish one entity or action from another entity or action, without necessarily requiring or implying any actual such relationship or order between these entities or actions. All structural and functional equivalents of the elements of the various configurations described in this disclosure are known or will be known to those of ordinary skill in the art, which are expressly incorporated herein by reference and are intended to be covered by the subject technology. In addition, whether such disclosure is explicitly stated in the above description, the content disclosed herein is not intended to be committed to the public. According to 35 U.S.C. § 112, the sixth paragraph, no claim element shall be interpreted unless the phrase "unit for..." is used or the element is explicitly stated in the case of a method claim, and the phrase "step for..." is used to state the element.

[0085] Although this specification contains many details, these details should not be interpreted as limitations on the scope of the claims, but rather as descriptions of specific implementations of the subject matter. Certain features described in this specification in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented in multiple embodiments individually or in any suitable sub-combination. In addition, although the above features may be described as working in certain combinations and even initially stated as such, one or more features from the claimed combination may be cut out of the combination in some cases, and the claimed combination may be directed to a sub-combination or a variation of the sub-combination.

[0086] The subject matter of this specification has been described in terms of specific aspects, but other aspects may be implemented and are within the scope of the appended claims. For example, although operations are depicted in a particular order in the drawings, this should not be understood as requiring that the operations be performed in the particular order shown or in sequence, or that all the operations shown be performed, to achieve the desired results. The actions recorded in the claims can be performed in different orders and still achieve the desired results. As an example, the processes depicted in the drawings do not necessarily require the particular order shown or the sequential order to achieve the desired results. In some cases, multitasking and parallel processing may be advantageous. In addition, the separation of various system components in the above aspects should not be understood as requiring such separation in all aspects, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

[0087] The titles, background, brief description, abstract, and drawings of the drawings are incorporated herein into the present disclosure and are provided as illustrative examples of the present disclosure rather than as limiting descriptions. It is submitted with the understanding that they will not be used to limit the scope or meaning of the claims. In addition, in the detailed description, it can be seen that the description provides illustrative examples and that various features are combined together in various implementations in order to simplify the present disclosure. The method of the present disclosure should not be interpreted as reflecting the intention that the claimed subject matter requires more features than those expressly recited in each claim. Rather, as reflected in the claims, the inventive subject matter lies in less than all the features of a single disclosed configuration or operation. The claims are incorporated herein into the detailed description, with each claim itself as a separately claimed subject matter.

[0088] The claims are not intended to be limited to the aspects described herein, but are to be accorded the full scope consistent with the language of the claims and including all legal equivalents. Nevertheless, no claim is intended to encompass subject matter that does not satisfy applicable patent law requirements, nor should it be interpreted in such a manner.

Claims

1. A method comprising: Determining, by a network device, a weight for each of the plurality of neighboring access points in a radio frequency neighborhood of a particular access point based at least on a basic service set color and a channel frequency of the plurality of neighboring access points in the radio frequency neighborhood of the particular access point; calculating, by the network device, a first path loss from the plurality of neighboring access points based on weights of one or more neighboring access points among the plurality of neighboring access points, wherein the first path loss is based on a plurality of first neighboring access points, and the first path loss is equal to a sum of a product of a weight assigned to each of the first neighboring access points and a path loss from the corresponding first neighboring access point to the specific access point divided by a sum of the weights assigned to each of the first neighboring access points; Calculating, by the network device, a second path loss from the plurality of neighboring access points, wherein the second path loss is based on a plurality of second neighboring access points, and the second path loss is equal to a sum of path losses from each second neighboring access point to the specific access point divided by the number of the second neighboring access points; Calculating, by the network device, a first effective isotope radiation power based on the first path loss; calculating, by the network device, a second effective isotope radiation power based on the second path loss; and The effective isotope radiation power associated with the particular access point is adjusted, by the network device, based on a lower value between the first effective isotope radiation power and the second effective isotope radiation power.

2. The method of claim 1, wherein: The weight is one of a first weight, a second weight, a third weight, a third priority weight, a fourth weight, and a fourth priority weight, wherein the first weight is based on neighboring access points, the neighboring access points having the same assigned channel and the same assigned basic service set color as the specific access point, wherein the second weight is based on neighboring access points, the neighboring access points having the same assigned channel and a different assigned basic service set color as the specific access point, wherein the third weight is based on neighboring access points, the neighboring access points having a different assigned channel and the same assigned basic service set color as the specific access point, wherein the third priority weight is based on the non-D The number of FS channels is proportional to the sensitivity of the effective isotope radiation power to changes in DFS channels, wherein the fourth weight is based on neighboring access points, the neighboring access points having different assigned channels and different assigned basic service set colors than the specific access point, and wherein the fourth priority weight is equal to the second weight multiplied by the third priority weight, the second weight is proportional to the sensitivity of the effective isotope radiation power to changes in the basic service set color with respect to the number of basic service set colors available to the neighboring access points, and the third priority weight is proportional to the sensitivity of the effective isotope radiation power to changes in the DFS channels with respect to the number of non-DFS channels available to the neighboring access points.

3. The method of claim 2, wherein: The second weight is proportional to a sensitivity of the effective isotope radiation power to a change in the basic service set color with respect to a plurality of basic service set colors available to the neighboring access point.

4. The method of claim 2, wherein: The third weight is proportional to a sensitivity of the effective isotope radiation power to channel variations with respect to a plurality of channels available to the neighboring access point.

5. The method of claim 2, wherein: The fourth weight is equal to the second weight multiplied by the third weight, the second weight being proportional to the sensitivity of the effective isotope radiation power to changes in the basic service set colors with respect to the multiple basic service set colors available to the neighboring access point, and the third weight being proportional to the sensitivity of the effective isotope radiation power to changes in the channels with respect to the number of channels available to the neighboring access point.

6. The method of claim 1, wherein: The first effective isotope radiation power is equal to the first path loss plus the signal-to-noise ratio minus the noise floor value.

7. The method of claim 1, wherein: The second effective isotope radiation power is equal to the second path loss plus the signal-to-noise ratio minus the noise floor value.

8. A system comprising: Memory; as well as A processor configured to execute instructions which, when executed, cause the processor to: determining one of a first weight, a second weight, a third weight, a third priority weight, a fourth weight, and a fourth priority weight for each of a plurality of neighboring access points in a radio frequency neighborhood of a particular access point based at least on a basic service set color and a channel frequency of each neighboring access point, wherein the first weight is based on a neighboring access point having a same assigned channel and a same assigned basic service set color as the particular access point, wherein the second weight is based on a neighboring access point having a same assigned channel and a different assigned basic service set color as the particular access point, wherein the third weight is based on a neighboring access point having a different assigned channel and the same assigned basic service set color as the particular access point , wherein the third priority weight is proportional to the sensitivity of the effective isotope radiated power to changes in the DFS channels with respect to the number of non-DFS channels available to the neighboring access point, wherein the fourth weight is based on neighboring access points having different assigned channels and different assigned basic service set colors than the particular access point, and wherein the fourth priority weight is equal to the second weight multiplied by the third priority weight, the second weight is proportional to the sensitivity of the effective isotope radiated power to changes in the basic service set color with respect to the number of basic service set colors available to the neighboring access point, and the third priority weight is proportional to the sensitivity of the effective isotope radiated power to changes in the DFS channels with respect to the number of non-DFS channels available to the neighboring access point; calculating a first path loss from the plurality of neighboring access points based on the weights of one or more neighboring access points, wherein the first path loss is based on a plurality of first neighboring access points, the first path loss being equal to a sum of a weight assigned to each of the first neighboring access points multiplied by a path loss from a corresponding first neighboring access point to the particular access point divided by a sum of the weights assigned to each of the first neighboring access points; Calculating a second path loss from the plurality of neighboring access points, wherein the second path loss is based on a plurality of second neighboring access points, and the second path loss is equal to a sum of path losses from each second neighboring access point to the specific access point divided by the number of the second neighboring access points; Calculate a first effective isotope radiation power based on the first path loss; calculating a second effective isotope radiation power based on the second path loss; and Based on the smaller of the first effective isotope radiation power and the second effective isotope radiation power, an effective isotope radiation power associated with the particular access point is adjusted.

9. The system of claim 8, wherein: The first effective isotope radiation power is equal to the first path loss plus the signal-to-noise ratio minus the noise floor value, and wherein the second effective isotope radiation power is equal to the second path loss plus the signal-to-noise ratio minus the noise floor value.

10. A non-transitory machine-readable storage medium comprising machine-readable instructions for causing a processor to perform a method comprising: Determining, by a network device, a weight for each of the plurality of neighboring access points in a radio frequency neighborhood of the particular access point based at least on a basic service set color and a channel frequency of the plurality of neighboring access points in a radio frequency neighborhood of the particular access point; calculating, by the network device, a first path loss from the plurality of neighboring access points based on weights of one or more neighboring access points among the plurality of neighboring access points, wherein the first path loss is based on a plurality of first neighboring access points, and the first path loss is equal to a sum of a product of a weight assigned to each of the first neighboring access points and a path loss from the corresponding first neighboring access point to the specific access point divided by a sum of the weights assigned to each of the first neighboring access points; Calculating, by the network device, a second path loss from the plurality of neighboring access points, wherein the second path loss is based on a plurality of second neighboring access points, and the second path loss is equal to a sum of path losses from each second neighboring access point to the specific access point divided by the number of the second neighboring access points; Calculating, by the network device, a first effective isotope radiation power based on the first path loss; calculating, by the network device, a second effective isotope radiation power based on the second path loss; and The effective isotope radiation power associated with the particular access point is adjusted, by the network device, based on a lower value between the first effective isotope radiation power and the second effective isotope radiation power.

11. The non-transitory machine-readable storage medium of claim 10, wherein: The first effective isotope radiation power is equal to the first path loss plus the signal-to-noise ratio minus the noise floor value, and wherein the second effective isotope radiation power is equal to the second path loss plus the signal-to-noise ratio minus the noise floor value.

Images