CN107786449A - Routing resource, device, server and storage medium based on FSR agreements - Google Patents
Routing resource, device, server and storage medium based on FSR agreements Download PDFInfo
- Publication number
- CN107786449A CN107786449A CN201711084162.8A CN201711084162A CN107786449A CN 107786449 A CN107786449 A CN 107786449A CN 201711084162 A CN201711084162 A CN 201711084162A CN 107786449 A CN107786449 A CN 107786449A
- Authority
- CN
- China
- Prior art keywords
- index
- hoc network
- metric
- node
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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/302—Route determination based on requested QoS
-
- 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/02—Topology update or discovery
- H04L45/025—Updating only a limited number of routers, e.g. fish-eye update
Abstract
The invention discloses a kind of routing resource based on FSR agreements, device, server and storage medium, this method includes：The objective weight of each index is determined according to sample data corresponding to each index in the ad-hoc network obtained in advance；According to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance, calculate the metric between each adjacent node in the ad-hoc network, wherein, the real-time communication quality data are the data corresponding with each index collected in real time between each adjacent node of the ad-hoc network；According to start node in the metric calculating ad-hoc network between each adjacent node to the metric in all paths between destination node；Using the minimum path of the metric in path as the start node to the optimal path between the destination node.The present invention realizes by considering each index of ad-hoc network and accurately determining the objective weight of each index and selects the optimal path that communication quality is optimal in ad-hoc network exactly.
Description
Technical field
The present invention relates to technical field of the computer network, more particularly to a kind of routing resource based on FSR agreements, dress
Put, server and storage medium.
Background technology
The network that ad-hoc network is a kind of mobile communication and computer network is combined, each node is simultaneous in ad-hoc network
There is the function of router, as an optimal transmission paths are found by the packet of router, by the data as short as possible
Time in it is quick, be accurately and efficiently sent to destination node.
In FSR (Fisheye State Routing Protocol, flake state route) agreement, generally use
Dijkstra (Di Jiesitela) algorithms calculate the shortest path in ad-hoc network.Dijkstra's algorithm is using start node in
The heart, outwards extended layer by layer according to the topological structure of network, it is all untill expanding to destination node, and to what is passed through therebetween
Path is measured and compared, so as to select shortest path therein.Traditional dijkstra's algorithm can be according to the need of user
Will, assign the weight specified to the evaluation index specified in network, and according to data of each index in path and given each
The metric in the weight calculation path of index, so as to select the minimum path of the metric in path as shortest path.
However, measurement foundation of traditional dijkstra's algorithm only using specified index as path, and the power of each index
It is to be formulated according to the needs of user again, it is subjective.Therefore, because QoS (Quality of are not taken into full account
Service, service quality) in influence caused by other index parameters, and do not brought according to each index for network transmission
Different significance levels influence and be that each index assigns objective weight, cause the calculating of path metric value not accurate enough, most
The selection of shortest path is not accurate enough.
The content of the invention
The embodiments of the invention provide a kind of routing resource based on FSR agreements, device, server and storage to be situated between
Matter, it can realize and select the optimal path that communication quality is optimal in ad-hoc network exactly.
In a first aspect, the embodiments of the invention provide a kind of routing resource based on FSR agreements, applied to fish-eye shaped
In state Routing Protocol FSR, methods described includes：
The objective weight of each index is determined according to sample data corresponding to each index in the ad-hoc network obtained in advance；
According to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance, calculate
Metric in the ad-hoc network between each adjacent node, wherein, the real-time communication quality data are in the ad-hoc network
Each adjacent node between the data corresponding with each index that collect in real time；
According to the metric between each adjacent node, start node is calculated in the ad-hoc network to all roads between destination node
The metric in footpath；
Using optimal path of the minimum path of the metric in path as the start node to the destination node.
Second aspect, the embodiments of the invention provide a kind of path selection device based on FSR agreements, applied to fish-eye shaped
In state Routing Protocol FSR, described device includes：
Weight determination module, for determining each finger according to sample data corresponding to each index in the ad-hoc network obtained in advance
Target objective weight；
Metric acquisition module between node, for the objective weight according to each index and the MANET obtained in advance
The real-time communication quality data of network, the metric between each adjacent node in the ad-hoc network is calculated, wherein, the real-time Communication for Power
Qualitative data is the data corresponding with each index collected in real time between each adjacent node of the ad-hoc network；
Path metric value acquisition module, originated for being calculated according to the metric between each adjacent node in the ad-hoc network
Metric of the node to all paths between destination node；
Optimal path acquisition module, for using the minimum path of the metric in path as the start node to the mesh
Node between optimal path.
The third aspect, the embodiments of the invention provide a kind of server, including：
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are by one or more of computing devices so that one or more of processing
Device realize described in any embodiment of the present invention based on FSR protocol path systems of selection.
Fourth aspect, the embodiments of the invention provide a kind of computer-readable recording medium, is stored thereon with computer journey
Sequence, the program realize the routing resource based on FSR agreements described in any embodiment of the present invention when being executed by processor.
The present invention is carried out by the objective weight of each index in the service quality to the ad-hoc network based on FSR Routing Protocols
It is determined that and according to identified index objective weight, calculate in ad-hoc network start node to all paths between destination node
Metric, so as to select optimal road of the minimum path of the metric in path as the start node to the destination node
Footpath.Solve in the prior art to not comprehensive and index the weight assignment of consideration of each index in the service quality of ad-hoc network
The problem of not objective enough, realize and select the optimal path that communication quality is optimal in ad-hoc network exactly.
Brief description of the drawings
Fig. 1 is a kind of flow chart for routing resource based on FSR agreements that the embodiment of the present invention one provides；
Fig. 2 is a kind of flow chart for routing resource based on FSR agreements that the embodiment of the present invention two provides；
Fig. 3 is the topological structure exemplary plot for the network that the embodiment of the present invention two provides；
Fig. 4 is a kind of structural representation for path selection device based on FSR agreements that the embodiment of the present invention three provides；
Fig. 5 is a kind of structural representation for server that the embodiment of the present invention four provides.
Embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining the present invention, rather than limitation of the invention.It also should be noted that in order to just
Part related to the present invention rather than entire infrastructure are illustrate only in description, accompanying drawing.
Embodiment one
A kind of flow chart for routing resource based on FSR agreements that Fig. 1 provides for the embodiment of the present invention one, this implementation
Example is applicable to the situation of optimal route selection in the hoc network based on FSR agreements, and this method can be by a kind of based on FSR agreements
Path selection device performs.This method specifically comprises the following steps：
Sample data corresponding to each index determines the objective of each index in the ad-hoc network that step 110, basis obtain in advance
Weight.
FSR agreements are a kind of link-state protocols of proactive, and it imitates the function of flake, passes through the section to different distance
Point uses different routing update frequencies so that the nearer node of distance, the routing iinformation of grasp are more accurate.
Index in network service quality includes but is not limited to：Bandwidth, communication delay, delay variation, packet loss or jump
Number.Generally, it is considered that the difference of all sample datas is bigger under same index, then its information content for containing is bigger.Therefore, it is determined that
, it is necessary to which the difference of all sample datas under same index is also examined during the objective weight of each index in the service quality of ad-hoc network
Including worry, typically with the difference of data is described to specific strength, represented to specific strength by calculating the standard deviation of all data.
Further, since each index of weighting network service quality is not completely self-contained, exist each other between each index
Correlation and conflicting, therefore needed when each index weights calculate in view of the correlation and conflicting between each index.Example
Such as, this four indexs of bandwidth, communication delay, packet loss and delay variation are not completely self-contained, therefore are weighed in four indexs
Need to consider the correlation between four indexs during the calculating of weight；And in this four indexs, delay variation and packet loss be with
Calculated based on communication delay, it is therefore desirable to consider that delay variation is related to packet loss relative communication time delay index
Property.The correlation between each index is described using coefficient correlation herein, the conflicting between each index is described with conflicting parameter.
On the basis of coefficient correlation between calculating each index, you can obtained by calculating the poor absolute value of coefficient correlation and 1 each
Conflicting parameter between individual index.For example, after the relative coefficient of delay variation and communication delay is calculated, can pass through
The coefficient correlation of delay variation and communication delay is made the difference and taken absolute value with 1, you can obtains delay variation and communication delay two
Conflicting parameter between individual index.
The present embodiment uses determines method (CRITIC algorithms) based on index related index weights, big by obtaining in advance
Sample data corresponding to each index of amount, carry out the objective weight of each index in calculating network service quality.It is wherein same by calculating
The standard deviation of all sample datas under one index, and coefficient correlation and conflicting parameter between each index, consider net
In network service quality in same index between the relation of data and each index the relation pair network of data influence, so as to be advantageous to
Accurate determination to optimal path.
Step 120, according to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance,
The metric between each adjacent node in ad-hoc network is calculated, wherein, the real-time communication quality data are in the ad-hoc network
Each adjacent node between the data corresponding with each index that collect in real time.
Network topology represents the connectedness of the shape or network of network physically.Network topology structure is provided in network
The network configuration of the equipment such as server, work station and terminal and its mutual annexation.Therefore, according to the topology of network
Annexation in structure between each node, it may pass through between being found out in ad-hoc network from start node to destination node
All paths.And the metric in each path is the summation of the metric between the adjacent node passed through in this path, therefore count
The premise for calculating start node to the metric in all paths that may pass through between destination node is to calculate phase in the ad-hoc network
Metric between neighbors.
Metric between adjacent node is the objective power of the real-time communication quality data and each index by the ad-hoc network
Weight is determined.Wherein, real-time communication quality data are being collected in real time between each adjacent node of ad-hoc network with each index
Corresponding data, the communication quality between each adjacent node in ad-hoc network is reflected in real time.Therefore in practical application, passing through
After the objective weight for calculating each singal reporting code of ad-hoc network, according to the reality of reality the great amount of samples data science that early stage obtains
When communication quality data, can utilize the mode of weighted sum can calculate metric between each adjacent node.
Step 130, according to the metric between each adjacent node, calculate in ad-hoc network start node to institute between destination node
There is the metric in path.
Start node to the metric in path between destination node be the metric between the adjacent node that is passed through in this path
Summation.
Step 140, using the minimum path of the metric in path as start node to the optimal path between destination node.
The metric in path be by after the comprehensive analysis to above-mentioned each index, having carried out objective evaluation to each index, it is comprehensive
Close the good and bad degree for being demonstrated by this paths communication quality.The metric in path is smaller, represents that this paths is carrying out data biography
When defeated, each index has all balancedly reached optimum state so that loss during data transfer is smaller, and transmission speed is very fast.Therefore
In order to ensure the transmission quality of data, it is necessary to find the metric in path most into all paths between destination node in start node
Optimal path of the small path as the start node to the destination node, the transmission matter of data in network is improved with this
Amount.
The technical scheme of the present embodiment, pass through each index in the service quality to the ad-hoc network based on FSR Routing Protocols
Objective weight be determined, and according to identified index objective weight, calculate in ad-hoc network start node to purpose section
The metric in all paths between point, so as to select the minimum path of the metric in path as the start node to the purpose
The optimal path of node.Solve when selecting optimal path in the ad-hoc network based on FSR agreements in the prior art, to from group
The problem of not comprehensive and index the weight assignment of consideration of each index is not objective enough in the service quality of network, it is accurate to realize
The optimal optimal path of communication quality in ground selection ad-hoc network.
Embodiment two
The present embodiment is on the basis of above-described embodiment one, there is provided a kind of routing resource based on FSR agreements
One preferred embodiment, it can accurately determine the objective weight of each index in the service quality of ad-hoc network.Fig. 2 is this hair
A kind of flow chart for routing resource based on FSR agreements that bright embodiment two provides, as shown in Fig. 2 this method include with
Lower specific steps：
Step 210, obtain sample data corresponding to each index in ad-hoc network；Wherein, index includes but is not limited to：Band
Width, communication delay, delay variation, packet loss or hop count.
According to experimental data, the sample data of each index in the service quality of the ad-hoc network, sample data volume are obtained
Bigger, then the objective weight of each index obtained by sample data is more accurate.Exemplary, table 1 is the network of certain ad-hoc network
The sample data of each index in service quality, including 10 groups of sample datas, when every group of sample data is by bandwidth, communication
Prolong, four index parameters of delay variation and packet loss are formed.
The sample data of each index in the network service quality of certain ad-hoc network of table 1
Step 220, after sample data corresponding to each index in obtaining ad-hoc network, including：To corresponding to each index
Sample data carries out nondimensionalization processing.
Because the unit of each index in service quality is different, dimension is different and the order of magnitude is different, it is not easy to analyze, even
The result of evaluation can be influenceed.For example, four indexs in table 1, the unit of bandwidth is million (M), communication delay and time delay unit
It is millisecond (ms), the unit of packet loss is percentage (%), and by observing each group of data under each index, is found each
The order of magnitude of achievement data is also not quite similar.Therefore, it is unified standard, rower is entered to the sample data of all evaluation indexes
Quasi-ization processing, to eliminate dimension, converts it into dimensionless and the differential other standard figures of incalculability, is then integrated again
Analysis and evaluation.
The sample data for having dimension is carried out nondimensionalization processing by the present embodiment using extreme difference Standardization Act.Usual index number
The height of value directly reflects the quality of performance corresponding to each index, and the numerical value of some indexs is higher to represent its corresponding performance more
Well, such as bandwidth, bandwidth are wider, then the transmission speed of data is faster when communicating；And the numerical value of some indexs is lower that to represent its right
The performance answered is better, such as communication delay, and communication delay is lower, then data are sent to other end when institute from one end of a network
The time needed is shorter.Therefore according to the fine or not and relation of each index value taxis of each index corresponding performance, using difference
Calculation formula carry out nondimensionalization processing.The better index of its higher corresponding performance of numerical value for index, such as bandwidth,
Using the calculation formula of direct index, i.e.,Wherein, xijRepresent the jth under i-th of index in sample data
Individual data, MINiRepresent the minimum value of all data under i-th of index in sample data, MAXiRepresent i-th of finger in sample data
The maximum of all data, y under markijIndicate dimension data xijNumerical value after nondimensionalization is handled.For the numerical value of index
The better index of its lower corresponding performance, such as communication delay, delay variation and packet loss, it is public using the calculating of negative index
Formula, i.e.,Wherein, xijRepresent j-th of data under i-th of index, MIN in sample dataiRepresent sample
In notebook data under i-th of index all data minimum value, MAXiRepresent in sample data that all data are most under i-th of index
Big value, yijRepresent data xijValue after nondimensionalization is handled.
Exemplary, four indexs in table 1, the sample data of index bandwidth uses the calculation formula of direct index,
The sample data of index communication delay, delay variation and packet loss is using the calculation formula for bearing index.For example, the sample with table 1
First data instance in notebook data under first index,Sample in table 1
Data of the notebook data after nondimensionalization is handled are as shown in table 2.From Table 2, it can be seen that the sample data under each index
There is no dimension, and the order of magnitude is identical, all between zero and one, numerical value minimum 0, numerical value is up to 1 to numerical value.Handled through nondimensionalization
The sample data sought unity of standard afterwards, it is easy to follow-up comprehensive analysis and evaluation.
The dimensionless data of table 2
Step 230, the sample data according to corresponding to each index, calculate the contrast intensive parameter of each index.
The difference of all data under same index is described to specific strength, difference is bigger, represents the data institute under the index
The information content contained is bigger, therefore effect of the index played in overall merit is bigger, then in overall merit, it is owning
The weight occupied in index is also bigger；Otherwise the difference of all data is smaller under same index, and the data under the index are contained
Information content it is smaller, therefore effect of the index played in overall merit is smaller, then in overall merit its in all indexs
In the weight that occupies it is also smaller.
The present embodiment describes the difference of all data under same index using standard deviation i.e. to specific strength.Above-mentioned immeasurable
On the basis of guiding principle data, the calculation formula for contrasting intensive parameter isWherein, SiRepresent in sample data
The contrast intensive parameter of i-th of index, yijRepresent j-th of number under i-th of index in the sample data after nondimensionalization processing
According to yi' the average value of all data under i-th of index in sample data is represented, n represents the number of sample data under index.It is logical
Cross the above-mentioned contrast intensive parameter s tried to achieveiThe contrast intensive parameter matrix S=[s of all indexs under sample data can be obtained1
s2 s3 … sm], wherein m is the number of index.For example, on the basis of above-described embodiment, it is each in table 2 after formula calculates
The contrast intensive parameter of index is respectively：Bandwidth s1=0.2976, communication delay s2=0.3813, delay variation s3=0.3540,
Packet loss s4=0.3343.It is hereby achieved that the contrast intensive parameter matrix of lower four indexs of sample data in the example
For S=[0.2976 0.3813 0.3540 0.3343].
Step 240, the sample data according to corresponding to each index, calculate the coefficient correlation between any two index.
Coefficient correlation is to reflect the statistical indicator of dependency relation level of intimate between variable, and the present embodiment uses product moment
Method calculates the coefficient correlation between each index, equally with the sample data of two indices respectively at the deviation for each referring to target average value
Based on, the degree of correlation between two indices is reflected by the product of two indices deviation.Its calculation formula isWherein, rabRepresent the coefficient correlation between index a and index b, ajRepresent under index a
J-th of data, a' represents the average value of all data under index a, bjJ-th of data under index b are represented, b' represents index
The average value of all data under b, n represent the number of sample data under index.It can be obtained by the above-mentioned correlation coefficient r tried to achieve
Correlation matrix under sample data between all indexs
The value of coefficient correlation is between -1 and 1, i.e. -1≤rab≤1.Work as rab>When 0, index a and index b positives are represented
Close；Work as rab<When 0, represent that index a and index b is negatively correlated；When | rab| when=1, represent that index a is fairly linear related to index b；
Work as rabWhen=0, represent index a and index b without linear relationship.When 0<|rab|<When 1, represent to deposit between index a and index b
In a certain degree of linear relationship；And | rab| closer to 1, then linear relationship is closer between index a and index b；|rab| more connect
0 is bordering on, then linear relationship is weaker between index a and index b.
Exemplary, on the basis of above-described embodiment, it is assumed that index bandwidth is represented with a, when representing that index communicates with b
Prolong, index delay variation is represented with e, index packet loss is represented with f.Then after formula calculates, the middle finger marker tape of table 2 is wide to be led to index
The coefficient correlation for believing time delay is rab=0.8401, index bandwidth and the coefficient correlation of index delay variation are rae=0.7122, refer to
Marker tape is wide and the coefficient correlation of index packet loss is raf=0.7195, by that analogy, rbe=0.9003, rbf=0.8964, ref=
0.7530.Because index is in itself 1 with the coefficient correlation of itself, it is hereby achieved that lower four of the sample data in the example
The correlation matrix of index is a symmetrical matrix, is
Step 250, according to coefficient correlation, calculate the conflicting parameter between any two index.
The opposite of correlation is conflicting, therefore according to the coefficient correlation between the index of above-mentioned acquisition, you can obtain
Conflicting parameter between index.Its calculation formula is cab=1 (1-rab)=1-rab.By the above-mentioned coefficient correlation c tried to achieve,
The conflicting parameter matrix under sample data between all indexs can be obtained according to the calculation formula of conflicting parameter
Exemplary, on the basis of above-described embodiment, the conflicting of index bandwidth and index communication delay can be obtained
Parameter is cab=1-rab=0.1598, by that analogy, cae=0.2877, caf=0.2804, cbe=0.0996, cbf=
0.1035、cef=0.2469.Because index is in itself 0 with the conflicting parameter of itself, it is hereby achieved that in the example
The conflicting parameter matrix of lower four indexs of sample data is a symmetrical matrix, is
Step 260, the objective weight for calculating according to each contrast intensive parameter and each conflicting parameter each index.
By calculate all sample datas under same index to the conflicting parameter between specific strength, and each index,
Consider in network service quality the influence of the relation pair network of data between the relation of data and each index in same index,
The objective weight of each index in the service quality of ad-hoc network is accurately determined, so as to be advantageous to the accurate true of optimal path
It is fixed.According to the calculating of contrast intensive parameter matrix and conflicting parameter matrix, then the intermediate transition matrix of each index objective weight
Formula is D=CS', wherein, D is the intermediate transition matrix for trying to achieve each index objective weight, and the size of matrix is m × 1, wherein
M is the number of index, and C is conflicting parameter matrix, and S is contrast intensive parameter matrix, and S' is turning for contrast intensive parameter matrix S
Put matrix.Therefore, the calculation formula of each index objective weight isWherein, WiRepresent the objective power of i-th of index
Weight, DiFor i-th of value of intermediate transition matrix D, m is the number of index.Then pass through the above-mentioned each index objective weight W tried to achievei,
Obtain objective weight matrix W=[W of all indexs under sample data1 W2 W3 … Wm]。
Exemplary, on the basis of above-described embodiment, obtain the contrast intensive parameter of lower four indexs of sample data
Matrix is S=[0.2976 0.3813 0.3540 0.3343], and the conflicting parameter matrix of four indexs isTherefore intermediate transition is obtained by the calculation formula of intermediate transition matrix
Matrix is D=[0.2565 0.1174 0.2061 0.2103] ', therefore the objective weight of lower four indexs of sample data is respectively
Bandwidth weighting W1=0.3245, communication delay weight W2=0.1486, delay variation weight W3=0.2607 and packet loss weight
W4=0.2661, objective weight matrix is W=[0.3245 0.1486 0.2607 0.2661], with four indexs one in table 1
One correspondence.
Step 270, according to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance,
The metric between each adjacent node in ad-hoc network is calculated, wherein, the real-time communication quality data are in each of ad-hoc network
The data corresponding with each index collected in real time between adjacent node.
The metric in each path is the summation of the metric between the adjacent node passed through in this path, therefore calculates
The premise of beginning node to the metric in all paths that may pass through between destination node is to calculate in the ad-hoc network to be connected
Metric between logical adjacent node.Metric between adjacent node is each index in service quality by the ad-hoc network
Objective weight and the real-time communication quality data of the ad-hoc network are determined, wherein, real-time communication quality data be from
The data corresponding with each index collected in real time between each adjacent node of group network, reflect each phase in ad-hoc network in real time
Communication quality between neighbors.The calculation formula of metric between node is Mij=W1·xij1+W2·xij2+…+Wm·xijm, its
In, MijRepresent the metric between ad-hoc network interior joint i and node j adjacent thereto, WmRepresent the objective power of m-th of index
Weight, xijmRepresent the real-time communication quality of m-th of index between node i and node j adjacent thereto.
It is exemplary, on the basis of above-described embodiment, it is assumed that the topological structure of network as shown in figure 3, ad-hoc network just
The real-time communication quality data of each index are as shown in table 3 in network service quality when normal open is believed.Wherein, the topological structure of network
In, the 1st group of real-time communication quality data in the corresponding table 3 of each index in 2 network service qualitys of node 1 and node, node 2 with
2nd group of real-time communication quality data, net between node 1 and node 4 in table 3 corresponding to each index in 3 network service qualitys of node
3rd group of real-time communication quality data, network service quality between node 4 and node 3 in table 3 corresponding to each index in network service quality
In each index correspond to the 4th group of real-time communication quality data in table 3.Then the metric between node 1 and node 2 is M1=
14.6408, the metric between node 2 and node 3 is M2=12.5159, the metric between node 1 and node 4 is M3=
10.4596, the metric between node 4 and node 3 is M4=13.3404.
During 3 ad-hoc network proper communication of table in network service quality each index real-time communication quality data
Step 280, according to the metric between each adjacent node, calculate in ad-hoc network start node to institute between destination node
There is the metric in path.
Centered on start node, outwards extended layer by layer according to the topological structure of network, be until expanding to destination node
Only.The metric in all paths passed through therebetween is calculated, wherein the metric per paths is all companies that the path is passed through
Metric sum between logical adjacent node, its calculation formula areWherein, L represents the metric of certain paths, M
The metric between the adjacent node that is connected in the path is represented, h is represented in the path by the hop count of start node to destination node.
Exemplary, on the basis of above-described embodiment, find start node 1 in network topology structure Fig. 3 and arrive purpose section
The optimal path of point 3.Outwards extended layer by layer by start node 1, untill expanding to destination node 3, be possible to by
Path has two, i.e. path 1 is that node 1 arrives node 3 to node 2, and path 2 is that node 1 arrives node 3 to node 4.By can in Fig. 3
To find out, the hop count of two paths is 2.Then the metric in path 1 isSimilarly
Metric to path 2 is
Step 290, using the minimum path of the metric in path as start node to the optimal path between destination node.
It is exemplary, on the basis of above-described embodiment, according to the topological structure of network, search out by start node 1 to
All paths of destination node 3 include two, i.e. path 1 is that node 1 arrives node 3 to node 2, and its metric is L1=
27.1567；Path 2 is that node 1 arrives node 3 to node 4, and its metric is L2=23.8000.Because L1>L2, so starting section
The optimal path of point 1 to destination node 3 is path 2, i.e., node 1 arrives node 3 to node 4.
The technical scheme of the present embodiment, by being carried out to the sample data under each index in sample data at nondimensionalization
Reason, the conflicting calculated according to the sample data of nondimensionalization between the contrast intensive parameter and any two index of each index are joined
Number, the comprehensive relation pair net for comprehensively considering in network service quality data between the relation of data and each index in same index
The influence of network, the objective weight of each index in the service quality of ad-hoc network is accurately determined, so as to what is connected in calculating network
Metric between adjacent node and the metric by start node to all paths of destination node, accurately select start node
To the optimal path of destination node.Solve in the prior art in the ad-hoc network based on FSR agreements during selection optimal path,
The problem of not objective enough to not comprehensive and index the weight assignment of consideration of each index in the service quality of ad-hoc network, realize
The optimal path that communication quality is optimal in ad-hoc network is selected exactly.
Embodiment three
Fig. 4 is a kind of structural representation for path selection device based on FSR agreements that the embodiment of the present invention three provides, this
Embodiment is applicable to the situation of optimal route selection in the hoc network based on FSR agreements, and the device can be realized of the invention any
The routing resource based on FSR agreements described in embodiment.The device specifically includes：
Weight determination module 410, for being determined according to sample data corresponding to each index in the ad-hoc network obtained in advance
The objective weight of each index；
Metric acquisition module 420 between node, obtain for the objective weight according to each index and in advance described in from
The real-time communication quality data of group network, calculate the metric between each adjacent node in the ad-hoc network, wherein, it is described real-time
Communication quality data is the data corresponding with each index collected in real time between each adjacent node of the ad-hoc network；
Path metric value acquisition module 430, originated for being calculated according to the metric between each adjacent node in ad-hoc network
Metric of the node to all paths between destination node；
Optimal path acquisition module 440, for using the minimum path of the metric in path as the start node to institute
State the optimal path between destination node.
Further, the weight determination module 410, including：
Achievement data acquiring unit 4101, for obtaining sample data corresponding to each index in the ad-hoc network；Wherein,
The index includes but is not limited to：Bandwidth, communication delay, delay variation, packet loss or hop count；
Parameter acquiring unit 4102, for the sample data according to corresponding to each index, calculate joining to specific strength for each index
Conflicting parameter between index described in number and any two；
Weight determining unit 4103, for according to each visitor for contrasting intensive parameter and each conflicting parameter, calculating each index
See weight.
Further, the parameter acquiring unit 4102, including：
Contrast intensive parameter takes subelement, and for the sample data according to corresponding to each index, the contrast for calculating each index is strong
Spend parameter；
Coefficient correlation obtains subelement, for the sample data according to each index, calculates index described in any two
Between coefficient correlation；
Conflicting parameter acquiring subelement, for according to the coefficient correlation, calculating between index described in any two
Conflicting parameter.
Further, described device also includes：
Data preprocessing module 450, for it is described obtain in the ad-hoc network sample data corresponding to each index it
Afterwards, nondimensionalization processing is carried out to sample data corresponding to each index.
The technical scheme of the present embodiment, by the mutual cooperation between modules, realize to based on FSR Routing Protocols
The accurate determination of the objective weight of each index in the service quality of ad-hoc network, and according to identified index objective weight, meter
Start node in ad-hoc network is calculated to the metric in all paths between destination node, so as to select the minimum road of the metric in path
Optimal path of the footpath as the start node to the destination node.Solve in the prior art based on FSR agreements from
When selecting optimal path in group network, to not comprehensive and index the weight of consideration of each index in the service quality of ad-hoc network
The problem of assignment is not objective enough, realizes and select the optimal path that communication quality is optimal in ad-hoc network exactly.
Example IV
Fig. 5 is a kind of structural representation for server that the embodiment of the present invention four provides, and the present embodiment is applicable to be based on
The situation of optimal route selection in the hoc network of FSR agreements.As shown in figure 5, the server specifically includes：One or more processing
Device 510, in Fig. 5 by taking a processor 510 as an example；Memory 520, for storing one or more programs, work as one or more
Program is performed by one or more processors 510 so that one or more processors 510 are realized described in any embodiment of the present invention
The routing resource based on FSR agreements.Processor 510 can be connected with memory 520 by bus or other modes, figure
In 5 exemplified by being connected by bus.
Memory 520, as a kind of computer-readable recording medium, it can perform available for storage software program, computer
Program and module, programmed instruction/module as corresponding to the routing resource based on FSR agreements in the embodiment of the present invention
(for example, weight determination module 410 and optimal path acquisition module 440 in the path selection device based on FSR agreements).Processing
Device 510 is stored in software program, instruction and module in memory 520 by operation, so as to the various work(of execute server
It can apply and data processing, that is, realize the above-mentioned routing resource based on FSR agreements.
Memory 520 can mainly include storing program area and storage data field, wherein, storing program area can store operation system
Application program needed for system, at least one function；Storage data field can store uses created data etc. according to server.
In addition, memory 520 can include high-speed random access memory, nonvolatile memory, for example, at least one can also be included
Individual disk memory, flush memory device or other non-volatile solid state memory parts.In some instances, memory 520 can enter
One step includes that relative to the remotely located memory of processor 510, these remote memories network connection to service can be passed through
Device.The example of above-mentioned network includes but is not limited to internet, intranet, LAN, mobile radio communication and combinations thereof.
Embodiment five
The embodiment of the present invention five also provides a kind of computer-readable recording medium, be stored thereon with computer program (or
For computer executable instructions), for performing a kind of Path selection side based on FSR agreements when the program is executed by processor
Method, this method include：
The objective weight of each index is determined according to sample data corresponding to each index in the ad-hoc network obtained in advance；
According to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance, calculate
Metric in the ad-hoc network between each adjacent node, wherein, the real-time communication quality data are in the ad-hoc network
Each adjacent node between the data corresponding with each index that collect in real time；
According to the metric between each adjacent node, start node is calculated in the ad-hoc network to all roads between destination node
The metric in footpath；
Using the minimum path of the metric in path as the start node to the optimal path between the destination node.
Certainly, a kind of computer-readable recording medium that the embodiment of the present invention is provided, its computer executable instructions is not
It is limited to method operation as described above, can also carry out the choosing of the path based on FSR agreements that any embodiment of the present invention is provided
Associative operation in selection method.
By the description above with respect to embodiment, it is apparent to those skilled in the art that, the present invention
It can be realized by software and required common hardware, naturally it is also possible to realized by hardware, but the former is more in many cases
Good embodiment.Based on such understanding, what technical scheme substantially contributed to prior art in other words
Part can be embodied in the form of software product, and the computer software product can be stored in computer-readable recording medium
In, floppy disk, read-only storage (Read-Only Memory, ROM), random access memory (Random such as computer
Access Memory, RAM), flash memory (FLASH), hard disk or CD etc., including some instructions are causing a computer to set
Standby (can be personal computer, server, or network equipment etc.) performs the method described in each embodiment of the present invention.
Pay attention to, above are only presently preferred embodiments of the present invention and institute's application technology principle.It will be appreciated by those skilled in the art that
The invention is not restricted to specific embodiment described here, can carry out for a person skilled in the art various obvious changes,
Readjust and substitute without departing from protection scope of the present invention.Therefore, although being carried out by above example to the present invention
It is described in further detail, but the present invention is not limited only to above example, without departing from the inventive concept, also
Other more equivalent embodiments can be included, and the scope of the present invention is determined by scope of the appended claims.
Claims (10)
- A kind of 1. routing resource based on FSR agreements, it is characterised in that applied in flake state Routing Protocol FSR, institute The method of stating includes：The objective weight of each index is determined according to sample data corresponding to each index in the ad-hoc network obtained in advance；According to the objective weight of each index and the real-time communication quality data of the ad-hoc network obtained in advance, described in calculating Metric in ad-hoc network between each adjacent node, wherein, the real-time communication quality data are in each of the ad-hoc network The data corresponding with each index collected in real time between adjacent node；According to the metric between each adjacent node, start node is calculated in the ad-hoc network to all paths between destination node Metric；Using the minimum path of the metric in path as the start node to the optimal path between the destination node.
- 2. according to the method for claim 1, it is characterised in that each index pair in the ad-hoc network that the basis obtains in advance The sample data answered determines the objective weight of each index, including：Obtain sample data corresponding to each index in the ad-hoc network；Wherein, the index includes but is not limited to：Bandwidth, lead to Believe time delay, delay variation, packet loss or hop count；According to sample data corresponding to each index, calculate between index described in the contrast intensive parameter and any two of each index Conflicting parameter；According to each objective weight for contrasting intensive parameter and each conflicting parameter, calculating each index.
- 3. according to the method for claim 2, it is characterised in that the conflicting ginseng calculated between index described in any two Number, including：According to sample data corresponding to each index, the coefficient correlation between index described in any two is calculated；According to the coefficient correlation, the conflicting parameter between index described in any two is calculated.
- 4. according to the method for claim 2, it is characterised in that in the acquisition ad-hoc network corresponding to each index After sample data, methods described also includes：Nondimensionalization processing is carried out to sample data corresponding to each index.
- A kind of 5. path selection device based on FSR agreements, it is characterised in that applied in flake state Routing Protocol FSR, institute Stating device includes：Weight determination module, for determining each index according to sample data corresponding to each index in the ad-hoc network obtained in advance Objective weight；Metric acquisition module between node, for the objective weight according to each index and the ad-hoc network obtained in advance Real-time communication quality data, the metric between each adjacent node in the ad-hoc network is calculated, wherein, the real-time communication quality Data are the data corresponding with each index collected in real time between each adjacent node of the ad-hoc network；Path metric value acquisition module, for calculating start node in the ad-hoc network according to the metric between each adjacent node To the metric in all paths between destination node；Optimal path acquisition module, for using the minimum path of the metric in path as the start node to the purpose section Optimal path between point.
- 6. device according to claim 5, it is characterised in that the weight determination module, including：Achievement data acquiring unit, for obtaining sample data corresponding to each index in the ad-hoc network；Wherein, the index Including but not limited to：Bandwidth, communication delay, delay variation, packet loss or hop count；Parameter acquiring unit, for the sample data according to corresponding to each index, calculate the contrast intensive parameter of each index and appoint Conflicting parameter between two indexs of anticipating；Weight determining unit, for calculating the objective weight of each index according to each contrast intensive parameter and each conflicting parameter.
- 7. device according to claim 6, it is characterised in that the parameter acquiring unit, in addition to：Coefficient correlation obtains subelement, for the sample data according to corresponding to each index, between index described in calculating any two Coefficient correlation；Conflicting parameter acquiring subelement, for according to the coefficient correlation, calculating rushing between index described in any two Prominent property parameter.
- 8. device according to claim 6, it is characterised in that also include：Data preprocessing module, for being obtained described in the ad-hoc network after sample data corresponding to each index, to each Sample data corresponding to index carries out nondimensionalization processing.
- A kind of 9. server, it is characterised in that including：One or more processors；Memory, for storing one or more programs；When one or more of programs are by one or more of computing devices so that one or more of processors are real Now as any one of Claims 1-4 based on FSR protocol path systems of selection.
- 10. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that the program is by processor The routing resource based on FSR agreements as any one of Claims 1-4 is realized during execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711084162.8A CN107786449B (en) | 2017-11-07 | 2017-11-07 | FSR protocol-based path selection method, device, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711084162.8A CN107786449B (en) | 2017-11-07 | 2017-11-07 | FSR protocol-based path selection method, device, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107786449A true CN107786449A (en) | 2018-03-09 |
| CN107786449B CN107786449B (en) | 2021-05-14 |
Family
ID=61432879
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711084162.8A Active CN107786449B (en) | 2017-11-07 | 2017-11-07 | FSR protocol-based path selection method, device, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107786449B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108848250A (en) * | 2018-05-07 | 2018-11-20 | 北京奇点机智科技有限公司 | Routing update method, device and equipment |
| CN109039383A (en) * | 2018-09-27 | 2018-12-18 | 深圳友讯达科技股份有限公司 | heterogeneous network communication transmission method and device |
| CN109040102A (en) * | 2018-08-27 | 2018-12-18 | 北京搜狐新动力信息技术有限公司 | A kind of live transmission method and system of internet live streaming CDN |
| CN109257277A (en) * | 2018-09-27 | 2019-01-22 | 深圳友讯达科技股份有限公司 | Shortest path calculation method and device |
| CN109347736A (en) * | 2018-09-27 | 2019-02-15 | 深圳友讯达科技股份有限公司 | Bimodulus routes short address communication means, device and server |
| CN112039634A (en) * | 2020-08-27 | 2020-12-04 | 上海金卓网络科技有限公司 | Decoding method and device of polarization code, computer equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764146A (en) * | 2004-10-21 | 2006-04-26 | 华为技术有限公司 | Optimization route choosing method |
| EP2717628A1 (en) * | 2011-05-30 | 2014-04-09 | Fujitsu Limited | Wireless station, routing method, wireless communication system and routing program |
-
2017
- 2017-11-07 CN CN201711084162.8A patent/CN107786449B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1764146A (en) * | 2004-10-21 | 2006-04-26 | 华为技术有限公司 | Optimization route choosing method |
| EP2717628A1 (en) * | 2011-05-30 | 2014-04-09 | Fujitsu Limited | Wireless station, routing method, wireless communication system and routing program |
Non-Patent Citations (3)
| Title |
|---|
| GLENN ROBERTSON等: "Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing", 《IEEE》 * |
| GUANGWU HU等: "MR-OLSR: A link state routing algorithm in multi-radio/multi-channel Wireless Mesh Networks", 《IEEE》 * |
| 黄超: "基于SDN的网络性能监测系统的研究与设计", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108848250A (en) * | 2018-05-07 | 2018-11-20 | 北京奇点机智科技有限公司 | Routing update method, device and equipment |
| CN109040102A (en) * | 2018-08-27 | 2018-12-18 | 北京搜狐新动力信息技术有限公司 | A kind of live transmission method and system of internet live streaming CDN |
| CN109039383A (en) * | 2018-09-27 | 2018-12-18 | 深圳友讯达科技股份有限公司 | heterogeneous network communication transmission method and device |
| CN109257277A (en) * | 2018-09-27 | 2019-01-22 | 深圳友讯达科技股份有限公司 | Shortest path calculation method and device |
| CN109347736A (en) * | 2018-09-27 | 2019-02-15 | 深圳友讯达科技股份有限公司 | Bimodulus routes short address communication means, device and server |
| CN109347736B (en) * | 2018-09-27 | 2021-11-12 | 深圳友讯达科技股份有限公司 | Dual-mode routing short address communication method, device and server |
| CN112039634A (en) * | 2020-08-27 | 2020-12-04 | 上海金卓网络科技有限公司 | Decoding method and device of polarization code, computer equipment and storage medium |
| CN112039634B (en) * | 2020-08-27 | 2023-08-29 | 上海金卓科技有限公司 | Decoding method and device of polarization code, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107786449B (en) | 2021-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107786449A (en) | Routing resource, device, server and storage medium based on FSR agreements | |
| CN101572623B (en) | Method for comprehensively evaluating network performance based on subjective and objective combination evaluation | |
| WO2017117951A1 (en) | Virtual mapping method and device | |
| Orhan et al. | Connection management xAPP for O-RAN RIC: A graph neural network and reinforcement learning approach | |
| CN104468192B (en) | The method for routing that a kind of multiple dimensioned many weight link-qualities are assessed | |
| CN108881207B (en) | Network security service realization method based on security service chain | |
| CN109286959A (en) | A kind of heterogeneous wireless network vertical handoff method based on analytic hierarchy process (AHP) | |
| CN105050132B (en) | The method of estimation of cell extreme value handling capacity | |
| CN113705959B (en) | Network resource allocation method and electronic equipment | |
| Sadagopan et al. | Decentralized utility-based sensor network design | |
| CN103873364A (en) | Inter-domain multi-path rooting implementation method | |
| Wang et al. | A reinforcement learning approach for online service tree placement in edge computing | |
| CN109446385A (en) | A kind of method of equipment map that establishing Internet resources and the application method of the equipment map | |
| CN113992259A (en) | Method for constructing time slot resource expansion diagram | |
| CN107222925A (en) | A kind of node positioning method based on cluster optimization | |
| EP3425861A1 (en) | Improved routing in an heterogeneous iot network | |
| Venetis et al. | Mobile agents-based data aggregation in WSNs: Benchmarking itinerary planning approaches | |
| CN109218184B (en) | Router attribution AS identification method based on port and structure information | |
| CN108092892B (en) | Method and system for determining routing path of optimal network of Internet of things | |
| CN112887909B (en) | Indoor positioning method based on Wi-Fi signals | |
| Nie et al. | Joint access point fuzzy rough set reduction and multisource information fusion for indoor Wi-Fi positioning | |
| CN108521373A (en) | A kind of multi-path route method in name data network | |
| Boniewicz et al. | Review of selected algorithms in the method energy evening algorithm in wireless sensor network | |
| Li et al. | QoS routing algorithm based on entropy granularity in the network transmission | |
| CN107529128A (en) | The method for routing and system of intelligent distribution network wireless sensor network |
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: Room 606-607, building 1, Lane 666, zhangheng Road, Pudong New Area, Shanghai, 200120 Applicant after: Shanghai Jinzhuo Technology Co., Ltd Address before: Room 606-607, building 1, Lane 666, zhangheng Road, Pudong New Area, Shanghai, 200120 Applicant before: SHANGHAI KINDROID NETWORK TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |