CN106792980A - A kind of joint route measurement and the method for channel allocation that partly overlaps - Google Patents
A kind of joint route measurement and the method for channel allocation that partly overlaps Download PDFInfo
- Publication number
- CN106792980A CN106792980A CN201611067766.7A CN201611067766A CN106792980A CN 106792980 A CN106792980 A CN 106792980A CN 201611067766 A CN201611067766 A CN 201611067766A CN 106792980 A CN106792980 A CN 106792980A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- message
- link
- metric
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Include with the method for channel allocation that partly overlaps the invention discloses a kind of joint route measurement：Determine the position of source node and destination node in channel；It is that source node and destination node distribute channel；Source node sends route requests message to its multicast, until reaching destination node；The node of route requests message is received according to route metric, route replies message is optionally replied；The node of route replies message is received according to route metric, routing table is optionally updated.The present invention improves route metric in the case where connectedness is ensured, improves flexibility and the dynamic of overall network, improves handling capacity, reduces routing cost.
Description
Technical field
The present invention relates to communication technical field, a kind of joint route measurement and the channel distribution side that partly overlaps are particularly related to
Method.
Background technology
Carry out transmission information using electromagnetic wave more than radio communication, usual signal all takes broad frequency band, and energy is mainly concentrated
In narrower frequency band range.Such as 2.4GHz ISM (industrial, scientific, medical) frequency ranges 802.11b/g
14 channels are divided into altogether, generally only use preceding 11 channels.The centre frequency of adjacent channel is at intervals of 5MHz, and every channel
The spectral bandwidth of occupancy be 22MHz, therefore channel spacing (difference of the channel number i.e. representated by centre frequency) must reach 5 and
Above time-frequency spectrum will not just be overlapped, and such channel is referred to as orthogonal channel (orthogonal channel).802.11b/g is most
Available orthogonal channel is 3, has overlapping channel to be referred to as the channel POC (partially that partly overlap between frequency spectrum
overlapped channel).Traditional wireless network thinks the adjacent-channel interference (adjacent that POC brings
Channel interference) proper communication between node is had a strong impact on, therefore it is usually the 2 of the parallel communications being spaced closely together
Individual node distribution orthogonal channel.But the rare of frequency spectrum resource causes that network is difficult to avoid as the link distribution being spaced closely together is identical
Channel.Thus caused common-channel interference (co-channel interference) can reduce message transmission rate, reduce network
In parallel transmission number, the performance issue such as trigger WMN capacity to decline.With cognitive radio (cognitive radio) and soft
The development of part defined radio (software defined radio), the interference control problem of POC can be solved effectively,
The interference dynamic select channel that node can be observed according to itself, so that the parallel transmission number in increasing network, lifts network
Overall throughput performance.
Channel allocation algorithm (the Partially overlapped of the channel that partly overlaps under many radio frequency multichannel environments
Channel assignment for MRMC-WMN, POCA) it is the concept for borrowing weighted conflict figure, the business according to node is born
Carry the method for determining channel allocation order.The method thinks that the link generally load nearer apart from gateway is heavier, is carrying out channel
Should be paid the utmost attention during distribution.The weak point of POCA has：
First, only considered the channel allocation algorithm using the channel that partly overlaps, its knot with route metric is not accounted for
Close, typically in the design problem of channel allocation algorithm, route metric and channel allocation algorithm are the dependences with height
, the measurement formula for optimizing channel allocation order can still optimize under barrier attenuation model；
Second, the cofactor in enhanced route metric is not quantized into continuous numerical value, it is unfavorable for calculating and easy
There is the equal situation of metric.
Third, the routing cost of enhanced route metric is excessive.
The content of the invention
In view of this, the purpose of the embodiment of the present invention is to propose a kind of joint route measurement and the channel distribution that partly overlaps
Method, can further optimize channel allocation order, and reduce routing cost.
Based on above-mentioned purpose joint route measurement provided in an embodiment of the present invention and the method for channel allocation that partly overlaps, bag
Include：
Determine the position of source node and destination node in channel；
It is that source node and destination node distribute channel；
Source node sends route requests message to its multicast, until reaching destination node；
The node of route requests message is received according to route metric, route replies message is optionally replied；
The node of route replies message is received according to route metric, routing table is optionally updated.
It is that source node includes with destination node distribution channel in some optional embodiments：
Topological structure according to physical link calculates the relative importance value of each node, and according to relative importance value from high to low by each
Node is bound with its neighbor node interface；
Determine the signal intensity of each receiving terminal and the cofactor of continuous value on each link, and according to each cofactor
Value determine whether respective links distribute channel.
In some optional embodiments, the cofactor of continuous value is on described each link：In synergetic structure,
The ratio between actual receiving power for signal threshold level and the receiving node of receiving node；It is 1 in miscoordination structure；It is described
Value according to each cofactor determines whether that respective links distribution channel is：Only more than zero less than or equal to one collaboration because
The corresponding link distribution channel of son.
In some optional embodiments, the value according to each cofactor determine whether respective links distribution channel it
Afterwards, each link distribution priority is determined, and according to distribution priority from high to low, to have distributed the link pair of channel its interference value
Minimum target is that link distributes channel, wherein, distribution priority is the neighbor node number of the both link ends point, and apart from gateway
The ratio between minimum hop count and the product of corresponding cofactor.
In some optional embodiments, the route requests message includes the network layer address of source node and destination node
Information；The source node sends route requests message to its multicast, is until reaching destination node：Source node is to neighbor node
Multicast sends route requests message, and neighbor node is constantly forwarded until finding destination node；Meanwhile, set up based on repeating process
Reverse route table, and the link value of a certain node of source node to routing link is stored in the reverse route table of the link.
In some optional embodiments, the node of route requests message is received according to route metric, optionally reply
Route replies message includes：
The node for receiving route requests message determines upper hop node to the destination of this node according to route requests message
Location and route metric, wherein, route metric is the cofactor and the product for expecting emitting times of respective links；
When this node is purpose node, while the route metric of mulitpath is calculated, using reverse route by route
Measure minimum path and send route replies message to source node, and by the chain of a certain node in destination node to routing link
Road value is stored in forward route table；If this node is not to receive route requests message and its route metric for the first time less than having replied
The route metric of route requests message, then reply route replies message, otherwise abandons the route requests message.
In some optional embodiments, the node of route requests message is received according to route metric, optionally reply
Route replies message also includes；
When there is the route to destination node in the non-destination node of this node but routing table, this node in routing table is arrived into mesh
The route of node be added to the route of this node with source node in route requests message, obtain source node to destination node road
By, and route replies message is replied according to reverse route；
When in the non-destination node of this node and routing table not to the route of destination node, the route requests report is forwarded
Text, when route requests message is forwarded to different nodes from source node, the node for being passed through sets up the reverse road of source node
By；If this node receives route replies message for the first time or the single-hop route metric of the route requests message is less than what is received in the past
Route requests message single-hop is measured, then update reverse route and turn simultaneously in being written to route requests message to each neighbor node
Hair route requests message, otherwise abandons the route requests message.
In some optional embodiments, the node of route replies message is received according to route metric, optionally update
Routing table includes：
When this node is source node, calculates route metric and be saved in forward route list item, and according to route to purpose
Node sends packet.If this node receives route replies message for the first time, this route is saved in routing table；Such as
Really this node is not to receive the route metric of route replies message and the route replies message for the first time less than the road for receiving before
By the route metric of response message, then the route replies message in this routing update to routing table, will be otherwise abandoned；
When this node non-source node, the route in route replies message is subtracted each other with the reverse route of preservation in this node
As this node to destination node forward route, and this section point is set to forward route replies report according to reverse path down hop node
Text.
In some optional embodiments, the node of route replies message is received according to route metric, optionally update
Also include after routing table：Each safeguards route comprising the node periodic broadcasting handshake message routeing, wherein, work as handshake message
It was found that when link is opened a way, sending error message and notifying inaccessible knot removal respective record or to be repaiied because link disconnects
It is multiple.
From the above it can be seen that joint route measurement provided in an embodiment of the present invention and the channel distribution side that partly overlaps
Method, sends route requests message, receives route requests by distributing channel, source node for source node and destination node to its multicast
The node of message optionally replys route replies message according to route metric, receives the node of route replies message according to route
Metric sebection ground updates the technological means of routing table, in the case where connectedness is ensured, improves route metric, improves whole
The flexibility of volume grid and dynamic, improve handling capacity, reduce routing cost.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the present invention joint route measurement for providing and the method for channel allocation that partly overlaps；
Fig. 2 is the joint route measurement for providing of the invention and the detailed process of the embodiment of the method for channel allocation that partly overlaps
Figure；
It is source node and purpose during Fig. 3 is for the present invention joint route measurement for providing and the method for channel allocation that partly overlaps
The flow chart of node distribution channel；
During Fig. 4 is for the present invention joint route measurement for providing and the method for channel allocation that partly overlaps, route requests report is received
The node of text optionally replys the flow chart of route replies message according to route metric；
During Fig. 5 is for the present invention joint route measurement for providing and the method for channel allocation that partly overlaps, route replies report is received
The node of text optionally updates the flow chart of routing table according to route metric；
Fig. 6 performs the joint route measurement and the one of the device of the method for channel allocation that partly overlaps for what the present invention was provided
The hardware architecture diagram of individual embodiment.
Specific embodiment
To make the object, technical solutions and advantages of the present invention become more apparent, below in conjunction with specific embodiment, and reference
Accompanying drawing, further describes to the embodiment of the present invention.
It should be noted that the statement of all uses " first " and " second " is for differentiation two in the embodiment of the present invention
The entity of individual same names non-equal or the parameter of non-equal, it is seen that " first " " second " should not only for the convenience of statement
The restriction to the embodiment of the present invention is interpreted as, subsequent embodiment is no longer illustrated one by one to this.
Based on above-mentioned purpose, the embodiment of the present invention the on one side, it is proposed that one kind can for different user or not
The user of same type carries out the joint route measurement of data recommendation and the one embodiment for the method for channel allocation that partly overlaps.Figure
Shown in 1 and Fig. 2 is the joint route measurement of present invention offer and the one embodiment for the method for channel allocation that partly overlaps
Schematic flow sheet.
The joint route measurement and the method for channel allocation that partly overlaps, optionally, are applied to server, including：
Step S101, determines the position of source node and destination node in channel.
When source node S needs to send data to destination node D, source node S initiates pathfinding process.
Step S103, is that source node distributes channel with destination node.
Step S101 is as shown in Figure 3 with the detail flowchart of step S103.Degree values are calculated according to physical topological structure
(i.e. foregoing relative importance value), the node for possessing degree values higher preferentially enters line interface binding with neighbor node.Initial Channel Assignment,
Each receiving terminal obtains signal intensity, and cofactor β is calculated and determined；In network any link β value whether beyond threshold value (0,1],
β value if certain link exceeds threshold value (β value illustrates that the link can not be properly received packet if being more than 1), distributes to the link
Channel.
For cofactor βXY, it is as follows that the present invention provides specific computational methods：
Wherein βXYThe cofactor of any link XY (nodes X, the link that node Y is constituted) is represented, and if only if possesses association
β during same structure (CoS)XYJust there is value, β during without synergetic structureXY=1, general βXY∈(0,1]；RxthreshYRepresent receiving node Y
Signal threshold level, i.e., the signal intensity that node Y is received be higher than this threshold value, packet can just be correctly received；
Represent that node Y receives the power of the actual reception signal from nodes X.
Whether any link β value exceeds threshold value beta in checking networkXY∈ (0,1], if certain link exceeds threshold value, illustrate this
Packet on link cannot be correctly received, then not for the link distributes channel, by it from the link set of channel to be allocated
Exclude；Then link channel allocation order is calculated, the computing formula after embodiment of the present invention optimization is as follows：
Wherein num_neighbour represents two neighbor node numbers of end points of the link；Min_hop_count represents distance
The minimum hop count of gateway；βXYRepresent the cofactor of any link XY (nodes X, the link that node Y is constituted), and general βXY∈
(0,1], βXY, closer to 1, cofactor is stronger while the transmittability of link XY is lower, Rank (l for valueXY) channel distribution it is excellent
First level is lower；Especially, βXY→ 0 actual receiving power for representing receiving node YIt is very big, barrier can be ignored to this
The influence of handling capacity on link, Rank (lXY) → ∞ represents that interference problem is complex because it possesses synergetic structure, therefore the link
Distribution channel has limit priority.Rank(lXY) it is used to quantify the possibility of link obstructions, possess Rank (l higherXY) value
Link get over and be likely to become power system capacity bottleneck, also therefore when channel is distributed with priority higher.
Channel allocation order presses Rank (lXY) descending arrangement, and calculating has distributed the link pair of channel its interference value, selects
Minimum value carries out channel distribution.
Step S105, source node sends route requests message to its multicast, until reaching destination node.
Node to neighbor node multicast RREQ messages (i.e. route requests message), wherein record source node and destination node
Network layer address information, neighbor node constantly forwards RREQ until finding destination node, reverse route set up in repeating process
Table, the link value of a certain node of source node to routing link is stored in the reverse route table of the link.
Step S107, receives the node of route requests message according to route metric, optionally replys route replies message.
The detail flowchart of step S107 is as shown in Figure 4.Node receives the processing method after RREQ messages.Node is from RREQ
Upper hop node to the destination address and route metric of this node is found in the single-hop information field of message.
Route metric computational methods are as follows：
powerETXXY=βXY·ETXXY (2.4)
Wherein, powerETXXYRepresent route metric, ETXXYRepresent the expectation emitting times between link XY.Under OAM,
If the ETX on different links is identical, can further be measured by β value.
βXYRepresent the cofactor of any link XY (nodes X, the link that node Y is constituted), and general βXY∈ (0,1], when
And if only if β when possessing synergetic structure (CoS)XYJust there is value, β during without synergetic structureXY=1, βXYValue is closer to 1, and cofactor is stronger
The transmittability of link XY is lower simultaneously.
If this node is destination node, the route metric of mulitpath is calculated, relatively and select mulitpath
powerETXXYThe path of minimum value, and RREP messages (i.e. route replies message) is sent to source node by reverse route, by mesh
Node to routing link in the link β ETX values of a certain node be stored in forward route table；If this node is not first
It is secondary to receive RREQ messages, and its route metric is better than having replied the route metric of RREQ messages, then reply RREP messages, otherwise loses
Abandon RREQ messages.
If this node is not destination node, but has the route to destination node in its routing table, then by sheet in routing table
Node is added to the route R of destination node with the route R of source node in RREQ messages to this node, obtains source node to purpose section
Point route R；By route β of the source node to this node in route the β ETX and RREQ of this node in routing table to destination node
ETX is added, and obtains source node and route β ETX to destination node, and RREP messages are directly replied according to reverse route；If
Not to the route of destination node in the routing table of intermediate node, then need to forward RREQ messages, when RREQ messages a from source
When node is forwarded to different nodes, the node for being passed through on the way will automatically set up the reverse route of source node；If this section
Point receives RREP messages for the first time or the single-hop route metric of the RREQ messages is better than the RREQ message single-hop degree for receiving in the past
Amount, then first update reverse route, route R and β ETX, will be written in RREQ messages and forward to each neighbor node β ETX
RREQ messages；This node is not to receive RREQ messages and the single-hop measurement of the RREQ messages for the first time not having to be better than receiving in the past
RREQ messages single-hop measurement, then abandon RREQ messages.
Step S109, receives the node of route replies message according to route metric, optionally updates routing table.
The detail flowchart of step S109 is as shown in Figure 5.Node receives the handling process after RREP messages.If this node
It is source node, after this section point receives RREP messages, calculates route metric powerETXXY=βXY·ETXXY, preserve and be routed to just
In to route table items, packet is sent to destination node according to route.If this node receives RREP messages for the first time, will
This route is saved in routing table；If the node is not to receive RREP for the first time, when the route metric of the RREP messages
Better than the route metric of the RREP messages for receiving before, then RREP reports in this routing update to routing table, will be otherwise abandoned
Text.If this node is not source node, the R phases in reverse route by the route R in RREP messages with preservation in this node
Subtract, as the R of this node to destination node forward route；It is anti-by what is preserved in the route β ETX in RREP messages and this node
Subtract each other to the β ETX in route, as the R of this node to destination node forward route.This section point is according to reverse path to next
Hop node forwards RREP messages.
Alternatively, each safeguards route comprising the node periodic broadcasting hello packet (i.e. handshake message) routeing, once
It was found that some link disconnect, node just send ERROR message notifyings those because link disconnect and inaccessible knot removal phase
The record answered is repaired to already present route.
The embodiment of the present invention is characterized by：On the one hand, by the continuous value of cofactor, cofactor is specifically definedIn Initial Channel Assignment, link XY is using verifying whether β value is determined a need for more than threshold value
Channel is distributed for it to determine the connectedness of network, the change of quick obtaining network physical topological structure；On the other hand, in barrier
Hinder under thing attenuation model (obstacle attenuation model), the cofactor β using successive value optimizes route metric
powerETXXY=βXY·ETXXYTo set up route；The cofactor β of successive value is also used for optimizing link channel distribution simultaneously
SequentiallyReduce the expense of combined channel distribution and route metric method for designing.
From above-described embodiment as can be seen that joint route provided in an embodiment of the present invention measurement and the channel distribution that partly overlaps
Method, by the way that channel, source node send route requests message to its multicast, receiving route please for source node and destination node are distributed
Ask the node of message that route replies message is optionally replied according to route metric, the node of route replies message is received according to road
The technological means of routing table is updated by metric sebection, in the case where connectedness is ensured, route metric is improved, improve
The flexibility of overall network and dynamic, improve handling capacity, reduce routing cost.
The embodiment of the present invention also proposed one kind and can carry out data recommendation for different user or different types of user
Joint route measurement and second embodiment of method for channel allocation of partly overlapping.
The joint route measurement and the method for channel allocation that partly overlaps, optionally, are applied to server, including：
Assuming that have 9 nodes (3*3 distributed in grid) in a region of 1000m*1000m, wherein pacifying on 1 node
4 radio frequency interfaces are filled, other nodes are all 3 radio frequency interfaces, have 12 channels that partly overlap and be available for distribution.Channel width
2Mbps is set to, data packet length is 512byte, and transmission rate is 200kbps.Cochannel interference range is set to 550m, hair
It is 250m to penetrate scope.Model link AD is under the blocking of barrier, and signal attenuation is serious, and two route handling up for C-D-A
Amount may be smaller than double bounce route C-B-A.
Step S101, determines the position of source node and destination node in channel.
Node S has communication requirement to node D, and node S initiates pathfinding process.
Step S103, is that source node distributes channel with destination node.
Degree values are calculated according to physical topological structure：
degreeC＞ degreeD=degreeH=degreeF=degreeB＞ degreeJ=degreeG=degreeA=
degreeE
Node C has four radio frequency interfaces, respectively with neighbor node B, D, F, H binding；Node B has three radio frequency interfaces, point
Do not bound with neighbor node A, C, E；Node D has three radio frequency interfaces, respectively with neighbor node A, C, J binding；Node H has three
Radio frequency interface, respectively with neighbor node G, C, J binding；Node H has three radio frequency interfaces, respectively with neighbor node G, C, J binding；
Node F has three radio frequency interfaces, respectively with neighbor node E, C, G binding.
Using channel allocation order measure formulas (2.2), determined link distributes channel in the link set of unassigned channel
Sequentially：
Rank(lHG)=Rank (lFG) ＞ Rank (lHC)=Rank (lFC)
＞ Rank (lHJ)=Rank (lFE) ＞ Rank (lCD)=Rank (lCB)
＞ Rank (lJD)=Rank (lEB) ＞ Rank (lBA)=Rank (lDA)
Using formula (2.3) for link l select optimum channel c when, the link of link l and other the allocated channels it
Between interference and, selection interference and IntertotC the corresponding channel c of () minimum value distributes to respective links l.
Step S105, source node sends route requests message to its multicast, until reaching destination node.
Node G sends RREQ messages with the channel for distributing to neighbor node H, F, does not have purpose in node H, F routing table
Node is then continued to forward RREQ messages with the channel for distributing to neighbor node C, E, J.
Step S107, receives the node of route requests message according to route metric, optionally replys route replies message.
1) after node H receives the RREQ messages from node G, upper hop is obtained from the single-hop information field of RREQ messages
Node to this node β, ETX information, because node H is not destination node, and without to destination node in the routing table of node H
Route, node H need to neighbor node C, J forward RREQ messages, the reverse route of node C → H, J → H is set up automatically；
2) after node C receives the RREQ messages from node H, upper hop is obtained from the single-hop information field of RREQ messages
Node to this node β, ETX information, because node C is not destination node, and without to destination node in the routing table of node C
Route, node C need to neighbor node D forward RREQ messages, the reverse route of node D → C is set up automatically；
3) after node A receives the RREQ messages from node B, node B is obtained from the single-hop information field of RREQ messages
To the β of this node, ETX information, node A is destination node, calculates the route metric powerETX in whole piece pathXY=βXY·
ETXXY, and RREP messages are replied to source node with reverse route.
Step S109, receives the node of route replies message according to route metric, optionally updates routing table.
Node C receives the RREP messages from node D, and decision node C is not source node, and RREP messages are forwarded to node H,
Similarly, node H forwards RREP messages to node G, and decision node G is source node, calculates the route metric of mulitpath
powerETXGACompare size, small route metric powerETX will be worthGAAnd its route is stored in routing table, abandon
powerETXGAThe big RREP messages of value, and the path selected according to above-mentioned steps, set up route.
Optionally, step S111, safeguards route.
Agreement can safeguard route by periodic broadcasting HELLO messages, once finding that some link disconnects, node is just
Send ERROR message notifyings those because link disconnects inaccessible knot removal record or to already present route accordingly
Repaired.
The embodiment of the present invention redefined the cofactor β of successive value, using verifying whether β value judges more than threshold value
Whether need to distribute channel for it to determine the connectedness of network, the change of quick obtaining network physical topological structure, reduction is opened
Pin；Meanwhile, the embodiment of the present invention has combined partly overlap channel distribution and route metric design, using the cofactor β for introducing
Optimize route metric and under barrier attenuation model link channel distribution order, beneficial to calculating and comparing, to a certain degree
The upper routing cost for reducing joint route measurement and channel distribution.
Based on above-mentioned purpose, second aspect of the embodiment of the present invention, it is proposed that one kind performs the joint route measurement
With one embodiment of the device of the method for channel allocation that partly overlaps.As shown in fig. 6, being the execution joint for providing of the invention
The hardware architecture diagram of route metric and one embodiment of the device of the method for channel allocation that partly overlaps.
As shown in fig. 6, described device includes：
One or more processors 901 and memory 902, in Fig. 6 by taking a processor 901 as an example.
The execution joint route measurement can also include with the device of the method for channel allocation that partly overlaps：Input dress
Put 903 and output device 904.
Processor 901, memory 902, input unit 903 and output device 904 can be by bus or other modes
Connection, in Fig. 6 as a example by being connected by bus.
Memory 902 can be used to store non-volatile software journey as a kind of non-volatile computer readable storage medium storing program for executing
Sequence, non-volatile computer executable program and module, joint route measurement and part such as in the embodiment of the present application
Corresponding programmed instruction/the module of overlapped channels distribution method.Processor 901 is non-easy in memory 1002 by running storage
The property lost software program, instruction and module, so that the various function application of execute server and data processing, that is, realize above-mentioned
Joint route measurement and the method for channel allocation that partly overlaps of embodiment of the method.
Memory 902 can include storing program area and storage data field, wherein, storing program area can store operation system
Application program required for system, at least one function；Storage data field can be stored and created according to using for data recommendation device
Data etc..Additionally, memory 902 can include high-speed random access memory, nonvolatile memory, example can also be included
Such as at least one disk memory, flush memory device or other non-volatile solid state memory parts.In certain embodiments, deposit
Reservoir 902 is optional including the memory remotely located relative to processor 901, and these remote memories can be by network connection
To member user's behavior monitoring device.The example of above-mentioned network includes but is not limited to internet, intranet, LAN, shifting
Dynamic communication network and combinations thereof.
Input unit 903 can receive the numeral or character information of input, and generation sets with the user of data recommendation device
Put and the input of key signals that function control is relevant.Output device 904 may include the display devices such as display screen.
One or more of modules are stored in the memory 902, when by one or more of processors
During 901 execution, the measurement of the joint route in above-mentioned any means embodiment and the method for channel allocation that partly overlaps are performed.It is described to hold
The embodiment of the device of the row joint route measurement and the method for channel allocation that partly overlaps, its technique effect and foregoing any side
Method embodiment is same or similar.
The embodiment of the present application provides a kind of non-transient computer storage medium, and the computer-readable storage medium is stored with meter
Calculation machine executable instruction, the computer executable instructions can perform the treatment of the list items operation in above-mentioned any means embodiment
Method.The embodiment of the non-transient computer storage medium, its technique effect it is identical with foregoing any means embodiment or
It is similar.
It is last it should be noted that one of ordinary skill in the art will appreciate that whole in realizing above-described embodiment method
Or part flow, computer program being can be by instruct related hardware to complete, described program can be stored in a calculating
In machine read/write memory medium, the program is upon execution, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, it is described
Storage medium can be magnetic disc, CD, read-only memory (Read-Only Memory, ROM) or random access memory
(Random Access Memory, RAM) etc..The embodiment of the computer program, its technique effect and foregoing any means
Embodiment is same or similar.
Additionally, typically, device, equipment described in the disclosure etc. can be various electric terminal equipments, such as mobile phone, individual
Digital assistants (PDA), panel computer (PAD), intelligent television etc., or large-scale terminal device, such as server, therefore this
Disclosed protection domain should not limit as certain certain types of device, equipment.Client described in the disclosure can be with electricity
The combining form of sub- hardware, computer software or both is applied in above-mentioned any one electric terminal equipment.
Additionally, the computer program for being also implemented as being performed by CPU according to disclosed method, the computer program
Can store in a computer-readable storage medium.When the computer program is performed by CPU, limit in disclosed method is performed
Fixed above-mentioned functions.
Additionally, above method step and system unit can also utilize controller and cause controller reality for storing
The computer-readable recording medium of the computer program of existing above-mentioned steps or Elementary Function is realized.
In addition, it should be appreciated that computer-readable recording medium (for example, memory) as herein described can be volatile
Property memory or nonvolatile memory, or both volatile memory and nonvolatile memory can be included.As example
Son and it is nonrestrictive, nonvolatile memory can include read-only storage (ROM), programming ROM (PROM), electrically programmable
ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory.Volatile memory can include arbitrary access
Memory (RAM), the RAM can serve as external cache.Nonrestrictive as an example, RAM can be with more
The form of kind is obtained, such as synchronous random access memory (DRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate SDRAM
(DDR SDRAM), enhancing SDRAM (ESDRAM), synchronization link DRAM (SLDRAM) and direct RambusRAM (DRRAM).Institute
The storage device of disclosed aspect is intended to the memory of including but not limited to these and other suitable type.
Those skilled in the art will also understand is that, the various illustrative logical blocks with reference to described by disclosure herein, mould
Block, circuit and algorithm steps may be implemented as the combination of electronic hardware, computer software or both.It is hard in order to clearly demonstrate
This interchangeability of part and software, the function with regard to various exemplary components, square, module, circuit and step it is entered
General description is gone.This function is implemented as software and is also implemented as hardware depending on concrete application and applying
To the design constraint of whole system.Those skilled in the art can in a variety of ways realize described for every kind of concrete application
Function, but this realize that decision should not be interpreted as causing a departure from the scope of the present disclosure.
Various illustrative logical blocks, module and circuit with reference to described by disclosure herein can be utilized and are designed to
The following part of function described here is performed to realize or perform：General processor, digital signal processor (DSP), special collection
Into circuit (ASIC), field programmable gate array (FPGA) or other PLDs, discrete gate or transistor logic, divide
Any combinations of vertical nextport hardware component NextPort or these parts.General processor can be microprocessor, but alternatively, treatment
Device can be any conventional processors, controller, microcontroller or state machine.Processor can also be implemented as computing device
Combination, for example, the combination of DSP and microprocessor, multi-microprocessor, one or more microprocessors combination DSP core or any
Other this configurations.
The step of method or algorithm with reference to described by disclosure herein can be directly contained in hardware in, held by processor
In capable software module or in combination of the two.Software module may reside within RAM memory, flash memory, ROM storages
Device, eprom memory, eeprom memory, register, hard disk, removable disk, CD-ROM or known in the art it is any its
In the storage medium of its form.Exemplary storage medium is coupled to processor so that processor can be from the storage medium
Middle reading information writes information to the storage medium.In an alternative, the storage medium can be with processor collection
Into together.Processor and storage medium may reside within ASIC.ASIC may reside within user terminal.In a replacement
In scheme, processor and storage medium can be resident in the user terminal as discrete assembly.
In one or more exemplary designs, the function can be real in hardware, software, firmware or its any combination
It is existing.If realized in software, can be stored the function as one or more instructions or code in computer-readable
Transmitted on medium or by computer-readable medium.Computer-readable medium includes computer-readable storage medium and communication media,
The communication media includes any medium for helping that computer program is sent to another position from position.Storage medium
It can be any usable medium that can be accessed by a general purpose or special purpose computer.It is nonrestrictive as an example, the computer
Computer-readable recording medium can include RAM, ROM, EEPROM, CD-ROM or other optical disc memory apparatus, disk storage equipment or other magnetic
Property storage device, or can be used for carrying or storage form program code and can for needed for instruction or data structure
Any other medium accessed by universal or special computer or universal or special processor.Additionally, any connection can
It is properly termed as computer-readable medium.If for example, using coaxial cable, optical fiber cable, twisted-pair feeder, digital subscriber line
(DSL) or such as infrared ray, radio and microwave wireless technology come from website, server or other remote sources send software,
Then the wireless technology of above-mentioned coaxial cable, optical fiber cable, twisted-pair feeder, DSL or such as infrared elder generations, radio and microwave is included in
The definition of medium.As used herein, disk and CD include compact disk (CD), laser disk, CD, digital versatile disc
(DVD) the usual magnetically reproduce data of, floppy disk, Blu-ray disc, wherein disk, and CD is using laser optics ground reproduce data.On
The combination for stating content should also be as being included in the range of computer-readable medium.
Disclosed exemplary embodiment, but disclosed exemplary embodiment should be noted, it should be noted that without departing substantially from
On the premise of the scope of the present disclosure that claim is limited, may be many modifications and change.According to disclosure described herein
The function of the claim to a method of embodiment, step and/or action are not required to be performed with any particular order.Although additionally, this public affairs
The element opened can be described or required in individual form, it is also contemplated that it is multiple, it is unless explicitly limited odd number.
It should be appreciated that it is used in the present context, unless context clearly supports exception, singulative "
It is individual " (" a ", " an ", " the ") be intended to also include plural form.It is to be further understood that "and/or" used herein is
Finger includes any of or more than one project listed in association and is possible to combine.
Above-mentioned embodiment of the present disclosure sequence number is for illustration only, and the quality of embodiment is not represented.
One of ordinary skill in the art will appreciate that realizing that all or part of step of above-described embodiment can be by hardware
To complete, it is also possible to instruct the hardware of correlation to complete by program, described program can be stored in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only storage, disk or CD etc..
Those of ordinary skill in the art should be understood：The discussion of any of the above embodiment is exemplary only, not
It is intended to imply that the scope of the present disclosure (including claim) is limited to these examples；Under the thinking of the embodiment of the present invention, the above
Can also be combined between technical characteristic in embodiment or different embodiments, and there is the present invention as described above and implemented
Many other changes of the different aspect of example, for simplicity, they are provided not in details.Therefore, it is all in the embodiment of the present invention
Spirit and principle within, any omission, modification, equivalent, improvement for being made etc. should be included in the embodiment of the present invention
Within protection domain.
Claims (10)
1. a kind of joint route is measured and the method for channel allocation that partly overlaps, it is characterised in that including：
Determine the position of source node and destination node in channel；
It is that source node and destination node distribute channel；
Source node sends route requests message to its multicast, until reaching destination node；
The node of route requests message is received according to route metric, route replies message is optionally replied；
The node of route replies message is received according to route metric, routing table is optionally updated.
2. method according to claim 1, it is characterised in that be that source node and destination node distribution channel include：
Topological structure according to physical link calculates the relative importance value of each node, and according to relative importance value from high to low by each node
Bound with its neighbor node interface；
Determine the signal intensity of each receiving terminal and the cofactor of continuous value on each link, and taking according to each cofactor
Value determines whether that respective links distribute channel.
3. method according to claim 2, it is characterised in that the cofactor of continuous value is on described each link：
It is the ratio between actual receiving power of signal threshold level and the receiving node of receiving node in synergetic structure；In miscoordination knot
It is 1 in structure；The value according to each cofactor determines whether that respective links distribution channel is：Only it is less than more than zero
The corresponding link distribution channel of cofactor equal to one.
4. method according to claim 2, it is characterised in that the value according to each cofactor determines whether correspondence chain
After road distribution channel, each link distribution priority is determined, and according to distribution priority from high to low, to have distributed the chain of channel
Road is that link distributes channel to the minimum target of its interference value, wherein, distribution priority is the neighbor node of the both link ends point
The ratio between number, with the product of the minimum hop count apart from gateway and corresponding cofactor.
5. method according to claim 1, it is characterised in that the route requests message includes source node and destination node
Network layer address information；The source node sends route requests message to its multicast, is until reaching destination node：Save in source
Point sends route requests message to neighbor node multicast, and neighbor node is constantly forwarded until finding destination node；Meanwhile, set up base
In the reverse route table of repeating process, and the link value of a certain node of source node to routing link is stored in the reverse of the link
In routing table.
6. method according to claim 5, it is characterised in that receive the node of route requests message according to route metric,
Optionally replying route replies message includes：
Receive the node of route requests message upper hop node is determined to the destination address of this node according to route requests message and
Route metric, wherein, route metric is the cofactor and the product for expecting emitting times of respective links；
When this node is purpose node, while calculating the route metric of mulitpath, route metric is passed through using reverse route
Minimum path sends route replies message to source node, and by the link value of a certain node in destination node to routing link
It is stored in forward route table；If this node is not to receive route requests message and its route metric for the first time less than having replied route
The route metric of request message, then reply route replies message, otherwise abandons the route requests message.
7. method according to claim 5, it is characterised in that receive the node of route requests message according to route metric,
Optionally replying route replies message also includes；
When there is the route to destination node in the non-destination node of this node but routing table, this node in routing table is arrived into purpose section
The route of point is added with source node in route requests message to the route of this node, obtains source node and is route to destination node, and
Route replies message is replied according to reverse route；
When in the non-destination node of this node and routing table not to the route of destination node, the route requests message is forwarded, when
Route requests message from source node be forwarded to different nodes when, the node for being passed through sets up the reverse route of source node；If
This node receives route replies message for the first time or the single-hop route metric of the route requests message is less than the route for receiving in the past
Request message single-hop is measured, then update reverse route and forward road simultaneously in being written to route requests message to each neighbor node
By request message, the route requests message is otherwise abandoned.
8. method according to claim 7, it is characterised in that receive the node of route replies message according to route metric,
Optionally updating routing table includes：
When this node is source node, calculates route metric and be saved in forward route list item, and according to route to destination node
Send packet.If this node receives route replies message for the first time, this route is saved in routing table；If this
Node be not receive for the first time route replies message and the route replies message route metric be less than the route for receiving before should
The route metric of message is answered, then in this routing update to routing table, will otherwise abandon the route replies message；
When this node non-source node, using in route replies message route with this node in preserve reverse route subtract each other as
This node arrives destination node forward route, and this section point is forwarded route replies message according to reverse path down hop node.
9. method according to claim 1, it is characterised in that receive the node of route replies message according to route metric,
Optionally also include after renewal routing table：Each safeguards route comprising the node periodic broadcasting handshake message routeing, its
In, when handshake message finds that link is opened a way, send error message and notify that inaccessible knot removal is corresponding because link disconnects
Record is repaired.
10. a kind of electronic equipment, including at least one processor；And, with depositing that at least one processor communication is connected
Reservoir；Wherein, have can be by the instruction of one computing device for the memory storage, and the instruction is by described at least one
Computing device, so that at least one processor is able to carry out the method as described in claim 1-9 any one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611067766.7A CN106792980B (en) | 2016-11-25 | 2016-11-25 | Joint routing metric and partially overlapping channel allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611067766.7A CN106792980B (en) | 2016-11-25 | 2016-11-25 | Joint routing metric and partially overlapping channel allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106792980A true CN106792980A (en) | 2017-05-31 |
| CN106792980B CN106792980B (en) | 2020-08-18 |
Family
ID=58902403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611067766.7A Active CN106792980B (en) | 2016-11-25 | 2016-11-25 | Joint routing metric and partially overlapping channel allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106792980B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107659502A (en) * | 2017-11-01 | 2018-02-02 | 上海海洋大学 | A kind of on-demand routing protocol algorithm based on energy efficiency and link reliability |
| CN112822748A (en) * | 2019-11-18 | 2021-05-18 | ***通信有限公司研究院 | Routing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2201725A2 (en) * | 2007-10-01 | 2010-06-30 | Powerwave Cognition, Inc. | Mobile ad hoc networking systems and methods |
| 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 |
| CN106162787A (en) * | 2016-08-31 | 2016-11-23 | 北京邮电大学 | A kind of method for routing foundation and device |
-
2016
- 2016-11-25 CN CN201611067766.7A patent/CN106792980B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2201725A2 (en) * | 2007-10-01 | 2010-06-30 | Powerwave Cognition, Inc. | Mobile ad hoc networking systems and methods |
| 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 |
| CN106162787A (en) * | 2016-08-31 | 2016-11-23 | 北京邮电大学 | A kind of method for routing foundation and device |
Non-Patent Citations (2)
| Title |
|---|
| SARASVATHI V 等: "An Efficient Interference Aware Partially Overlapping Channel Assignment and Routing in Wireless Mesh Networks", 《INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND INFORMATION SECURITY (IJCNIS)》 * |
| 王继红 等: "无线Mesh网络部分重叠信道分配综述", 《通信学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107659502A (en) * | 2017-11-01 | 2018-02-02 | 上海海洋大学 | A kind of on-demand routing protocol algorithm based on energy efficiency and link reliability |
| CN112822748A (en) * | 2019-11-18 | 2021-05-18 | ***通信有限公司研究院 | Routing method and device |
| CN112822748B (en) * | 2019-11-18 | 2023-08-15 | ***通信有限公司研究院 | Routing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106792980B (en) | 2020-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Soua et al. | Wave: a distributed scheduling algorithm for convergecast in IEEE 802.15. 4e TSCH networks | |
| Xin et al. | A novel layered graph model for topology formation and routing in dynamic spectrum access networks | |
| Salim et al. | On-demand routing protocols for cognitive radio ad hoc networks | |
| JP6387746B2 (en) | Time slot allocation method and apparatus | |
| Lou et al. | AoI and throughput tradeoffs in routing-aware multi-hop wireless networks | |
| CN102387585B (en) | Communication method and communication nodes for wireless communication network | |
| Municio et al. | A distributed density optimized scheduling function for IEEE 802.15. 4e TSCH networks | |
| Al-rimy et al. | A user mobility-aware fair channel assignment scheme for wireless mesh network | |
| Havinal et al. | Mecor: Minimal energy consumption with optimized routing in manet | |
| Bao et al. | Design of logical topology with K‐connected constraints and channel assignment for multi‐radio wireless mesh networks | |
| Hashem et al. | A tree routing protocol for cognitive radio network | |
| CN101848523B (en) | Path selecting method in multi-channel wireless mesh network and device thereof | |
| CN106792980A (en) | A kind of joint route measurement and the method for channel allocation that partly overlaps | |
| Mohandespour et al. | Rate, energy, and delay tradeoffs in wireless multicast: network coding versus routing | |
| Shao et al. | Load balanced coding aware multipath routing for wireless mesh networks | |
| Habachi et al. | A Stackelberg model for opportunistic sensing in cognitive radio networks | |
| Bokhari et al. | i-POCA: Interference-aware partially overlapping channel assignment in 802.11-based meshes | |
| Zhao et al. | Optimal cooperative spectrum sensing with non-coherent inter-channel interference cancellation for cognitive wireless mesh networks | |
| Kok et al. | EAOMDV-MIMC: A multipath routing protocol for multi-interface multi-channel mobile ad-hoc networks | |
| Noorwali et al. | End-to-end delay analysis of wireless mesh backbone network in a smart grid | |
| Xu et al. | Joint channel assignment and routing protocol for cognitive radio wireless sensor networks | |
| Tabouche et al. | TLR: Traffic-aware load-balanced routing for industrial IoT | |
| Dzung et al. | Source routing in time-varing lossy networks | |
| Zhou | An efficient routing and interface assignment algorithm for multi-channel multi-interface (MCMI) ad hoc networks | |
| Tan et al. | Clonal-selection-based minimum-interference channel assignment algorithms for multiradio wireless mesh networks |
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 | ||
| CB02 | Change of applicant information |
Address after: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Applicant after: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant after: RESEARCH INSTITUTE OF ECONOMICS AND TECHNOLOGY, STATE GRID SHANDONG ELECTRIC POWER Co. Applicant after: STATE GRID CORPORATION OF CHINA Applicant after: Beijing University of Posts and Telecommunications Applicant after: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Address before: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Applicant before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant before: RESEARCH INSTITUTE OF ECONOMICS AND TECHNOLOGY, STATE GRID SHANDONG ELECTRIC POWER Co. Applicant before: State Grid Corporation of China Applicant before: Beijing University of Posts and Telecommunications Applicant before: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190718 Address after: 100085 Beijing city Haidian District Qinghe small Camp Road No. 15 Applicant after: BEIJING CHINA POWER INFORMATION TECHNOLOGY Co.,Ltd. Applicant after: RESEARCH INSTITUTE OF ECONOMICS AND TECHNOLOGY, STATE GRID SHANDONG ELECTRIC POWER Co. Applicant after: STATE GRID CORPORATION OF CHINA Applicant after: Beijing University of Posts and Telecommunications Applicant after: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Address before: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Applicant before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant before: RESEARCH INSTITUTE OF ECONOMICS AND TECHNOLOGY, STATE GRID SHANDONG ELECTRIC POWER Co. Applicant before: STATE GRID CORPORATION OF CHINA Applicant before: Beijing University of Posts and Telecommunications Applicant before: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |