CN110072266A - Consider the wireless Mesh netword QoS routing method for channel allocation of jamming power - Google Patents
Consider the wireless Mesh netword QoS routing method for channel allocation of jamming power Download PDFInfo
- Publication number
- CN110072266A CN110072266A CN201910348124.1A CN201910348124A CN110072266A CN 110072266 A CN110072266 A CN 110072266A CN 201910348124 A CN201910348124 A CN 201910348124A CN 110072266 A CN110072266 A CN 110072266A
- Authority
- CN
- China
- Prior art keywords
- node
- father
- channel
- load
- layers
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of wireless Mesh netword QoS routing method for channel allocation for considering jamming power, this method is as follows: by obtaining node location information, the interference and load that calculating jamming power and each node are subject to；Whole network is traversed using breadth-first search, is node hierarchy；Multicast tree, i.e. QoS routing process are constructed, is arranged according to the ascending order of node level, unique father node is bound at the multicast reception end and relay node for being followed successively by each grade, until traversing the node that node level is 0；According to the multicast tree that building is completed, node priority is determined；It is arranged according to the descending of priority, each total interference of node distribution and the smallest channel of channel loading is followed successively by, until all nodes are assigned channel.The present invention can use jamming power and more accurately measure interference, constructs effective multicast tree, and be the total interference of node distribution and the smallest channel of channel loading, efficiently reduces interference, improve network performance.
Description
Technical field
The invention belongs to wirelessly communicate Mesh network technical field, it is related to a kind of wireless Mesh netword for considering jamming power
QoS routing method for channel allocation.
Background technique
Wireless Mesh netword (Wireless Mesh Networks, WMNs) is a kind of very promising broadband wireless access
Technology has many advantages, such as self-organizing, easy to maintain, high robust, low cost and high bandwidth, can be with effective solution network insertion
" last one kilometer " bottleneck problem.So WMNs has attracted the concern of Many researchers, and become the hot topic of wireless communication field
One of research topic.
However, as adjacent link simultaneous transmission data packet and caused by interference will lead to WMNs network capacity decline.
This challenge that multi-casting communication can be faced with effective solution WMNs.Multi-casting communication is generally using gateway node as multicast source section
Point, the data packet sent by multicast source node can be received by a series of destination nodes simultaneously, a series of this destination node is known as
Multicast reception node.For unicast communication, the most significant feature of multi-casting communication is that have unlimited broadcast advantage
(Wireless Broadcast Advantage, WBA), i.e. the multicast reception node from same multicast source node received data packet
Between do not interfere with.Since multi-casting communication has the feature of WBA, it saves more bandwidth than unicast communication and preferably utilizes net
Network resource.So many of WMNs is all based on multi-casting communication to network capacity, the very high application of requirement of real-time, such as far
Cheng Jiaoyu, video conference, interactive entertainment etc..Therefore, multi-casting communication has become a kind of key technique in WMNs, and by
To the extensive concern of academia.Existing research achievement shows to measure and can connect in multicast source node and multicast by QoS routing
Reasonable path is established between receiving end, and then reduces network interferences；Partly overlap channel (Partially Overlapped
Channels, POCs) allocation strategy can reduce interference, improve network capacity.So design reasonable QoS routing measurement and
POCs allocation strategy can effectively improve multi-casting communication performance.
From the point of view of current present Research, QoS routing measurement and channel assignment strategy are broadly divided into two classes in WMNs: one
Class is joint QoS routing and channel distribution；Another kind of is that QoS routing measurement and channel distribution independently carry out.Joint multicast road
By and channel distribution consider influencing each other between QoS routing and channel distribution, the method that linear programming is usually used is built
Vertical mathematical model, recycles heuritic approach or intelligent algorithm to be solved.Although this method can solve optimal solution, obtain
To optimal network topology and channel distribution as a result, still its complexity is higher, solution difficulty is larger, cannot be applied to well
Real network.Multicast tree is constructed first with QoS routing when QoS routing measurement and channel distribution independently carry out, then is multicast tree
On node distribute channel, solve suboptimal solution, the complexity of this method is lower.Channel is distributed in building multicast tree and for node
When, it is all that interference is measured using agreement interference model or double bounce interference model that existing research achievement, which has the disadvantage that,
But both methods for measuring interference can not accurately react the size of interference；When constructing multicast tree, network is only considered
Interference, and have ignored number of links there is also certain influences to network interferences；In channel distribution, typically just to minimize net
Network interference is target, does not account for channel loading also and will affect the performance of network.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of wireless Mesh netword QoS routing letters for considering jamming power
Channel allocation method.This method can efficiently reduce interference, improve network performance.
In order to solve the above-mentioned technical problem, the wireless Mesh netword QoS routing and channel of consideration jamming power of the invention
Distribution method the following steps are included:
Step 1) obtains the list of multicast reception node in network, obtains network node information and link information, obtains net
The initial primary topology of network；
Step 2) judges between any two node i and j according to the location information of network node with the presence or absence of interference；Such as
Physical distance between fruit node i and node j is less than or equal to disturbance range, then node i is interfered with each other with node j；According to
The jamming power P from interfering nodes j that formula (1) calculate node i is receivedij:
Wherein PjFor the transimission power of interfering nodes j；GjAnd GiThe respectively antenna gain of interfering nodes j and node i；hj
And hiThe respectively antenna height of interfering nodes j and node i；dijRepresent the physical distance between interfering nodes j and node i；α generation
Table path-loss factor.
Step 3) calculates the interference load that each node is subject to, and for arbitrary node i, the interference load that it is subject to is IL
(i):
Wherein load (j) is the load weight of node j, and load (i) is the load weight of node i；Node is negative when initial
Carry the client node number that weight definition is the node serve；
Step 4) utilizes breadth first search (Breadth First Search, BFS) algorithm traverses network, according to each
Node is divided into different grades to the hop count of multicast source node by node；For any two section in mutual transmission range
Point u and v, if the grade of node v is cl grades, the grade of node u is cl-1 grades, and definition node v is the child node of node u,
Node u is the father node of node v；The link between same hierarchy node is deleted, Mesh tree is obtained；
The Mesh tree that step 5) is obtained according to step 4) constructs multicast tree；
The multicast tree that step 6) is built according to step 5) calculates the interference function of each node in multicast tree using formula (3)
Rate load factor, and using jamming power load factor as the priority of each node；
Wherein Pr (i) is the jamming power load factor of node i, IiFor the interfering nodes set of node i；P (i) is node
The jamming power from all interfering nodes that i is received；Load (j) is the load weight of node j；OjRepresent the son of node j
Grandson's descendent node；Load (m) represents the initial load weight of node m；
Step 7) is followed successively by each node distribution channel, channel distribution side according to the priority orders of step 6) interior joint
Method is as follows:
(1) it is arranged according to the priority descending of node, is stored in the node set V of unallocated channel in order1In；
(2) channel 1 is distributed for the node of highest priority first, and by the node from the node set V of unallocated channel1
Middle removal；
(3) node distribution channel is followed successively by according to the priority descending arrangement of node；When for some node i distribute channel
When, when calculating the pre- distribution channel ch for node i according to formula (6), (7), (8), channel has been distributed in the network that node i is subject to
Total interference ILoad of nodech(i), channel loading Chload when node i distribution channel chch(i) and interference is born with channel
The summation f of loadch(i):
Wherein ch (j) is the channel of interfering nodes j distribution；Channel of the γ (ch, ch (j)) between channel ch and ch (j)
Overlap factor；For the summation of the load weight of the node of the allocated channel ch；MaxILoad and
When MaxChload is node i respectively using all channels, the maximum value that the node of channel always interferes has been distributed in the network that is subject to
With the maximum value of channel loading；
(4) judge whether that all channels are traversed, if it is, going to step (5), otherwise, repeat step (3)；
(5) compare the total interference and channel loading summation corresponding to all channels, if there is a plurality of channel makes always to interfere
ILoadch(i) with channel loading summation fch(i) minimum, select the maximum channel distribution of channel number to node i.Otherwise, it will always do
Disturb ILoadch(i) with channel loading summation fch(i) the smallest channel distribution is to node i；By node i from the section of unallocated channel
Point set V1Middle removal.
(6) judge node set V1It whether is sky, if it is sky, channel allocation terminates.Otherwise, step (3) are repeated
~(5).
In multicast tree building, it should combine and consider jamming power, load and the influence of number of links, construct effective multicast
Tree；In channel distribution, to minimize interference and channel loading that node is subject to as target, WBA is made full use of, is distributed for node
Channel is further reduced network interferences, improves network capacity.
Multicast tree constructing method in the step 5), comprises the following steps:
(1) father node of each node and the number of child node are calculated, for arbitrary node i, by the father node of node i and
Child node is added to set FiAnd Hi；By in each grade multicast reception node or multicast source node be added to it is corresponding
In set；For cl grades and cl-1 grades, by cl grades and cl-1 grades of multicast reception node or multicast source node point
It is not added to cl layers of set MclWith cl-1 layers of set Mcl-1In；
(2) it is begun stepping through from the multicast reception node of highest level, according to the descending of node level, is followed successively by all grades
Corresponding set in the unique father node of node binding；For cl grades and cl-1 grades, if the node in cl grades and
Node in cl-1 grades is in mutual transmission range, then the node in cl grades is child node, and the node in cl-1 grades is
Father node, the method for binding unique father node for child node are as follows:
1. first in cl layers of set MclAll nodes father node in, select the father with most son node numbers
Node qf-1As relay node；If there is multiple father nodes all have most son node numbers, calculated using formula (5-1) each
Total interference load between father node and its child node:
WhereinFor father node qmWith its child nodeBetween total interference load:For child nodeWith father node qmBetween interference load measure coefficient: IL (qm) it is node qmInterference load,For nodeInterference load,For child nodeWith father node qmBetween physical distance, dmaxFor network
In between all nodes physical distance maximum value；In all father nodes with most son node numbers, selecting one has
The father node q of minimum total interference loadf-2As relay node；All child nodes for linking relay node and it, utilize formula
(5-3) obtains relay node interference load updated value:
WhereinRespectively father node qf-1、qf-2Interference load updated value；IL(qf-1)、IL
(qf-2) it is respectively father node qf-1、qf-2Interference load；For father node qf-1Child node,For father node qf-2Child node；
2. judging the father node q as relay nodef-1Or qf-2Whether in cl-1 layers of set Mcl-1In, if so, will
Father node qf-1Or qf-2Child node from cl layers of set MclMiddle removal.Otherwise, by father node qf-1Or qf-2It is added to cl-1
Layer set Mcl-1In, and by father node qf-1Or qf-2Child node from cl layers of set MclMiddle removal；
3. judging cl layers of set MclWhether it is sky, if it is empty, then goes to step (3)；It if not empty, then is again cl layers
Set MclRemaining node in the child node of only unique father node bind father node, binding method is as follows: for only one
A father nodeArbitrary nodeLink father nodeAnd child nodeI.e. by father
NodeWith child nodeBinding, and by father nodeAs relay node；Father's section is obtained based on formula (5-3)
PointInterference load updated valueThen father node is obtained according to formula (5-2)With its other son
Interference load measure coefficient updated value between node；For the arbitrary node for having multiple father nodesIt temporarily will section
PointFrom cl layers of set MclMiddle removal is added to cl layers of unbound set NclIn；
4. judgment step 3. in the father node boundWhether in cl-1 layers of set Mcl-1In, if it is, will
Father nodeChild nodeFrom cl layers of set MclMiddle removal.Otherwise by father nodeIt is added to cl-1 layers
Set Mcl-1In, by father nodeChild nodeFrom cl layers of set MclMiddle removal；
5. judging cl layers of set MclWhether it is sky, if it is empty, then goes to step 6.；Otherwise repeat step 3.~step
④；
6. judging cl layers of unbound set NclIt whether is sky, if it is empty, then after above-mentioned steps, cl layers of interior joint
Father node has been bound, step (3) are gone to, otherwise, has gone to step 7.；
7. being cl layers of unbound set NclIn node binding father node, binding method is as follows:
A. set N unbound for cl layersclIn arbitrary nodeJudge whether in cl layers of set Mcl-1
It is middle to there is the father node with child node binding, it is to go to step b, otherwise goes to step c；
B. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In there are part fathers
Node is bound with child node, calculates these father nodes and nodeBetween interference load measure coefficient, select one of them
Father nodeMake itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith section
PointFather node is obtained based on formula (5-3)Interference load updated value
C. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In not with
The father node of child node binding, calculate nodeWith the interference load measure coefficient between its each father node, father's section is selected
PointMake itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith nodeAnd by father nodeAs relay node；Father node is obtained based on formula (5-3)Interference load updated valueFather node is obtained according to formula (5-2)Interference load measure coefficient between its other child node is more
New value.
Compared with prior art, the beneficial effects of the present invention are embodied in:
(1) interference that node is subject to more accurately is measured using jamming power, and jamming power is applied to multicast tree structure
Build with two processes of channel distribution, lay the foundation to construct effective multicast tree and channel distribution.
(2) in multicast tree building process, joint considers the influence of interference, load and number of links, in multicast source node
Reasonable path is established between multicast reception end, reduces network interferences.
(3) true according to the jamming power load factor of each node first when distributing channel for the node on multicast tree
Determine channel allocation order, is then each node selection interference and the smallest channel of channel loading, it is dry to be further reduced network
It disturbs, improves network performance.
Detailed description of the invention
Method of the present invention is described in further detail with reference to the accompanying drawings and detailed description.
Fig. 1 is the main-process stream of the wireless Mesh netword QoS routing method for channel allocation of consideration jamming power of the invention
Figure；
Fig. 2 (a) is the flow chart of multicast tree building process；Fig. 2 (b)~Fig. 2 (g) is multicast tree building process schematic diagram；
Fig. 3 (a), 3 (b) are the schematic diagram for loading weight calculation；
Fig. 4 is the flow chart of channel allocation；
Specific embodiment
As shown in Figure 1, the wireless Mesh netword QoS routing method for channel allocation of consideration jamming power of the invention, including
Following steps:
Step 1) obtains the list of multicast reception node in network, obtains nodes information, obtains the initial of network
Topological structure.Nodal information mainly includes that the location information of each node, the transmission range of node and different channels interval are corresponding
Disturbance range, the neighborhood between node and interference relationships etc..If two nodes are in mutual transmission range, i.e., two
Physical distance between a node is less than or equal to transmission range, then the two nodes are neighborhood.If between two nodes
Physical distance be less than or equal to interference distance, then the two nodes be interference relationships.The corresponding disturbance range of different channels interval τ
R (τ) as shown in table 1, when channel spacing τ=0, corresponding disturbance range R (0)=550m, referred to as cochannel disturbance range；Channel
When interval τ >=5, corresponding disturbance range is 0.
Table 1
| Channel spacing τ | 0 | 1 | 2 | 3 | 4 | ≥5 |
| Corresponding disturbance range R (τ) | 550m | 508m | 397m | 242m | 149m | 0m |
Step 2) judges between any two node according to nodes information with the presence or absence of interference；For any section
Point i and arbitrary node j, if the physical distance between node i and node j is less than or equal to disturbance range, node i and section
Point j is interfered with each other.When not carrying out channel distribution, disturbance range is defined as cochannel disturbance range.If node j is node i
Interfering nodes, then node j is added to the interference set I of node iiIn.It is received further according to formula (1) calculate node i
Jamming power P from interfering nodes jij:
Wherein PjFor the transimission power of interfering nodes j；GjAnd GiThe respectively antenna gain of interfering nodes j and node i；hj
And hiThe respectively antenna height of interfering nodes j and node i；dijRepresent the physical distance between interfering nodes j and node i；α generation
Table path-loss factor, generally takes 2~4；
Each interfering nodes that the interference set for each node that step 3) is obtained according to step 2) and each node receive
Jamming power calculates the interference load that each node is subject to；For arbitrary node i, its interference load is IL (i):
Wherein load (j) is the initial load weight of node j, and load (i) is the initial load weight of node i；Node
Initial load weight definition is the client node number of the node serve.
Step 4) utilizes breadth first search (Breadth First Search, BFS) algorithm traverses network, according to each
Node is divided into different grades to the hop count of multicast source node by node.Wherein, gateway node is multicast source node, it etc.
Grade is the 0th grade；The grade of its a hop neighbor node is the 1st grade, and the grade of two-hop neighbor node is the 2nd grade, and so on, most
High-grade is CL grades.For any two the node u and v in transmission range each other, if the grade of node v is cl grades,
The grade of node u is cl-1 grades, and definition node v is the child node of node u, and node u is the father node of node v.It deletes same
Link between hierarchy node obtains Mesh tree.
The Mesh tree that step 5) is obtained according to step 4) constructs multicast tree.Multichannel multicast can be used in the present invention
(Multichannel Multicast, MCM), load balancing and interference (Load-balance and Interference-
Aware, LBIA) the methods of building multicast tree, particular reference is as follows: [Zeng G, Wang B, Ding Y, et
al.Efficient multicast algorithms for multichannel wireless mesh
Networks.IEEE Trans Parall Distrib Syst2010,21 (1): 86-99.] and [Shi W, Wang E, Li
Z,et al.A load-balance and interference-aware routing algorithm for multicast
in wireless mesh network[C]//International Conference on Information&
Communication Technology Convergence.IEEE, 2016.], the method as shown in Fig. 2 (a) can also be used
Construct multicast tree.Multicast tree building signal is specific as follows as shown in Fig. 2 (b)~Fig. 2 (g):
(1) father node of each node and the number of child node are calculated；For arbitrary node i, by the father node of node i and
Child node is respectively added to father node set FiWith child node set Hi.By the multicast reception node or multicast source in each grade
Node is added in corresponding set；For cl grades and cl-1 grades, by cl grades and cl-1 grades of multicast reception
Node or multicast source node are respectively added to cl layers of set MclWith cl-1 layers of set Mcl-1In；
As shown in Fig. 2 (b), according to step (1), it is assumed that node f, g, h, i, j, k are multicast reception node；For node
B, his father's node set are Fb={ S }, child node collection are combined into Hb={ f, g, h }.2nd layer of set and the 0th layer of set are respectively M2=
{ f, g, h, i, j, k } and M0={ S }, the 1st layer of set M1For null set.
(2) the multicast reception node from CL grades is begun stepping through, and according to the descending of node level, it is gradational to be followed successively by institute
The unique father node of node binding in corresponding set；For cl grades and cl-1 grades, if node and cl- in cl grades
Node in 1 grade is in mutual transmission range, then the node in cl grades is child node, and the node in cl-1 grade is that father saves
Point, the method for binding unique father node for child node are as follows:
1. first in cl layers of set MclAll nodes father node in, select the father with most son node numbers
Node qf-1As relay node.If there is multiple father nodes all have most son node numbers, calculated using formula (5-1) each
Total interference load between father node and its child node:
WhereinFor father node qmWith its child nodeBetween total interference load:For child nodeWith father node qmBetween interference load measure coefficient: IL (qm) it is node qmInterference load,For nodeInterference load,For child nodeWith father node qmBetween physical distance, dmaxFor network
In between all nodes physical distance maximum value；In all father nodes with most son node numbers, selecting one has
The father node q of minimum total interference loadf-2As relay node.All child nodes for linking relay node and it, utilize formula
(5-3) obtains relay node interference load updated value:
WhereinRespectively father node qf-1、qf-2Interference load updated value；IL(qf-1)、IL
(qf-2) it is respectively father node qf-1、qf-2Interference load；For father node qf-1Child node,For father node qf-2Child node；
1. according to step, as shown in Fig. 2 (b), the numerical value beside each of the links indicates the interference load between two nodes
Measure coefficient.Such as: ILMbf=2.2, ILMbg=3.3, ILMbh=2.8.It is first set M2Section in={ f, g, h, i, j, k }
Point binding father node.From Fig. 2 (b) as can be seen that M2In node father node be node b, c, d, e, in these father nodes,
Node b and node c have most son node numbers.So calculating separately between node b and node c and their child node total
Interference load, i.e. SumILMb=ILMbf+ILMbg+ILMbh=8.3 and SumILMc=ILMch+ILMci+ILMcj=8.6.Because
SumILMb< SumILMc, so selecting node b as relay node, child node f, g, the h of hinged node b and it are based on formula
(5-3) obtains the interference load updated value of node bAs a result as shown in Fig. 2 (c).
2. judging the father node q as relay nodef-1Or qf-2Whether in cl-1 layers of set Mcl-1In, if so, will
Father node qf-1Or qf-2Child node from cl layers of set MclMiddle removal.Otherwise, by father node qf-1Or qf-2It is added to cl-1
Layer set Mcl-1In, and by father node qf-1Or qf-2Child node from cl layers of set MclMiddle removal.
2. according to step, because of the 1st layer of set M1For null set, the father node b as relay node does not gather at the 1st layer
M1In, so father node b is added to the 1st layer of set M1In, by the child node f, g, h of father node b from the 2nd layer of set M2Middle shifting
It removes, updated 1st layer of set and the 2nd layer of set are respectively M1={ b } and M2={ i, j, k }.
3. judging cl layers of set MclWhether it is sky, if it is empty, then goes to step (3).It if not empty, then is again cl layers
Set MclRemaining node in the child node of only unique father node bind father node, binding method is as follows: for only one
A father nodeArbitrary nodeLink father nodeAnd child nodeI.e. by father nodeWith child nodeBinding, and by father nodeAs relay node；Father node is obtained based on formula (5-3)Interference load updated valueThen father node is obtained according to formula (5-2)With its other child node
Between interference load measure coefficient updated value；For the arbitrary node for having multiple father nodesTemporarily by node
From cl layers of set MclMiddle removal is added to cl layers of unbound set NclIn.
It 3. according to step, is M as shown in Fig. 2 (c)2Remaining node i in={ i, j, k }, j, k bind father node.Because
Node k only one father node e, so node k is connected with node e, and using node e as relay node；Based on formula (5-
3) the interference load updated value of node e is obtainedThen according to formula (5-2), the interference between node j and node e is obtained
Load metric factor updated valueAssuming that after updatingAs a result such as Fig. 2 (d).Because of node i, j has multiple fathers
Node, so temporarily by node i, j is from the 2nd layer of set M2Middle removal is added to the 2nd layer of unbound set N2In.Updated
2 layers of set M2={ k }, the 2nd layer of unbound set N2={ i, j }.
4. judgment step 3. in the father node boundWhether in cl-1 layers of set Mcl-1In, if it is, will
Father nodeChild nodeFrom cl layers of set MclMiddle removal.Otherwise by father nodeIt is added to cl-1 layers
Set Mcl-1In, by father nodeChild nodeFrom cl layers of set MclMiddle removal；
4. according to step, because of the 1st layer of set M1={ b }, father node e is not in set M1In, so node e is added to
M1In, by the child node k of node e from the 2nd layer of set M2Middle removal, updated 1st layer of set and the 2nd layer of set are respectively M1
={ b, e } and M2For sky.
5. judging cl layers of set MclWhether it is sky, if it is empty, then illustrates all only unique father nodes in cl layers
Child node bound father node, so going to step 6.；Otherwise repeat step 3.~step 4..
5. according to step, because of M2For sky, so going to step 6..
6. judging cl layers of unbound set NclIt whether is sky, if it is empty, then after above-mentioned steps, cl layers of interior joint
Father node has been bound, step (3) are gone to, otherwise, has gone to step 7..
6. according to step, because of the 2nd layer of unbound set N2It is not sky, so going to step 7..
7. being cl layers of unbound set NclIn node binding father node, binding method is as follows:
A. set N unbound for cl layersclIn arbitrary nodeJudge whether in cl layers of set Mcl-1
It is middle to there is the father node with child node binding, it is to go to step b, otherwise goes to step c；
B. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In there are part fathers
Node is bound with child node, calculates these father nodes and nodeBetween interference load measure coefficient, select one of them
Father nodeMake itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith section
PointFather node is obtained based on formula (5-3)Interference load updated value
C. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In not with
The father node of child node binding, calculate nodeWith the interference load measure coefficient between its each father node, father's section is selected
PointMake itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith nodeAnd by father nodeAs relay node；Father node is obtained based on formula (5-3)Interference load updated valueFather node is obtained according to formula (5-2)Interference load measure coefficient between its other child node is more
New value.
It 7. according to step, is first the 2nd layer of unbound set N as shown in Fig. 2 (d)2Node i binding father's section in={ i, j }
Point, binding method are as follows: there are two father node c and d for node i, this two father node is not in M1In, father node c and d and node i
Between interference load measure coefficient be respectively ILMci=3.5 and ILMdi=2.4, because of ILMdi< ILMci, so selection father's section
Point d links father node d and node i as relay node, obtains the interference load updated value of node d based on formula (5-3)The interference load measure coefficient updated value between father node d and node j is obtained according to formula (5-2)Assuming that
After updateAs a result as shown in Fig. 2 (e).
8. judgment step 7. in father node as relay nodeWhether in cl layers of set Mcl-1In, if it is,
By father nodeChild node from cl layers of unbound set NclMiddle removal；Otherwise by father nodeIt is added to set Mcl-1
In, and by father nodeChild nodeFrom cl layers of unbound set NclMiddle removal.
8. according to step, because of the 1st layer of set M1={ b, e }, father node d be not in the 1st layer of set M1In, so by node d
It is added to the 1st layer of set M1In, by the child node i of node d from the 2nd layer of unbound set N2Middle removal, updated 1st layer of collection
It closes and the 2nd layer of unbound set is respectively M1={ b, e, d } and N2={ j }.
9. judging cl layers of unbound set NclWhether it is empty, is cl and cl-1 by grade, but not at cl layers if it is empty
Set MclWith cl-1 layers of set Mcl-1In node deleted from Mesh tree, go to step (3)；Otherwise repeat step 7.~step
Suddenly 8..
9. according to step, as shown in Fig. 2 (e), because of N2={ j } is not sky, thus repeat step 7.~step 8., be
Node j binds father node, binding method such as step 7.: node j is there are three father node c, d and e, since node d and e is at the 1st layer
Set M1In, in order to reduce number of links, node j selected from node d and e one as relay node, father node d and e and section
Interference load measure coefficient between point j is respectivelyWithBecauseSo choosing
Father node e is selected as relay node, hinged node j and node e, the interference load updated value of node e is obtained based on formula (5-3)As a result as shown in Fig. 2 (f).
8. according to step, because of the 1st layer of set M1={ b, e, d }, father node e are in the 1st layer of set M1In, thus only need by
The child node j of node e is from the 2nd layer of unbound set N2Middle removal, updated 1st layer of set and the 2nd layer of unbound set point
It Wei not M1={ b, e, d } and N2For sky.
Because of N2For sky, and the grade of node c is 1, and not in the 1st layer of set M1In, so node c is deleted.Then turn
To step (3).
(3) judge whether grade cl-1 is 0, if 0, multicast tree building is completed, and obtains multicast tree；Otherwise step is repeated
Suddenly (2) are cl-1 layers of Mcl-1In node binding father node, until grade cl-1 be 0.
It is not 0 because of cl-1=2-1=1 according to step (3), is the 1st layer of set M so repeating step (2)1
Node b in={ b, e, d }, d, e bind father node, because of node b, d, e only one father node S, so link father node S
With node b, d, e, the interference load updated value of node S is obtained based on formula (5-3)Because father node S collects at the 0th layer
Close M0In, so by the child node b, d, e of father node S from the 1st layer of set M1Middle removal.Updated 1st layer is gathered and the 0th layer
Set is respectively M1For empty and M0={ S }.So far multicast tree building is completed, as a result as shown in Fig. 2 (g).
The multicast tree that step 6) is built according to step 5) calculates any section of each node in multicast tree using formula (6)
The jamming power load factor Pr (i) of point i, using jamming power load factor as the priority of each node, and to each section
The priority of point carries out descending and arranges the sequence for determining channel distribution.
Wherein IiFor the interfering nodes set of node i；P (i) is the interference from all interfering nodes that node i receives
Power；Load (j) is the load weight of interfering nodes j.P (i) and Load (j) can use formula (4) and formula (5) is counted
It calculates.
Wherein OjRepresent descendants's node of node j；Load (m) represents the initial load weight of node m.
The calculation method of load weight Load (j) is exemplified below, as shown in Figure 3.Assuming that Fig. 3 (a) is initial load
Schematic diagram, node S represent multicast source node, and node d~g is multicast reception end, and the value beside each node is its initial load
Value, i.e. load (d)=2, load (e)=3, load (f)=1, load (g)=3.From Fig. 3 (a) as can be seen that node b is node
The father node of e and node f, thus the load weight of node b be node b, the sum of initial load weight of e, f, i.e. Load (b)=
+ load (f)=5 load (b)+load (e).Similarly, the load weight of node c and node a is respectively Load (c)=load
(c)+load (g)=4, Load (a)=+ load (d)=8 load (a)+load (c)+load (g).Similarly, the load power of node S
Weight is Load (S)=13.The load weight calculation of all nodes is completed, as shown in Fig. 3 (b).
Step 7) is that the node on multicast tree distributes channel, until node all on multicast tree is assigned channel.For
When node distributes channel, channel only is distributed for the transmission interface of node, receiving interface is consistent with its father node.Channel distribution mistake
Journey flow chart is as shown in figure 4, specific as follows:
(1) it is arranged according to the priority descending of node, is stored in the node set V of unallocated channel in order1In.
(2) channel 1 is distributed for the emission interface of the node of highest priority first, and by the node from unallocated channel
Node set V1Middle removal.
(3) node distribution channel is followed successively by according to the priority descending arrangement of node.When for some node i distribute channel
When, when calculating the pre- distribution channel ch for node i according to formula (6), (7), (8), channel has been distributed in the network that node i is subject to
Node always interferes ILoadch(i), channel loading Chload when node i distribution channel chch(i) and interference and channel loading
Summation fch(i):
Wherein ch (j) is the channel of interfering nodes j distribution；Channel of the γ (ch, ch (j)) between channel ch and ch (j)
Overlap factor；For the summation of the load weight of the node of the allocated channel ch；MaxILoad and
When MaxChload is node i respectively using 11 channels provided by all IEEE802.11b/g standards, in the network that is subject to
The maximum value of maximum value and channel loading that the node of channel always interferes is distributed.
(4) judge whether that 11 channels are traversed, if it is, going to step (5), otherwise, repeat step (3).
(5) compare the total interference and channel loading summation corresponding to all 11 channels, if there is a plurality of channel makes always to do
Disturb ILoadch(i) with channel loading Chloadch(i) summation fch(i) minimum, select the maximum channel distribution of channel number to node i
Emission interface.Otherwise, ILoad will always be interferedch(i) with channel loading Chloadch(i) summation fch(i) the smallest channel distribution
To the transmission interface of node i.By node i from the node set V of unallocated channel1Middle removal.
(6) judge node set V1It whether is sky, if it is sky, channel allocation terminates.Otherwise, step (3) are repeated
~(5).
Claims (4)
1. a kind of wireless Mesh netword QoS routing and method for channel allocation for considering jamming power, it is characterised in that including following
Step:
Step 1) obtains the list of multicast reception node in network, obtains network node information and link information, obtains network
Initial primary topology；
Step 2) judges between any two node i and j according to the location information of network node with the presence or absence of interference；If section
Physical distance between point i and node j is less than or equal to disturbance range, then node i is interfered with each other with node j；According to formula
(1) the jamming power P from interfering nodes j that calculate node i is receivedij:
Wherein PjFor the transimission power of interfering nodes j；GjAnd GiThe respectively antenna gain of interfering nodes j and node i；hjAnd hiPoint
Not Wei interfering nodes j and node i antenna height；dijRepresent the physical distance between interfering nodes j and node i；α delegated path
Fissipation factor.
Step 3) calculates the interference load that each node is subject to, and for arbitrary node i, the interference load that it is subject to is IL (i):
Wherein load (j) is the load weight of node j, and load (i) is the load weight of node i；The load power of node when initial
Redefine the client node number for the node serve；
Step 4) utilizes breadth-first search traverses network, according to each node to the hop count of multicast source node, by node
It is divided into different grades；For any two node u and v in mutual transmission range, if the grade of node v is cl grades,
The grade of node u is cl-1 grades, and definition node v is the child node of node u, and node u is the father node of node v；It deletes same
Link between hierarchy node obtains Mesh tree；
The Mesh tree that step 5) is obtained according to step 4) constructs multicast tree；
The multicast tree that step 6) is built according to step 5), the jamming power for calculating each node in multicast tree using formula (3) are negative
The factor is carried, and using jamming power load factor as the priority of each node；
Wherein Pr (i) is the jamming power load factor of node i, IiFor the interfering nodes set of node i；P (i) is node i reception
The jamming power from all interfering nodes arrived；Load (j) is the load weight of node j；OjRepresent the descendants of node j
Node；Load (m) represents the initial load weight of node m；
Step 7) is followed successively by each node distribution channel, method for channel allocation is such as according to the priority orders of step 6) interior joint
Under:
(1) it is arranged according to the priority descending of node, is stored in the node set V of unallocated channel in order1In；
(2) channel 1 is distributed for the node of highest priority first, and by the node from the node set V of unallocated channel1Middle shifting
It removes；
(3) node distribution channel is followed successively by according to the priority descending arrangement of node；When distributing channel for some node i,
When calculating the pre- distribution channel ch for node i according to formula (6), (7), (8), the section of channel has been distributed in the network that node i is subject to
Total interference ILoad of pointch(i), channel loading Chload when node i distribution channel chch(i) and interference and channel loading
Summation fch(i):
Wherein ch (j) is the channel of interfering nodes j distribution；Channel overlap of the γ (ch, ch (j)) between channel ch and ch (j)
The factor；For the summation of the load weight of the node of the allocated channel ch；MaxILoad and MaxChload
When being node i respectively using all channels, maximum value that the node of channel always interferes has been distributed in the network that is subject to and channel is negative
The maximum value of load；
(4) judge whether that all channels are traversed, if it is, going to step (5), otherwise, repeat step (3)；
(5) compare the total interference and channel loading summation corresponding to all channels, if there is a plurality of channel makes always to interfere ILoadch
(i) with channel loading summation fch(i) minimum, select the maximum channel distribution of channel number to node i.Otherwise, it will always interfere
ILoadch(i) with channel loading summation fch(i) the smallest channel distribution is to node i；By node i from the node of unallocated channel
Set V1Middle removal.
(6) judge node set V1It whether is sky, if it is sky, channel allocation terminates.Otherwise, step (3)~(5) are repeated.
2. the wireless Mesh netword QoS routing and method for channel allocation according to claim 1 for considering jamming power,
It is characterized in that multicast tree constructing method in the step 5), comprises the following steps:
(1) father node of each node and the number of child node are calculated, for arbitrary node i, the father node of node i and son are saved
Point is added to set FiAnd Hi；By in each grade multicast reception node or multicast source node be added to corresponding set
In；For cl grades and cl-1 grades, cl grades and cl-1 grades of multicast reception node or multicast source node are added respectively
It is added to cl layers of set MclWith cl-1 layers of set Mcl-1In；
(2) it is begun stepping through from the multicast reception node of highest level, according to the descending of node level, is followed successively by the gradational phase of institute
The unique father node of node binding in should gathering；For cl grades and cl-1 grades, if node and cl-1 in cl grades
Node in grade is in mutual transmission range, then the node in cl grade is child node, and the node in cl-1 grades is that father saves
Point, the method for binding unique father node for child node are as follows:
1. first in cl layers of set MclAll nodes father node in, select the father node with most son node numbers
qf-1As relay node；If there is multiple father nodes all have most son node numbers, each father is calculated using formula (5-1) and is saved
Point and interference load total between its child node:
WhereinFor father node qmWith its child nodeBetween total interference load:For child nodeWith father node qmBetween interference load measure coefficient: IL (qm) it is node qmInterference load,For nodeInterference load,For child nodeWith father node qmBetween physical distance, dmaxFor network
In between all nodes physical distance maximum value；In all father nodes with most son node numbers, selecting one has
The father node q of minimum total interference loadf-2As relay node；All child nodes for linking relay node and it, utilize formula
(5-3) obtains relay node interference load updated value:
WhereinRespectively father node qf-1、qf-2Interference load updated value；IL(qf-1)、IL(qf-2) point
It Wei not father node qf-1、qf-2Interference load；For father node qf-1Child node,For father node qf-2Child node；
2. judging the father node q as relay nodef-1Or qf-2Whether in cl-1 layers of set Mcl-1In, if so, by father node
qf-1Or qf-2Child node from cl layers of set MclMiddle removal.Otherwise, by father node qf-1Or qf-2It is added to cl-1 layers of set
Mcl-1In, and by father node qf-1Or qf-2Child node from cl layers of set MclMiddle removal；
3. judging cl layers of set MclWhether it is sky, if it is empty, then goes to step (3)；It if not empty, then is again cl layers of set
MclRemaining node in the child node of only unique father node bind father node, binding method is as follows: being directed to only one father
NodeArbitrary nodeLink father nodeAnd child nodeI.e. by father nodeWith
Child nodeBinding, and by father nodeAs relay node；Father node is obtained based on formula (5-3)It is dry
Disturb load updated valueThen father node is obtained according to formula (5-2)It is dry between its other child node
Disturb load metric factor updated value；For the arbitrary node for having multiple father nodesTemporarily by nodeFrom cl
Layer set MclMiddle removal is added to cl layers of unbound set NclIn；
4. judgment step 3. in the father node boundWhether in cl-1 layers of set Mcl-1In, if it is, father is saved
PointChild nodeFrom cl layers of set MclMiddle removal.Otherwise by father nodeIt is added to cl-1 layers of set
Mcl-1In, by father nodeChild nodeFrom cl layers of set MclMiddle removal；
5. judging cl layers of set MclWhether it is sky, if it is empty, then goes to step 6.；Otherwise repeat step 3.~step 4.；
6. judging cl layers of unbound set NclIt whether is sky, if it is empty, then after above-mentioned steps, cl layers of interior joint are
Father node is bound, step (3) is gone to, otherwise, goes to step 7.；
7. being cl layers of unbound set NclIn node binding father node, binding method is as follows:
A. set N unbound for cl layersclIn arbitrary nodeJudge whether in cl layers of set Mcl-1In deposit
In the father node with child node binding, it is to go to step b, otherwise goes to step c；
B. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In there are part father nodes
It is bound with child node, calculates these father nodes and nodeBetween interference load measure coefficient, select one of father nodeMake itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith nodeFather node is obtained based on formula (5-3)Interference load updated value
C. assume cl layers of unbound set NclIn nodeIn cl layers of set Mcl-1In not with child node
The father node of binding, calculate nodeWith the interference load measure coefficient between its each father node, a father node is selected
Make itself and child nodeBetween interference load measure coefficientMinimum links father nodeWith nodeAnd
By father nodeAs relay node；Father node is obtained based on formula (5-3)Interference load updated valueRoot
Father node is obtained according to formula (5-2)Interference load measure coefficient updated value between its other child node.
3. the wireless Mesh netword QoS routing and method for channel allocation according to claim 1 for considering jamming power,
It is characterized in that constructing multicast tree using multichannel multicasting method in the step 5).
4. the wireless Mesh netword QoS routing and method for channel allocation according to claim 1 for considering jamming power,
It is characterized in that constructing multicast tree using load balancing and interference method in the step 5).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910348124.1A CN110072266B (en) | 2019-04-28 | 2019-04-28 | Wireless Mesh network multicast routing channel allocation method considering interference power |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910348124.1A CN110072266B (en) | 2019-04-28 | 2019-04-28 | Wireless Mesh network multicast routing channel allocation method considering interference power |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110072266A true CN110072266A (en) | 2019-07-30 |
| CN110072266B CN110072266B (en) | 2022-09-09 |
Family
ID=67369213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910348124.1A Active CN110072266B (en) | 2019-04-28 | 2019-04-28 | Wireless Mesh network multicast routing channel allocation method considering interference power |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110072266B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111010234A (en) * | 2019-12-23 | 2020-04-14 | 烽火通信科技股份有限公司 | Relay node selection method and system |
| WO2021133512A1 (en) * | 2019-12-26 | 2021-07-01 | Qualcomm Incorporated | Power management priority handling in integrated access and backhaul |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103747530A (en) * | 2014-01-06 | 2014-04-23 | 吉林大学 | Wireless Mesh network channel allocation system and wireless Mesh network channel allocation method under partially overlapped channels |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN106993310A (en) * | 2017-02-27 | 2017-07-28 | 北京国电通网络技术有限公司 | Integrated routing method and system based on Load-aware in a kind of wireless self-networking |
| CN109257811A (en) * | 2018-10-18 | 2019-01-22 | 吉林大学 | The wireless Mesh netword of joint Power control partly overlaps method for channel allocation |
-
2019
- 2019-04-28 CN CN201910348124.1A patent/CN110072266B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103747530A (en) * | 2014-01-06 | 2014-04-23 | 吉林大学 | Wireless Mesh network channel allocation system and wireless Mesh network channel allocation method under partially overlapped channels |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN106993310A (en) * | 2017-02-27 | 2017-07-28 | 北京国电通网络技术有限公司 | Integrated routing method and system based on Load-aware in a kind of wireless self-networking |
| CN109257811A (en) * | 2018-10-18 | 2019-01-22 | 吉林大学 | The wireless Mesh netword of joint Power control partly overlaps method for channel allocation |
Non-Patent Citations (3)
| Title |
|---|
| 石文孝等: "无线Mesh 网络功率控制与信道分配联合优化", 《北京邮电大学学报》 * |
| 石文孝等: "无线Ｍｅｓｈ网络信道分配与路由度量联合优化算法", 《吉林大学学报（工学版）》 * |
| 石文孝等: "无线Ｍｅｓｈ网络负载与干扰感知", 《吉林大学学报（工学版）》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111010234A (en) * | 2019-12-23 | 2020-04-14 | 烽火通信科技股份有限公司 | Relay node selection method and system |
| WO2021133512A1 (en) * | 2019-12-26 | 2021-07-01 | Qualcomm Incorporated | Power management priority handling in integrated access and backhaul |
| US11743826B2 (en) | 2019-12-26 | 2023-08-29 | Qualcomm Incorporated | Power management priority handling in integrated access and backhaul |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110072266B (en) | 2022-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101517932B (en) | Multi-channel allocation method for multi radio multi-hop wireless mesh network | |
| CN102223644B (en) | System and method for combining relay selection and power distribution | |
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN111263419B (en) | Unmanned aerial vehicle-based dynamic routing method for stereo heterogeneous network in emergency scene | |
| CN103747530B (en) | Wireless Mesh network channel allocation system and wireless Mesh network channel allocation method under partially overlapped channels | |
| CN104038946B (en) | Partially-overlapped channel allocation method for multicast of wireless mesh network | |
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| CN109275154B (en) | Dynamic self-adaptive routing path planning method based on double-layer topological routing algorithm | |
| CN110072266A (en) | Consider the wireless Mesh netword QoS routing method for channel allocation of jamming power | |
| CN106559352A (en) | The QoS routing mechanisms that a kind of interference of smart grid-oriented NAN is perceived | |
| Sarasvathi et al. | QoS guaranteed intelligent routing using hybrid PSO-GA in wireless mesh networks | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN102612109A (en) | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction | |
| CN100499552C (en) | Channel distributing method and device in wireless mesh network | |
| CN116634504A (en) | Unmanned aerial vehicle networking topology relation and bandwidth allocation optimization strategy based on improved NSGA-II algorithm | |
| CN104754589B (en) | Dynamic networking method based on traffic aware | |
| CN109039905B (en) | PLC and wireless heterogeneous networking system and method based on link perception | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN104080088A (en) | Method and device of channel allocation | |
| CN106358257A (en) | Wireless communication network configuration realization method | |
| CN107635235A (en) | A kind of multiband matches somebody with somebody the more radio frequencies of electricity consumption mobile Ad hoc network and method for channel allocation | |
| CN105530678B (en) | A kind of wireless backhaul route selection method in super-intensive network based on load and time delay | |
| CN115134928B (en) | Wireless Mesh network congestion control method with optimized frequency band route | |
| CN105704756A (en) | Multirate wireless Mesh network routing metric and channel distribution combination method | |
| CN103796325B (en) | The distribution of wireless Mesh netword multicast portions overlapped channels and dispatching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |