CN104080088B - A kind of method for channel allocation and device - Google Patents
A kind of method for channel allocation and device Download PDFInfo
- Publication number
- CN104080088B CN104080088B CN201310101899.1A CN201310101899A CN104080088B CN 104080088 B CN104080088 B CN 104080088B CN 201310101899 A CN201310101899 A CN 201310101899A CN 104080088 B CN104080088 B CN 104080088B
- Authority
- CN
- China
- Prior art keywords
- node
- candidate nodes
- channel
- link
- collection
- 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 invention discloses a kind of method for channel allocation and device, main contents are：It is determined that both candidate nodes collection corresponding with each node in wireless mesh network, according to constraints, determines all both candidate nodes collection channel assignment schemes；A channel assignment scheme is therefrom selected, under the channel assignment scheme of selection, the link interference between all both candidate nodes collection is minimum, regard the channel as each both candidate nodes collection distribution belonging to node as the channel to the node distribution.Due to using both candidate nodes to integrate as channel distribution unit, and the channel assignment scheme of selection is the both candidate nodes collection channel assignment scheme for making the link interference between all both candidate nodes collection minimum, finally, channel assignment scheme further according to both candidate nodes collection determines the channel assignment scheme of node, therefore, the channel assignment scheme of the node of acquisition reduces the route conflict between both candidate nodes collection, while retaining both candidate nodes and eavesdropping chance, multi channel concurrent transmission has been taken into account, and then has improved the handling capacity of channel.
Description
Technical field
The present invention relates to wireless mesh network technology field, more particularly to a kind of method for channel allocation and device.
Background technology
Multi-hop wireless network is WLAN（Wireless Local Area Networks, WLAN）Extension, energy
Effectively make up that WLAN coverage is small, transmission range is limited, free networking and the problem of constructional difficulties, with more small configuration into
This, more large coverage can provide the network insertion service of economy.How by effective technological means, such as Routing Protocol and
Channel distribution is the popular domain received much concern all the time come the capacity that lifts multi-hop wireless network.
Wherein chance route is emerging routing mode in multi-hop wireless network, and it utilizes wireless medium broadcast nature and many
User diversity, the next-hop of route is not determined in advance, and direct broadcast transmission packet may around have multiple neighbor nodes all just
Acknowledgement is to packet.Certain coordination is carried out between the node of packet is received, by one of them section from destination node most " near "
Point continues to forward.Certainly not all node is involved in, and chance route is participated in by certain rule selection part therein,
These selected neighbor nodes are referred to as both candidate nodes or candidate's forward node.Through multi-party verification, preset with only one of which
Traditional fixed route of next-hop is compared, and chance route is this to forward the mode of packet to be suitable for using multiple both candidate nodes
Insecure Radio Link, can especially make full use of the Radio Link of remote and high Loss Rate, can be obviously improved multi-hop wireless
The end-to-end handling capacity of network, especially wireless mesh network.
However, a pair of multiple transmission modes of chance route to carry out channel point using existing unified channel distribution method
Match somebody with somebody or during compatible with traditional routing conventional channel distribution method, exist channel distribution handling capacity it is not high the problem of.
For example：Each node is equipped with 2 less radio-frequencies in the network topology of 4 nodes, and number of available channels is 3.Save in source
Point is S, and destination node is D, and S both candidate nodes are D, A, B.Fig. 1 minimizes the channel distribution result of link interference, figure for tradition
2 be unified channel allocation result, and all nodes all use in identical channel, example all nodes all only using letter in network
Road 1 and channel 2.Wherein, the dotted line side between node represents that the value on link, side is link packet delivery fraction, and solid line represents channel C1,
Dotted line with any represents channel C2, and the dotted line that 2 points of band represents channel C3.Handling capacity can be route using many radio frequency multichannel machines
EMORE analysis models are analyzed the handling capacity under two kinds of channel distributions, and the handling capacity of conventional channel distribution is up to 0.5, system
One channel distribution is up to 0.6475.
The multi channel concurrent transmission of conventional channel Distribution utilization is passed as can be seen from Figure 1 to obtain higher handling capacity
Following shortcoming is likely to occur after system channel distribution：1）Cut-out node and the link of some both candidate nodes, such as link AB, this is node
There is no what shared channel was caused with both candidate nodes；2）When being sent with certain channel, both candidate nodes number is tailed off, and such as S is sent with C1, B
Its both candidate nodes can not be turned into, both candidate nodes only remain A and D, cause the chance of eavesdropping that chance is route to reduce；Main cause is tradition
Channel distribution be by minimize while while between interference increase concurrent transmission and then obtain higher handling capacity.This is
Interference model based on link, this is with the man-to-man transmission means of traditional routing and using a link as the property of transmission unit
Fit like a glove.It is one-to-many transmission means but chance route is using the broadcast characteristic being wirelessly transferred, a transmission unit is present
Multilink, therefore the conventional channel method of salary distribution needs multiple both candidate nodes to conflict with chance route.
Unified channel distribution uses identical channel completely, although exist compared with conventional channel is distributed compared with multichannel punching
Prominent, transmission that can be concurrent is less, but remains both candidate nodes and eavesdrop chance.Although retaining both candidate nodes in this example
Unified channel distribution ratio it is high using concurrent transmission conventional channel distribution handling capacity, but conventional channel distribution has only focused on many letters
Road, unified channel distribution has only focused on chance route, also just only obtains the benefit that one of which technology is brought, thus existing skill
The presence in for using chance route and multi channel wireless network network diagram of the channel assignment scheme of art can not take into account concurrent transmission
The problem of with retaining both candidate nodes and eavesdropping chance, this make it that the handling capacity of wireless mesh network is relatively low to a certain extent.
The content of the invention
The embodiment of the present invention provides a kind of method for channel allocation and device, to solve to deposit in existing channel assignment scheme
The problem of can not take into account concurrent transmission and retain both candidate nodes and eavesdrop chance.
A kind of method for channel allocation, methods described includes：
It is determined that both candidate nodes collection corresponding with each node in wireless mesh network, candidate's section corresponding with each node
Both candidate nodes of the point set comprising the node and the node；
According to both candidate nodes collection channel distribution number constraints and the radio frequency interface number constraints of each node, it is determined that
All feasible both candidate nodes collection channel assignment schemes；
A channel assignment scheme is selected from all feasible both candidate nodes collection channel assignment schemes, wherein, in selection
The channel assignment scheme under, link interference between all both candidate nodes collection is minimum, and the link between all both candidate nodes collection is done
Disturb the chain between the summation for referring to the link interference that both candidate nodes are concentrated between individual both candidate nodes collection two-by-two, the collection of both candidate nodes two-by-two
Road interference refers to that a both candidate nodes concentrate the link that the node included is constituted to concentrate the node included to constitute with another both candidate nodes
Link between interference；
It regard the channel as each both candidate nodes collection distribution belonging to node as the channel to the node distribution.
A kind of channel dividing arrangement, described device includes：
Both candidate nodes collection determining module, for determining both candidate nodes collection corresponding with each node in wireless mesh network, institute
State both candidate nodes of the both candidate nodes collection corresponding with each node comprising the node and the node；
Both candidate nodes collection channel assignment scheme determining module, for according to both candidate nodes collection channel distribution number constraints
With the radio frequency interface number constraints of each node, all feasible both candidate nodes collection channel assignment schemes are determined；
Channel assignment scheme selecting module, for selecting one from all feasible both candidate nodes collection channel assignment schemes
Channel assignment scheme, wherein, under the channel assignment scheme of selection, the link interference between all both candidate nodes collection is minimum,
Link interference between all both candidate nodes collection refers to that both candidate nodes concentrate the summation of the link interference between individual both candidate nodes collection two-by-two,
Link interference between the collection of both candidate nodes two-by-two refers to that a both candidate nodes concentrate the link that the node included is constituted to be waited with another
Select the interference between the link of the node composition included in set of node；
Node channel distribute module, for will for belonging to node each both candidate nodes collection distribution channel as give this
The channel of node distribution.
In the scheme of the embodiment of the present invention, due to when carrying out channel distribution, using both candidate nodes to integrate as channel distribution
Unit, and the both candidate nodes collection channel assignment scheme selected is the candidate for making the link interference between all both candidate nodes collection minimum
Set of node channel assignment scheme, finally, the channel assignment scheme further according to both candidate nodes collection determine the channel assignment scheme of node,
Therefore, the channel assignment scheme of the node of acquisition reduces the route conflict between both candidate nodes collection, is retaining both candidate nodes and is stealing
While listening chance, multi channel concurrent transmission is taken into account, and then improve the handling capacity of channel.
Brief description of the drawings
Fig. 1 is the channel distribution result schematic diagram of tradition minimum link interference in background of invention；
Fig. 2 is the unified channel allocation result schematic diagram in background of invention；
Fig. 3 be the embodiment of the present invention in traditional routing side conflict schematic diagram；
The conflict schematic diagram that Fig. 4 route for the chance in the embodiment of the present invention；
Fig. 5 is the wireless mesh network structural representation in the embodiment of the present invention one；
Fig. 6 is the method for channel allocation flow chart in the embodiment of the present invention one；
Fig. 7（a）For the nodes neighbors schematic diagram in the embodiment of the present invention one；
Fig. 7（b）For the link interference schematic diagram in the embodiment of the present invention one；
Fig. 7（c）Schematic diagram is disturbed for the both candidate nodes collection in the embodiment of the present invention one；
Fig. 7（d）Schematic diagram is disturbed for the both candidate nodes collection in the embodiment of the present invention one；
Fig. 8 be the embodiment of the present invention one in determination both candidate nodes collection between interference relationships flow chart；
Fig. 9 is the wireless mesh network topology structural representation in the embodiment of the present invention two；
Figure 10 is the channel dividing arrangement structural representation in the embodiment of the present invention three；
The number of channel that different channels distribution method average out to CFS is distributed during Figure 11 is implemented for the present invention；
The average interference value of different channels distribution method during Figure 12 is implemented for the present invention；
Different channels distribution method handling capacity under heavy duty during Figure 13 is implemented for the present invention；
The cumulative distribution table of Figure 14 all convergence handling capacities in implementing for the present invention.
Embodiment
To clearly demonstrate the scheme of the embodiment of the present invention, first with reference to based on the network topology described in background technology
The side conflict graph of traditional routing and the conflict graph of chance route based on the network topology described in background technology are to of the invention real
The general principle for applying the channel distribution in example is illustrated.
Based on link or while disturb it is corresponding while conflict graph as shown in figure 3, the link in network topological diagram be transformed into side punching
Node in prominent figure, the both links that network topological diagram is interfered have one between corresponding to two in the conflict graph of side nodes
Side.Conventional channel distribution is existed based on a kind of this conflict graph of link by distributing channel to link between smallest link
Interference.
Chance route conflict graph as shown in figure 4, chance route conflict graph in node or the node in network topological diagram,
But each node includes the link set that node can be used, i.e. this node of chance route is between sending node and both candidate nodes
Link set, so destination node does not have corresponding node.As long as there is interference, two nodes pair in the link set between node
There should be a line.
It is to collide with each other in traditional routing mode link SA and SB, AB and AD.And chance route is multiple due to existing
Both candidate nodes, it is allowed to which link SA and SB, AB and AD coexist.It is route in the analysis of conflict graph, chance route and is believed according to chance
Multiple both candidate nodes of one node are bound an entirety when distributing and are allocated by road, as node and the node
What multiple both candidate nodes were constituted is collectively referred to as a both candidate nodes collection, then mainly solves ground and just distributes letter to link with regard to problem
Road, becomes and distributes channel to both candidate nodes collection, carries out that both candidate nodes collection should be assign as a channel distribution during channel distribution
Unit is allocated.Reduced as far as possible by distributing channel to both candidate nodes collection dry between both candidate nodes collection and both candidate nodes collection
Disturb, carrying out elevator can routing performance.According to this thinking when towards the chance route for using one-to-many transmission means, this hair
The channel assignment scheme that bright embodiment is proposed is a kind of channel assignment scheme based on both candidate nodes collection.
The present invention program is described in detail with reference to specific embodiment.
It is common, it can represent as shown in Figure 5 with non-directed graph G=(V, E, R, the K) of an extension and include N number of node
Many radio frequency multi-channel wireless mesh networks, wherein V represents N number of set of node, and E represents the matrix of inter-node link, and R represents each section
Configurable less radio-frequency number of point（Namely radio frequency interface or wave point, it is assumed that the radio frequency quantity of all node configurations is equal
When）, the number of orthogonal channel workable for K is represented in wireless mesh network.
For the wireless mesh network of foregoing description, the method for channel allocation flow chart of the embodiment of the present invention one, such as Fig. 6 institutes
Show, comprise the following steps：
Step 101：It is determined that both candidate nodes collection corresponding with each node in wireless mesh network.
Both candidate nodes of the both candidate nodes collection corresponding with each node comprising the node and the node；Flowed at one
When known to source node and destination node, the route criterion for route of improving the occasion can determine that candidate's section corresponding with each node
Point, and when known to both candidate nodes corresponding with each node, chance route can determine the route of this stream.
The router criterion can be：Expected transmission times (Expected Transmission Count, ETX), phase
Hope any the number of transmissions（Expected Anypath Transmission Count, EAX）, expect transmission time（Expected
Transmission Time, ETT）Or expect any transmission time（Expected Anypath Transmission Time,
EATT）Deng.
Wherein, route criterion is responsible for routing, and chance route is chosen behind road, to determine how to be passed between the node on road
It is defeated.
The ETX is the exact numerical values recited of a measurement link-quality in path selection process.The ETX values of an independent link
It is defined as expectation transmission times when packet is successfully transmitted on this link（Including retransmitting）.
In chance route, each node i corresponds to multiple both candidate nodes FN (i), then node i and its both candidate nodes
FN (i) may be constructed a both candidate nodes collection（Candidate Forwarder Set, CFS）, the institute that this both candidate nodes is concentrated
The link being made up of node constitutes an alternative link collection（The side for all nodes composition that alternatively both candidate nodes are concentrated is constituted
Side and link, summit and node are not differentiated between in one candidate side collection, the embodiment of the present invention）.If the both candidate nodes of node i include section
Point 1 and node 2, node p both candidate nodes include node 3 and node 4.So node 1, the node of node 2 and node i configuration node
An i both candidate nodes collection, the both candidate nodes collection of node 3, node 4 and node p configuration nodes p.All both candidate nodes collection are constituted
The set of both candidate nodes collection（Set of Candidate Forwarder Sets, CFSs）.
It should be noted that being not that each node corresponds to a both candidate nodes collection, some nodes may not waited
Set of node is selected, for example, destination node is due to that need not forward, therefore it does not have both candidate nodes, further, candidate's section is not corresponded to yet
Point set.
When both candidate nodes collection is described with mathematical linguistics, there is M candidate's section in a wireless mesh network for including N number of node
During point set, the relation between node and both candidate nodes collection can use N × M matrix SN×MRepresent.If node i is m-th of candidate
The element of set of node, is designated as i ∈ m and S（I, m）For 1, otherwiseAnd S（I, m）For 0.
Step 102：Constrained according to both candidate nodes collection channel distribution number constraints and the radio frequency interface number of each node
Condition, determines all feasible both candidate nodes collection channel assignment schemes.
Specifically, the both candidate nodes collection channel distribution number constraints is：At least distributed for a both candidate nodes collection
One channel；
The radio frequency interface number constraints of each node is：The number of channel summation distributed by each node is less than etc.
The radio frequency number having in the node.
Step 103：A channel assignment scheme is selected from all feasible both candidate nodes collection channel assignment schemes.
Wherein, under the channel assignment scheme of selection, the link interference between all both candidate nodes collection is minimum, Suo Youhou
The link interference between set of node is selected to refer to that both candidate nodes concentrate the summation of the link interference between individual both candidate nodes collection two-by-two, described two
Link interference between two both candidate nodes collection refers to that a both candidate nodes concentrate the link and another both candidate nodes of the node composition included
Concentrate the interference between the link of the node composition included.
Specifically, link interference between the collection of both candidate nodes two-by-two can with but be not limited to determine in the following manner
's：
The first step：Determine the node that the link that the node that a both candidate nodes collection is included is constituted is included with another both candidate nodes collection
The estimate of interference between the link of composition.
Wherein, the estimate is obtained in the case of it is assumed that all both candidate nodes collection use same channel；
Second step：Under both candidate nodes collection channel assignment scheme, it is defined as the channel set of the both candidate nodes collection distribution
Close and be the common factor for the channel set that another both candidate nodes collection is distributed.
3rd step：The product of the number of element in the estimate of determination and the common factor is saved as a candidate
Interference value between the link that the node that the link and another both candidate nodes collection that the node that point set is included is constituted are included is constituted.
Wherein, it is determined that the common factor be empty set when, the number of element is 0 in the common factor.
Above-mentioned 3rd step, which that is to say, is multiplied the estimate with the number that two both candidate nodes collection have identical channel,
Obtain the link interference between two both candidate nodes collection.
Further, the above-mentioned first step can be determined in the following manner：
Step 1）Determine the interference between the link that is included in wireless mesh network.
In this step 1）In, determine that the interference between the link included in wireless mesh network is specially：
Step 11：According to the position of node, neighbours' collection of each node is determined, neighbours' collection of node refers to the thing with the node
The set that transmission range is less than the node of setpoint distance is managed, or refers to that the packet delivery fraction of the link constituted with the node is more than and is set
Determine the set of the node of threshold value；
It should be noted that in embodiments of the present invention only when the big value of link packet delivery fraction between two nodes just thinks it
Between direct link exist, neighbours each other.That is for any link l (i, j) ∈ E have one it is corresponding
Link packet delivery fraction p (i, j), represents that link is properly received packet success rate under noiseless situation, the success of this packet
Rate can be calculated by propagation model and obtained.Assuming that link is symmetrical p (i, j)=p (j, i), and the link bag of arbitrary node
Delivery ratio is all independent.The neighbours Nb (i) that the one of definition node i jumps is p (i, j) >=P0 node set, wherein P0<<1.
For remaining any node j for being not belonging to Nb (i), link packet delivery fraction is 0, i.e. p (i, j)=0.Under such a scenario, pass
As defeated scope is with interference range.
Step 12：Collected according to the neighbours of each node of determination, it is determined that should with each link pair for being included in wireless mesh network
Link interference collection, wherein, the node included in each link that the corresponding link interference of the first link is concentrated be this first
The neighbor node for the node that link is included.
Step 2）The node included is concentrated according to the interference between the link included in wireless mesh network and each both candidate nodes
The link of composition, determines that both candidate nodes concentrate the link included and another both candidate nodes to concentrate between the link included
Interference.
Both candidate nodes corresponding with node concentrate the link included to refer to that the node and its both candidate nodes are concentrated and remove itself
The link that outer any both candidate nodes are constituted.The link included is concentrated to illustrate both candidate nodes below by citing, for example：It is false
If node A both candidate nodes are node B, node C and node D, namely both candidate nodes collection corresponding with node A is { A, B, C, D },
Then the both candidate nodes integrate the link included in { A, B, C, D } as link AB, link AC, link AD.
Step 3）The link included is concentrated to concentrate the chain included with another both candidate nodes one both candidate nodes of determination
Interference between road is used as the estimate.
Collection is disturbed to interference collection, the node of nodes neighbors collection, link interference collection, both candidate nodes collection with mathematical linguistics below
Concept and the relation between them are described：
1）Nodes neighbors collection
Two node is and p are bag throwing of the physical distance less than transmission range, or inter-node link that neighbours refer to two nodes
Rate is passed more than P0, shown in such as Fig. 7 (a).The set that all neighbor nodes of node i are constituted is exactly neighbours' collection of node i, is used
Represent.
2）Link interference collection
There is interference between link l (i, j) and l (p, q) and refer to the transmitting terminal and receiving terminal of link in the presence of interference, i.e. node i
And p, or node i and q, or node j and p, or node j and p neighbours each other, shown in such as Fig. 7 (b).It is all to be done with link l (i, j)
The link disturbed, constitutes link l (i, j) link interference collection, uses Γ(i,j)Represent.
3）The interference collection of both candidate nodes collection
Two both candidate nodes collection refer in the presence of interference, as long as existing between the candidate side of all nodes composition of both candidate nodes collection
Interference, then the two both candidate nodes collection there is interference.As shown in Fig. 7 (c), node 1, the node of node 2 and node i constitute one
Both candidate nodes collection, node 3, the node of node 4 and node p constitute another both candidate nodes collection, if link l (1, i) or l (2, i)
With l (3, p), l (4, p) in one there is interference, the two both candidate nodes collection there is interference.All and both candidate nodes collection u
The both candidate nodes collection of interference constitutes both candidate nodes collection u interference collection, uses Η(u)Represent.
4）Node interference collection
As long as the link that two nodes are constituted with their own neighbor node is interfered, then two nodes are mutually dry
Disturb, such as shown in Fig. 7 (d).All node configuration node i disturbed with node i interference collection F (i).
It was found from above-mentioned statement, what nodes neighbors were represented is the relation between node, what link interference was represented be link it
Between relation, the interference of both candidate nodes collection and node interference are that relation between link set is determined.Definition relation Stringency
Gradually strengthen：Nodes neighbors<Link interference<Both candidate nodes collection is disturbed<Node is disturbed.
The interference relationships between both candidate nodes collection are represented with M × M matrix I, when u both candidate nodes collection and v-th of candidate
There is interference, I in set of node(u,v)For 1；Otherwise I(u,v)For 0.
After the both candidate nodes collection of known each node, according to the link delivery ratio between node, above-mentioned node can be passed through
The definition of the interference collection of neighbours' collection, link interference collection and both candidate nodes collection determines that the interference between all both candidate nodes collection is closed
It is to determine that the flow of the interference relationships between both candidate nodes collection is as shown in Figure 8.
Step 104：It regard the channel as each both candidate nodes collection distribution belonging to node as the letter to the node distribution
Road.
When the scheme of the embodiment of the present invention is understood from the angle of mathematics, what is be related in above-mentioned steps 102 and step 103 is interior
Appearance can be attributed to constraints and the object function under the constraints respectively, when it is implemented, using mathematical linguistics
Describe the constraints and object function, and object function is carried out under constraints to solve the channel for obtaining each node point
It is specific as follows with scheme：
（One）Mathematical linguistics description to constraints
It is determined that in wireless mesh network after both candidate nodes corresponding with each node, definable node and both candidate nodes collection it
Between relational matrix SN×M, when node i is the element of m-th both candidate nodes collection, the relation between the node and both candidate nodes collection
Matrix SN×MElement S（I, m）=1；Otherwise S（I, m）=0；And define the channel distribution matrix A of both candidate nodes collectionM×K, in m-th of time
When selecting the set of node to have used k-th of channel, the channel distribution matrix AM×KElements A（M, k）=1；Otherwise, A（M, k）=0, then
Above-mentioned both candidate nodes collection channel distribution number constraints can be expressed as：
One node is likely to be contained in multiple both candidate nodes and concentrated, as long as the affiliated both candidate nodes collection of node is assigned with one
Channel, then the channel is also assigned in the node.Therefore can according to the relational matrix S between both candidate nodes collection and node and
Both candidate nodes collection channel distribution matrix A, obtains the channel distribution matrix X that channel posterior nodal point is distributed for both candidate nodes collectionN×K,
I.e.
Wherein, K is available orthogonal channel number, k=1,2 ... K in wireless network network diagram；N is wireless network network diagram interior joint
Number, i=1,2 ... N；M is the number of the both candidate nodes collection determined, XN×KFor the channel distribution matrix of node, X(i,k)=1 represents section
Point i has used k-th of channel, X(i,k)=0 represents that k-th of channel, m=1,2 ... M is not used in node i.
It should be noted that to simplify to above-mentioned formula（8）Statement, following linear inequality can be used（9）Carry out table
Show above-mentioned formula（8）The channel distribution of both candidate nodes collection and the channel distribution of node between relation：
In formula（9）In, L is any real number more than M, ifIllustrate the time belonging to node i
Selecting set of node, channel k is assigned at least one, due toX must be had according to inequality(i,k)=1；IfIllustrate that the both candidate nodes collection belonging to node i has all been not previously allocated channel k, X must be had according to inequality(i,k)
=0；
It is X in the channel distribution matrix of nodeN×KWhen, the radio frequency interface number constraints of above-mentioned each node is expressed as：
Wherein, RiThe radio frequency number having for node i.
（Two）Mathematical linguistics description to object function
Define the link interference relational matrix I between u-th of both candidate nodes collection and v-th of both candidate nodes collectionM×M, in channel point
During with there is interference between u-th of both candidate nodes collection of preceding determination and v-th of both candidate nodes collection, I(u,v)=1；Otherwise, I(u,v)=0；
It not is u-th to determine to exist between u-th of both candidate nodes collection and v-th of both candidate nodes collection before channel distribution when disturbing
Interference is truly present between both candidate nodes collection and v-th of both candidate nodes collection, but a kind of hypothesis situation is all both candidate nodes collection makes
With the interference existed in the case of same channel, therefore, referred to as estimate；After channel distribution, only when u-th of both candidate nodes
It is real between u-th of both candidate nodes collection and v-th of both candidate nodes collection when collection and v-th of both candidate nodes collection are assigned with identical channel
In the presence of interference.
If using I(u,v)Represent to determine that what is between u-th of both candidate nodes collection and v-th of both candidate nodes collection existed does before channel distribution
Disturb, use I'(u,v)The interference being truly present between u-th of both candidate nodes collection and v-th of both candidate nodes collection is represented, then
The object function can be expressed as：
Wherein u=1,2 ... M；v=1、2…M.
Constraints and object function are carried out after formulation, can known, the Channel Assignment Problems are one whole
Number quadratic programming problem, and then can be solved by convex optimum theory, can be directly soft using Lingo in practical application
Part solve the channel distribution matrix A for obtaining both candidate nodes collectionM×K。
According to the channel distribution matrix A of both candidate nodes collectionM×K, can be by node and time when determining the channel assignment scheme of node
Select the relational matrix S between set of nodeN×MWith the channel distribution matrix A of both candidate nodes collectionM×KSubstitute into formulaObtain the channel distribution matrix X of nodeN×K。
Because the scheme of the embodiment of the present invention one is to integrate the base unit as channel distribution using both candidate nodes（I.e. by a time
Set of node is selected as an entirety channel distribution is carried out to it）, and the channel assignment scheme obtained can make both candidate nodes collection
Between link interference it is minimum, thus, it is possible to obtain more concurrent transmissions and retaining both candidate nodes and steal that chance route brings
Chance is listened, and then the handling capacity of wireless mesh network can be improved.
The scheme of the embodiment of the present invention one is said by a specific example in the embodiment of the present invention two below
It is bright.
Embodiment two
In wireless mesh network topology figure as shown in Figure 9, there are 4 nodes and 1 stream, source node is 1, and destination node is
4.Each node, which is configured, has 3 orthogonal channels (K=3) in 2 less radio-frequencies (R=2), network.Numeral on side represents link
Packet delivery fraction.Need to carry out channel distribution for all nodes.Concrete methods of realizing is as follows：
The first step：Determine both candidate nodes collection.
For source node 1, destination node 4, transmission time is expected by (Expected Transmission Count, ETX)
Number route criterion, which is calculated, can obtain the both candidate nodes of each node, and the both candidate nodes of its interior joint 1 include 2,3 and 4, node 2
Both candidate nodes include 3 and 4, the both candidate nodes of node 3 include 4.Each node and its both candidate nodes binding are turned into one
It is overall, as a both candidate nodes collection, all both candidate nodes collection can be so obtained, totally three both candidate nodes collection（M=3）.3
Individual both candidate nodes collection is respectively { 1,2,3,4 }, { 2,3,4 } and { 3,4 }.So represent node and the S squares of both candidate nodes collection relation
The value of battle array is as follows：
Second step：According to both candidate nodes collection channel distribution number constraints and the radio frequency interface number of each node constraint bar
Part, determines all feasible both candidate nodes collection channel assignment schemes.
Specifically, both candidate nodes collection distribution number constraints is in the embodiment of the present invention two：Saved for above-mentioned 3 candidates
Each both candidate nodes collection that point is concentrated at least distributes a channel；
In the embodiment of the present invention two, the radio frequency interface number constraints of each node is：By above-mentioned each node point
The number of channel summation matched somebody with somebody is less than or equal to 2.
3rd step：Both candidate nodes collection 1 and both candidate nodes collection 2, both candidate nodes collection 2 and both candidate nodes collection 3, candidate are determined respectively
Set of node 1 and both candidate nodes collection 3 and each both candidate nodes collection itself are to the interference estimate of itself.
Interference relationships between the link and link that are included according to both candidate nodes collection can be obtained between both candidate nodes collection
Interference relationships.All there is interference between the link included by three both candidate nodes collection, these three both candidate nodes collection are also mutual
Interference.Represent that the estimation value matrix I of the interference between both candidate nodes collection is all 1.
4th step：Determine under each both candidate nodes collection channel assignment scheme, the link interference between all both candidate nodes collection, and from
In select the both candidate nodes collection channel assignment scheme for making that minimum is disturbed between both candidate nodes collection.
5th step：It regard the channel as each both candidate nodes collection distribution belonging to node as the letter to the node distribution
Road.
Above-mentioned five step can be attributed to：Known S, I, R, K and M, are substituted into (12) as input, are asked using Lingo softwares
Solution, can obtain the channel distribution matrix A of both candidate nodes collectionM×KWith the channel distribution matrix X of corresponding nodeN×K, it is respectively：
Because all nodes are similar with the example described by Fig. 4 all in the range of being in communication with each other in the embodiment of the present invention two,
The same channel of all node distributions can be only achieved more preferable network performance.Therefore the method for channel allocation based on both candidate nodes collection
As a result it is also the same channel of all node distributions.
If, can be according to every first-class source node and destination node it should be noted that there is different streams in wireless mesh network
The stream is handled according to the scheme of the embodiment of the present invention one and embodiment two.
Embodiment three
Based on the same inventive concept with embodiment one and embodiment two, the embodiment of the present invention three provides a kind of channel distribution
Device, as shown in Figure 10, described device include：
Both candidate nodes collection determining module 11, for determining both candidate nodes collection corresponding with each node in wireless mesh network,
Both candidate nodes of the both candidate nodes collection corresponding with each node comprising the node and the node；
Both candidate nodes collection channel assignment scheme determining module 12, for constraining bar according to both candidate nodes collection channel distribution number
The radio frequency interface number constraints of part and each node, determines all feasible both candidate nodes collection channel assignment schemes；
Channel assignment scheme selecting module 13, for selecting one from all feasible both candidate nodes collection channel assignment schemes
Individual channel assignment scheme, wherein, under the channel assignment scheme of selection, the link interference between all both candidate nodes collection is most
Small, the link interference between all both candidate nodes collection refers to that both candidate nodes concentrate the total of the link interference between individual both candidate nodes collection two-by-two
With, the link interference between the collection of both candidate nodes two-by-two refer to a both candidate nodes concentrate the link that the node included is constituted with it is another
Both candidate nodes concentrate the interference between the link that the node included is constituted；
Node channel distribute module 14, for will be the channel of each both candidate nodes collection distribution belonging to node as giving
The channel of the node distribution.
Preferably, the channel assignment scheme selecting module 13, specifically for determining the node that a both candidate nodes collection is included
The estimate of interference between the link that the node that the link of composition and another both candidate nodes collection are included is constituted, in both candidate nodes collection
Under channel assignment scheme, it is defined as the channel set of the both candidate nodes collection distribution and is distributed for another both candidate nodes collection
Channel set common factor, regard the product of the number of element in the estimate of determination and the common factor as a candidate
Interference value between the link that the node that the link and another both candidate nodes collection that the node that set of node is included is constituted are included is constituted, its
In, the estimate is obtained in the case of it is assumed that all both candidate nodes collection use same channel, it is determined that the friendship
When integrating as empty set, the number of element is 0 in the common factor.
Further, the channel assignment scheme selecting module 13, specifically for the chain for determining to include in wireless mesh network
Interference between road；The node structure included is concentrated according to the interference between the link included in wireless mesh network and each both candidate nodes
Into link, determine that both candidate nodes concentrate the link included and another both candidate nodes to concentrate dry between the link included
Disturb；The link included and another both candidate nodes are concentrated to concentrate the interference between the link included one both candidate nodes of determination
It is used as the estimate.
Specifically, the both candidate nodes collection channel distribution number constraints is：At least distributed for a both candidate nodes collection
One channel；The radio frequency interface number constraints of each node is：The number of channel summation distributed by each node is less than
The radio frequency number having equal to the node.
The scheme of the embodiment of the present invention has the beneficial effect that：First, to avoid channel distribution and chance route transmission mode
Mutually conflict, make the more efficient fruit of channel assignment scheme of formulation, it is proposed that the interference model and computational methods of both candidate nodes collection, be
Each both candidate nodes collection rather than single link carry out channel distribution, therefore are more suitable for the biography of chance route compared with prior art
Defeated mode, can fully excavate chance route high-throughput advantage；Secondly, it is determined that the object of channel distribution is both candidate nodes collection
Afterwards, in order to improve network throughput, the target of distribution is to minimize the link interference sum total between both candidate nodes collection, can thus be allowed
The transmission unit that more chance route both candidate nodes collection are constituted carries out concurrent transmission, so that channel resource is route by chance
Make full use of, substantially increase network end-to-end handling capacity.
For the channel assignment scheme of the further description embodiment of the present invention, by the present invention based on both candidate nodes collection
Channel assignment scheme carry out interference with other three kinds existing channel assignment schemes and throughput performance is compared, specifically
Operating condition and comparative result are as follows：
In interference relatively, compare the both candidate nodes collection interference of different channels allocative decision generation.In handling capacity, profit
Dice performance analysis models are used, it is expanded into the multi channel analysis of many radio frequencies to the throughput analysis under injection frequency single channel.
Using this throughput analysis instrument, to being estimated based on the network performance under both candidate nodes collection channel distribution.With other 3 kinds
Different channels distribution method carries out interference and throughput performance compares, and is respectively：
It is randomly assigned（Rand）：Channel is randomly assigned for node；
Unified distribution（Unif）：All node distribution identical channels；
Conventional allocation（Trad）：Using the method for channel allocation for minimizing link interference；
Distribution based on both candidate nodes collection（CFSCA）：Channel distribution is carried out using the present processes.
16 nodes are randomly placed in 400*400 meters of region, and ensure that average node degree is at least 2, as long as two
Delivery ratio between node there is a link more than 0.1, and each node configures 2 less radio-frequency network interface cards, uses 802.11b
The available orthogonal channel number of network is 3.Both candidate nodes are determined using ETX in Route Selection.In identical source node and purpose
The lower order of node selection performs 4 kinds of mechanism.Experiment is using decline（shadowing model）Path model, channel speed is
11M。
The interference compared is the interference sum between CFS.Only when two CFS are interfered, and it is assigned with identical
During channel, two CFS are just truly present interference.Calculate the interference sum between all CFS.It is worth noting that, in tradition point
Matching somebody with somebody and being randomly assigned lower possibly can not ensure at least to distribute a common channel for all nodes in a CFS.So system
It is calculated as the number of channel and interference value of CFS distribution.Randomly generate and 6 groups of source sections are randomly choosed under 5 network topologies, each network topology
Point and destination node, every group includes 8 streams, produces saturation volume.Calculate the number of channel distributed for CFS under different channels distribution
And interference value, then average.
In fig. 11, univesral distribution is to be assigned with 2 channels for all CFS, and random and conventional allocation does not all reach
Value to half is exactly not distribute a channel for all CFS, that is, not all CFS node all have shared
Identical channel.CFSCA is more than half, meets and distributes channel for all CFS.Because conventional allocation and being randomly assigned not
Promising all CFS distribution channels, although from Figure 12 their interference value it is less be also it is useless, compare CFSCA with uniformly
Interference value under distribution.It can be seen that CFSCA is in the case where ensureing to CFS distribution channels, and obtain very much less interference.
Analyze the network throughput under heavy duty.Randomly generate and randomly choose 6 under 5 network topologies, each network topology
Group source node and destination node, every group includes 8 streams, produces saturation volume.It is to select not under same network topology in Figure 13
When same source node and destination node, the convergence handling capacity that four kinds of method for channel allocation are produced.First when being route using chance,
Unified distribution is poor unlike traditional channel distribution, then can be used in the environment of it can not carry out complicated calculations simplest
Unified distribution.The handling capacity of CFSCA distribution is all higher than or is not less than other distribution method.Figure 14 is tired for all convergence handling capacities
Integrate Butut.The average throughput under all topologys is calculated, four kinds of channel distributions are respectively：11.5,13.1,12.1,
14.4Mbps.CFSCA is averagely higher by 25.2% than accidental channel distribution, and 10% is averagely higher by than unified channel distribution, than tradition letter
Road distribution is averagely higher by 19%.
It should be understood by those skilled in the art that, embodiments herein can be provided as method, system or computer program
Product.Therefore, the application can be using the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Apply the form of example.Moreover, the application can be used in one or more computers for wherein including computer usable program code
Usable storage medium（Including but not limited to magnetic disk storage, CD-ROM, optical memory etc.）The computer program production of upper implementation
The form of product.
The application is with reference to the method according to the embodiment of the present application, device（System）And the flow of 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 units is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing units 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 units 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 units 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.
Although having been described for the preferred embodiment of the application, those skilled in the art once know basic creation
Property concept, then can make other change and modification to these embodiments.So, appended claims are intended to be construed to include excellent
Select embodiment and fall into having altered and changing for the application scope.
Obviously, those skilled in the art can carry out the essence of various changes and modification without departing from the application to the application
God and scope.So, if these modifications and variations of the application belong to the scope of the application claim and its equivalent technologies
Within, then the application is also intended to comprising including these changes and modification.
Claims (13)
1. a kind of method for channel allocation, it is characterised in that methods described includes：
It is determined that both candidate nodes collection corresponding with each node in wireless mesh network, the both candidate nodes collection corresponding with each node
Both candidate nodes comprising the node He the node；
According to both candidate nodes collection channel distribution number constraints and the radio frequency interface number constraints of each node, it is determined that all
Feasible both candidate nodes collection channel assignment scheme；
A channel assignment scheme is selected from all feasible both candidate nodes collection channel assignment schemes, wherein, in the institute of selection
State under channel assignment scheme, the link interference between all both candidate nodes collection is minimum, the link interference between all both candidate nodes collection is
The link referred between the summation that both candidate nodes concentrate the link interference between individual both candidate nodes collection two-by-two, the collection of both candidate nodes two-by-two is done
Disturb the chain for referring to that a both candidate nodes concentrate the link that the node included is constituted to concentrate the node included to constitute with another both candidate nodes
Interference between road；
It regard the channel as each both candidate nodes collection distribution belonging to node as the channel to the node distribution.
2. the method as described in claim 1, it is characterised in that the link interference between the collection of both candidate nodes two-by-two be by with
What under type was determined：
Determine the link that the link that the node that a both candidate nodes collection is included is constituted is constituted with the node that another both candidate nodes collection is included
Between interference estimate, wherein, the estimate be it is assumed that all both candidate nodes collection use same channel in the case of
Obtain；
Under both candidate nodes collection channel assignment scheme, it is defined as the channel set of both candidate nodes collection distribution and to be described another
The common factor of the channel set of one both candidate nodes collection distribution, the estimate of determination is multiplied with the number of element in the common factor
The chain that the link that the node that product is included as the both candidate nodes collection is constituted is constituted with the node that another both candidate nodes collection is included
Interference value between road, wherein, it is determined that the common factor be empty set when, the number of element is 0 in the common factor.
3. method as claimed in claim 2, it is characterised in that determine the node that a both candidate nodes collection is included in the following manner
The estimate of interference between the link that the node that the link of composition and another both candidate nodes collection are included is constituted：
Determine the interference between the link that is included in wireless mesh network；
The link that the node included is constituted is concentrated according to the interference between the link included in wireless mesh network and each both candidate nodes,
Determine that a both candidate nodes concentrate the link included and another both candidate nodes to concentrate the interference between the link included；
It is dry between the link for concentrating the link included and another both candidate nodes concentration to include a both candidate nodes of determination
Disturb as the estimate.
4. method as claimed in claim 3, it is characterised in that dry between the link included in the determination wireless mesh network
Disturb, be specially：
According to the position of node, neighbours' collection of each node is determined, neighbours' collection of node refers to the physical transfer distance with the node
Less than the set of the node of setpoint distance, or refer to that the packet delivery fraction of the link constituted with the node is more than the section of given threshold
The set of point；
Collected according to the neighbours of each node of determination, it is determined that link interference corresponding with each link included in wireless mesh network
Collection, wherein, the node included in each link that the corresponding link interference of the first link is concentrated is that first link is included
The neighbor node of node.
5. method as claimed in claim 4, it is characterised in that the both candidate nodes collection channel distribution number constraints is：
A channel is at least distributed for a both candidate nodes collection；
The radio frequency interface number constraints of each node is：The number of channel summation distributed by each node is less than or equal to should
The radio frequency number that node has.
6. method as claimed in claim 5, it is characterised in that
Described is that a both candidate nodes collection at least distributes a channel, is specially：
The number of channel summation distributed by each node is less than or equal to the radio frequency number that the node has, and is specially：Wherein,
Wherein, AM×KFor the channel distribution matrix of both candidate nodes collection, when m-th of both candidate nodes collection has used k-th of channel, it is somebody's turn to do
Channel distribution matrix AM×KElements A（M, k）=1；Otherwise, A（M, k）=0；SN×MFor the relational matrix between node and both candidate nodes collection
SN×M, when node i is the element of m-th both candidate nodes collection, the relational matrix S between the node and both candidate nodes collectionN×MMember
Plain S（I, m）=1；Otherwise S（I, m）=0；K is available orthogonal channel number, k=1,2 ... K in wireless network network diagram；N is wireless network network diagram
The number of interior joint, i=1,2 ... N；M is the number of the both candidate nodes collection determined, RiThe radio frequency number having for node i, X is node
Channel distribution matrix, X(i,k)=1 expression node i has used k-th of channel, X(i,k)=0 represents that k-th of letter is not used in node i
Road, m=1,2 ... M.
7. method as claimed in claim 6, it is characterised in that
It is described that a channel assignment scheme, the selected letter are selected from all feasible both candidate nodes collection channel assignment schemes
Road allocative decision make it that the link interference minimum between all both candidate nodes collection is specially：MeetingWithUnder conditions of, ask for meetingBoth candidate nodes collection channel distribution
Matrix；
Wherein, IM×MFor the estimation value matrix disturbed between u-th of both candidate nodes collection and v-th of both candidate nodes collection, u is being estimated
When there is interference between individual both candidate nodes collection and v-th of both candidate nodes collection, I(u,v)=1；Otherwise, I(u,v)=0；u=1、2…M；v=1、
2…M。
8. method as claimed in claim 7, it is characterised in that described by for each both candidate nodes collection distribution belonging to node
Channel is specially as the channel of the node distribution：
By the relational matrix S between node and both candidate nodes collectionN×MWith the channel distribution matrix A of both candidate nodes collectionM×KSubstitute into formula, obtain the channel distribution matrix of node.
9. a kind of channel dividing arrangement, it is characterised in that described device includes：
Both candidate nodes collection determining module, for determining corresponding with each node in wireless mesh network both candidate nodes collection, it is described and
Both candidate nodes of the corresponding both candidate nodes collection of each node comprising the node and the node；
Both candidate nodes collection channel assignment scheme determining module, for according to both candidate nodes collection channel distribution number constraints and respectively
The radio frequency interface number constraints of node, determines all feasible both candidate nodes collection channel assignment schemes；
Channel assignment scheme selecting module, for selecting a channel from all feasible both candidate nodes collection channel assignment schemes
Allocative decision, wherein, under the channel assignment scheme of selection, the link interference between all both candidate nodes collection is minimum, owns
Link interference between both candidate nodes collection refers to that both candidate nodes concentrate the summation of the link interference between individual both candidate nodes collection two-by-two, described
The link interference between both candidate nodes collection refers to that a both candidate nodes concentrate the link that the node included is constituted to be saved with another candidate two-by-two
Point concentrates the interference between the link that the node included is constituted；
Node channel distribute module, for will be the channel of each both candidate nodes collection distribution belonging to node as giving the node
The channel of distribution.
10. channel dividing arrangement as claimed in claim 9, it is characterised in that
The channel assignment scheme selecting module, specifically for determine link that the node that includes of a both candidate nodes collection constitutes with it is another
The estimate of interference between the link that the node that one both candidate nodes collection is included is constituted, in both candidate nodes collection channel assignment scheme
Under, it is defined as the channel set and the channel set for another both candidate nodes collection distribution of both candidate nodes collection distribution
Occur simultaneously, the product of the number of element in the estimate of determination and the common factor is included as the both candidate nodes collection
Interference value between the link that the node that the link and another both candidate nodes collection that node is constituted are included is constituted, wherein, the estimation
Value is obtained in the case of it is assumed that all both candidate nodes collection use same channel, it is determined that the common factor be empty set when,
The number of element is 0 in the common factor.
11. channel dividing arrangement as claimed in claim 10, it is characterised in that the channel assignment scheme selecting module, tool
Body is used to determine the interference between the link that includes in wireless mesh network；According to dry between the link included in wireless mesh network
The link for concentrating the node included to constitute with each both candidate nodes is disturbed, determines that a both candidate nodes concentrate the link and another included
Both candidate nodes concentrate the interference between the link included；One both candidate nodes of determination are concentrated the link included waited with another
The interference between the link included in set of node is selected as the estimate.
12. channel dividing arrangement as claimed in claim 11, it is characterised in that the channel assignment scheme selecting module, tool
Body is used for the position according to node, determines neighbours' collection of each node, is collected according to the neighbours of each node of determination, it is determined that and wireless network
The corresponding link interference collection of each link included in shape net, wherein, neighbours' collection of node refers to the physical transfer with the node
Distance is less than the set of the node of setpoint distance, or refers to that the packet delivery fraction of the link constituted with the node is more than given threshold
Node set, wherein, the node for each link that the corresponding link interference of the first link is concentrated is the first link bag
The neighbor node of the node contained.
13. channel dividing arrangement as claimed in claim 12, it is characterised in that the both candidate nodes collection channel distribution number is about
Beam condition is：A channel is at least distributed for a both candidate nodes collection；
The radio frequency interface number constraints of each node is：The number of channel summation distributed by each node is less than or equal to should
The radio frequency number that node has.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310101899.1A CN104080088B (en) | 2013-03-27 | 2013-03-27 | A kind of method for channel allocation and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310101899.1A CN104080088B (en) | 2013-03-27 | 2013-03-27 | A kind of method for channel allocation and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104080088A CN104080088A (en) | 2014-10-01 |
| CN104080088B true CN104080088B (en) | 2017-09-12 |
Family
ID=51601088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310101899.1A Active CN104080088B (en) | 2013-03-27 | 2013-03-27 | A kind of method for channel allocation and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104080088B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105357288B (en) * | 2015-10-23 | 2019-03-05 | 南京邮电大学 | A kind of cloud business uplink dispatch method at SDWN |
| CN106211179B (en) * | 2016-09-12 | 2019-11-26 | 东南大学 | A kind of access point deployment and method for channel allocation of wireless cloud computing system |
| CN106341841B (en) * | 2016-10-21 | 2024-05-24 | 无锡士康通讯技术有限公司 | Wireless multichannel anti-collision communication system and multichannel communication method |
| CN107071912B (en) * | 2017-04-17 | 2020-08-21 | 北京星网锐捷网络技术有限公司 | Method and device for distributing channels in wireless local area network |
| CN110366253B (en) * | 2019-06-18 | 2020-08-11 | 中国水产科学研究院渔业工程研究所 | Channel allocation method, device and storage medium based on cognitive radio network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7773558B2 (en) * | 2006-12-26 | 2010-08-10 | Seoul National University Industry Foundation | Wireless network channel allocation method and multi-hop wireless network system using the same |
| CN102137465A (en) * | 2011-03-08 | 2011-07-27 | 湖南大学 | Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network |
| CN102932866A (en) * | 2012-07-06 | 2013-02-13 | 北京邮电大学 | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network |
-
2013
- 2013-03-27 CN CN201310101899.1A patent/CN104080088B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7773558B2 (en) * | 2006-12-26 | 2010-08-10 | Seoul National University Industry Foundation | Wireless network channel allocation method and multi-hop wireless network system using the same |
| CN102137465A (en) * | 2011-03-08 | 2011-07-27 | 湖南大学 | Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network |
| CN102932866A (en) * | 2012-07-06 | 2013-02-13 | 北京邮电大学 | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network |
Non-Patent Citations (3)
| Title |
|---|
| Distributed Low－Complexity Channel Assignment for Opportunistic Routing;He Shiming;《DIGITAL COMMUNICATIONS》;20121130;全文 * |
| 多信道无线Mesh网络信道分配算法;彭利民等;《计算机应用》;20090731;全文 * |
| 认知无线Mesh网络中基于干扰模型的信道分配策略;章国安等;《计算机应用研究》;20100531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104080088A (en) | 2014-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chakraborty et al. | Distributed routing in a quantum internet | |
| Palattella et al. | On optimal scheduling in duty-cycled industrial IoT applications using IEEE802. 15.4 e TSCH | |
| US9793948B2 (en) | Dynamic hopping sequence computation in channel hopping communication networks | |
| CN104080088B (en) | A kind of method for channel allocation and device | |
| CN103369599B (en) | A kind of many radio frequencies multi-Channel Wireless Mesh Network resource cross-layer optimizing method | |
| Jahanshahi et al. | On channel assignment and multicast routing in multi–channel multi–radio wireless mesh networks | |
| CN106062517A (en) | Mesh router systems and methods | |
| Chlebus et al. | Efficient distributed communication in ad-hoc radio networks | |
| De Souza et al. | An exploration of aggregation convergecast scheduling | |
| CN104394569B (en) | The method that QoS routing is set up based on angle and interference control in wireless D2D networks | |
| CN109413752A (en) | A kind of real time resources dispatching method towards wireless low-power consumption network | |
| Dehghan et al. | Cooperative diversity routing in wireless networks | |
| Xu et al. | Fast group communication scheduling in duty-cycled multihop wireless sensor networks | |
| ParandehGheibi et al. | Optimal reverse carpooling over wireless networks-a distributed optimization approach | |
| CN103796325B (en) | The distribution of wireless Mesh netword multicast portions overlapped channels and dispatching method | |
| CN110190919A (en) | More radio frequency multi-channel wireless network method for channel allocation | |
| Dab et al. | A novel wireless resource allocation algorithm in hybrid data center networks | |
| Tsao et al. | An end‐to‐end channel allocation scheme for a wireless mesh network | |
| Almasoud et al. | Multi-objective optimization for many-to-many communication in cognitive radio networks | |
| Kaur et al. | Efficient path establishment algorithm in Manets using bio-inspired techniques | |
| Kuroiwa et al. | A multi-channel bulk data collection for structural health monitoring using wireless sensor networks | |
| Al-Nabhan et al. | Distributed algorithm for connected dominating set construction in sensor networks | |
| Dab et al. | A heuristic approach for joint batch-routing and channel assignment in hybrid-dcns | |
| Salehpour et al. | Efficient clustering of wireless sensor networks based on memetic algorithm | |
| Nikodem et al. | Multi-hop and directed routing based on neighborhood cooperation in WSN |
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 |