CN107071912B - Method and device for distributing channels in wireless local area network - Google Patents

Method and device for distributing channels in wireless local area network Download PDF

Info

Publication number
CN107071912B
CN107071912B CN201710247882.5A CN201710247882A CN107071912B CN 107071912 B CN107071912 B CN 107071912B CN 201710247882 A CN201710247882 A CN 201710247882A CN 107071912 B CN107071912 B CN 107071912B
Authority
CN
China
Prior art keywords
neighbor
aps
channel
list
access terminal
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
CN201710247882.5A
Other languages
Chinese (zh)
Other versions
CN107071912A (en
Inventor
陈澄宇
宋敏
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.)
Beijing Star Net Ruijie Networks Co Ltd
Original Assignee
Beijing Star Net Ruijie Networks Co Ltd
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 Beijing Star Net Ruijie Networks Co Ltd filed Critical Beijing Star Net Ruijie Networks Co Ltd
Priority to CN201710247882.5A priority Critical patent/CN107071912B/en
Publication of CN107071912A publication Critical patent/CN107071912A/en
Application granted granted Critical
Publication of CN107071912B publication Critical patent/CN107071912B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H04B17/318—Received signal strength
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H04B17/345—Interference values
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/04—Traffic adaptive resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/12—Fixed resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/06—Testing, supervising or monitoring using simulated traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/14—WLL [Wireless Local Loop]; RLL [Radio Local Loop]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides a method for allocating channels in a wireless local area network, which is applied to the wireless local area network comprising a first AP set consisting of at least two APs and comprises the following steps: determining neighbor AP lists corresponding to the APs in the set respectively, acquiring the optimal value of co-frequency interference between the APs in the set and the neighbor APs in the neighbor AP lists, and the channel value of each AP corresponding to the optimal value, and taking the channel value as the working channel value of each AP. Meanwhile, the embodiment of the invention also provides a device for distributing the channels in the wireless local area network. The method has the advantages that the channel can be rapidly planned, the channels among the APs can be automatically and effectively staggered, the same frequency interference of the network is reduced as much as possible, the additional expense of the network is reduced, and the network performance is improved.

Description

Method and device for distributing channels in wireless local area network
Technical Field
The present invention relates to the field of data communication, and in particular, to a method and apparatus for allocating channels in a wireless local area network.
Background
In recent years, Wireless Local Area Networks (WLANs) based on IEEE802.11 protocols have been rapidly developed with their outstanding advantages and mature technologies, and are widely used for Network construction in markets, enterprises, hospitals, schools, and meeting places.
The IEEE802.11 protocol specifies that the WLAN uses two frequency bands of 2.4GHz and 5GHz in ism (industrial Scientific medical), adopts a half-duplex communication mechanism, and provides wireless shared access based on CSMA/ca (carrier Sense multiple access with connectivity availability), that is, only one device can transmit packets in an exclusive manner in the same area. However, the resources of the spectrum are limited, and especially the wireless networks of the ieee802.11b and ieee802.11g standards operate in the 2.4-2.4835GHz band, which is divided into 13 channels according to the national standard, and there are only three non-overlapping channels (e.g. 1 channel, 6 channels, 11 channels). If the channel planning of an Access Point (AP) is not reasonable, co-channel interference may be generated, and APs compete with each other to cause all parties to back off, which may result in a decrease in throughput of the overall network. And as the number of terminal devices supporting the WLAN increases, the number of user groups increases sharply, and the problem of radio spectrum resource shortage will become more and more prominent, so it is necessary to perform reasonable channel planning on the AP, thereby reducing the co-channel interference of the network itself and improving the network performance.
The channel allocation schemes under the WLAN can be divided into two broad categories, distributed algorithm and centralized algorithm. The distributed control algorithm operates in each AP independently, and the AP performs corresponding adjustment through sensing and measurement on the wireless network, so that the method has the defects of slow convergence time and incapability of converging to an optimal channel. The centralized control algorithm is relatively mature in development, operates in a centralized control center, uniformly distributes and plans channels of all APs through monitoring and measuring the network overall situation, and ensures the overall performance of the whole network to be optimal.
When a centralized algorithm is adopted, each AP scans each channel through an air interface to obtain the signal distribution conditions of different channels around the AP, one AP with poor channel quality is selected, the AP selects a channel with better quality to switch according to scanning data, in the process, the working channels of all neighbors of the AP cannot be changed, and after the channel switching is finished, the air interface scanning is started uniformly to perform the second iteration. In the second iteration, an AP with poor current channel quality is continuously selected, and switching is continuously performed. The scheme has the conditions of concussion of convergence, slow convergence and even no convergence. If channel allocation is performed manually, as the deployment scale of the AP becomes larger, allocation workload is huge and errors easily occur, which not only consumes more labor cost, but also more uncertainty may exist in manual planning, for example, the actual situation and planning may be inconsistent due to AP deployment errors and the like.
Disclosure of Invention
In order to solve the technical problem, the embodiment of the invention adopts the following technical scheme:
a method for allocating channels in a wireless local area network, applied to a wireless local area network including a first set of at least two APs, comprising the steps of:
determining a neighbor AP list corresponding to each AP in the set respectively,
and acquiring an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and taking the channel value as a working channel value of each AP.
Optionally, the step of obtaining an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and using the channel value as a working channel value of each AP specifically includes:
sequencing neighbor APs in the neighbor AP list according to the distance between the neighbor APs and the corresponding APs, determining the sequence numbers corresponding to the sequencing of the neighbor APs in the neighbor AP list, initializing the channel of each AP as the working channel of each current AP, determining the number n of the combinations of P APs in the set, wherein P is a positive integer greater than or equal to 1 and less than or equal to the number of APs in the set, when the channel change is simulated by selecting any P APs from the set for n times based on respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor AP with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum is used as the working channel value of each AP when the sum selected from the n records is optimal.
Optionally, the step of determining the neighbor AP lists corresponding to the APs in the set specifically includes:
acquiring neighbor information collected by each AP in the set through air interface scanning, wherein the neighbor information at least comprises a basic service set identifier BSSID and a corresponding signal strength RSSI, and determining a neighbor AP list corresponding to each AP in the set according to the neighbor information.
Optionally, the step of determining the neighbor AP lists corresponding to the APs in the set specifically includes: and acquiring distribution information of AP signals around the position of the access terminal when the access terminal detects the AP, which is fed back by the access terminal, and acquiring the AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
Optionally, the step of acquiring distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and acquiring the AP neighbor relations corresponding to the APs in the set according to the signal distribution information specifically includes:
acquiring AP signal distribution information around the access terminal fed back by each associated access terminal through the AP accessed in each AP in the set after each AP in the set initiates a measurement request to each associated access terminal, wherein the signal distribution information at least comprises a Basic Service Set Identifier (BSSID) and corresponding signal strength RSSI,
and inquiring the preset corresponding relation between the BSSID and the MAC address of the AP of the network according to the BSSID to obtain the MAC address of the AP corresponding to the network, and acquiring the AP neighbor relation corresponding to each AP in the set according to the MAC address of the AP.
Optionally, the step of acquiring distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and acquiring the AP neighbor relations corresponding to the APs in the set according to the signal distribution information specifically includes:
acquiring detection information in a broadcast detection request message extracted after each AP in the set receives the broadcast detection request message sent by a corresponding access terminal, acquiring AP signal distribution information around the access terminal from the detection information after acquiring the detection information reported by the last AP in each AP in the set which receives the broadcast detection message of the access terminal, and acquiring the AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
Optionally, after the step of using the channel value of each AP in the set when the sum value is optimal in the n records as the working channel of each AP, the method further includes:
and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor APs with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum, and the simulated channel value of each AP in the set when the sum selected from the n records is optimal is used as the working channel value of each AP, and the repeated execution process is ended until the sum selected from the n records in one round is not better than the sum selected from the n records in the previous round.
Another aspect of the embodiments of the present invention further provides an apparatus for allocating a channel in a wireless local area network, which is applied in a wireless local area network including a first AP set composed of at least two APs, and includes:
a neighbor list establishing module for determining a neighbor AP list corresponding to each AP in the set,
and the channel allocation module is used for acquiring the optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and the channel value of each AP corresponding to the optimal value, and taking the channel value as the working channel value of each AP.
Alternatively to this, the first and second parts may,
the channel allocation module is specifically configured to rank the neighbor APs in the neighbor AP list according to the distances between the neighbor APs and the corresponding APs, determine sequence numbers corresponding to the rank of the neighbor APs in the neighbor AP list, initialize channels of the APs to be working channels of the current APs, determine the number n of combinations of the APs in the set, wherein P is a positive integer greater than or equal to 1 and less than or equal to the number of APs in the set, when the channel change is simulated by selecting any P APs from the set for n times based on respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor AP with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum is used as the working channel value of each AP when the sum selected from the n records is optimal.
Alternatively to this, the first and second parts may,
the neighbor list establishing module is specifically configured to acquire neighbor information collected by each AP in the set through air interface scanning, where the neighbor information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI, and determine, according to the neighbor information, a neighbor AP list corresponding to each AP in the set.
Alternatively to this, the first and second parts may,
the neighbor list establishing module is specifically configured to acquire distribution information of AP signals around a position of the access terminal when detecting an AP, which is fed back by the access terminal, and acquire an AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
Optionally, the neighbor list establishing module includes:
a signal distribution information obtaining unit, configured to obtain AP signal distribution information around each access terminal, which is fed back by each associated access terminal through an AP accessed in each AP in the set after each AP in the set initiates a measurement request to each associated access terminal, where the signal distribution information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI,
and the first neighbor list generating unit is used for inquiring the preset corresponding relation between the BSSID and the MAC address of the AP of the network to obtain the MAC address of the AP corresponding to the network, and acquiring the AP neighbor relation corresponding to each AP in the set according to the MAC address of the AP.
Optionally, the neighbor list establishing module includes:
a detection information obtaining unit, configured to obtain detection information in a broadcast detection request message extracted after each AP in the set receives the broadcast detection request message sent by a corresponding access terminal,
and the second neighbor list generating unit is used for acquiring AP signal distribution information around the access terminal from the detection information after acquiring the detection information reported by the last AP of the access terminal broadcast detection messages received by the APs in the set, and acquiring the AP neighbor relations corresponding to the APs in the set respectively according to the signal distribution information.
Optionally, the channel allocation module is further configured to:
and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor APs with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum, and the simulated channel value of each AP in the set when the sum selected from the n records is optimal is used as the working channel value of each AP, and the repeated execution process is ended until the sum selected from the n records in one round is not better than the sum selected from the n records in the previous round.
It is still another aspect of the embodiments of the present invention to provide a wireless controller for allocating channels in a wireless local area network, including the above apparatus for allocating channels in a wireless local area network.
The embodiment of the invention has the beneficial effects that: the method can rapidly plan the channel, automatically and effectively stagger the channels between the APs, reduce the same frequency interference of the network as much as possible, reduce the additional cost of the network and improve the network performance.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of a method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method according to an embodiment of the present invention;
FIG. 3 is a flow chart of a method according to an embodiment of the present invention;
FIG. 4 is a flow chart of a method according to an embodiment of the present invention;
FIG. 5 is a diagram of an apparatus according to an embodiment of the present invention;
FIG. 6 is a diagram of an apparatus according to an embodiment of the present invention;
fig. 7 is a diagram illustrating an apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
An embodiment of the present invention provides a method for allocating channels in a wireless local area network, which is applied in a wireless local area network including a first AP set composed of at least two APs, as shown in fig. 1, and includes the following steps:
s101, determining neighbor AP lists corresponding to the APs in the set respectively,
s102, obtaining an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and taking the channel value as a working channel value of each AP.
The embodiment of the invention has the beneficial effects that: the method can rapidly plan the channel, automatically and effectively stagger the channels between the APs, reduce the same frequency interference of the network as much as possible, reduce the additional cost of the network and improve the network performance.
Optionally, as shown in fig. 2, the step S102 specifically includes:
s1021, according to the distance between the neighbor AP and the corresponding AP, the neighbor APs in the neighbor AP list are sorted, the sequence numbers of the neighbor APs in the neighbor AP list corresponding to the sorting are determined,
s1023, initializing the channel of each AP as the working channel of each current AP,
s1025, determining the number n of the combination of P APs in the set, wherein P is a positive integer which is more than or equal to 1 and less than or equal to the number of the APs in the set,
s1027, recording the sum of Boolean values of co-channel interference between each AP in the set and the neighbor AP with the same sequence number in the corresponding neighbor AP list and the simulated channel value of each AP in the set corresponding to the sum when selecting any P AP from the set to simulate changing channels based on the respective working channel for n times,
s1029, the simulated channel value of each AP in the set when the sum value selected in the n records is optimal is taken as the working channel value of each AP.
Alternatively, with respect to the P value, the P value may be taken to be 1, 2, or 3, in general, or dynamically selected.
Optionally, after the step of using the channel value of each AP in the set when the sum value is optimal in the n records as the working channel of each AP, the method further includes: and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether a sum value of Boolean values of co-frequency interference exists between each AP in the set and each neighbor AP with the same sequence number in the corresponding neighbor AP list, and the simulated channel value of each AP in the set corresponding to the sum value, and the simulated channel value of each AP in the set is used as the working channel value of each AP when the sum value selected from the n records is optimal, and the repeated execution process is ended until the sum value selected from the n records in one round is not better than the sum value selected from the n records in the previous round.
And repeatedly executing multiple rounds, wherein each round of repeatedly executing selects a simulated channel value scheme capable of minimizing the number of co-channel interference of the network until a simulated channel value scheme with a better result than that of the previous round of repeatedly executing cannot be found in one round of repeatedly executing, and repeatedly executing is stopped, and at the moment, the simulated channel value of each AP is the final working channel value scheme of each AP. In each round of repeated execution, traversing each AP in the set, simulating the AP to try to change all allowed channels, then calculating the whole network interference number under the simulated channel, finding a simulated channel scheme capable of minimizing the network interference number in one round of repeated execution as the current repeatedly executed simulated channel scheme, and entering the next round of repeated execution; if there is no better than the current analog channel scheme, the stop is repeatedly performed. The embodiments of the present invention are further described below with reference to specific application scenarios:
there are three APs in a set of APs: AP1, AP2, AP 3. A 5-channel scheme is adopted: 149, 153, 157, 161, 165, AP1 initial operating channel 149 channels, AP2 initial operating channel is also 149 channels, and AP3 initial operating channel is also 149 channels. And sorting the neighbor list in a descending order according to the strength of the signal strength, wherein the sorting result of the neighbor relation is as follows:
the neighbor list of the AP1 is ordered as AP2 and AP3, wherein the sequence number 1 in the list corresponds to AP2, and the sequence number 2 in the list corresponds to AP 3;
the neighbor list of the AP2 is ordered as AP3 and AP1, wherein the sequence number 1 in the list corresponds to AP3, and the sequence number 2 in the list corresponds to AP 1;
the neighbor list of AP3 is ordered as AP2, with sequence number 1 corresponding to AP2 and sequence number 2 having no corresponding neighbors.
The nearer neighbors, i.e., neighbors with greater co-channel interference, are placed in front of the neighbor list, and in this set of constructed data, AP1 is not an AP3 neighbor, but AP3 is a neighbor of AP 1. At the beginning, because the three AP channels are the same and all have the same frequency, if they are neighbors, the same frequency interference exists between them, for sequence number 1, in the three neighbor lists, the same frequency interference exists between the three APs and the neighbor AP corresponding to sequence number 1 in the respective neighbor list, the boolean value corresponding to sequence number 1 is denoted as top1, the boolean value corresponding to sequence number 2 is denoted as top2, the boolean value corresponding to sequence number 3 is denoted as top3, the initial values of the three boolean values are 0, if there are 1 same frequency interference, the boolean value is added by 1, for the three APs, the number of top1 is 3, and the number of top2 is 2. Because the co-channel interference numbers are arranged in a descending order, the co-channel interference number corresponding to the serial number 1 is the maximum co-channel interference number, the co-channel interference number corresponding to the serial number 2 is the second largest co-channel interference number, the co-channel interference number corresponding to the serial number 3 is the third largest co-channel interference number, and so on.
In the first execution, the AP1 tries to simulate switching to the 4 channels 153-165 in sequence, respectively, to find the best solution, such as channel 153 (157 is taken for AP1, and 161 is also taken here, and 153 is taken to be the first one, and other APs 2 and 3 are also channels 149), where top1 is obtained as 2 (co-channel interference with AP2 and AP3 having sequence number 1 in their respective neighbor lists, and top2 is 0). After the AP1 finishes analog switching of all channels, recording that the optimal scheme after this analog channel switching is the current optimal scheme, that is, the AP1 working channel is 153 channel, the AP2 working channel is 149 channel, and the AP3 working channel is 149 channel, after the AP1 switches back to the 149 channel before this round of execution, then performing analog channel switching on the AP2, trying 4 channels of 153-165 in sequence, finding that the optimal scheme is 153 channel (the AP1 and the AP2 still retain the original channels, that is, both are 149 channels), at this time, the top1 is 0, the top2 is 1 (the AP3 is the same frequency interference with the sequence number of 2 in the neighbor list of the AP 1), because when the AP2 simulates the channel switching, the value of the top1 is smaller than the value of the top1 when the AP1 simulates the channel switching, the scheme of the AP2 simulation channel switching is considered to be better than the scheme of the AP1 channel switching, and then the scheme after this analog channel switching is taken as the current optimal scheme, that is the AP1 working channel or 149 channel, the AP2 working channel is changed into 153 channels, and the AP3 working channel is changed into 149 channels; continuing to restore the AP2 channel to the initial channel 149 of the current round, then performing analog channel switching on the AP3, and trying 4 channels of 153-165 in sequence, it can be found that the AP3 is the best scheme when adopting the channel 153, where the top1 is 1(AP2 is the maximum co-channel interference of the AP1, that is, AP2 is the co-channel interference of the AP1 with the sequence number of 1 in the neighbor list), and the top2 is 1(AP1 is the second largest co-channel interference of the AP2, that is, AP1 is the co-channel interference of the AP2 with the sequence number of 2 in the neighbor list); when the AP3 simulates switching channels, the value of top1 is greater than the value of top1 when the AP2 simulates switching channels, and it is considered that the scheme of simulating switching channels by AP2 is better than the scheme of simulating switching channels by AP3, and it can be found from these three schemes of simulating switching by AP3 that selecting analog switching of AP2 to 153 channels is the best scheme, at this time, top1 is 0 and top2 is 1, so that AP1 is 149 channels, AP2 is 153 channels, and AP3 is 149 channels as a new working channel scheme after the current round of execution, and the next round of repeated execution process is performed.
Accordingly, in another embodiment of the present invention, the process is repeatedly performed as follows:
the result of each round of repeated execution is different. For example, in the first round of execution, if only 1 AP channel is changed once, 1000 possibilities are simulated in the current round of execution, and then a scheme (i.e., an optimal scheme or an optimal scheme) capable of minimizing co-channel interference can be found out, for example, the 900 th AP900 is selected from the 1000 APs, the AP900 is switched from 6 channel simulation to 1 channel, at this time, it can be found that top1 is reduced by 7 co-channel interference numbers from the initial value, and is the optimal scheme in the current round of execution, and this round is finished, and the working channel of the AP900 is 1 channel;
and then starting a next round of repeated execution process, wherein the result of the first round is received before the next round of repeated execution process, that is, the AP900 is already in the channel 1, then 1000 times of analog channel switching are performed, in the next round of repeated execution process, the working channel of the AP234 is found to be changed from the channel 1 to the channel 6, at this time, it can be found that top1 is still reduced by 6 co-channel interference numbers compared with the value of the previous round, the co-channel interference number reduction caused by the analog channel switching of any other AP in the 1000 APs is not as good as that of the analog channel switching of the AP234, the working channel of the AP234 is changed to the channel 6, and the round of repeated execution process is ended, at this time, the working channel of the AP234 is changed to the channel 6, and the next round of repeated execution process is started. Because the neighbors of the AP are changed, in the next round of repeated execution process, the optimal scheme is found to be that the channel of the AP900 is changed from 1 channel to 11 channels in a simulating way, and top1 is reduced by 2 co-channel interference numbers compared with the value of the previous round of repeated execution process. Thus, the change is performed until any channel of 1000 APs is changed in a simulation manner in a certain round of repeated execution process, and the maximum co-channel interference number top1 is not less than the maximum co-channel interference number top1 in the previous round of repeated execution process, so that the channel allocation scheme corresponding to the maximum co-channel interference number top1 in the previous round of repeated execution process is the final working channel allocation scheme of the 1000 APs.
Optionally, in the embodiment of the present invention, the priority of the top1 is greater than top2 and then greater than top3, and so on, where top2 is greater than top3, when the maximum co-channel interference number top1 calculated in the current round is the same as the maximum co-channel interference number top1 calculated in the previous round, the second maximum co-channel interference number top2 calculated in the current round may be continuously compared with the second maximum co-channel interference number top2 calculated in the previous round, if the second maximum co-channel interference number top2 is not less than the second maximum co-channel interference number top2 in the previous round of repeated execution process, the channel allocation scheme corresponding to the maximum co-channel interference number top1 and the second maximum co-channel interference number top2 in the previous round of repeated execution process is the final working channel allocation scheme of the 1000 APs, and so on, it is ensured that when the channel allocation scheme is finally confirmed, the channel allocation scheme is higher than the lowest co-channel interference number k of the co-channel interference number top (k) corresponding to the highest co-channel interference number k) in the final confirmed channel allocation scheme, that is, the optimal value, that is, the top (o) effect should not be deteriorated in the process of optimizing top (k) interference, where k is a positive integer greater than or equal to 2, and o is a positive integer less than k and greater than or equal to 1.
In another embodiment of the present invention, the top value is calculated as follows:
let N in the mth setmAn AP, wherein the ith AP is marked as an APi，APiIs the current operating channel chiTo connect APiThe jth strong signal strength of (a) is recorded as RSSIijAnd will APiThe sensing corresponds to sending the neighbor AP number of the jth strong signal and is marked as NeibarijFor convenience of illustration, the RSSI and Neibar are set to k × N respectivelymA matrix of sizes, namely: each AP in the set has k neighbors at most, if the number of neighbors sensed by the AP is less than k, invalid filling can be carried out on the positions lacking data in the matrix Neibar and RSSI, and if the number of certain AP neighbors is more than k in reality, the excessive neighbors are ignored. The detailed steps of the algorithm are as follows:
step one, in an initialization stage, initializing channels of all APs in a set m to be working channels of all the current APs.
Step two, respectively calculating the distance from top1 to top kIntegral network co-frequency interference index Int1，Int2，...，Intk. The jth strong (top j) interference index in the whole network can be calculated according to the following formula:
Figure BDA0001271113140000121
Figure BDA0001271113140000122
wherein IntjSmaller interference indicates less interference to top j, IntjiIs a Boolean value meaning an in-set APiIf the channels are consistent, i.e. chi＝chtIf the neighbor list is not the same frequency interference, the boolean value is 0, wherein in the neighbor list, the neighbor with the jth nearest can be understood as the neighbor with the sequence number j in the neighbor list. Saving and recording IntjAnd when the current value is taken, the channel scheme of each AP is a global optimal scheme:
Gbest_Cht＝cht,where 1≤t≤Nmformula (3)
Gbest_Intj＝IntjFormula (4) where j is more than or equal to k is more than or equal to where 1
Wherein, Gbest _ ChtIs APtGlobal optimal channel scheme, Gbest _ IntjThe interference index of top j which is the global best scheme.
Step three, before each iteration starts, recording the local optimal channel scheme of each iteration as the current global optimal channel scheme:
Pbest_Cht＝Gbest_Cht,where 1≤t≤Nmformula (5)
Pbest_Intj＝Gbest_IntjFormula (6) where j is more than or equal to k is more than or equal to where 1
Wherein Pbest _ ChtIs APtLocally optimal channel scheme, Pbest _ IntjThe interference index of top j which is the locally best solution.
By means of simulation traversal, calculatingAny P APs in the set change channels simultaneously, and whether there is a better scheme to update the local best scheme exists, that is: in one execution, traversal selection is required
Figure BDA0001271113140000131
And (3) combining the next different APs, and traversing and changing the P APs into different channel schemes by using a simulation method under each combination:
chi＝new_chiwhere i ∈ C (p) and C (p) is a combination of APs equation (7)
Formula (7) represents chiEach time the AP channel is changed to a new channel new _ chiWherein c (p) represents the set of APs, i belongs to the set of APs, and the selection of the channel requires selecting non-interfering channels from the channels allowed in the country where the AP is located, for example, china 2.4G may use 1/6/11 three channels, so that in one AP combination, the number of times that the channel needs to be switched in an analog mode at most is: power P of 3.
Each time the channel switching is simulated, the interference of all the tops 1 to tops k in the area is recalculated according to the formula (1) and the formula (2), and compared with the local optimal scheme, if the current channel scheme combination is better than the local optimal scheme, the local optimal channel scheme is updated by the current channel scheme:
Figure BDA0001271113140000132
wherein, i is the AP number of the changed channel, if the co-channel interference index after the channel is simulated and switched is better than the co-channel interference index corresponding to the current local optimal channel scheme, namely: if the current top j scheme Pbest _ IntjInt scheme superior to local optimal top jjAnd for all the first j co-channel interference indicators InttCo-channel interference index Pbest _ Int not better than current local optimum schemetAnd if the difference is less than the threshold, updating the scheme to be the local optimal scheme.
After one iteration is completed, Pbest _ Int becomes a local optimal co-channel interference index in the iteration, Pbest _ Ch becomes a local optimal channel scheme corresponding to Pbest _ Ch, and the step four is executed.
And step four, comparing the local optimal scheme with the global optimal scheme, if the local optimal scheme and the global optimal scheme meet the formula (9), updating the local optimal scheme into the global optimal scheme according to the formula (10), and skipping to the step three.
Figure BDA0001271113140000141
Figure BDA0001271113140000142
At this time, when the calculation is finished, each AP channel in the set is the calculated proposed working channel, optionally, P is set to 2 as a default, that is, in a round of execution process, it may be tried to change channels of any 2 APs at the same time; k is taken to be 20, i.e. only co-channel interference of the first 20 neighbors needs to be considered at most.
Optionally, step S101 specifically includes:
acquiring neighbor information collected by each AP in the set through air interface scanning, wherein the neighbor information at least comprises a basic service set identifier BSSID and a corresponding signal strength RSSI, and determining a neighbor AP list corresponding to each AP in the set according to the neighbor information.
The reported content form is (AP1/radio _ x, BSSID, RSSI), which means that radio _ x of the AP scans the BSSID signal with the signal strength of RSSI.
Because if a signal BSSID is released by the wireless lan administrator, it can be known which BSSID is sent by any AP/radio, and similarly, if a signal is released by the wireless lan administrator, the corresponding AP/radio can be found back by the BSSID.
Therefore, after the server or the wireless controller AC receives the neighbor information collected by scanning reported by the AP, if the signal is a signal released by the wireless lan administrator, it can be queried according to the BSSID as to which AP/radio the signal is released, so that a converted (AP1/radio _ x, AP2/radio _ y, RSSI) table structure can be obtained, meaning that the signal is released by the radio _ y of the AP2 sensed by the radio _ x of the AP1, and the signal strength is RSSI.
Optionally, in addition to determining the neighbor list according to the RSSI between the scanned AP and the neighbor AP, the AP may also determine the neighbor list through CSI (Channel State Information) ranging, or determine the neighbor list through RTT (Round-Trip Time Round Trip delay) calculation.
Optionally, step S101 specifically includes:
and acquiring distribution information of AP signals around the position of the access terminal when the access terminal detects the AP, which is fed back by the access terminal, and acquiring the AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
Optionally, the step of acquiring distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and acquiring the AP neighbor relations corresponding to the APs in the set according to the signal distribution information includes, as shown in fig. 3:
s1011, obtaining AP signal distribution information around the access terminal fed back by each associated access terminal through the AP accessed in each AP after each AP in the set initiates a measurement request to each associated access terminal, wherein the signal distribution information at least comprises a basic service set identifier BSSID and a corresponding signal strength RSSI,
s1013, inquiring the preset corresponding relation between the BSSID and the MAC address of the AP according to the BSSID to obtain the MAC address of the corresponding AP, and obtaining the AP neighbor relation corresponding to each AP in the set according to the MAC address of the AP.
For example, the AP1 discharge signal includes bssid1, the AP1 discharge signal includes bssid2, the AP1 discharge signal includes bssid3,
the AP2 discharge signal includes bssid4, the AP2 discharge signal includes bssid5, the AP2 discharge signal includes bssid6,
the AP3 discharge signal includes bssid7, the AP3 discharge signal includes bssid8, the AP3 discharge signal includes bssid9,
the AP1 scans the BSSID7 signal, finds that the BSSID7 is sent out for the AP3, and then queries the correspondence between the preset BSSID and the MAC address of the AP according to the BSSID7 to obtain the MAC address of the AP3, so that the AP3 is a neighbor of the AP1, and the distance between the neighbors can be determined by scanning the signal strength.
Optionally, the step of acquiring distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and acquiring the AP neighbor relations corresponding to the APs in the set according to the signal distribution information includes, as shown in fig. 4:
s1015, acquiring the detection information in the broadcast detection request message extracted by each AP in the set after receiving the broadcast detection request message sent by the corresponding access terminal,
s1017, after acquiring the detection information reported by the last AP of the APs in the set which receives the detection message broadcasted by the access terminal, acquiring the AP signal distribution information around the access terminal from the detection information,
s1019, acquiring AP neighbor relations corresponding to the APs in the set according to the signal distribution information.
Optionally, in step S1017: after the server or the access controller AC collects the probe information reported by the access terminal from each AP in the set, the probe signal strength threshold may be set to RSSI1, which is set to 10 in this embodiment, and extracts the corresponding probe data higher than the threshold,
optionally, in step S1019, a weighted circle count method or other methods may be respectively used for each AP to extract an AP neighbor list.
Simply, taking a border count as an example for explanation, the adopted mode similar to voting is to simply default that all AP weights are 1 by collecting a probe detection request message of an access terminal as input and establishing a neighbor relation for each AP, assuming that: the AP1 receives the probe message of terminal a, RSSI is 50,
the AP2 receives the probe message of terminal a, RSSI 40,
the AP3 receives the probe message of terminal a, RSSI is 20,
the AP4 receives the probe message of the terminal a, RSSI is 10,
the closest to access terminal a is AP1, next AP2, next AP3, AP4, depending on the magnitude of the signal strength.
The AP with the strongest signal strength is taken as the center, here AP1, and its signal strength exceeds the specified threshold, otherwise the data is discarded.
Then the neighbor ranks of AP1 can be calculated based only on the strength of the probe request message of access terminal a this time.
The weight of the AP2 is 40+20+10 ═ 70;
the AP3 weight is 20+ 10-30;
the AP4 weight is 10;
and carrying out normalization processing between 0 and 1 on the weight, wherein the larger the weight is, the closer the neighbor is shown, and other APs are relatively farther and not in the neighbor list because the other APs do not sense the probe message.
Thus the neighbors of AP1 are AP2, AP3, AP4 relatively far and near.
This is only probe data for one access terminal a, and one access terminal sends probe messages every few minutes, and there is a lot of this data in the network.
A probe request is issued for another access terminal B. And similarly, taking the AP corresponding to the strongest signal strength as a center, calculating the weight of the neighbor of the AP, accumulating the weight to the weight of the accumulated neighbor obtained by the original calculation of the AP, and so on, finally passing through a large amount of probe data of the access terminal, and abstracting the neighbor relation of each AP.
An embodiment of the present invention further provides an apparatus for allocating a channel in a wireless local area network, which is applied to a wireless local area network including a first AP set composed of at least two APs, as shown in fig. 5, and includes:
a neighbor list establishing module 201, configured to determine a neighbor AP list corresponding to each AP in the set,
a channel allocating module 203, configured to acquire an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and use the channel value as a working channel value of each AP.
The embodiment of the invention has the beneficial effects that: the method can rapidly plan the channel, automatically and effectively stagger the channels between the APs, reduce the same frequency interference of the network as much as possible, reduce the additional cost of the network and improve the network performance.
Alternatively to this, the first and second parts may,
the channel allocating module 203 is specifically configured to rank the neighbor APs in the neighbor AP list according to the distances between the neighbor APs and the corresponding APs, determine the sequence numbers corresponding to the ranks of the neighbor APs in the neighbor AP list, initialize the channel of each AP as the working channel of each current AP, determine the number n of the combinations of P APs in the set, wherein P is a positive integer greater than or equal to 1 and less than or equal to the number of APs in the set, when the channel change is simulated by selecting any P APs from the set for n times based on respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor AP with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum is used as the working channel value of each AP when the sum selected from the n records is optimal.
Alternatively to this, the first and second parts may,
the neighbor list establishing module 201 is specifically configured to acquire neighbor information collected by each AP in the set through air interface scanning, where the neighbor information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI, and determine, according to the neighbor information, a neighbor AP list corresponding to each AP in the set.
Alternatively to this, the first and second parts may,
the neighbor list establishing module 201 is specifically configured to acquire distribution information of AP signals around a position of the access terminal when detecting an AP, which is fed back by the access terminal, and acquire an AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
Optionally, as shown in fig. 6, the neighbor list establishing module 201 includes:
a signal distribution information obtaining unit 2011, configured to obtain AP signal distribution information around the access terminal, which is fed back by each associated access terminal through an AP accessed in each AP in the set after each AP in the set initiates a measurement request to each associated access terminal, where the signal distribution information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI,
a first neighbor list generating unit 2013, configured to query, according to the BSSID, a preset correspondence between the BSSID and the MAC address of the AP in the local network to obtain the MAC address of the AP corresponding to the local network, and obtain, according to the MAC address of the AP, AP neighbor relations respectively corresponding to the APs in the set.
Optionally, as shown in fig. 7, the neighbor list establishing module 201 includes:
a probe information obtaining unit 2015, configured to obtain probe information in the broadcast probe request message extracted by each AP in the set after receiving the broadcast probe request message sent by the corresponding access terminal,
a second neighbor list generating unit 2017, configured to, after acquiring the detection information reported by the last AP that receives the detection packet broadcast by the access terminal from each AP in the set, acquire AP signal distribution information around the access terminal from the detection information, and acquire, according to the signal distribution information, AP neighbor relations corresponding to each AP in the set, respectively.
Alternatively to this, the first and second parts may,
the channel allocating module 203 is further configured to:
and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor APs with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum, and the simulated channel value of each AP in the set when the sum selected from the n records is optimal is used as the working channel value of each AP, and the repeated execution process is ended until the sum selected from the n records in one round is not better than the sum selected from the n records in the previous round.
The embodiment of the present invention further provides a wireless controller for allocating channels in a wireless local area network, which includes the apparatus for allocating channels in a wireless local area network described in the above embodiments, and internal modules and units thereof.
The embodiment of the invention has the beneficial effects that: the method can rapidly plan the channel, automatically and effectively stagger the channels between the APs, reduce the same frequency interference of the network as much as possible, reduce the additional cost of the network and improve the network performance.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (12)

1. A method for allocating channels in a wireless local area network, applied to a wireless local area network including a first set of at least two APs, comprising the steps of:
determining a neighbor AP list corresponding to each AP in the set respectively,
acquiring an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and taking the channel value as a working channel value of each AP;
wherein, the step of obtaining the optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list and the channel value of each AP corresponding to the optimal value, and using the channel value as the working channel value of each AP specifically includes:
sequencing neighbor APs in the neighbor AP list according to the distance between the neighbor APs and the corresponding APs, determining the sequence numbers corresponding to the sequencing of the neighbor APs in the neighbor AP list, initializing the channel of each AP as the working channel of each current AP, determining the number n of the combinations of P APs in the set, wherein P is a positive integer greater than or equal to 1 and less than or equal to the number of APs in the set, when the channel change is simulated by selecting any P APs from the set for n times based on respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor AP with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum is used as the working channel value of each AP when the sum selected from the n records is optimal.
2. The method according to claim 1, wherein the step of determining the neighbor AP lists corresponding to the APs in the set specifically comprises:
acquiring neighbor information collected by each AP in the set through air interface scanning, wherein the neighbor information at least comprises a basic service set identifier BSSID and a corresponding signal strength RSSI, and determining a neighbor AP list corresponding to each AP in the set according to the neighbor information.
3. The method according to claim 1, wherein the step of determining the neighbor AP lists corresponding to the APs in the set specifically comprises: and acquiring distribution information of AP signals around the position of the access terminal when the access terminal detects the AP, which is fed back by the access terminal, and acquiring the AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
4. The method according to claim 3, wherein the step of obtaining distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and obtaining the AP neighbor relations corresponding to the APs in the set according to the signal distribution information specifically includes:
acquiring AP signal distribution information around the access terminal fed back by each associated access terminal through the AP accessed in each AP in the set after each AP in the set initiates a measurement request to each associated access terminal, wherein the signal distribution information at least comprises a Basic Service Set Identifier (BSSID) and corresponding signal strength RSSI,
and inquiring the preset corresponding relation between the BSSID and the MAC address of the AP of the network according to the BSSID to obtain the MAC address of the AP corresponding to the network, and acquiring the AP neighbor relation corresponding to each AP in the set according to the MAC address of the AP.
5. The method according to claim 3, wherein the step of obtaining distribution information of AP signals around the position of the access terminal when detecting the AP, which is fed back by the access terminal, and obtaining the AP neighbor relations corresponding to the APs in the set according to the signal distribution information specifically includes:
acquiring detection information in a broadcast detection request message extracted after each AP in the set receives the broadcast detection request message sent by a corresponding access terminal, acquiring AP signal distribution information around the access terminal from the detection information after acquiring the detection information reported by the last AP in each AP in the set which receives the broadcast detection message of the access terminal, and acquiring the AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
6. The method of claim 1, wherein the step of using the channel value of each AP in the set as the operating channel of the AP when the sum value is optimal in the n records further comprises:
and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor APs with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum, and the simulated channel value of each AP in the set when the sum selected from the n records is optimal is used as the working channel value of each AP, and the repeated execution process is ended until the sum selected from the n records in one round is not better than the sum selected from the n records in the previous round.
7. An apparatus for allocating channels in a wireless local area network, applied to a wireless local area network including a first set of APs comprising at least two APs, comprising:
a neighbor list establishing module for determining a neighbor AP list corresponding to each AP in the set,
a channel allocation module, configured to obtain an optimal value of co-frequency interference between each AP in the set and each neighbor AP in the neighbor AP list, and a channel value of each AP corresponding to the optimal value, and use the channel value as a working channel value of each AP;
the channel allocation module is specifically configured to rank neighbor APs in the neighbor AP list according to distances between the neighbor APs and the corresponding APs, determine sequence numbers corresponding to the ranking of the neighbor APs in the neighbor AP list, initialize channels of the APs as working channels of the current APs, determine the number n of combinations of the APs in the set, where P is a positive integer greater than or equal to 1 and less than or equal to the number of the APs in the set, record the sum of boolean values of whether co-frequency interference exists between each AP in the set and neighbor APs with the same sequence number in the corresponding AP list when n times of selection of any P APs from the set and change channels based on respective working channels are performed, and the simulated channel value of each AP in the set when the sum value selected in the n times of recording is optimal, and use the simulated channel value of each AP in the set as the working channel value of each AP .
8. The apparatus of claim 7,
the neighbor list establishing module is specifically configured to acquire neighbor information collected by each AP in the set through air interface scanning, where the neighbor information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI, and determine, according to the neighbor information, a neighbor AP list corresponding to each AP in the set.
9. The apparatus of claim 7,
the neighbor list establishing module is specifically configured to acquire distribution information of AP signals around a position of the access terminal when detecting an AP, which is fed back by the access terminal, and acquire an AP neighbor relation corresponding to each AP in the set according to the signal distribution information.
10. The apparatus of claim 9, wherein the neighbor list establishing module comprises:
a signal distribution information obtaining unit, configured to obtain AP signal distribution information around each access terminal, which is fed back by each associated access terminal through an AP accessed in each AP in the set after each AP in the set initiates a measurement request to each associated access terminal, where the signal distribution information at least includes a basic service set identifier BSSID and a corresponding signal strength RSSI,
and the first neighbor list generating unit is used for inquiring the preset corresponding relation between the BSSID and the MAC address of the AP of the network to obtain the MAC address of the AP corresponding to the network, and acquiring the AP neighbor relation corresponding to each AP in the set according to the MAC address of the AP.
11. The apparatus of claim 9, wherein the neighbor list establishing module comprises:
a detection information obtaining unit, configured to obtain detection information in a broadcast detection request message extracted after each AP in the set receives the broadcast detection request message sent by a corresponding access terminal,
and the second neighbor list generating unit is used for acquiring AP signal distribution information around the access terminal from the detection information after acquiring the detection information reported by the last AP of the access terminal broadcast detection messages received by the APs in the set, and acquiring the AP neighbor relations corresponding to the APs in the set respectively according to the signal distribution information.
12. The apparatus of claim 7, wherein the channel assignment module is further configured to:
and when the record is repeatedly executed for n times, any P APs are selected from the set to simulate and change channels on the basis of respective working channels, whether the sum of Boolean values of co-frequency interference exists between each AP in the set and the neighbor APs with the same sequence number in the corresponding neighbor AP list respectively, and the simulated channel value of each AP in the set corresponding to the sum, and the simulated channel value of each AP in the set when the sum selected from the n records is optimal is used as the working channel value of each AP, and the repeated execution process is ended until the sum selected from the n records in one round is not better than the sum selected from the n records in the previous round.
CN201710247882.5A 2017-04-17 2017-04-17 Method and device for distributing channels in wireless local area network Active CN107071912B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710247882.5A CN107071912B (en) 2017-04-17 2017-04-17 Method and device for distributing channels in wireless local area network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710247882.5A CN107071912B (en) 2017-04-17 2017-04-17 Method and device for distributing channels in wireless local area network

Publications (2)

Publication Number Publication Date
CN107071912A CN107071912A (en) 2017-08-18
CN107071912B true CN107071912B (en) 2020-08-21

Family

ID=59599550

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710247882.5A Active CN107071912B (en) 2017-04-17 2017-04-17 Method and device for distributing channels in wireless local area network

Country Status (1)

Country Link
CN (1) CN107071912B (en)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108495347B (en) * 2018-03-05 2021-01-12 江苏创通电子股份有限公司 Seamless roaming method
CN108551415A (en) * 2018-06-20 2018-09-18 深圳市彬讯科技有限公司 Intelligent domestic system, intelligent gateway and its control method
CN109191962B (en) * 2018-10-11 2020-11-03 四川生学教育科技有限公司 Method and system for optimizing same-frequency frame rate under fixed bandwidth
CN109510675A (en) * 2018-12-24 2019-03-22 深圳市潮流网络技术有限公司 A kind of automatic channel selection method of multiple spot AP
CN110461006B (en) * 2019-08-15 2022-10-14 普联技术有限公司 Method and device for reducing WLAN interference and terminal equipment
CN110831205A (en) * 2019-09-24 2020-02-21 普联技术有限公司 Wireless network channel allocation method, device and system
CN111031549B (en) * 2019-11-07 2023-01-10 锐捷网络股份有限公司 Method for realizing automatic networking of distributed bridging system and AP
CN112839362B (en) * 2019-11-22 2023-05-02 武汉神州数码云科网络技术有限公司 Self-adaptive channel allocation method and device for wireless local area network
CN111050376B (en) * 2019-11-26 2022-05-20 锐捷网络股份有限公司 AP neighbor table establishing method and device based on local area network
CN113302980B (en) * 2020-09-17 2023-06-20 成都西加云杉科技有限公司 Channel allocation method, system, electronic equipment and storage medium
WO2023131006A1 (en) * 2022-01-04 2023-07-13 华为技术有限公司 Channel allocation method, related apparatus and system
CN116567639A (en) * 2022-01-30 2023-08-08 华为技术有限公司 Channel allocation method and network equipment
CN116707685B (en) * 2023-08-09 2023-10-24 新华三技术有限公司 Channel adjustment method and device

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829177A (en) * 2005-03-01 2006-09-06 华为技术有限公司 Method for realizing load balance between access devices in WLAN
CN101835243A (en) * 2010-05-25 2010-09-15 北京星网锐捷网络技术有限公司 Wireless access point working channel selecting method and device
CN102711274A (en) * 2012-06-01 2012-10-03 重庆市电力公司 WLAN communication channel detecting method based on optimal stopping theory
CN103338504A (en) * 2013-06-21 2013-10-02 北京邮电大学 Information channel and power combined self-configuration method for APs (Access Points) in wireless local area network
CN104080088A (en) * 2013-03-27 2014-10-01 中国移动通信集团湖南有限公司 Method and device of channel allocation
CN104168657A (en) * 2013-05-20 2014-11-26 华为技术有限公司 Communication method and communication device of same-frequency networking wireless local area network
CN104185283A (en) * 2014-09-05 2014-12-03 西安电子科技大学 Self-adaptive method for multi-channel assignment in cognitive radio network
CN104349480A (en) * 2013-07-31 2015-02-11 华为技术有限公司 Wireless network channel assignment method, device, and system
CN104703281A (en) * 2013-12-06 2015-06-10 华为技术有限公司 Channel distributing method, channel distributing device and Wireless Local Area Network system
CN106060946A (en) * 2016-05-31 2016-10-26 杭州华三通信技术有限公司 Channel distribution method and device
CN106060835A (en) * 2016-05-05 2016-10-26 锐捷网络股份有限公司 Wireless local area network anti-interference method and wireless local area network controller

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829177A (en) * 2005-03-01 2006-09-06 华为技术有限公司 Method for realizing load balance between access devices in WLAN
CN101835243A (en) * 2010-05-25 2010-09-15 北京星网锐捷网络技术有限公司 Wireless access point working channel selecting method and device
CN102711274A (en) * 2012-06-01 2012-10-03 重庆市电力公司 WLAN communication channel detecting method based on optimal stopping theory
CN104080088A (en) * 2013-03-27 2014-10-01 中国移动通信集团湖南有限公司 Method and device of channel allocation
CN104168657A (en) * 2013-05-20 2014-11-26 华为技术有限公司 Communication method and communication device of same-frequency networking wireless local area network
CN103338504A (en) * 2013-06-21 2013-10-02 北京邮电大学 Information channel and power combined self-configuration method for APs (Access Points) in wireless local area network
CN104349480A (en) * 2013-07-31 2015-02-11 华为技术有限公司 Wireless network channel assignment method, device, and system
CN104703281A (en) * 2013-12-06 2015-06-10 华为技术有限公司 Channel distributing method, channel distributing device and Wireless Local Area Network system
CN104185283A (en) * 2014-09-05 2014-12-03 西安电子科技大学 Self-adaptive method for multi-channel assignment in cognitive radio network
CN106060835A (en) * 2016-05-05 2016-10-26 锐捷网络股份有限公司 Wireless local area network anti-interference method and wireless local area network controller
CN106060946A (en) * 2016-05-31 2016-10-26 杭州华三通信技术有限公司 Channel distribution method and device

Also Published As

Publication number Publication date
CN107071912A (en) 2017-08-18

Similar Documents

Publication Publication Date Title
CN107071912B (en) Method and device for distributing channels in wireless local area network
CN105357712B (en) Multinode scan channel and distribution method in a kind of wireless network
WO2016090770A1 (en) Sending method and device for frequency point measurement message
CN104955077A (en) Heterogeneous network cell clustering method and device based on user experience speed
CN102497640A (en) Dynamic configuration method of intensive local area network environment broadband channel
Hu et al. Optimal new site deployment algorithm for heterogeneous cellular networks
CN104754678A (en) Method for selecting optimal channels for APs (access points) in wireless network
Ibrahim et al. Congestion games for distributed radio access selection in broadband networks
CN106792995B (en) User access method for guaranteeing low-delay content transmission in 5G network
CN105101355A (en) User throughput estimation based access point selection method in wireless local area network (WLAN) system
Khawam et al. Individual vs. global radio resource management in a hybrid broadband network
CN105933923B (en) A kind of super-intensive networking cell cluster-dividing method
CN105072620A (en) Network visualization-based resource sharing method among service providers
KR101893859B1 (en) Access method and device in heterogeneous network
CN104780614A (en) Channel distribution and user correlation strategy based on AMAB model
KR101247817B1 (en) Network selection system, network selection method and mobile system
CN104581974B (en) Dynamic base-station collaboration method based on orthogonal resource in super-intensive network
CN104053159B (en) The frequency collocation method and device of a kind of Multi-Carrier basestation
KR101319904B1 (en) Optimization method for channel assignment and optimization equipment for channel assignment
CN108200655B (en) Channel selection method and device
CN112839362A (en) Wireless local area network adaptive channel allocation method and device
CN110012472A (en) The centralised allocation method and device of channel and bandwidth
CN106912075B (en) Channel allocation method and device
CN114375589B (en) Network parameter adjusting method and network management equipment
de la Bandera et al. Multinode component carrier management: Multiconnectivity in 5G

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant