CN101790233A - Channel allocating method and device for multichannel multi-interface wireless mesh network - Google Patents

Channel allocating method and device for multichannel multi-interface wireless mesh network Download PDF

Info

Publication number
CN101790233A
CN101790233A CN200910260711A CN200910260711A CN101790233A CN 101790233 A CN101790233 A CN 101790233A CN 200910260711 A CN200910260711 A CN 200910260711A CN 200910260711 A CN200910260711 A CN 200910260711A CN 101790233 A CN101790233 A CN 101790233A
Authority
CN
China
Prior art keywords
node
described
layer
via
channel
Prior art date
Application number
CN200910260711A
Other languages
Chinese (zh)
Other versions
CN101790233B (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 CN 200910260711 priority Critical patent/CN101790233B/en
Publication of CN101790233A publication Critical patent/CN101790233A/en
Application granted granted Critical
Publication of CN101790233B publication Critical patent/CN101790233B/en

Links

Abstract

The invention discloses a channel allocating method and a device for a multichannel multi-interface wireless mesh network, relating to the wireless mesh network. The channel allocating method comprises the following steps: determining a trunk node in a broadcast tree after generating the broadcast tree from all nodes in the wireless mesh network according to grades, constructing a multicast tree with the least number of nodes according to the trunk node, and performing channel allocation for each node in the constructed multicast tree. By using the technical scheme of the invention, the network throughout is improved to a large extent and the time delay is lowered.

Description

A kind of method for channel allocation of multichannel multi-interface wireless mesh network and equipment

Technical field

The present invention relates to based on wireless mesh network (Wireless Mesh Network), particularly a kind of method for channel allocation of multichannel multi-interface wireless mesh network and equipment.

Background technology

Wireless Mesh netword (WMN, Wireless Mesh Network claims wireless mesh network, wireless mesh network etc. again) is a kind of novel broadband wireless network, a kind of high power capacity, the distributed grid of two-forty.On network topology structure, wireless Mesh netword is similar to Ad Hoc network, but mobility is lower comparatively speaking for the user terminal of wireless Mesh netword, the basic transfixion of the most of nodes of network, and as power, change in topology is less without battery.Moreover wireless Mesh netword generally is not as an independently network form existence, but the wireless extension of internet core net, the main business of the node of wireless Mesh netword is the business that commutes internet gateway.Usually, have one or more gateway node (Gateway is also referred to as Neighborhood Access Point, neighboring access point) and link to each other with internet high speed, users such as family or office link to each other with gateway node by the access point of self.For the zone outside the covering of gateway node signal, user node is responsible for the relaying or the forwarding of dealing business, thereby realizes cheap on a large scale and the fast signal covering.And the main business of Ad hoc network node is the Business Stream between any a pair of node.Wireless Mesh netword has saved the infrastructure construction investment of networking initial stage costliness, to the Radio Access Network of multiple spot a lot of unrivaled advantages is arranged than traditional point.Because wireless Mesh netword has higher reliability, bigger retractility and lower cost of investment, so wireless Mesh netword can be used as a kind of new scheme that can solve wireless access " last kilometer " bottleneck problem.

Along with the continuous development of wideband multimedia network, various broadband networks are used and are emerged in an endless stream.Broadbands such as IPTV, video conference, data and data distribution, network audio application, Internet video application, multimedia remote education are used all the bearing capacity that has the wideband multimedia network now have been proposed challenge.The legacy network that adopts unicast technique to make up can't satisfy the requirement that emerging broadband network is applied in bandwidth and network service quality aspect, and the thing followed is network delay, loss of data an or the like problem.Introduced multicasting technology this moment.

At present, industry has proposed multi-signal-channel and multi-interface wireless Mesh netword technology based on the routing algorithm of single channel network with to the research of routing performance, can improve network throughput to a great extent.And about supporting method that the multi channel multicast channel of wireless Mesh netword distributes mainly based on LCA (LevelChannel Assignment, classification channel allocation) channel allocation algorithm, the advantage of this algorithm is: realize simply, can improve throughput.But this algorithm can not be removed the internodal interference of same levels, when the number of available channel than node hierarchy number for a long time, some channels can utilize less than, cause channel wastage.In addition, this algorithm has only been considered the situation of orthogonal channel, does not consider that there is situation about disturbing in adjacent channel.

Summary of the invention

Technical problem to be solved by this invention is a kind of method for channel allocation and equipment of multi-signal-channel and multi-interface wireless Mesh netword to be provided, thereby to optimize the channel allocation of the wireless Mesh netword of multi-signal-channel and multi-interface.

In order to address the above problem, the invention discloses a kind of method for channel allocation of supporting based on wireless mesh network, comprise: after all nodes in the based on wireless mesh network are generated the broadcasting tree by grade, determine the via node in the described broadcasting tree, and according to described via node, structure comprises the minimum multicast tree of interstitial content, and each node for constructed multicast tree carries out channel allocation again.

Further, in the said method, determine that the process of the via node in the described broadcasting tree is as follows:

Each node of described broadcasting tree is successively determined via node according to the top-down order, wherein, when determining certain one deck via node, from the lower level node of this layer, select the node of father node minimum number earlier, with the father node of selected lower level node alternative via node as this layer, to have the via node that the maximum node of child node number is defined as this layer in current definite alternative via node again, from this layer, ignore determined via node then, all child nodes of from the lower level node of this layer, ignoring determined via node, select the alternative via node of this layer then according to the residue node of the lower level node of this layer, from alternative via node, determine other via nodes of this layer, when the lower level node of this layer all was left in the basket, the via node of this layer was all determined.

Wherein, have the maximum node of child node number in the described alternative via node and be two when above, the arbitrary node in the described node is defined as via node.

According to described via node, it is as follows to make up the process that comprises the minimum multicast tree of interstitial content:

Determine multicast source node and multicast receiving node, with overlay multicast receiving node number is maximum in the described broadcasting tree higher level's via node first node as described multicast tree, from each layer via node of described broadcasting tree, choose the upper level via node of described first node again according to order from bottom to top, up to the root node of choosing described first node, finally be built into multicast tree by all via nodes of choosing and determined multicast source node and multicast receiving node.

The process of carrying out channel allocation for each node of constructed multicast tree is as follows:

For determined multicast source node distributes a channel, be each node layer allocated channel of described multicast tree again according to the top-down order, wherein, in the allocated channel process, the interference summation minimum of all interchannels that a channel that distributes for each node and a hop neighbor node of this node are occupied.

The little finger of toe of the interference summation of all interchannels that the channel that distributes for each node and a hop neighbor node of this node are occupied is the channel c of node distribution vAll channels that occupied with a hop neighbor node of this node satisfy following formula and require:

min Σ ∀ w ∈ N ( v ) σ 2 ( c v , c w )

In the formula, a N (hop neighbor set of node of v) representing described present node;

c v, be expressed as the channel that described present node distributes;

c w, represent the channel that a hop neighbor node W of described present node is occupied;

Equal Expression channel c vWith channel c wBetween interference factor.

When the interference of all interchannels that occupied when the hop neighbor node with described node is satisfied channel that described formula requires and had many, will give described node with the channel allocation of last channel spacing minimum of distributing in many channels.

The invention also discloses a kind of equipment of supporting the channel allocation of based on wireless mesh network, comprise broadcasting tree generation module, multicast tree generation module and channel assignment module, wherein:

Described broadcasting tree generation module is used for all nodes with based on wireless mesh network by grade classification, generates the broadcasting tree, and all via nodes in the broadcasting tree of determining to be generated;

Described multicast tree generation module is used for the via node according to described broadcasting tree, makes up to comprise the minimum multicast tree of interstitial content;

Described channel assignment module is used to each node of constructed multicast tree to carry out channel allocation.

Further, in the said equipment, described broadcasting tree generation module, each node of described broadcasting tree is successively determined via node according to the top-down order, wherein, when determining certain one deck via node, from the lower level node of this layer, select the node of father node minimum number earlier, with the father node of selected lower level node alternative via node as this layer, to have the via node that the maximum node of child node number is defined as this layer in current definite alternative via node again, from this layer, ignore determined via node then, all child nodes of from the lower level node of this layer, ignoring determined via node, select the alternative via node of this layer then again according to the residue node of the lower level node of this layer, from alternative via node, determine the via node of this layer, when the lower level node of this layer all was left in the basket, the via node of this layer was all determined.

Wherein, described multicast tree generation module, determine multicast source node and multicast receiving node, with overlay multicast receiving node number is maximum in the described broadcasting tree higher level's via node first node as described multicast tree, from each layer via node of described broadcasting tree, choose the upper level via node of described first node again according to order from bottom to top, up to the root node of choosing described first node, finally be built into multicast tree by all via nodes of choosing and determined multicast source node and multicast receiving node.

Described channel assignment module, for determined multicast source node distributes a channel, be each node layer allocated channel of described multicast tree again according to the top-down order, wherein, in the allocated channel process, the interference summation minimum of all interchannels that a channel that distributes for each node and a hop neighbor node of this node are occupied.

Adopt technical solution of the present invention, improved network throughput to a great extent, and reduced time delay.

Description of drawings

Fig. 1 is the channel allocation flow chart of multi-signal-channel and multi-interface wireless Mesh netword in the present embodiment;

Fig. 2 is a kind of wireless Mesh netword topology diagram;

Fig. 3 is the broadcasting tree structure diagram that is generated by Fig. 2 in the present embodiment;

Fig. 4 (a), Fig. 4 (b), Fig. 4 (c), Fig. 4 (d), be the process schematic diagram of in broadcasting tree, selecting via node in the present embodiment;

Fig. 5 (a), Fig. 5 (b) are that broadcasting hedge clipper sanction is the process schematic diagram of multicast tree in the present embodiment;

Fig. 6 is in the present embodiment being the flow chart that the multicast tree that generated is carried out channel allocation;

Fig. 7 is the network throughput comparison diagram when adopting technical solution of the present invention and existing LCA algorithm;

Fig. 8 is the time delay comparison diagram when adopting technical solution of the present invention and existing LCA algorithm.

Embodiment

Below in conjunction with drawings and the specific embodiments technical solution of the present invention is described in further details.

A kind of channel assigning device of multichannel multi-interface wireless mesh network mainly comprises broadcasting tree generation module, multicast tree generation module and channel assignment module.Introduce the function of each module below.

Broadcasting tree generation module is used for all nodes with based on wireless mesh network by grade classification, generates the broadcasting tree, and determines all via nodes in the broadcasting tree;

Wherein, broadcasting tree generation module, each node of described broadcasting tree is successively determined via node according to the top-down order, wherein, when determining certain one deck via node, from the lower level node of this layer, select the node of father node minimum number earlier, with the father node of selected lower level node alternative via node as this layer, to have the via node that the maximum node of child node number is defined as this layer in current definite alternative via node again, from this layer, ignore determined via node then, all child nodes of from the lower level node of this layer, ignoring determined via node, select the alternative via node of this layer then again according to the residue node of the lower level node of this layer, from alternative via node, determine the via node of this layer, when the lower level node of this layer all was left in the basket, the via node of this layer was all determined;

In the selected lower level node node of father node minimum number may exist one or more (like this, determined alternative via node also exists one or more in the same operation), wherein, the node of a plurality of father node minimum number refers to, the father node number of a plurality of nodes is identical, and the father node number of these a plurality of nodes is the minimum value of father node number in the lower level node;

Having the maximum node of child node number in the determined alternative via node may exist one or more, wherein, having the maximum a plurality of nodes of child node number refers to, the child node number of a plurality of nodes is identical, and the child node number of these a plurality of nodes is maximums of determined alternative via node neutron interstitial content, exist when a plurality of when having the maximum node of child node number in the alternative via node, can be with any node in these a plurality of nodes as via node.

The multicast tree generation module is used for the via node according to the broadcasting tree that generates, and makes up to comprise the minimum multicast tree of interstitial content;

Wherein, the multicast tree generation module is determined multicast source node and multicast receiving node, with overlay multicast receiving node number is maximum in the described broadcasting tree higher level's via node first node as described multicast tree, from each layer via node of described broadcasting tree, choose the upper level via node of described first node again according to order from bottom to top, up to the root node of choosing described first node, finally be built into multicast tree by all via nodes of choosing and determined multicast source node and multicast receiving node.

Channel assignment module is used to each node of constructed multicast tree to carry out channel allocation;

In the present embodiment, channel assignment module is that determined multicast source node distributes a channel, be each node layer allocated channel of described multicast tree again according to the top-down order, wherein, in the allocated channel process, the interference summation minimum of all interchannels that the channel that distributes for each node layer and the one hop neighbor node of this node are occupied, particularly, calculate earlier the interference summation of all interchannels that assignable each channel and a hop neighbor node that carries out the present node of channel allocation occupied respectively, the more pairing channel allocation of being calculated of least interference summation is got final product to present node.

Following mask body is introduced the process that the said equipment carries out the channel allocation of multichannel multi-interface wireless mesh network.

Present embodiment is an example with wireless Mesh netword topological structure shown in Figure 2, introduce a kind of process of based on wireless mesh network channel allocation of multi-signal-channel and multi-interface, this process is divided into different grades with network node, after being built into the minimum multicast tree of via node, adopt the principle of channel disturbance minimum to carry out channel allocation again.Wherein, in the topological structure shown in Figure 2, s is the multicast source node, e, and f, g are the multicast receiving node, particularly, the process of channel allocation as shown in Figure 1, may further comprise the steps:

Step 100 is divided into different grades with all nodes in the wireless Mesh netword, generates the broadcasting tree; In the present embodiment, based on BFS algorithm (Breadth-First-Search, BFS) search, all nodes in the wireless Mesh netword are divided into different grades, generate the broadcasting tree, wherein, according to the BFS search, the node among Fig. 2 can be divided into following grade:

level?0={s}

level?1={a,b}

level?2={c,d,e}

level?3={f,g};

Then, the edge of any two nodes of deletion same levels finally obtains broadcasting tree as shown in Figure 3.

In other application scenarioss, this step also can be divided into different grades with all nodes in the wireless Mesh netword based on DFS (Depth-First-Search, the algorithm of depth-first search) scheduling algorithm, generates the broadcasting tree.

Step 200, employing top-down analytic approach is found out the via node in the broadcasting tree that is generated;

In this step, when from the broadcasting tree, selecting via node, specifically operate according to following steps:

1) in determining the broadcasting tree, during the via node of i node layer, from following one deck (being the i+1 layer) node of i layer, select the i+1 node layer of father node minimum number earlier, again with selected i+1 node layer at the father node of i layer as alternative via node;

Wherein, in the selected i+1 node layer node of father node minimum number may exist one or more (like this, current determined alternative via node also exists one or more), wherein, the node of a plurality of father node minimum number refers to, the father node number of a plurality of nodes is identical, and the father node number of these a plurality of nodes is the minimum value of father node number in the i+1 node layer.2) in determined all alternative via nodes, select an alternative via node that sub-interstitial content is maximum, as via node; Consider that the i+1 layer has the node of given number, the propagator node of via node is many more, and the node of the i layer that then needs is few more;

In this operation, having the maximum node of child node number in the determined alternative via node may exist one or more, exist when a plurality of when having the maximum node of child node number in the alternative via node, can be with any node in these a plurality of nodes as via node, wherein, having the maximum a plurality of nodes of child node number in the alternative via node refers to, the child node number of a plurality of nodes is identical, and the child node number of these a plurality of nodes is maximums of determined alternative via node neutron interstitial content.

3) from the i node layer, ignore fixed via node, all child nodes of from the i+1 node layer, ignoring determined via node, repeat above-mentioned steps 1 again) and 2) operation, node Ignore All until the i+1 layer falls, like this, just determined all via nodes of i layer, determined the via node in the i+1 node layer again, got final product up to having traveled through all node layers.

For example, shown in Fig. 4 (a) (i is i+1) in the subtree, calculate the number of the father node of i+1 node layer, as can be seen i+1 node layer 1,5,7 father node number minimum, all be 1,1,5, the father node of 7 nodes is respectively node a, c and d, node a then, c and d are alternative via node; Wherein, node a, c, the child node number of d node is respectively 3,2,2, and the child node number of a node is maximum, so select a node as via node;

2) then, from subtree, ignore via node a and its child node 1,2,3, just obtain the new subtree shown in Fig. 4 (b);

3) from the subtree shown in Fig. 4 (b), select alternative via node again, at this moment, in the node 4,5,6 and 7, the father node minimum number of node 5 and node 7, father node with similar number, and 5 and 7 father node c, d has two child nodes, at this moment, therefrom select a node c as via node at random;

4) ignoring node c and child node thereof from the subtree shown in Fig. 4 (b), obtain the subtree shown in Fig. 4 (c), use the same method, can computing node d be via node, so ignore node d and child node thereof, so far, the i+1 node layer has been empty.Therefore, node a, c, d is chosen as the via node of i layer, shown in Fig. 4 (d).

Step 300, all via nodes generations of setting according to broadcasting comprise the minimum multicast tree of interstitial content;

This step is owing to comprise the branch node that some are unnecessary in the broadcasting tree structure, therefore, need carry out cutting to the broadcasting tree, comprises the minimum multicast tree of interstitial content thereby make up.Particularly, determine the multicast source node, behind the multicast receiving node, from the via node of broadcasting tree, select the maximum higher level's via node of overlay multicast receiving node number, and with the node of this via node as multicast tree, the bottom-up then upper level via node of from the via node of broadcasting tree, finding out selected via node, and with this via node also as the node of multicast tree, by that analogy, up to the root node that from all via nodes of broadcasting tree, finds selected via node, and with the node of this via node as multicast tree, at last, the node of determined all multicast tree and multicast source node and multicast receiving node constitute multicast tree.

For example be the broadcasting tree that only includes via node shown in Fig. 5 (a), wherein, node 6,7, the 8th, the multicast receiving node, because the child node of secondary via node 4 has covered two multicast receiving nodes, node 7 and node 8), be the maximum higher level's via node of overlay multicast receiving node number, therefore with the node of via node 4 as multicast tree, it is bottom-up then that to find the upper level via node of this via node 4 be one-level via node 2, and owing to also comprise multicast receiving node 6 in the child node of one-level via node 2, therefore, select the node of one-level via node 2 as multicast tree, the node of final determined multicast tree is node 2 and node 4, these nodes and multicast source node 1, multicast receiving node 6,7,8 constitute the multicast tree shown in Fig. 5 (b).

Step 400 is for the multicast tree that is generated is carried out channel allocation;

In this step, can be that the multicast tree that is generated is carried out channel allocation, in the present embodiment, carry out the specific operation process of channel allocation, as shown in Figure 6, comprise the steps: for the multicast tree that is generated according to multiple mode

Step 601: be that the multicast source node distributes a channel, and the receiving interface of the child node of multicast source node is arranged on this channel receives;

Step 602: from up to down be followed successively by the father node allocated channels at different levels of multicast tree by the node layering, wherein, and in the allocated channel process, the interference summation minimum of all interchannels that a channel that distributes for each father node and a hop neighbor node of this node are occupied; In this step, calculate the interference summation of all interchannels that assignable each channel and a hop neighbor node that carries out the present node of channel allocation occupied respectively, the pairing channel allocation of being calculated of least interference summation is got final product to present node, particularly, can pass through following formula, guarantee the interference summation minimum of all interchannels that a hop neighbor node of the channel that distributes for each father node and this node is occupied, promptly work as channel c vWhen satisfying following formula, get final product this channel c vDistribute to present node V:

min Σ ∀ w ∈ N ( v ) σ 2 ( c v , c w ) ;

In the formula, a N (hop neighbor set of node of v) representing present node v;

c v, expression can be distributed to the channel of present node V;

c w, the channel that the hop neighbor node W of expression present node V is occupied;

Equal Expression channel c vWith channel c wBetween interference factor, wherein, channel spacing | c v-c w| big more, then More little, promptly channel spacing is big more, disturbs more little.

In other application scenarioss, when the channel number that satisfies above-mentioned formula greater than 1, promptly have many optional channels, these many optional channels all equate with the interference total value of all channels that a hop neighbor node of this node is occupied, and disturb total value hour, then further will satisfy min|c v-c w| channel allocation give this node, just with in these a plurality of channels,, distribute to this node with the channel of the interval minimum of the channel of last distribution.

Also has application scenes, operation according to above-mentioned steps 300, after generating multicast tree, if when finding that certain node breaks down, technical solution of the present invention will the failure judgement node whether in the multicast tree structure that has generated, if malfunctioning node is not the node in the multicast tree structure, then proceed the operation of step 400, promptly carry out channel allocation; If malfunctioning node is the node in the multicast tree structure, then carry out the operation of technical solution of the present invention again, promptly initiate to generate the process (promptly re-executing step 100,200 and 300 operation) of multicast tree again, wherein, search procedure (being the operation of step 1) is begun by the next stage child node of malfunctioning node, this is because generated the information that each node in the multicast tree structure is all being remembered upper level (father) node and next stage (son) node.

For example, the broadcasting tree shown in Fig. 5 (a) if its two-level node 5 breaks down, and through judging that this two-level node 5 is not the node in the multicast tree structure that has generated, is not then taked any measure; If the node 4 of the secondary in the tree of the broadcasting shown in Fig. 5 (a) breaks down, and judge that this two-level node 4 is the nodes in the multicast tree structure that has generated, then initiate search procedure the end of by again to the top by multicast receiving node (node 7 and node 8) beginning, and because one-level node 2 is being remembered the information of sending node 1, therefore, when searching one-level node 2, just stop search, obtain new multicast tree thus as via node.Carrying out the subsequent communication channel batch operation again gets final product.

From the foregoing description as can be seen, technical solution of the present invention, structure comprises the minimum multicast tree of interstitial content earlier, comes to be each node allocated channel based on the interference minimum of a hop neighbor node again.In addition, when having many optional channels, preferably with the channel of a last channel spacing minimum.Like this, still be that time delay has all had very big improvement than the performance of existing LCA channel allocation algorithm from throughput.And this channel allocation mode not only goes for orthogonal channel, can also be used for the non-orthogonal channel that part is disturbed, as 11 channels of 802.11b.

For example, adopt the Instruction Network Test System Platform of a 500m * 500m of NS2 emulation, wherein, when mac-layer protocol adopts 802.11 agreements, in the assessment throughput, adopt 25 nodes, data rate changes to 275packets/s from 0, its simulation result as shown in Figure 7, when speed ratio is lower, when speed when 50packets/s increases gradually, adopt technical solution of the present invention throughput constantly increase, though the throughput of existing LCA algorithm is also in continuous increase, amplification is much smaller than technical solution of the present invention.When speed reached 200packets/s, the LCA throughput was approximately 10kbps, and the throughput of technical solution of the present invention can reach 20kbps.When speed reaches 25packets/s and continue to increase, the throughput of LCA and technical solution of the present invention all remains unchanged substantially, and it is constant that the throughput of LCA maintains 11kbps substantially, and that the throughput of technical solution of the present invention maintains 23kbps is constant.

In the emulation time delay, when from 0 to 30 of multicast receiving node changes, its simulation result as shown in Figure 8, when the multicast receiving node is on the increase, LCA is along with the multicast receiving node increases, its time delay constantly raises from 0s, change to 1.3s, and the time delay of technical solution of the present invention maintains 0.1s always always.

Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make corresponding change and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.

Claims (11)

1. a method for channel allocation of supporting based on wireless mesh network is characterized in that, this method comprises:
After all nodes in the based on wireless mesh network are generated the broadcasting tree by grade, determine the via node in the described broadcasting tree, and according to described via node, structure comprises the minimum multicast tree of interstitial content, and each node for constructed multicast tree carries out channel allocation again.
2. the method for claim 1 is characterized in that,
The process of determining the via node in the described broadcasting tree is as follows:
Each node of described broadcasting tree is successively determined via node according to the top-down order, wherein, when determining certain one deck via node, from the lower level node of this layer, select the node of father node minimum number earlier, with the father node of selected lower level node alternative via node as this layer, to have the via node that the maximum node of child node number is defined as this layer in current definite alternative via node again, from this layer, ignore determined via node then, all child nodes of from the lower level node of this layer, ignoring determined via node, select the alternative via node of this layer then according to the residue node of the lower level node of this layer, from alternative via node, determine other via nodes of this layer, when the lower level node of this layer all was left in the basket, the via node of this layer was all determined.
3. method as claimed in claim 2 is characterized in that,
Have the maximum node of child node number in the described alternative via node and be two when above, the arbitrary node in the described node is defined as via node.
4. as claim 1,2 or 3 described methods, it is characterized in that,
According to described via node, it is as follows to make up the process that comprises the minimum multicast tree of interstitial content:
Determine multicast source node and multicast receiving node, with overlay multicast receiving node number is maximum in the described broadcasting tree higher level's via node first node as described multicast tree, from each layer via node of described broadcasting tree, choose the upper level via node of described first node again according to order from bottom to top, up to the root node of choosing described first node, finally be built into multicast tree by all via nodes of choosing and determined multicast source node and multicast receiving node.
5. method as claimed in claim 4 is characterized in that,
The process of carrying out channel allocation for each node of constructed multicast tree is as follows:
For determined multicast source node distributes a channel, be each node layer allocated channel of described multicast tree again according to the top-down order, wherein, in the allocated channel process, the interference summation minimum of all interchannels that a channel that distributes for each node and a hop neighbor node of this node are occupied.
6. to require 5 described methods as right, it is characterized in that,
The little finger of toe of the interference summation of all interchannels that the channel that distributes for each node and a hop neighbor node of this node are occupied is the channel c of node distribution vAll channels that occupied with a hop neighbor node of this node satisfy following formula and require:
min Σ ∀ w ∈ N ( v ) σ 2 ( c v , c w )
In the formula, a N (hop neighbor set of node of v) representing described present node;
c v, be expressed as the channel that described present node distributes;
c w, represent the channel that a hop neighbor node W of described present node is occupied;
Equal Expression channel c vWith channel c wBetween interference factor.
7. method as claimed in claim 6 is characterized in that,
When the interference of all interchannels that occupied when the hop neighbor node with described node is satisfied channel that described formula requires and had many, will give described node with the channel allocation of last channel spacing minimum of distributing in many channels.
8. an equipment of supporting the channel allocation of based on wireless mesh network is characterized in that, this equipment comprises broadcasting tree generation module, multicast tree generation module and channel assignment module, wherein:
Described broadcasting tree generation module is used for all nodes with based on wireless mesh network by grade classification, generates the broadcasting tree, and all via nodes in the broadcasting tree of determining to be generated;
Described multicast tree generation module is used for the via node according to described broadcasting tree, makes up to comprise the minimum multicast tree of interstitial content;
Described channel assignment module is used to each node of constructed multicast tree to carry out channel allocation.
9. equipment as claimed in claim 8 is characterized in that,
Described broadcasting tree generation module, each node of described broadcasting tree is successively determined via node according to the top-down order, wherein, when determining certain one deck via node, from the lower level node of this layer, select the node of father node minimum number earlier, with the father node of selected lower level node alternative via node as this layer, to have the via node that the maximum node of child node number is defined as this layer in current definite alternative via node again, from this layer, ignore determined via node then, all child nodes of from the lower level node of this layer, ignoring determined via node, select the alternative via node of this layer then again according to the residue node of the lower level node of this layer, from alternative via node, determine the via node of this layer, when the lower level node of this layer all was left in the basket, the via node of this layer was all determined.
10. equipment as claimed in claim 8 or 9 is characterized in that,
Described multicast tree generation module, determine multicast source node and multicast receiving node, with overlay multicast receiving node number is maximum in the described broadcasting tree higher level's via node first node as described multicast tree, from each layer via node of described broadcasting tree, choose the upper level via node of described first node again according to order from bottom to top, up to the root node of choosing described first node, finally be built into multicast tree by all via nodes of choosing and determined multicast source node and multicast receiving node.
11. equipment as claimed in claim 10 is characterized in that
Described channel assignment module, for determined multicast source node distributes a channel, be each node layer allocated channel of described multicast tree again according to the top-down order, wherein, in the allocated channel process, the interference summation minimum of all interchannels that a channel that distributes for each node and a hop neighbor node of this node are occupied.
CN 200910260711 2009-12-29 2009-12-29 Channel allocating method and device for multichannel multi-interface wireless mesh network CN101790233B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910260711 CN101790233B (en) 2009-12-29 2009-12-29 Channel allocating method and device for multichannel multi-interface wireless mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910260711 CN101790233B (en) 2009-12-29 2009-12-29 Channel allocating method and device for multichannel multi-interface wireless mesh network

Publications (2)

Publication Number Publication Date
CN101790233A true CN101790233A (en) 2010-07-28
CN101790233B CN101790233B (en) 2013-06-05

Family

ID=42533212

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910260711 CN101790233B (en) 2009-12-29 2009-12-29 Channel allocating method and device for multichannel multi-interface wireless mesh network

Country Status (1)

Country Link
CN (1) CN101790233B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102137465A (en) * 2011-03-08 2011-07-27 湖南大学 Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network
CN102497620A (en) * 2011-12-01 2012-06-13 华为技术有限公司 Method and system of information transmission in wireless sensor network
CN102711117A (en) * 2012-06-06 2012-10-03 上海乾视通信技术有限公司 Ad Hoc Network node wireless communication channel confirming method and implementation device thereof
CN104185242A (en) * 2014-09-11 2014-12-03 电子科技大学 Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101483598A (en) * 2009-02-20 2009-07-15 西部矿业股份有限公司 Minimized bandwidth consumption multicast routing method based on label optimization
CN101505521A (en) * 2009-01-07 2009-08-12 重庆邮电大学 Method for selecting optimum aggregation node in isomorphism wireless sensor network
CN101517932A (en) * 2006-09-19 2009-08-26 发尔泰公司 A multi-channel assignment method for multi-radio multi-hop wireless mesh networks
CN101594239A (en) * 2008-05-27 2009-12-02 北京循天行信息技术有限公司 Method for efficient and reliable multicast of wireless network based on accumulated expected transmission times

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101517932A (en) * 2006-09-19 2009-08-26 发尔泰公司 A multi-channel assignment method for multi-radio multi-hop wireless mesh networks
CN101594239A (en) * 2008-05-27 2009-12-02 北京循天行信息技术有限公司 Method for efficient and reliable multicast of wireless network based on accumulated expected transmission times
CN101505521A (en) * 2009-01-07 2009-08-12 重庆邮电大学 Method for selecting optimum aggregation node in isomorphism wireless sensor network
CN101483598A (en) * 2009-02-20 2009-07-15 西部矿业股份有限公司 Minimized bandwidth consumption multicast routing method based on label optimization

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
崔雪菲: "基于树的Ad hoc组播路由协议的研究与改进", 《计算机与数字工程》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102137465A (en) * 2011-03-08 2011-07-27 湖南大学 Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network
CN102137465B (en) * 2011-03-08 2014-04-02 湖南大学 Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network
CN102497620A (en) * 2011-12-01 2012-06-13 华为技术有限公司 Method and system of information transmission in wireless sensor network
CN102497620B (en) * 2011-12-01 2015-03-11 华为技术有限公司 Method and system of information transmission in wireless sensor network
CN102711117A (en) * 2012-06-06 2012-10-03 上海乾视通信技术有限公司 Ad Hoc Network node wireless communication channel confirming method and implementation device thereof
CN102711117B (en) * 2012-06-06 2015-05-13 上海乾视通信技术有限公司 Ad Hoc Network node wireless communication channel confirming method and implementation device thereof
CN104185242A (en) * 2014-09-11 2014-12-03 电子科技大学 Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference

Also Published As

Publication number Publication date
CN101790233B (en) 2013-06-05

Similar Documents

Publication Publication Date Title
Zhang et al. Cooperative edge caching in user-centric clustered mobile networks
Shanmugam et al. Femtocaching: Wireless content delivery through distributed caching helpers
Huang et al. Software-defined wireless mesh networks: architecture and traffic orchestration
Al-Kanj et al. Optimal cellular offloading via device-to-device communication networks with fairness constraints
Aoun et al. Gateway placement optimization in wireless mesh networks with QoS constraints
Zeng et al. Efficient multicast algorithms for multichannel wireless mesh networks
Li et al. Multicast capacity for large scale wireless ad hoc networks
Liu et al. Capacity of a wireless ad hoc network with infrastructure
Lu et al. Relay station placement strategy in IEEE 802.16 j WiMAX networks
Wang et al. Efficient mesh router placement in wireless mesh networks
Li et al. Capacity of large scale wireless networks under Gaussian channel model
Cheng et al. Joint routing and link rate allocation under bandwidth and energy constraints in sensor networks
Maolin Gateways placement in backbone wireless mesh networks
CN103607750A (en) Relay selection method based on terminal straight-through communication in next-generation cellular system
Sarkar et al. Hybrid wireless-optical broadband access network (WOBAN): Network planning using Lagrangean relaxation
Moubayed et al. Wireless resource virtualization with device-to-device communication underlaying LTE network
Douik et al. Hybrid radio/free-space optical design for next generation backhaul systems
US8369863B2 (en) Method for interference suppression
Cai et al. A graph-coloring based resource allocation algorithm for D2D communication in cellular networks
CN101472339B (en) Method for coordinating district interference
US7929460B2 (en) Communication network topology determination
Wu et al. Network planning in wireless ad hoc networks: a cross-layer approach
Ding et al. Channel assignment with partially overlapping channels in wireless mesh networks
Sen et al. Long distance wireless mesh network planning: problem formulation and solution
Johnson et al. Collaborative content distribution for vehicular ad hoc networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20171201

Address after: 412400 Wanli village, seven village, Chaling County, Hunan Province, No. 001

Patentee after: Lu Fenglian

Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice

Patentee before: ZTE Corporation

Effective date of registration: 20171201

Address after: 412400 Wanli village, seven village, Chaling County, Hunan Province, No. 001

Patentee after: Lu Fenglian

Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice

Patentee before: ZTE Corporation

CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Lu Fenglian

Inventor before: Li Ping

Inventor before: Liu Feng

Inventor before: Xia Hongfei

Inventor after: Lu Fenglian

Inventor before: Li Ping

Inventor before: Liu Feng

Inventor before: Xia Hongfei

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130605

Termination date: 20181229