CN113840294A - Method for planning different-rail links of satellite constellation network - Google Patents

Method for planning different-rail links of satellite constellation network Download PDF

Info

Publication number
CN113840294A
CN113840294A CN202111064602.XA CN202111064602A CN113840294A CN 113840294 A CN113840294 A CN 113840294A CN 202111064602 A CN202111064602 A CN 202111064602A CN 113840294 A CN113840294 A CN 113840294A
Authority
CN
China
Prior art keywords
link
antenna
satellite
antennas
regression
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
CN202111064602.XA
Other languages
Chinese (zh)
Other versions
CN113840294B (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.)
Beijing Institute of Spacecraft System Engineering
Original Assignee
Beijing Institute of Spacecraft System Engineering
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 Beijing Institute of Spacecraft System Engineering filed Critical Beijing Institute of Spacecraft System Engineering
Priority to CN202111064602.XA priority Critical patent/CN113840294B/en
Publication of CN113840294A publication Critical patent/CN113840294A/en
Application granted granted Critical
Publication of CN113840294B publication Critical patent/CN113840294B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses a planning method for a different-rail link of a satellite constellation network, which can obtain a planning scheme for establishing the different-rail link with relatively stable network topology and high network management efficiency. Calculating a regression cycle of the relative position relationship of the satellite constellation network nodes according to the orbit height, and acquiring the link passability relationship among antennas used for the different-orbit links in one regression cycle to form a three-dimensional Boolean matrix of the link passability relationship; traversing all antennas which can be used for building the cross-track link, respectively selecting one antenna with the longest sum of the passable time of the link in the regression period between two adjacent track surfaces, and setting the passable relation of the non-preferred antenna as non-passable; traversing each moment and each antenna of the regression cycle, selecting the off-track idle antenna and the link establishment thereof for each antenna in the three-dimensional Boolean matrix of the link communication relation according to the longest continuous link establishment time algorithm, and deducing the link establishment scheme of the regression cycle to other cycles to obtain the final network topology plan.

Description

Method for planning different-rail links of satellite constellation network
Technical Field
The invention belongs to the technical field of network communication, and relates to a method for planning a satellite constellation network different-rail link.
Background
The satellite constellation network is a network system which takes a satellite as a network node and acquires, transmits and processes spatial information in real time. Currently, a plurality of large satellite constellation projects with inter-satellite links are planned or implemented at home and abroad for the purposes of wireless communication, earth observation, reconnaissance and the like. Because the number of satellites is large and the dynamics of the constellation is strong, the requirement of the satellite constellation for network intelligent autonomous management is higher and higher at present, and the network autonomous topology planning is an important part in the network intelligent autonomous management and has important significance for realizing network topology optimization and constructing information transmission channels.
Because the ground network nodes are mostly static nodes, the links are stable, and the network topology has no time-varying property, a mature network topology planning method is not available in the field of traditional ground network research. However, for a satellite constellation network, the number of nodes is large, and the nodes are in a motion state on the orbit at all times, so that the nodes of the network cannot be kept visible at all times, links need to be dynamically switched, and the topology structure can be dynamically changed. Especially for the different-orbit links, because of the relative motion between the adjacent orbital planes, how to construct the different-orbit links with large number of links, long link duration, good topological stability and high network node coverage is a difficult problem in the current satellite constellation network topology planning. Therefore, how to realize the efficient and optimized different-rail link planning of the satellite constellation network has important significance for realizing intelligent autonomous network management.
Currently, the academia proposes some methods for planning the different-orbit links of the satellite constellation network. The link allocation problem is solved by a heuristic optimization algorithm based on simulated annealing, which is proposed by the Chinese space technical research institute in the journal of aeronautics in 2015, however, the method does not take an antenna as a visibility research unit, so that the method cannot handle the situation that a plurality of antennas are installed on different surfaces of one satellite, and the heuristic algorithm has uncertainty and causes difficulty in satellite network management; a time-varying inter-satellite link network topology planning method (CN201910474731.2) proposed by Shanghai microsatellite engineering center tries to perform topology planning on a dynamically-varying space network, but the method does not screen a specified target antenna for a chain-building antenna, so that frequent link switching and unstable space network topology are easily caused.
Disclosure of Invention
The invention discloses a method for planning a different-rail link of a satellite constellation network, which can obtain a scheme for planning the different-rail link with relatively stable network topology and high network management efficiency and realize the independent planning of the single-layer multi-orbit satellite constellation network topology.
The invention is realized by the following technical scheme.
A method for planning a satellite constellation network different-rail link comprises the following steps:
step one, calculating a regression cycle of the relative position relationship of the satellite constellation network nodes according to the orbit height;
calculating the number of orbits of each satellite in the regression period through orbit extrapolation, and calculating the link passable relationship between any two different-orbit satellite antennas in a constellation of the regression period according to the mounting position of the on-satellite antenna and the half-field angle of the antenna to form a three-dimensional Boolean matrix of the link passable relationship;
step three, calculating by the three-dimensional Boolean matrix of the link passable relationship to obtain the sum of the link passable duration time of any two different-orbit satellite antennas in the constellation in a regression period;
step four, traversing all antennas used for establishing the chains in the different orbits in the constellation, respectively selecting one antenna with the longest sum of the link-accessible duration time in the period of the antenna a1 of the satellite in the constellation from two adjacent orbital planes, defining the two antennas as a preferred antenna of the antenna a1, establishing the link as the preferred link, and setting the link-accessible relationship between the antenna a1 and the non-preferred antenna thereof at all times in the regression period as unavailable in the three-dimensional Boolean matrix of the link-accessible relationship;
and step five, traversing the regression cycle, obtaining the operation of the link establishment scheme based on the longest link duration algorithm, deducing the link establishment scheme of the regression cycle to other regression cycles, and finishing the independent link establishment planning of the different-rail link.
The invention has the beneficial effects that:
1. according to the invention, through the determination of the regression period and the calculation of the link permeability among different-rail antennas, the different-rail antenna which has the longest communication time and is most stable in link establishment can be screened for each antenna used for establishing the different-rail link, and on the basis, the longest continuous link establishment time algorithm is applied, so that an optimal link topology planning scheme which has the advantages of stable network topology, less link switching times, full coverage of network nodes and high link establishment efficiency and simplicity can be obtained, the autonomous planning of the single-layer multi-track constellation space network topology is realized, and the problems of manual network topology change, low network node coverage and more link switching times in the time-division agile space network can be further solved.
2. The invention analyzes and designs the link feasibility and the optimal link establishment scheme by taking the antenna as a planning unit, realizes the fine planning of the link establishment, and can solve the problem that the traditional network topology planning method by taking the satellite as the planning unit can only process the scenes that all the antennas are arranged at the same side of the satellite.
3. According to the method, the constellation regression period is calculated, the whole network link in the single regression period is planned, the link establishment planning scheme of other periods is popularized, and the calculation amount and time consumption of the link establishment planning are effectively reduced.
Drawings
FIG. 1 is a flowchart of a method for planning a satellite constellation network different-track link according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a satellite constellation network architecture according to an embodiment of the present invention;
fig. 3 is a schematic diagram illustrating a link establishment result of the different-track link according to the embodiment of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The general idea of the invention is as follows: calculating a regression cycle of the relative position relationship of the satellite constellation network nodes according to the orbit height, taking the antenna as an analysis unit, obtaining the link passability relationship among the antennas used for the different-orbit links in one regression cycle, and forming a three-dimensional Boolean matrix of the link passability relationship; traversing all the antennas which can be used for building the cross-track link, respectively selecting one antenna with the longest sum of the passable time of the link in the regression period between two adjacent track surfaces, wherein the selected antenna is called a preferred antenna, and the passable relation between the preferred antenna and a non-preferred antenna is set as non-passable; traversing each moment and each antenna of the regression cycle, selecting the off-track idle antenna and the link establishment thereof for each antenna in the three-dimensional Boolean matrix of the link communication relation according to the longest continuous link establishment time algorithm, and deducing the link establishment scheme of the regression cycle to other cycles to obtain the final network topology plan.
As shown in fig. 1, the method for planning a different-orbit link of a satellite constellation network according to this embodiment specifically includes:
step one, calculating a regression cycle of the relative position relationship of the satellite constellation network nodes according to the orbit height;
calculating the number of orbits of each satellite in the regression period through orbit extrapolation, and calculating the link passable relationship between any two different-orbit satellite antennas in a constellation of the regression period according to the mounting position of the on-satellite antenna and the half-field angle of the antenna to form a three-dimensional Boolean matrix of the link passable relationship;
step three, calculating by the three-dimensional Boolean matrix of the link passable relationship to obtain the sum of the link passable duration time of any two different-orbit satellite antennas in the constellation in a regression period;
step four, traversing all antennas used for establishing the chains in the different orbits in the constellation, respectively selecting one antenna with the longest sum of the link-accessible duration time in the period of the antenna a1 of the satellite in the constellation from two adjacent orbital planes, defining the two antennas as a preferred antenna of the antenna a1, establishing the link as the preferred link, and setting the link-accessible relationship between the antenna a1 and the non-preferred antenna thereof at all times in the regression period as unavailable in the three-dimensional Boolean matrix of the link-accessible relationship;
in this embodiment, the two preferred antennas are respectively denoted as an antenna p and an antenna q, and if a link between the two antennas is accessible, the following four conditions should be simultaneously satisfied: the connecting line Lpq between the antenna p and the antenna q is not shielded by the earth, the included angle between the installation direction of the antenna p and the connecting line Lpq is smaller than the half field angle of the antenna p, the included angle between the installation direction of the antenna q and the connecting line Lpq is smaller than the half field angle of the antenna q, and the antenna p and the antenna q are all vacant.
In this embodiment, the length of a first dimension of a matrix in the three-dimensional boolean matrix of the link passable relationship is a regression period, and the lengths of a second dimension and a third dimension are the sum of the number of antennas in a constellation that can be used for establishing a link between different rails; in specific implementation, the element value of the matrix may be 1 to indicate that a link between two different-track antennas is accessible at the time, and the element value of 0 to indicate that the link is not accessible.
And step five, traversing the regression cycle, obtaining the operation of the link establishment scheme based on the longest link duration algorithm, deducing the link establishment scheme of the regression cycle to other regression cycles, and finishing the independent link establishment planning of the different-rail link.
In this embodiment, the operation of obtaining the link establishment scheme based on the longest link duration algorithm is as follows: selecting a vacant antenna of each satellite in the constellation, establishing a link with a vacant antenna of an off-orbit satellite which can be communicated in a three-dimensional Boolean matrix of the link communication relation at the moment, and keeping the link to be unavailable; and if the same vacant antenna can be simultaneously communicated with a plurality of different-orbit satellite antennas, selecting an antenna with a later broken link to establish a link with the antenna.
Example 1:
as shown in fig. 2, in the present embodiment, a Walker 28/4/0 satellite constellation network of 28 satellites in total is selected from four orbital planes, a Walker 28/4/0 constellation includes four orbital planes, seven satellites in each orbital plane are uniformly distributed in the orbital plane, the phase difference between adjacent orbital planes is 0, and all satellite orbits are circular orbits with an eccentricity of 0. The first satellite of the first orbital plane is numbered S11, and so on, and the mth satellite of the nth orbital plane is numbered Snm. All satellites are provided with four antennas, namely a front antenna, a rear antenna, a left antenna and a right antenna, and the half-opening angle of each antenna is 89 degrees. Each satellite can stably and continuously build a chain with an adjacent satellite on the same orbital plane by using a front antenna and a rear antenna, and build a chain with an off-orbit satellite by using a left antenna and a right antenna, wherein the left antenna of the mth satellite on the nth orbital plane is numbered as Anm1, and the right antenna of the mth satellite on the nth orbital plane is numbered as Anm 2.
In this embodiment, only the two left and right antennas used by each satellite to establish the off-orbit link with the adjacent orbital plane satellite is considered, and the method specifically includes the following steps:
step one, because the orbit radiuses of all the satellites are consistent, the operation cycle of one satellite is the relative position regression cycle of the whole constellation network node, and the relative position regression cycle T of the constellation network node can be obtained through calculation according to the circular orbit radiuses.
And secondly, calculating the link passability relation between two different-orbit satellite antennas in a constellation of a regression period according to input parameters such as the installation position of the on-satellite antenna, the antenna half-opening angle and the like to form a three-dimensional Boolean matrix of the link passable relation, wherein the scale is [ T multiplied by 56], the length of the first dimension of the matrix is the sum of the number of the antennas which can be used for constructing different-orbit chains in the constellation, the lengths of the second dimension and the third dimension of the matrix are the sum of the number of the antennas which can be used for constructing different-orbit chains in the constellation, the element value of the matrix is 1 to represent that the link between the two different-orbit antennas at the moment can be passed, and the element value of the matrix is 0 to represent that the link can not be passed. And the earth shielding constraint and the antenna half-field angle constraint of the connecting line of the nodes at the two ends of the link are considered in the link permeability calculation. The antennas at two ends of the link are respectively marked as an antenna p and an antenna q, and if the link between the two antennas is accessible, the following four conditions are simultaneously met: the connecting line Lpq between the antenna p and the antenna q is not shielded by the earth, the included angle between the installation direction of the antenna p and the connecting line Lpq is smaller than the half field angle of the antenna p, the included angle between the installation direction of the antenna q and the connecting line Lpq is smaller than the half field angle of the antenna q, and the antenna p and the antenna q are all vacant. Table 1 is a part of a three-dimensional boolean matrix of link passability, and shows the link passability of antennas a111 and a112 and their off-track antennas at time t.
TABLE 1 time t antenna A111And A112Link communication relation table with different-rail antenna
A211 A212 A221 A222 A231 A232 A241 A242 A251 A252 A261 A262 A271 A272
A111 0 0 0 0 0 0 0 0 0 0 0 0 0 0
A112 0 0 0 0 0 0 0 0 0 0 1 0 1 0
A411 A412 A421 A422 A431 A432 A441 A442 A451 A452 A461 A462 A471 A472
A111 0 0 0 1 0 1 0 0 0 0 0 0 0 0
A112 0 0 0 0 0 0 0 1 0 0 0 0 0 0
And step three, calculating by using a three-dimensional Boolean matrix of the link passable relationship to obtain the sum of the link passable duration time of any two different-orbit satellite antennas in the constellation in a regression period. Tables 2 and 3 take antennas a111 and a112 as an example, and show the different-track antennas with longer sum of link-passable duration in one regression period, and the table omits the different-track antennas with shorter link-passable duration in part.
TABLE 2 antenna A111Periodic link passable time meter with different-rail antenna
Target cross-track antenna Link break-through time (second)
A422 3763
A272 3763
A431 1124
A261 1124
A211 993
A411 993
TABLE 3 antenna A112Periodic link passable time meter with different-rail antenna
Target cross-track antenna Link break-through time (second)
A271 3763
A421 3763
A262 1124
A431 1124
A212 993
A412 993
And fourthly, traversing all antennas used for establishing the cross-track links in the constellation, respectively selecting one antenna with the longest sum of the link-on duration time in the period of the antenna Anmi of the satellite Snm in the constellation in two adjacent orbital planes, defining the two antennas as the preferred antenna of the antenna Anmi, and establishing the link as the preferred link. According to tables 2 and 3, the preferred antenna for antenna a111 at track level 2 is a272 and the preferred antenna at track level 4 is a 422. The preferred antenna for antenna a112 on track surface 2 is a271 and the preferred antenna on track surface 4 is a 421. Then, in the three-dimensional boolean matrix of link reachability, the link reachability of antenna Anmi and its non-preferred antenna at all times within the regression period is set to be non-reachable. As shown in table 4, referring to table 1, it can be seen that the link-passable relations of the antennas a111 and a112 at the time t and the non-preferred antennas thereof at all times in the regression cycle are set as non-passable in table 4.
Table 4t moment screening preferred antenna rear antenna a111And A112Link communication relation table with different-rail antenna
A211 A212 A221 A222 A231 A232 A241 A242 A251 A252 A261 A262 A271 A272
A111 0 0 0 0 0 0 0 0 0 0 0 0 0 0
A112 0 0 0 0 0 0 0 0 0 0 0 0 1 0
A411 A412 A421 A422 A431 A432 A441 A442 A451 A452 A461 A462 A471 A472
A111 0 0 0 1 0 0 0 0 0 0 0 0 0 0
A112 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Step five, traversing each moment of the regression cycle, executing a link establishment scheme acquisition operation based on the longest link duration algorithm, selecting a link-accessible three-dimensional Boolean matrix of the link to establish a link with a vacant antenna of an off-orbit satellite which can be communicated at the moment for the vacant antenna of each satellite in the constellation, and keeping the link to be unavailable; and if the same vacant antenna can be simultaneously communicated with a plurality of different-orbit satellite antennas, selecting an antenna with a later broken link to establish a link with the antenna. And deducing the link establishment scheme of the regression cycle to other regression cycles, namely the link establishment scheme in the time period of n × T to (n +1) × T is consistent with the link establishment scheme of 0-T, and finishing the independent link establishment planning of the different-rail link. Taking the satellite S11 as an example, according to an efficient method for planning the different-track links of the satellite constellation network, the link establishment planning is performed on the left and right antennas a111 and a112, so as to obtain the link establishment result shown in fig. 3.
It can be seen that, for the satellite constellation network described in this embodiment, the method of the present invention can implement link establishment planning for the satellite constellation network described in the embodiment with high efficiency, and key indexes are shown in table 5, where the average link duration and the average topology duration are both significantly better than those of the currently-used link planning method, and the number of links between two orbital planes and the link full reduction rate index can also fully ensure network reliability and survivability, and the method can implement an optimal link topology planning scheme with stable network topology, less link switching times, full coverage of network nodes, and high efficiency and simplicity in link establishment.
Table 5 key index for link establishment planning of satellite constellation network
Index item Index value
Average link duration 2431 second
Average topology duration 548 seconds
Number of links between two track surfaces At least 4 strips
Link full build rate 63.67％
The present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof, and it should be understood that various changes and modifications can be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (5)

1. A method for planning a satellite constellation network different-rail link is characterized by comprising the following steps:
step one, calculating a regression cycle of the relative position relationship of the satellite constellation network nodes according to the orbit height;
calculating the number of orbits of each satellite in the regression period through orbit extrapolation, and calculating the link passable relationship between any two different-orbit satellite antennas in a constellation of the regression period according to the mounting position of the on-satellite antenna and the half-field angle of the antenna to form a three-dimensional Boolean matrix of the link passable relationship;
step three, calculating by the three-dimensional Boolean matrix of the link passable relationship to obtain the sum of the link passable duration time of any two different-orbit satellite antennas in the constellation in a regression period;
step four, traversing all antennas used for establishing the chains in the different orbits in the constellation, respectively selecting one antenna with the longest sum of the link-accessible duration time in the period of the antenna a1 of the satellite in the constellation from two adjacent orbital planes, defining the two antennas as a preferred antenna of the antenna a1, establishing the link as the preferred link, and setting the link-accessible relationship between the antenna a1 and the non-preferred antenna thereof at all times in the regression period as unavailable in the three-dimensional Boolean matrix of the link-accessible relationship;
and step five, traversing the regression cycle, obtaining the operation of the link establishment scheme based on the longest link duration algorithm, deducing the link establishment scheme of the regression cycle to other regression cycles, and finishing the independent link establishment planning of the different-rail link.
2. The method for planning the heterotactic link of the satellite constellation network according to claim 1, wherein the two preferred antennas are respectively denoted as an antenna p and an antenna q, and if the link between the two antennas is accessible, the following four conditions should be simultaneously satisfied: line L between antenna p and antenna qpqNot shielded by the earth, the mounting direction of the antenna p and LpqIncluded angle of (a) is smaller than half field angle of antenna p, installation direction of antenna q and LpqThe included angle is smaller than the half-opening angle of the antenna q, and the antenna p and the antenna q are all vacant.
3. The method according to claim 1 or 2, wherein the length of the first dimension of the matrix in the three-dimensional boolean matrix of the link passing relationship is a regression cycle, and the lengths of the second dimension and the third dimension are the sum of the number of antennas in the constellation that can be used for the establishment of the off-orbit link.
4. The method according to claim 3, wherein the matrix has an element value of 1 indicating that the link between the two different-orbit antennas is accessible at the time, and an element value of 0 indicating that the link is not accessible.
5. The method for planning the heterotactic link of the satellite constellation network according to claim 1 or 2, wherein the link establishment scheme obtaining operation based on the longest link duration algorithm is: selecting a vacant antenna of each satellite in the constellation, establishing a link with a vacant antenna of an off-orbit satellite which can be communicated in a three-dimensional Boolean matrix of the link communication relation at the moment, and keeping the link to be unavailable; and if the same vacant antenna can be simultaneously communicated with a plurality of different-orbit satellite antennas, selecting an antenna with a later broken link to establish a link with the antenna.
CN202111064602.XA 2021-09-11 2021-09-11 Satellite constellation network different-orbit link planning method Active CN113840294B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111064602.XA CN113840294B (en) 2021-09-11 2021-09-11 Satellite constellation network different-orbit link planning method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111064602.XA CN113840294B (en) 2021-09-11 2021-09-11 Satellite constellation network different-orbit link planning method

Publications (2)

Publication Number Publication Date
CN113840294A true CN113840294A (en) 2021-12-24
CN113840294B CN113840294B (en) 2023-08-08

Family

ID=78959060

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111064602.XA Active CN113840294B (en) 2021-09-11 2021-09-11 Satellite constellation network different-orbit link planning method

Country Status (1)

Country Link
CN (1) CN113840294B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115801593A (en) * 2022-10-11 2023-03-14 西安电子科技大学 Walker constellation-oriented capacity maximization topological structure design method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104835011A (en) * 2015-05-13 2015-08-12 中国西安卫星测控中心 Navigational constellation slow varying inter-satellite link planning method based on earth station layout constraints
US20160087713A1 (en) * 2014-05-14 2016-03-24 Mark Oderman Methods and Apparatus for Providing Virtual Military Satellite Communication (MILSATCOM) Services Utilizing Shared Spectrum and Orbital Assignments
US20190230568A1 (en) * 2018-01-19 2019-07-25 Hughes Network Systems, Llc User terminal handover prediction in wireless communications systems with nonstationary communications platforms
US10574337B1 (en) * 2019-02-11 2020-02-25 Gogo Llc Multi-constellation satellite terminal

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160087713A1 (en) * 2014-05-14 2016-03-24 Mark Oderman Methods and Apparatus for Providing Virtual Military Satellite Communication (MILSATCOM) Services Utilizing Shared Spectrum and Orbital Assignments
CN104835011A (en) * 2015-05-13 2015-08-12 中国西安卫星测控中心 Navigational constellation slow varying inter-satellite link planning method based on earth station layout constraints
US20190230568A1 (en) * 2018-01-19 2019-07-25 Hughes Network Systems, Llc User terminal handover prediction in wireless communications systems with nonstationary communications platforms
US10574337B1 (en) * 2019-02-11 2020-02-25 Gogo Llc Multi-constellation satellite terminal

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115801593A (en) * 2022-10-11 2023-03-14 西安电子科技大学 Walker constellation-oriented capacity maximization topological structure design method
CN115801593B (en) * 2022-10-11 2024-05-14 西安电子科技大学 Walker constellation-oriented capacity maximization topological structure design method

Also Published As

Publication number Publication date
CN113840294B (en) 2023-08-08

Similar Documents

Publication Publication Date Title
Wang et al. AI-based cloud-edge-device collaboration in 6G space-air-ground integrated power IoT
CN110166114B (en) Time-varying inter-satellite link network topology planning method for satellite navigation system
CN109756946B (en) Multi-agent cooperative regulation and control formation method
CN113840294A (en) Method for planning different-rail links of satellite constellation network
CN112799784A (en) Low-orbit satellite network optimal task allocation method based on decentralized computing
CN115392813B (en) On-orbit event arrangement and resource allocation planning method based on hierarchical optimization
CN108199763B (en) Repeater satellite method for scheduling task and system
Zheng et al. Topology control in self-organized optical satellite networks based on minimum weight spanning tree
CN104469985A (en) Space information network system based on low-earth-orbit satellite constellation
CN105490795A (en) Mobile wireless network node one-dimensional disposition method based on cooperative transmission technology
CN104486811A (en) Deep space optical network routing method based on ant colony algorithm
Kim et al. Satellite network slice planning: Architecture, performance analysis, and open issues
Zhou et al. Wireless sensor placement for bridge health monitoring using a generalized genetic algorithm
CN112733357B (en) Heterogeneous space network data transmission task collaborative planning method
Talbi et al. Designing cellular networks using a parallel hybrid metaheuristic on the computational grid
CN107182100A (en) Method for routing for the mobile agent of wireless sensor network
Ju et al. DRL-based beam allocation in relay-aided multi-user mmWave vehicular networks
KY et al. Distributed optimization in transportation and logistics networks
CN115580538A (en) Method for optimizing hierarchical block chain network structure based on algebraic connectivity
Sun et al. Scheduling optimization for UAV communication coverage using virtual force-based PSO model
Amit et al. Percolation in fractal spatial networks with long-range interactions
Cao et al. Energy-efficient multi-vehicle edge networks: a joint optimization algorithm for task splitting offloading and resource allocation
Wei et al. Dynamic controller placement for software-defined LEO network using deep reinforcement learning
Lung et al. Applying hierarchical agglomerative clustering to wireless sensor networks
Yuzhuo et al. Bi-level programming for continuous network design of comprehensive transportation system based on external optimization

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