CN104066188A - K-screening neighbor channel allocation method based on node degree - Google Patents
K-screening neighbor channel allocation method based on node degree Download PDFInfo
- Publication number
- CN104066188A CN104066188A CN201410328735.7A CN201410328735A CN104066188A CN 104066188 A CN104066188 A CN 104066188A CN 201410328735 A CN201410328735 A CN 201410328735A CN 104066188 A CN104066188 A CN 104066188A
- Authority
- CN
- China
- Prior art keywords
- node
- wifi
- channel
- neighbours
- interference volume
- 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.)
- Granted
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a K-screening neighbor channel allocation method based on the node degree. The allocation method includes the steps that KM devices with the largest node degree are selected from devices in a network and sequentially allocated in the channel with the largest distance, and disturbance variables of corresponding channels are updated; allocated WIFI nodes are rejected out of a topological graph, and remaining WIFI nodes are selected and allocated with the channels according to the process until the number of nodes not allocated in the network is smaller than (K-t)N/K (t=1,2,...,K-1); when the number of the nodes not allocated in the network is smaller than (K-t)N/K, the (K-t) M WIFI devices are selected each time for selection of the nodes and channel allocation until all the WIFI devices are allocated with the channels. The sorting workloads are reduced, a lot of RSSI comparison is not needed, and therefore the time for on-line channel reallocation is greatly shortened when a network topology changes.
Description
Technical field
The present invention relates to wireless communication field, particularly the method for the fast allocation channel based on node degree between WIFI equipment.
Background technology
At wireless communication field, along with the development of radio communication and popularizing of WIFI equipment, the scene demand that need to dispose hundreds and thousands of WIFI equipment.Yet, no matter be 2.4G frequency range or 5.8G frequency range, operational channel quantity is limited often, (so-called highly dense scene in having the highly dense scene of thousands of WIFI, in a finite region, include a large amount of WIFI equipment), on each channel, carry a large amount of equipment, between neighbours WIFI equipment on same channel, receive and dispatch at the same time often phase mutual interference in the process of message, greatly reduce the performance of network, if obviously the neighbor device of phase mutual interference can be dispensed on different channels, will greatly reduce the interference between neighbor device, thereby greatly promote the overall performance of network.Therefore, for WIFI equipment a large amount of under highly dense scene reasonably carries out channel allocation, make to reduce to the full extent conflict, promote as possible the performance of network, there is very important practical value.
There is at present the related algorithm of many channel allocation, wherein iteration, K-Best algorithm, basic thought is for carrying out range traversal to the node of network (or part of nodes) according to the signal strength indication value (RSSI) receiving, and RSSI is converted into power (mW) carries out corresponding algebraic operation, make the total interference volume of system (neighbours' interference volume sum on same channel) cost function minimum, and according to this as a standard, select an optimal channel assignment result.This type of algorithm complexity is large, and in running, CPU usage is high, and the time that each channel allocation takies is longer, simple for network topology structure, the situation performance that WIFI equipment amount is few still can be accepted, but when having more WIFI equipment in network topology, performance is desirable not to the utmost.For channel on-line optimization, algorithm complex is larger for the performance impact of product, how to be different WIFI devices allocation channels fast and efficiently, for wireless communications products, has very important significance.Although the another kind of algorithm based on the sequence of neighbours' number has avoided a large amount of numerous and diverse RSSI values relatively, has promoted to a certain extent the speed of channel allocation, for highly dense scene, its performance remains to be further improved.
Summary of the invention
The deficiency existing for solving prior art, the invention discloses a kind of K-screening neighbours method for channel allocation based on node degree, the present invention is according to the dynamic change of topology of networks and topological structure in highly dense scene, realize fast optimization and the reallocation of different WIFI equipment room channels, and as much as possible promote the performance of network, so that entire system throughput is maximum, and interference volume relative equilibrium on each channel.
For achieving the above object, concrete scheme of the present invention is as follows:
A K-screening neighbours method for channel allocation based on node degree, supposes to contain N node in network, M available channel, and channel quantity M is far smaller than node number N, comprises the following steps:
Step 1: the interference volume ψ on each channel of initialization
i=0,1≤i≤M;
Step 2: select front KM the WIFI node that node degree is the highest by selecting algorithm from N node of network, and this KM WIFI node carried out to descending sort, K is a constant;
Step 3: front M WIFI node is dispensed on a different M channel successively;
Step 4: while being M+1 WIFI node allocated channel, relatively this WIFI node, to the distance of each interchannel, is dispensed to this WIFI node on the maximum channel of distance, upgrades the interference volume ψ of this channel
iif this WIFI node is identical to the distance of several channels, compare the interference volume ψ of same distance channel
i, this WIFI node is dispensed to interference volume ψ
ion minimum channel, and upgrade the now interference volume of this channel, repeat this process until KM WIFI node completes channel allocation;
Step 5: will distribute the WIFI node of channel to reject from topological diagram, and residue WIFI node was selected to front KM the node that node degree is the highest again, and this KM node is carried out to descending sort;
Step 6: the process of repeating step four, step 5, until in network the WIFI node number of unallocated channel be down to (K-t) N/K following (t=1,2 ..., K-1);
Step 7: residue WIFI node is selected to (K-t) M node that node degree is the highest, and should carry out descending sort by (K-t) M equipment;
Step 8: the process of repeating step six, step 7, until all equipment completes channel allocation in network.
In described step 4, WIFI node is to the distance of each interchannel, refer to that in former topology of networks this node is to all the shortest jumping figures between distribution node in each channel, so-called jumping figure, this node arrive destination node the node number of process.
In described step 4, when a new WIFI node is assigned to a certain channel, upgrade the interference volume ψ of this channel
itime, only with this channel on it each other neighbours' WIFI node add up, if newly added on the WIFI node of coming in and this channel, between all WIFI nodes that distributed, be not neighbours, interference volume ψ
iremain unchanged.
Described node degree is neighbours' number of this node in network topological diagram.
When in described step 1, node degree is the calculating of neighbours' number, each WIFI has the transmitting power of oneself, thereby produce a circle that radiation radius is R, other WIFI in this circle can perceive the existence of this WIFI, claim the neighbours of this WIFI for other WIFI in its radiation radius;
Each WIFI node has the service set (Service Set dentifier, SSID) of oneself, and each WIFI detects the number of SSID, is its neighbours' number, also the i.e. node degree of this WIFI.
When in described step 2, interference volume calculates, interference volume refers to the interference relationships between neighbours on same channel, and neighbours' two WIFI can receive signal strength signal intensity indication each other each other, and the unit of this signal strength signal intensity is dBm, passes through formula: mW=10
^(dBm/10) by corresponding interference volume unit conversion, be milliwatt (mW), then carry out accumulation calculating and disturb total amount.
The present invention carries out descending sort for the WIFI filtering out according to node degree at every turn, reduced the workload of sequence, and without a large amount of RSSI comparisons, the time that re-starts online channel allocation when network topology structure changes can be shortened greatly, for the channel allocation under highly dense scene, performance improvement effect is extremely obvious.The application only need to select this node to be allocated, and these nodes are sorted, and can save a large amount of time like this, further reduces algorithm complex, because select node number to be sorted at every turn, is limited.
Beneficial effect of the present invention:
The present invention is directed in radio communication network topology structure complicated under highly dense scene and the dynamic change of topological structure, realize fast channel optimization and the reallocation of WIFI equipment, and as much as possible promote the performance of network, and improve network throughput, keep the equilibrium of disturbing on each channel.This patent is from the node degree of WIFI, by K-, select mechanism, for no more than KM WIFI node, sort at every turn, reduced the workload of sequence, avoided the interference strength of large amount of complex compare and calculate simultaneously, the algorithm complex that greatly reduces algorithm operation, will greatly promote the performance of dynamic tuning, for the channel allocation of WIFI equipment, distributes especially online the very important effect of having played.Therefore there is very strong practical value.
Embodiment:
Below the present invention is described in detail:
A K-screening neighbours method for channel allocation based on node degree, supposes to contain N node in network, M available channel, and channel quantity M is far smaller than node number N, comprises the following steps:
Step 1: the interference volume ψ on each channel of initialization
i=0,1≤i≤M;
Step 2: select front KM the WIFI node that node degree is the highest by selecting algorithm from N node of network, and this KM WIFI node carried out to descending sort, K is a constant;
Step 3: front M WIFI node is dispensed on a different M channel successively;
Step 4: while being M+1 WIFI node allocated channel, relatively this WIFI node, to the distance of each interchannel, is dispensed to this WIFI node on the maximum channel of distance, upgrades the interference volume ψ of this channel
iif this WIFI node is identical to the distance of several channels, compare the interference volume ψ of same distance channel
i, this WIFI node is dispensed to interference volume ψ
ion minimum channel, and upgrade the now interference volume of this channel, repeat this process until KM WIFI node completes channel allocation;
Step 5: will distribute the WIFI node of channel to reject from topological diagram, and residue WIFI node was selected to front KM the node that node degree is the highest again, and this KM node is carried out to descending sort;
Step 6: the process of repeating step four, step 5, until in network the WIFI node number of unallocated channel be down to (K-t) N/K following (t=1,2 ..., K-1);
Step 7: residue WIFI node is selected to (K-t) M node that node degree is the highest, and should carry out descending sort by (K-t) M equipment;
Step 8: the process of repeating step six, step 7, until all equipment completes channel allocation in network.
K is a constant, and its size is relevant with the scale N of network.
In step 3, front M the WIFI node distributing is for the first time assigned on different channels successively, because before distributing for the first time, corresponding channel is unloaded, does not need to carry out the comparison of WIFI and each channel distance.When WIFI individual as M+1 and afterwards carries out channel allocation, need to compare WIFI to the distance of several channels, visible, while proceeding to step 6, on each channel, be not all unloaded, therefore need to carry out the comparison of WIFI and channel distance, therefore in step 6, no longer performed step three.
In step 4, WIFI node is to the distance of each interchannel, refers to that in former topology of networks this node is to all the shortest jumping figures between distribution node in each channel, so-called jumping figure, this node arrive destination node the node number of process.
In step 4, when a new WIFI node is assigned to a certain channel, upgrade the interference volume ψ of this channel
itime, only with this channel on it each other neighbours' WIFI node add up, if newly added on the WIFI node of coming in and this channel, between all WIFI nodes that distributed, be not neighbours, interference volume ψ
iremain unchanged.
Node degree is neighbours' number of this node in network topological diagram.
When in step 1, node degree is the calculating of neighbours' number, each WIFI has the transmitting power of oneself, thereby produce a circle that radiation radius is R, other WIFI in this circle can perceive the existence of this WIFI, claim the neighbours of this WIFI for other WIFI in its radiation radius;
Each WIFI node has the service set (Service Set dentifier, SSID) of oneself, and each WIFI detects the number of SSID, is its neighbours' number, also the i.e. node degree of this WIFI.
When in step 2, interference volume calculates, interference volume refers to the interference relationships between neighbours on same channel, neighbours' two WIFI can receive signal strength signal intensity indication each other each other, the unit of this signal strength signal intensity is dBm, pass through formula: mW=10^ (dBm/10) is milliwatt (mW) by corresponding interference volume unit conversion, then carry out accumulation calculating and disturb total amount.
The present invention is directed in radio communication network topology structure complicated under highly dense scene and the dynamic change of topological structure, realize fast channel optimization and the reallocation of WIFI equipment, and as much as possible promote the performance of network, and improve network throughput, keep the equilibrium of disturbing on each channel.This patent is from the node degree of WIFI, by K-, select mechanism, for no more than KM WIFI node, sort at every turn, reduced the workload of sequence, avoided the interference strength of large amount of complex compare and calculate simultaneously, the algorithm complex that greatly reduces algorithm operation, will greatly promote the performance of dynamic tuning, for the channel allocation of WIFI equipment, distributes especially online the very important effect of having played.Therefore there is very strong practical value.
Claims (5)
1. the screening of the K-based on a node degree neighbours method for channel allocation, supposes to contain N node in network, M available channel, and channel quantity M is far smaller than node number N, it is characterized in that, comprises the following steps:
Step 1: the interference volume ψ on each channel of initialization
i=0,1≤i≤M;
Step 2: select front KM the WIFI node that node degree is the highest by selecting algorithm from N node of network, and this KM WIFI node carried out to descending sort, K is a constant;
Step 3: front M WIFI node is dispensed on a different M channel successively;
Step 4: while being M+1 WIFI node allocated channel, relatively this WIFI node, to the distance of each interchannel, is dispensed to this WIFI node on the maximum channel of distance, upgrades the interference volume ψ of this channel
iif this WIFI node is identical to the distance of several channels, compare the interference volume ψ of same distance channel
i, this WIFI node is dispensed to interference volume ψ
ion minimum channel, and upgrade the now interference volume of this channel, repeat this process until KM WIFI node completes channel allocation;
Step 5: will distribute the WIFI node of channel to reject from topological diagram, and residue WIFI node was selected to front KM the node that node degree is the highest again, and this KM node is carried out to descending sort;
Step 6: the process of repeating step four, step 5, until in network the WIFI node number of unallocated channel be down to (K-t) N/K following (t=1,2 ..., K-1);
Step 7: residue WIFI node is selected to (K-t) M node that node degree is the highest, and should carry out descending sort by (K-t) M equipment;
Step 8: the process of repeating step six, step 7, until all equipment completes channel allocation in network.
2. a kind of K-based on node degree as claimed in claim 1 screens neighbours' method for channel allocation, it is characterized in that, in described step 4, WIFI node is to the distance of each interchannel, refer to that in former topology of networks this node is to all the shortest jumping figures between distribution node in each channel, so-called jumping figure, this node arrive destination node the node number of process.
3. a kind of K-screening neighbours method for channel allocation based on node degree as claimed in claim 1, is characterized in that, in described step 4, when a new WIFI node is assigned to a certain channel, upgrades the interference volume ψ of this channel
itime, only with this channel on it each other neighbours' WIFI node add up, if newly added on the WIFI node of coming in and this channel, between all WIFI nodes that distributed, be not neighbours, interference volume ψ
iremain unchanged.
4. a kind of K-based on node degree as claimed in claim 1 screens neighbours' method for channel allocation, it is characterized in that, when in described step 1, node degree is the calculating of neighbours' number, each WIFI has the transmitting power of oneself, thereby produce a circle that radiation radius is R, other WIFI in this circle can perceive the existence of this WIFI, claim the neighbours of this WIFI for other WIFI in its radiation radius;
Each WIFI node has the service set of oneself, and each WIFI detects the number of service set, is its neighbours' number, also the i.e. node degree of this WIFI.
5. a kind of K-based on node degree as claimed in claim 1 screens neighbours' method for channel allocation, it is characterized in that, when in described step 2, interference volume calculates, interference volume refers to the interference relationships between neighbours on same channel, neighbours' two WIFI can receive signal strength signal intensity indication each other each other, the unit of this signal strength signal intensity is dBm, passes through formula: mW=10^ (dBm/10) is milliwatt (mW) by corresponding interference volume unit conversion, then carries out accumulation calculating and disturbs total amount.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410328735.7A CN104066188B (en) | 2014-07-10 | 2014-07-10 | K-screening neighbor channel allocation method based on node degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410328735.7A CN104066188B (en) | 2014-07-10 | 2014-07-10 | K-screening neighbor channel allocation method based on node degree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104066188A true CN104066188A (en) | 2014-09-24 |
| CN104066188B CN104066188B (en) | 2017-05-10 |
Family
ID=51553661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410328735.7A Expired - Fee Related CN104066188B (en) | 2014-07-10 | 2014-07-10 | K-screening neighbor channel allocation method based on node degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104066188B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3264819A1 (en) | 2016-07-01 | 2018-01-03 | Forsvarets Forskningsinstitutt | Channel selection in unlicensed bands using peer-to-peer communication via the backhaul network |
| US10111114B2 (en) | 2016-07-01 | 2018-10-23 | Maseng As | Channel selection in unlicensed bands using peer-to-peer communication via the backhaul network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050265288A1 (en) * | 2004-05-27 | 2005-12-01 | Jiewen Liu | Apparatus and method capable of automatic allocation of operating channels in a wireless network |
| US20100091731A1 (en) * | 2008-10-13 | 2010-04-15 | Samsung Electronics Co., Ltd. | Channel allocation method and apparatus for wireless communication networks |
| JP2012120039A (en) * | 2010-12-02 | 2012-06-21 | National Institute Of Information & Communication Technology | Wireless communication system and method |
-
2014
- 2014-07-10 CN CN201410328735.7A patent/CN104066188B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050265288A1 (en) * | 2004-05-27 | 2005-12-01 | Jiewen Liu | Apparatus and method capable of automatic allocation of operating channels in a wireless network |
| US20100091731A1 (en) * | 2008-10-13 | 2010-04-15 | Samsung Electronics Co., Ltd. | Channel allocation method and apparatus for wireless communication networks |
| JP2012120039A (en) * | 2010-12-02 | 2012-06-21 | National Institute Of Information & Communication Technology | Wireless communication system and method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3264819A1 (en) | 2016-07-01 | 2018-01-03 | Forsvarets Forskningsinstitutt | Channel selection in unlicensed bands using peer-to-peer communication via the backhaul network |
| US10111114B2 (en) | 2016-07-01 | 2018-10-23 | Maseng As | Channel selection in unlicensed bands using peer-to-peer communication via the backhaul network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104066188B (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8780743B2 (en) | Method and system for improving quality of service in distributed wireless networks | |
| CN104066092B (en) | A kind of frequency spectrum distributing method, device and system | |
| CN102364970B (en) | Implementation method for automatically configuring address of mobile ad hoc network | |
| EP3101933B1 (en) | Physical cell identifier allocation method and apparatus | |
| US10405314B2 (en) | Channel plans for wireless local area networks | |
| CN104540234B (en) | A kind of associated task scheduling mechanism synchronously constrained based on CoMP under C RAN frameworks | |
| CN103596182A (en) | Method for managing spectrum resources in D2D communications | |
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| CN108696929A (en) | A kind of method and apparatus of dynamic adjustment CCA energy detection thresholds | |
| US20180295623A1 (en) | Communications between connected devices | |
| CN102065437A (en) | Graph coloring-based wireless frequency allocation working method | |
| CN103747530A (en) | Wireless Mesh network channel allocation system and wireless Mesh network channel allocation method under partially overlapped channels | |
| CN103997790B (en) | A kind of wlan device dynamic channel assignment method based on alliance | |
| WO2016058448A1 (en) | Frequency band allocation method and device | |
| Xin et al. | Dynamic spectrum access as a service | |
| CN103945549A (en) | Baseband processing resource allocation system under C-RAN architecture | |
| CN104066188A (en) | K-screening neighbor channel allocation method based on node degree | |
| CN106171007B (en) | A kind of method, apparatus and terminal of determining reselection target cell | |
| CN105959974B (en) | A kind of method and apparatus for predicting bandwidth of air-interface | |
| CN102378193A (en) | Spectrum assignment method and device | |
| CN104023404B (en) | A kind of method for channel allocation based on neighbours' quantity | |
| CN104509133A (en) | Method, base station and user terminal of transmitting signal in device-to-device approach service | |
| CN103813343B (en) | Distribute the method and device of member carrier | |
| CN103347101A (en) | 6LoWPAN wireless sensor network address configuration method based on cluster | |
| CN107645776A (en) | The method for releasing and device of a kind of share spectrum resources |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170510 Termination date: 20180710 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |