CN101925066A - Multi-channel wireless mesh network system and channel distribution method thereof - Google Patents
Multi-channel wireless mesh network system and channel distribution method thereof Download PDFInfo
- Publication number
- CN101925066A CN101925066A CN2010101194612A CN201010119461A CN101925066A CN 101925066 A CN101925066 A CN 101925066A CN 2010101194612 A CN2010101194612 A CN 2010101194612A CN 201010119461 A CN201010119461 A CN 201010119461A CN 101925066 A CN101925066 A CN 101925066A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- bunch
- link
- interface
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004891 communication Methods 0.000 claims description 35
- 230000005540 biological transmission Effects 0.000 claims description 13
- 238000006243 chemical reaction Methods 0.000 claims description 12
- 230000000737 periodic effect Effects 0.000 claims description 7
- 230000003068 static effect Effects 0.000 description 13
- 238000004364 calculation method Methods 0.000 description 5
- 239000011159 matrix material Substances 0.000 description 5
- 238000012544 monitoring process Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000001514 detection method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000012913 prioritisation Methods 0.000 description 2
- 239000012141 concentrate Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multi-channel wireless mesh network system and a channel distribution method thereof. The channel distribution method comprises the following steps of: dividing a network into a plurality of clusters each of which comprises one or more nodes; b, performing channel distribution by taking the clusters as units; c, counting the packet loss rate of each link in a cluster or among the clusters within a time period; if a link of which the packet loss rate is greater than a predetermined threshold value exists, executing step d; and d, redistributing a channel to the link and returning to the step c. Through the method, the channels are reasonably distributed, performance such as expansibility, throughput and the like of the wireless mesh network is effectively improved, and wider bandwidth, shorter delay and larger network capacity are achieved.
Description
Technical field
The present invention relates to field of wireless, particularly a kind of multi-channel wireless mesh network system and method for channel allocation thereof.
Background technology
Along with the development of social economy and electronic information technology, the present stage people are growing to mobile high-speed data service demand.The quality of wireless network performance satisfies the key factor of this demand beyond doubt.Traditional wireless network connected mode is difficult to promote in a lot of low developed areas because the duration is very long, cost is expensive; And its network performance is can not satisfy the user's request of present stage.So,, realize that the problem that the internet inserts is suggested as how lower cost, fast construction wireless network.Wireless Mesh netword (meshed wireless mesh network) is a kind of novel wireless network architecture.In the conventional wireless net, the communication of node must be through AP (access point); In the Mesh network, each node and one or more peer node are carried out direct communication.It has higher reliability, bigger retractility and lower cost of investment, is new departure of a kind of solution wireless access " last kilometer " bottleneck problem.The present stage user is higher bandwidth, lower delay, bigger network capacity to the joint demand of wireless Mesh netword access technology.
Because the feature that becomes when radio communication " shared medium " and wireless transmission, problem such as multi-user conflict and multi-hop transmission significantly influences network throughput in the practical application, and therefore single-channel wireless protocols has limited the capacity of wireless Mesh netword.For addressing this problem, the multichannel Mesh network architecture is suggested, to solve problems such as wireless multi-hop network autgmentability difference and network capacity be limited.
Multichannel Mesh server problem is a method for channel allocation, and method for channel allocation is each interface assignment physical channel, when guaranteeing network connectivty, also need reduce the interference between the adjacent node as far as possible.Existing method for channel allocation is divided into static channel allocation, dynamic channel allocation and mixed channel and distributes three classes.The static allocation method is simple but channel utilization is low, dynamic allocation method channel utilization height but poor expandability; Mixed channel distributes the advantage combine both, but static allocation how, dynamic assignment when, and dynamic assignment how, existing scheme is all not ideal enough.
Existing sub-clustering formula mixed channel distribution method is all having weak point aspect detection link load and the dynamic channel switching.After finishing static channel allocation, the channel operating position that monitors according to dedicated node, in bunch inner dynamic channel allocation that realizes, but bunch between communication link can not the dynamic assignment channel, therefore may become the network service bottleneck.For another example bunch in and bunch between can be according to network load condition dynamic assignment channel, but cost is to enable the new path that do not overlap, and tends to increase path; In addition, if assess offered load according to link layer ACK message, then the data stream type of Shi Yonging is limited.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of multi-channel wireless mesh network system and method for channel allocation thereof, energy reasonable distribution channel, effectively improve the performances such as autgmentability, throughput of based on wireless mesh network, realize higher bandwidth, lower delay and bigger network capacity.
In order to address the above problem, the invention provides the method for channel allocation of a kind of multi-channel wireless mesh network system, comprising:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, bunch being that unit carries out channel allocation;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out steps d greater than a predetermined threshold;
D, be this link assignment channel again; Return step c.
Further, described bunch being that the step that unit carries out channel allocation specifically comprises:
For bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster.
Further, described count in a period of time intra-cluster and bunch between the step of packet loss on each link specifically comprise:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively; Periodic broadcast Hello message is given the neighbors in the leapfrog, carries the receipts/number of giving out a contract for a project of described statistics in described Hello message, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
Further, describedly specifically comprise for the step of link assignment channel again:
To the node at described two ends, judged whether usable interface respectively, described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
If the node at two ends all has usable interface, and described link be bunch in link, then by leader cluster node select load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link; Described link be bunch between during link, then consult to select new channel allocation to give this link jointly by two bunches leader cluster node;
If have only the node of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node, if having then described usable interface is switched on this other end node channel current use, that load is the lightest;
If the node at two ends does not all have usable interface, then seek and enable the new route that does not overlap with current link between this two end node, and to the new route allocated channel.
Further, the described concrete steps of usable interface that judge whether comprise:
Step 1: when node has idle interface, judge that then this node has usable interface, promptly described idle interface; Otherwise execution in step two;
Step 2: node has variable interface, then continues execution in step three, otherwise judges that this node does not have usable interface;
Step 3: when other data flow transmission that can not influence behind this variable interface conversion channel in the network, continue execution in step four, otherwise judge that this node does not have usable interface;
Step 4: in the time also can not influencing network connective behind this variable interface conversion channel, judge that this node has usable interface, promptly described variable interface; Otherwise judge that this node does not have usable interface.
The present invention also provides a kind of multi-channel wireless mesh network system, comprising:
A plurality of bunches, each bunch comprises one or more nodes; Described node comprises a leader cluster node at least; By a unified channel communication, be adopted as the channel communication of this bunch distribution between each node in bunch between each bunch; For channel that each bunch distributed is outside the described unified channel, does not disturb or disturb minimum channel with adjacent cluster;
Each described node be used to count in a period of time intra-cluster and bunch between packet loss on each link, and judge whether to exist the link of packet loss greater than a predetermined threshold;
Described leader cluster node is used for when having packet loss greater than the link of a predetermined threshold in this bunch or between this bunch and other bunch, for this link is redistributed channel.
Further, described node count in a period of time intra-cluster and bunch between packet loss on each link specifically be meant:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively; Periodic broadcast Hello message is given the neighbors in the leapfrog, carries the receipts/number of giving out a contract for a project of described statistics in described Hello message, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
Further, described leader cluster node specifically is meant for the link assignment channel again:
Described leader cluster node judges respectively whether the node of both link ends has usable interface, and described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
If the node at two ends all has usable interface, and described link be bunch in link, then select load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link; Described link be bunch between during link, then with this another section of link bunch leader cluster node consult to select new channel allocation to give this link jointly;
If have only the node of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node, if having then described usable interface is switched on this other end node channel current use, that load is the lightest;
If the node at two ends does not all have usable interface, then seek and enable the new route that does not overlap with current link between this two end node, and to the new route allocated channel.
Further, whether described leader cluster node decision node has usable interface specifically to be meant:
Whether described leader cluster node decision node has idle interface, if having then judge that this node has this idle interface as usable interface; If node does not have idle interface not have variable interface yet, judge that then this node does not have usable interface; If node has idle interface variable interface is not arranged, then judge other data flow transmission that whether influence behind this variable interface conversion channel in the network, if influence then judge that this node does not have usable interface; If do not influence then continue to judge the connectedness that whether influences network behind this variable interface conversion channel, if influence then judge that this node does not have usable interface, if would not do not influence then judge that this node has this variable interface as usable interface.
The present invention also provides the communication means of a kind of multi-channel wireless mesh network system, comprising:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, be bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out step D greater than a predetermined threshold;
D, redistribute channel greater than the link of described predetermined threshold for packet loss; The node of this both link ends uses this channel of redistributing to communicate; Return step C.
Technical scheme of the present invention adopts channel allocation mode static and that dynamically combine, to increase the simplicity and the flexibility of channel allocation; Adopt scale and the complexity of clustering architecture to have reduced problem; Bunch being that unit carries out on the basis of static channel allocation, to load heavy bunch in or bunch between link, can both adopt the method for dynamic self-adapting to adjust channel allocation.Prioritization scheme of the present invention has rationally utilized a plurality of channels in the network efficiently in the dynamic assignment stage, has effectively improved network performances such as bandwidth, delay and capacity.Another prioritization scheme of the present invention adopts Hello mechanism periodic monitoring link load situation, according to part transmitting-receiving bag statistical information assessment link load, do not rely on dedicated node, reduced monitoring overhead, be not subject to simultaneously the type of network data flow, the applicability of raising method.
Description of drawings
Fig. 1 is the schematic flow sheet of method for channel allocation of a kind of multi-channel wireless mesh network system of embodiment one;
Fig. 2 is the network basal conditions schematic diagram behind the static allocation channel among the embodiment one;
Fig. 3 is an adjacent bunch information matrix schematic diagram among the embodiment one.
Embodiment
Below in conjunction with drawings and Examples technical scheme of the present invention is described in detail.
Need to prove that if do not conflict, each feature among the embodiment of the invention and the embodiment can mutually combine, all within protection scope of the present invention.In addition, can in computer system, carry out in the step shown in the flow chart of accompanying drawing such as a set of computer-executable instructions, and, though there is shown logical order in flow process, but in some cases, can carry out step shown or that describe with the order that is different from herein.
Embodiment one, the method for channel allocation of a kind of multi-channel wireless mesh network system; In the described method for channel allocation, suppose that each node is furnished with two wave points at least in the described multi-channel wireless Mesh net.
As shown in Figure 1, described method comprises:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, bunch being that unit carries out channel allocation;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out steps d greater than a predetermined threshold;
D, be this link assignment channel again; Return step c.
In the present embodiment, bunch to be that the channel allocation that unit carries out is a static channel allocation, distribute bunch inside, back and bunch between use fixed channel communication; The channel of step redistribute to(for) the big link of packet loss is a dynamic channel allocation.
In the present embodiment, utilize clustering architecture to reduce the scale and the complexity of channel allocation problem; Described network being divided in a plurality of bunches the step, can but be not limited to adopt distributed clustering algorithm based on node ID, by distributed cooperation between the node network is divided into a plurality of bunches, the load of balanced leader cluster node effectively, and have less reconstruct expense.During practical application, existing multiple sub-clustering algorithm can use, and the present invention does not make particular restriction.
For fear of because bunch radius is too small and can't eliminate interference effect, and can't reduce problem such as complexity because bunch radius is excessive, select bunch radius in conjunction with the ratio of interference distance and transmission range in the present embodiment, make one of each bunch correspondence disturb the territory.For example, when the transmission range of node is 250 meters, interference distance is 550 meters, and the radius that is about to bunch is set to 2 leapfrogs.
In the practical application, channel allocation can adopt Random assignment and unified distribution dual mode between bunch.The Random assignment mode is bunch internal fixation channel that the borde gateway node is selected its neighbour that can connect bunch at random, but the spendable number of channel of node should be less than the interface number of node in the channel allocation problem, Random assignment may be limited owing to the number of interface and available channel, making in single channel sub-clustering network can nodes in communication, after static channel allocation, can't not communicate by letter owing to there is common signal channel, therefore random division channel under the data flow condition of unknown may cause taking that Internet resources are few, to postpone little path unavailable.The unified distribution mode be bunch between the unified common signal channel of link assignment, make that the network after network and the single channel sub-clustering of static channel allocation has identical network topology, can better keep the connectedness of network.Though the common signal channel between bunch may become communication performance bottleneck, but can the efficient balance link load by dynamic channel allocation between hereinafter bunch, therefore the present invention adopts method for channel allocation between unified bunch, when keeping network connectivty, rationally distributes uniformly and uses a plurality of channels.
In the present embodiment, described bunch being that the step that unit carries out channel allocation specifically can comprise:
For bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster.
In the object lesson, the network basal conditions after the static channel allocation is divided into first bunch of C1, is divided into second bunch of C2 and the 3rd bunch of C3 as shown in Figure 2; Allocated channel 4 as bunch between channel, be first, second, third bunch of C1, C2, C3 allocated channel 1,2,3 respectively.
Described first bunch of C1 comprises node A and the Node B, C, D, the E that link to each other with node A by channel 1 respectively, and node D is the borde gateway node, and all the other are member node; Described second bunch of C2 comprises node F, G, H, I, the J that links to each other successively by channel 2, and node J also links to each other with node F, H by channel 2, and node F and J are the borde gateway node, and all the other are member node; Described second bunch of C3 comprises node K, L, M, the N that links to each other successively by channel 3, and node N also links to each other with node L, K by channel 3, and node L and K are the borde gateway node, and all the other are member node.
Described node D links to each other with described node F, node K by channel 4; Described node K links to each other with described node F by channel 4; Described node L links to each other with described node J by channel 4.
Member node interface is communicated by letter on bunch internal fixation channel in bunch, and another interface is in idle condition; Communication in an interface of borde gateway node is used for bunch, another interface bunch between on the common signal channel with the borde gateway node communication of adjacent cluster, be used for the connectedness of maintaining network.
On the static channel allocation basis, the leader cluster node of each bunch has all been safeguarded neighbour's bunch information matrix, with connection situation between the record bunch, for the dynamic channel allocation in later stage provides effective network connectivty information, avoids the network division problem.Connect situation according to the network among Fig. 2, neighbour's bunch information matrix that its each leader cluster node is safeguarded as shown in Figure 3.The situation that is connected of record delimitation gateway node and adjacent cluster in the described neighbour bunch information matrix is when the column vector of certain adjacent bunch correspondence is non-vanishing, bunch with this neighbour bunch connection.During dynamic channel allocation, can judge that whether the current link channel of direct switching can cause certain column vector is zero, influences the connective of network or causes the network detach problem according to described neighbour bunch matrix information.
In the different application of different times, the conditions of demand of network channel are also different, and behind the good channel of described static allocation algorithm assigns, it is inhomogeneous to exist channel to use in communication, problems such as interference occur, thereby causes the packet loss of link problem.For addressing this problem, present embodiment is by the link load situation in the statistics packet loss monitoring network, thereby is defined as the loading condition of the channel that this link distributes; Statistics during packet loss can but be not limited to adopt Hello mechanism to monitor.
Packet loss has reflected the bandwidth demand that whether satisfies data flow for the channel of current link assignment, and therefore described Hello mechanism adopts the packet loss of link as the index of weighing channel loading.The mode that this respect, existing typical technology have transmission link-quality detection packet mode and record link layer ACK to reply.Transmission link-quality detection packet mode need be given out a contract for a project and receive and be replied at all neighborss, and this has increased the weight of offered load undoubtedly, has increased network overhead.And the mode that record link layer ACK replys can't be monitored the data flow of broadcasting or multicast.Described Hello mechanism is by means of the link load situation in the form Hello message monitoring network as shown in table 1.
Table 1, Hello message table
| Neighbor node ID | Channel number | Send number-of-packet | Receive number-of-packet |
| … | |||
| C | 2 | 0 | 163 |
| |
1 | 2167 | 56 |
| D | 3 | 35 | 743 |
| … |
In the present embodiment, described count in a period of time intra-cluster and bunch between the step of packet loss on each link specifically can comprise:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively;
The receipts of carrying statistics/Hello message of giving out a contract for a project several that each node periodic broadcast is as shown in table 1 sends to the neighbors in the leapfrog with the receipts/number of adding up of giving out a contract for a project, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
Particularly, each node is the packet counting to sending in described a period of time according to next-hop node on the transmit path and transmitting channel, according to the packet counting to receiving in described a period of time of last hop node and receive channel on the RX path; Statistics is undertaken by node and channel, such as in the table 1, is for node D equally, and the receipts when using different channels (channel 1 or the 3)/number of giving out a contract for a project is independent separately the statistics; Herein, if two adjacent nodes use a more than channel, different channels is different links;
IEEE802.11 protocol requirement transmit leg must correctly receive recipient's link layer ACK acknowledge message, so the packet loss of two-way link can be expressed as:
P＝1-(1-P
f)×(1-P
s)
P wherein
fRepresent the packet loss of link forward path, P
rRepresent the packet loss in link reversal path; The transmitting-receiving bag number of the receipts that each node is added up according to this node/give out a contract for a project number and neighbors statistics of being received can obtain the packet loss on each link; Such as node A statistics itself, on channel 1, receive 56 packets for node D, sent 2167 packets; And learn that according to the Hello message of the node D that is received node D sends to node A on channel 1 packet is 64, receive 2000 packets from node A.Suppose that node A is a forward path to D, then can learn, use on the link of channel 1 P between node A and the D
fBe (2167-2000)/2167 * 100%=7.7%, Ps is (64-56)/64=12.5%, then can obtain using between node A and the D packet loss of the link of channel 1 to be from following formula:
P＝1-(1-7.7％)×(1-12.5％)＝19.2％。
In the practical application, do not get rid of yet and adopt alternate manner to add up.
Each node is judged in each link that is connected whether have the link of packet loss greater than described predetermined threshold then; If have, then with by this link-attached node consult, be this link assignment channel again.
In the present embodiment, describedly specifically can comprise for the step of link assignment channel again:
At first to the node at described two ends, judged whether usable interface respectively, described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
, the node at two ends judges directly switching channels if all having usable interface, with the interface of described usable interface as use after switching; If described link is in being bunch, then by leader cluster node select under the current environment load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link, if bunch between link then consult to select new channel allocation to give this link by two bunches leader cluster node is common; Each leader cluster node safeguard a channel hierarchical table (Channel Rank List, CRL), the interference and the operating position of channel in the monitoring scope that is illustrated in bunch.When selective channel, common signal channel priority is minimum between bunch, and idle channel priority is the highest.If there is not idle channel to use, then can according to bunch scale select to disturb minimum bunch internal fixation channel.Leader cluster node is by exchange CRL information, communication channel between new bunch on selected certain bar link;
If have only the node v of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node u, if having then described usable interface is switched on the channel current use of this node v, that load is the lightest; Here, switch on certain channel of node u, may further increase the weight of the load of this channel as if direct certain interface with node v; Described channel utilization rate can obtain according to existing scheme, for example uses idle time of channel ratio (free time accounts for the ratio of total time) to determine the channel utilization rate;
If the node at two ends does not all have usable interface, when directly switching may influence the transmission of other data flow or cause network division, therefore in conjunction with the characteristics of Mesh network multi-path route, searching is also enabled the new route that does not overlap with current link between this two end node, and to new route reasonable distribution channel; Can utilize existing scheme to realize under this situation.
In the described multi-channel wireless Mesh network, the Interface status of node is divided into three kinds: free time, locking and variable.Idle interface is meant on this interface without any active link, and the interface of communication is considered to lock port in being used for bunch, can not switching channels, the interface of communication was considered to variable between it was used for bunch for the gateway node on border, can switch its channel according to the network-in-dialing situation when offered load is heavy; Described usable interface comprises idle interface and part variable interface.
In the present embodiment, the described concrete steps of usable interface that judge whether can comprise:
Step 1: when node has idle interface, judge that then this node has usable interface, promptly described idle interface; Otherwise execution in step two;
Step 2: node does not have idle interface but variable interface (for the borde gateway node) is arranged, and then continues execution in step three, otherwise judges that this node does not have usable interface;
Step 3: when other data flow transmission that can not influence behind this variable interface conversion channel in the network, continue execution in step four, otherwise judge that this node does not have usable interface;
Step 4: in the time also can not influencing network connective behind this variable interface conversion channel, judge that this node has usable interface, promptly described variable interface; Otherwise judge that this node does not have usable interface.
The method of present embodiment can realize balance network load, improves the purpose of channel utilization, thereby satisfies the communication requirement of different user.
Embodiment two, and a kind of multi-channel wireless mesh network system comprises:
A plurality of bunches, each bunch comprises one or more nodes; Described node comprises a leader cluster node at least;
By a unified channel communication, be adopted as the channel communication of this bunch distribution between each node in bunch between each bunch; For channel that each bunch distributed is outside the described unified channel, does not disturb or disturb minimum channel with adjacent cluster;
Each described node be used to count in a period of time intra-cluster and bunch between packet loss on each link, and judge whether to exist the link of packet loss greater than a predetermined threshold;
Described leader cluster node is used for when having packet loss greater than the link of a predetermined threshold in this bunch or between this bunch and other bunch, for this link is redistributed channel.
In the present embodiment, described node count in a period of time intra-cluster and bunch between packet loss on each link specifically can be meant:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively; Periodic broadcast Hello message is given the neighbors in the leapfrog, carries the receipts/number of giving out a contract for a project of described statistics in described Hello message, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
In the present embodiment, described leader cluster node specifically can be meant for the link assignment channel again:
Described leader cluster node judges respectively whether the node of both link ends has usable interface, and described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
If the node at two ends all has usable interface, and described link be bunch in link, then select load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link; Described link be bunch between during link, then with this another section of link bunch leader cluster node consult to select new channel allocation to give this link jointly;
If have only the node of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node, if having then described usable interface is switched on this other end node channel current use, that load is the lightest;
If the node at two ends does not all have usable interface, then seek and enable the new route that does not overlap with current link between this two end node, and to the new route allocated channel.
In the present embodiment, whether described leader cluster node decision node has usable interface specifically can be meant:
Whether described leader cluster node decision node has idle interface, if having then judge that this node has this idle interface as usable interface; If node does not have idle interface not have variable interface yet, judge that then this node does not have usable interface; If node has idle interface variable interface is not arranged, then judge other data flow transmission that whether influence behind this variable interface conversion channel in the network, if influence then judge that this node does not have usable interface; If do not influence then continue to judge the connectedness that whether influences network behind this variable interface conversion channel, if influence then judge that this node does not have usable interface, if would not do not influence then judge that this node has this variable interface as usable interface.
Other realizes that details can be with embodiment one.
Embodiment three, and the communication means of a kind of multi-channel wireless mesh network system comprises:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, be bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out step D greater than a predetermined threshold;
D, redistribute channel greater than the link of described predetermined threshold for packet loss; The node of this both link ends uses this channel of redistributing to communicate; Return step C.
Other realizes that details can be with embodiment one.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the storage device and carry out by calculation element, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
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 various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of claim of the present invention.
Claims (10)
1. the method for channel allocation of a multi-channel wireless mesh network system comprises:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, bunch being that unit carries out channel allocation;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out steps d greater than a predetermined threshold;
D, be this link assignment channel again; Return step c.
2. the method for claim 1 is characterized in that, and is described bunch being that the step that unit carries out channel allocation specifically comprises:
For bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster.
3. the method for claim 1 is characterized in that, described count in a period of time intra-cluster and bunch between the step of packet loss on each link specifically comprise:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively; Periodic broadcast Hello message is given the neighbors in the leapfrog, carries the receipts/number of giving out a contract for a project of described statistics in described Hello message, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
4. as each described method in the claim 1 to 3, it is characterized in that, describedly specifically comprise for the step of link assignment channel again:
To the node at described two ends, judged whether usable interface respectively, described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
If the node at two ends all has usable interface, and described link be bunch in link, then by leader cluster node select load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link; Described link be bunch between during link, then consult to select new channel allocation to give this link jointly by two bunches leader cluster node;
If have only the node of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node, if having then described usable interface is switched on this other end node channel current use, that load is the lightest;
If the node at two ends does not all have usable interface, then seek and enable the new route that does not overlap with current link between this two end node, and to the new route allocated channel.
5. method as claimed in claim 4 is characterized in that, the described concrete steps of usable interface that judge whether comprise:
Step 1: when node has idle interface, judge that then this node has usable interface, promptly described idle interface; Otherwise execution in step two;
Step 2: node has variable interface, then continues execution in step three, otherwise judges that this node does not have usable interface;
Step 3: when other data flow transmission that can not influence behind this variable interface conversion channel in the network, continue execution in step four, otherwise judge that this node does not have usable interface;
Step 4: in the time also can not influencing network connective behind this variable interface conversion channel, judge that this node has usable interface, promptly described variable interface; Otherwise judge that this node does not have usable interface.
6. multi-channel wireless mesh network system comprises:
A plurality of bunches, each bunch comprises one or more nodes; Described node comprises a leader cluster node at least;
It is characterized in that:
By a unified channel communication, be adopted as the channel communication of this bunch distribution between each node in bunch between each bunch; For channel that each bunch distributed is outside the described unified channel, does not disturb or disturb minimum channel with adjacent cluster;
Each described node be used to count in a period of time intra-cluster and bunch between packet loss on each link, and judge whether to exist the link of packet loss greater than a predetermined threshold;
Described leader cluster node is used for when having packet loss greater than the link of a predetermined threshold in this bunch or between this bunch and other bunch, for this link is redistributed channel.
7. system as claimed in claim 6 is characterized in that, described node count in a period of time intra-cluster and bunch between packet loss on each link specifically be meant:
Each node writes down in a period of time itself and receipts/the give out a contract for a project number of each neighbors on each channel respectively; Periodic broadcast Hello message is given the neighbors in the leapfrog, carries the receipts/number of giving out a contract for a project of described statistics in described Hello message, and receives Hello message from neighbors;
Each node counts packet loss on this section each link that this node connected in the time according to the Hello message that is received respectively.
8. as claim 6 or 7 described systems, it is characterized in that described leader cluster node specifically is meant for the link assignment channel again:
Described leader cluster node judges respectively whether the node of both link ends has usable interface, and described usable interface is meant can be at the interface that does not destroy direct switching channels under the network-in-dialing implementations;
If the node at two ends all has usable interface, and described link be bunch in link, then select load the lightest and and adjacent cluster is noiseless or disturb minimum channel allocation to give this link; Described link be bunch between during link, then with this another section of link bunch leader cluster node consult to select new channel allocation to give this link jointly;
If have only the node of an end that usable interface is arranged, then judge the channel that whether has the channel utilization rate to be lower than a predetermined utilization rate threshold value in the channel of the current use of other end node, if having then described usable interface is switched on this other end node channel current use, that load is the lightest;
If the node at two ends does not all have usable interface, then seek and enable the new route that does not overlap with current link between this two end node, and to the new route allocated channel.
9. system as claimed in claim 8 is characterized in that, whether described leader cluster node decision node has usable interface specifically to be meant:
Whether described leader cluster node decision node has idle interface, if having then judge that this node has this idle interface as usable interface; If node does not have idle interface not have variable interface yet, judge that then this node does not have usable interface; If node has idle interface variable interface is not arranged, then judge other data flow transmission that whether influence behind this variable interface conversion channel in the network, if influence then judge that this node does not have usable interface; If do not influence then continue to judge the connectedness that whether influences network behind this variable interface conversion channel, if influence then judge that this node does not have usable interface, if would not do not influence then judge that this node has this variable interface as usable interface.
10. the communication means of a multi-channel wireless mesh network system comprises:
A, network is divided into a plurality of bunches; Each bunch comprises one or more nodes;
B, be bunch between the unified channel of link assignment, between each bunch by this channel communication; In the channel outside described unified channel,, be adopted as the channel communication of this bunch distribution between each node in bunch for each bunch selects one not disturb or disturb minimum channel allocation to give this bunch with adjacent cluster;
C, count in a period of time intra-cluster and bunch between packet loss on each link; If there be the link of packet loss, then carry out step D greater than a predetermined threshold;
D, redistribute channel greater than the link of described predetermined threshold for packet loss; The node of this both link ends uses this channel of redistributing to communicate; Return step C.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101194612A CN101925066A (en) | 2010-03-05 | 2010-03-05 | Multi-channel wireless mesh network system and channel distribution method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101194612A CN101925066A (en) | 2010-03-05 | 2010-03-05 | Multi-channel wireless mesh network system and channel distribution method thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101925066A true CN101925066A (en) | 2010-12-22 |
Family
ID=43339630
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101194612A Pending CN101925066A (en) | 2010-03-05 | 2010-03-05 | Multi-channel wireless mesh network system and channel distribution method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101925066A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102811370A (en) * | 2011-05-31 | 2012-12-05 | 美国博通公司 | Dynamic wireless channel selection and protocol control for streaming media |
| CN103945551A (en) * | 2014-05-06 | 2014-07-23 | 中国联合网络通信集团有限公司 | Signal channel distribution method and system for wireless mesh network |
| CN104812081A (en) * | 2015-05-14 | 2015-07-29 | 中国联合网络通信集团有限公司 | Channel allocation method and system in wireless mesh network |
| CN105873160A (en) * | 2016-05-31 | 2016-08-17 | 中南大学 | Cluster establishing and routing method for cognitive radio sensor network without common control channel |
| CN106034280A (en) * | 2015-03-12 | 2016-10-19 | 北京信威通信技术股份有限公司 | Node-identity-feature-based clustering method in Ad-Hoc network |
| CN106034305A (en) * | 2015-03-14 | 2016-10-19 | 北京信威通信技术股份有限公司 | Clustering method based on node identity characteristic in ad-hoc network |
| CN106034301A (en) * | 2015-03-14 | 2016-10-19 | 北京信威通信技术股份有限公司 | Node-characteristic-based clustering method in ad-hoc network |
| CN107211318A (en) * | 2015-01-30 | 2017-09-26 | 日本电气株式会社 | Communication system |
| CN108370610A (en) * | 2015-11-25 | 2018-08-03 | 特拉网络有限公司 | Interference mitigation in dense grid network |
| CN110896458A (en) * | 2018-09-06 | 2020-03-20 | 杭州海康威视数字技术股份有限公司 | Camera and internal data transmission method thereof |
| CN111065146A (en) * | 2019-12-19 | 2020-04-24 | 西安邮电大学 | Ad hoc network route determining method based on link quality |
| CN111314963A (en) * | 2018-12-11 | 2020-06-19 | 中国移动通信集团吉林有限公司 | Cell load balancing method and device |
| CN111726183A (en) * | 2020-06-29 | 2020-09-29 | 南方电网数字电网研究院有限公司 | Channel allocation method and device for sensor communication and computer equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101322330A (en) * | 2005-11-02 | 2008-12-10 | 诺基亚公司 | Apparatus, method and computer program product providing sub-channel assignment for relay node |
| US20090034432A1 (en) * | 2007-07-31 | 2009-02-05 | Motorola, Inc. | System and method of resource allocation within a communication system |
| CN101394357A (en) * | 2008-10-29 | 2009-03-25 | 北京大学 | Route establishing and link detecting method and device for mobile Ad hoc network |
| CN101568124A (en) * | 2009-05-15 | 2009-10-28 | 重庆大学 | Channel allocation method in wireless mesh network |
-
2010
- 2010-03-05 CN CN2010101194612A patent/CN101925066A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101322330A (en) * | 2005-11-02 | 2008-12-10 | 诺基亚公司 | Apparatus, method and computer program product providing sub-channel assignment for relay node |
| US20090034432A1 (en) * | 2007-07-31 | 2009-02-05 | Motorola, Inc. | System and method of resource allocation within a communication system |
| CN101394357A (en) * | 2008-10-29 | 2009-03-25 | 北京大学 | Route establishing and link detecting method and device for mobile Ad hoc network |
| CN101568124A (en) * | 2009-05-15 | 2009-10-28 | 重庆大学 | Channel allocation method in wireless mesh network |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102811370A (en) * | 2011-05-31 | 2012-12-05 | 美国博通公司 | Dynamic wireless channel selection and protocol control for streaming media |
| CN103945551A (en) * | 2014-05-06 | 2014-07-23 | 中国联合网络通信集团有限公司 | Signal channel distribution method and system for wireless mesh network |
| CN107211318A (en) * | 2015-01-30 | 2017-09-26 | 日本电气株式会社 | Communication system |
| CN106034280A (en) * | 2015-03-12 | 2016-10-19 | 北京信威通信技术股份有限公司 | Node-identity-feature-based clustering method in Ad-Hoc network |
| CN106034301A (en) * | 2015-03-14 | 2016-10-19 | 北京信威通信技术股份有限公司 | Node-characteristic-based clustering method in ad-hoc network |
| CN106034305A (en) * | 2015-03-14 | 2016-10-19 | 北京信威通信技术股份有限公司 | Clustering method based on node identity characteristic in ad-hoc network |
| CN104812081B (en) * | 2015-05-14 | 2018-06-01 | 中国联合网络通信集团有限公司 | Method for channel allocation and system in a kind of wireless mesh network |
| CN104812081A (en) * | 2015-05-14 | 2015-07-29 | 中国联合网络通信集团有限公司 | Channel allocation method and system in wireless mesh network |
| CN108370610A (en) * | 2015-11-25 | 2018-08-03 | 特拉网络有限公司 | Interference mitigation in dense grid network |
| CN105873160A (en) * | 2016-05-31 | 2016-08-17 | 中南大学 | Cluster establishing and routing method for cognitive radio sensor network without common control channel |
| CN110896458A (en) * | 2018-09-06 | 2020-03-20 | 杭州海康威视数字技术股份有限公司 | Camera and internal data transmission method thereof |
| CN110896458B (en) * | 2018-09-06 | 2021-12-07 | 杭州海康威视数字技术股份有限公司 | Camera and internal data transmission method thereof |
| CN111314963A (en) * | 2018-12-11 | 2020-06-19 | 中国移动通信集团吉林有限公司 | Cell load balancing method and device |
| CN111314963B (en) * | 2018-12-11 | 2022-07-26 | 中国移动通信集团吉林有限公司 | Cell load balancing method and device |
| CN111065146A (en) * | 2019-12-19 | 2020-04-24 | 西安邮电大学 | Ad hoc network route determining method based on link quality |
| CN111726183A (en) * | 2020-06-29 | 2020-09-29 | 南方电网数字电网研究院有限公司 | Channel allocation method and device for sensor communication and computer equipment |
| CN111726183B (en) * | 2020-06-29 | 2021-07-06 | 南方电网数字电网研究院有限公司 | Channel allocation method and device for sensor communication and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101925066A (en) | Multi-channel wireless mesh network system and channel distribution method thereof | |
| Sathyasri et al. | Comparative Study Between Static Dynamic and Hybrid Channel Assignment Techniques In Multi Channel and Multi Radio In Wireless Mesh Network | |
| Ben-Othman et al. | Energy efficient and QoS based routing protocol for wireless sensor networks | |
| Deng et al. | Cooperative channel allocation and scheduling in multi-interface wireless mesh networks | |
| JP5895846B2 (en) | Communication terminal, channel selection method and program | |
| Heikalabad et al. | QEMPAR: QoS and energy aware multi-path routing algorithm for real-time applications in wireless sensor networks | |
| Dvir et al. | Wireless controller placement problem | |
| Wu et al. | Joint multi-radio multi-channel assignment, scheduling, and routing in wireless mesh networks | |
| GB2557433A (en) | Mesh islands | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| Yang et al. | A cross‐layer optimization for maximum‐revenue‐based multicast in multichannel multiradio wireless mesh networks | |
| Chao et al. | A channel-hopping multichannel MAC protocol for mobile ad hoc networks | |
| Wang et al. | Joint multicast routing and channel assignment for multi-radio multi-channel wireless mesh networks with hybrid traffic | |
| Rishiwal et al. | Base station oriented multi route diversity protocol for wireless sensor networks | |
| Wang et al. | TOT: Trust aware opportunistic transmission in cognitive radio Social Internet of Things | |
| Li | Soft frequency reuse-based resource allocation for D2D communications using both licensed and unlicensed bands | |
| Marandi et al. | Practical Bloom filter based epidemic forwarding and congestion control in DTNs: A comparative analysis | |
| Sagduyu et al. | Network coding in wireless queueing networks: Tandem network case | |
| Kamruzzaman et al. | Energy aware multipath routing protocol for cognitive radio ad hoc networks | |
| Penttinen et al. | Low-complexity distributed fair scheduling for wireless multi-hop networks | |
| Zhu et al. | A unified MAC and routing framework for multichannel multi-interface ad hoc networks | |
| Wang et al. | Reducing data aggregation latency by using partially overlapped channels in sensor networks | |
| CN113194424B (en) | RAW packet access method based on outage probability in industrial Internet of things | |
| Lai et al. | Dynamic game with perfect and complete information based dynamic channel assignment | |
| Dutta et al. | A multipath routing protocol for cognitive radio adhoc networks (CRAHNs) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20101222 |