CN101827415A - Channel allocating method and system in wireless mesh network - Google Patents

Channel allocating method and system in wireless mesh network Download PDF

Info

Publication number
CN101827415A
CN101827415A CN201010151163A CN201010151163A CN101827415A CN 101827415 A CN101827415 A CN 101827415A CN 201010151163 A CN201010151163 A CN 201010151163A CN 201010151163 A CN201010151163 A CN 201010151163A CN 101827415 A CN101827415 A CN 101827415A
Authority
CN
China
Prior art keywords
channel
node
bag
sign
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201010151163A
Other languages
Chinese (zh)
Other versions
CN101827415B (en
Inventor
张庆
刘峰
夏宏飞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201010151163.1A priority Critical patent/CN101827415B/en
Publication of CN101827415A publication Critical patent/CN101827415A/en
Application granted granted Critical
Publication of CN101827415B publication Critical patent/CN101827415B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a channel allocating method in a wireless mesh network. Various nodes periodically broadcasts an HELLO packet carrying a channel use table to obtain a channel interference index; a source node broadcasts and transmits identifications of a transmitting channel and a receiving channel which are proposed to next hop node by using a route request packet (RREQ Packet) according to the channel interference index; an intermediate node and a target node determine an optimal path through a route metric; the intermediate node broadcasts and transmits through the identifications of the transmitting channel and the receiving channel, which are carried to the next hop node by the REEQ Packet of the optimal path; and after determining the optimal path, the target node transmits a route reply packet (RREP Packet) and determines the self transmitting channel and receiving channel after receiving nodes of the RREP Packet. The invention also discloses a channel allocating system in the wireless mesh network. With the scheme, the invention can overcome the limit of the traditional channel allocating and route algorithm and improve the network transmission efficiency.

Description

Method for channel allocation in a kind of wireless mesh network and system
Technical field
The present invention relates to multi-signal-channel and multi-interface wireless mesh network (Mesh network) technology, relate in particular to method for channel allocation and system in a kind of wireless mesh network.
Background technology
Current combined channel to multi-signal-channel and multi-interface Mesh network distributes and Research of Routing Protocols mainly contains two parts.A part of research to agreement is based on centralized algorithm, mainly can be divided into two classes: first kind algorithm is divided into two stages independently with route and channel allocation---promptly at first find route that satisfies business demand and the load estimation that obtains every link, come to be the link assignment channel according to link load then, yet in reality, business demand is difficult to generally know in advance that this type of algorithm is difficult to realize; The second class algorithm distributes and routing issue with solving combined channel as integer linear programming mathematical methods such as (ILP), and this algorithm generally can obtain the optimal solution of this problem, but computation complexity is too high.
Another part is based on distributed algorithm to the research of agreement, but this quasi-protocol generally need be allocated a fixing receive channel in advance for each node, so that allow the neighbor node precognition, thereby connect easily, this way will cause the reduction of whole network transmission efficiency.
Summary of the invention
In view of this, main purpose of the present invention is to provide method for channel allocation and the system in a kind of wireless mesh network, overcomes the limitation of existing channel distribution and routing algorithm, improves network transmission efficiency.
For achieving the above object, technical scheme of the present invention is achieved in that
Method for channel allocation in a kind of wireless mesh network provided by the invention, this method comprises:
The HELLO bag that each node periodic broadcast carries channel use table carries out the channel status estimation, obtains the channel disturbance index of each channel;
Source node is according to the channel disturbance index, carries out broadcast transmission with proposing to be carried by routing request packet (RREQ bag) to the sign of the transmitting channel of next-hop node and receive channel;
RREQ bag on intermediate node and the destination node RX path utilizes the route criterion to determine optimal path;
Intermediate node carries out broadcast transmission with self proposing to be carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel;
Destination node is after determining optimal path, send routing reply bag (RREP bag), intermediate node and destination node are carried the transmitting channel of upstream node and the sign of receive channel by the RREP bag, receive the transmitting channel and the receive channel of the node affirmation self of RREP bag.
In the such scheme, described will propose to carry by the RREQ bag to the sign of the transmitting channel of next-hop node and receive channel carry out broadcast transmission and be specially: will propose to write and propose transmitting channel tabulation (P-S-list) to the sign of the transmitting channel of next-hop node; Propose receive channel tabulation (P-R-list) with proposing to write, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission to the sign of the receive channel of next-hop node.
In the such scheme, the described transmitting channel and the sign of receive channel with upstream node carried by the RREP bag and is specially: the sign of the transmitting channel of upstream node and receive channel is joined confirm transmitting channel tabulation (A-S-list) and confirm to carry A-S-list and A-R-list in the receive channel tabulation (A-R-list) in RREP wraps.
In the such scheme, described method further comprises: described intermediate node and destination node are after receiving the RREQ bag, check the transmitting channel of proposal and the availability of receive channel, when the transmitting channel of proposing and/or receive channel channel are unavailable, propose available channel, the sign that is designated available channel of the disabled channel that carries in the change RREQ bag.
In the such scheme, described intermediate node and destination node utilize the route criterion to determine that optimal path is specially: intermediate node and destination node are when receiving first RREQ bag, start a timer and catch the RREQ bag that other paths arrive, intermediate node and destination node obtain bottleneck link on its path from each RREQ that catches bag channel disturbance index, path needs to carry out quantity, and the jumping figure in path of the node that interface switches, obtain the value of route criterion by this three category information, with the path of the value minimum of route criterion as optimal path.
Channel assigning system in a kind of wireless mesh network provided by the invention, this system comprises: source node, at least one intermediate node, destination node; Each node all is used for HELLO bag that periodic broadcast carries channel use table to carry out channel status and estimates, obtains the channel disturbance index of each channel, wherein,
Source node is used for according to the channel disturbance index, proposes transmitting channel and receive channel to next-hop node, carries out broadcast transmission with proposing to be carried by the RREQ bag to the sign of the transmitting channel of next-hop node and receive channel; And according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Intermediate node is used for the RREQ bag on the RX path, utilizes the route criterion to determine optimal path; And being carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel that self is proposed carried out broadcast transmission; And the sign of the transmitting channel of upstream node and receive channel carried by the RREP bag, and according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Destination node is used for the RREQ bag on the RX path, utilizes the route criterion to determine optimal path; And send the RREP bag, the transmitting channel of upstream node and the sign of receive channel are carried by the RREP bag.
In the such scheme, described source node, the sign that is further used for the transmitting channel that will propose writes P-S-list; The sign of the receive channel proposed is write P-R-list, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission;
Described destination node is further used for the transmitting channel of upstream node and the sign of receive channel are joined among A-S-list and the A-R-list, carries A-S-list and A-R-list in the RREP bag.
In the such scheme, described intermediate node and destination node, after being further used for receiving the RREQ bag, check the transmitting channel of proposal and the availability of receive channel, when transmitting channel and/or receive channel are unavailable, propose available channel, the sign that is designated available channel of the disabled channel that carries in the change RREQ bag.
In the such scheme, described intermediate node and destination node are used for the RREQ bag on the RX path, utilize the route criterion to determine that optimal path is specially: intermediate node and destination node are when receiving first RREQ bag, start a timer and catch the RREQ bag that other paths arrive, channel disturbance index, the path that obtains bottleneck link on its path from each RREQ that catches bag needs to carry out quantity, and the jumping figure in path of the node that interface switches, obtain the value of route criterion by this three category information, with the path of the value minimum of route criterion as optimal path;
Accordingly, described source node, intermediate node and destination node needing on the channel disturbance index, path at bottleneck link on the RREQ bag record path also to be used for carrying out quantity, and the jumping figure in path of the node that interface switches.
Method for channel allocation and system in a kind of wireless mesh network provided by the invention, the HELLO that each node periodic broadcast carries channel use table wrap neighbor node and carry out channel status and estimate, obtain the channel disturbance index of each channel; Source node is proposed transmitting channel and receive channel to next-hop node according to the channel disturbance index, and the sign of the channel proposed is carried by the RREQ bag carry out broadcast transmission; Intermediate node and destination node receive the RREQ bag in a plurality of paths, utilize the route criterion to determine optimal path; Broadcast transmission is carried out in being carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel that intermediate node is proposed self; Destination node sends the RREP bag behind definite optimal path, intermediate node and destination node are carried the transmitting channel of upstream node and the sign of receive channel by the RREP bag, receives the transmitting channel and the receive channel of the node affirmation self of RREP bag; So, can overcome the limitation of existing channel distribution and routing algorithm, improve network transmission efficiency, simultaneously, the interference on the path, node interface switching and the jumping figure route criterion to the influence of transmission environment has been considered in use, has fully adapted to the environment of multi-signal-channel and multi-interface.
Description of drawings
Fig. 1 realizes the schematic flow sheet of the method for channel allocation in a kind of wireless mesh network for the present invention;
Fig. 2 is for making the disabled principle schematic of channel of proposal owing to channel confliction;
When the RREP of the transmitting channel that Fig. 3 carries node C for node C among Fig. 2 receives and the sign of receive channel wraps, confirm the principle schematic of transmitting channel;
Fig. 4 is by being proposed the disabled principle schematic of channel owing to there is the littler channel of channel disturbance index to make;
Fig. 5 realizes the structural representation of the channel assigning system in a kind of wireless mesh network for the present invention;
Fig. 6 is for setting up the principle schematic of a route from node A to node E in the example of the present invention;
Fig. 7 realizes the schematic flow sheet of method for channel allocation for setting up a route from node A to node E in the example of the present invention.
Embodiment
The present invention need use interface assignment of the prior art and channel disturbance index, is introduced respectively below.
Interface assignment:
In the individual radio network interface of the n of Mesh network node (n＞=2), one of them is assigned with and is operated on the Common Control Channel, is called control interface.This interface is mainly used to transmission controlling packets and broadcast packet.Remaining is a data-interface then, is used at different data channel transmitting data bags.802.11 the 4-Way Handshake of agreement (RTS-CTS-DATA-ACK) carries out on selected data channel.Because the load of the channel that control interface uses is generally smaller, can utilize its remaining capacity to carry packet, improve channel utilization; Yet the channel that control interface uses also should be avoided excessive congestion.Therefore, be a data sending probability of the channel setting p that control interface uses, this probability is used for managing the probability that uses described channel to send data.
When route is set up request comes, data-interface will become active, and switch to sending mode or receiving mode according to the direction of transport stream.In sending mode, data-interface can switch to different data channels and send packet to different neighbours, but cannot receive packet; In receiving mode, data-interface only can be operated on the data channel, and is promptly not changeable, mainly is responsible for the reception of data, and allows a spot of data to send.And control interface can not be assigned to any mode of operation, and it is operated in to possess simultaneously on the Common Control Channel and receives and sending function.
Need to prove, on a channel, reduce to the data-interface restraint of labour of receiving mode minimum in order that will send and receive synchronous expense.Imagination has two nodes to send data to same receiving interface by different channels, so when a node is sending, the another one node does not just know when can send data, like this, for transmission between the coordinator node or reception, need pay considerable synchronization overhead.Undertaken by limiting to send and be received on the same channel, the state of receiving mode interface always can be known by the request transmission/permission transmission protocol package of intercepting on this channel (RTS/CTS, Request To Send/Clear To Send) by upstream node.
Among the present invention, each node is the interface of internal loading minimum for the previous period for the channel arrangement selected.
If l iFor passing through the flow of interface i, L in a period of time T i ωFor interface i is in ω the load in the time window, can calculate the load of each interface with following weighted average function:
L i ω = β L i ω - 1 + ( 1 - β ) l i
Wherein β is a weighted factor.
The channel disturbance index:
Among the present invention, select best channel based on the channel disturbance index in each jumping of path candidate.This index is used for weighing the quality of channel quality, is defined as follows:
I i = Σ j = 1 k u ( i , j ) j γ
Wherein k is interference range jumping figure (generally getting 2), and γ is a path loss index, and (i j) uses table for channel to u.Channel uses table by each node maintenance, and the channel operating position of node around the record is for the channel of local node selects to provide foundation.Channel use table can be defined as:
Figure GSA00000093505200063
J ∈ [0, k+1] wherein, i ∈ [0, the number of channel-1].The channel operating position of u (i, 0) expression local node.The the 0th to k row content of channel use table is carried by the HELLO bag and periodically is broadcast to its neighbor node, and neighbor node then utilizes the 1st to k+1 of this information updating oneself to be listed as.
Each jumping at path candidate realizes local optimization by the channel of selecting to have the minimum channel Annoyance Index.If channel disturbance index I i=0, it is idle then representing channel i, can use; If have a plurality of idle channels simultaneously, then select one of them at random.
Adopt the channel disturbance index initiatively not remove to intercept channel, wrap and carry out channel status and estimate but depend on periodic HELLO, thereby can utilize more interface to carry out transfer of data.
At present, because the interface of sending mode does not allow as receiving packet, thereby internodal link is unidirectional, although connecting User Datagram Protocol (UDP), this does not have much harms, but if the words that transmission control protocol (TCP) connects, the recipient of TCP has to initiate again one time route requests on reverse path so, and these extra RREQ flooded packets will influence the performance of system and increase the time-delay that the path is set up.Therefore, the present invention adopts a kind of based on proposal---and the two-way approach of affirmation creates a mechanism.
Basic thought of the present invention is: the HELLO that each node periodic broadcast carries channel use table wraps neighbor node to carry out channel status and estimates, obtains the channel disturbance index of each channel; Source node is proposed transmitting channel and receive channel to next-hop node according to the channel disturbance index, and the sign of the channel proposed is carried by the RREQ bag carry out broadcast transmission; Intermediate node and destination node receive the RREQ bag in a plurality of paths, utilize the route criterion to determine optimal path; Broadcast transmission is carried out in being carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel that intermediate node is proposed self; Destination node sends the RREP bag behind definite optimal path, intermediate node and destination node are carried the transmitting channel of upstream node and the sign of receive channel by the RREP bag, receives the transmitting channel and the receive channel of the node affirmation self of RREP bag.
The present invention is described in further detail below by drawings and the specific embodiments.
The present invention has realized the method for channel allocation in a kind of wireless mesh network, and as shown in Figure 1, this method comprises following step:
Step 101: the HELLO that each node periodic broadcast carries channel use table wraps neighbor node to carry out channel status and estimates, obtains the channel disturbance index of each channel;
Step 102: source node is proposed transmitting channel and receive channel to next-hop node according to the channel disturbance index, and the sign of the channel proposed is carried by the RREQ bag carry out broadcast transmission;
Concrete, source node is received route foundation request, but when not finding the route to destination node, source node proposes that the channel of channel disturbance index minimum is a transmitting channel, and calculate the channel disturbance index of each channel once more, the channel of proposing channel disturbance index minimum for reverse flow is a receive channel, the sign of transmitting channel and receive channel is carried by the RREQ bag carry out broadcast transmission;
Further, described sign with transmitting channel and receive channel is carried by the RREQ bag and is carried out broadcast transmission and can be: the sign of described transmitting channel is write P-S-list; The sign of described receive channel is write P-R-list, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission.
Step 103: intermediate node and destination node are checked the transmitting channel of proposal and the availability of receive channel after receiving the RREQ bag, if transmitting channel and/or receive channel are unavailable, then execution in step 104; If all available, then execution in step 105;
The transmitting channel that described inspection is proposed and the availability of receive channel comprise: check whether the channel of proposing has whether the littler channel of Annoyance Index is arranged between channel confliction or inspection and upstream node; If channel confliction is arranged or the littler channel of channel disturbance index is arranged then proposed channel is unavailable, otherwise, then be available.
Step 104: intermediate node and destination node are proposed available channel, and the sign that is designated available channel of the disabled channel that carries in the change RREQ bag;
Further, the sign that is designated available channel of the disabled channel that carries in the described change RREQ bag can be the P-S-list that carries of change RREQ bag and the sign that is designated available channel of the disabled channel among the P-R-list;
For example, when making the channel of proposal unavailable owing to channel confliction, suppose that each node has 3 interfaces, Node B is being set up a route to node E, as shown in Figure 2, this route is through an already present route H-A-D-F-G, and Node B is proposed channel 3 for transmitting channel and the sign of channel 3 is write P-S-list carried by the RREQ bag, and node C accepts proposed channel 3 and proposes that channel 1 is as transmitting channel and the sign of channel 1 is added P-S-list carried by the RREQ bag; After node D receives the RREQ bag, it detects its three all interfaces and has all used and cause channel confliction, be that the channel 1 that node C proposes does not have the interface of receiving mode to use at node D, wherein, control interface is operated on the control channel 0, the receiving mode interface is operated on the channel 2, and the sending mode interface is operated on the channel 5.Because the sending mode interface is not allow as what receive, node D can only receive on channel 0 or channel 2.In order to solve this conflict, node D proposes channel 2 and changes the sign that is designated channel 2 of the channel 1 that carries in the RREQ bag; Node D then jumps the RREQ bag of selective channel 6 and broadcasting renewal for next.After process step 107, when node C receives the RREP bag of sign of the transmitting channel that carries node C and receive channel, as shown in Figure 3, node C will find that the transmitting channel through affirmation is a channel 2, rather than the channel 1 of its proposal, finally it will adopt channel 2.
Yet if channel 1 is to be proposed to be used as transmitting channel by the receiving mode interface of node C, it can not be changed, because the receiving mode interface is not changeable.In this case, node C is set to 1 to the force bit (force_bit position) in the RREQ bag, represents that this proposal channel must gain recognition, but node D can not support channel 1, it will abandon the RREQ bag simply, and route will be set up on another paths, for example B-C-A-D-E.
For another example, since have the littler channel of channel disturbance index make when proposing that channel is unavailable, as shown in Figure 4, when Node B when node C proposes a transmitting channel, only there is the node E of blank subregion can have influence on this decision, thereby the possibility of this channel confliction and little, node C selects more suitable channel based on the k+1 hop-information in the channel use table, and this k+1 hop-information has covered the interference range of Node B fully, therefore the transmitting channel of the Node B of being proposed once more by node C is for B, two nodes of C all are suitable, and then the transmitting channel proposed of the Node B of carrying in the node C change RREQ bag is designated the sign that node C is the transmitting channel proposed of Node B.
Step 105: intermediate node and destination node utilize the route criterion to determine optimal path;
Concrete, intermediate node and destination node are when receiving first RREQ bag, start a timer and catch the RREQ bag of other paths arrival subsequently, the RREQ bag that arrives behind timer expiry will be dropped because transmission delay is excessive, intermediate node and destination node obtain the channel disturbance index of bottleneck link on its path from each RREQ that catches bag, promptly Zui Da channel disturbance index is used I ThresholdRepresent; And need to carry out the quantity of the node that interface switches on the path, represent with switch_num; And the jumping figure in path, represent with hops; Can calculate the value of route criterion RM by this three category information by formula (1):
RM＝λ 1×I threshold+λ 2×switch_num+λ 3×hops (1)
Wherein, λ 1, λ 2And λ 3Be adjustable parameter, here, the RM value that obtains is more little, illustrates that the path is good more, and the path that the RM value is minimum uses the RREQ bag in this path to carry out next procedure as optimal path.
In this step, the channel disturbance index recording of described bottleneck link is in the RREQ bag, the physical record method is: the source node on every paths will propose that the channel disturbance index recording of channel is in the RREQ bag, after this, whenever the channel disturbance index of channel that node is proposed during greater than the channel disturbance index that is recorded in the RREQ bag, write down bigger channel disturbance index in the RREQ bag, the final channel disturbance index that writes down is the channel disturbance index of the bottleneck link in this path;
The quantity that needs to carry out the node that interface switches on the described path is recorded in the RREQ bag, the physical record method is: source node is provided with the quantity initial value that needs to carry out the node that interface switches on the path in RREQ bag be 0, each node is after proposing transmitting channel, whether the interface of the sending mode that uses according to described transmitting channel has other transmitting channel to use, determine whether this node needs to carry out interface and switch, if promptly there is other transmitting channel to use, then needing to carry out interface switches, if no, then do not need; Carry out interface when switching at needs, this node needs to carry out the node that interface switches on the path in broadcasting RREQ bag quantity adds 1;
The jumping figure in described path is recorded in the RREQ bag, and the physical record method is: source node is provided with the jumping figure in path in the RREQ bag initial value is 0, and each node adds 1 with the jumping figure in path in broadcasting RREQ bag.
Step 106: intermediate node according to the channel disturbance index, is proposed transmitting channel and receive channel to next-hop node after determining optimal path, and the sign of the channel proposed is carried broadcast transmission by the RREQ bag of optimal path;
Further, described sign with the channel proposed is carried by the RREQ bag of optimal path that to be broadcast to next-hop node can be that the sign of the channel that will propose adds P-S-list and P-R-list respectively, and the RREQ bag by optimal path carries P-S-list and P-R-list broadcast transmission then.
Step 107: destination node sends the RREP bag behind definite optimal path, and intermediate node and destination node are carried the transmitting channel of upstream node and the sign of receive channel by the RREP bag, receives the transmitting channel and the receive channel of the node affirmation self of RREP bag;
In this step, the transmitting channel of the last node in the RREQ bag that is designated intermediate node and destination node reception of the transmitting channel of described upstream node and receive channel and the sign of receive channel, if the transmitting channel of a last node and/or the sign of receive channel through change, then are the transmitting channel of the last node after the change and the sign of receive channel;
Further, the described transmitting channel and the sign of receive channel with upstream node carried by the RREP bag and can be: the transmitting channel of upstream node and the sign of receive channel are joined among A-S-list and the A-R-list, carry A-S-list and A-R-list in the RREP bag.
Based on said method, the present invention also provides the channel assigning system in a kind of wireless mesh network, and as shown in Figure 5, this system comprises: source node 51, at least one intermediate node 52, destination node 53; Each node all is used for HELLO that periodic broadcast carries channel use table and wraps neighbor node and carry out channel status and estimate, obtains the channel disturbance index of each channel, wherein,
Source node 51 is used for according to the channel disturbance index, proposes transmitting channel and receive channel to next-hop node, the sign of the channel proposed is carried by the RREQ bag carry out broadcast transmission; And according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Intermediate node 52 is used to receive the RREQ bag in a plurality of paths, utilizes the route criterion to determine optimal path; And being carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel that self is proposed carried out broadcast transmission; And the sign of the transmitting channel of upstream node and receive channel carried by the RREP bag, and according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Destination node 53 is used to receive the RREQ bag in a plurality of paths, utilizes the route criterion to determine optimal path; And send the RREP bag, the transmitting channel of upstream node and the sign of receive channel are carried by the RREP bag;
Described source node 51, the sign that is further used for the transmitting channel that will propose writes P-S-list; The sign of the receive channel proposed is write P-R-list, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission;
Described intermediate node 52 is further used for the transmitting channel that will propose and the sign of receive channel and adds P-S-list and P-R-list respectively, carries P-S-list by the RREQ bag of optimal path then and P-R-list is broadcast to next-hop node;
Described intermediate node 52 is further used for the transmitting channel of upstream node and the sign of receive channel are joined among A-S-list and the A-R-list, carries A-S-list and A-R-list in the RREP bag;
Described destination node 53 is further used for the transmitting channel of upstream node and the sign of receive channel are joined among A-S-list and the A-R-list, carries A-S-list and A-R-list in the RREP bag;
Further, described intermediate node 52 and destination node 53, after also being used to receive the RREQ bag, check the transmitting channel of proposal and the availability of receive channel, when transmitting channel and/or receive channel are unavailable, propose available channel, the sign that is designated available channel of the disabled channel that carries in the change RREQ bag;
Further, described intermediate node 52 and destination node 53 are used to receive the RREQ bag in a plurality of paths, utilize the route criterion to determine that optimal path is specially: intermediate node 52 and destination node 53 are when receiving first RREQ bag, start a timer and catch the RREQ bag of other paths arrival subsequently, the RREQ bag that will arrive behind timer expiry abandons, from each RREQ that catches bag, obtain the channel disturbance index of bottleneck link on its path then, need to carry out the quantity of the node that interface switches on the path, the jumping figure that reaches the path calculates route criterion RM by formula (1), and the path that the RM value is minimum is as optimal path;
Accordingly, described source node 51, intermediate node 52 and destination node 53 needing on the channel disturbance index, path at bottleneck link on the RREQ bag record path also to be used for carrying out quantity, and the jumping figure in path of the node that interface switches.
Describe the implementation procedure and the principle of method of the present invention in detail below in conjunction with specific embodiment.
Example: will set up a route from node A to node E in the Mesh network as shown in Figure 6, realize method for channel allocation as shown in Figure 7, this method comprises following step:
Step 701: the HELLO that each node periodic broadcast carries channel use table wraps neighbor node to carry out channel status and estimates, obtains the channel disturbance index of each channel;
Step 702: node A proposes to be respectively channel 2 and channel 6 to the transmitting channel and the receive channel of Node B according to the channel disturbance index, and the sign of the channel proposed is write P-S-list and P-R-list respectively, is carried by the RREQ bag and carries out broadcast transmission;
Step 703: Node B is checked the transmitting channel of proposal and the availability of receive channel after receiving the RREQ bag to node E, if transmitting channel and/or receive channel are unavailable, then execution in step 704; If all available, then execution in step 705;
In the present embodiment, Node B checks that the proposal channel all is available after receiving the RREQ bag to node E, can execution in step 704.
Step 704: be checked through and propose that the disabled node of channel proposes available channel, and the sign that is designated available channel of disabled channel among P-S-list that carries in the change RREQ bag and the P-R-list;
Step 705: Node B utilizes the route criterion to determine optimal path to node E;
Present embodiment has only a paths, so optimal path is path A-B-C-D-E.
Step 706: Node B to node D according to the channel disturbance index, propose transmitting channel and receive channel to next-hop node, and the sign of the channel proposed added among P-S-list and the P-R-list, carry by the RREQ bag of optimal path and be broadcast to next-hop node;
Concrete, Node B proposes to be respectively channel 3 and channel 7 to transmitting channel and the receive channel of node C according to the channel disturbance index, and the sign of the channel proposed is added among P-S-list and the P-R-list, is carried by the RREQ bag of path B-C and is broadcast to node C; Node C proposes to be respectively channel 1 and channel 5 to transmitting channel and the receive channel of node D according to the channel disturbance index, and the sign of the channel proposed is added among P-S-list and the P-R-list, is carried by the RREQ bag of path C-D and is broadcast to node D; Node D proposes to be respectively channel 4 and channel 8 to transmitting channel and the receive channel of node E according to the channel disturbance index, and the sign of the channel proposed is added among P-S-list and the P-R-list, is carried by the RREQ bag of path D-E and is broadcast to node E.
Step 707: node E sends the RREP bag after determining optimal path, and Node B is carried the transmitting channel of upstream node and the sign of receive channel to node E by the RREP bag, and the node of receiving the RREP bag is confirmed transmitting channel and the receive channel of self;
Concrete, node E sends the RREP bag after determining optimal path, node E joins A-S-list and A-R-list with the transmitting channel of node D and the sign of receive channel, the sign that is about to channel 4 and channel 8 joins A-S-list and A-R-list, is carried by the RREP bag; After node D receives the RREP bag, acknowledgement channel 4 and channel 8 are respectively transmitting channel and receive channel, and the transmitting channel of node C and the sign of receive channel joined A-S-list and A-R-list, the sign that is about to channel 1 and channel 5 joins A-S-list and A-R-list, is carried by the RREP bag; By that analogy, until node A channel 2 and channel 6 are confirmed to finish.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.

Claims (9)

1. the method for channel allocation in the wireless mesh network is characterized in that this method comprises:
The HELLO bag that each node periodic broadcast carries channel use table carries out the channel status estimation, obtains the channel disturbance index of each channel;
Source node is according to the channel disturbance index, carries out broadcast transmission with proposing to be carried by routing request packet (RREQ bag) to the sign of the transmitting channel of next-hop node and receive channel;
RREQ bag on intermediate node and the destination node RX path utilizes the route criterion to determine optimal path;
Intermediate node carries out broadcast transmission with self proposing to be carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel;
Destination node is after determining optimal path, send routing reply bag (RREP bag), intermediate node and destination node are carried the transmitting channel of upstream node and the sign of receive channel by the RREP bag, receive the transmitting channel and the receive channel of the node affirmation self of RREP bag.
2. method according to claim 1, it is characterized in that, described will propose to carry by the RREQ bag to the sign of the transmitting channel of next-hop node and receive channel carry out broadcast transmission and be specially: will propose to write and propose transmitting channel tabulation (P-S-list) to the sign of the transmitting channel of next-hop node; Propose receive channel tabulation (P-R-list) with proposing to write, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission to the sign of the receive channel of next-hop node.
3. method according to claim 1, it is characterized in that, the described transmitting channel and the sign of receive channel with upstream node carried by the RREP bag and is specially: the sign of the transmitting channel of upstream node and receive channel is joined confirm transmitting channel tabulation (A-S-list) and confirm to carry A-S-list and A-R-list in the receive channel tabulation (A-R-list) in RREP wraps.
4. method according to claim 1, it is characterized in that, described method further comprises: described intermediate node and destination node are after receiving the RREQ bag, check the transmitting channel of proposal and the availability of receive channel, when the transmitting channel of proposing and/or receive channel channel are unavailable, propose available channel, the sign that is designated available channel of the disabled channel that carries in the change RREQ bag.
5. according to each described method of claim 1 to 4, it is characterized in that, described intermediate node and destination node utilize the route criterion to determine that optimal path is specially: intermediate node and destination node are when receiving first RREQ bag, start a timer and catch the RREQ bag that other paths arrive, intermediate node and destination node obtain the channel disturbance index of bottleneck link on its path from each RREQ that catches bag, need to carry out the quantity of the node that interface switches on the path, and the jumping figure in path, obtain the value of route criterion by this three category information, with the path of the value minimum of route criterion as optimal path.
6. the channel assigning system in the wireless mesh network is characterized in that this system comprises: source node, at least one intermediate node, destination node; Each node all is used for HELLO bag that periodic broadcast carries channel use table to carry out channel status and estimates, obtains the channel disturbance index of each channel, wherein,
Source node is used for according to the channel disturbance index, proposes transmitting channel and receive channel to next-hop node, carries out broadcast transmission with proposing to be carried by the RREQ bag to the sign of the transmitting channel of next-hop node and receive channel; And according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Intermediate node is used for the RREQ bag on the RX path, utilizes the route criterion to determine optimal path; And being carried by the RREQ bag of optimal path to the sign of the transmitting channel of next-hop node and receive channel that self is proposed carried out broadcast transmission; And the sign of the transmitting channel of upstream node and receive channel carried by the RREP bag, and according to carry in the RREP bag self transmitting channel and the sign of receive channel, confirm transmitting channel and receive channel;
Destination node is used for the RREQ bag on the RX path, utilizes the route criterion to determine optimal path; And send the RREP bag, the transmitting channel of upstream node and the sign of receive channel are carried by the RREP bag.
7. system according to claim 6 is characterized in that, described source node, and the sign that is further used for the transmitting channel that will propose writes P-S-list; The sign of the receive channel proposed is write P-R-list, P-S-list and P-R-list are carried by the RREQ bag carry out broadcast transmission;
Described destination node is further used for the transmitting channel of upstream node and the sign of receive channel are joined among A-S-list and the A-R-list, carries A-S-list and A-R-list in the RREP bag.
8. system according to claim 6, it is characterized in that, described intermediate node and destination node, after being further used for receiving the RREQ bag, check the transmitting channel of proposal and the availability of receive channel, when transmitting channel and/or receive channel are unavailable, propose available channel, the sign that is designated available channel of the disabled channel that carries in the change RREQ bag.
9. according to each described system of claim 6 to 8, it is characterized in that, described intermediate node and destination node are used for the RREQ bag on the RX path, utilize the route criterion to determine that optimal path is specially: intermediate node and destination node are when receiving first RREQ bag, start a timer and catch the RREQ bag that other paths arrive, from each RREQ that catches bag, obtain the channel disturbance index of bottleneck link on its path, need to carry out the quantity of the node that interface switches on the path, and the jumping figure in path, obtain the value of route criterion by this three category information, with the path of the value minimum of route criterion as optimal path;
Accordingly, described source node, intermediate node and destination node needing on the channel disturbance index, path at bottleneck link on the RREQ bag record path also to be used for carrying out quantity, and the jumping figure in path of the node that interface switches.
CN201010151163.1A 2010-04-16 2010-04-16 Channel allocating method and system in wireless mesh network Active CN101827415B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010151163.1A CN101827415B (en) 2010-04-16 2010-04-16 Channel allocating method and system in wireless mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010151163.1A CN101827415B (en) 2010-04-16 2010-04-16 Channel allocating method and system in wireless mesh network

Publications (2)

Publication Number Publication Date
CN101827415A true CN101827415A (en) 2010-09-08
CN101827415B CN101827415B (en) 2014-07-02

Family

ID=42691060

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010151163.1A Active CN101827415B (en) 2010-04-16 2010-04-16 Channel allocating method and system in wireless mesh network

Country Status (1)

Country Link
CN (1) CN101827415B (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102088704A (en) * 2011-01-20 2011-06-08 北京交通大学 Dual radio multi-channel data interaction method and system of wireless Mesh network
CN102448125A (en) * 2010-09-30 2012-05-09 中兴通讯股份有限公司 Method and system for transmitting channel data in wireless network
CN104144460A (en) * 2014-03-12 2014-11-12 湖南大学 Source node and routing selection method for sensing interference
CN105282851A (en) * 2015-09-28 2016-01-27 浪潮(北京)电子信息产业有限公司 Channel distribution method and system
CN105722177A (en) * 2016-02-25 2016-06-29 浪潮(北京)电子信息产业有限公司 Wireless network channel allocation method and device
CN107222901A (en) * 2017-05-27 2017-09-29 河南科技大学 The implementation method of cognition wireless network Routing Protocol based on channel distribution
CN110856231A (en) * 2019-11-20 2020-02-28 北京邮电大学 Multi-data stream transmission method based on multi-hop network
WO2020073255A1 (en) * 2018-10-10 2020-04-16 鹤壁天海电子信息系统有限公司 Channel selection method and device
CN111031609A (en) * 2018-10-10 2020-04-17 鹤壁天海电子信息系统有限公司 Channel selection method and device
CN111432448A (en) * 2020-03-31 2020-07-17 深圳市吉祥腾达科技有限公司 Mesh smooth optimal path selection method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101145999A (en) * 2006-09-14 2008-03-19 华为技术有限公司 Method, node and device for realizing public channel frame mechanism in radio grid network
CN101155098A (en) * 2006-09-28 2008-04-02 华为技术有限公司 Wireless Mesh and its resource management method
US20090010164A1 (en) * 2007-06-28 2009-01-08 Nec (China) Co., Ltd. Method and apparatus for assigning channels for a multi-radio wireless mesh network
CN101568124A (en) * 2009-05-15 2009-10-28 重庆大学 Channel allocation method in wireless mesh network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101145999A (en) * 2006-09-14 2008-03-19 华为技术有限公司 Method, node and device for realizing public channel frame mechanism in radio grid network
CN101155098A (en) * 2006-09-28 2008-04-02 华为技术有限公司 Wireless Mesh and its resource management method
US20090010164A1 (en) * 2007-06-28 2009-01-08 Nec (China) Co., Ltd. Method and apparatus for assigning channels for a multi-radio wireless mesh network
CN101568124A (en) * 2009-05-15 2009-10-28 重庆大学 Channel allocation method in wireless mesh network

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102448125B (en) * 2010-09-30 2015-08-12 中兴通讯股份有限公司 Channel data transmission method in a kind of wireless network and system
CN102448125A (en) * 2010-09-30 2012-05-09 中兴通讯股份有限公司 Method and system for transmitting channel data in wireless network
CN102088704B (en) * 2011-01-20 2013-08-21 北京交通大学 Dual radio multi-channel data interaction method and system of wireless Mesh network
CN102088704A (en) * 2011-01-20 2011-06-08 北京交通大学 Dual radio multi-channel data interaction method and system of wireless Mesh network
CN104144460B (en) * 2014-03-12 2018-02-02 湖南大学 It is a kind of to disturb the source node and route selection method perceived
CN104144460A (en) * 2014-03-12 2014-11-12 湖南大学 Source node and routing selection method for sensing interference
CN105282851A (en) * 2015-09-28 2016-01-27 浪潮(北京)电子信息产业有限公司 Channel distribution method and system
CN105722177A (en) * 2016-02-25 2016-06-29 浪潮(北京)电子信息产业有限公司 Wireless network channel allocation method and device
CN105722177B (en) * 2016-02-25 2019-01-18 浪潮(北京)电子信息产业有限公司 A kind of radio network information channel distribution method and device
CN107222901A (en) * 2017-05-27 2017-09-29 河南科技大学 The implementation method of cognition wireless network Routing Protocol based on channel distribution
CN107222901B (en) * 2017-05-27 2020-08-14 河南科技大学 Method for realizing cognitive radio network routing protocol based on channel allocation
WO2020073255A1 (en) * 2018-10-10 2020-04-16 鹤壁天海电子信息系统有限公司 Channel selection method and device
CN111031609A (en) * 2018-10-10 2020-04-17 鹤壁天海电子信息系统有限公司 Channel selection method and device
CN111031609B (en) * 2018-10-10 2023-10-31 鹤壁天海电子信息系统有限公司 Channel selection method and device
CN110856231A (en) * 2019-11-20 2020-02-28 北京邮电大学 Multi-data stream transmission method based on multi-hop network
CN110856231B (en) * 2019-11-20 2021-11-09 北京邮电大学 Multi-data stream transmission method based on multi-hop network
CN111432448A (en) * 2020-03-31 2020-07-17 深圳市吉祥腾达科技有限公司 Mesh smooth optimal path selection method and system

Also Published As

Publication number Publication date
CN101827415B (en) 2014-07-02

Similar Documents

Publication Publication Date Title
CN101827415B (en) Channel allocating method and system in wireless mesh network
US7551562B2 (en) Determining bidirectional path quality within a wireless mesh network
US7773569B2 (en) System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networks
US20200196309A1 (en) Multi-tier density-aware location-based channel assignment and adaptive power control method for mobile ad-hoc networks
CN107318146B (en) Topology control method of mobile cluster ad hoc network
CN103621144A (en) Method for discovering set of routes in network
JP2009260911A (en) Method and system for establishing cooperative routing in wireless network
JP5814631B2 (en) Gateway device, node device, communication system, and channel change method
CN101854694B (en) Multi-path routing method based on bandwidth requirements
Zhang et al. DOAMI: A distributed on-line algorithm to minimize interference for routing in wireless sensor networks
CN102083164A (en) Method for opportunistic routing of wireless sensor network (WSN) based on energy perception
CN105072586A (en) Management method for forwarding of broadcast message in embedded wireless ad hoc network
CN101854641A (en) Method for perceiving Mesh network route
CN112153742A (en) MANET network dynamic time slot distribution method, system, equipment and application
CN102075864A (en) MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure
Çavdar et al. HyMPRo: a hybrid multi-path routing algorithm for cognitive radio ad hoc networks
Wang et al. Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios
KR20090062317A (en) Method and system for upgrading in multi hop wireless network
Abbas et al. A deadline-driven probabilistic quality of service routing for mobile Ad hoc networks
Mathew et al. Modified AODV routing protocol for multi-hop cognitive radio ad hoc networks
CN113766601B (en) Self-organizing network cooperative transmission path construction method based on cooperative relay transmission
Ziane et al. Inductive routing based on dynamic end-to-end delay for mobile networks
Vejarano et al. Reservation-based distributed scheduling in wireless networks
Tao et al. Delay-Jitter aware slot assignment for Real-Time applications in wireless multimedia ad hoc sensor networks
Seo et al. Distributed TDMA MAC Protocol with Source-Driven Combined Resource Allocation in 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