CN112821940B - Satellite network dynamic routing method based on inter-satellite link attribute - Google Patents
Satellite network dynamic routing method based on inter-satellite link attribute Download PDFInfo
- Publication number
- CN112821940B CN112821940B CN202110053197.5A CN202110053197A CN112821940B CN 112821940 B CN112821940 B CN 112821940B CN 202110053197 A CN202110053197 A CN 202110053197A CN 112821940 B CN112821940 B CN 112821940B
- Authority
- CN
- China
- Prior art keywords
- satellite
- link
- inter
- attribute
- time
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- General Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the field of satellite communication, in particular to a satellite network dynamic routing method based on inter-satellite link attributes; the method comprises the steps of collecting a static snapshot sequence diagram of a satellite network, and constructing a space-time evolution diagram of the satellite network; the method comprises the steps that state information of satellite nodes collected by a controller node in real time is used for respectively calculating a link SNR, link survival time and a dynamic utility value of a satellite cache; a weighted satellite network space-time evolution diagram is constructed by assigning weights to the dynamic utility values of the link attributes among the satellites by adopting a multi-attribute decision-based adaptive maximum dispersion algorithm; acquiring an end-to-end reachable path of the satellite based on the weighted satellite network space-time evolution diagram, and establishing an optimization model of link utility; and the controller node selects the transmission path by using the optimization model and determines the reliable transmission path from end to end of the satellite. The invention can optimize the system routing path according to the link state information, thereby improving the network throughput and reducing the packet loss rate, and simultaneously has higher dynamic adaptability.
Description
Technical Field
The invention relates to the field of satellite communication, in particular to a satellite network dynamic routing method based on inter-satellite link attributes.
Background
With the convergence and development of satellite networks and mobile communication technologies, satellite constellations gradually develop towards the large-scale, high-density and multi-level trends, such as Oneweb, SpaceX and Telesat. The introduction of network innovation technologies such as SDN/NFV provides support for expanding satellite network application and constructing a 6G-oriented heaven-earth integrated convergence network. Aiming at the establishment of a Low Earth Orbit (LEO) network and an Inter-Satellite Link (ISL), the flexibility of Satellite networking routing can be improved, and the application requirements of high bandwidth and Low time delay are met. However, due to the increase of the satellite scale, the enhancement of the network heterogeneity and the high dynamics of the satellite, the inter-satellite communication environment becomes more and more complex, and the design of the inter-satellite routing algorithm becomes a key problem to be considered for improving the reliability and dynamics of the low-orbit satellite network.
Aiming at the problem, researchers introduce an on-demand routing idea to provide an on-demand routing protocol based on position, and also introduce a space-time evolution diagram to describe dynamic change of satellite topology to realize real-time network fine-grained routing. However, in the process of depicting the dynamic network topology, the description of the dynamic topology of the satellite network is only the aggregation of static discrete snapshots, and if the link and node attributes do not change within a known time period, when the network changes dynamically and frequently, the problem that the topology information is not updated timely exists, which seriously affects the accuracy of the path selection of the dynamic routing algorithm. Meanwhile, due to the limitation of the computing power on the satellite, the storage of the satellite is greatly challenged if the snapshot interval is small enough to ensure that the network topology is not changed. With the increase of the satellite constellation scale and the continuous increase of the number of satellite nodes, the link state is more complex, and the problem of unreliable routing caused by inaccurate topological information becomes more prominent.
Disclosure of Invention
In order to solve the problems, the invention provides a satellite network dynamic routing method based on inter-satellite link attributes.
The satellite network dynamic routing method based on the link attribute between the satellites comprises the following steps:
s1, acquiring a series of static snapshot sequence diagrams of the satellite network by the controller node, and constructing a satellite network space-time evolution diagram according to time sequence division so as to acquire a continuous dynamic satellite network topology;
s2, respectively calculating link attributes among the satellites, namely link SNR, link survival time and dynamic utility values of satellite cache, based on the state information of the satellite nodes collected by the controller nodes in real time;
s3, weighting the dynamic utility value of each inter-satellite link attribute by adopting a multi-attribute decision-based adaptive maximum dispersion algorithm, and constructing a weighted satellite network space-time evolution diagram;
s4, acquiring an end-to-end reachable path of the satellite based on the weighted satellite network space-time evolution diagram, and establishing an optimization model of link effectiveness;
and S5, selecting the transmission path by the controller node by using the link utility optimization model, and determining the reliable end-to-end transmission path of the satellite.
The invention has the beneficial effects that:
1. the invention constructs the satellite network weighted space-time evolution diagram based on the inter-satellite link state information, accurately depicts the continuous change of the dynamic topology of the satellite network, and is beneficial to improving the dynamic adaptability of a routing algorithm;
2. the invention carries out analysis modeling on SNR (signal to noise ratio) of link attributes between satellites, link survival time, satellite node cache and the like, weights are given to dynamic utility values of the link attributes between the satellites by adopting self-adaptive dispersion, thereby realizing the quantification of link quality, establishing a link utility evaluation model by utilizing a multi-attribute decision theory to determine the weights of the link attributes, realizing the quantification of the link quality, and optimizing a routing path according to the link quality to ensure the reliability of data transmission.
Drawings
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
Fig. 1 is an overall flowchart of a satellite network dynamic routing method based on inter-satellite link attributes according to an embodiment of the present invention;
FIG. 2 is a diagram of the spatial-temporal evolution of a satellite network based on a virtual network topology according to an embodiment of the present invention;
FIG. 3 is a corresponding temporal-spatial evolution diagram of a snapshot-based satellite network according to an embodiment of the present invention;
FIG. 4 is an analysis diagram of adjacent satellite location points on a virtual orbital plane according to an embodiment of the invention;
fig. 5 is a diagram of the on-off time variation of the inter-satellite link according to the embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a flowchart of a method for dynamically routing a satellite network based on inter-satellite link attributes according to an embodiment of the present invention, where the method includes, but is not limited to, the following steps:
s1, collecting a series of static snapshot sequence diagrams of the satellite network by the controller node, and constructing a satellite network time-space evolution diagram according to time sequence division, thereby obtaining a continuous dynamic satellite network topology;
s2, respectively calculating link attributes among the satellites, namely link SNR, link survival time and dynamic utility values of the satellite cache, based on the state information of the satellite nodes collected by the controller nodes in real time;
s3, weighting the dynamic utility value of each inter-satellite link attribute by adopting a multi-attribute decision-based adaptive maximum dispersion algorithm, and constructing a weighted satellite network space-time evolution diagram;
s4, acquiring an end-to-end reachable path of the satellite based on the weighted satellite network space-time evolution diagram, and establishing an optimization model of link utility;
and S5, selecting the transmission path by the controller node by using the link utility optimization model, and determining the reliable end-to-end transmission path of the satellite.
In order to make the method of the present invention more clear and complete, the following steps are described in detail:
in step S1, a continuous dynamic satellite network topology needs to be established; according to the embodiment of the invention, time dimension is added on the basis of virtual network topology according to a space-time evolution theory, a satellite network space-time evolution diagram is constructed, and continuous dynamic satellite network topology is obtained;
specifically, based on the theory of a space-time evolution diagram, a time dimension parameter is added on the basis of a virtual network topology, and a static snapshot sequence diagram is converted into the space-time evolution diagram to describe the topology change process of the satellite network. Adopting a generation mode of topology snapshots with equal time intervals to set the satellite operation period T as [ T [ [ T ] 0 ,t K ]Dividing into K time slots, T ═ τ 1 ,…,τ k ,…,τ K }，τ k ＝[t k-1 ,t k ]，t k-1 And t k Is represented by [ t 0 ,t K ]Two consecutive time instants.
FIG. 2 is a space-time evolution diagram of a satellite network based on a virtual network topology according to an embodiment of the present invention; as shown in fig. 2, the satellite network is represented as a space-time evolution graph G ═ (S, E, T), and a series of static topological subgraphs within a period T are represented as { G ═ G 1 ,G 2 ,...,G K Where S ═ S 1 ,s 2 ,...,s N Denotes a set of satellite nodes, E denotes a set of satellite links in a satellite network, where t k The topological snapshot diagram of the time is shown as G k ＝{S k ,E k FIG. 2 shows three subgraphs, subgraph G 1 I.e. t 1 The satellite network topology of the time comprises satellite nodes s 1 ,s 2 ,...,s 5 (ii) a Wherein the link relationship is satellite s 5 Connecting satellites s 3 Satellite s 3 Connecting satellites s 1 Satellite s 1 Connecting satellites s 2 Satellite s 2 Connecting satellites s 4 (ii) a After different moments, the link of the satellite is transformed, and the process of transforming the link of the satellite and the satellite node can be seen through a dynamic space-time evolution diagram formed by the static snapshot sequence diagram at each moment.
FIG. 3 is a corresponding temporal-spatial evolution diagram of a snapshot-based satellite network according to an embodiment of the present invention; as shown in fig. 3, the spatio-temporal evolution diagram G has K +1 layers, each layer includes N satellite nodes, and there are N (K +1) nodes in total, based on which the topology change process of the time-varying network is simulated.
As shown in FIG. 3, assume that a packet is to be transmitted from a source node s 1 To a destination node s 5 Then the slave S can be found by the space-time evolution diagram G 1 0 To S 5 3 The two routing strategies (dense dotted line and sparse dotted line) during which the data packet can be transmitted.
In step S2, the embodiment of the present invention needs to calculate the attributes of each inter-satellite link, including the inter-satellite link SNR, the link lifetime, and the dynamic utility value of the satellite node cache, based on the state information of the satellite node collected by the controller node in real time;
specifically, firstly, link SNR is quantitatively modeled, according to shannon's theorem, inter-satellite link SNR determines the maximum information rate of error-free reliable transmission of a link, and when the SNR is smaller than a threshold, network transmission is likely to be interrupted, which cannot guarantee the transmission quality of a routing path.
The signal transmission process is modeled as:
wherein, Y ij Representing the final signal, P t Denotes the transmission power, L ij Denotes the inter-satellite distance, gamma denotes the path loss exponent, h ij Is the link loss factor, X i Indicating the strength of the transmitted signal, N ij Is a variance of σ n 2 The additive white Gaussian noise, and the statistical characteristic of the visible laser transmission is represented by a link loss factor h ij The above.
The loss of the laser inter-satellite link in the free space link mainly comprises the geometric loss of a tracking and aiming error receiving end not in the center of a Gaussian beam and the path loss caused by long-distance transmission, and the loss factor h of the link ij Expressed as:
where θ is expressed as the tracking error angle, ω 0 Expressed as the divergence angle half-width of the Gaussian beam, with an inter-satellite laser link distance of L ij (t) of (d). When physical parameters of the satellite nodes are determined, the link loss factor is mainly related to the relative positions of the satellite nodes, and the obeyed probability density function is as follows:
the SNR of the inter-satellite link for satellite i and satellite j at any time t is expressed as:
wherein the instantaneous position L of the satellite s (t)＝[x(t),y(t),z(t)]The method is characterized in that the method is uniquely determined according to the Keplerian orbit parameters of the satellite, and the Euclidean distance of an inter-satellite link can be obtained by using an Euclidean distance formula as follows:
from the distribution law obeyed by h, | h can be deduced ij (t)| 2 A non-central chi-square distribution is followed and has a probability density function of:
when the SNR of the channel is smaller than a given threshold α, the probability of interruption of data during transmission occurs, the inter-satellite link cannot guarantee reliable transmission of data packets, and the interruption event is represented as:
the outage probability for a packet with an SNR threshold of α between satellite i and satellite j is:
in order to ensure the effective transmission of the data packet, a dynamic utility function u(s) of an inter-satellite link attribute SNR at any time t is defined as the probability that the data packet can be successfully transmitted, and is expressed as:
U(s)＝1-P r {SNR ij (t)<α}＝1-p ij (t)
further, the inter-satellite link lifetime is quantitatively modeled, as shown in fig. 4, Δ ω f Two satellites S for establishing inter-satellite links between adjacent orbital planes i,j And S i+1,j Phase difference omega of β The phase angle is corresponding to the orbit polar region with the dimensionality of beta, omega (t) represents the phase angle corresponding to the satellite at the time t, and delta omega (t) is corresponding to the satellite under the conditions of a polar orbit constellation system and a Walker constellation system f The value may be expressed as:
wherein N is L Representing the number of orbital planes, M L Representing the number of satellites in each orbital plane, and F is the phase factor in the Walker constellation. When the satellites at either end of the ISL are at angular velocity v s When the satellite enters the polar region, the ISL is interrupted, and when the satellites at both ends exit the polar region, the link is reestablished, so that the ISL interruption can be pushed outThe duration is:
as shown in FIG. 5, where T r Representing the on-off period of an intermittent ISL, i.e. the time of one satellite revolution around the earth, t b The time when one end of the link enters the polar region is represented, and the calculation method is t b ＝ω β /v s 。
Based on the above analysis, the lifetime function of intermittent ISL can be derived:
defining a dynamic utility function of the survival time of the link at any time t as:
further, the satellite node cache is quantitatively modeled, according to a queuing theory model, the arrival rate of the data packets follows Poisson distribution with the average speed of lambda, A (t) represents the number of the data packets reached in the time period t, and A (t) k t The probability function of (a) is expressed as:
in the process of data transmission, the service time of each data packet is subjected to an independent same distribution function, the distribution function is set as B (t), and v is defined n For the processing time of the nth packet,
V n the process represents packet independent processing time. And D (t) max { n: V n T ≦ t } indicates the number of packets processed by the node during time t, and there are:
P(D(t)＝n)＝B n (t)-B n+1 (t)＝C n (t)
wherein B is n (t) is the n-deconvolution of B (t), then at time t, the packet queue length X (t) can be expressed as:
X(t)＝m+A(t)-D(t)
where m is the remaining number of packets at time t for the receiving satellite node. Solving the processing probability of the current data queue x (t):
when optimizing the data transmission path, the greater the probability of processing the data queue, the more suitable the transmission of the data packet. Therefore, the dynamic utility function of the caching capability of the satellite node is defined as:
it can be understood that, in the embodiment of the present invention, a fixed attribute value in the conventional technology is abandoned, and the inter-satellite link attribute is described as a function of time, and the dynamic utility of each attribute is described by the function of time. The accuracy of the obtained link attribute utility value is improved, and meanwhile, the routing algorithm is more suitable for the dynamic change of the satellite network.
In step S3, a multi-attribute decision-based adaptive maximum dispersion algorithm is used to give a weight to the dynamic utility value of each inter-satellite link attribute, during which the evaluation value of each inter-satellite link attribute needs to be calculated, and a decision matrix is constructed based on each evaluation value of each inter-satellite link attribute; calculating the difference value of each evaluation value in the decision matrix on the current link and other links, and obtaining the total difference value of all attribute parameters among all candidate transmission links; and establishing a target function for maximizing the total separation difference value, and solving the weight value of each inter-satellite link attribute by adopting a Lagrange function.
For how to calculate the evaluation value of each inter-satellite link attribute, the method adopts a multi-attribute utility function to quantitatively evaluate the quality of the inter-satellite link, and designs the multi-attribute utility function to quantitatively evaluate the quality of the inter-satellite link based on each attribute utility function and a multi-attribute utility model in order to accurately quantify the influence of decision attributes such as link SNR, link survival time, satellite node cache and the like on the quality of a routing link. The multi-attribute decision can effectively solve the problem of selecting the optimal alternative scheme under various decision attributes. According to the multi-attribute decision theory, the multi-attribute utility function needs to have the following characteristics:
on the premise of satisfying the above constraints, the utility function capable of evaluating the quality of the inter-satellite link is defined as follows:
wherein z is the influence link l ij The number of reliability decision attributes is determined,
represents a link l ij The epsilon i A decision attribute weight, and
denotes the epsilon i An attribute
The utility value of (c).
Through the analysis of the attribute modeling of the inter-satellite link, utility functions U(s), U (l) and U (b) can be respectively obtained, and the constraint conditions of the multi-attribute utility functions are met. The utility of the link between satellite i and satellite j can be expressed as:
the utility function value of each attribute is between 0 and 1]So the link utility value U ij (x) In [0,1 ]]Within the range of w s ij ，w l ij And w b ij The weights of the link SNR, the link survival time and the node cache decision attribute respectively and satisfy w s ij +w l ij +w b ij 1. While weight assignment is the key to ensure the effectiveness of the utility function, if there is almost no difference in a certain attribute on all feasible links, it means that the attribute has little influence on the decision making process and should be given less weight. If an attribute can make the attribute values of all links deviate greatly, meaning that it plays an important role in decision making and sorting, then it needs to be given a greater weight.
The SDN controller can construct a space-time evolution diagram through a global network topology diagram, determine p reachable paths from a source satellite node s to a destination satellite node d, and represent the set as R (s, d) ═ R 1 ,R 2 ,…,R p Where each reachable path contains g links, the pth reachable path can be denoted as R p ＝{l 1 ,l 2 ,…,l k ,…,l g }. ISL decision Property
Link SNR, Link lifetime and node cache, denoted in order as A 1 ，A 2 And A 3 。
According to the description, each path R is solved based on the adaptive dispersion maximization algorithm by considering that each node in the satellite network is in different states p The specific algorithm steps of the weight of each decision attribute are as follows:
1: according to each decision attribute epsilon i In each link l k Link utility of
Calculating corresponding link attribute evaluation values
2: with each decision attribute epsilon i In each link l k Link utility of the network establishes an initial decision matrix
And establishing an updated decision matrix omega according to the decision attribute weight, which is sequentially represented as:
3: calculate link l k Evaluation value of attribute parameter of (1):
4: calculating attribute parameters
On the link l k And R p Other links l k′ (k ≠ k') dispersion value
Wherein, here, ∈ i Are some specific values, e.g. ε i 1, 2, 3, with
Denotes the epsilon i Individual decision genusIt is understood that epsilon in this embodiment i Is not the same parameter as the satellite representation i. 5: calculating attribute parameters
Total deviation value of (a):
6: calculating the total deviation value e (w) of all the attribute parameters among all the candidate transmission links:
7: establishing an objective function taking the maximum total deviation value of all attribute parameters among all candidate transmission links as an objective:
8: and constructing a corresponding Lagrangian function on the basis of the target function:
according to the method, the maximum total deviation value model is solved through the Lagrange model, and the corresponding optimized value can be rapidly and comprehensively solved.
9: calculating partial derivatives of the Lagrangian function
And
10: let the partial derivative
11: obtaining three weight values corresponding to the three inter-satellite link attributes respectively
In step S4, a weighted satellite network spatio-temporal evolution diagram is constructed according to the weight values of the link attributes in the embodiment of the present invention, and an optimization model U (R (S, d)) of the link utility is established based on an end-to-end reachable path obtained by an evolution diagram model;
specifically, as shown in fig. 3, a path 1 indicated by a dense dotted line and a path 2 indicated by a sparse dotted line, an end-to-end reachable path obtained from a weighted satellite network spatial-temporal evolution map model can be used to establish an optimization model of link utility, and a path selection method is designed. The control plane, before sending the flow rules, the controller will make routing decisions based on the utility of each path. Of the p reachable paths R (s, d) from satellite node s to satellite node d, any given route R p The number of links forming its route is g, for any inter-satellite link l k The utility value of (A) is:
due to the difference of the links, the path formed by the links has different utility. Defining the utility of each path equal to the utility value of the smallest link of all links in the path, and expressing the link utility optimization model as follows:
wherein:
the final controller selects the path with the greatest utility as the packet transmission path, which can be specifically expressed as:
in step S5, the controller node in the embodiment of the present invention selects a transmission path by using a link utility optimization model, and determines a reliable end-to-end transmission path of a satellite. And the controller node calculates the utility value of each path in the candidate path set and takes the path with the maximum utility value as a link transmission optimization path.
In some embodiments, the controller node may utilize a weighted satellite network time-space evolution model, and the designed reliable routing algorithm based on link utility has the following steps:
1: initializing orbit state information of a satellite node;
2: the controller constructs a space-time evolution diagram G (S, E, T) based on the orbit operation rule;
3: from S is determined from G s To S d Is equal to { R [ (s, d) } 1 ,R 2 ,...,R p }；
4: determining a link set of candidate paths: r p (p＝1,2,...,p):R p ＝{l 1 ,l 2 ,...,l k }；
5: for each candidate path, determining a utility value of the link attribute on the reachable path based on a self-adaptive dispersion algorithm;
6, for each link in the candidate path, calculating the link attribute weight according to the link attribute utility and the attribute weight
7: establishing a weighted spatio-temporal evolution diagram based on the link utility value;
8: calculating the utility U (R (s, d)) of each path in the candidate path set;
9: the optimal path is the path with the maximum utility value: MaxU (R) p (s,d))；
10: and obtaining a link transmission optimization path Rp.
The invention can optimize the routing path of the system according to the link state information, thereby improving the network throughput and reducing the packet loss rate, and simultaneously has higher dynamic adaptability.
In the description of the present invention, it is to be understood that the terms "coaxial", "bottom", "one end", "top", "middle", "other end", "upper", "one side", "top", "inner", "outer", "front", "center", "both ends", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are only for convenience of description and simplicity of description, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, are not to be construed as limiting the present invention.
In the present invention, unless otherwise expressly stated or limited, the terms "mounted," "disposed," "connected," "fixed," "rotated," and the like are to be construed broadly, e.g., as meaning fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; the terms may be directly connected or indirectly connected through an intermediate, and may be communication between two elements or interaction relationship between two elements, unless otherwise specifically limited, and the specific meaning of the terms in the present invention will be understood by those skilled in the art according to specific situations.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. A satellite network dynamic routing method based on inter-satellite link attributes is characterized by comprising the following steps:
s1, collecting a series of static snapshot sequence diagrams of the satellite network by the controller node, and constructing a satellite network time-space evolution diagram according to time sequence division, thereby obtaining a continuous dynamic satellite network topology;
s2, respectively calculating link attributes among the satellites, namely link SNR, link survival time and dynamic utility values of satellite cache, based on the state information of the satellite nodes collected by the controller nodes in real time;
the calculation mode of the dynamic utility value of the link SNR in the inter-satellite link attribute comprises the following steps:
U(s)＝1-P r {SNR ij (t)<α}＝1-p ij (t).
wherein, U(s) represents the dynamic utility value of the SNR of the inter-satellite link; SNR ij (t) SNR, P of the inter-satellite link between satellite i and satellite j at any time t r {SNR ij (t)<α represents an interruption event of data during transmission when the SNR of the channel is less than a given threshold α; p is a radical of formula ij (t) represents the outage probability for a packet with an SNR threshold α between satellite i and satellite j;
the calculation mode of the dynamic utility value of the link lifetime in the inter-satellite link attribute comprises the following steps:
wherein U (l) represents a dynamic utility value for link lifetime; l ij (T) is the time-to-live function of the intermittent intersatellite link, T r The on-off period of the intermittent inter-satellite link is represented, namely the time of one circle of the satellite around the earth;
the calculation mode of the dynamic utility value of the satellite cache in the inter-satellite link attribute comprises the following steps:
wherein, U (b) represents the dynamic utility value of the satellite cache;
is the processing probability of the current data queue X (t), and m is the residual number of data packets of the receiving satellite at the time t;
s3, giving a weight to the dynamic utility value of each inter-satellite link attribute by adopting a multi-attribute decision-based adaptive maximum dispersion algorithm, and constructing a weighted satellite network space-time evolution diagram;
s4, acquiring an end-to-end reachable path of the satellite based on the weighted satellite network space-time evolution diagram, and establishing an optimization model of link utility;
and S5, selecting the transmission path by the controller node by using the link utility optimization model, and determining the reliable end-to-end transmission path of the satellite.
2. The method for dynamically routing the satellite network based on the inter-satellite link attribute according to claim 1, wherein the continuous dynamic satellite network topology construction process comprises adding a time dimension on the basis of a virtual network topology according to a space-time evolution theory to construct a satellite network space-time evolution diagram; dividing a satellite operation cycle into a plurality of time slots by adopting a generation mode of topology snapshots with equal time intervals; the satellite nodes and satellite network links are populated in each time slot.
3. The method for dynamically routing the satellite network based on the inter-satellite link attribute according to claim 1, wherein the weighting the dynamic utility value of each inter-satellite link attribute by using the adaptive maximum dispersion algorithm based on the multi-attribute decision comprises:
calculating an evaluation value of each inter-satellite link attribute, and constructing a decision matrix based on each evaluation value of each inter-satellite link attribute;
calculating the difference value of each evaluation value in the decision matrix on the current link and other links, and obtaining the total difference value of all attribute parameters among all candidate transmission links;
and establishing a target function for maximizing the total separation difference value, and solving the weight value of each inter-satellite link attribute by adopting a Lagrange function.
4. The method for dynamically routing the satellite network based on the inter-satellite link attribute according to claim 3, wherein the calculation formula of the estimated value of the inter-satellite link attribute comprises:
wherein, U (x) represents the evaluation value of the link attribute between the satellites; z is the influence link l ij The number of reliability decision attributes;
represents a link l ij The epsilon of i A decision attribute weight, and
denotes the epsilon i An attribute
The utility value of (c).
5. The method for dynamically routing the satellite network based on the inter-satellite link attribute according to claim 3, wherein the representation of the optimization model of the link utility comprises:
wherein U (R (s, d)) represents an optimization model of link utility; r (s, d) represents p reachable paths from satellite s to satellite node d;
is any inter-satellite link l k The utility value of (a) is,
representing inter-satellite links l k The dynamic utility value of the link SNR of (c),
representing inter-satellite links l k The dynamic utility value of the link lifetime of (c),
representing inter-satellite links l k The dynamic utility value of the satellite cache;
weights representing link SNR in inter-satellite link attributes;
a weight representing link lifetime in the inter-satellite link attribute;
representing the weight of satellite cache in the link attribute between the satellites; k denotes an inter-satellite link l k (ii) a g is any given route Rp, the number of links forming its route.
6. The method according to claim 1, wherein the selecting of the transmission path using the link utility optimization model comprises the controller node calculating a utility value of each path in the candidate path set, and using the path with the maximum utility value as the link transmission optimization path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110053197.5A CN112821940B (en) | 2021-01-15 | 2021-01-15 | Satellite network dynamic routing method based on inter-satellite link attribute |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110053197.5A CN112821940B (en) | 2021-01-15 | 2021-01-15 | Satellite network dynamic routing method based on inter-satellite link attribute |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112821940A CN112821940A (en) | 2021-05-18 |
| CN112821940B true CN112821940B (en) | 2022-08-30 |
Family
ID=75869340
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110053197.5A Active CN112821940B (en) | 2021-01-15 | 2021-01-15 | Satellite network dynamic routing method based on inter-satellite link attribute |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112821940B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113543261B (en) * | 2021-05-31 | 2024-04-19 | 北京邮电大学 | Satellite network multipath transmission method and device |
| CN113507412B (en) * | 2021-07-08 | 2022-04-19 | 中国人民解放军国防科技大学 | SRv6 router progressive deployment method, system and storage medium in network interconnection |
| CN113938976B (en) * | 2021-10-20 | 2023-11-07 | 广州新华学院 | Intelligent utility planning passive perception routing algorithm of Internet of things |
| CN113992259B (en) * | 2021-10-22 | 2023-05-16 | 中国人民解放军63921部队 | Method for constructing time slot resource expansion graph |
| CN114050861B (en) * | 2021-11-08 | 2022-08-05 | 中国空间技术研究院 | Method and device for constructing dynamic satellite network model |
| CN114039655B (en) * | 2021-12-08 | 2023-07-25 | 重庆邮电大学 | Inter-satellite route survivability method based on link prediction and region division |
| CN114978275A (en) * | 2022-04-07 | 2022-08-30 | 航天行云科技有限公司 | Low-orbit satellite route processing method and device for inter-satellite rabdosis interruption and satellite |
| CN115276759B (en) * | 2022-06-21 | 2024-02-02 | 重庆邮电大学 | Double-layer satellite network connection plan design method based on weighted space-time diagram |
| CN115133980B (en) * | 2022-07-07 | 2024-08-23 | 中国科学院微小卫星创新研究院 | Method, system and computer readable medium for detecting satellite network node fault |
| CN115412489B (en) * | 2022-11-03 | 2023-01-24 | 中国电子科技集团公司第五十四研究所 | Software-defined satellite network southbound interface control method |
| CN115632701B (en) * | 2022-12-21 | 2023-04-18 | 中南大学 | Low-earth-orbit satellite network data scheduling method, system, equipment and storage medium |
| CN115996081B (en) * | 2022-12-27 | 2023-08-15 | 中国人民解放军军事科学院系统工程研究院 | Communication link attribute analysis method for satellite mobile communication system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014124153A1 (en) * | 2013-02-07 | 2014-08-14 | Interdigital Patent Holdings, Inc. | Method and apparatus for selecting a routing path in a mesh network |
| EP3038323A1 (en) * | 2014-12-26 | 2016-06-29 | Mattias Bergstorm | Method and system for adaptive virtual broadcasting of digital content |
| CN106792970A (en) * | 2017-02-17 | 2017-05-31 | 重庆邮电大学 | A kind of vehicle self-organizing network route selection method |
| CN108989223A (en) * | 2018-06-13 | 2018-12-11 | 昆宇蓝程（北京）科技有限责任公司 | A kind of satellite routing algorithm under strong link constraints |
| CN110995599A (en) * | 2019-11-29 | 2020-04-10 | 电子科技大学 | Satellite self-organizing network route anti-damage method based on link survival time |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209624B (en) * | 2016-07-12 | 2019-06-28 | 哈尔滨工业大学深圳研究生院 | Earth observation satellite network minimal-overhead method for routing based on space-time diagram |
| CN106452555A (en) * | 2016-08-31 | 2017-02-22 | 华东师范大学 | Multi-path optimization algorithm planning method based on medium and low earth orbit satellite network |
| CN109150728B (en) * | 2017-06-27 | 2022-08-23 | 航天恒星科技有限公司 | Air-space information network routing method based on empowerment space-time diagram |
| CN108306829A (en) * | 2018-03-15 | 2018-07-20 | 北京邮电大学 | Based on satellite delay-tolerant network mixed logic dynamic algorithm |
| CN109067453A (en) * | 2018-09-30 | 2018-12-21 | 哈尔滨工业大学（深圳） | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model |
| CN111211828B (en) * | 2019-12-23 | 2022-01-04 | 东方红卫星移动通信有限公司 | Inter-satellite routing method and device for low earth orbit communication satellite constellation |
| CN111356199B (en) * | 2020-03-03 | 2022-05-31 | 重庆邮电大学 | Vehicle-mounted self-organizing network routing method in three-dimensional scene |
| CN111431588B (en) * | 2020-04-28 | 2022-05-31 | 中南大学 | Optical communication constellation network topology generation method and storage medium |
-
2021
- 2021-01-15 CN CN202110053197.5A patent/CN112821940B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014124153A1 (en) * | 2013-02-07 | 2014-08-14 | Interdigital Patent Holdings, Inc. | Method and apparatus for selecting a routing path in a mesh network |
| EP3038323A1 (en) * | 2014-12-26 | 2016-06-29 | Mattias Bergstorm | Method and system for adaptive virtual broadcasting of digital content |
| CN106792970A (en) * | 2017-02-17 | 2017-05-31 | 重庆邮电大学 | A kind of vehicle self-organizing network route selection method |
| CN108989223A (en) * | 2018-06-13 | 2018-12-11 | 昆宇蓝程（北京）科技有限责任公司 | A kind of satellite routing algorithm under strong link constraints |
| CN110995599A (en) * | 2019-11-29 | 2020-04-10 | 电子科技大学 | Satellite self-organizing network route anti-damage method based on link survival time |
Non-Patent Citations (1)
| Title |
|---|
| ATM-based routing in LEO/MEO satellite networks with intersatellite links;M. Werner等;《IEEE Journal on Selected Areas in Communications》;19970131;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112821940A (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112821940B (en) | Satellite network dynamic routing method based on inter-satellite link attribute | |
| CN113572686B (en) | Heaven and earth integrated self-adaptive dynamic QoS routing method based on SDN | |
| Chouhan et al. | Tunicate swarm Grey Wolf optimization for multi-path routing protocol in IoT assisted WSN networks | |
| Han et al. | Time-varying topology model for dynamic routing in LEO satellite constellation networks | |
| CN106921523B (en) | Data transmission method based on GEO/LEO satellite network | |
| CN111629380A (en) | Dynamic resource allocation method for high-concurrency multi-service industrial 5G network | |
| CN112187386B (en) | Network performance evaluation method and system for heaven-earth integrated network | |
| CN114221691A (en) | Software-defined air-space-ground integrated network route optimization method based on deep reinforcement learning | |
| CN114357676B (en) | Aggregation frequency control method for hierarchical model training framework | |
| CN117135090A (en) | Satellite internet flow prediction method, system, equipment and medium based on federal learning framework | |
| CN106452555A (en) | Multi-path optimization algorithm planning method based on medium and low earth orbit satellite network | |
| CN116248164A (en) | Fully distributed routing method and system based on deep reinforcement learning | |
| CN116390164A (en) | Low orbit satellite network trusted load balancing routing method, system, equipment and medium | |
| Seo et al. | Combined time bound optimization of control, communication, and data processing for FSO‐based 6G UAV aerial networks | |
| CN117041129A (en) | Low-orbit satellite network flow routing method based on multi-agent reinforcement learning | |
| Ouyang et al. | Network Coding-Based Multi-Path Transmission for LEO Satellite Networks With Domain Cluster | |
| Liu et al. | Load Balancing Routing Algorithm of Low‐Orbit Communication Satellite Network Traffic Based on Machine Learning | |
| Zhu et al. | CollOR: Distributed collaborative offloading and routing for tasks with QoS demands in multi-robot system | |
| CN110149140A (en) | The retransmission method of satellite opportunistic network | |
| CN116886176A (en) | Predictable inter-satellite routing method based on link utility function | |
| CN114422011B (en) | Low orbit satellite constellation network capacity measuring and calculating method | |
| CN109150728B (en) | Air-space information network routing method based on empowerment space-time diagram | |
| Choi et al. | Latency-Optimal Resource Allocation for UAV-aided LEO Communication | |
| Wu et al. | On-demand Intelligent Routing Algorithms for the Deterministic Networks | |
| CN112399483B (en) | Constraint route control system based on GNs graph predictor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |