CN114884565B - Large-scale low-orbit satellite network topology optimization method based on communication performance constraint - Google Patents
Large-scale low-orbit satellite network topology optimization method based on communication performance constraint Download PDFInfo
- Publication number
- CN114884565B CN114884565B CN202210603427.5A CN202210603427A CN114884565B CN 114884565 B CN114884565 B CN 114884565B CN 202210603427 A CN202210603427 A CN 202210603427A CN 114884565 B CN114884565 B CN 114884565B
- Authority
- CN
- China
- Prior art keywords
- satellite
- motif
- reliability
- city
- network topology
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 85
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000005457 optimization Methods 0.000 title claims abstract description 26
- 238000013461 design Methods 0.000 claims abstract description 26
- 238000012216 screening Methods 0.000 claims abstract description 8
- 230000005540 biological transmission Effects 0.000 claims description 44
- 238000011156 evaluation Methods 0.000 claims description 21
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 7
- 230000003247 decreasing effect Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000015556 catabolic process Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000006731 degradation reaction Methods 0.000 description 2
- 239000000047 product Substances 0.000 description 2
- 108091092878 Microsatellite Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 230000006872 improvement Effects 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
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012876 topography Methods 0.000 description 1
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
- 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/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- 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/1851—Systems using a satellite or space-based relay
- H04B7/18517—Transmission equipment in earth stations
-
- 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/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- 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)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Relay Systems (AREA)
Abstract
A large-scale low orbit satellite network topology optimization method based on communication performance constraint comprises the following steps of: representing a satellite communication system topology by a weighted undirected graph; step 2: performing satellite network topology design according to a repeatable unit (motif); step 3: analyzing and evaluating the communication performance of the system according to the communication time delay, the capacity, the survivability and the reliability; step 4: acquiring a satellite network topology optimization model based on communication performance constraint on the basis of the step 3; step 5: and screening the optimal satellite network topology structure according to the optimization model.
Description
Technical Field
The invention belongs to the field of satellite communication, and particularly relates to a large-scale low-orbit satellite network topology optimization method based on communication performance constraint.
Background
Compared with the traditional ground communication system, the satellite communication system has the advantages of wide coverage, no influence of the topography factors and the like, and can be an effective supplement of the ground communication system. With the rise of microsatellite networks, low-orbit satellite constellations are expected to provide low-latency and high-capacity communication services worldwide, so that low-orbit satellite communication systems are hot spots for research and development.
Currently, the size of the low orbit satellite constellation tends to be enlarged, for example, the Starlink constellation of SpaceX company predicts that the number of satellites in the constellation will reach tens of thousands after deployment is completed. In a large-scale low orbit satellite communication system, the design of a satellite network topology structure has very important research significance. Firstly, an inter-satellite link connection mode of a satellite network topology has an important influence on the communication performance of a satellite system; secondly, frequent switching and maintenance of inter-satellite links will increase overhead; finally, the expansion of the constellation size enables the constellation network design.
Through the search of the prior literature, the satellite network topology based on the Grid model is widely used in the design of the satellite network topology, and in the model, each satellite only establishes links with two satellites adjacent to the same orbit plane and two satellites adjacent to the different orbit plane. However, in a large-scale low-orbit satellite constellation, since the number of visible satellites per satellite increases, the satellite network design scheme based on the Grid model cannot guarantee the optimality of the system in terms of the number of transmission hops.
It has also been found through searching that in the document "a.network topology design at27,000 km/hour", debopam et al forms a satellite network topology by filling repeatable units (motif) into the satellite constellation, and selects the optimal motif to implement the satellite network topology design according to the end-to-end path distance stretching and the evaluation of the number of transmission hops. The scheme improves the limitation of the topology design method based on the Grid model on the transmission hop count performance of the system, but lacks consideration and analysis on other performances of the system.
The above-mentioned technique has the following problems: when a plurality of ground terminals have communication requirements at the same time, reasonable allocation of link bandwidth resources is not realized through topology structure setting, and the system capacity is difficult to guarantee; when a satellite node fails, the influence of the failed node on the communication quality of the system is reduced as far as possible without topological structure design, and the system destructiveness is difficult to ensure; when satellites move, the distance and pitch angle between the satellites also change, the stability of the corresponding inter-satellite links also changes along with the change of the distance length and pitch angle, and the influence of the stability of the inter-satellite links on the reliability of a system transmission path is not fully considered by the existing topology design method. Therefore, the satellite network topology optimization method based on communication performance constraint is provided, and has important significance for improving system capacity, survivability and reliability.
Disclosure of Invention
Aiming at the problems existing in the prior art, the invention aims to provide a large-scale low-orbit satellite network topology optimization method based on communication performance constraint. The improvement of the communication performance of the system is realized through the optimization of the topological structure.
The invention aims to realize the method for optimizing the large-scale low-orbit satellite network topology based on the communication performance constraint, which comprises the following steps:
step 1: the satellite communication system topology is represented by weighted undirected graph.
Step 2: satellite network topology design is performed according to repeatable unit (motif) based.
Step 3: and analyzing and evaluating the communication performance of the system according to the communication time delay, the capacity, the survivability and the reliability.
Step 4: and (3) acquiring a satellite network topology optimization model based on communication performance constraint on the basis of the step (3).
Step 5: and screening the optimal satellite network topology structure according to the optimization model.
The step 1 of the invention comprises the following steps:
the topology of the satellite communication system is represented by a weighted undirected graph G= { V, E }, wherein V= { Sats, city } represents a node set and consists of a satellite node set Sats and a ground City terminal node set City; e= { E isl ,E udl The edge set is represented by inter-satellite link set E isl Satellite-to-ground link set E udl The composition, the weight of an edge represents the distance length of the link.
Using undirected graph u= { Sats, E isl The satellite network topology is represented by the three parts corresponding to the satellite constellation, ground city terminals and satellite-ground links in the satellite communication system, and the satellite communication system topology is represented as
G＝{V,E}＝{U,City,E udl }
The step 2 of the invention comprises the following steps:
step 2-1: screening all repeatable units motif according to the star-earth visibility to form motif set Motifs
Step 2-2: filling all elements in the set Motifs into constellations to form a satellite network topology candidate set U Motifs ：
U Motifs ＝{U motif |motif∈Motifs}
Wherein U is motif And representing the corresponding satellite network topology after the constellation is filled by the motif.
step 3-1: according to satellite communication system topology G motif ＝{U motif ,City,E udl Acquiring transmission paths between all ground City terminals, and representing paths between any two cities A, B E City as
Path(A,B)＝{l 1 (A,B),l 2 (A,B),…,l K (A,B)}
Wherein l k (a, B), (k=1, 2, …, K) represents the kth link traversed by the path between the urban pair (a, B).
Step 3-2: distance stretching of passing path and communication delay performance tau of transmission hop number average value to system motif Evaluation was performed:
τ motif ＝S motif +H motif
wherein S is motif ,H motif Respectively represent the distance stretching mean value and the transmission hop number mean value of the end-to-end paths, namely
Wherein Path (A, B) represents the transmission Path between any city pair (A, B), N city_pairs The number of City pairs formed by any two cities in the ground City set City is represented, S (Path (A, B)) represents the distance stretching of a transmission Path between the City pairs (A, B), namely the ratio of the total distance of the transmission Path between the City pairs to the great circle distance, and the larger the stretching is, the longer the transmission Path distance is, the larger the required propagation delay is; h (Path (a, B)) represents the number of transmission hops between the urban pairs (a, B), the more hops the longer the on-board data processing delay is required.
Step 3-3: when communication requirements exist between all ground cities, the total bandwidth of all transmission paths is used for controlling the capacity I of the communication system motif Evaluation was performed:
where I (A, B) represents the transmission path bandwidth between the city pairs (A, B), determined by the minimum of bandwidth resources into which all links making up the path are divided, i.e.
where
l k (A,B)∈Path(A,B)
Wherein the method comprises the steps of
Representing link l k (a, B) is allocated to the maximum bandwidth for communication between the urban pair (a, B).
Step 3-4: system survivability Q by distributing uniformity of times of satellite node transmitted path motif Evaluation was performed:
wherein the method comprises the steps of
Variance indicating the number of times a satellite node is passed by a transmission path, < >>
Representation->
Is a decreasing function of (2). If a satellite s is traversed by the shortest path between too many city pairs, the quality of communication between all city pairs traversing the node will be affected when the node fails. Thus->
The smaller the satellite nodes are, the more uniform the number of times the satellite nodes are passed through by the transmission paths, the less urban pairs of satellite faults will have an effect on the quality of communication, and the more robust the system will be.
Step 3-5: reliability R of system by reliability mean of transmission path motif Evaluation is carried out, i.e.
Where R (A, B) represents the reliability of the path, which is the product of the reliability of all links in the path, i.e
Wherein the method comprises the steps of
Representing link l k Reliability of (A, B), distance reliability R of link l, determined by distance reliability and pitch angle reliability l (d) Acquisition based on inter-satellite link distance d
Wherein d is isl_max Represents the maximum distance of the inter-satellite links, the pitch reliability R of the link l l (beta) acquisition from pitch angle beta between satellites
Wherein beta is max Which represents the maximum scan range of the satellite antenna. Reliability of link l is obtained from distance reliability and pitch reliability
Wherein m is a weight coefficient between 0 and 1.
The step 4 of the invention comprises the following steps:
taking the communication time delay index as a target cost function, taking the capacity, the survivability and the reliability of the system as constraint conditions, and obtaining an optimization model of satellite network topology design:
wherein delta I ,δ Q ,δ R Constraint thresholds respectively representing system capacity, survivability and reliability, and the system capacity, survivability and reliability corresponding to the designed satellite network topology structure are respectively not lower than delta I ,δ Q ,δ R And at the same time has minimal communication latency.
The step 5 of the invention comprises the following steps:
step 5-1: the set U acquired in step 2 Motifs In the step (2), eliminating the topological structure of which the system performance does not meet the constraint condition in the step (4) to obtain a new set U '' Motifs 。
Step 5-2: in the new set U' Motifs Selecting a topology structure with the smallest communication time delay
And realizing the topology design of the satellite network.
In summary, the beneficial effects of the invention are as follows: static topology design is realized through the selection of motif, so that the switching cost of the system to the inter-satellite links is effectively reduced; in the topology optimization process, the satellite communication system performance is analyzed and evaluated from four aspects of system communication delay, capacity, survivability and reliability, and the satellite network topology structure is analyzed and optimized by the indexes. Compared with the prior art, the method and the device can optimize the satellite network topology structure through the constraint of the communication performance, thereby improving the capacity, the survivability, the reliability and other related performances of the satellite communication system.
Drawings
FIG. 1 is a flow chart of a large scale low orbit satellite network topology optimization based on communication performance constraints.
Fig. 2 is a block diagram of a large-scale low-orbit satellite communication system scenario.
Fig. 3 is a schematic diagram of the motif structure.
Fig. 4 is a motif structure selection flowchart.
Fig. 5 is a flow chart of a design of a satellite network topology based on motif.
Fig. 6 is a graph of evaluation results of the system path distance stretching.
Fig. 7 is a diagram of the evaluation result of the number of transmission hops of the system path.
Fig. 8 is a diagram of the evaluation result of the system capacity.
Fig. 9 is a statistical graph of variance of the number of times a satellite node is traversed by a path.
Fig. 10 is a diagram of the evaluation result of the system reliability.
FIG. 11 is a schematic diagram of a motif structure corresponding to an optimal topology
Figure 12 is a graph of satellite system performance versus different topology schemes.
Detailed Description
The present invention will be described in further detail with reference to the following examples in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific examples described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The invention provides a large-scale low-orbit satellite network topology optimization method based on communication performance constraint through analysis and evaluation of a system, and the method can improve the capacity, the survivability and the reliability of the system through the design of a satellite network topology structure.
As shown in fig. 1, a method for optimizing a large-scale low-orbit satellite network topology based on communication performance constraint comprises the following steps:
s101: the satellite communication system topology is represented by weighted undirected graph.
S102: satellite network topology design is performed according to repeatable unit (motif) based.
S103: and analyzing and evaluating the communication performance of the system according to the communication time delay, the capacity, the survivability and the reliability.
S104: and (3) acquiring a satellite network topology optimization model based on communication performance constraint on the basis of the step (3).
S105: and screening the optimal satellite network topology structure according to the optimization model.
The principle of application of the invention is described in detail below with reference to the accompanying drawings and examples.
As shown in fig. 2, the application scenario of the embodiment of the present invention is a satellite communication system based on a large-scale low-orbit constellation, the system is composed of three parts, namely a satellite constellation, an urban ground station and a satellite-ground link, the satellite constellation is set as a satellite constellation deployed in the first stage of Starlink, the constellation has 24 orbit planes, each orbit plane has 66 satellites, the orbit inclination angle is 53 °, the orbit height is 550km, and the phase factor is 1. Ground city stations are set to the top 100 cities with the largest population across the world. The satellite-to-ground link is determined according to the satellite-to-ground visibility, on the premise that the satellite-to-ground visibility is met, each city selects the satellite with the shortest satellite-to-ground distance to establish the inter-satellite link, and on the premise that the inter-satellite visibility is met, the maximum number of the allowed inter-satellite links is 4. When the communication demand exists, the system data transmission flow is as follows, 1) the city firstly transmits the data to the access star through the satellite-to-ground link; 2) The transmitting city access satellite transmits data to the receiving city access satellite through an inter-satellite link; 3) The receiving city access satellite transmits data to the receiving city.
The method for optimizing the topology of the large-scale low-orbit satellite network based on the communication performance constraint provided by the embodiment of the invention comprises the following steps:
step 1: by weighted undirected graph g= { V, E } = { U, city, E udl The satellite communication system topology is represented by V= { Sats, city } which represents a node set composed of a satellite node set Sats and a ground City terminal node set City, and the satellite node set is represented as
Sats＝{(m,n)|m＝1,…,24；n＝1,…,66}
Wherein (m, n) respectively represent the nth satellite node in the mth orbit, and the city set is represented as
City＝{city|city＝1,…,100}
Where city denotes the city number. E= { E isl ,E udl The edge set, inter-satellite link set E isl Acquired through satellite network topology design, satellite-ground link set E udl Based on the satellite-to-ground visibility determination, the satellite-to-ground visibility is satisfiedOn the premise of visibility, each city selects the satellite with the shortest satellite-to-ground distance to establish an inter-satellite link, and the weight of the side represents the distance length of the link. U denotes the satellite network topology.
Step 2: selecting a repeatable unit set Motifs based on inter-satellite visibility relation, and acquiring a satellite network topology design scheme set U according to the repeatable unit Motifs ：
Step 2-1: screening all repeatable units motif according to the visibility of the satellite and the ground to form a motif set Motifs.
Referring to fig. 3, the motif structure is composed of three satellites and two inter-satellite links, in which, satellite a is a reference satellite, satellite B and satellite C are any two visible satellites with satellite a, and there is an inter-satellite link between satellite a and the two visible satellites. Therefore, the relative orbit offset and orbit offset of the satellites B and C can be used to represent the motif,
motif＝{(x B ,y B ),(x C ,y C )}
wherein (x) · ,y · ) The relative offset of the orbit of the satellite and the relative offset of the satellite on the orbit surface are shown.
Referring to fig. 4, when a motif is selected, first, one satellite a near the equator is selected as a reference satellite, and then all visible satellites of the satellite a are acquired; and finally, selecting a satellite B from the visible satellites, establishing an inter-satellite link with a satellite C to form a motif topological structure, and ensuring that three satellites cannot be positioned in the same track plane in the selection process. In the Starlink scenario, the maximum distance of the inter-satellite links is 5014km according to the visibility analysis.
Because the satellite distance near the equator is the largest, the inter-satellite links in the motif obtained according to the above procedure always satisfy the inter-satellite visibility relationship within the satellite operation period. All Motifs selected according to the method described in fig. 4 constitute a repeatable unit collection Motifs, which in the present example contains a total of 632 Motifs.
Step 2-2: filling all elements in the set Motifs into constellations to form a satellite network topology candidate set U Motifs ：
U Motifs ＝{U motif |motif∈Motifs}
Wherein U is motif And representing the corresponding satellite network topology after the constellation is filled by the motif.
The detailed flow is that each satellite in a constellation is sequentially used as a reference satellite, an inter-satellite link is established according to a topological structure, the number of links of the satellite A is firstly judged before the inter-satellite link of the satellite A and the satellite B is established, if the satellite A or the satellite B has 4 inter-satellite links, the link establishment process of the satellite A and the satellite B is skipped, and also, before the inter-satellite link of the satellite A and the satellite C is established, the number of links of the satellite A is firstly judged, and if the satellite A or the satellite C has 4 inter-satellite links, the link establishment process of the satellite A and the satellite C is skipped.
Step 3: for different satellite network topologies U in step 2 motif ∈U Motifs The communication delay, capacity, anti-destruction performance and reliability of the system are evaluated:
step 3-1: according to satellite communication system topology G motif ＝{U motif ,City,E udl Obtaining the shortest path between all City terminals of the ground through Dijsktra algorithm, and the path between any two cities A, B E City is expressed as
Path(A,B)＝{l 1 (A,B),l 2 (A,B),…,l K (A,B)}
Wherein l k (a, B), (k=1, 2, …, K) represents the kth link traversed by the path between the urban pair (a, B).
Step 3-2: distance stretching of passing path and communication delay performance tau of transmission hop number average value to system motif Evaluation was performed:
τ motif ＝S motif +H motif
wherein S is motif ,H motif Respectively represent the distance stretching mean value and the transmission hop number mean value of the end-to-end paths, namely
Wherein N is city_pairs The number of City pairs formed by any two cities in the ground City set City is represented, and S (Path (A, B)) represents the distance stretch of the transmission Path between the City pairs (A, B); h (Path (a, B)) represents the number of transmission hops between the city pairs (a, B).
Referring to fig. 6, the range of the horizontal axis of fig. 6 is 1,2, … …,632, and the horizontal axis value i represents the ith motif in the set Motifs, and the vertical axis value represents the padding of the motif to form a satellite network topology U, corresponding to the motif number in the set Motifs motif Time system transmission path distance stretching evaluation index S motif 。
Referring to fig. 7, the horizontal axis range of fig. 7 is 1,2, … …,632, and corresponds to the number of Motifs in the set Motifs, the horizontal axis value i represents the ith motif in the set Motifs, and the vertical axis value represents the padding of the motif to form a satellite network topology U motif Hop count evaluation index H of time system transmission path motif 。
Step 3-3: when communication requirements exist between all ground cities, the total bandwidth of all transmission paths is used for controlling the capacity I of the communication system motif Evaluation was performed:
where I (A, B) represents the transmission path bandwidth between the city pairs (A, B), determined by the minimum of bandwidth resources into which all links making up the path are divided, i.e.
where
l k (A,B)∈Path(A,B)
Wherein the method comprises the steps of
Representing link l k (A, B) is allocated to the maximum bandwidth for communication between the urban pair (A, B), and in an embodiment each link can provide a transmission bandwidth of 5Gbps.
Referring to fig. 8, the horizontal axis range of fig. 8 is 1,2, … …,632, and corresponds to the number of Motifs in the set Motifs, the horizontal axis value i represents the ith motif in the set Motifs, and the vertical axis value represents the padding of the motif to form a satellite network topology U motif Capacity index I of time system motif 。
Step 3-4: system survivability Q by distributing uniformity of times of satellite node transmitted path motif Evaluation was performed:
wherein the method comprises the steps of
Representing the variance of the number of times a satellite node has been traversed by a transmission path. When->
The smaller the satellite nodes are, the more uniform the number of times the satellite nodes are passed through by the transmission paths, the less urban pairs of satellite faults will have an effect on the quality of communication, and the more robust the system will be.
Evaluation basis for system destruction resistance
Referring to fig. 9, the horizontal axis ranges of fig. 9 are 1,2, … …,632, and the horizontal axis value i represents the ith motif in the set Motifs, and the vertical axis value represents the motif filling to form the satellite network topology U corresponding to the motif number in the set Motifs motif The variance of the number of times the satellite node is traversed by the transmission path.
Step 3-5: reliability R of system by reliability mean of transmission path motif Evaluation is carried out, i.e.
Where R (A, B) represents the reliability of the path, which is the product of the reliability of all links in the path, i.e
Wherein the method comprises the steps of
Representing link l k Reliability of (A, B), distance reliability R of link l, determined by distance reliability and pitch angle reliability l (d) Acquisition based on inter-satellite link distance d
Wherein d is isl_max Represents the maximum distance of the inter-satellite links, the pitch reliability R of the link l l (beta) acquisition from pitch angle beta between satellites
Wherein beta is max Which represents the maximum scan range of the satellite antenna. Reliability of link l is obtained from distance reliability and pitch reliability
Referring to fig. 10, the horizontal axis range of fig. 10 is 1,2, … …,632, and corresponds to the number of Motifs in the set Motifs, the horizontal axis value i represents the ith motif in the set Motifs, and the vertical axis value represents the padding of the motif to form a satellite network topology U motif Reliability index R of time system motif 。
Taking the communication time delay index as a target cost function, taking the capacity, the survivability and the reliability of the system as constraint conditions, and obtaining an optimization model of satellite network topology design:
wherein delta I ,δ Q ,δ R Constraint thresholds respectively representing the system capacity, the survivability and the reliability are respectively 1600Gbps, -500 and 0.8.
Step 5: and screening the optimal satellite network topology structure according to the optimization model.
Step 5-1: the set U acquired in step 2 Motifs In the step (2), eliminating the topological structure of which the system performance does not meet the constraint condition in the step (4) to obtain a new set U '' Motifs 。
Step 5-2: in the new set U' Motifs Selecting a topology structure with the smallest communication time delay
And realizing the topology design of the satellite network.
Step 5.2 obtaining a satellite network topology
Corresponding motif * The repeatable unit structure is shown in FIG. 11, and is represented by the structure
motif * ＝{(1,-6),(2,2)}
Fig. 12 compares the effects of the three schemes of the Grid model-based satellite network topology design (scheme 1), the Motif-based topology design (scheme 2) proposed by Debopam et al, and the communication performance constraint-based large-scale low-orbit satellite network topology optimization (scheme 3) provided by this patent on the communication performance. Referring to fig. 12, in comparison with scheme 1, scheme 3 has a significant optimization of other communication performance indicators, except for degradation of system reliability and delay stretching performance; compared with scheme 2, scheme 3 has 1.3% degradation in delay performance, but the system capacity is optimized by 24.4%, the system survivability is optimized by 25.5%, and the reliability is optimized by 6.25%. The method and the system verify that the large-scale low-orbit satellite network topology optimization based on the communication performance constraint can effectively improve the capacity, the survivability and the reliability of a satellite communication system.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the invention.
Claims (2)
1. A large-scale low orbit satellite network topology optimization method based on communication performance constraint is characterized by comprising the following steps:
step 1: representing a satellite communication system topology by a weighted undirected graph;
step 2: performing satellite network topology design according to a repeatable unit (motif);
step 3: analyzing and evaluating the communication performance of the system according to the communication time delay, the capacity, the survivability and the reliability;
step 4: acquiring a satellite network topology optimization model based on communication performance constraint on the basis of the step 3;
step 5: screening an optimal satellite network topology structure according to the optimization model;
step 1, representing the topology of a satellite communication system through a weighted undirected graph G= { V, E }, wherein V= { Sats, city } represents a node set, and consists of a satellite node set Sats and a ground City terminal node set City; e= { E isl ,E udl The edge set is represented by inter-satellite link set E isl Satellite-to-ground link set E udl The composition, the weight of the edge represents the distance length of the link; using undirected graph u= { Sats, E isl And the satellite network topology is represented, and the satellite network topology corresponds to satellite communicationThe satellite communication system topology is expressed as G= { V, E } = { U, city, E udl }；
Step 2 comprises the following sub-steps:
step 2-1: screening all repeatable units motif according to the visibility of the satellite and the ground to form a motif set Motifs;
step 2-2: filling all elements in the set Motifs into constellations to form a satellite network topology candidate set U Motifs ：
U Motifs ＝{U motif |motif∈Motifs}
Wherein U is motif Representing the corresponding satellite network topology after the constellation is filled by motif;
step 3-1: according to satellite communication system topology G motif ＝{U motif ,City,E udl Acquiring transmission paths between all ground City terminals, and representing paths between any two cities A, B E City as
Path(A,B)＝{l 1 (A,B),l 2 (A,B),…,l K (A,B)}
Wherein l k (a, B), (k=1, 2, …, K) represents the kth link traversed by the path between the urban pair (a, B);
in step 3-2, the communication delay performance tau of the system is obtained by the distance stretching of the satellite-ground link path and the transmission hop number average value motif Evaluation was performed:
τ motif ＝S motif +H motif
wherein S is motif ,H motif Respectively represent the distance stretching mean value and the transmission hop number mean value of the end-to-end paths, and are expressed as follows
Wherein Path (A, B) represents the transmission Path between any city pair (A, B), N city_pairs Representing the number of City pairs consisting of any two cities in the ground City set City, and S (Path (A, B)) represents a CityStretching the distance of the transmission path between the pairs (A, B), namely the ratio of the total distance of the transmission path between the city pairs to the great circle distance; h (Path (a, B)) represents the number of transmission hops between the urban pairs (a, B);
in step 3-3, the capacity I of the communication system is determined by the total bandwidth of the transmission path when there is a communication demand between all of the ground cities motif Evaluation was performed:
where I (A, B) represents the transmission path bandwidth between the city pairs (A, B), determined by the minimum of bandwidth resources into which all links making up the path are divided, i.e.
where
l k (A,B)∈Path(A,B)
Wherein the method comprises the steps of
Representing link l k (a, B) being allocated to a maximum bandwidth for communication between the urban pairs (a, B);
in step 3-4, the survivability Q of the system is obtained by the distribution uniformity degree of the times of the satellite nodes passing through the transmission paths motif Evaluation was performed:
wherein the method comprises the steps of
Variance indicating the number of times a satellite node is passed by a transmission path, < >>
Representation->
A decreasing function of (2);
in step 3-5, the reliability R of the system is determined by the reliability average value of the transmission path motif Evaluation is carried out, i.e.
Wherein R (A, B) represents the reliability of the path, which is the product of the reliability of all links in the path; i.e.
Wherein the method comprises the steps of
Representing link l k Reliability of (A, B), distance reliability R of link l, determined by distance reliability and pitch angle reliability l (d) Acquisition based on inter-satellite link distance d
Wherein d is isl_max Represents the maximum distance of the inter-satellite links, the pitch reliability R of the link l l (beta) acquisition from pitch angle beta between satellites
Wherein beta is max Which represents the maximum scan range of the satellite antenna; reliability of link l is obtained from distance reliability and pitch reliability
Wherein m is a weight coefficient between 0 and 1;
step 4, taking the communication time delay index as a target cost function, taking the capacity, the survivability and the reliability of the system as constraint conditions, and obtaining an optimization model of satellite network topology design:
wherein delta I ,δ Q ,δ R Constraint thresholds respectively representing system capacity, survivability and reliability, and the system capacity, survivability and reliability corresponding to the designed satellite network topology structure are respectively not lower than delta I ,δ Q ,δ R And at the same time has minimal communication latency.
2. The method for optimizing the topology of a large-scale low-orbit satellite network based on communication performance constraints according to claim 1, wherein the method comprises the following steps: step 5 comprises the following steps:
step 5-1: the set U acquired in step 2 Motifs In the step (2), eliminating the topological structure of which the system performance does not meet the constraint condition in the step (4) to obtain a new set U '' Motifs ；
Step 5-2: in the new set U' Motifs Selecting a topology structure with the smallest communication time delay
And realizing the topology design of the satellite network. />
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210603427.5A CN114884565B (en) | 2022-05-30 | 2022-05-30 | Large-scale low-orbit satellite network topology optimization method based on communication performance constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210603427.5A CN114884565B (en) | 2022-05-30 | 2022-05-30 | Large-scale low-orbit satellite network topology optimization method based on communication performance constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114884565A CN114884565A (en) | 2022-08-09 |
| CN114884565B true CN114884565B (en) | 2023-05-09 |
Family
ID=82679055
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210603427.5A Active CN114884565B (en) | 2022-05-30 | 2022-05-30 | Large-scale low-orbit satellite network topology optimization method based on communication performance constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114884565B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116883704B (en) * | 2023-06-27 | 2024-05-03 | 中国空间技术研究院 | Giant constellation collaborative earth observation task planning optimization method, equipment and medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111198905A (en) * | 2018-11-19 | 2020-05-26 | 富士施乐株式会社 | Visual analytics framework for understanding missing links in bipartite networks |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299713A (en) * | 2008-03-21 | 2008-11-05 | 哈尔滨工业大学深圳研究生院 | Method for setting multilayer satellite network system route |
| GB2536606A (en) * | 2014-11-28 | 2016-09-28 | Aria Networks Ltd | Network topology optimization |
| US20210157312A1 (en) * | 2016-05-09 | 2021-05-27 | Strong Force Iot Portfolio 2016, Llc | Intelligent vibration digital twin systems and methods for industrial environments |
| CN109275171B (en) * | 2018-10-17 | 2022-07-12 | 珠海云洲智能科技股份有限公司 | Wireless ad hoc network communication method and device |
| CN112532296B (en) * | 2020-11-12 | 2022-04-15 | 西安电子科技大学 | Large-scale satellite network construction method based on elliptical satellite coverage |
-
2022
- 2022-05-30 CN CN202210603427.5A patent/CN114884565B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111198905A (en) * | 2018-11-19 | 2020-05-26 | 富士施乐株式会社 | Visual analytics framework for understanding missing links in bipartite networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114884565A (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | A load balancing routing strategy for LEO satellite network | |
| Sheng et al. | 6G service coverage with mega satellite constellations | |
| CN113315569B (en) | Satellite reliability routing method and system with weighted link survival time | |
| CN108076486A (en) | A kind of dynamic radio resource allocation algorithm based on load balancing | |
| CN114884565B (en) | Large-scale low-orbit satellite network topology optimization method based on communication performance constraint | |
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| CN115276756B (en) | Low orbit satellite constellation optimization design method for guaranteeing service quality | |
| CN109889255A (en) | A kind of satellite network reconstructing method based on improvement ant colony algorithm | |
| CN103269245A (en) | Method for correlating space-based data network users and GEO satellites | |
| CN104038946A (en) | Partially-overlapped channel allocation method for multicast of wireless mesh network | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN113949412A (en) | Optimization method of high-speed power line carrier communication network | |
| CN117651303A (en) | Main and auxiliary hybrid control satellite-borne edge cloud computing and unloading method and system | |
| CN106973015A (en) | A kind of middle voltage distribution networks power line carrier communication routing algorithm | |
| CN103595652B (en) | The stage division of QoS efficiency in a kind of powerline network | |
| Ning et al. | Load-balancing routing algorithm against inter-satellite link congestion in LEO satellite optical networks | |
| CN112737638B (en) | Incremental routing method and system for reliability of power line communication | |
| Tengyue et al. | Design of LEO/MEO double-layer satellite network | |
| CN114697222B (en) | Survivability virtual network mapping algorithm based on space-time-ground fusion network | |
| Wang et al. | Effect of rain attenuation on the availability of LEO satellite communication system | |
| Li et al. | Research on Power Line Carrier Communication Routing Adapted to the Internet of Things | |
| CN113572690B (en) | Data transmission method for reliability-oriented electricity consumption information acquisition service | |
| CN115801593B (en) | Walker constellation-oriented capacity maximization topological structure design method | |
| Shi | Service Flow Differentiated Priority-driven Power Line Carrier Routing Algorithm | |
| CN115833899B (en) | Virtual network function deployment and route joint optimization method in spatial information network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |