CN107071912A - A kind of method and apparatus for distributing channel in a wireless local area network - Google Patents

A kind of method and apparatus for distributing channel in a wireless local area network Download PDF

Info

Publication number
CN107071912A
CN107071912A CN201710247882.5A CN201710247882A CN107071912A CN 107071912 A CN107071912 A CN 107071912A CN 201710247882 A CN201710247882 A CN 201710247882A CN 107071912 A CN107071912 A CN 107071912A
Authority
CN
China
Prior art keywords
ap
set
channel
neighbor
corresponding
Prior art date
Application number
CN201710247882.5A
Other languages
Chinese (zh)
Inventor
陈澄宇
宋敏
Original Assignee
北京星网锐捷网络技术有限公司
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 北京星网锐捷网络技术有限公司 filed Critical 北京星网锐捷网络技术有限公司
Priority to CN201710247882.5A priority Critical patent/CN107071912A/en
Publication of CN107071912A publication Critical patent/CN107071912A/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/309Measuring or estimating channel quality parameters
    • H04B17/318Received signal strength
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/309Measuring or estimating channel quality parameters
    • H04B17/345Interference values
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/04Traffic adaptive resource partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/12Fixed resource partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/06Testing, supervising or monitoring using simulated traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/08Testing, supervising or monitoring using real traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource
    • H04W72/0453Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource the resource being a frequency, carrier or frequency band
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04Wireless resource allocation
    • H04W72/08Wireless resource allocation where an allocation plan is defined based on quality criteria
    • H04W72/082Wireless resource allocation where an allocation plan is defined based on quality criteria using the level of interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/14WLL [Wireless Local Loop]; RLL [Radio Local Loop]

Abstract

The embodiment of the present invention provides a kind of method for distributing channel in a wireless local area network, applied to comprising in the WLAN for constituting the first AP set by least two AP, comprises the following steps:Determine that each AP distinguishes corresponding neighbor AP list in the set, obtain each AP and the optimal value of each neighbor AP co-channel interference in the neighbor AP list in the set, and the corresponding each AP of optimal value channel value, using the channel value as each AP working channel value.Meanwhile, the embodiment of the present invention also provides a kind of device for distributing channel in a wireless local area network.The beneficial effects of the present invention are can quickly be planned channel, channel between the AP that effectively staggers automatically, reduce the co-channel interference of network itself as far as possible, reduce the overhead of network, improve network performance.

Description

A kind of method and apparatus for distributing channel in a wireless local area network

Technical field

The present invention relates to data communication field, especially a kind of method and apparatus for distributing channel in a wireless local area network.

Background technology

In recent years, based on the agreements of IEEE 802.11 WLAN (Wireless Local Area Network, WLAN) fast development with the advantage of its protrusion and ripe technology, is widely used in market, enterprise, hospital, school and meeting The network structions such as field.

IEEE802.11 agreements define WLAN using exempting from ISM (Industrial Scientific Medical) Two frequency ranges of 2.4GHz and 5GHz, using the mechanism of half-duplex operation, based on CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) wireless share and access is provided, i.e., can only be one in same region Equipment is given out a contract for a project in the form of exclusive.However, the resource of frequency spectrum is limited, especially IEEE802.11b and IEEE802.11g marks Accurate wireless network is operated in 2.4-2.4835GHz frequency ranges, and these frequency ranges are divided into 13 channels according to the standard of country, and only The channel of three non-overlapping copies is (such as:1 channel, 6 channels, 11 channels).If the channel rule of access point (Access Point, AP) That draws is unreasonable, co-channel interference can be produced, AP, which vies each other, causes each side all to be kept out of the way, under the handling capacity for causing universe network Drop.And as the terminal device for supporting WLAN is on the increase, customer group quantity steeply rises, the problem of radio spectrum resources are deficient It can increasingly protrude, therefore, rational channel plan be carried out to AP, so as to reduce the co-channel interference of network itself, improve network Performance is necessary.

WLAN lower channels allocative decision can be divided into distributed algorithm and the major class of centralized algorithm two.Distributed control is calculated Method isolated operation in each AP, AP is adjusted correspondingly, with convergence time by perception and measurement to wireless network It is slow and the defect of optimum channel can not be converged to.The control algolithm development of centralization is relatively more ripe, and it operates in a collection Middle control centre, by network global monitoring and measurement, all AP channel being distributed unitedly and being planned, it is ensured that complete Net overall performance is optimal, and this mode is by handling the global network state information of whole net, and the effect of channel distribution is remote It is much better than distributed algorithm, and in WLAN medium-scale scope, centralized algorithm complexity is preferably to be controlled 's.

During using centralized algorithm, each AP scans each channel by eating dishes without rice or wine, and obtains the signal point of different channels around this AP Cloth situation, the bad AP of one channel quality of selection allows this AP according to scan data, one quality more preferably channel of selection is cut Change, and in the process, the working channel of each neighbours of this AP must not be changed, after the completion of channel switching, be uniformly then turned on eating dishes without rice or wine Scanning, carries out the iteration of the second wheel.In the iteration of the second wheel, continue the AP for selecting a present channel quality bad, continue Switching.There is convergence and shake in this scheme, convergence is slow, even not convergent situation.And if by manually carrying out channel distribution, meeting As the change that AP disposes scale is big, Amount of work is huge and easy error, not only needs to consume more human costs, Er Qieren Work planning there is likely to be more uncertainties, e.g., and AP deployment mistakes etc. can cause actual conditions and plan inconsistent.

The content of the invention

In order to solve the above-mentioned technical problem, embodiments of the invention are adopted the following technical scheme that:

It is a kind of in a wireless local area network distribute channel method, applied to comprising by least two AP constitute the first AP gather WLAN in, comprise the following steps:

Determine that each AP distinguishes corresponding neighbor AP list in the set,

Each AP and the optimal value of each neighbor AP co-channel interference in the neighbor AP list in the set are obtained, and it is described The corresponding each AP of optimal value channel value, using the channel value as each AP working channel value.

Optionally, it is described obtain each AP in the set with the neighbor AP list each neighbor AP co-channel interference it is optimal Value, and the corresponding each AP of the optimal value channel value, using the channel value as the working channel value of each AP step Suddenly specifically include:

The neighbor AP in the neighbor AP list is ranked up with corresponding AP distance according to neighbor AP, it is determined that Neighbor AP is according to the corresponding sequence number of the sequence in the neighbor AP list, and the channel for initializing each AP is current each AP work Channel, determines the quantity n that there is P AP combination in the set, wherein, P is more than or equal to 1, less than or equal to the set The positive integer of middle AP quantity, record is chosen any P AP n times from the set and simulated based on respective working channel When changing channel, in the set each AP and sequence number identical neighbor AP described in the corresponding respective neighbor AP list respectively it Between with the presence or absence of co-channel interference Boolean sum, and should with the corresponding set in each AP analog channel value, by institute State n times record in choose and value it is optimal when the set in each AP analog channel value as each AP working channel Value.

Optionally, it is described determine in the set each AP respectively corresponding neighbor AP list the step of specifically include:

The neighbor information that each AP is collected by scanning of eating dishes without rice or wine in the set is obtained, the neighbor information at least includes basic Service set identifier BSSID and corresponding signal intensity RSSI, determines that each AP distinguishes in the set according to the neighbor information Corresponding neighbor AP list.

Optionally, it is described determine in the set each AP respectively corresponding neighbor AP list the step of specifically include:Obtain The distributed intelligence of AP signal of the access terminal of access terminal feedback around the position when detecting AP, according to the signal Distributed intelligence obtains each AP in the set and distinguishes corresponding AP neighborhoods.

Optionally, point of the AP signals around position of the access terminal for obtaining access terminal feedback when detecting AP Cloth information, the step of each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information is specifically wrapped Include:

Each AP is obtained in the set after measurement request is initiated to each association access terminal, each association access terminal passes through AP signal distributions information around the access terminal of the AP feedbacks accessed in the set in each AP, the signal distributions letter Breath at least includes BSSID BSSID and corresponding signal intensity RSSI,

Obtained according to the BSSID corresponding relations for inquiring about the BSSID and present networks AP MAC Address that pre-set The AP of correspondence present networks MAC Address, obtains each AP in the set according to the MAC Address of the AP and distinguishes corresponding AP neighbours Relation.

Optionally, point of the AP signals around position of the access terminal for obtaining access terminal feedback when detecting AP Cloth information, the step of each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information is specifically wrapped Include:

Each AP in the set is obtained to extract after the broadcast probe request message that corresponding access terminal is sent is received Broadcast probe request message in detection information, access terminal broadcast is received in the set in each AP when getting After the detection information that last AP of probe messages is reported, AP around the access terminal is obtained from the detection information and is believed Number distributed intelligence, gather according to the signal distributions acquisition of information in the corresponding AP neighborhoods of each AP difference.

Optionally, the channel value using each AP in set when choosing in described n times record and be worth optimal is used as institute Also include after the step of stating the working channel of an AP:

Repeat described record n times and any P AP moulds based on respective working channel are chosen from the set When intending changing channel, each AP and corresponding each sequence number identical neighbor AP described in the neighbor AP list respectively in the set Between with the presence or absence of co-channel interference Boolean sum, and this and be worth the analog channel value of each AP in the corresponding set, Each AP analog channel value is believed as the work of each AP in the set when chosen from described n times record and value is optimal The step of road value, until the sum chosen in the n record of chosen in the n record of a wheel and value unlike previous round When value is more excellent, terminate described to repeat process.

The embodiment of the present invention further aspect is that also provide it is a kind of in a wireless local area network distribute channel device, application In comprising the WLAN for constituting the first AP set by least two AP, including:

Neighbor list sets up module, for determining that each AP distinguishes corresponding neighbor AP list in the set,

Channel assignment module, for obtaining each AP and each neighbor AP co-channel interference in the neighbor AP list in the set Optimal value, and the corresponding each AP of the optimal value channel value, using the channel value as each AP working channel Value.

Optionally,

The channel assignment module, specifically for being arranged according to neighbor AP with corresponding AP distance the neighbor AP Neighbor AP in table is ranked up, and determines that neighbor AP is according to the corresponding sequence number of the sequence, initialization in the neighbor AP list Each AP channel is current each AP working channel, determines the quantity n that there is P AP combination in the set, wherein, P is More than or equal to 1, less than or equal to the positive integer of AP quantity in the set, record n times and any P AP is chosen from the set When simulation changes channel based on respective working channel, each AP is arranged with corresponding each described neighbor AP respectively in the set It whether there is the sum of the Boolean of co-channel interference between the neighbor AP of sequence number identical described in table, and should be with the corresponding collection Each AP analog channel value in conjunction, the analog channel with value each AP in set when optimal chosen during described n times is recorded It is worth the working channel value as each AP.

Optionally,

The neighbor list sets up module, specifically for obtaining the neighbours that each AP is collected by scanning of eating dishes without rice or wine in the set Information, the neighbor information at least includes BSSID BSSID and corresponding signal intensity RSSI, according to the neighbour Occupy information and determine that each AP distinguishes corresponding neighbor AP list in the set.

Optionally,

The neighbor list sets up module, specifically for obtaining the access terminal of access terminal feedback when detecting AP Position around AP signals distributed intelligence, gather according to the signal distributions acquisition of information in each AP distinguish corresponding AP neighborhoods.

Optionally, the neighbor list is set up module and included:

Signal distributions information acquisition unit, initiates to measure for obtaining each AP in the set to each association access terminal After request, the AP around the access terminal that each association access terminal passes through the AP feedbacks accessed in each AP in the set believes Number distributed intelligence, the signal distributions information at least includes BSSID BSSID and corresponding signal intensity RSSI,

First neighbor list generation unit, for inquiring about the BSSID pre-set and present networks according to the BSSID The corresponding relation of AP MAC Address obtains the AP of correspondence present networks MAC Address, according to being obtained the MAC Address of the AP Each AP distinguishes corresponding AP neighborhoods in set.

Optionally, the neighbor list is set up module and included:

Detection information acquiring unit, the wide of corresponding access terminal transmission is being received for obtaining each AP in the set The detection information in the broadcast probe request message extracted after the probe requests message is broadcast,

Second neighbor list generation unit, for receive the access terminal in the set in each AP wide when get Broadcast after the detection information that last AP of probe messages is reported, AP around the access terminal is obtained from the detection information Signal distributions information, each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.

Optionally, the channel assignment module is additionally operable to:

Repeat described record n times and any P AP moulds based on respective working channel are chosen from the set When intending changing channel, each AP and corresponding each sequence number identical neighbor AP described in the neighbor AP list respectively in the set Between with the presence or absence of co-channel interference Boolean sum, and this and be worth the analog channel value of each AP in the corresponding set, Each AP analog channel value is believed as the work of each AP in the set when chosen from described n times record and value is optimal The step of road value, until the sum chosen in the n record of chosen in the n record of a wheel and value unlike previous round When value is more excellent, terminate described to repeat process.

The another further aspect of the embodiment of the present invention is also to provide a kind of controlled in wireless for distributing channel in a wireless local area network Device, includes the above-mentioned device for distributing channel in a wireless local area network.

The beneficial effect of the embodiment of the present invention is:Channel can quickly be planned, effectively stagger AP automatically Between channel, as far as possible reduce network itself co-channel interference, reduce network overhead, improve network performance.

Brief description of the drawings

In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art The required accompanying drawing used is briefly described, it should be apparent that, drawings in the following description are only some realities of the present invention Example is applied, for those of ordinary skill in the art, on the premise of not paying creative work, can also be according to these accompanying drawings Obtain other accompanying drawings.

Fig. 1 is a kind of method flow diagram of the embodiment of the present invention;

Fig. 2 is a kind of method flow diagram of the embodiment of the present invention;

Fig. 3 is a kind of method flow diagram of the embodiment of the present invention;

Fig. 4 is a kind of method flow diagram of the embodiment of the present invention;

Fig. 5 is a kind of structure drawing of device of the embodiment of the present invention;

Fig. 6 is a kind of structure drawing of device of the embodiment of the present invention;

Fig. 7 is a kind of structure drawing of device of the embodiment of the present invention.

Embodiment

Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made Embodiment, belongs to the scope of protection of the invention.

One embodiment of the invention provides a kind of method for distributing channel in a wireless local area network, applied to comprising by least two Individual AP is constituted in the WLAN of the first AP set, as shown in figure 1, comprising the following steps:

S101, determines that each AP distinguishes corresponding neighbor AP list in the set,

S102, obtains each AP and the optimal value of each neighbor AP co-channel interference in the neighbor AP list in the set, with And the corresponding each AP of optimal value channel value, using the channel value as each AP working channel value.

The beneficial effect of the embodiment of the present invention is:Channel can quickly be planned, effectively stagger AP automatically Between channel, as far as possible reduce network itself co-channel interference, reduce network overhead, improve network performance.

Optionally, as shown in Fig. 2 the step S102 is specifically included:

S1021, is arranged the neighbor AP in the neighbor AP list according to neighbor AP with corresponding AP distance Sequence, determines that neighbor AP is according to the corresponding sequence number of the sequence in the neighbor AP list,

S1023, the channel for initializing each AP is current each AP working channel,

S1025, determines the quantity n that there is P AP combination in the set, wherein, P is, more than or equal to 1, to be less than or equal to The positive integer of AP quantity in the set,

S1027, record is chosen any P AP n times from the set and change is simulated based on respective working channel During channel, each AP is each between sequence number identical neighbor AP described in the neighbor AP list with corresponding respectively in the set The no Boolean and value that there is co-channel interference, and and should be worth the analog channel value of each AP in the corresponding set,

S1029, each AP analog channel value is used as institute in the set when chosen during described n times is recorded and value is optimal State each AP working channel value.

Optionally, on P values, P values generally can be taken as 1,2 or 3, or dynamic select.

Optionally, the channel value using each AP in set when choosing in described n times record and be worth optimal is used as institute Also include after the step of stating the working channel of an AP:Repeat described record n times and any P AP is chosen from the set When simulation changes channel based on respective working channel, each AP is arranged with corresponding each described neighbor AP respectively in the set With the presence or absence of the Boolean of co-channel interference and value between the neighbor AP of sequence number identical described in table, and corresponding institute and should be worth The analog channel value of each AP in set is stated, the simulation with value each AP in set when optimal chosen from described n times record Channel value as each AP working channel value the step of, until one wheel it is described n time record in choose with value unlike preceding One wheel it is described n time record in choose and value it is more excellent when, terminate described in repeat process.

Wherein, repeated by taking turns, often wheel, which repeats selection, can minimize present networks co-channel interference number more Analog channel value scheme, can not find in a wheel is repeated and repeat result more preferably analog channel value than previous round Scheme, repeats stopping, and now each AP analog channel value is final each AP working channel value scheme.In the weight of every wheel , it is necessary to travel through each AP in set in multiple execution, and the channel that AP attempts all permissions of change is simulated, then calculated in simulation Whole net interference number under channel, in a wheel is repeated, finds the analog channel side that energy minimization present networks disturb number Case is repeated as the analog channel scheme currently repeated, and into next round;If all do not believed than present day analog Road scheme more preferably scheme, then repeat stopping.The embodiment of the present invention is expanded on further with reference to concrete application scene:

There are three AP in an AP set:AP1, AP2, AP3.Using 5 channel approach:149,153,157,161,165, The channel of AP1 initializations channel 149, AP2 initialization channels are also 149 channels, and AP3 initialization channels are also 149 channels. According to the power of signal intensity, descending sort neighbor list, then neighborhood ranking results be:

AP1 neighbor list is ordered as the corresponding A P2 of sequence number 1 in AP2, AP3, list, the corresponding A P3 of sequence number 2;

AP2 neighbor list is ordered as the corresponding A P3 of sequence number 1 in AP3, AP1, list, the corresponding A P1 of sequence number 2;

AP3 neighbor list is ordered as the corresponding A P2 of sequence number 1 in AP2, list, and sequence number 2 is without corresponding neighbours.

The bigger neighbours of nearer neighbours namely co-channel interference are placed on before neighbor list, in the data of this set constructor In, the non-AP3 neighbours of AP1, but AP3 is AP1 neighbours.During beginning, because three AP channels are identical, all with frequency, if mutually Then there is co-channel interference each other for neighbours, for sequence number 1, in three neighbor lists, three AP with respective neighbor list All there is co-channel interference in the corresponding neighbor AP of sequence number 1, the corresponding Boolean of sequence number 1 is designated as top1, the corresponding Boolean of sequence number 2 note For top2, the corresponding Boolean of sequence number 3 is designated as top3, and the initial value of three Booleans is 0, if there is 1 co-channel interference, then Boolean adds 1, for three AP, and top1's is that 3, top2 is 2.Because being descending arrangement, the corresponding co-channel interference number of sequence number 1 As maximum co-channel interference number, the corresponding co-channel interference number of sequence number 2 is second largest co-channel interference number, and sequence number 3 is corresponding with frequency It is the third-largest co-channel interference number to disturb number, by that analogy.

The first round performs, and AP1 attempts simulation and switches to above-mentioned 153~165 this 4 channels respectively in order, finds wherein Preferred plan, such as 153 channels (AP1 take it is 157,161 same, here the row of taking above 153.Other AP2 and AP3 are also 149 Channel), top1 is at this moment can obtain for 2 the co-channel interference of other side's serial number 1 in respective neighbor list (AP2 and AP3 each other), Top 2 is 0.AP1 simulations have switched after all channels, and it is current optimal side to record the preferred plan after this simulation switching channel Case, the i.e. channel of 1 working channels of AP 153, AP2 working channels or 149 channels, AP3 working channels or 149 channels, AP 1 are cut Gain after 149 channels before epicycle is performed, then AP2 is also subjected to analog channel switching, 153~165 this 4 letters are attempted in order Road, finds preferred plan for 153 channels (AP1, AP2 also retain former channel, i.e., be all 149 channels), at this moment can obtain top1 is 0, top2 is 1 (AP3 is the co-channel interference of the AP1 serial number in neighbor list 2), because during AP2 simulation switching channels, top1 Value be less than AP1 simulate switching channel when top1 value, then it is assumed that AP2 simulation switching channel scheme better than AP1 simulation cuts Change the scheme of channel, then using this simulation switching channel after scheme as current preferred plan, the i.e. working channels of AP 1 still 149 channels, AP2 working channels are changed into 153 channels, AP3 working channels or 149 channels;Continue at the beginning of recovering AP2 channels to epicycle AP3 is also subjected to analog channel switching again after beginning channel 149,153~165 this 4 channels are attempted in order, it can be found that AP3 For preferred plan when using channel 153, top1 is that 1 (AP2 is AP1 maximum co-channel interference, i.e. AP2 is AP1 in neighbor list The co-channel interference of middle serial number 1), top 2 is that 1 (AP1 is the AP2 second largest co-channel interference, i.e. AP1 is AP2 in neighbours' row The co-channel interference of serial number 2 in table);Because during AP3 simulation switching channels, top1 value is more than AP2 and simulated when switching channel Top1 value, then it is assumed that the scheme of AP2 simulation switching channels simulates the scheme of switching channel better than AP3, from these three AP simulations It can be found that selection AP2 simulations switch to 153 channels to be preferred plan in the scheme of switching, now top 1 is that 0, top 2 is 1, therefore AP1 is used for 149 channels, AP2 is 153 channels, and AP3 is the new working channel after 149 channels are performed as epicycle Scheme, and repeat process into next round.

Accordingly, in another embodiment of the present invention, process is repeated as follows:

The result that each round repeats process is different.Such as, there are 1000 AP in set, in first round implementation procedure In, if once only changing 1 AP channel, that will simulate 1000 kinds of possibility in epicycle execution, and can just find out to minimize The scheme (i.e. optimal case or preferred plan) of co-channel interference, for example, the 900th AP900 is have selected in this 1000 AP, AP900 switches to 1 channel from 6 channel simulations, is this at this moment it can be found that top 1 reduces 7 co-channel interference numbers than initial value Executory preferred plan is taken turns, this wheel terminates, and AP900 working channel is to employ 1 channel;

Then start next round and repeat process, the knot that Cheng Qian has received the first round was repeated in next round Really, i.e. AP900 is in 1 channel, then carries out 1000 analog channel switchings, during next round is repeated, finds AP234 working channel is changed to 6 channels from 1 channel, at this moment it can be found that top 1 also reduces 6 together than last round of value The co-channel interference number that other any AP analog channel switching is brought in frequency interference number, 1000 AP, which is reduced, is all not so good as this AP234 analog channel switching, then the working channel for changing AP234 is 6 channels, and this wheel, which repeats process, to be terminated, this when AP234 working channels become 6 channels, start next round and repeat process.Because AP neighbours are changing, in next round During repeating, it is preferred plan to find that simulation changes AP900 channels from 1 channel to change to 11 channels again, and top 1 is than upper one The value that wheel repeats process also reduces 2 co-channel interference numbers.So change always, until repeating process in certain wheel In, simulation changes 1000 AP any channel, and maximum co-channel interference number top1 repeats process most not less than last round of Big co-channel interference number top1, then the last round of corresponding channel assignment schemes of maximum co-channel interference number top1 for repeating process are i.e. For this final 1000 AP working channel allocative decision.

Optionally, in embodiments of the present invention, top1 priority is more than top2, then more than top3, by that analogy, top2 More than top3, then when the maximum co-channel interference number top1 that epicycle is calculated is identical with the maximum co-channel interference number top1 of last round of calculating When, it can continue to compare the second largest co-channel interference number top2 and the second largest co-channel interference number of last round of calculating of epicycle calculating Top2, if second largest co-channel interference number top2 is not less than the last round of second largest co-channel interference number top2 for repeating process, The then common corresponding channel of the last round of maximum co-channel interference number top1 for repeating process and second largest co-channel interference number top2 Allocative decision is this final 1000 AP working channel allocative decision, by that analogy, it is ensured that in the distribution of final acknowledgement channel During scheme, the co-channel interference higher than the priority of the co-channel interference number top (k) corresponding to the channel assignment scheme that finally confirms Number top (o) are necessary for the minimum value of the corresponding co-channel interference number during last round of repeat, namely optimal value, that is, Say, during optimization top (k) interference, top (o) effects must not be caused to be deteriorated, wherein k is the positive integer more than or equal to 2, o For less than k, the positive integer more than or equal to 1.

In another embodiment of the present invention, the calculating process to top values is as follows:

If having N in m-th of setmIndividual AP, wherein i-th of AP is designated as APi, APiCurrent operating channel be chi, by APi's The strong signal intensity of jth is designated as RSSIij, and by APiThe corresponding neighbor AP numbering for sending the strong signal of jth is perceived to be designated as Neiborij, for convenience of explanation, RSSI and Neibor are set to k × N respectivelymThe matrix of scale, i.e.,:Each AP in set Be up to k neighbours, if the neighbours that AP is perceived can do nothing less than k by lacking in matrix N eibor and RSSI at data Effect filling, if there is some AP neighbours' number in practice more than k, ignores the neighbours having more.Algorithm detailed step is as follows:

Step 1: in initial phase, initialization set m each AP channel is current each AP working channel.

Step 2: calculating the whole net co-channel interference index Int of the k from top 1 to top respectively1, Int2..., Intk.Whole net In jth strong (top j) interference index can be calculated and obtain according to below equation:

Wherein, IntjSmaller expression top j interference is smaller, IntjiFor Boolean, its implication is AP in setiJth Whether near neighbours constitute co-channel interference, if channel is consistent, i.e. chi=cht, then it is considered as co-channel interference, Boolean is 1, if It is not co-channel interference, then Boolean is 0, wherein, in neighbor list, the near neighbours of jth can be understood as sequence in neighbor list Number be j neighbours.Preserve and record IntjEach AP channel approach is global preferred plan when taking currency:

Gbest_Cht=cht,where 1≤t≤NmFormula (3)

Gbest_Intj=Intj, 1≤j of where≤k formula (4)

Wherein, Gbest_ChtFor APtGlobal optimum channel scheme, Gbest_IntjFor the top j of global preferred plan Disturb index.

Step 3: before each round iteration starts, record often wheel iteration local optimum channel approach for it is current it is global most Good channel approach:

Pbest_Cht=Gbest_Cht,where 1≤t≤NmFormula (5)

Pbest_Intj=Gbest_Intj, 1≤j of where≤k formula (6)

Wherein, Pbest_ChtFor APtLocal optimum channel approach, Pbest_IntjFor the top j of local optimum scheme Disturb index.

By way of simulating traversal, any P AP is while change channel in set of computations, if having more preferably that scheme is more New local optimum scheme, i.e.,:, it is necessary to travel through selection in once performingSecondary different AP combinations, mould is used under each combination The method of plan, it is different channel approach that traversal, which changes this P AP,:

chi=new_chi, where i ∈ C (p) and C (p) is a combination of APs formula (7)

Formula (7) represents chiIt is new channel new_ch to change AP channels every timei, wherein, C (P) represents AP set, i Belong to AP set, the selection of channel needs to select non-interfering channel in the channel that AP the country one belongs to allows, such as China 1/6,/11 3 channels can be used in 2.4G, then, it is necessary to which the number of times of at most simulation switching channel is in an AP combination:3 P Power.

Simulation switching channel is required for recalculating all top1~top in region according to formula (1), formula (2) every time K interference, and with local optimum scheme comparison, if the combination of current channel approach is better than local optimum scheme, with current Channel approach updates local optimum channel approach:

Wherein, i is changes the AP numberings of channel, if there is the co-channel interference index after simulation switching channel better than current The corresponding co-channel interference index of local optimum channel approach, i.e.,:If current top j schemes Pbest_IntjBetter than local optimum Top j schemes Intj, and for all preceding j co-channel interference index Intt, all unlike current local optimum scheme same frequency do Disturb index Pbest_InttDifference, then update this scheme for local optimum scheme.

After the completion of a wheel iteration, Pbest_Int turns into the local optimum co-channel interference index in this wheel iteration, Pbest_ Ch turns into local optimum channel approach correspondingly, into step 4.

Step 4: local optimum scheme and global preferred plan are contrasted, if there is formula (9) is met, then according to public affairs It is global preferred plan that formula (10), which updates local optimum scheme, jumps to step 3 repeat step three.

Now, at the end of calculating, each AP channels are exactly to calculate obtained suggestion working channel under this set, optionally, Here acquiescence P takes 2, i.e., in a wheel implementation procedure, can attempt to change any 2 AP channel simultaneously;K takes 20, i.e., at most only Need to consider the co-channel interference of preceding 20 neighbours.

Optionally, the step S101 is specifically included:

The neighbor information that each AP is collected by scanning of eating dishes without rice or wine in the set is obtained, the neighbor information at least includes basic Service set identifier BSSID and corresponding signal intensity RSSI, determines that each AP distinguishes in the set according to the neighbor information Corresponding neighbor AP list.

Wherein, AP report scanning collect neighbor information, the content-form reported be (AP1/radio_x, BSSID, RSSI), it is this signal of RSSI BSSID to be meant that signal intensity has been arrived in AP radio_x scannings.

Discharged because if a signal BSSID is WLAN manager, then it is known that any one Individual AP/radio have issued which BSSID signal, if likewise, a signal is WLAN manager discharges , corresponding AP/radio can be reversely found by BSSID.

Therefore, server or wireless controller AC receive AP and reported after the neighbor information that scanning is collected, if wireless office The signal that discharges of domain net manager, it is signal which AP/radio is released that can be inquired according to BSSID, therefore can be obtained (AP1/radio_x, AP2/radio_y, RSSI) table structure after to conversion, is meant that the AP2 that AP1 radio_x is perceived Radio_y release signal, signal intensity is RSSI.

Optionally, except the AP RSSI between neighbor AP obtained according to scanning determine neighbor list, CSI can also be passed through (Channel State Information channel condition informations) ranging determines neighbor list, or passes through RTT (Round- Trip Time round-trip delays) calculate two-way time determine neighbor list.

Optionally, the step S101 is specifically included:

The distributed intelligence of AP signal of the access terminal of access terminal feedback around the position when detecting AP is obtained, Each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.

Optionally, the AP signals around position of the access terminal for obtaining access terminal feedback when detecting AP Distributed intelligence, gather according to the signal distributions acquisition of information in each AP difference corresponding AP neighborhoods the step of, As shown in figure 3, specifically including:

Each AP to each association access terminal after initiating to measure request in S1011, the acquisition set, and respectively association access is whole Hold the AP signal distributions information around the access terminal by the AP feedbacks accessed in each AP in the set, the signal Distributed intelligence at least includes BSSID BSSID and corresponding signal intensity RSSI,

S1013, the corresponding relation that the BSSID pre-set and AP MAC Address are inquired about according to the BSSID is obtained Corresponding A P MAC Address, obtains each AP in the set according to the MAC Address of the AP and distinguishes corresponding AP neighborhoods.

For example, AP1, which releases signal, includes bssid1, AP1 releases signal and includes bssid2, and AP1 releases signal and included Bssid3,

AP2 releases signal and includes bssid4, and AP2 releases signal and includes bssid5, and AP2 releases signal and includes bssid6,

AP3 releases signal and includes bssid7, and AP3 releases signal and includes bssid8, and AP3 releases signal and includes bssid9,

AP1 scannings can find bssid7 and be sent for AP3 to this signal of bssid7, inquire about advance further according to bssid7 The corresponding relation of the BSSID and AP of setting MAC Address, obtains AP3 MAC Address, then AP3 is exactly AP1 neighbours, and adjacent The distance in residence, can be determined by scanning to signal intensity.

Optionally, the AP signals around position of the access terminal for obtaining access terminal feedback when detecting AP Distributed intelligence, gather according to the signal distributions acquisition of information in each AP difference corresponding AP neighborhoods the step of, As shown in figure 4, specifically including:

S1015, obtains each AP in the set and is receiving the broadcast probe request message that corresponding access terminal is sent Detection information in the broadcast probe request message extracted afterwards,

S1017, when get received in the set in each AP the access terminal broadcast probe message last After the detection information that individual AP is reported, AP signal distributions information around the access terminal is obtained from the detection information,

S1019, each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.

Optionally, in step S1017:Connect when server or access controller AC have collected from each AP in the set Enter after the detection information that terminal is reported, signal strength detection threshold value can be set for RSSI1,10 are set in the present embodiment, will Corresponding detection data higher than this threshold value is extracted,

Optionally, in step S1019, it can be respectively that each AP uses cum rights borda count methods or other modes, extract AP neighbor lists.

Simply, illustrate by taking borda count as an example, the pattern of its similar poll used, accessed by gathering The probe the probe requests messages of terminal set up neighborhood as input, and for each AP, and simply giving tacit consent to each AP weights is 1, it is assumed that:AP1 receives terminal A probe messages, RSSI=50,

AP2 receives terminal A probe messages, RSSI=40,

AP3 receives terminal A probe messages, RSSI=20,

AP4 receives terminal A probe messages, RSSI=10,

According to the size of signal intensity, from access terminal A recently be AP1, secondly AP2, then AP3, AP4.

Take centered on signal intensity most strong AP, be AP1 here, and its signal intensity exceedes specified threshold, otherwise abandons This data.

So according only to this access terminal A probe the probe requests messages intensity, can calculate and obtain each of AP1 Neighbours sort.

AP2 weights are 40+20+10=70;

AP3 weights are 20+10=30;

AP4 weights are 10;

And the normalized doing 0~1 to above-mentioned weights, weights show that more greatly neighbours are nearer, and other AP are not because feel Know probe messages, it is relatively farther, not in neighbor list.

Therefore it is AP2, AP3, AP4 that AP1 neighbours are relatively far and near.

This is the probe data of an access terminal A once, and an access terminal will be sent every few minutes There are a large amount of this data in probe probe messages, network.

Probe probe requests therebies are sent for another access terminal B.The corresponding AP of strongest signal strength is equally taken in The heart, calculates the weights of the neighbours of the AP, is added to the AP and calculated originally on the weights of obtained cumulative neighbours, by that analogy, most The probe data of a large amount of access terminals of experience, can take out each AP neighborhood eventually.

The embodiment of the present invention also provides a kind of device for distributing channel in a wireless local area network, applied to comprising by least two Individual AP is constituted in the WLAN of the first AP set, as shown in figure 5, including:

Neighbor list sets up module 201, for determining that each AP distinguishes corresponding neighbor AP list in the set,

Channel assignment module 203, for obtaining each AP and the same frequency of each neighbor AP in the neighbor AP list in the set The optimal value of interference, and the corresponding each AP of the optimal value channel value, using the channel value as each AP work Channel value.

The beneficial effect of the embodiment of the present invention is:Channel can quickly be planned, effectively stagger AP automatically Between channel, as far as possible reduce network itself co-channel interference, reduce network overhead, improve network performance.

Optionally,

The channel assignment module 203, specifically for according to neighbor AP and the corresponding AP distance to the neighbours Neighbor AP in AP lists is ranked up, and determines in the neighbor AP list neighbor AP according to the corresponding sequence number of the sequence, just Each AP of beginningization channel is current each AP working channel, determines the quantity n that there is P AP combination in the set, wherein, P is, more than or equal to 1, less than or equal to the positive integer of AP quantity in the set, to record n times and any P is chosen from the set When individual AP simulates change channel based on respective working channel, each AP and corresponding each neighbours respectively in the set It whether there is the sum of the Boolean of co-channel interference between sequence number identical neighbor AP described in AP lists, and should be with corresponding institute The analog channel value of each AP in set is stated, the simulation with value each AP in set when optimal chosen during described n times is recorded Channel value as each AP working channel value.

Optionally,

The neighbor list sets up module 201, and scanning collection of eating dishes without rice or wine is passed through specifically for obtaining each AP in the set Neighbor information, the neighbor information at least includes BSSID BSSID and corresponding signal intensity RSSI, according to institute State neighbor information and determine that each AP distinguishes corresponding neighbor AP list in the set.

Optionally,

The neighbor list sets up module 201, specifically for obtaining the access terminal of access terminal feedback in detection The distributed intelligence of AP signals around position during AP, each AP is right respectively in set according to the signal distributions acquisition of information The AP neighborhoods answered.

Optionally, as shown in fig. 6, the neighbor list sets up module 201 includes:

Signal distributions information acquisition unit 2011, is initiated for obtaining each AP in the set to each association access terminal After measurement request, around the access terminal of each association access terminal by the AP feedbacks accessed in each AP in the set AP signal distributions information, the signal distributions information at least includes BSSID BSSID and corresponding signal intensity RSSI,

First neighbor list generation unit 2013, for inquiring about the BSSID pre-set and this according to the BSSID The corresponding relation of the MAC Address of network AP obtains the AP of correspondence present networks MAC Address, is obtained according to the MAC Address of the AP Each AP distinguishes corresponding AP neighborhoods in the set.

Optionally, as shown in fig. 7, the neighbor list sets up module 201 includes:

Detection information acquiring unit 2015, corresponding access terminal transmission is being received for obtaining each AP in the set Broadcast probe request message after detection information in the broadcast probe request message that extracts,

Second neighbor list generation unit 2017, the access is received eventually for working as to get in each AP in the set After the detection information that last AP of end broadcast probe message is reported, the access terminal week is obtained from the detection information AP signal distributions information is enclosed, each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.

Optionally,

The channel assignment module 203 is additionally operable to:

Repeat described record n times and any P AP moulds based on respective working channel are chosen from the set When intending changing channel, each AP and corresponding each sequence number identical neighbor AP described in the neighbor AP list respectively in the set Between with the presence or absence of co-channel interference Boolean sum, and this and be worth the analog channel value of each AP in the corresponding set, Each AP analog channel value is believed as the work of each AP in the set when chosen from described n times record and value is optimal The step of road value, until the sum chosen in the n record of chosen in the n record of a wheel and value unlike previous round When value is more excellent, terminate described to repeat process.

The embodiment of the present invention also provides a kind of wireless controller for distributing channel in a wireless local area network, includes above-mentioned implementation The device and its internal module and unit that distribute channel in a wireless local area network described in example.

The beneficial effect of the embodiment of the present invention is:Channel can quickly be planned, effectively stagger AP automatically Between channel, as far as possible reduce network itself co-channel interference, reduce network overhead, improve network performance.

The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product Figure and/or block diagram are described.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided The processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.

These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which is produced, to be included referring to Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or The function of being specified in multiple square frames.

These computer program instructions can be also loaded into computer or other programmable data processing devices so that in meter Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, thus in computer or The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one The step of function of being specified in individual square frame or multiple square frames.

Finally it should be noted that:The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations;Although The present invention is described in detail with reference to the foregoing embodiments, it will be understood by those within the art that:It still may be used To be modified to the technical scheme described in foregoing embodiments, or equivalent substitution is carried out to which part technical characteristic; And these modification or replace, do not make appropriate technical solution essence depart from various embodiments of the present invention technical scheme spirit and Scope.

Claims (14)

1. a kind of method for distributing channel in a wireless local area network, it is characterised in that applied to comprising being made up of at least two AP In the WLAN of first AP set, comprise the following steps:
Determine that each AP distinguishes corresponding neighbor AP list in the set,
Each AP and the optimal value of each neighbor AP co-channel interference in the neighbor AP list in the set are obtained, and it is described optimal Be worth corresponding each AP channel value, using the channel value as each AP working channel value.
2. the method as described in claim 1, it is characterised in that each AP and the neighbor AP list in the acquisition set In each neighbor AP co-channel interference optimal value, and the corresponding each AP of the optimal value channel value, using the channel value as The step of working channel value of each AP, specifically includes:
The neighbor AP in the neighbor AP list is ranked up with corresponding AP distance according to neighbor AP, it is determined that described Neighbor AP is according to the corresponding sequence number of the sequence in neighbor AP list, the work letter that the channel for initializing each AP is current each AP Road, determines the quantity n that there is P AP combination in the set, wherein, P is more than or equal to 1, less than or equal in the set The positive integer of AP quantity, record, which is chosen any P AP from the set and simulated based on respective working channel for n times, to be changed When becoming channel, each AP is corresponding with difference each described in the neighbor AP list between sequence number identical neighbor AP in the set With the presence or absence of the sum of the Boolean of co-channel interference, and the analog channel value with each AP in the corresponding set is somebody's turn to do, by the n Chosen in secondary record and value it is optimal when the set in each AP analog channel value as each AP working channel value.
3. the method as described in claim 1, it is characterised in that each AP distinguishes corresponding neighbor AP in the determination set The step of list, specifically includes:
The neighbor information that each AP is collected by scanning of eating dishes without rice or wine in the set is obtained, the neighbor information at least includes basic service Set identifier BSSID and corresponding signal intensity RSSI, determines that each AP is corresponded to respectively in the set according to the neighbor information Neighbor AP list.
4. the method as described in claim 1, it is characterised in that each AP distinguishes corresponding neighbor AP in the determination set The step of list, specifically includes:Obtain AP signal of the access terminal of access terminal feedback around the position when detecting AP Distributed intelligence, gather according to the signal distributions acquisition of information in the corresponding AP neighborhoods of each AP difference.
5. method as claimed in claim 4, it is characterised in that the access terminal of the acquisition access terminal feedback is in detection AP When position around AP signals distributed intelligence, according to the signal distributions acquisition of information set in each AP correspond to respectively AP neighborhoods the step of specifically include:
Each AP is obtained in the set after measurement request is initiated to each association access terminal, each association access terminal passes through described AP signal distributions information around the access terminal of the AP feedbacks accessed in set in each AP, the signal distributions information is extremely Include BSSID BSSID and corresponding signal intensity RSSI less,
The BSSID pre-set is inquired about according to the BSSID and obtains corresponding with the corresponding relation of present networks AP MAC Address The AP of present networks MAC Address, obtains each AP in the set according to the MAC Address of the AP and distinguishes corresponding AP neighbours pass System.
6. method as claimed in claim 4, it is characterised in that the access terminal of the acquisition access terminal feedback is in detection AP When position around AP signals distributed intelligence, according to the signal distributions acquisition of information set in each AP correspond to respectively AP neighborhoods the step of specifically include:
Obtain that each AP in the set extracts after the broadcast probe request message that corresponding access terminal is sent is received is wide The detection information in the probe requests message is broadcast, the access terminal broadcast probe is received in the set in each AP when getting After the detection information that last AP of message is reported, AP signals point around the access terminal are obtained from the detection information Cloth information, each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.
7. method as claimed in claim 2, it is characterised in that it is described described n times is recorded in described in when choosing and being worth optimal In set each AP channel value as described AP working channel the step of after also include:
Repeat the record and any P AP is chosen from the set and is simulated based on respective working channel for n times and change When becoming channel, each AP is corresponding with difference each described in the neighbor AP list between sequence number identical neighbor AP in the set With the presence or absence of the sum of the Boolean of co-channel interference, and the analog channel value of each AP in the corresponding set and should be worth, from institute State n times record in choose and value it is optimal when the set in each AP analog channel value as each AP working channel value The step of, until being chosen in the n record of chosen in the n record of a wheel and value unlike previous round with value more When excellent, terminate described to repeat process.
8. a kind of device for distributing channel in a wireless local area network, it is characterised in that applied to comprising being made up of at least two AP In the WLAN of first AP set, including:
Neighbor list sets up module, for determining that each AP distinguishes corresponding neighbor AP list in the set,
Channel assignment module, for obtaining in the set in each AP and the neighbor AP list each neighbor AP co-channel interference most The figure of merit, and the corresponding each AP of the optimal value channel value, using the channel value as each AP working channel value.
9. device as claimed in claim 8, it is characterised in that
The channel assignment module, specifically for according to neighbor AP and the corresponding AP distance in the neighbor AP list Neighbor AP be ranked up, determine in the neighbor AP list that neighbor AP, according to the corresponding sequence number of the sequence, initializes each AP Channel be current each AP working channel, determine the quantity n that there is P AP combination in the set, wherein, P for more than Equal to 1, less than or equal to the positive integer of AP quantity in the set, record n times and any P AP is chosen from the set with each From working channel based on simulation change channel when, in the set each AP with the corresponding respective neighbor AP list respectively It whether there is the sum of the Boolean of co-channel interference between the sequence number identical neighbor AP, and in this and the corresponding set Each AP analog channel value, each AP analog channel value is made in the set when chosen during described n times is recorded and value is optimal For the working channel value of each AP.
10. device as claimed in claim 8, it is characterised in that
The neighbor list sets up module, believes specifically for obtaining the neighbours that each AP is collected by scanning of eating dishes without rice or wine in the set Breath, the neighbor information at least includes BSSID BSSID and corresponding signal intensity RSSI, according to the neighbours Information determines that each AP distinguishes corresponding neighbor AP list in the set.
11. device as claimed in claim 8, it is characterised in that
The neighbor list sets up module, specifically for obtaining position of the access terminal of access terminal feedback when detecting AP The distributed intelligence of the AP signals of surrounding is put, each AP distinguishes corresponding AP neighbours in set according to the signal distributions acquisition of information Occupy relation.
12. device as claimed in claim 11, it is characterised in that the neighbor list, which sets up module, to be included:
Signal distributions information acquisition unit, measurement request is being initiated for obtaining each AP in the set to each association access terminal Afterwards, the AP signals point around the access terminal that each association access terminal passes through the AP feedbacks accessed in each AP in the set Cloth information, the signal distributions information at least includes BSSID BSSID and corresponding signal intensity RSSI,
First neighbor list generation unit, for inquiring about the BSSID pre-set and present networks AP's according to the BSSID The corresponding relation of MAC Address obtains the AP of correspondence present networks MAC Address, and the set is obtained according to the MAC Address of the AP Interior each AP distinguishes corresponding AP neighborhoods.
13. device as claimed in claim 11, it is characterised in that the neighbor list, which sets up module, to be included:
Detection information acquiring unit, the broadcast spy that corresponding access terminal is sent is being received for obtaining each AP in the set The detection information surveyed in the broadcast probe request message extracted after request message,
Second neighbor list generation unit, the access terminal broadcast spy is received for working as to get in each AP in the set Observe and predict after the detection information that last literary AP is reported, AP signals around the access terminal are obtained from the detection information Distributed intelligence, each AP distinguishes corresponding AP neighborhoods in set according to the signal distributions acquisition of information.
14. device as claimed in claim 8, it is characterised in that the channel assignment module is additionally operable to:
Repeat the record and any P AP is chosen from the set and is simulated based on respective working channel for n times and change When becoming channel, each AP is corresponding with difference each described in the neighbor AP list between sequence number identical neighbor AP in the set With the presence or absence of the sum of the Boolean of co-channel interference, and the analog channel value of each AP in the corresponding set and should be worth, from institute State n times record in choose and value it is optimal when the set in each AP analog channel value as each AP working channel value The step of, until being chosen in the n record of chosen in the n record of a wheel and value unlike previous round with value more When excellent, terminate described to repeat process.
CN201710247882.5A 2017-04-17 2017-04-17 A kind of method and apparatus for distributing channel in a wireless local area network CN107071912A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710247882.5A CN107071912A (en) 2017-04-17 2017-04-17 A kind of method and apparatus for distributing channel in a wireless local area network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710247882.5A CN107071912A (en) 2017-04-17 2017-04-17 A kind of method and apparatus for distributing channel in a wireless local area network

Publications (1)

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

Family

ID=59599550

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710247882.5A CN107071912A (en) 2017-04-17 2017-04-17 A kind of method and apparatus for distributing channel in a wireless local area network

Country Status (1)

Country Link
CN (1) CN107071912A (en)

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
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

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

Similar Documents

Publication Publication Date Title
DE69730956T2 (en) Analysis of neighboring cells in cellular telecommunication system
EP2689627B1 (en) Performing coordinated multipoint transmission and reception (comp) in a wireless communication network
US5561841A (en) Method and apparatus for planning a cellular radio network by creating a model on a digital map adding properties and optimizing parameters, based on statistical simulation results
Ishii et al. A novel architecture for LTE-B: C-plane/U-plane split and phantom cell concept
JP3196213B2 (en) Method and apparatus for allocating a frequency to the communication unit
EP0898853A1 (en) Process and device for quality determination in a radio communication system
CN105493547B (en) Method for transmitting synchronizing signal and base station apparatus
US7315533B2 (en) Radio plan generator
CN104272790A (en) Measurement of nodes in coordinated multipoint (comp) systems
EP2728926A1 (en) Load balancing in mobile telecommunications networks
CN101965743B (en) Arrangements for association and re-association in a wireless network
Hills et al. Radio resource management in wireless LANs
JP3063822B2 (en) Adjacent zone information automatically generated method
Necker et al. A graph-based scheme for distributed interference coordination in cellular OFDMA networks
CN104054368B (en) Use the method and device of cognitive radio technology
CN103369539B (en) The method and apparatus of interference coordination
US20170111914A1 (en) Base station frequency resource allocation method and network device
US10390353B2 (en) Distributed channel selection for wireless networks
WO2009070928A1 (en) A method for coordinating the resources between cells
JP2012521144A (en) Transmission frame and resource allocation method for a communication system including a base station
CN103118369A (en) Selection method and equipment of site locations and selection method and equipment of grids
JP2016195455A (en) Method, device and system for switching cells in communication system supporting carrier aggregation
CN102497640A (en) Dynamic configuration method of intensive local area network environment broadband channel
CN103338504B (en) The associating self-configuration method of multiple AP channel and power in WLAN (wireless local area network)
Ma et al. A dynamic affinity propagation clustering algorithm for cell outage detection in self-healing networks

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