CN104080088A - Method and device of channel allocation - Google Patents

Method and device of channel allocation Download PDF

Info

Publication number
CN104080088A
CN104080088A CN201310101899.1A CN201310101899A CN104080088A CN 104080088 A CN104080088 A CN 104080088A CN 201310101899 A CN201310101899 A CN 201310101899A CN 104080088 A CN104080088 A CN 104080088A
Authority
CN
China
Prior art keywords
node
candidate nodes
link
channel
collection
Prior art date
Application number
CN201310101899.1A
Other languages
Chinese (zh)
Other versions
CN104080088B (en
Inventor
曾彬
何施茗
张大方
Original Assignee
中国移动通信集团湖南有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中国移动通信集团湖南有限公司 filed Critical 中国移动通信集团湖南有限公司
Priority to CN201310101899.1A priority Critical patent/CN104080088B/en
Publication of CN104080088A publication Critical patent/CN104080088A/en
Application granted granted Critical
Publication of CN104080088B publication Critical patent/CN104080088B/en

Links

Abstract

The invention discloses a method and a device of channel allocation. The method is mainly characterized by comprising the following steps of: determining a candidate set of node corresponding to each node in a wireless mesh network, and determining a channel allocation plan for all candidate sets of nodes according to constraint conditions; and selecting one channel allocation plan, wherein the interference of a link between all candidate sets of nodes is minimum under the selected channel allocation plan, and a channel allocated for each candidate set of node of a node serves as the channel allocated for the node. Each candidate set of node serves as a channel allocation unit, and the selected channel allocation plan is a channel allocation plan capable of causing the interference of the link between all candidate sets of nodes to be minimum, and lastly, the channel allocation plan of the node is determined according to the channel allocation plan of the candidate sets of nodes, so that routing conflict between the candidate sets of nodes is reduced through the obtained channel allocation plan of the node, and the multi-channel concurrent transmission is considered while a candidate node and eavesdropping opportunity are reserved, thereby improving the throughput capacity of the channel.

Description

A kind of method for channel allocation and device

Technical field

The present invention relates to wireless mesh network technical field, relate in particular to a kind of method for channel allocation and device.

Background technology

Multi-hop wireless network is WLAN (wireless local area network) (Wireless Local Area Networks, WLAN) expansion, can effectively make up that WLAN coverage is little, transmission range is limited, the problem of free networking and constructional difficulties, there is more small configuration cost, more large coverage, can provide economic network insertion service.How by effective technological means, the capacity that promotes multi-hop wireless network as Routing Protocol and channel allocation is the popular domain all the time receiving much concern.

Wherein chance route is routing mode emerging in multi-hop wireless network, it utilizes wireless medium broadcast nature and multi-user diversity, do not determine in advance the down hop of route, directly broadcast transmission packet, may have a plurality of neighbor nodes all correctly to receive packet around.Receiving that between the node of packet, carrying out certain coordinates, by one of them from destination node the node of " near " continue forwarding.Certainly not all node all participates in, and chance route is participated in by certain rules selection part wherein, and these selected neighbor nodes are called both candidate nodes or candidate's forward node.Through multi-party verification, with only have a traditional fixed route that presets down hop and compare, the mode of a plurality of both candidate nodes forwarding data of this use of chance route bag more can adapt to insecure wireless link, especially can make full use of the wireless link of remote and high Loss Rate, can obviously promote the end-to-end throughput of multi-hop wireless network, especially wireless mesh network.

Yet the one-to-many transmission means of chance route makes to utilize existing unified channel distribution method to carry out channel allocation or during with the conventional channel distribution method of traditional route compatibility, has the not high problem of throughput of channel allocation.

For example: in the network topology of 4 nodes, each node is equipped with 2 less radio-frequencies, and number of available channels is 3.Source node is S, and destination node is D, and the both candidate nodes of S is D, A, B.Fig. 1 is traditional channel allocation result that minimizes link interference, and Fig. 2 is unified channel allocation result, and in network, all nodes are all used identical channel, and in example, all nodes are all only used channel 1 and channel 2.Wherein, internodal dotted line limit represents link, and the value on limit is link packet delivery fraction, and solid line represents channel C1, with any dotted line, represents channel C2, with the dotted lines of 2, represents channel C3.Use many radio frequencies multichannel chance route throughput EMORE analytical model to analyze the throughput under two kinds of channel allocation, the throughput that conventional channel is distributed can reach 0.5, and unified channel distributes can reach 0.6475.

Conventional channel distribution utilizes multi channel concurrent transmission to obtain higher throughput, but may there is following shortcoming after distributing in conventional channel as can be seen from Figure 1: the link that 1) cuts off node and some both candidate nodes, as link AB, this is that node and both candidate nodes do not have shared channel to cause; 2) while sending with certain channel, both candidate nodes number tails off, and as S sends with C1, B cannot become its both candidate nodes, and both candidate nodes is surplus A and D only, causes the chance of eavesdropping of chance route to reduce; Main cause is that conventional channel distributes is that interference by minimizing between limit and limit increases concurrent transmission and then obtains higher throughput.This is the interference model based on link, and the character that this and the man-to-man transmission means of traditional route and the link of take are transmission unit fits like a glove.But chance route is utilized the broadcast characteristic of wireless transmission, be the transmission means of one-to-many, there is multilink in a transmission unit, so the conventional channel method of salary distribution needs a plurality of both candidate nodes to conflict with chance route.

Identical channel is used in unified channel distribution completely, although distribute to compare with conventional channel, has more channel confliction, can concurrent transmission is less, but has retained both candidate nodes and has eavesdropped chance.Although retain in this example the unified channel distribution ratio of both candidate nodes, utilize concurrent transmission conventional channel to distribute throughput high, but multichannel has only been paid close attention in conventional channel distribution, unified channel distributes has only paid close attention to chance route, also just only obtained the benefit that wherein a kind of technology is brought, thereby the channel assignment scheme of prior art can not take into account concurrent transmission and retain both candidate nodes and eavesdrop the problem of chance for existing in using chance route and multi channel wireless network network diagram, this makes the throughput of wireless mesh network lower to a certain extent.

