CN115051749A - Automatic network topology design method and related equipment for satellite networking - Google Patents

Automatic network topology design method and related equipment for satellite networking Download PDF

Info

Publication number
CN115051749A
CN115051749A CN202210971617.2A CN202210971617A CN115051749A CN 115051749 A CN115051749 A CN 115051749A CN 202210971617 A CN202210971617 A CN 202210971617A CN 115051749 A CN115051749 A CN 115051749A
Authority
CN
China
Prior art keywords
satellite
network
network topology
link
coding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210971617.2A
Other languages
Chinese (zh)
Other versions
CN115051749B (en
Inventor
高圆圆
王伟志
张钦宇
廖小丽
王野
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Peng Cheng Laboratory
Original Assignee
Peng Cheng Laboratory
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Peng Cheng Laboratory filed Critical Peng Cheng Laboratory
Priority to CN202210971617.2A priority Critical patent/CN115051749B/en
Publication of CN115051749A publication Critical patent/CN115051749A/en
Application granted granted Critical
Publication of CN115051749B publication Critical patent/CN115051749B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851Systems using a satellite or space-based relay
    • H04B7/18519Operations control, administration or maintenance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/12Computing arrangements based on biological models using genetic models

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Biophysics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Biology (AREA)
  • Computational Linguistics (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Genetics & Genomics (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Signal Processing (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Astronomy & Astrophysics (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses an automatic network topology design method facing satellite networking and related equipment, wherein the method comprises the following steps: acquiring basic constellation information, abstracting and coding a satellite network, determining key indexes and calculation functions in the topological design of the satellite network, and converting coding individuals into the input of the calculation functions; generating a legal high-quality initial population based on prior experience; completing iteration and convergence processes based on a single-target or multi-target genetic algorithm, and selecting a proper topological structure in an optimal solution set; the method is based on the regularity of the satellite constellation and the prior experience of the topological design of the satellite constellation, abstract mapping and simplified coding are carried out on the satellite constellation, the calculation complexity of a genetic algorithm in the automatic design process is greatly reduced, meanwhile, the convergence speed is remarkably improved through the generation of a high-quality initial population, and the problem of network scale limitation caused by the influence of the calculation complexity on network topological planning and optimization algorithms is solved.

Description

Automatic network topology design method and related equipment for satellite networking
Technical Field
The invention relates to the technical field of satellite network communication processing, in particular to an automatic network topology design method, a terminal and a computer readable storage medium for satellite networking.
Background
The satellite network topology design is an important work in the satellite network design process, and with the increase of the satellite network scale, the efficiency of the manual network topology design is lower and lower, and the performance cannot be guaranteed.
With the increase of the satellite network scale, in the process of seeking the optimal solution of the network topology, more and more network topology structures need to be traversed, and a great amount of time is consumed. Under the condition of limited design time, a local optimal solution can only be searched for in a large probability, and the optimal performance of the designed network topology cannot be ensured. In the existing network topology design method, mechanisms such as a genetic algorithm, an ant colony algorithm, an annealing algorithm and the like are introduced, but because the calculated amount of the algorithms grows exponentially along with the increase of the number of network nodes, the network scale is basically limited to dozens of to 200, and the topology design problem of a large-scale satellite network cannot be solved.
Accordingly, the prior art is yet to be improved and developed.
Disclosure of Invention
The invention mainly aims to provide a satellite-networking-oriented automatic network topology design method, a terminal and a computer-readable storage medium, and aims to solve the problem that network scale is limited due to the fact that a network topology planning and optimization algorithm is influenced by calculation complexity in the prior art.
In order to achieve the above object, the present invention provides an automatic network topology design method for satellite networking, which comprises the following steps:
calculating the farthest track number which can be connected with each satellite node in the constellation based on the created constellation and the farthest communication distance and the communication range of the optical transceiver carried by each satellite node;
calculating ephemeris of each satellite in a satellite constellation, performing time slicing on a constellation operation cycle, calculating a link distance between each satellite and a satellite node keeping communication in each time slice, and using the link distance as a weight of a communication link as input for calculating a satellite network communication distance and communication time delay in each time slice;
determining a coding mode and a coding length based on the number of satellite nodes on each satellite orbit and the maximum orbit number which can be communicated by each satellite node, coding to obtain a coding sequence, and performing link configuration and weight calculation on all satellites on the orbits according to the coding sequence;
determining a network performance index which needs to be considered during satellite network topology design, and determining a calculation mode of the network performance index;
converting the coding sequence into an inter-satellite link type in a satellite constellation, corresponding to link weights corresponding to the link types in different time slices, and calculating an average shortest path of a satellite network;
generating a certain number of initial populations representing different satellite network link topological structures, wherein each initial population consists of a plurality of coding sequences;
discarding the coding sequences which cannot reach the full-network communication in the initial population to obtain the initial population meeting the legitimacy check requirement;
calculating a network performance index of a network topology structure corresponding to a coding sequence for the coding sequence in the initial population meeting the requirement of validity check;
selecting a corresponding genetic algorithm according to the number of the network performance indexes;
and according to the requirements of each network performance index, selecting a proper coding sequence from the generated optimal solution set as a final network topology structure.
The automatic network topology design method facing the satellite networking comprises the steps that relative distances or link states among satellites are changed in different time slices, the link distance among satellite nodes is calculated for each time slice, the link states among the satellites are determined based on ephemeris, and a dynamic constellation link weight value graph formed by link weight value graphs of a plurality of continuous time slices is generated and used for describing the change situation of the link weight values and the states among the satellites in the whole constellation operation cycle.
The automatic network topology design method facing satellite networking comprises the following steps: binary coding and decimal coding.
The automatic network topology design method facing satellite networking comprises the following steps of: based on the average communication delay of the network traffic, based on the average hop count of the network traffic and the network link utilization.
The automatic network topology design method facing the satellite networking is characterized in that the average communication time delay based on the network service is obtained by counting the shortest communication distance between services and averaging;
the average hop count based on the network service is obtained by counting the hop count corresponding to the shortest communication distance between services;
the network link utilization rate is calculated through satellite links and bandwidth occupation conditions experienced by all network services.
According to the automatic network topology design method for satellite networking, after an initial population is generated, link types are subjected to homogenization operation, and the method is used for ensuring that the network performance is optimal under the same link types.
The automatic network topology design method for satellite networking comprises the following specific steps of:
if the number of the performance indexes is 1, selecting a single-target genetic algorithm;
and if the number of the performance indexes is more than 1, selecting a multi-target genetic algorithm.
The automatic network topology design method for satellite networking, wherein according to the requirements of each network performance index, a suitable coding sequence is selected from a generated optimal solution set as a final network topology structure, and specifically comprises the following steps:
if a single-target genetic algorithm is selected in the satellite network topology design process, selecting a coding sequence with the best performance from a single-target optimal solution set as a final network topology structure;
if a multi-target genetic algorithm is selected in the satellite network design process, the multi-target optimal solutions are integrated into a curve or a curved surface, and a coding sequence with compromised performance on the curve or the curved surface is selected as a final network topology structure during final network topology selection.
The automatic network topology design method for satellite networking is characterized in that the communication range is determined by an azimuth angle and a pitch angle.
According to the automatic network topology design method for satellite networking, in the same constellation, each satellite node carries at most four optical transceivers.
The automatic network topology design method for the satellite networking is characterized in that each satellite node is connected with a front node and a rear node on the same orbit in a default mode, and 0-2 links are connected with an off-orbit satellite.
In addition, to achieve the above object, the present invention further provides a terminal, wherein the terminal includes: the automatic network topology design method for the satellite networking comprises a memory, a processor and an automatic network topology design program for the satellite networking, wherein the automatic network topology design program for the satellite networking is stored on the memory and can run on the processor, and when being executed by the processor, the steps of the automatic network topology design method for the satellite networking are realized.
In addition, to achieve the above object, the present invention further provides a computer readable storage medium, wherein the computer readable storage medium stores an automatic network topology design program for satellite networking, and the automatic network topology design program for satellite networking implements the steps of the automatic network topology design method for satellite networking when being executed by a processor.
The method is based on the regularity of the satellite constellation and the prior experience of the topological design of the satellite constellation, the satellite constellation is subjected to abstract mapping and simplified coding, and the calculation complexity of a genetic algorithm in the automatic design process is greatly reduced; meanwhile, by generating a high-quality initial population, the convergence rate is obviously improved, and the problem of limited network scale caused by the influence of the calculation complexity on network topology planning and optimization algorithms is solved.
Drawings
FIG. 1 is a flow chart of a preferred embodiment of the automatic network topology design method for satellite networking of the present invention;
fig. 2 is a schematic diagram of an optimal solution set curve chart with 2 network performance indexes (average communication delay and average communication hop count in the whole network) as optimization targets in the preferred embodiment of the automatic network topology design method for satellite networking of the present invention;
fig. 3 is a schematic operating environment of a terminal according to a preferred embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention is oriented to a single-constellation satellite networking scene adopting point-to-point laser communication among satellites, and the constraint and precondition in the topology planning process are as follows:
(1) the farthest distance and the communication range of the laser communication system (the communication range is determined by the azimuth angle and the pitch angle together);
(2) in the same constellation, each satellite node carries at most four optical transceivers;
(3) each satellite node is connected with a front node and a rear node on the same orbit in a default mode, and 0-2 links are connected with the different-orbit satellite.
Firstly, acquiring basic constellation information, abstracting and coding a satellite network, simultaneously determining key indexes and calculation functions in the topological design of the satellite network, and converting coding individuals into the input of the calculation functions; secondly, generating a legal high-quality initial population based on prior experience; and finally, completing iteration and convergence processes based on a single-target or multi-target genetic algorithm, and selecting a suitable network topology structure in the optimal solution set.
As shown in fig. 1, the method for designing an automatic network topology for satellite networking according to the preferred embodiment of the present invention includes the following steps:
step S1, based on the created constellation and the farthest communication distance and communication range of the optical transceiver carried by each satellite node, calculating the farthest orbital number to which each satellite node in the constellation can be connected.
For example, 1 is that the adjacent tracks of different tracks are connected, 2 is that different tracks are connected across 1 track, 3 is that different tracks are connected across 2 tracks,. The number of the farthest orbits that each satellite node can connect to can be calculated based on the communication distance and the communication range of the optical transceiver on the satellite, for example, the farthest communication distance of the communication optical transceiver on a certain satellite is 5000km, for example, 5000km covers 4 orbits at most (the distance between the orbits after the constellation is generated is regular and equal), and then the number of the farthest orbits is 4.
Step S2, calculating the ephemeris of each satellite in the satellite constellation, time-slicing the operating cycle of one constellation, calculating the link distance between each satellite and the satellite node keeping communication in each time slice, and using the link distance as the weight of the communication link as the input for calculating the communication distance and the communication time delay of the satellite network in each time slice.
Specifically, the principle of time slicing is that the link state between satellite nodes remains unchanged, and the link distance changes less. The operation period and time slicing of the constellation are different according to the size of the constellation and the height of the constellation, the operation period of a single constellation of a low-orbit satellite (with the height of 500- > 2000 km) is generally within 2 hours, and the time slicing is from a few seconds to a few minutes.
The relative distance between satellites or the link state among the satellites can change among different time slices, so the link distance among the satellite nodes needs to be calculated for each time slice, the link state among the satellites is determined based on ephemeris, and finally a dynamic constellation link weight value graph consisting of a plurality of link weight value graphs of continuous time slices is formed, and the change situation of the link weight value and the state among the satellites in the whole constellation operation cycle is accurately described.
And S3, determining a coding mode and a coding length based on the number M of the satellite nodes on each satellite orbit and the number N of the farthest orbits which can be communicated by each satellite node, coding to obtain a coding sequence, and performing link configuration and weight calculation on all the satellites on the orbits according to the coding sequence.
Specifically, the encoding method includes: binary coding and decimal coding; the coding process is described below by taking decimal coding as an example, when N is less than 10, the coding length is M, the value on each coding bit represents the link type, there are 0 (no connection), 1, 2, 3,. and N link type identifiers, for example, there are 10 satellite nodes on each orbit, the farthest communication orbit of each satellite node is 3, one possible link topology coding sequence is [1, 0, 1, 2, 1, 2, 1, 3, 1, 2], and the first bit 1 in the coding sequence represents the connection of the first satellite on the orbit with the nearest satellite on the adjacent orbit; second bit 0 indicates that a second satellite in orbit is not connected to an off-orbit satellite; the third bit 1 indicates that the third satellite in orbit is connected to the nearest adjacent satellite; the fourth 2 indicates that the fourth satellite in the orbit is connected to the nearest satellite across 1 orbit, and so on. When N is more than or equal to 10 and less than 100, the coding mode is the same as that when N is less than 10, and because the number of tracks for communication across the different-track tracks is more than or equal to 10, 2-bit coding is needed to fully represent the link type connected between the different tracks. And so on. And all satellites in the orbits carry out link configuration and weight calculation strictly according to the coding sequence.
And step S1', determining the network performance index to be considered when the satellite network topology is designed.
Specifically, network performance indexes which are important to be considered in the network topology planning process are determined, for example, average communication delay based on network services, average hop count based on network services, network link utilization rate, and the like.
And step S2', determining the calculation mode of the network performance index.
Specifically, a method for calculating the network performance index in step S1' is given, such as: the average communication time delay based on the network services is obtained by counting the shortest communication distance between the services and averaging, the average hop count based on the network services is counted by the hop count corresponding to the shortest communication distance between the services, and the utilization rate of the network link is calculated by satellite links and bandwidth occupation conditions experienced by all the services of the network.
And step S4, converting the coding sequence into inter-satellite link types in a satellite constellation, corresponding to link weights corresponding to the link types in different time slices, and calculating the average shortest path of the satellite network.
Specifically, the coding sequence in step S3 is converted into an inter-satellite link type in a satellite constellation, and the inter-satellite link type corresponds to the link weight corresponding to the link type in different time slices in step S2, and the average shortest path of the satellite network is calculated based on the Dijkstra algorithm, thereby affecting other network performance indexes.
And step S5, generating a certain number of initial populations representing different satellite network link topological structures, wherein the initial populations are composed of a plurality of coding sequences.
Specifically, a number of initial populations of code sequences representing different satellite network link topologies are generated (the initial populations consisting of a plurality of code sequences). The generation mode is divided into two modes, the first mode is generated based on network topology design experience, and the generated coding sequence can enable the algorithm to quickly converge to an optimal solution; the second is based on a randomly generated code sequence, which prevents the algorithm from converging to a local optimum. When the initial population is generated, it is ensured that no link type exceeding the "farthest communication link type" is generated. After the initial population is generated, the link types are homogenized, and the optimal network performance under the same link types is ensured. For example, the network delay and hop count corresponding to the topology [1, 1, 1, 1, 2, 2, 2, 3, 3, 3] are inferior to the topology [1, 2, 1, 3, 1, 2, 3, 1, 2, 3] after link equalization, so the newly generated sequence is selected to be equalized.
And step S6, discarding the coding sequences which can not reach the whole network connection in the initial population to obtain the initial population meeting the legitimacy check requirement.
Specifically, the generated initial population is subjected to validity check, the validity check needs to ensure the whole-network connectivity of the designed network link topology, and coding sequences which cannot achieve the whole-network connectivity in the initial population are regarded as illegal and are directly discarded. Because the initial population generation is mostly generated randomly, there is no way to ensure that all the coding sequences in the initial population can ensure connectivity among all the nodes in the whole network or that there is a link type ineligibility.
And step S7, calculating network performance indexes of the network topology structure corresponding to the coding sequence for the coding sequence in the initial population meeting the requirement of validity check, wherein the indexes are main targets of the automatic optimization process in the following step S8, and the genetic algorithm can continuously optimize around the indexes.
And step S8, selecting the corresponding genetic algorithm according to the number of the network performance indexes.
Specifically, if the number of the performance indexes is 1, a single-target genetic algorithm can be selected; if the number of the performance indexes is more than 1, a multi-target genetic algorithm can be selected.
Genetic algorithm hybridization variation: different hybridization and mutation methods can be selected according to requirements, but in the process of mutation of the satellite network coding sequence, illegal link types exceeding the 'farthest communication link type' are not generated.
Validity checking and coding homogenization: the validity check of the hybrid mutated coding sequence is the same as the validity check in step S6, and the homogenization treatment in step 5 is performed on the valid coding sequence.
Calculating a network performance index function: and calculating the corresponding network performance index function for the legal coding sequence after the hybridization variation.
Genetic algorithm (selection): and sequencing the calculated network performance indexes, selecting a coding sequence corresponding to a better performance index, and entering the next iteration process.
Judging the iteration times: and when the iteration times exceed the set iteration times, finishing the algorithm optimization process, and otherwise, entering the next iteration.
Optimal solution set: and selecting a value with a top rank from the performance index ranking table, and storing a corresponding coding sequence to form an optimal solution set.
And step S9, selecting a proper coding sequence from the generated optimal solution set as a final network topology structure according to the requirements of each network performance index.
Specifically, according to the requirement of each network performance index, an appropriate coding sequence is selected from the optimal solution set generated in step S8 as the final network topology. For example, if the single-target design optimization is selected in the satellite network topology design process, the coding sequence with the best performance is selected from the single-target optimal solution set as the final network topology structure; if multi-objective design optimization is selected in the network design process, the optimal solution set can be a curve or a curved surface, the coding sequence with performance compromise on the curve or the curved surface can be selected as a final network topology structure during the final network topology selection, and other points on the curve or the curved surface can also be selected according to requirements.
As shown in fig. 2, fig. 2 is an optimal solution set graph with 2 network performance indexes (average communication delay and average communication hop count in the whole network) as optimization targets, and a point with optimal delay or optimal hop count may be selected as a final network topology, or a point with relatively compromised delay and hop count performance in a block may be selected as a final network topology.
Based on the steps, the programming of the space-based network topology automatic design algorithm is completed. Verification proves that the topological planning iteration and convergence of a constellation with the scale of 3000-5000 nodes can be completed within 10-24 hours of a single machine single thread, and the problem that the use of a similar algorithm is limited within 200 nodes is solved.
The automatic network topology design scheme oriented to satellite networking has the advantages that:
(1) in the invention, the coding of the network topology structure is quantized into two dimensions of the satellite number on each orbit and the farthest communication orbit type of each satellite, thereby solving the coding complexity problem of the large-scale network topology structure.
(2) The invention makes full use of the periodicity and regularity of the satellite network, and ensures that all the orbits adopt the same coding sequence, thereby ensuring the connection uniformity of each node and the normalization of the network.
(3) The invention homogenizes the coding sequence corresponding to the network topology, ensures that one coding sequence with optimal performance is reserved in various sequences with the same link type proportion, greatly reduces the invalid calculation amount of the genetic algorithm, and improves the calculation efficiency and the convergence quality of the genetic algorithm.
Further, as shown in fig. 3, the present invention also provides a terminal, which includes a processor 10, a memory 20 and a display 30. Fig. 3 shows only some of the components of the terminal, but it is to be understood that not all of the shown components are required to be implemented, and that more or fewer components may be implemented instead.
The memory 20 may in some embodiments be an internal storage unit of the terminal, such as a hard disk or a memory of the terminal. The memory 20 may also be an external storage device of the terminal in other embodiments, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the terminal. Further, the memory 20 may also include both an internal storage unit and an external storage device of the terminal. The memory 20 is used for storing application software installed in the terminal and various types of data, such as program codes of the installation terminal. The memory 20 may also be used to temporarily store data that has been output or is to be output. In an embodiment, the memory 20 stores an automatic network topology design program 40 for satellite networking, and the automatic network topology design program 40 for satellite networking can be executed by the processor 10, so as to implement the automatic network topology design method for satellite networking in the present application.
The processor 10 may be, in some embodiments, a Central Processing Unit (CPU), a microprocessor or other data Processing chip, and is configured to run program codes stored in the memory 20 or process data, for example, execute the automatic network topology design method for satellite-oriented networking.
The display 30 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch panel, or the like in some embodiments. The display 30 is used for displaying information at the terminal and for displaying a visual user interface. The components 10-30 of the terminal communicate with each other via a system bus.
In one embodiment, the steps of the satellite networking oriented automatic network topology design method are implemented when processor 10 executes satellite networking oriented automatic network topology design program 40 in memory 20.
The invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores an automatic network topology design program for satellite networking, and the automatic network topology design program for satellite networking realizes the following steps when being executed by a processor:
calculating the farthest track number which can be connected with each satellite node in the constellation based on the created constellation and the farthest communication distance and the communication range of the optical transceiver carried by each satellite node;
calculating ephemeris of each satellite in a satellite constellation, performing time slicing on a constellation operation cycle, calculating a link distance between each satellite and a satellite node keeping communication in each time slice, and using the link distance as a weight of a communication link as input for calculating a satellite network communication distance and communication time delay in each time slice;
determining a coding mode and a coding length based on the number of satellite nodes on each satellite orbit and the maximum orbit number which can be communicated by each satellite node, coding to obtain a coding sequence, and performing link configuration and weight calculation on all satellites on the orbits according to the coding sequence;
determining a network performance index which needs to be considered during satellite network topology design, and determining a calculation mode of the network performance index;
converting the coding sequence into an inter-satellite link type in a satellite constellation, corresponding to link weights corresponding to the link types in different time slices, and calculating an average shortest path of a satellite network;
generating a certain number of initial populations representing different satellite network link topological structures, wherein the initial populations are composed of a plurality of coding sequences;
discarding the coding sequences which cannot reach the full-network communication in the initial population to obtain the initial population meeting the legitimacy check requirement;
calculating a network performance index of a network topology structure corresponding to a coding sequence for the coding sequence in the initial population meeting the requirement of validity check;
selecting a corresponding genetic algorithm according to the number of the network performance indexes;
and according to the requirements of each network performance index, selecting a proper coding sequence from the generated optimal solution set as a final network topology structure.
The link distance between the satellite nodes is calculated for each time slice, and a dynamic constellation link weight value graph composed of link weight value graphs of a plurality of continuous time slices is generated based on the link state between the satellites defined by ephemeris, and is used for describing the change situation of the link weight value and the state between the satellites in the whole constellation operation cycle.
Wherein, the coding mode comprises: binary coding and decimal coding.
Wherein the network performance indicators include: based on the average communication delay of the network traffic, based on the average hop count of the network traffic and the network link utilization.
The average communication time delay based on the network service is obtained by counting the shortest communication distance between services and averaging;
the average hop count based on the network service is obtained by counting the hop count corresponding to the shortest communication distance between services;
the network link utilization rate is calculated through satellite links and bandwidth occupation conditions experienced by all network services.
After the initial population is generated, the link types are subjected to homogenization operation, and the homogenization operation is used for ensuring that the network performance is optimal under the same link types.
Wherein, the selecting the corresponding genetic algorithm according to the number of the network performance indexes specifically comprises:
if the number of the performance indexes is 1, selecting a single-target genetic algorithm;
and if the number of the performance indexes is more than 1, selecting a multi-target genetic algorithm.
Wherein, according to the requirement of each network performance index, selecting a suitable coding sequence from the generated optimal solution set as a final network topology structure, specifically comprising:
if a single-target genetic algorithm is selected in the satellite network topology design process, selecting a coding sequence with the best performance from a single-target optimal solution set as a final network topology structure;
if a multi-target genetic algorithm is selected in the satellite network design process, the multi-target optimal solutions are integrated into a curve or a curved surface, and a coding sequence with compromised performance on the curve or the curved surface is selected as a final network topology structure during final network topology selection.
Wherein the communication range is determined by an azimuth angle and a pitch angle.
In the same constellation, each satellite node carries at most four optical transceivers.
Each satellite node is connected with a front node and a rear node on the same orbit in a default mode, and 0-2 links are connected with the different-orbit satellite.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
It is to be understood that the invention is not limited to the examples described above, but that modifications and variations may be effected thereto by those of ordinary skill in the art in light of the foregoing description, and that all such modifications and variations are intended to be within the scope of the invention as defined by the appended claims.

Claims (13)

1. A method for designing an automatic network topology facing a satellite networking is characterized by comprising the following steps:
calculating the farthest track number which can be connected with each satellite node in the constellation based on the created constellation and the farthest communication distance and the communication range of the optical transceiver carried by each satellite node;
calculating ephemeris of each satellite in a satellite constellation, performing time slicing on a constellation operation cycle, calculating a link distance between each satellite and a satellite node keeping communication in each time slice, and using the link distance as a weight of a communication link as input for calculating a satellite network communication distance and communication time delay in each time slice;
determining a coding mode and a coding length based on the number of satellite nodes on each satellite orbit and the maximum orbit number which can be communicated by each satellite node, coding to obtain a coding sequence, and performing link configuration and weight calculation on all satellites on the orbits according to the coding sequence;
determining a network performance index which needs to be considered during satellite network topology design, and determining a calculation mode of the network performance index;
converting the coding sequence into an inter-satellite link type in a satellite constellation, corresponding to link weights corresponding to the link types in different time slices, and calculating an average shortest path of a satellite network;
generating a certain number of initial populations representing different satellite network link topological structures, wherein each initial population consists of a plurality of coding sequences;
discarding the coding sequences which cannot reach the full-network communication in the initial population to obtain the initial population meeting the legitimacy check requirement;
calculating a network performance index of a network topology structure corresponding to a coding sequence for the coding sequence in the initial population meeting the requirement of validity check;
selecting a corresponding genetic algorithm according to the number of the network performance indexes;
and according to the requirements of each network performance index, selecting a proper coding sequence from the generated optimal solution set as a final network topology structure.
2. The method according to claim 1, wherein the relative distance between satellites or the link state changes in different time slices, the link distance between satellite nodes is calculated for each time slice, and a dynamic constellation link weight map composed of a plurality of link weight maps of consecutive time slices is generated based on ephemeris to determine the link state between satellites, and is used to describe the change of the link weight between satellites and the state in the whole constellation operation cycle.
3. The method for designing an automatic network topology for satellite networking according to claim 1, wherein the encoding manner comprises: binary coding and decimal coding.
4. The method of claim 1, wherein the network performance indicators comprise: based on the average communication delay of the network traffic, based on the average hop count of the network traffic and the network link utilization.
5. The automatic network topology design method oriented to satellite networking according to claim 4, wherein the average communication delay based on network services is obtained by counting the shortest communication distance between services and averaging;
the average hop count based on the network service is obtained by counting the hop count corresponding to the shortest communication distance between services;
the network link utilization rate is calculated through satellite links and bandwidth occupation conditions experienced by all network services.
6. The method for designing the automatic network topology oriented to the satellite networking according to claim 1, wherein after the initial population is generated, a homogenization operation is performed on the link types for ensuring the optimal network performance under the same link types.
7. The method for designing the automatic network topology oriented to the satellite networking according to claim 1, wherein the selecting the corresponding genetic algorithm according to the number of the network performance indexes specifically comprises:
if the number of the performance indexes is 1, selecting a single-target genetic algorithm;
and if the number of the performance indexes is more than 1, selecting a multi-target genetic algorithm.
8. The method according to claim 7, wherein the selecting a suitable coding sequence from the generated optimal solution set as a final network topology according to the requirements of each network performance index specifically comprises:
if a single-target genetic algorithm is selected in the satellite network topology design process, selecting a coding sequence with the best performance from a single-target optimal solution set as a final network topology structure;
if a multi-target genetic algorithm is selected in the satellite network design process, the multi-target optimal solutions are integrated into a curve or a curved surface, and a coding sequence with compromised performance on the curve or the curved surface is selected as a final network topology structure during final network topology selection.
9. The method of claim 1, wherein the communication range is determined by azimuth and elevation angles.
10. The method of claim 1, wherein each satellite node carries at most four optical transceivers in the same constellation.
11. The method for designing the automatic network topology oriented to the satellite networking according to claim 1, wherein each satellite node is connected with a front node and a rear node on the same orbit by default, and 0-2 links are connected with the different-orbit satellite.
12. A terminal, characterized in that the terminal comprises: a memory, a processor and an automatic network topology design program for satellite networking stored on the memory and executable on the processor, the automatic network topology design program for satellite networking implementing the steps of the automatic network topology design method for satellite networking according to any one of claims 1 to 11 when executed by the processor.
13. A computer-readable storage medium, characterized in that the computer-readable storage medium stores an automatic network topology design program for satellite networking, which when executed by a processor implements the steps of the automatic network topology design method for satellite networking according to any one of claims 1 to 11.
CN202210971617.2A 2022-08-15 2022-08-15 Automatic network topology design method and related equipment for satellite networking Active CN115051749B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210971617.2A CN115051749B (en) 2022-08-15 2022-08-15 Automatic network topology design method and related equipment for satellite networking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210971617.2A CN115051749B (en) 2022-08-15 2022-08-15 Automatic network topology design method and related equipment for satellite networking

Publications (2)

Publication Number Publication Date
CN115051749A true CN115051749A (en) 2022-09-13
CN115051749B CN115051749B (en) 2022-11-04

Family

ID=83167678

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210971617.2A Active CN115051749B (en) 2022-08-15 2022-08-15 Automatic network topology design method and related equipment for satellite networking

Country Status (1)

Country Link
CN (1) CN115051749B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6477370B1 (en) * 1995-09-19 2002-11-05 Motient Service Inc. Satellite trunked radio service system
CN106792959A (en) * 2016-11-10 2017-05-31 上海交通大学 Satellite interlayer topology reconstruction method based on discrete subtopology sequence and genetic algorithm
CN108965125A (en) * 2017-05-17 2018-12-07 华东师范大学 A kind of double layer minipellet multi-path route method based on network code
CN109635332A (en) * 2018-11-08 2019-04-16 北京航空航天大学 A kind of variable step constellation orbital optimization method and device based on genetic algorithm
CN114422366A (en) * 2022-03-28 2022-04-29 中国人民解放军战略支援部队航天工程大学 Satellite network SDN multi-controller deployment method and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6477370B1 (en) * 1995-09-19 2002-11-05 Motient Service Inc. Satellite trunked radio service system
CN106792959A (en) * 2016-11-10 2017-05-31 上海交通大学 Satellite interlayer topology reconstruction method based on discrete subtopology sequence and genetic algorithm
CN108965125A (en) * 2017-05-17 2018-12-07 华东师范大学 A kind of double layer minipellet multi-path route method based on network code
CN109635332A (en) * 2018-11-08 2019-04-16 北京航空航天大学 A kind of variable step constellation orbital optimization method and device based on genetic algorithm
CN114422366A (en) * 2022-03-28 2022-04-29 中国人民解放军战略支援部队航天工程大学 Satellite network SDN multi-controller deployment method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
田露: "基于启发式遗传算法的时分星间网络拓扑优化设计", 《计算机测量与控制》 *

Also Published As

Publication number Publication date
CN115051749B (en) 2022-11-04

Similar Documents

Publication Publication Date Title
CN107145971A (en) A kind of express delivery dispatching optimization method of dynamic adjustment
EP3349126B1 (en) Method, device, storage medium, and apparatus for automatically discovering fuel station poi
CN107020963A (en) Method for managing power in the charging station of electric vehicle
CN107101645B (en) A kind of paths planning method and path planning apparatus
CN108921468A (en) A kind of logistic distribution vehicle intelligence wire arranging method
CN111178724B (en) Carpooling scheduling method based on evolution algorithm
CN110826819B (en) Automatic container terminal vehicle path planning method
CN105678412A (en) Path planning method and device facing multiple passengers
CN107944611A (en) Towards the cross-module formula combined travel planing method of personalized trip requirements
CN112378415B (en) Scheduling planning method, device and equipment for tools and appliances
CN111130790A (en) Block co-recognition method based on block chain node network
CN114240001A (en) Logistics routing network determining method and device
CN103995749B (en) The calculation task allocating method and system of cell cloud system
CN112330001A (en) Logistics distribution vehicle route optimization method based on discrete bat algorithm
CN115051749B (en) Automatic network topology design method and related equipment for satellite networking
Florian et al. Determining intermediate origin-destination matrices for the analysis of composite mode trips
CN112330054B (en) Dynamic travel business problem solving method, system and storage medium based on decision tree
CN112860996A (en) Interest point processing method and device, electronic equipment and medium
CN115423393B (en) Order scheduling method and device of dynamic self-adaptive scheduling period based on LSTM
CN111429237A (en) Order price determining method and device, server and storage medium
Choo et al. Reliable vehicle selection algorithm with dynamic mobility of vehicle in vehicular cloud system
CN106597435A (en) Method and system for achieving particle-filter-based SLAM (simultaneous localization and mapping) algorithm
CN116090589A (en) Online dispatching method for network bus of platform benefit drive under position noise disturbance
Ben-Gal et al. Sequential DOE via dynamic programming
CN110674967A (en) Express vehicle path robust optimization method under uncertain driving time

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