CN117440464A - Multipath routing method and system based on difference of position and path quality - Google Patents
Multipath routing method and system based on difference of position and path quality Download PDFInfo
- Publication number
- CN117440464A CN117440464A CN202311352408.0A CN202311352408A CN117440464A CN 117440464 A CN117440464 A CN 117440464A CN 202311352408 A CN202311352408 A CN 202311352408A CN 117440464 A CN117440464 A CN 117440464A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- routing
- new
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 230000005540 biological transmission Effects 0.000 claims description 45
- 230000005484 gravity Effects 0.000 claims description 31
- 238000006073 displacement reaction Methods 0.000 claims description 18
- 238000004364 calculation method Methods 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 8
- 230000009191 jumping Effects 0.000 claims description 6
- 230000006855 networking Effects 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 4
- 125000002015 acyclic group Chemical group 0.000 claims description 3
- 238000004422 calculation algorithm Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000000605 extraction Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008685 targeting Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a multipath routing method and a multipath routing system based on position and path quality difference, which belong to the technical field of computer network routing.
Description
Technical Field
The present invention relates to the field of computer network routing technologies, and in particular, to a method and a system for multipath routing based on a difference between a position and a path quality.
Background
Mobile ad hoc networks are a multi-hop temporary ad hoc network system, which are distinguished among many network types by the flexibility and convenience of networking, and are widely used in the military field. Because tactical military networks mostly employ mechanisms for wireless transmission, their upper bandwidth limits are generally far lower than conventional wired networks. Therefore, for military stream service with larger data volume and longer duration, if a single path with bottleneck bandwidth meeting the throughput requirement of the service stream cannot be found, the routing algorithm starts multi-path routing to select a plurality of sub-stream paths for load balancing, so that the throughput requirement of the service stream is met as much as possible under the condition that other service traffic is not migrated and the bottleneck bandwidth of the path is not changed.
In general, when a certain service flow needs multiple paths to participate in data transmission, multiple disjoint paths should be searched as much as possible to ensure the fault tolerance of the transmission. For example, if there are the same intermediate forwarding node or transmission link in multiple paths selected by a service flow, when the common network node or the link involved in transmission fails, the service flow is completely interrupted and then waits for the start or rerouting of the standby path, which definitely has a serious influence on the transmission quality of the service flow. The conventional multipath disjoint routing scheme is divided into three modes:
mode1: and (5) multi-path routing which is carried out by all nodes of each transmission path and is not intersected.
mode2: multipath routing where all links of each transmission path do not intersect.
mode3: and (3) multi-path routing of which partial links of each transmission path are disjoint.
The mode1 all-node disjoint scheme means that the intersection between the network node and the transmission link does not exist in multiple paths participating in transmission, and when any position on one path fails, the sub-streams on other paths which are being transmitted are not affected at all. The affected sub-flows of the service flow can be selectively migrated to other unexplored paths for continuous transmission before the system executes the standby path or reroutes; the mode2 all link disjoint scheme refers to multiple paths participating in the transmission not having the same transmission link but possibly the same network node. Thus, when these common network nodes fail, transmission of other sub-streams may be affected and even interruption of the overall traffic flow may be caused; in some systems with relatively tight link resources or relatively sparse nodes, multiple transmission paths meeting the requirement of disjoint of all links may not be found, and a mode3 partial link disjoint multipath routing scheme is adopted. I.e. only as few paths as possible of the shared link need be found, so that the multi-path fault tolerance is maximized.
However, since the usage scenario is different from the military field, there are two issues with multipath routing in the mobile ad hoc network in the past that are not addressed: (1) Focusing on only multipath, which is low in correlation, there is no consideration for localized military strikes that may occur. For example, if two lines with low correlation are selected as multipath transmission lines, if the two lines are spatially close together and are destroyed at the same time with a high probability, communication will still be interrupted, and thus, a certain resistance to destruction is ensured by selecting two lines with high correlation but further spatial distance. (2) When multi-path parallel transmission is carried out, one data is divided into sub-streams, then the sub-streams are transmitted through different paths, and finally the sub-streams are recombined at a receiving end. If the performance difference between the transmission paths is too large, extra pressure is brought to the buffer area of the receiving end, and finally the transmission quality of the service flow is affected. In summary, in addition to the degree of spatial deviation, performance deviations between individual paths should be considered in multipath routing.
Therefore, a new multipath routing method is needed to be studied, which considers the node space deviation and the link performance deviation, so as to meet the requirements of the military network on improving the utilization efficiency of system resources and reducing the influence of local military hit on transmission.
Disclosure of Invention
Aiming at the problems, the invention aims to provide a multipath routing method based on the difference of space position and path quality, which utilizes longitude and latitude and altitude information to map into three-dimensional coordinates to calculate deviation degree and redefine link reliability, thereby solving the problems of local military hit and transmission path performance difference existing in the routing method in the prior art, meeting the throughput requirement of service flow as much as possible under the condition of not migrating other service flow and not changing the path bottleneck bandwidth, and further reducing the transmission influence of the scopic military hit on the service flow.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
the multipath routing method based on the difference between the position and the path quality is characterized by comprising the following steps,
s1: according to military service flow applied to access network, determining the upper limit N of iteration times of a disjoint multipath routing method, and finding out the path of the minimum bandwidth from a source to a destination node a The method comprises the steps of carrying out a first treatment on the surface of the Simultaneously updating the bandwidth use condition on the undirected graph G, and solving an acyclic candidate path set alt_paths meeting the bandwidth requirement by utilizing depth traversal;
s2: path is provided with a Obtaining the gravity center deviation degree of each intermediate node set with path elements in alt_path in a pairwise combination mode, storing the gravity center deviation degree into set displacement, reordering elements in the set displacement from large to small according to the gravity center deviation degree and key values in the set displacement; finally, obtaining overall performance difference data of all path combinations, and calculating the median ava of the data;
s3: traversing the reordered deviances in step S2 to find a first path combination a with a path difference degree above the median ava: (path) a ，path b ) If such a path combination a exists, and the number of paths required k=2, the routing is ended; if such a path combination A exists, but the number of paths k required is greater than 2, updating the bandwidth usage of the path on the undirected graph G, and continuing to execute step S4;
s4: according to the two paths (path) obtained in step S3 a ，path b ) Performing node and edge rejection operation on the undirected graph G again, and then solving a new candidate path combination new_alt_paths= [ path ] by using depth traversal 1 ，…，path i ，…]；
S5: calculating a center of gravity coordinate set new_centers corresponding to the new_alt_paths obtained in the step S4, and then calculating the center of gravity of each path in the new_centers and two selected paths respectively a And path b The sum D of the degrees of deviation of the center of gravity of (2) i ＝D i,a +D i,b Thereby obtaining a new gravity center deviation degree set new_displacement;
s6: based on new_centers obtained in step S5, repeating the operations of step S2 and step S3, and finding out the final required path combination B: (path) a ，path b ，path c )。
Further, the specific operation of determining the upper limit N of the iteration number of the disjoint multipath routing method in step S1 includes the steps of,
s101: determining an aggregate initial_edge of the edges in the undirected graph G, and initializing an aggregate initial_clinical_path, an index aggregate initial_index and an aggregate initial_results of a storage solution set of a storage history search path;
s102: setting a sending node as a current node, traversing the set initial_edges to search for edges which contain current node variables but do not appear in the historical search path set initial_history_path;
s103: taking a node from the tail of the index set initial_index as a new current node, and repeating the step S102 until the edge containing the destination node is accessed, or no link which is not included in the history search path set initial_history_path but contains the current node is available in the initial_edges;
s104: storing the destination node as a solution element into initial_results, deleting the last link in the history path set initial_history_path, and taking out the destination node X from the tail of the index set initial_index as a new current node;
s105: repeating the steps S102-S104 until the index set initial_index is empty;
s106: and taking the smaller value of the number of path elements stored in the initial_results and the maximum transmission path number when the cost balance is considered as the upper limit N of the iteration times of the disjoint multipath routing method, namely min (initial_results), and 3.
Further, in step S1, the bandwidth calculation method from the source to the destination node includes:
where cost is the bandwidth from the source to the destination node; tp (Tp) need Bw is the throughput requirement of traffic flow for transmission prov And Bw use The nominal bandwidth size of a link and the bandwidth size occupied by the data traffic on the link being transmitted, respectively.
Further, the calculation process of the degree of center of gravity deviation in step S2 includes the steps of,
s201: acquiring longitude and latitude and altitude information (theta) of each individual combat unit serving as networking node 1 ，θ 2 ，h 0 ) Wherein θ 1 Is latitude, theta 2 Longitude, h 0 Is the altitude;
s202: mapping each longitude, latitude and altitude of each individual combat unit serving as a networking node under a three-dimensional coordinate system of sitting information to obtain corresponding three-dimensional coordinates (x, y, z);
s203: make the path i The nodes on the node are [ s, r ] 1 ，r 2 ，…，r n ，d]Wherein s is a source node, d is a target node, r i For intermediate node, let SW i ＝[r 1 ，r 2 ，…，r n ]For path i SW is obtained from the gravity center formula of the point set in space i Is of the center of gravity of (2)
S204: path a Sum path b Distance (path) a ，path b ) Represented as the middle two sectionsDistance between centers of gravity of a set of points
Further, the overall performance difference data calculation process of all path combinations in step S2 includes the steps of,
s205: introducing link reliability Lr parameter to measure the performance of the path, the overall reliability Pr of the path containing num (link) links is expressed as
Wherein Lr refers to the success rate of the link in transmitting data packetsWherein Tn is the number of data packets transmitted by a network port at one end of a link in a certain period of time, and Rn is the number of packets correctly received by the network port at the other end of the link in the certain period of time;
s206: calculating the respective reliability Pr of all paths;
s207: the reliability of each path is Pr 1 、Pr 2 、…、Pr n Path set [ path ] 1 ,path 2 ，…，path n ]Calculating mathematical expectationsBy variance->Indicating the overall performance differences for all path combinations.
Further, if the path combination a cannot be obtained in the step S3, the number k of the required paths is increased by 1, then a new candidate path is recalculated, and the steps S2 and S3 are repeated according to the updated candidate path and the link bandwidth requirement.
Further, the specific operation of performing the node and edge culling operation again on the undirected graph G in step S4 includes the steps of,
if all node disjoint routing is being performed, the paths obtained in step S3 are combined (path a ，path b ) The used nodes are removed from the undirected graph G;
if all link disjoint routing is being performed, the paths obtained in step S3 are combined (path a ，path b ) The used edges are removed from the undirected graph G;
if partial link disjoint routing is being performed, edges in the undirected graph G that do not meet the bandwidth requirements are culled.
Further, the specific operation of performing the node and edge culling operation again on the undirected graph G in step S6 includes the steps of,
s601: sorting elements in new_displacement from large to small according to key values in new_displacement of the degree of deviation between barycenters;
s602: the set of overall performance difference data new_alt_path_var for all path combinations in new_displacement is calculated and the median new_ava of these data is calculated, denoted as [ var (path) 1 ，path a ，path b )，…，var(path i ，path a ，path b )，…]；
S603: traversing the new_deviationreordered in step S601, to find a path combination B with the first path difference degree on the median new_ava: (path) a ，path b ，path c )；
S604: if such a path combination B is available in step S603, the path combination B is the desired path;
s605: if such a path combination B is not available in step S603, it is decided whether to exit the program or continue performing the disjoint routing of the other modes according to the disjoint routing mode currently being executed.
Further, the specific operation of step S605 includes the following steps,
if all node disjoint multi-path routing is being performed, jumping to all link disjoint multi-path routing; if all link disjoint multipath routing is being performed, then jumping to partial link disjoint multipath routing; if partial link disjoint multipath routing is being performed, the routing procedure is exited and the subsequent incoming traffic stream is rejected.
Further, the multipath routing system based on the difference between the position and the path quality is characterized in that: the multi-path routing system executes the method when performing multi-path routing.
The beneficial effects of the invention are as follows:
the invention provides a path disjoint multipath routing method capable of resisting local military strike, which solves the two problems by mapping longitude and latitude and altitude information into three-dimensional coordinates to calculate deviation degree and redefining link reliability, and the routing method can analyze relevant information to select one or more sub-flow paths for load balancing, so that throughput requirements of the service flow can be met as much as possible under the condition of not migrating other service flows and not changing path bottleneck bandwidth, and the influence of the ranging military strike on the transmission of the service flow is further reduced.
Drawings
FIG. 1 is a flow chart of a multi-path routing method in the present invention;
FIG. 2 is a code diagram of a method for routing paths with disjoint paths in the present invention;
FIG. 3 is a code sequence diagram of a path-disjoint multi-path routing method in the present invention;
fig. 4 is a schematic diagram of an exemplary scenario of a military mobile ad hoc network in a simulation experiment according to the present invention.
Detailed Description
In order to enable those skilled in the art to better understand the technical solution of the present invention, the technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
Embodiment one:
as shown in fig. 1, the multi-path routing method based on the difference between the position and the path quality includes the following steps,
s1: according to military service flow applied to access network, determining the upper limit N of iteration times of a disjoint multipath routing method, and finding out the minimum bandwidth cost path from a source to a destination node a The method comprises the steps of carrying out a first treatment on the surface of the Simultaneously updating the bandwidth use condition on the undirected graph G, and solving an acyclic candidate path set alt_paths meeting the bandwidth requirement by utilizing depth traversal;
specifically, the practical meaning of the upper limit N of the iteration number of the disjoint multipath routing method is that the maximum number of parallel transmission paths that can be provided by the undirected graph G for the military service flow, if no path meeting the requirement of mode1 (the disjoint multipath routing of all nodes of each transmission path) is found after N iterations, then the searching of the paths meeting mode2 (the disjoint multipath routing of all links of each transmission path) is performed in turn, if mode2 still cannot be met, then the searching of the paths meeting mode3 (the disjoint multipath routing of all links of each transmission path) is performed in turn, and if still cannot be met, the algorithm is directly exited and the network entry of the service flow is refused.
According to military service flow of network access application, node position information and full network topology information need to be updated first, and both a starting point (source node) and a destination node are guaranteed to be in an undirected graph G. After determining the upper limit N of iteration times of the disjoint multipath routing method, removing links with residual bandwidths which do not meet the throughput requirement of the service flow on the undirected graph G, then performing Di Jie Style algorithm routing, and finding out the minimum cost path from the source to the destination node a 。
More specifically, the specific operation of determining the upper limit N of the iteration number of the disjoint multipath routing method includes the steps of,
s101: determining an aggregate initial_edge of the edges in the undirected graph G, and initializing an aggregate initial_clinical_path, an index aggregate initial_index and an aggregate initial_results of a storage solution set of a storage history search path;
s102: setting a sending node as a current node, traversing the set initial_edges to search for edges which contain current node variables but do not appear in the historical search path set initial_history_path; for example, if the first edge searched is (s 1, s 2), the program will add (s 1, s 2) to the set of historical search paths and will add s1, s2 to the index set initial_index.
S103: taking a node from the tail of the index set initial_index as a new current node, and repeating the step S102 until the edge containing the target node is accessed, or no link which is not included in the history search path set initial_hstoral_path but contains the current node exists in the initial_edges;
s104: storing the destination node as a solution element into initial_results, deleting the last link (X node) in the history path set initial_history_path, and taking out the X node from the tail of the index set initial_index as a new current node;
s105: repeating the steps S102-S104 until the index set initial_index is empty;
s106: since Peter p.Pham and Sylvie Perreau et al quantify the overhead of on-demand routing mechanism in a mobile ad hoc network by means of problem modeling and mathematical derivation and draw the conclusion that the overhead increases significantly when the transmission paths are greater than 3, the smaller value of the number of path elements stored in the initial_results and the maximum number of transmission paths when the overhead balance is considered can be taken as the upper limit of the iteration number N of the disjoint multipath routing method, i.e., min (initial_results), 3.
In summary, the logic code for determining the upper limit N of the iteration number of the disjoint multipath routing method is shown in table 1 below.
Table 1 calculation algorithm of iteration number upper limit N of disjoint multipath routing method
Further, in this step, the method for calculating the bandwidth cost from the source to the destination node is as follows
Where cost is the bandwidth from the source to the destination node; tp (Tp) need Bw is the throughput requirement of traffic flow for transmission prov And Bw use The nominal bandwidth size of a link and the bandwidth size occupied by the data traffic on the link being transmitted, respectively.
Further, in this step, the step of calculating the candidate path set alt_paths is almost identical to the step of solving the initial_results in the upper limit N of the calculation iteration number. The only thing to note is to reject all the corresponding edges of the links in the undirected graph G that have residual bandwidth that does not meet the traffic throughput requirement before computation. Specific logic codes are shown in table 2 below.
Table 2 algorithm for selecting candidate paths
Further, step S2: path is provided with a The degree of center of gravity deviation of each intermediate node set is obtained by combining path elements in alt_path in pairs and is stored in set extraction, extraction= { (path) a ，path 1 )：distance(path a ，path 1 )；…；(path a ，path i )：distance(path a ，path i ) The method comprises the steps of carrying out a first treatment on the surface of the … }; reordering elements in the set of deviations from large to small according to the degree of center of gravity deviation (i.e., the value size of the key-value pairs in the deviation); finally, the overall performance difference data alt_var= [ var (path) of all path combinations is obtained through var functions a ，path 1 )，…，var(path a ，path i )，…]And calculates the median ava of these data;
specifically, care should be taken when combining path elements two by two: if all nodes of the mode1 are not subjected to cross routing, ensuring that no common node exists between the paths of the two-to-two combination; if mode2 all links are not cross-routed, then no common link is guaranteed between the two-by-two combined paths; if mode3 partial link disjoint routing is being performed, it is only necessary to ensure that the path of the pairwise combination is not duplicated.
Further, distance () function method is used to calculate the center of gravity deviation degree, so that the path i The nodes on the node are [ s, r ] 1 ，r 2 ，…，r n ，d]Wherein s is a source node, d is a target node, r i Is an intermediate node, and each node has own three-dimensional coordinates, which enables SW i ＝[r 1 ，r 2 ，…，r n ]For path i SW is obtained from the gravity center formula of the point set in space i Is of the center of gravity of (2)Path a Sum path b Distance (path) a ，path b ) Expressed as distance between centers of gravity of the set of intermediate nodes +.>
In the actual combat scene, each individual combat unit serving as a networking node obtains own longitude, latitude and altitude information (theta) through a Global Positioning System (GPS) 1 ，θ 2 ，h 0 ) (wherein, θ 1 Is latitude, theta 2 Longitude, in degrees; h is a 0 Altitude, units are kilometers). Therefore, it is necessary to perform a mapping process in a three-dimensional coordinate system. Based on the above-mentioned thought, the earth is treated as a sphere with radius R, and a three-dimensional space coordinate system is established with the earth center as the origin of coordinates, the equatorial plane as the xy plane (the longitude of the positive direction of the x-axis is 0 °, the longitude of the positive direction of the y-axis is 90 °), and the earth axis of the north-axis is the z-axis, using the formulaLatitude and altitudeInformation (θ) 1 ，θ 2 ，h 0 ) Mapped to the desired three-dimensional coordinates (x, y, z).
Further, the specific operation process of obtaining the overall performance difference data of all path combinations through the var function comprises,
introducing link reliability Lr parameter to measure the performance of the path, the overall reliability Pr of the path containing num (link) links is expressed asI.e. the product of the reliability of all links on the path;
wherein Lr refers to the success rate of the link in transmitting data packetsWherein Tn is the number of data packets transmitted by a network port at one end of a link in a certain period of time, and Rn is the number of packets correctly received by the network port at the other end of the link in the certain period of time;
if the performance difference between two paths is to be calculated, the reliability Pr of each path can be calculated, then the mathematical expectation mu of the two Prs is calculated, and finally the variance sigma is obtained 2 . Since variance is generally used to measure the degree of deviation or proximity between several values, then σ here 2 The smaller the value, the smaller the performance difference between the two paths, and conversely, the larger the performance difference;
the reliability of each path is Pr 1 、Pr 2 、…、Pr n Path set [ path ] 1 ，path 2 ，…，path n ]In other words, calculate mathematical expectationsBy variance->Indicating the overall performance differences for all path combinations.
Further go forwardStep, step S3: traversing the reordered deviances in step S2 to find a first path combination a with a path difference degree above the median ava: (path) a ，path b ) If such a path combination a exists, and the number of paths required k=2, the routing is ended; if such a path combination A exists, but the number of paths k required is greater than 2, updating the bandwidth usage of the path on the graph G, and continuing to execute step S4; if the path combination a cannot be obtained in the step S3, after increasing the number k of the required paths by 1 (the bandwidth requirement of each link is expected to be correspondingly reduced at this time), the new candidate path is recalculated, and the steps S2 and S3 are repeated according to the updated candidate path and the link bandwidth requirement.
In particular, the goal of multipath routing is to find as few disjoint transmission paths as possible for load sharing of traffic flows, since the more transmission paths involve more memory space, ordering and reassembly of packets, and maintenance of routes is also more likely to be. In addition, the increase of transmission paths also means the increase of network nodes participating in transmission, so that attack points exposed to enemies are correspondingly increased. Multipath routing is therefore necessarily a decision process for the number of target transmission paths from a small number to a large number.
If a transmission path with bottleneck bandwidth meeting the requirement cannot be provided for a certain military service flow, and n=3 is obtained through calculation, the number k=2 of node disjoint paths is taken as the target at the beginning, and the value of the bandwidth expected to be shared by each link naturally becomes 1/2 of the original throughput requirement of the service flow. Eventually, of course, it may not be possible to find such 2 disjoint paths for all nodes, then k++ is performed, reducing the expected shared bandwidth of the link to 1/3 of the original throughput requirement of the traffic flow. If such 3 all node disjoint paths still cannot be found, then the less constrained all link disjoint algorithm is shifted to restart the k=2 iteration. If the partial link disjoint algorithm with the minimum constraint can not find a plurality of transmission paths meeting the requirement in N iterations, the routing algorithm is exited and the network access of the service flow is refused.
Further, step S4: according to the step S3Two paths (path) a ，path b ) Performing node and edge rejection operation on the undirected graph G again, and then solving a new candidate path combination new_alt_paths= [ path ] by using depth traversal 1 ，…，path i ，…]；
Specifically, in performing the node and edge elimination operation again on the undirected graph G, if all the node disjoint routes are being performed, the path combinations (paths) obtained in step S3 are combined a ，path b ) The used nodes are removed from the undirected graph G;
if all link disjoint routing is being performed, the paths obtained in step S3 are combined (path a ，path b ) The used edges are removed from the undirected graph G;
if partial link disjoint routing is being performed, edges in the undirected graph G that do not meet the bandwidth requirements are culled.
Further, step S5: calculating a center of gravity coordinate set new_centers corresponding to the new_alt_paths obtained in the step S4, and then calculating the center of gravity of each path in the new_centers and two selected paths respectively a And path b The sum D of the degrees of deviation of the center of gravity of (2) i ＝D i,a +D i,b Thereby obtaining a new gravity center deviation degree set new_displacement;
further, step S6: based on new_centers obtained in step S5, repeating the operations of step S2 and step S3, and finding out the final required path combination B: (path) a ，path b ，path c )；
Specifically, S601: sorting elements in new_displacement from large to small according to key values in new_displacement of the degree of deviation between barycenters;
s602: the set of overall performance difference data new_alt_path_var for all path combinations in new_displacement is calculated and the median new_ava of these data is calculated, denoted as [ var (path) 1 ，path a ，path b )，…，var(path i ，path a ，path b )，…]；
S603: to step S601 againTraversing the ordered new_deviationto find a path combination B with the first path difference degree on the median new_ava: (path) a ，path b ，path c )；
S604: if such a path combination B is available in step S603, the path combination B is the desired path;
s605: if such a path combination B in step S603 is not available, deciding whether to exit the program or continue performing the disjoint routing of other modes according to the disjoint routing mode currently being executed; if all node disjoint multi-path routing is being performed, jumping to all link disjoint multi-path routing; if all link disjoint multipath routing is being performed, then jumping to partial link disjoint multipath routing; if partial link disjoint multipath routing is being performed, the routing procedure is exited and the subsequent incoming traffic stream is rejected.
Pseudo codes of the multipath routing method based on the difference between the position and the path quality in the invention are shown in figures 2-3.
Simulation experiment:
in a local three-dimensional coordinate system of a certain battle area as shown in fig. 4, specific coordinate information of ten individual combat nodes S1 to S10 is marked in the figure, and the wireless signal coverage area of each node is a sphere with the own sphere center and the radius of 4 unit lengths. Assuming that at this time S1 is transmitting the time of war information targeting S10 through paths where the two nodes S1, S2, S3, S4, S10 and S1, S5, S6, S10 do not intersect and the number of hops is small, at this time, if the enemy only finds any intermediate node involved in transmission, and implements a military strike in a range with the node as a center and the radius of 3 units length, both transmission paths will be forced to be interrupted. The two partial link disjoint paths [ S1, S5, S6, S10] and [ S1, S5, S7, S8, S9, S10] with poor disjoint in the traditional sense can still ensure the normal operation of one transmission path under the condition that three intermediate nodes, namely S7, S8 and S9, bear the military hit in the range.
According to the example shown in FIG. 4, the aggregate initial_edges of the edges in undirected graph G are: [ (S1, S2), (S1, S5), (S2, S3), (S2, S5), (S5, S6), (S5, S7), (S3, S4), (S3, S6), (S4, S10), (S6, S10), (S10, S9), (S7, S8), (S8, S9) ]; at the same time, a set initial_history_path, an index set initial_index, and a set initial_results of a storage solution set of the storage history search path are initialized.
The sending node S1 records as the current node variable and traverses the set initial_edges to search for edges that contain the current node variable but have not yet appeared in the set of historic search paths variable initial_clinical_path. The first edge searched is (S1, S2), then the program will add (S1, S2) to the history search path variable history search path and add S1, S2 to the index set initial_index.
And S2 is taken out from the tail of the index set initial_index as a new current node, and the previous step is repeatedly executed. Until the edge containing the destination node is accessed, or there is no link in the initial_edges that is not included in the aggregate initial_clinical_path of the history search path but contains the current node. Then, four links of (S2, S3), (S3, S4), (S4, S6), and (S6, S10) are found in order, and these edges are added to the history path set initial_clinical_path, at which time the index set initial_index is updated to [ S1, S2, S3, S4, S6, S10].
Because S10 is the target node, the history path is stored as a solution element in initial_results, and finally the last link in the history path set initial_history_path is deleted (S6, S10), and S6 is taken out from the tail of the index set initial_index as the new current node. If S10 of this step was found in the previous step as an initial_edges for which no node was found in the aggregate variable initial_clinical_path that was not included in the history search path but included the link for the current node, then there is no need to store the history path in the solution aggregate_results.
The whole process is repeated until the index set initial_index is empty, and a new node cannot be fetched out any more to serve as a current node. Thus, initial_results with a number of storage path elements of 18 are finally obtained. Finally, from n=min (len (initial_results), 3), it is known that n=3 finally.
Still taking the mobile military ad hoc network topology of fig. 4 as an example, it is assumed that the bandwidths provided by the (S2, S5) and (S3, S6) links cannot meet the throughput requirement of the traffic flow, and the traffic flow is removed from the undirected graph G. Finally, a loop-free candidate path sample set alt_path meeting the bandwidth requirement is obtained through the same steps, wherein the value of the loop-free candidate path sample set alt_path is as follows:
[[1，2，3，4，6，5，7，8，9，10]，[1，2，3，4，6，10]，[1，2，3，4，10]，[1，5，6，4，10]，[1，5，6，10]，[1，5，7，8，9，10]]。
embodiment two:
in a second embodiment, a multipath routing system based on a difference between a position and a path quality is provided, and the system executes the multipath routing method described in the first embodiment when performing multipath routing.
The foregoing has shown and described the basic principles, principal features and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, which is defined in the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (10)
1. The multipath routing method based on the difference between the position and the path quality is characterized by comprising the following steps,
s1: according to military service flow applied to access network, determining the upper limit N of iteration times of a disjoint multipath routing method, and finding out the path of the minimum bandwidth from a source to a destination node a The method comprises the steps of carrying out a first treatment on the surface of the Simultaneously updating the bandwidth use condition on the undirected graph G, and solving an acyclic candidate path set alt_paths meeting the bandwidth requirement by utilizing depth traversal;
s2: path is provided with a The path elements in alt_path are combined with each other to obtain respective intermediateThe gravity center deviation degree of the node set is stored into the set displacement, key values in the set displacement are rearranged from large to small according to the gravity center deviation degree, and elements in the set displacement are rearranged from large to small; finally, obtaining overall performance difference data of all path combinations, and calculating the median ava of the data;
s3: traversing the reordered deviances in step S2 to find a first path combination a with a path difference degree above the median ava: (path) a ，path b ) If such a path combination a exists, and the number of paths required k=2, the routing is ended; if such a path combination A exists, but the number of paths k required is greater than 2, updating the bandwidth usage of the path on the undirected graph G, and continuing to execute step S4;
s4: according to the two paths (path) obtained in step S3 a ，path b ) Performing node and edge rejection operation on the undirected graph G again, and then solving a new candidate path combination new_alt_paths= [ path ] by using depth traversal 1 ，…，path i ，…]；
S5: calculating a center of gravity coordinate set new_centers corresponding to the new_alt_paths obtained in the step S4, and then calculating the center of gravity of each path in the new_centers and two selected paths respectively a And path b The sum D of the degrees of deviation of the center of gravity of (2) i ＝D i,a +D i,b Thereby obtaining a new gravity center deviation degree set new_displacement;
s6: based on new_centers obtained in step S5, repeating the operations of step S2 and step S3, and finding out the final required path combination B: (path) a ，path b ，path c )。
2. The multi-path routing method based on position and path quality difference according to claim 1, wherein: the specific operation of determining the upper limit N of the iteration number of the disjoint multipath routing method in step S1 includes the steps of,
s101: determining an aggregate initial_edge of the edges in the undirected graph G, and initializing an aggregate initial_clinical_path, an index aggregate initial_index and an aggregate initial_results of a storage solution set of a storage history search path;
s102: setting a sending node as a current node, traversing the set initial_edges to search for edges which contain current node variables but do not appear in the historical search path set initial_history_path;
s103: taking a node from the tail of the index set initial_index as a new current node, and repeating the step S102 until the edge containing the destination node is accessed, or no link which is not included in the history search path set initial_history_path but contains the current node is available in the initial_edges;
s104: storing the destination node as a solution element into initial_results, deleting the last link in the history path set initial_history_path, and taking out the destination node X from the tail of the index set initial_index as a new current node;
s105: repeating the steps S102-S104 until the index set initial_index is empty;
s106: and taking the smaller value of the number of path elements stored in the initial_results and the maximum transmission path number when the cost balance is considered as the upper limit N of the iteration times of the disjoint multipath routing method, namely min (initial_results), and 3.
3. The multi-path routing method based on the difference between the position and the path quality according to claim 2, wherein the bandwidth calculation method from the source to the destination node in step S1 is:
where cost is the bandwidth from the source to the destination node; tp (Tp) need Bw is the throughput requirement of traffic flow for transmission prov And Bw use The nominal bandwidth size of a link and the bandwidth size occupied by the data traffic on the link being transmitted, respectively.
4. A multi-path routing method based on location and path quality differences as claimed in claim 3, wherein: the calculation process of the degree of center of gravity deviation in step S2 includes the steps of,
s201: acquiring longitude and latitude and altitude information (theta) of each individual combat unit serving as networking node 1 ，θ 2 ，h 0 ) Wherein θ 1 Is latitude, theta 2 Longitude, h 0 Is the altitude;
s202: mapping each longitude, latitude and altitude of each individual combat unit serving as a networking node under a three-dimensional coordinate system of sitting information to obtain corresponding three-dimensional coordinates (x, y, z);
s203: make the path i The nodes on the node are [ s, r ] 1 ，r 2 ，…，r n ，d]Wherein s is a source node, d is a target node, r i For intermediate node, let SW i ＝[r 1 ，r 2 ，…，r n ]For path i SW is obtained from the gravity center formula of the point set in space i Is of the center of gravity of (2)
S204: path a Sum path b Distance (path) a ，path b ) Represented as the distance between the centers of gravity of the middle two node sets
5. The multipath routing method based on position and path quality difference as claimed in claim 4, wherein: the overall performance difference data calculation process of all path combinations in step S2 includes the steps of,
s205: introducing link reliability Lr parameters to path performanceThe overall reliability Pr of a path containing num (link) links is expressed as
Wherein Lr refers to the success rate of the link in transmitting data packetsWherein Tn is the number of data packets transmitted by a network port at one end of a link in a certain period of time, and Rn is the number of packets correctly received by the network port at the other end of the link in the certain period of time;
s206: calculating the respective reliability Pr of all paths;
s207: the reliability of each path is Pr 1 、Pr 2 、…、Pr n Path set [ path ] 1 ,path 2 ，…，path n ]Calculating mathematical expectationsBy variance->Indicating the overall performance differences for all path combinations.
6. The multipath routing method based on position and path quality difference as claimed in claim 5, wherein: if the path combination a cannot be obtained in the step S3, after increasing the number k of the required paths by 1, recalculating new candidate paths, and repeating the step S2 and the step S3 according to the updated candidate paths and the link bandwidth requirement.
7. The multipath routing method based on position and path quality difference as claimed in claim 6, wherein: the specific operation of performing the node and edge culling operation again on the undirected graph G in step S4 includes the steps of,
if all node disjoint routing is being performed, the paths obtained in step S3 are combined (path a ，path b ) The used nodes are removed from the undirected graph G;
if all link disjoint routing is being performed, the paths obtained in step S3 are combined (path a ，path b ) The used edges are removed from the undirected graph G;
if partial link disjoint routing is being performed, edges in the undirected graph G that do not meet the bandwidth requirements are culled.
8. The multipath routing method based on position and path quality difference as claimed in claim 7, wherein: the specific operation of performing the node and edge culling operation again on the undirected graph G in step S6 includes the steps of,
s601: sorting elements in new_displacement from large to small according to key values in new_displacement of the degree of deviation between barycenters;
s602: the set of overall performance difference data new_alt_path_var for all path combinations in new_displacement is calculated and the median new_ava of these data is calculated, denoted as [ var (path) 1 ，path a ，path b )，…，var(path i ，path a ，path b )，…]；
S603: traversing the new_deviationreordered in step S601, to find a path combination B with the first path difference degree on the median new_ava: (path) a ，path b ，path c )；
S604: if such a path combination B is available in step S603, the path combination B is the desired path;
s605: if such a path combination B is not available in step S603, it is decided whether to exit the program or continue performing the disjoint routing of the other modes according to the disjoint routing mode currently being executed.
9. The multi-path routing method based on location and path quality differences as claimed in claim 8, wherein: the specific operation of step S605 includes the following steps,
if all node disjoint multi-path routing is being performed, jumping to all link disjoint multi-path routing; if all link disjoint multipath routing is being performed, then jumping to partial link disjoint multipath routing; if partial link disjoint multipath routing is being performed, the routing procedure is exited and the subsequent incoming traffic stream is rejected.
10. Multipath routing system based on position and path quality difference, its characterized in that: the multi-path routing system performs the method of any of claims 1-9 when performing multi-path routing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311352408.0A CN117440464A (en) | 2023-10-19 | 2023-10-19 | Multipath routing method and system based on difference of position and path quality |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311352408.0A CN117440464A (en) | 2023-10-19 | 2023-10-19 | Multipath routing method and system based on difference of position and path quality |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117440464A true CN117440464A (en) | 2024-01-23 |
Family
ID=89552620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311352408.0A Pending CN117440464A (en) | 2023-10-19 | 2023-10-19 | Multipath routing method and system based on difference of position and path quality |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117440464A (en) |
-
2023
- 2023-10-19 CN CN202311352408.0A patent/CN117440464A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7072304B2 (en) | Network path selection based on bandwidth | |
| Tsai et al. | Axis-based virtual coordinate assignment protocol and delivery-guaranteed routing protocol in wireless sensor networks | |
| Scheideler | Models and techniques for communication in dynamic networks | |
| US8825986B2 (en) | Switches and a network of switches | |
| US20230327976A1 (en) | Deadlock-free multipath routing for direct interconnect networks | |
| CN117135108B (en) | Routing path planning method, routing request processing method, equipment and medium | |
| CN113992259B (en) | Method for constructing time slot resource expansion graph | |
| CN107360093A (en) | Unmanned plane and satellite hybrid network communication routing method and system | |
| RU2636665C1 (en) | Method of multipath routing using data traffic flow splitting | |
| Król et al. | Weave: Efficient geographical routing in large-scale networks | |
| US9166906B2 (en) | Routing method in asymmetric networks | |
| CN105786618B (en) | The method and apparatus of message are routed in accelerator network | |
| CN117440464A (en) | Multipath routing method and system based on difference of position and path quality | |
| CN117135106A (en) | Routing path planning method, routing request processing method, equipment and medium | |
| CN105224501B (en) | The method and apparatus improved annulus torus network and its determine data packet transmission path | |
| Shi et al. | Modeling and designing routing protocols in quantum networks | |
| Wan et al. | A hybrid multiple copy routing algorithm in space delay-tolerant networks | |
| Bose et al. | Bounding the locality of distributed routing algorithms | |
| US6999423B2 (en) | Link order replacement optimization | |
| CN107509234B (en) | Method and system for detecting key nodes of flight ad hoc network based on limited routing information | |
| Tao et al. | Greedy face routing with face identification support in wireless networks | |
| Fevens et al. | Randomized AB-face-AB routing algorithms in mobile Ad hoc networks | |
| CN116683981B (en) | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram | |
| US11212187B1 (en) | Network topology comprising n-hop local neighborhoods | |
| CN106059914B (en) | A kind of uncertain incast flow polymerization minimizing grouping based on one-dimensional |
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 |