Summary of the invention

The embodiment of the present invention provides a kind of method for channel allocation and device, in order to solve in existing channel assignment scheme, exists and can not take into account concurrent transmission and retain both candidate nodes and the problem of eavesdropping chance.

A method for channel allocation, described method comprises:

Determine and the both candidate nodes collection that in wireless mesh network, each node is corresponding the both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node;

According to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determine all feasible both candidate nodes collection channel assignment scheme;

From all feasible both candidate nodes collection channel assignment scheme, select a channel assignment scheme, wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes;

To be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.

A channel dividing arrangement, described device comprises:

Both candidate nodes collection determination module, for determining the both candidate nodes collection corresponding with each node of wireless mesh network, the both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node;

Both candidate nodes collection channel assignment scheme determination module, for according to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determines all feasible both candidate nodes collection channel assignment scheme;

Channel assignment scheme is selected module, for selecting a channel assignment scheme from all feasible both candidate nodes collection channel assignment scheme, wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes;

Node channel assignment module, for will be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.

In the scheme of the embodiment of the present invention, due to when carrying out channel allocation, adopt both candidate nodes Ji Wei channel allocation unit, and the both candidate nodes collection channel assignment scheme of selecting is the both candidate nodes collection channel assignment scheme that makes the link interference minimum between all both candidate nodes collection, finally, according to the channel assignment scheme of both candidate nodes collection, determine again the channel assignment scheme of node, therefore, the channel assignment scheme of the node obtaining has reduced the route conflict between both candidate nodes collection, when retaining both candidate nodes and eavesdropping chance, taken into account multi channel concurrent transmission, and then improved the throughput of channel.

Accompanying drawing explanation

Fig. 1 is that in background technology of the present invention, tradition minimizes the channel allocation result schematic diagram that link disturbs;

Fig. 2 is the unified channel allocation result schematic diagram in background technology of the present invention;

Fig. 3 is the limit conflict schematic diagram of the traditional route in the embodiment of the present invention;

Fig. 4 is the conflict schematic diagram of the chance route 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) is the node neighbours schematic diagram in the embodiment of the present invention one;

Fig. 7 (b) is the link interference schematic diagram in the embodiment of the present invention one;

Fig. 7 (c) is that the both candidate nodes collection in the embodiment of the present invention one disturbs schematic diagram;

Fig. 7 (d) is that the both candidate nodes collection in the embodiment of the present invention one disturbs schematic diagram;

Fig. 8 is the flow chart of the interference relationships between the definite both candidate nodes collection in the embodiment of the present invention one;

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;

Figure 11 is the number of channel that in the invention process, different channels distribution method average out to CFS distributes;

Figure 12 is the average interference value of different channels distribution method in the invention process;

Figure 13 is different channels distribution method throughput under heavy duty in the invention process;

Figure 14 is all cumulative distribution tables that converge throughput in the invention process.

Embodiment

For the scheme of the embodiment of the present invention is clearly described, first in conjunction with the limit conflict graph of traditional route of network topology and the conflict graph of the chance route of the network topology based on described in background technology based on described in background technology, the basic principle of the channel allocation in the embodiment of the present invention is described.

Based on link or limit, disturb corresponding limit conflict graph as shown in Figure 3, the link in network topological diagram is transformed into the node in the conflict graph of limit, and two links of network topological diagram phase mutual interference correspond between two nodes in the conflict graph of limit and have a limit.Conventional channel is distributed the conflict graph based on this kind of link, by carrying out the interference existing between smallest link to link assignment channel.

Chance route conflict graph as shown in Figure 4, node in chance route conflict graph or the node in network topological diagram, but each node comprises the link set that node can use, this node that is chance route is the link set between sending node and both candidate nodes, so destination node does not have corresponding node.As long as existing, internodal link set disturbs a limit of two corresponding existence of node.

At traditional routing mode link SA and SB, AB and AD are mutual conflicts.And chance route is owing to there being a plurality of both candidate nodes, allow link SA and SB, AB and AD coexist.According to the analysis of chance route conflict graph, should be as a whole distribution of a plurality of both candidate nodes binding of a node while carrying out channel allocation in chance route, as the integral body that a plurality of both candidate nodes of node and this node are formed calls a both candidate nodes collection, so mainly solve ground with regard to problem just to link assignment channel, become to both candidate nodes collection allocated channel, while carrying out channel allocation, both candidate nodes collection should have been distributed as a channel-assignment unit.By reduce the interference between both candidate nodes collection and both candidate nodes collection to both candidate nodes collection allocated channel as far as possible, carry out elevator meeting routing performance.According to this thinking, when using the chance route of transmission means of one-to-many, the channel assignment scheme that the embodiment of the present invention proposes is a kind of channel assignment scheme based on both candidate nodes collection.

Below in conjunction with specific embodiment, describe the present invention program in detail.

Common, can be with the non-directed graph G=(V of an expansion, E, R, K) represent the many radio frequencies multi-channel wireless mesh network that comprises N node as shown in Figure 5, wherein V represents N set of node, E represents the matrix of link between node, R represents configurable less radio-frequency number of each node (being also radio frequency interface or wave point, when the radio frequency quantity of supposing the configuration of all nodes equates), and K represents the number of spendable orthogonal channel 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, as shown in Figure 6, comprises the following steps:

Step 101: determine and both candidate nodes collection that in wireless mesh network, each node is corresponding.

The both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node; In the source node of a stream and destination node, when known, the route criterion of the route of improving the occasion can be determined the both candidate nodes corresponding with each node, and when the both candidate nodes corresponding with each node is known, chance route can be determined the route of this stream.

Described route machine criterion can be: expected transmission times (Expected Transmission Count, ETX), expect any the number of transmissions (Expected Anypath Transmission Count, EAX), expectation transmission time (Expected Transmission Time, ETT) or expect any transmission time (Expected Anypath Transmission Time, EATT) etc.

Wherein, route criterion is to be responsible for routing, and chance route is to choose behind road, determines between the node on road and how to transmit.

Described ETX is an exact numerical values recited of weighing link-quality in Path selection process.Expectation transmission times (comprising re-transmission) when the ETX value of an independent link is defined as packet and successfully sends on this link.

In chance route, the corresponding a plurality of both candidate nodes FN of each node i (i), node i and its both candidate nodes FN (i) can form a both candidate nodes collection (Candidate Forwarder Set so, CFS), the link that all nodes that this both candidate nodes is concentrated form forms candidate's link set (limit that also can say all nodes compositions that both candidate nodes is concentrated forms a candidate limit collection, does not distinguish limit and link, summit and node in the embodiment of the present invention).If the both candidate nodes of node i comprises node 1 and node 2, the both candidate nodes of node p comprises node 3 and node 4.A both candidate nodes collection of node 1, node 2 nodes and node i configuration node i so, the both candidate nodes collection of node 3, node 4 and node p configuration node p.All both candidate nodes collection form the set (Set of Candidate Forwarder Sets, CFSs) of both candidate nodes collection.

It should be noted that, be not all corresponding both candidate nodes collection of each node, and some nodes may not have both candidate nodes collection, and for example, destination node is owing to not needing forwarding, therefore it does not have both candidate nodes, further, also not corresponding both candidate nodes collection.

While describing both candidate nodes collection with mathematical linguistics, when a wireless mesh network that comprises N node exists M both candidate nodes collection, the relation between node and both candidate nodes collection can be by the matrix S of N * M n * Mrepresent.If node i is the element of m both candidate nodes collection, be designated as i ∈ m and S (i, m)be 1, otherwise and S (i, m)be 0.

Step 102: according to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determine all feasible both candidate nodes collection channel assignment scheme.

Concrete, described both candidate nodes collection channel allocation number constraints is: be that a both candidate nodes collection at least distributes a channel;

The radio frequency interface number constraints of described each node is: the number of channel summation of distributing for each node is less than or equal to the radio frequency number that this node has.

Step 103: select a channel assignment scheme from all feasible both candidate nodes collection channel assignment scheme.

Wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes.

Concrete, the link interference between the described collection of both candidate nodes between two can but be not limited to and determine in the following manner:

The first step: the estimated value of determining the interference between the link of the node formation that a both candidate nodes collection comprises and the link of the node formation that another both candidate nodes collection comprises.

Wherein, described estimated value is to obtain in the situation that all both candidate nodes collection of supposition are used same channel;

Second step: under both candidate nodes collection channel assignment scheme, be defined as channel set that a described both candidate nodes collection distributes and the common factor of the channel set that distributes for described another both candidate nodes collection.

The 3rd step: the interference value between the link that the node that the link that the node that the product of the number of element in the described estimated value of determining and described common factor is comprised as a described both candidate nodes collection forms and another both candidate nodes collection comprise forms.

Wherein, when the described common factor of determining is empty set, in this common factor, the number of element is 0.

Above-mentioned the 3rd step that is to say described estimated value is multiplied each other with the number that two both candidate nodes collection have identical channel, obtains the link interference between two both candidate nodes collection.

Further, the above-mentioned first step can be come to determine in the following manner:

Step 1) is determined the interference between the link comprising in wireless mesh network.

In this step 1), determine that the interference between the link comprising in wireless mesh network is specially:

Step 11: according to the position of node, determine neighbours' collection of each node, neighbours' collection of node refers to the physical transfer distance of this node and is less than the set of the node of setpoint distance, or refers to that the packet delivery fraction of the link forming with this node is greater than the set of the node of setting threshold;

It should be noted that to only have in embodiments of the present invention and ought the large value of two internodal link packet delivery fractions just think that the direct link between them exists, each other neighbours.That is to say for any link l (i, j) ∈ E has a corresponding link packet delivery fraction p (i, j), be illustrated in link in noiseless situation and correctly receive packet success rate, this packet success rate can be calculated acquisition by propagation model.Suppose that link is symmetrical p (i, j)=p (j, i), and the link packet delivery fraction of arbitrary node is all independently.A neighbours Nb (i) who jumps of defined node i is the node set of p (i, j) >=P0, wherein P0<<1.For remaining any node j that does not belong to Nb (i), link packet delivery fraction is 0, i.e. p (i, j)=0.Under such scene, transmission range is the same with interference range.

Step 12: according to neighbours' collection of each node of determining, determine the link interference collection corresponding with each link comprising in wireless mesh network, wherein, the node comprising in each link that the first link is corresponding link interference is concentrated is the neighbor node of the node that this first link comprises.

Step 2) according to the link of the interference between the link comprising in wireless mesh network and the concentrated node formation comprising of each both candidate nodes, determine the interference between the concentrated link comprising of the concentrated link comprising of a both candidate nodes and another both candidate nodes.

The both candidate nodes corresponding with node concentrates the link comprising to refer to this this node and the concentrated link that arbitrary both candidate nodes forms except self of its both candidate nodes.Below by concentrating the link comprising to describe to both candidate nodes for example, for example: the both candidate nodes of supposing node A is Node B, node C and node D, also the both candidate nodes collection corresponding with node A is that { A, B, C, D}, this both candidate nodes integrates that { link comprising in A, B, C, D} is as link AB, link AC, link AD.

The interference of step 3) between the concentrated link comprising of a both candidate nodes of determining and the concentrated link comprising of another both candidate nodes is as described estimated value.

With mathematical linguistics, to the interference collection of node neighbours collection, link interference collection, both candidate nodes collection, node, disturb the concept of collection and the relation between them to be described below:

1) node neighbours collection

Two node i and p are that neighbours refer to that the physical distance of two nodes is less than transmission range, or between node, the packet delivery fraction of link is greater than P0, as shown in Fig. 7 (a).The set that all neighbor nodes of node i form is exactly neighbours' collection of node i, uses represent.

2) link interference collection

Between link l (i, j) and l (p, q), exist to disturb to refer to that the transmitting terminal of link and receiving terminal exist and disturb, i.e. node i and p, or node i and q, or node j and p, or node j and p neighbours each other, as shown in Fig. 7 (b).All links that disturb with link l (i, j), the link interference collection of formation link l (i, j), uses Γ (i, j)represent.

3) the interference collection of both candidate nodes collection

Two both candidate nodes collection exist to disturb and refer to, as long as exist and disturb between the candidate limit that all nodes of both candidate nodes collection form, these two both candidate nodes collection just exist and disturb.As shown in Fig. 7 (c), node 1, node 2 nodes and node i form a both candidate nodes collection, node 3, node 4 nodes and node p form another both candidate nodes collection, as long as link l (1, i) or l (2, i) with l (3, p), l (4, p) one in there is interference, and these two both candidate nodes collection just exist and disturb.All both candidate nodes collection that disturb with both candidate nodes collection u form the interference collection of both candidate nodes collection u, use Η (u)represent.

H ( u ) = { v &Element; CFSs : &Exists; i &Element; u , j &Element; u , &Exists; p &Element; v , q &Element; v , ( i , j ) &Element; &Gamma; ( p , q ) } - - - ( 4 )

4) node disturbs collection

As long as the link phase mutual interference of two nodes and their neighbor node formations separately, two node phases mutual interference, as shown in Fig. 7 (d).The interference collection F (i) of the node configuration node i that all and node i are disturbed.

From above-mentioned statement, what node neighbours represented is the relation between node, and what link interference represented is the relation between link, and it is to be determined by the relation between link set that the interference of both candidate nodes collection and node disturb.The strict degree of defining relation strengthens gradually: node neighbours < link interference < both candidate nodes collection disturbs < node to disturb.

With the matrix I of M * M, represent the interference relationships between both candidate nodes collection, as u both candidate nodes collection and v both candidate nodes collection existence interference, I (u, v)be 1; Otherwise I (u, v)be 0.

After the both candidate nodes collection of known each node, according to internodal link delivery ratio, the interference relationships between all both candidate nodes collection is determined in the definition of interference collection that can be by above-mentioned node neighbours collection, link interference collection and both candidate nodes collection, determines the flow process of the interference relationships between both candidate nodes collection as shown in Figure 8.

Step 104: will be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.

While understanding the scheme of the embodiment of the present invention from the angle of mathematics, the content relating in above-mentioned steps 102 and step 103 can be summed up as respectively constraints and the target function under this constraints, during concrete enforcement, can utilize mathematical linguistics to describe described constraints and target function, and target function is solved under constraints to the channel assignment scheme that obtains each node, specific as follows:

(1) mathematical linguistics of constraints is described

In determining wireless mesh network after the both candidate nodes corresponding with each node, the relational matrix S between definable node and both candidate nodes collection n * M, when node i is the element of m both candidate nodes collection, the relational matrix S between this node and both candidate nodes collection n * Melement S (i, m)=1; Otherwise S (i, m)=0; And the channel allocation matrix A of definition both candidate nodes collection m * K, when m both candidate nodes collection used k channel, this channel allocation matrix A m * Kelements A (m, k)=1; Otherwise, A (m, k)=0,

Above-mentioned both candidate nodes collection channel allocation number constraints can be expressed as:

&Sigma; k = 1 K A ( m , k ) &GreaterEqual; 1 ; - - - ( 7 )

A node may be comprised in a plurality of both candidate nodes and concentrate, as long as both candidate nodes collection has distributed a channel under node, this node has also been assigned with this channel so.Therefore can, according to the relational matrix S between both candidate nodes collection and node and both candidate nodes collection channel allocation matrix A, obtain the channel allocation matrix X into both candidate nodes collection allocated channel posterior nodal point n * K,

?

Wherein, K is orthogonal channel number available in wireless network network diagram, k=1,2 ... K; N is the number of node in wireless network network diagram, i=1,2 ... N; M is the number of definite both candidate nodes collection, X n * Kfor the channel allocation matrix of node, X (i, k)=1 expression node i has been used k channel, X (i, k)=0 expression node i is not used k channel, m=1,2 ... M.

It should be noted that, for simplifying the statement to above-mentioned formula (8), can represent the channel allocation of both candidate nodes collection of above-mentioned formula (8) and the relation between the channel allocation of node by linear inequality (9) below:

0 &le; X ( i , k ) - 1 L &Sigma; m = 1 M S ( i , m ) A ( m , k ) < 1 - - - ( 9 )

In formula (9), L is any real number that is greater than M, if the affiliated both candidate nodes collection of node i is described, and at least one has been assigned with channel k, due to according to inequality, must there is X (i, k)=1; If illustrate that the both candidate nodes collection under node i has not all been assigned with channel k, must have X according to inequality (i, k)=0;

Channel allocation matrix at node is X n * Ktime, the radio frequency interface number constraints of above-mentioned each node is expressed as:

&Sigma; k = 1 N X ( i , k ) &le; R i - - - ( 10 )

Wherein, R ithe radio frequency number having for node i.

(2) mathematical linguistics of target function is described

Define the link interference relational matrix I between u both candidate nodes collection and v both candidate nodes collection m * M, before channel allocation, determine between u both candidate nodes collection and v both candidate nodes collection and exist while disturbing, I (u, v)=1; Otherwise, I (u, v)=0;

Before channel allocation, determine that between u both candidate nodes collection and v both candidate nodes collection, existing while disturbing not is that between u both candidate nodes collection and v both candidate nodes collection, real existence disturbed, but a kind of supposed situation all both candidate nodes collection use the interference existing in the situation of same channel, therefore, be called estimated value; After channel allocation, only have when u both candidate nodes collection and v both candidate nodes collection have distributed identical channel, between u both candidate nodes collection and v both candidate nodes collection, real existence disturbed.

If use I (u, v)represent to determine the interference existing between u both candidate nodes collection and v both candidate nodes collection before channel allocation, use I' (u, v)represent the real interference existing between u both candidate nodes collection and v both candidate nodes collection,

I ( u , v ) &prime; = &Sigma; k = 1 K A ( u , k ) A ( k , v ) &times; I ( u , v ) - - - ( 11 )

Described target function can be expressed as:

min &Sigma; u = 1 M &Sigma; v = 1 M ( I ( u , v ) &prime; ) - - - ( 12 )

U=1,2 wherein ... M; V=1,2 ... M.

After constraints and target function are carried out to formulation, can know, this Channel Assignment Problems is an integer quadratic programming problem, and then can solve by protruding optimum theory, in practical application, can directly use Lingo software to solve the channel allocation matrix A that obtains both candidate nodes collection m * K.

According to the channel allocation matrix A of both candidate nodes collection m * K, while determining the channel assignment scheme of node, can be by the relational matrix S between node and both candidate nodes collection n * Mchannel allocation matrix A with both candidate nodes collection m * Ksubstitution formula obtain the channel allocation matrix X of node n * K.

Because the scheme of the embodiment of the present invention one is to integrate base unit as channel allocation (be about to a both candidate nodes collection do as a whole it is carried out to channel allocation) with both candidate nodes, and the channel assignment scheme obtaining can make the link interference between both candidate nodes collection minimum, therefore, can obtain more concurrent transmission and retain the both candidate nodes that chance route brings and eavesdrop chance, and then can improve the throughput of wireless mesh network.

In the embodiment of the present invention two, by a concrete example, the scheme of the embodiment of the present invention one is described below.

Embodiment bis-

In wireless mesh network topology figure as shown in Figure 9, have 4 nodes and 1 stream, source node is 1, and destination node is 4., in network, there are 3 orthogonal channels (K=3) in each node configuration 2 less radio-frequency (R=2).The packet delivery fraction of the numeral link on limit.Need to carry out channel allocation 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, by (Expected Transmission Count, ETX) expected transmission times route criterion is calculated the both candidate nodes that can obtain each node, wherein the both candidate nodes of node 1 comprises 2,3 and 4, the both candidate nodes of node 2 comprises 3 and 4, and the both candidate nodes of node 3 comprises 4.Each node and its both candidate nodes are bundled into as a whole, as a both candidate nodes collection, can obtain so all both candidate nodes collection, totally three both candidate nodes collection (M=3).3 both candidate nodes collection are respectively { 1,2,3,4}, { 2,3,4} and { 3,4}.The value of s-matrix that represents so node and both candidate nodes collection relation is as follows:

S = 100 110 111 111

Second step: according to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determine all feasible both candidate nodes collection channel assignment scheme.

Concrete, in the embodiment of the present invention two, both candidate nodes collection distributes number constraints to be: each both candidate nodes collection of concentrating for above-mentioned 3 both candidate nodes at least distributes a channel;

In the embodiment of the present invention two, the radio frequency interface number constraints of each node is: the number of channel summation of distributing for above-mentioned each node is less than or equal to 2.

The 3rd step: determine respectively both candidate nodes collection 1 and both candidate nodes collection 2, both candidate nodes collection 2 and both candidate nodes collection 3, both candidate nodes collection 1 and both candidate nodes collection 3 and the Interference Estimation value of each both candidate nodes collection self to self.

The link and the interference relationships between link that according to both candidate nodes collection, comprise can obtain the interference relationships between both candidate nodes collection.Between the link comprising due to three both candidate nodes collection, all there is interference, these three also phase mutual interference of both candidate nodes collection.The estimated value matrix I that represents the interference between both candidate nodes collection is 1 entirely.

I = 111 111 111

The 4th step: determine under each both candidate nodes collection channel assignment scheme, the link interference between all both candidate nodes collection, and therefrom select and make to disturb between both candidate nodes collection minimum both candidate nodes collection channel assignment scheme.

The 5th step: will be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.

Above-mentioned five steps can be summed up as: known S, and I, R, K and M, as input substitution (12), utilize Lingo software to solve, and can obtain the channel allocation matrix A of both candidate nodes collection m * Kchannel allocation matrix X with corresponding node n * K, be respectively:

A = 110 110 110 , X = 110 110 110 110

Because all nodes in the embodiment of the present invention two are all in mutual communication range, similar with the described example of Fig. 4, all nodes distribute the same channel just can reach better network performance.Therefore the method for channel allocation result based on both candidate nodes collection is also that all nodes distribute the same channel.

It should be noted that, if there is not homogeneous turbulence in wireless mesh network, can according to the scheme of the embodiment of the present invention one and embodiment bis-, to this stream, process according to every first-class source node and destination node.

Embodiment tri-

Same inventive concept based on embodiment mono-and embodiment bis-, the embodiment of the present invention three provides a kind of channel dividing arrangement, and as shown in figure 10, described device comprises:

Both candidate nodes collection determination module 11, for determining the both candidate nodes collection corresponding with each node of wireless mesh network, the both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node;

Both candidate nodes collection channel assignment scheme determination module 12, for according to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determines all feasible both candidate nodes collection channel assignment scheme;

Channel assignment scheme is selected module 13, for selecting a channel assignment scheme from all feasible both candidate nodes collection channel assignment scheme, wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes;

Node channel assignment module 14, for will be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.

Preferably, described channel assignment scheme is selected module 13, specifically for determining the estimated value of the interference between the link of the node formation that a both candidate nodes collection comprises and the link of the node formation that another both candidate nodes collection comprises, under both candidate nodes collection channel assignment scheme, the common factor of the channel set that is defined as channel set that a described both candidate nodes collection distributes and distributes for described another both candidate nodes collection, interference value between the link that the node that the link that the node that the product of the number of element in the described estimated value of determining and described common factor is comprised as a described both candidate nodes collection forms and another both candidate nodes collection comprise forms, wherein, described estimated value is to obtain in the situation that all both candidate nodes collection of supposition are used same channel, when the described common factor of determining is empty set, in this common factor, the number of element is 0.

Further, described channel assignment scheme is selected module 13, specifically for determining the interference between the link comprising in wireless mesh network; According to the link of the interference between the link comprising in wireless mesh network and the concentrated node formation comprising of each both candidate nodes, determine the interference between the concentrated link comprising of the concentrated link comprising of a both candidate nodes and another both candidate nodes; Interference between the concentrated link comprising of a both candidate nodes of determining and the concentrated link comprising of another both candidate nodes is as described estimated value.

Concrete, described both candidate nodes collection channel allocation number constraints is: be that a both candidate nodes collection at least distributes a channel; The radio frequency interface number constraints of described each node is: the number of channel summation of distributing for each node is less than or equal to the radio frequency number that this node has.

The beneficial effect of the scheme of the embodiment of the present invention is: first, for avoiding channel allocation, conflict mutually with chance route transmission mode, the channel assignment scheme of formulating is produced effect more, interference model and the computational methods of both candidate nodes collection have been proposed, for each both candidate nodes collection rather than single link carry out channel allocation, therefore be compared with prior art more suitable for the transmission means of chance route, can fully excavate chance route high-throughput advantage; Secondly, determine channel allocation to as if both candidate nodes collection after, in order to improve network throughput, the target of distributing is the link interference sum total minimizing between both candidate nodes collection, the transmission unit that so just can allow more chance route both candidate nodes collection form carries out concurrent transmission, thereby channel resource is made full use of by chance route, greatly improved network end-to-end throughput.

Channel assignment scheme for the further description embodiment of the present invention, by channel assignment scheme based on both candidate nodes collection of the present invention and other three kinds of existing channel assignment scheme are disturbed and throughput performance compares, concrete operations condition and comparative result are as follows:

In interference ratio, go up, the both candidate nodes collection that relatively different channels allocative decision produces disturbs.Aspect throughput, utilize Dice performance analysis models, it is expanded to the multi channel analysis of many radio frequencies to the throughput analysis under injection frequency single channel.Utilize this throughput analysis instrument, the network performance based under both candidate nodes collection channel allocation is assessed.Disturb and throughput performance comparison with other 3 kinds of different channels distribution methods, be respectively:

Random assignment (Rand): be node Random assignment channel;

Unified distribution (Unif): all nodes distribute identical channel;

Conventional allocation (Trad): adopt and minimize the method for channel allocation that link disturbs;

Distribution based on both candidate nodes collection (CFSCA): use the application's method to carry out channel allocation.

16 nodes of random placement in the region of 400*400 rice, and guarantee that average nodal degree is at least 2, as long as the delivery ratio between two nodes is greater than 0.1 and just has a link, 2 less radio-frequency network interface cards of each node configuration, use 802.11b network can with orthogonal channel number be 3.In Route Selection, adopt ETX to determine both candidate nodes.Under identical source node and destination node selection, order is carried out 4 kinds of mechanism.Experiment adopts decline (shadowing model) path model, and channel speed is 11M.

Interference is relatively the interference sum between CFS.Only have when the mutual interference of two CFS phases, and while having distributed identical channel, two CFS just really exist and disturb.Calculate the interference sum between all CFS.It should be noted that under conventional allocation and Random assignment possibly cannot guarantee is that all nodes in a CFS at least distribute a common channel.So the number of channel and interference value that statistics is distributed for CFS.5 network topologies of random generation, random 6 groups of source nodes and the destination node selected under each network topology, every group comprises 8 streams, produces saturation volume.Calculate the number of channel and interference value for CFS distribution under different channels distribution, then average.

In Figure 11, univesral distribution is for all CFS have distributed 2 channels, and random and conventional allocation all not reach the value of half be exactly not to be all channels of CFS distribution, namely the node of not all CFS has all been shared identical channel.CFSCA is greater than half, has met for all CFS allocated channels.Because the unpromising all CFS allocated channels of conventional allocation and Random assignment, although from Figure 12 their interference value less be also useless, the interference value under CFSCA and unified distribution relatively.Can find out that CFSCA, in the situation that guaranteeing to CFS allocated channel, obtains again less interference very much.

Analyze the network throughput under heavy duty.5 network topologies of random generation, random 6 groups of source nodes and the destination node selected under each network topology, every group comprises 8 streams, produces saturation volume.In Figure 13, when selecting different source nodes and destination node under same network topology, four kinds of method for channel allocation produce converges throughput.First when using chance route, it is poor unlike traditional channel allocation to distribute unitedly, can use so the most simply unified distribution under the environment that cannot carry out complicated calculations.The throughput that CFSCA distributes all higher than or be not less than other distribution method.Figure 14 is all cumulative distribution tables that converge throughput.Calculate the average throughput under all topologys, four kinds of channel allocation are respectively: 11.5,13.1,12.1,14.4Mbps.CFSCA distributes and on average exceeds 25.2% than accidental channel, than unified channel, distributes and on average exceeds 10%, than conventional channel, distributes and on average exceeds 19%.

Those skilled in the art should understand, the application's embodiment can be provided as method, system or computer program.Therefore, the application can adopt complete hardware implementation example, implement software example or in conjunction with the form of the embodiment of software and hardware aspect completely.And the application can adopt the form that wherein includes the upper computer program of implementing of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) of computer usable program code one or more.

The application is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present application, device (system) and computer program.Should understand can be in computer program instructions realization flow figure and/or block diagram each flow process and/or the flow process in square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing unit to produce a machine, the instruction of carrying out by the processor of computer or other programmable data processing unit is produced for realizing the device in the function of flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame appointments.

These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing unit with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.

These computer program instructions also can be loaded on computer or other programmable data processing unit, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame on computer or other programmable devices.

Although described the application's preferred embodiment, once those skilled in the art obtain the basic creative concept of cicada, can make other change and modification to these embodiment.So claims are intended to all changes and the modification that are interpreted as comprising preferred embodiment and fall into the application's scope.

Obviously, those skilled in the art can carry out various changes and modification and the spirit and scope that do not depart from the application to the application.Like this, if within these of the application are revised and modification belongs to the scope of the application's claim and equivalent technologies thereof, the application is also intended to comprise these changes and modification interior.

Claims (13)

1. a method for channel allocation, is characterized in that, described method comprises:
Determine and the both candidate nodes collection that in wireless mesh network, each node is corresponding the both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node;
According to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determine all feasible both candidate nodes collection channel assignment scheme;
From all feasible both candidate nodes collection channel assignment scheme, select a channel assignment scheme, wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes;
To be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.
2. the method for claim 1, is characterized in that, the link interference between the described collection of both candidate nodes is between two determined in the following manner:
The estimated value of determining the interference between the link of the node formation that a both candidate nodes collection comprises and the link of the node formation that another both candidate nodes collection comprises, wherein, described estimated value is to obtain in the situation that all both candidate nodes collection of supposition are used same channel;
Under both candidate nodes collection channel assignment scheme, the common factor of the channel set that is defined as channel set that a described both candidate nodes collection distributes and distributes for described another both candidate nodes collection, interference value between the link that the node that the link that the node that the product of the number of element in the described estimated value of determining and described common factor is comprised as a described both candidate nodes collection forms and another both candidate nodes collection comprise forms, wherein, when the described common factor of determining is empty set, in this common factor, the number of element is 0.
3. method as claimed in claim 2, is characterized in that, determines in the following manner the estimated value of the interference between the link of the node formation that a both candidate nodes collection comprises and the link of the node formation that another both candidate nodes collection comprises:
Determine the interference between the link comprising in wireless mesh network;
According to the link of the interference between the link comprising in wireless mesh network and the concentrated node formation comprising of each both candidate nodes, determine the interference between the concentrated link comprising of the concentrated link comprising of a both candidate nodes and another both candidate nodes;
Interference between the concentrated link comprising of a both candidate nodes of determining and the concentrated link comprising of another both candidate nodes is as described estimated value.
4. method as claimed in claim 3, is characterized in that, the interference between the link comprising in described definite wireless mesh network, is specially:
According to the position of node, determine neighbours' collection of each node, neighbours' collection of node refers to the physical transfer distance of this node and is less than the set of the node of setpoint distance, or refers to that the packet delivery fraction of the link forming with this node is greater than the set of the node of setting threshold;
According to neighbours' collection of each node of determining, determine the link interference collection corresponding with each link comprising in wireless mesh network, wherein, the node comprising in each link that the first link is corresponding link interference is concentrated is the neighbor node of the node that this first link comprises.
5. method as claimed in claim 4, is characterized in that, described both candidate nodes collection channel allocation number constraints is: be that a both candidate nodes collection at least distributes a channel;
The radio frequency interface number constraints of described each node is: the number of channel summation of distributing for each node is less than or equal to the radio frequency number that this node has.
6. method as claimed in claim 5, is characterized in that,
Described is that a both candidate nodes collection at least distributes a channel, is specially:
Described number of channel summation of distributing for each node is less than or equal to the radio frequency number that this node has, and is specially: wherein,
Wherein, A m * Kfor the channel allocation matrix of both candidate nodes collection, when m both candidate nodes collection used k channel, this channel allocation matrix A m * Kelements A (m, k)=1; Otherwise, A (m, k)=0; S n * Mfor the relational matrix S between node and both candidate nodes collection n * M, when node i is the element of m both candidate nodes collection, the relational matrix S between this node and both candidate nodes collection n * Melement S (i, m)=1; Otherwise S (i, m)=0; K is orthogonal channel number available in wireless network network diagram, k=1,2 ... K; N is the number of node in wireless network network diagram, i=1,2 ... N; M is the number of definite both candidate nodes collection, R ifor the radio frequency number that node i has, the channel allocation matrix that X is node, X (i, k)=1 expression node i has been used k channel, X (i, k)=0 expression node i is not used k channel, m=1,2 ... M.
7. method as claimed in claim 6, is characterized in that,
Describedly from all feasible both candidate nodes collection channel assignment scheme, select a channel assignment scheme, this selecteed channel assignment scheme is specially the link interference minimum between all both candidate nodes collection: meeting with condition under, ask for satisfied the channel allocation matrix of both candidate nodes collection;
Wherein, I m * Mbe the estimated value matrix disturbing between u both candidate nodes collection and v both candidate nodes collection, have while disturbing I estimating between u both candidate nodes collection and v both candidate nodes collection (u, v)=1; Otherwise, I (u, v)=0; U=1,2 ... M; V=1,2 ... M.
8. method as claimed in claim 7, is characterized in that, the described channel that each both candidate nodes collection under node is distributed is all specially as the channel distributing for this node:
By the relational matrix S between node and both candidate nodes collection n * Mchannel allocation matrix A with both candidate nodes collection m * Ksubstitution formula , obtain the channel allocation matrix of node.
9. a channel dividing arrangement, is characterized in that, described device comprises:
Both candidate nodes collection determination module, for determining the both candidate nodes collection corresponding with each node of wireless mesh network, the both candidate nodes that the described both candidate nodes collection corresponding with each node comprises this node and this node;
Both candidate nodes collection channel assignment scheme determination module, for according to the radio frequency interface number constraints of both candidate nodes collection channel allocation number constraints and each node, determines all feasible both candidate nodes collection channel assignment scheme;
Channel assignment scheme is selected module, for selecting a channel assignment scheme from all feasible both candidate nodes collection channel assignment scheme, wherein, under the described channel assignment scheme of selecting, link interference between all both candidate nodes collection is minimum, link interference between all both candidate nodes collection refers to the concentrated summation of the link interference between a both candidate nodes collection between two of both candidate nodes, and the link interference between the described collection of both candidate nodes between two refers to the interference between the link of the concentrated node formation comprising of a both candidate nodes and the link of the concentrated node formation comprising of another both candidate nodes;
Node channel assignment module, for will be that the channel that distributes of each the both candidate nodes collection under node is all as the channel to this node distribution.
10. channel dividing arrangement as claimed in claim 9, is characterized in that,
Described channel assignment scheme is selected module, specifically for determining the estimated value of the interference between the link of the node formation that a both candidate nodes collection comprises and the link of the node formation that another both candidate nodes collection comprises, under both candidate nodes collection channel assignment scheme, the common factor of the channel set that is defined as channel set that a described both candidate nodes collection distributes and distributes for described another both candidate nodes collection, interference value between the link that the node that the link that the node that the product of the number of element in the described estimated value of determining and described common factor is comprised as a described both candidate nodes collection forms and another both candidate nodes collection comprise forms, wherein, described estimated value is to obtain in the situation that all both candidate nodes collection of supposition are used same channel, when the described common factor of determining is empty set, in this common factor, the number of element is 0.
11. channel dividing arrangements as claimed in claim 10, is characterized in that, described channel assignment scheme is selected module, specifically for determining the interference between the link comprising in wireless mesh network; According to the link of the interference between the link comprising in wireless mesh network and the concentrated node formation comprising of each both candidate nodes, determine the interference between the concentrated link comprising of the concentrated link comprising of a both candidate nodes and another both candidate nodes; Interference between the concentrated link comprising of a both candidate nodes of determining and the concentrated link comprising of another both candidate nodes is as described estimated value.
12. channel dividing arrangements as claimed in claim 11, it is characterized in that, described channel assignment scheme is selected module, specifically for according to the position of node, determine neighbours' collection of each node, according to neighbours' collection of each node of determining, determine the link interference collection corresponding with each link comprising in wireless mesh network, wherein, neighbours' collection of node refers to the set that is less than the node of setpoint distance with the physical transfer distance of this node, or the packet delivery fraction that refers to the link forming with this node is greater than the set of the node of setting threshold, wherein, the node of each link that link interference corresponding to the first link concentrated is the neighbor node of the node that this first link comprises.
13. channel dividing arrangements as claimed in claim 12, is characterized in that, described both candidate nodes collection channel allocation number constraints is: be that a both candidate nodes collection at least distributes a channel;
The radio frequency interface number constraints of described each node is: the number of channel summation of distributing for each node is less than or equal to the radio frequency number that this node has.
CN201310101899.1A 2013-03-27 2013-03-27 A kind of method for channel allocation and device CN104080088B (en)

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 true CN104080088A (en) 2014-10-01
CN104080088B CN104080088B (en) 2017-09-12

Family

ID=51601088

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310101899.1A 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)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105357288A (en) * 2015-10-23 2016-02-24 南京邮电大学 Cloud service uplink scheduling method in SDWN
CN106211179A (en) * 2016-09-12 2016-12-07 东南大学 The access point deployment of a kind of wireless cloud computing system and method for channel allocation
CN107071912A (en) * 2017-04-17 2017-08-18 北京星网锐捷网络技术有限公司 A kind of method and apparatus for distributing channel in a wireless local area network
CN110366253A (en) * 2019-06-18 2019-10-22 中国水产科学研究院渔业工程研究所 Method for channel allocation, equipment and storage medium based on cognition wireless network

Citations (3)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
HE SHIMING: "Distributed Low-Complexity Channel Assignment for Opportunistic Routing", 《DIGITAL COMMUNICATIONS》 *
彭利民等: "多信道无线Mesh网络信道分配算法", 《计算机应用》 *
章国安等: "认知无线Mesh网络中基于干扰模型的信道分配策略", 《计算机应用研究》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105357288A (en) * 2015-10-23 2016-02-24 南京邮电大学 Cloud service uplink scheduling method in SDWN
CN105357288B (en) * 2015-10-23 2019-03-05 南京邮电大学 A kind of cloud business uplink dispatch method at SDWN
CN106211179A (en) * 2016-09-12 2016-12-07 东南大学 The access point deployment of a kind of wireless cloud computing system and method for channel allocation
CN106211179B (en) * 2016-09-12 2019-11-26 东南大学 A kind of access point deployment and method for channel allocation of wireless cloud computing system
CN107071912A (en) * 2017-04-17 2017-08-18 北京星网锐捷网络技术有限公司 A kind of method and apparatus for distributing channel in a wireless local area network
CN110366253A (en) * 2019-06-18 2019-10-22 中国水产科学研究院渔业工程研究所 Method for channel allocation, equipment and storage medium based on cognition wireless network

Also Published As

Publication number Publication date
CN104080088B (en) 2017-09-12

Similar Documents

Publication Publication Date Title
Brar et al. Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks
Baker et al. The architectural organization of a mobile radio network via a distributed algorithm
Djukic et al. Link scheduling for minimum delay in spatial re-use TDMA
Palattella et al. On optimal scheduling in duty-cycled industrial IoT applications using IEEE802. 15.4 e TSCH
Basagni et al. A mobility-transparent deterministic broadcast mechanism for ad hoc networks
Vedantham et al. Component based channel assignment in single radio, multi-channel ad hoc networks
Kulkarni et al. A deterministic approach to throughput scaling in wireless networks
Chlamtac et al. On broadcasting in radio networks-problem analysis and protocol design
Madan et al. Distributed algorithms for maximum lifetime routing in wireless sensor networks
Cartigny et al. Localized minimum-energy broadcasting in ad-hoc networks
Chlamtac et al. Fair algorithms for maximal link activation in multihop radio networks
Yu et al. Multi-channel assignment in wireless sensor networks: A game theoretic approach
Eryilmaz et al. Polynomial complexity algorithms for full utilization of multi-hop wireless networks
Jain et al. Impact of interference on multi-hop wireless network performance
Florens et al. Lower bounds on data collection time in sensory networks
US20150188837A1 (en) Hierarchical Software-Defined Network Traffic Engineering Controller
Zheng Information Dissemination in Power-Constrained Wireless Networks.
US8948229B2 (en) Dynamic hopping sequence computation in channel hopping communication networks
US7660315B2 (en) Characterizing achievable flow rates in multi-hop mesh networks with orthogonal channels
Sagduyu et al. The problem of medium access control in wireless sensor networks
US7929460B2 (en) Communication network topology determination
Wan et al. Wireless link scheduling under physical interference model
Wang et al. Interference-aware joint routing and TDMA link scheduling for static wireless networks
Li et al. Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization
Wang et al. Distributed algorithms for max-min fair rate allocation in Aloha networks

Legal Events

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