CN103997790B - A kind of wlan device dynamic channel assignment method based on alliance - Google Patents
A kind of wlan device dynamic channel assignment method based on alliance Download PDFInfo
- Publication number
- CN103997790B CN103997790B CN201410200827.7A CN201410200827A CN103997790B CN 103997790 B CN103997790 B CN 103997790B CN 201410200827 A CN201410200827 A CN 201410200827A CN 103997790 B CN103997790 B CN 103997790B
- Authority
- CN
- China
- Prior art keywords
- dfs
- node
- subgraph
- nodes
- segmentation
- 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
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention is a kind of wlan device dynamic channel assignment method based on alliance, and its step is：DFS control nodes collect the information such as present channel, the neighbor AP node ID of AP nodes of safeguarding, produce DFS network topological diagrams；It is divided into independent connected subgraph, final segmentation subgraph to form DFS packets DFS network topological diagrams；For the DFS packets for not having boundary segmentation node, start node of total received signal strength highest node as dynamic channel selection algorithm in selection group；For the DFS packets for there are multiple boundary segmentation nodes, total received signal strength highest spliting node is selected as dynamic channel selection algorithm start node；From the beginning of start node, the total received signal strength highest neighbours of prioritizing selection carry out Channel assignment.The present invention accelerates the convergence rate of whole net dynamic channel adjustment by group technology, shortens Channel assignment convergence time.
Description
Technical field
The present invention relates to areas of information technology, and in particular to a kind of field of WLAN.
Background technology
Wireless connection service as high speed can be provided, WLAN (Wireless Local Access Network, nothing
Line LAN) it is one of current IT (Information Technology, information technology) more popular technology of industry, and
Popular wireless access way.WLAN generally adopts centralized AC (Access Controller, wireless controller)-AP
(Access Point, WAP) framework.AC provide wlan network centralized management, AP then by and AC establish the link add
Wirelessly access (as shown in Figure 1) is provided after entering wlan network.
In wireless application, due to causing wireless signal to exist the problems such as radio signal propagation is by surrounding environment influence, multipath
There is extremely complex relaxation phenomenon on different directions, the enforcement of wlan network generally requires the careful network planning.Even if
After successful deployment wireless network, the parameter adjustment of application stage is still essential, this is because wireless environment is constantly to become
Change, interference for bringing such as mobile barrier, the micro-wave oven for working etc. all may cause shadow to the propagation of wireless signal
Ring, so the radio frequency resource such as channel, transmission power allows for dynamically adjusting adapting to the change of user environment.Such tune
It is complicated, the abundant technical experience of needs and regularly manual detection to have suffered journey, undoubtedly causes very high management cost.
RRM (WLAN RRM, WLAN Radio Resource Management) is a kind of upgradeable intelligence
Energy Radio Frequency Management solution, by " collection (AP real-time collecting radio frequency environment information)->Analysis (the data that AC is collected to AP
It is analyzed assessment)->Decision-making (according to analysis result, AC plans as a whole distribution letter and transmit power)->Perform (AP execution AC settings
Configuration, carry out radio frequency resource tuning) " method, there is provided the real-time intelligent Radio Frequency Management scheme of set of system, make wireless network
Network can rapidly adapt to wireless environment variation, keep optimum radio frequency resource state.As AP only has the letter of 3 non-overlapping copies
Road, in order to reduce interference, must be used alternatingly these three non-interfering channels as far as possible, thus there is channel distribution and ask between AP
Topic.Mainly there are two kinds of Channel distribution modes at present：
1) manual assignment channel：According to AP deployed positions, administrative staff are manually set the channel of AP, so as to reduce between AP
Signal is disturbed.
2) dynamic channel is selected：Dynamic channel selects (DFS) defined in 802.11h, is RRM (WLAN
RRM it is used for solving WLAN channel disturbances in), reduces the real-time dynamic adjustment channel approach of Radio frequency interference.
Manual assignment channel is only applicable to as AP quantity is few, or some special screnes such as AP linear deployments, with AP portions
The increase of administration's scale, AP overlay areas and overlay network complexity also expand rapidly, and manual assignment channel complexity is difficult to walk, it is easy to go out
Mistake, and network topology change and external interference cannot be timely responded to.One when dynamic channel selection is Scaledeployment is feasible
Scheme.But 802.11h standards do not provide the specific algorithm of dynamic channel selection.The dynamic channel choosing of current numerous manufacturers
It is all, from the beginning of an AP, to be progressively diffused into whole DFS groups to select scheme.Current DFS schemes solve small-scale covering and do not ask
Topic, but for the extensive covering scene such as operator under, whole net convergence time is oversize, adds wireless environment variation impact, very
May extremely cause convergence process vibration more than.Therefore need for network to be divided into multiple DFS groups, it is synchronous between group based on DFS groups
Enter the selection of Mobile state dynamic channel, to reduce convergence time.Manual segmentation DFS groups are unable to real-time response environmental change, and split
It is theoretically unsound, has certain subjectivity.
The content of the invention
The purpose of the present invention is that when solving Scaledeployment AP, Dynamic Packet and Channel assignment are asked by designing a kind of method
Topic.The present invention provides a kind of automatic segmentation DFS prescription methods based on alliance, for dynamic implement during Scaledeployment WLAN
DFS is grouped to accelerate the convergence rate of whole net dynamic channel adjustment.
Above-mentioned purpose to be reached, present invention employs following technical scheme：
1.DFS control nodes are collected and safeguard that the present channel of AP nodes, neighbor AP node ID, neighbor AP node receive signal
The information such as intensity, produce DFS network topological diagrams；
2.DFS network topological diagram partitioning algorithms：First according to signal strength threshold, DFS network topological diagrams are divided into solely
Vertical connected subgraph；Then layering segmentation is proceeded by from outer layer in subgraph, final segmentation subgraph forms DFS packets；
3.DFS is grouped dynamic channel selection algorithm start node selection algorithm：For the DFS for not having boundary segmentation node point
Group, start node of total received signal strength highest node as dynamic channel selection algorithm in selection group；For only one
The DFS packets of individual boundary segmentation node, select spliting node as the start node of dynamic channel selection algorithm；It is multiple for having
The DFS packets of boundary segmentation node, select the spliting node of total received signal strength highest as dynamic channel selection algorithm
Start node；
4.DFS is grouped dynamic channel selection algorithm：From the beginning of start node, spread to neighbours step by step, prioritizing selection always connects
Receiving signal strength signal intensity highest neighbours carries out Channel assignment.
The present invention provides a kind of automatic segmentation DFS prescription methods based on alliance, for moving during Scaledeployment WLAN
State realizes that DFS is grouped, and relative to configured tunneling, reduces management workload, dynamic response environmental change；Relative to tradition
Dynamic channel select, the present invention accelerates the convergence rate of whole net dynamic channel adjustment by group technology, shortens channel
Select convergence time.
Description of the drawings
Fig. 1 is the wirelessly access schematic diagram for being provided at present.
Fig. 2 is technical scheme schematic diagram.
Specific embodiment
The present invention provides a kind of technical scheme, and dynamic select carries out AP packets, and in the interior dynamically distributes channel of group.Such as Fig. 2
Shown, in AC-AP frameworks, DFS control nodes can be deployed on AC, or deployment is on the server, it is also possible to independent shape
Into product.In non-AC-AP frameworks as in pure FAT AP networks, DFS control nodes can dispose on the server or individually shape
Into product.The information of DFS control node periodic harvest AP, including RSSI, crc error rate, number of retransmissions, the bit error rate etc., shape
Into network topological diagram；Running optimizatin strategy, splits to network topological diagram, and the topological subgraph after segmentation forms DFS packets；
In DFS packets, selected root node, starts to carry out Channel assignment successively from root node.
The present invention provides a kind of automatic segmentation DFS prescription methods based on alliance, and its concrete technical scheme is as follows：
1.DFS control nodes trigger AP passive listenings or actively inquire after neighborhood；
2.AP by collect neighbor AP information reporting give DFS control nodes, these information include present channel CH, RSSI,
Crc error rate, number of retransmissions, the bit error rate；
3.DFS control nodes periodically calculate whole net AP neighborhoods, the summit V with AP as network topological diagram, AP neighbours
Between line as the side E in network topological diagram, the received signal strength RSSI of neighbor AP as in network topological diagram while E while
Value I, safeguards network topological diagram, is denoted as G={ V, E }；
4. couple network topological diagram G is split：
A) all boundary values are carried out less than given threshold value RSSI_MIN with the disconnection on side, network topology sub-collective drawing { G is formedi|i
=1 ..., n }, it is connection inside each topological subgraph, between topological subgraph, no side is attached, and meets Gi∩Gj=
0,i≠j；∪Gi=G, i=1...n,
B) calculate GiIn each node VjSide number NEvj, per side EvjkCorresponding boundary values Ivjk, calculate GiIn each node Vj
Total received signal strength Ivj=∑ Ivjk(wherein k=1to NEvj)；
C) traverses network topology sub-collective drawing, to any one topological subgraph G thereini
If d) GiIn total nodes NViLess than given max-thresholds NV_MAX, then to GiStop segmentation, GiIt is exactly one
Individual DFS packets；Return to step c, continues next subgraph；
E) to subgraph GiSplit, found nodes NV_MIN≤NVi*≤ NV_MAX, and have with remainder and only have
Sub-collective drawing { the G that one side is connectedij| j=1...n }, the summit V on the side that is connectedijConstitute the spliting node between subgraph, remainder
Constitute subgraph Gi'；
If f) sub-collective drawing { Gij| j=1...n } for sky, represent subgraph GiIt is indivisible, whole subgraph GiAs one
DFS is grouped.Return to step c, continues next subgraph；
If g) Gi' it is empty or Gi' nodes NVi'≤NV_MAX, then sub-collective drawing { Gij| j=1...n } and Gi' structure
Into subgraph GiDFS components cut, subgraph GiSegmentation is completed, return to step c, continues next subgraph；
If h) Gi' nodes NVi'>NV_MAX；Return to step e, to Gi' proceed segmentation；
5., after the completion of splitting, DFS control nodes carry out dynamic channel adjustment in each DFS group；
6. for the DFS packets for not having boundary segmentation node, total received signal strength highest node conduct in selection group
The start node of dynamic channel selection algorithm；For the DFS of only one of which boundary segmentation node is grouped, spliting node conduct is selected
The start node of dynamic channel selection algorithm；For the DFS packets for there are multiple boundary segmentation nodes, total received signal strength is selected
The spliting node of highest is used as dynamic channel selection algorithm start node；
7. each channel conditions for being scanned according to present node, the channel for selecting an interference minimum, as oneself
Channel；
8. the maximum node (not including adjusted node) of total received signal strength in present node neighbours is selected, is returned
Step 7 is returned, until all nodes complete channel adjustment.
Summarize the key point of the present invention：
1.DFS control nodes are collected and safeguard that the present channel of AP nodes, neighbor AP node ID, neighbor AP node receive signal
The information such as intensity, produce DFS network topological diagrams；
2.DFS network topological diagram partitioning algorithms：First according to signal strength threshold, DFS network topological diagrams are divided into solely
Vertical connected subgraph；Then layering segmentation is proceeded by from outer layer in subgraph, final segmentation subgraph forms DFS packets；
3.DFS is grouped dynamic channel selection algorithm start node selection algorithm：For the DFS for not having boundary segmentation node point
Group, start node of total received signal strength highest node as dynamic channel selection algorithm in selection group；For only one
The DFS packets of individual boundary segmentation node, select spliting node as the start node of dynamic channel selection algorithm；It is multiple for having
The DFS packets of boundary segmentation node, select the spliting node of total received signal strength highest as dynamic channel selection algorithm
Start node；
4.DFS is grouped dynamic channel selection algorithm：From the beginning of start node, spread to neighbours step by step, prioritizing selection always connects
Receiving signal strength signal intensity highest neighbours carries out Channel assignment.
The present invention is for traditional-handwork channel configuration complexity, workload is big and dynamic channel selects single start node, receives
The problem of time length is held back, conventional dynamic channel selecting method is optimized, by active collection AP nodal information, dynamic carries out DFS
Packet, and dynamic channel selection is carried out in packet, greatly shorten channel adjustment convergence time.
Claims (2)
1. a kind of wlan device dynamic channel assignment method based on alliance, its step is：
(1) .DFS control nodes collect that to safeguard that the present channel of AP nodes, neighbor AP node ID, neighbor AP node receive signal strong
The information such as degree, DFS control nodes periodically calculate whole net AP neighborhoods, the summit V with AP as network topological diagram, AP neighbours it
Between line as the side E in network topological diagram, the boundary values of the received signal strength RSSI of neighbor AP as side E in network topological diagram
I, produces DFS network topological diagrams；
(2) .DFS network topological diagrams partitioning algorithm：First according to signal strength threshold, DFS network topological diagrams are divided into into independence
Connected subgraph, i.e. the disconnection on side is carried out less than given threshold value RSSI_MIN to all boundary values, network topology sub-collective drawing is formed
{Gi| i=1 ..., n }, it is connection inside each topological subgraph, between topological subgraph, no side is attached, and meets Gi∩
Gj=0, i ≠ j；∪Gi=G, i=1...n；Then layering segmentation is proceeded by from outer layer in subgraph：A. traverses network is topological
Sub-collective drawing, to any one topological subgraph G thereini；If b. GiIn total nodes NViLess than given max-thresholds NV_
MAX, then to GiStop segmentation, GiIt is exactly a DFS packet；Return to step a, continues next subgraph；C. to subgraph GiCarry out point
Cut, find nodes NV_MIN≤NVi*≤ NV_MAX, and the sub-collective drawing { G being connected with one and only one side of remainderij|j
=1...n }, the summit V on the side that is connectedijThe spliting node between subgraph is constituted, remainder constitutes subgraph Gi'；If d. sub-collective drawing
{Gij| j=1...n } for sky, represent subgraph GiIt is indivisible, whole subgraph GiUsed as a DFS packet, return to step a continues
Next subgraph；If e. Gi' it is empty or Gi' nodes NVi'≤NV_MAX, then sub-collective drawing { Gij| j=1...n } and Gi'
Constitute subgraph GiDFS components cut, subgraph GiSegmentation is completed, return to step a, continues next subgraph；Final segmentation spirte
It is grouped into DFS；
(3) .DFS packets dynamic channel selection algorithm start node selection algorithm：For the DFS for not having boundary segmentation node point
Group, start node of total received signal strength highest node as dynamic channel selection algorithm in selection group；For only one
The DFS packets of individual boundary segmentation node, select spliting node as the start node of dynamic channel selection algorithm；It is multiple for having
The DFS packets of boundary segmentation node, select the spliting node of total received signal strength highest as dynamic channel selection algorithm
Start node；
(4) .DFS packets dynamic channel selection algorithm：From the beginning of start node, spread to neighbours step by step, prioritizing selection is always received
Signal strength signal intensity highest neighbours carry out Channel assignment.
2. dynamic channel assignment method according to claim 1, which concretely comprises the following steps：
(1) .DFS control nodes trigger AP passive listenings or actively inquire after neighborhood；
(2) the neighbor AP information reporting collected is given DFS control nodes by .AP, and these information include present channel CH, RSSI, CRC
Error rate, number of retransmissions, the bit error rate；
(3) .DFS control nodes periodically calculate whole net AP neighborhoods, the summit V with AP as network topological diagram, AP neighbours it
Between line as the side E in network topological diagram, the boundary values of the received signal strength RSSI of neighbor AP as side E in network topological diagram
I, safeguards network topological diagram, is denoted as G={ V, E }；
(4). network topological diagram G is split：
A) all boundary values are carried out less than given threshold value RSSI_MIN with the disconnection on side, network topology sub-collective drawing { G is formedi| i=
1 ..., n }, it is connection inside each topological subgraph, between topological subgraph, no side is attached, and meets Gi∩Gj=0, i
≠j；∪Gi=G, i=1...n；
B) calculate GiIn each node VjSide number NEvj, per side EvjkCorresponding boundary values Ivjk, calculate GiIn each node VjIt is total
Received signal strength Ivj=∑ Ivjk, wherein k=1 to NEvj；
C) traverses network topology sub-collective drawing, to any one topological subgraph G thereini；
If d) GiIn total nodes NViLess than given max-thresholds NV_MAX, then to GiStop segmentation, GiIt is exactly a DFS
Packet；Return to step c, continues next subgraph；
E) to subgraph GiSplit, found nodes NV_MIN≤NVi*≤ NV_MAX, and with remainder one and only one
Sub-collective drawing { the G that side is connectedij| j=1...n }, the summit V on the side that is connectedijThe spliting node between subgraph is constituted, remainder is constituted
Subgraph Gi'；
If f) sub-collective drawing { Gij| j=1...n } for sky, represent subgraph GiIt is indivisible, whole subgraph GiAs a DFS point
Group, return to step c continue next subgraph；
If g) Gi' it is empty or Gi' nodes NVi'≤NV_MAX, then sub-collective drawing { Gij| j=1...n } and Gi' constitute son
Figure GiDFS components cut, subgraph GiSegmentation is completed, return to step c, continues next subgraph；
If h) Gi' nodes NVi'>NV_MAX；Return to step e, to Gi' proceed segmentation；
(5). after the completion of segmentation, DFS control nodes carry out dynamic channel adjustment in each DFS group；
(6). for the DFS packets for not having boundary segmentation node, in selection group, total received signal strength highest node is used as dynamic
The start node of state channel selection algorithm；For the DFS of only one of which boundary segmentation node is grouped, spliting node is selected as dynamic
The start node of state channel selection algorithm；For the DFS packets for there are multiple boundary segmentation nodes, total received signal strength is selected most
High spliting node is used as dynamic channel selection algorithm start node；
(7). according to each channel conditions that present node is scanned, the channel for selecting an interference minimum, as the letter of oneself
Road；
(8). select the maximum node of total received signal strength in present node neighbours, return to step 7, until all nodes are completed
Channel adjustment, in selected present node neighbours, the maximum node of total received signal strength does not include adjusted section
Point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410200827.7A CN103997790B (en) | 2014-05-13 | 2014-05-13 | A kind of wlan device dynamic channel assignment method based on alliance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410200827.7A CN103997790B (en) | 2014-05-13 | 2014-05-13 | A kind of wlan device dynamic channel assignment method based on alliance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103997790A CN103997790A (en) | 2014-08-20 |
| CN103997790B true CN103997790B (en) | 2017-04-05 |
Family
ID=51311761
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410200827.7A Active CN103997790B (en) | 2014-05-13 | 2014-05-13 | A kind of wlan device dynamic channel assignment method based on alliance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103997790B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016129974A1 (en) | 2015-02-13 | 2016-08-18 | Samsung Electronics Co., Ltd. | Transmitting apparatus and receiving apparatus and controlling method thereof |
| KR101777215B1 (en) | 2015-02-13 | 2017-09-11 | 삼성전자주식회사 | Transmitting apparatus and receiving apparatus and controlling method thereof |
| TWI613925B (en) * | 2016-07-04 | 2018-02-01 | 智易科技股份有限公司 | Method and system for selecting communication interface for specific purpose |
| CN108200577B (en) * | 2017-12-28 | 2021-08-24 | 浙江中智海通信科技有限公司 | Wireless free interconnection bidirectional authentication and separation type SSID design method |
| CN109510675A (en) * | 2018-12-24 | 2019-03-22 | 深圳市潮流网络技术有限公司 | A kind of automatic channel selection method of multiple spot AP |
| CN111669830B (en) * | 2020-05-19 | 2023-07-25 | 上海芯袖微电子科技有限公司 | WLAN communication method and device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132600A (en) * | 2006-08-21 | 2008-02-27 | 财团法人工业技术研究院 | Dynamic channel allocation method and device in wireless network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060072602A1 (en) * | 2004-10-05 | 2006-04-06 | Cisco Technology, Inc. | Method and apparatus for least congested channel scan for wireless access points |
-
2014
- 2014-05-13 CN CN201410200827.7A patent/CN103997790B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132600A (en) * | 2006-08-21 | 2008-02-27 | 财团法人工业技术研究院 | Dynamic channel allocation method and device in wireless network |
Non-Patent Citations (3)
| Title |
|---|
| An Improved Distributed Dynamic Channel;M. Drieberg, Fu-Chun Zheng, R, Ahmad;《Communications and Signal Processing》;20071231;全文 * |
| Dynamic Channel Assignment in IEEE 802.11 Networks;R. AKI and A. Arepally;《IEEE International Conference》;20071231;全文 * |
| WLAN分布式动态信道分配算法研究;申大伟;《无线互联科技》;20140213;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103997790A (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103997790B (en) | A kind of wlan device dynamic channel assignment method based on alliance | |
| CN103338504B (en) | The associating self-configuration method of multiple AP channel and power in WLAN (wireless local area network) | |
| CN108370576A (en) | Method and system for executing network slice in wireless access network | |
| US10505807B2 (en) | Network coordination apparatus | |
| CN102098799B (en) | Intelligent cognitive wireless network system for realizing heterogeneous network convergence | |
| CN101667874B (en) | Method and system for partial cooperative spectrum sensing | |
| US10172142B2 (en) | Interference coordinator method and device | |
| CN104955077A (en) | Heterogeneous network cell clustering method and device based on user experience speed | |
| CN103826306B (en) | A kind of descending dynamic interference coordination method in highly dense set network based on game | |
| CN107071912A (en) | A kind of method and apparatus for distributing channel in a wireless local area network | |
| US20170353863A1 (en) | Resource Management Method and Radio Access Network Node | |
| CN107070626A (en) | A kind of method and apparatus for carrying out carrier aggregation processing | |
| US10848981B2 (en) | System and method for scalable radio network slicing | |
| CN103648168B (en) | Combined type dynamic spectrum distribution method in heterogeneous network convergence scene | |
| Iacoboaiea et al. | SON Coordination for parameter conflict resolution: A reinforcement learning framework | |
| CN102364893A (en) | Reconfiguration management plane based on cognitive network and reconfiguration method | |
| WO2016058448A1 (en) | Frequency band allocation method and device | |
| US20220110045A1 (en) | Method for enhancing network coverage based on adaptive generation of resource cell | |
| CN107318150A (en) | A kind of user of LTE U autonomous systems is resident flow | |
| CN104053159B (en) | The frequency collocation method and device of a kind of Multi-Carrier basestation | |
| CN104080088A (en) | Method and device of channel allocation | |
| CN103686675A (en) | Method and device for adjacent region configuration | |
| CN103889005A (en) | Coordinated multi-point transmission scheduling method and device | |
| CN105246088A (en) | Base station and adjacent cell list configuration method | |
| CN106817185A (en) | A kind of root sequence optimisation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |