CN112564774A - Service area scheduling method and system for low-earth-orbit constellation satellite communication system - Google Patents

Service area scheduling method and system for low-earth-orbit constellation satellite communication system Download PDF

Info

Publication number
CN112564774A
CN112564774A CN202011459441.XA CN202011459441A CN112564774A CN 112564774 A CN112564774 A CN 112564774A CN 202011459441 A CN202011459441 A CN 202011459441A CN 112564774 A CN112564774 A CN 112564774A
Authority
CN
China
Prior art keywords
satellite
area
service
scheduling
location
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
CN202011459441.XA
Other languages
Chinese (zh)
Other versions
CN112564774B (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.)
Nanjing Rongxing Zhilian Information Technology Co ltd
Original Assignee
Nanjing Rongxing Zhilian Information Technology Co ltd
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 Nanjing Rongxing Zhilian Information Technology Co ltd filed Critical Nanjing Rongxing Zhilian Information Technology Co ltd
Priority to CN202011459441.XA priority Critical patent/CN112564774B/en
Publication of CN112564774A publication Critical patent/CN112564774A/en
Application granted granted Critical
Publication of CN112564774B publication Critical patent/CN112564774B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18532—Arrangements for managing transmission, i.e. for transporting data or a signalling message
    • 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/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18539—Arrangements for managing radio, resources, i.e. for establishing or releasing a connection
    • 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/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18545—Arrangements for managing station mobility, i.e. for station registration or localisation
    • H04B7/18547—Arrangements for managing station mobility, i.e. for station registration or localisation for geolocalisation of a station
    • 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/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18545—Arrangements for managing station mobility, i.e. for station registration or localisation
    • H04B7/18556—Arrangements for managing station mobility, i.e. for station registration or localisation using a location database
    • 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/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18558—Arrangements for managing communications, i.e. for setting up, maintaining or releasing a call between stations
    • 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

Abstract

The invention provides a service area scheduling method and system of a low-earth-orbit constellation satellite communication system, aiming at overcoming the challenges brought to resource allocation and service area scheduling by high dynamics and service distribution nonuniformity of a low-earth-orbit satellite.

Description

Service area scheduling method and system for low-earth-orbit constellation satellite communication system
Technical Field
The invention relates to a service area scheduling method and system of a low-earth constellation satellite communication system, and relates to the field of wireless communication networks.
Background
The low-orbit constellation satellite communication system is composed of dozens of to tens of thousands of low-orbit satellites at the height of 200-2000 km, and the satellites form a satellite constellation to provide services such as high-speed communication, internet access and the like for various users of a foundation, a sea foundation, a space foundation and a space foundation. In recent years, low earth constellation satellite communication systems have been gaining attention from various countries around the world due to their advantages of short transmission distance, wide coverage, low cost, and being capable of providing high-speed low-delay communication and internet access, and have been regarded as an important supplement to terrestrial mobile communication systems, and have become an important component of all-in-one communication systems and 6G mobile communication systems.
In a low-orbit constellation satellite communication system, a service area scheduling algorithm is a core function of a wireless resource scheduling center and is limited by various factors such as position area distribution, service distribution, high-orbit interference avoidance, interference management, satellite-to-position area (user) visible time, satellite-to-ground distance, satellite resources, service area continuity, inheritance and the like. Therefore, the service area scheduling algorithm is very complex but indispensable, is directly related to the optimal configuration of global resources, and plays a vital role in the efficient operation of the low-earth constellation satellite communication system.
At present, in GEO satellite communication, scheduling of a service area basically adopts relatively fixed area division, and an area served by each satellite is relatively fixed; in particular to multi-beam GEO satellite communication systems, the phase division of each beam is also relatively fixed.
The defects of the fixed division mechanism of the service area of the GEO satellite communication system are as follows: the service area can not be rapidly adjusted along with the change of service and the change of satellite capability and resources, the configuration is not flexible, and the user satisfaction and the resource utilization rate are not high; the system has poor expandability and is not beneficial to subsequent expansion transformation. In the service area scheduling of the low-earth constellation satellite communication system, although the iridium communication system adopts the concept of a location area to quantify the traffic, users facing the iridium communication system are relatively fixed, the service distribution is relatively stable, the system resource allocation and scheduling are relatively simple, and a mature mechanism for coping with high-dynamic users and traffic changes is not established.
Disclosure of Invention
The purpose of the invention is as follows: an object is to provide a method for scheduling a service area of a low earth constellation satellite communication system, so as to solve the above problems in the prior art. A further object is to propose a system implementing the above method.
The technical scheme is as follows: a service area scheduling method of a low earth constellation satellite communication system comprises the following steps:
step 1, inputting time or reading time from a system time service and synchronous system; reading user service data and user position information from a network management system through a Redis cache database, and reading a scheduling instruction from the network management system through the Redis cache database;
step 2, reading ephemeris data from the control center or a Mongo basic database, and calculating the real-time position and the motion direction of each satellite in the system according to the ephemeris data;
step 3, calculating and shutting down part of satellite loads in the high-latitude area according to the real-time position, the motion direction and the orbit number of the satellite;
step 4, reading the real-time coverage area of each satellite from a previously calculated and stored Mongo database, and judging whether instruction scheduling exists; if yes, turning to step 5; if not, go to step 6;
step 5, dispatching the service area of the emergency area;
step 6, carrying out service area scheduling on the single-satellite coverage area and the multi-satellite coverage area;
and 7, storing the service area scheduling data to a Redis cache database.
In a further embodiment, the parameter epsilon is established when the service area scheduling is performed on the emergency area in step 5sdTo measure the bitAnd (3) a location area, wherein when a plurality of satellites cover the location area, the standard of the satellite is selected as follows:
Figure BDA0002830856570000021
selecting epsilon larger than a predetermined valuesdAccessing; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdRespectively, the weights of time and distance.
In a further embodiment, the service area scheduling further comprises the steps of:
step 5-1, acquiring the satellite space position and the satellite down-pointing position at the next moment based on the ephemeris;
step 5-2, using each satellite sub-satellite point position area, searching the position area covered by the satellite through a database table, and generating a position area service dynamic database;
and 5-3, searching a necessary service position area of each star by using the position area coverage database, and calculating the traffic while searching. The location areas allocated to the location areas of the necessary service areas are aggregated into
Figure BDA0002830856570000022
The unallocated location area is set as
Figure BDA0002830856570000023
Step 5-4, calculating according to the location area, the user distribution and the service distribution
Figure BDA0002830856570000024
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure BDA0002830856570000025
With a corresponding traffic (or required resources) distribution of
Figure BDA0002830856570000026
Step 5-5D is defined through loop iteration, and whether d is positioned in the position area set is judged
Figure BDA0002830856570000031
Internal; if yes, entering step 5-8, otherwise, jumping out of the loop; wherein d represents a corresponding location area within the set of location areas;
step 5-6, firstly finding a satellite set with the visible time exceeding a preset threshold value from the satellite sets in the coverage area, or finding 1-3 satellite sets with the longest visible time;
step 5-7, selecting a satellite with the closest distance from the satellite set obtained in the step 5-6 as a service satellite, wherein the corresponding position area d is the service area of the satellite;
step 5-8, searching a satellite set which can cover d and has residual resources
Figure BDA0002830856570000032
Step 5-9, calculating d and
Figure BDA0002830856570000033
epsilon between middle satellitessdIn a
Figure BDA0002830856570000034
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure BDA0002830856570000035
To form a new unallocated location area set
Figure BDA0002830856570000036
Step 5-10, updating the satellite smIs left over resource Rsm←Rsm-Rd；
Step 5-11, defining d through loop iteration, and judging whether d is positioned in the unallocated position area set
Figure BDA0002830856570000037
Internal; if yes, entering step 5-12, otherwise, jumping out of the loop;
step 5-12, calculating epsilon between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d.
In a further embodiment, the method for performing service area scheduling on the single-satellite coverage area and the multi-satellite coverage area in step 6 is the same, and includes the following steps: establishing a parameter epsilonsdTo measure the location area, when a plurality of satellites cover, the standard of the satellite is selected as follows:
Figure BDA0002830856570000038
selecting epsilon larger than a predetermined valuesdAccessing; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdWeights for time and distance, respectively;
further comprising the steps of:
step 6-1, acquiring the satellite space position and the satellite down-pointing position at the next moment based on the ephemeris;
step 6-2, using each satellite sub-satellite point position area, searching the position area covered by the satellite through a database table, and generating a position area service dynamic database;
and 6-3, searching a necessary service position area of each star by using the position area coverage database, and calculating the traffic while searching. The location areas allocated to the location areas of the necessary service areas are aggregated into
Figure BDA0002830856570000039
The unallocated location area is set as
Figure BDA00028308565700000310
6-4, calculating according to the location area, the user distribution and the service distribution
Figure BDA0002830856570000041
Traffic in each location area, locations where there will be trafficThe areas are sorted according to the size of the service volume and stored in a set to form a position area set with the service
Figure BDA0002830856570000042
With a corresponding traffic (or required resources) distribution of
Figure BDA0002830856570000043
6-5, defining d through loop iteration, and judging whether d is positioned in the position area set
Figure BDA0002830856570000044
Internal; if yes, entering step 5-8, otherwise, jumping out of the loop; where d represents the corresponding location area within the set of location areas.
In a further embodiment, step 6 further comprises the steps of:
6-6, firstly finding a satellite set with the visible time exceeding a preset threshold value from the satellite sets in the coverage area, or finding 1-3 satellite sets with the longest visible time;
6-7, selecting a satellite with the closest distance from the satellite set obtained in the step 6-6 as a service satellite, wherein the corresponding position area d is a service area of the satellite;
6-8, searching a satellite set which can cover d and has residual resources
Figure BDA0002830856570000045
Step 6-9, calculating d and
Figure BDA0002830856570000046
epsilon between middle satellitessdIn a
Figure BDA0002830856570000047
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure BDA0002830856570000048
To form a new unallocated location area set
Figure BDA0002830856570000049
Step 6-10, updating the satellite smIs left over resource Rsm←Rsm-Rd；
6-11, defining d through loop iteration, and judging whether d is positioned in the unallocated position area set
Figure BDA00028308565700000410
Internal; if yes, entering step 6-12, otherwise, jumping out of the loop;
step 6-12, calculating epsilon between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d.
A service area scheduling system of a low earth orbit constellation satellite communication system comprises a first module used for inputting time or reading time from the system time service and synchronization system; the second module is used for reading ephemeris data from the control center or the Mongo basic database and calculating the real-time position and the motion direction of each satellite in the system according to the ephemeris data; the third module is used for calculating and shutting down part of satellite loads in the high-latitude area according to the real-time position, the motion direction and the orbit number of the satellite; a fourth module for reading the real-time coverage area of each satellite from the Mongo database and judging whether instruction scheduling exists; a fifth module for scheduling the emergency area for a service area; a sixth module for performing service area scheduling for the single-satellite coverage area and the multi-satellite coverage area; and a seventh module for saving the service area scheduling data to a Redis cache database.
In a further embodiment, the first module further reads user service data and user location information from the network management system through a Redis cache database, and reads a scheduling instruction from the network management system through the Redis cache database;
the fourth module is further used for judging whether instruction scheduling exists or not, and if so, switching to the fifth module; if not, the operation is switched to a sixth module.
In a further embodiment, the fifth module and the sixth module are further configured to establish a parameter epsilon when performing service area scheduling on an emergency areasdTo measure the location area, when a plurality of satellites cover, the standard of the satellite is selected as follows:
Figure BDA0002830856570000051
selecting epsilon larger than a predetermined valuesdAccessing; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdRespectively, the weights of time and distance.
In a further embodiment, the fifth module and the sixth module further obtain a satellite space position and an intersatellite point position at a next moment based on ephemeris; searching a position area covered by the satellite by using each satellite sub-satellite position area through a database table to generate a position area service dynamic database; searching a necessary service position area of each satellite by using a position area coverage database, and calculating the service volume while searching; the location areas allocated to the location areas of the necessary service areas are aggregated into
Figure BDA0002830856570000052
The unallocated location area is set as
Figure BDA0002830856570000053
According to location area, user distribution, service distribution calculation
Figure BDA0002830856570000054
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure BDA0002830856570000055
With a corresponding traffic (or required resources) distribution of
Figure BDA0002830856570000056
Defining d by loop iteration, judging dWhether or not to be located in a set of location areas
Figure BDA0002830856570000057
Internal; if so, searching a satellite set which can cover d and has residual resources
Figure BDA0002830856570000058
Otherwise, jumping out of the cycle; where d represents the corresponding location area within the set of location areas.
In a further embodiment, the fifth module and the sixth module further find a set of satellites with a view time exceeding a predetermined threshold from the set of satellites in the coverage area, or find a set of 1-3 satellites with the longest view time; selecting a satellite with the closest distance from the obtained satellite set as a service satellite, wherein the corresponding position area d is a service area of the satellite; calculating d and
Figure BDA0002830856570000059
epsilon between middle satellitessdIn a
Figure BDA00028308565700000510
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure BDA00028308565700000511
To form a new unallocated location area set
Figure BDA00028308565700000512
Updating satellites smIs left over resource Rsm←Rsm-Rd(ii) a D is defined through loop iteration, and whether d is positioned in the unallocated position area set or not is judged
Figure BDA00028308565700000513
Internal; if so, then calculate ε between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d, otherwise the loop is skipped.
Has the advantages that: the invention relates to a service area scheduling method and a system of a low-orbit constellation satellite communication system, aiming at overcoming the challenges brought to resource allocation and service area scheduling by high dynamics and service distribution nonuniformity of a low-orbit satellite.
Drawings
Fig. 1 is a global position division diagram of the present invention spaced 1 deg..
Fig. 2 is a global position division diagram of the present invention spaced 0.5 deg..
Fig. 3 is a flow chart of the dispatch center service area dispatch of the present invention.
Fig. 4 is a diagram of an example of scheduling for a service area of a low earth constellation satellite communication system in accordance with the present invention.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without one or more of these specific details. In other instances, well-known features have not been described in order to avoid obscuring the present invention.
The applicant believes that in a low earth orbit constellation satellite communication system, an efficient and reliable service area scheduling system is the basis for radio resource scheduling. In the existing low earth orbit satellite communication, no more sophisticated algorithms and systems are available to perform this task, which is determined by the following factors:
although low earth constellation satellite communication systems have been studied for over 20 years, the real emphasis has been placed on starting with the 2015 project of SpaceX's declaration of "star chains". Therefore, the low earth orbit constellation satellite communication system is really a new thing, many systems are still in the experimental star stage, many research and experimental works are still in the gradual progress, and many theoretical and engineering problems need to be solved, including the management of the wireless resources of the low earth orbit constellation satellite communication system.
The low-orbit satellite has high relative ground movement speed, the high dynamic property brings challenges to the scheduling stability of a low-orbit satellite communication service area, complex real-time calculation is needed, and the requirements are difficult to meet at present.
The visible time of the low earth orbit satellite to one area is generally from several minutes to tens of minutes, so that the problem of frequent switching between different satellites and different beams by a user is brought, and a great problem is brought to system design.
The non-uniformity of ground users and traffic distribution also presents challenges to the scheduling of service areas in low-earth constellation satellite communication systems.
The spectrum management policies and frequency conditions of different regions are different, so that the available resources of the satellite in the space time of different regions are different, which also brings serious challenges to the allocation of system resources and the division of service areas.
In summary, the resource allocation and service area scheduling of the low earth orbit constellation satellite communication system face a serious challenge caused by factors such as a high dynamic satellite of the low earth orbit constellation satellite communication system, complexity of available resources, non-uniformity of service distribution and the like, the factors to be considered are very many, and the complexity of a scheduling algorithm is also very high. Therefore, at the present stage, no low-earth orbit satellite system has a relatively perfect service area scheduling scheme, let alone implemented in a practical system.
The inherent high dynamics and potential non-uniformity of service distribution of the low-earth constellation satellite communication system make the service area of the low-earth constellation satellite communication system change with the movement of the satellite and the distribution of service, which is the biggest difference with the high-earth constellation satellite communication system and the ground mobile communication system. Therefore, how to realize service-oriented satellite service area scheduling in real time and efficiently aiming at high dynamic property and service distribution nonuniformity of the low-earth orbit satellite and realize efficient utilization of satellite resources is a key problem to be solved by a wireless resource scheduling subsystem of a low-earth orbit constellation satellite communication system. Mainly solves the following two problems:
firstly, how to calculate and dynamically schedule the service area of the satellite in real time according to the real-time dynamic changes of the satellite position and resources, the constellation topology, the user distribution and the service distribution.
Secondly, how to guarantee the reasonable scheduling of service area and resources and simultaneously guarantee the longer visible time between the user and the satellite so as to reduce the switching times of the user between the satellite and the beam, guarantee the real-time reliable connection of the satellite-ground link and reduce the switching overhead.
In order to overcome the challenges brought to resource allocation and service area scheduling by high dynamics and service distribution nonuniformity of low-orbit satellites, the invention analyzes various influence factors needing to be considered and principles needing to be followed in service area scheduling on the basis of deeply researching the characteristics of a low-orbit constellation satellite communication system, provides the idea of quantizing user services and scheduling the service area by using a position area, designs a scheme for scheduling the service area by taking satellite coverage, high-orbit evasion, satellite resources, visible time and satellite-ground distance as references, and provides a scheduling algorithm based on multi-objective optimization, thereby realizing real-time, efficient and reliable service area scheduling of the low-orbit constellation satellite communication system.
The invention is described in more detail below:
division of location area
In a low earth orbit constellation satellite communication system, a position area is used as a measure for measuring the traffic and the service distribution, and the service is decoupled from a user through the position area. By introducing the concept of the location area, firstly, the quantification of user services is realized; secondly, in general, the coverage of the satellite is divided by regions, and the introduction of the location region realizes the association of the coverage and service of the satellite with the regions.
The global location zoning is shown in figures 1 and 2. Wherein, the latitude dimension is 1 degree/0.5 degree; in the longitude dimension, all the longitude lines converge from the equator to the north and south poles, so that the longitude lines cannot be divided by using the same longitude value, and the longitude interval adopted in the division is larger as the longitude lines go to the high latitude. The scheme adopted by the invention is as follows:
(1) the 0.5-degree interval scheme specifically comprises the following steps:
1. when the latitude is 0-14 degrees, the longitude interval is 0.5 degrees;
2. when the latitude is 14-28 degrees, the longitude interval is 0.533 degrees;
3. when the latitude is 28-42 degrees, the longitude interval is 0.576 degrees;
4. the longitude interval is 0.74 degrees when the latitude is 42-56 degrees;
5. when the latitude is 56-70 degrees, the longitude interval is 1.111 degrees;
6. the longitude interval is 2.222 degrees when the latitude is 70-83.5 degrees;
7. the longitude interval is 4.4 degrees when the latitude is 83.5-87 degrees;
8. when the latitude is 87-88.5 degrees, the longitude interval is 9.5 degrees;
9. the longitude interval is 180 degrees when the latitude is 88.5-90 degrees.
(2) The 1-degree interval scheme specifically comprises the following steps:
1. when the latitude is 0-25 degrees, the longitude interval is 1 degree;
2. when the latitude is 25-50 degrees, the longitude interval is 1.667 degrees;
3. the longitude interval is 2.222 degrees when the latitude is 50-75 degrees;
4. when the latitude is 75-80 degrees, the longitude interval is 5.7 degrees;
5. when the latitude is 80-85 degrees, the longitude interval is 11.4 degrees;
6. when the latitude is 85-87.5 degrees, the longitude interval is 28 degrees;
7. the longitude interval is 180 degrees when the latitude is 87.5-90 degrees.
Second, service area scheduling
The service area scheduling algorithm is the core function of a wireless resource scheduling center and is limited by various factors such as location area distribution, service distribution, high-orbit interference avoidance, interference management, satellite-to-location area (user) visible time, satellite-to-ground distance, satellite resources, service area continuity, inheritance and the like. Therefore, the service area scheduling algorithm is very complex but indispensable, is directly related to the optimal configuration of global resources, and plays a vital role in the efficient operation of the low-earth constellation satellite communication system.
Aiming at the dynamic characteristics of the low earth orbit satellite, combining the technical characteristics and the application requirements of the low earth orbit constellation satellite communication system, through deep research and discussion, it is summarized that the following factors can influence the service area and the resource scheduling of the low earth orbit constellation satellite communication system:
the satellite moves at high speed to the ground to cause the coverage area to change constantly, thereby bringing about the change of the satellite service area;
uneven user distribution, variation in user traffic, and high-speed movement of highly dynamic users (high-speed rail, airplane, etc.), resulting in uneven and rapid variation in traffic distribution, can also present challenges to dynamic allocation of service areas and resources;
the available spectrum resources of the satellite also change dynamically due to different spectrum use policies and spectrum use conditions in various places;
the high-speed movement of the satellite causes the constellation topology, the connection relationship between the user (ground station) and the satellite to change constantly, resulting in frequent switching of the user (ground station) between different satellites, beams;
because the satellites of the low-orbit constellation satellite communication system converge towards the north and south poles in the high-latitude region, the overlapping coverage phenomenon of the satellites in the high-latitude region is very serious, and therefore, the load of part of the satellites needs to be shut down, and performance deterioration caused by mutual interference in the system is avoided.
The above system features present the following challenges to the service area and resource scheduling of the earth-orbiting satellite communication system:
the resources and services need to be adapted continuously according to the satellite dynamics, the user and service dynamics, and the dynamics of the available resources, thereby challenging the resource scheduling algorithm and the computing power of the scheduling center;
the topology changes due to the dynamics of the satellite and the user require frequent switching of the user between the satellite and the beam, resulting in high dynamics of the topology and instability of the link connection.
Therefore, to solve the service area scheduling and resource allocation of the low earth constellation satellite communication system needs to solve the following problems:
how can the service area of a satellite be quickly calculated and dynamically scheduled in real time based on the real-time dynamic changes in satellite position and resources, constellation topology, user distribution, traffic distribution?
How is a longer visibility time between the user and the satellite ensured while ensuring reasonable scheduling of the service area and resources, to reduce the number of times the user switches between the satellite and the beam, to ensure a reliable connection of the satellite-to-ground link in real time, and to reduce the switching overhead?
In solving the above problems, the following factors need to be included in the design and implementation of the service area scheduling and resource allocation algorithm flow:
variation in satellite position and coverage to ground, communication distance;
change in constellation topology;
change in satellite resources;
high rail interference avoidance situations;
user and traffic distribution variation;
user and satellite visibility time variation, etc.
For the above problems and factors to be considered, the system scheduling center should follow the following principles when performing service scheduling:
one is that the satellite must cover a location area within the service area. The service area of the satellite must be within the coverage area of the satellite, otherwise the communication conditions cannot be met, and the service cannot be provided for the users in the location area.
Secondly, GEO high-rail interference avoidance is required. The location area and satellite link needs to avoid alignment with the stationary orbit to avoid interference with the GEO satellite. If the location area and the existing satellite are connected through the vicinity of the stationary orbit, the adjacent satellite needs to be replaced to serve the location area.
Thirdly, satellite resources are available. The satellite needs to be sufficiently resource efficient to provide effective and reliable service to users within the service area. The balance of resource use among satellites can be kept as much as possible, and a certain margin is kept; if the resources are not enough, the user needs to be met in batches through user priority scheduling.
Fourth, the visibility time is as long as possible. In order to reduce the switching of users between different satellites and beams, ensure the relative stability of the connection, and save the switching overhead, a satellite service with longer visible time (or remaining visible time) needs to be selected for the position area.
Fifthly, the communication distance is as small as possible. In order to reduce link loss and improve information transmission reliability and efficiency, satellites close to a position area are selected as much as possible for service.
Therefore, in a service area scheduling algorithm of a low earth constellation satellite communication system, a plurality of factors such as a coverage area, interference avoidance, a visible time, a communication distance and the like need to be considered. These factors all need to have a corresponding algorithm to calculate, that is, the service area scheduling algorithm needs to include the following sub-algorithms: a satellite coverage calculation algorithm (a calculated memory table), an interference avoidance calculation algorithm, a visible time calculation algorithm, a satellite-to-ground distance calculation algorithm and the like.
The satellite service area scheduling is the core of the global resource allocation of the system, and the scheduling process is shown in fig. 3, which specifically includes the following steps:
1) inputting time or timing from the system and reading time from the synchronous system;
2) reading user service data and user position information from a network management system through a Redis cache database;
3) reading a scheduling instruction from a network management system through a Redis cache database;
4) reading ephemeris data from a control center or a Mongo basic database;
5) calculating the real-time position and the motion direction of each satellite in the system according to the ephemeris data;
6) calculating and shutting down part of satellite load in a high latitude area according to the real-time position, the motion direction and the orbit number of the satellite;
7) reading the real-time coverage area (represented by a set of location areas) of each star from the Mongo database;
8) judging whether instruction scheduling exists; if yes, turning to the step 9); if not, turning to the step 10;
9) scheduling the service area of the emergency area;
10) carrying out service area scheduling on the single satellite coverage area;
11) carrying out service area scheduling on the multi-satellite coverage area;
12) and storing the service area scheduling data to a Redis cache database.
When scheduling a service area of a satellite, factors such as ephemeris and resource conditions of the satellite, service of a location area, time of visibility of the location area to the satellite, and a distance between the location area and the satellite need to be considered. The service of the location area can be guaranteed, the resources of each satellite are balanced, and the resource allocation and utilization efficiency of the system is improved. The scheduling algorithm is as follows:
in this algorithm, a parameter ε is establishedsdWhen measuring the coverage of a plurality of satellites in a position area, selecting the standard of the satellite:
Figure BDA0002830856570000111
selecting larger epsilonsdAnd (6) accessing. Wherein T issdVisual time (total visual time or remaining visual time), DsdIs the distance between the satellite and the location area (user), λtAnd λdRespectively, the weights of time and distance.
The specific process is as follows:
and S1, acquiring the space position of the satellite and the position of the point under the satellite at the next moment based on the ephemeris.
And S2, searching a position area covered by the satellite (removing the position area needing interference avoidance) through a database table by using the satellite sub-satellite position area of each satellite, and generating a position area service dynamic database.
S3, searching a necessary service location area (including an area covered by only one satellite and an area which can be served by only one satellite due to interference avoidance, which are collectively called the necessary service area) of each satellite by using the location area coverage database, and calculating the traffic while searching. The location areas allocated to the location areas of the necessary service areas are aggregated into
Figure BDA0002830856570000112
(assigned service areas of all satellites) and the set of unassigned location areas are
Figure BDA0002830856570000113
(the total set of location areas is
Figure BDA0002830856570000114
)。
S4, calculating according to location area, user distribution and service distribution
Figure BDA0002830856570000115
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure BDA0002830856570000116
With a corresponding traffic (or required resources) distribution of
Figure BDA0002830856570000117
S5、For d in
Figure BDA0002830856570000118
(
Figure BDA0002830856570000119
To aggregate locations with traffic).
S6, first find the set of satellites with the visible time (remaining visible time) exceeding a certain threshold from the set of satellites in the coverage area, or find the set of 1-3 satellites with the longest visible time (remaining visible time).
And S7, selecting the satellite with the closest distance from the satellite set obtained in the last step as a service satellite, wherein the corresponding position area d is the service area of the satellite.
S8, finding a satellite set which can cover d and has residual resources
Figure BDA0002830856570000121
S9, calculating d and
Figure BDA0002830856570000122
epsilon between middle satellitessdIn a
Figure BDA0002830856570000123
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure BDA0002830856570000124
To form a new unallocated location area set
Figure BDA0002830856570000125
S10, updating satellite SmIs left over resource Rsm←Rsm-Rd。
S11、For d in
Figure BDA0002830856570000126
S12, calculating epsilon between d and satellite S covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d.
Fig. 4 is a diagram of an example of scheduling in a service area of a low-earth constellation satellite communication system after comprehensively considering various factors such as satellite motion, user and service distribution, interference avoidance, satellite-to-ground distance, available resources of a satellite, and visible time of the satellite to the location area.
As noted above, while the present invention has been shown and described with reference to certain preferred embodiments, it is not to be construed as limited thereto. Various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (10)

1. A service area scheduling method of a low earth orbit constellation satellite communication system is characterized by comprising the following steps:
step 1, inputting time or reading time from a system time service and synchronous system; reading user service data and user position information from a network management system through a Redis cache database, and reading a scheduling instruction from the network management system through the Redis cache database;
step 2, reading ephemeris data from the control center or a Mongo basic database, and calculating the real-time position and the motion direction of each satellite in the system according to the ephemeris data;
step 3, calculating and shutting down part of satellite loads in the high-latitude area according to the real-time position, the motion direction and the orbit number of the satellite;
step 4, reading the real-time coverage area of each satellite from a previously calculated and stored Mongo database, and judging whether instruction scheduling exists; if yes, turning to step 5; if not, go to step 6;
step 5, dispatching the service area of the emergency area;
step 6, carrying out service area scheduling on the single-satellite coverage area and the multi-satellite coverage area;
and 7, storing the service area scheduling data to a Redis cache database.
2. The method as claimed in claim 1, wherein the parameter epsilon is established when scheduling the service area in the emergency area in step 5sdTo measure the location area, when a plurality of satellites cover, the standard of the satellite is selected as follows:
Figure FDA0002830856560000011
selecting epsilon larger than a predetermined valuesdAccessing; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdRespectively, the weights of time and distance.
3. The method of claim 2, wherein the service area scheduling further comprises:
step 5-1, calculating the satellite space position and the satellite down-pointing position at the next moment based on the ephemeris;
step 5-2, using each satellite sub-satellite point position area, searching the position area covered by the satellite through a database table, and generating a position area service dynamic database;
step 5-3, searching a necessary service position area of each satellite by using a position area coverage database, and calculating the service volume while searching; the location areas allocated to the location areas of the necessary service areas are aggregated into
Figure FDA0002830856560000012
The unallocated location area is set as
Figure FDA0002830856560000013
Step 5-4, calculating according to the location area, the user distribution and the service distribution
Figure FDA0002830856560000014
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure FDA0002830856560000021
Which corresponds to a traffic distribution of
Figure FDA0002830856560000022
Step 5-5, defining d through loop iteration, and judging whether d is positioned in the position area set
Figure FDA0002830856560000023
Internal; if yes, entering step 5-8, otherwise, jumping out of the loop; wherein d represents a corresponding location area within the set of location areas;
step 5-6, firstly finding a satellite set with the visible time exceeding a preset threshold value from the satellite sets in the coverage area, or finding 1-3 satellite sets with the longest visible time;
step 5-7, selecting a satellite with the closest distance from the satellite set obtained in the step 5-6 as a service satellite, wherein the corresponding position area d is the service area of the satellite;
step 5-8, searching a satellite set which can cover d and has residual resources
Figure FDA0002830856560000024
Step 5-9, calculating d and
Figure FDA0002830856560000025
epsilon between middle satellitessdIn a
Figure FDA0002830856560000026
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure FDA0002830856560000027
To form a new unallocated location area set
Figure FDA0002830856560000028
Step 5-10, updating the satellite smIs left over resource Rsm←Rsm-Rd；
Step 5-11, defining d through loop iteration, and judging whether d is positioned in the unallocated position area set
Figure FDA0002830856560000029
Internal; if yes, entering step 5-12, otherwise, jumping out of the loop;
step 5-12, calculating epsilon between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d.
4. The method as claimed in claim 1, wherein the step 6 is performed by using a low earth orbit constellation satellite communication systemThe method for scheduling the service areas of the single-satellite coverage area and the multi-satellite coverage area is the same, and comprises the following steps: establishing a parameter epsilonsdTo measure the location area, when a plurality of satellites cover, the standard of the satellite is selected as follows:
Figure FDA00028308565600000210
selecting greater than a predetermined value epsilonsdThe satellite access; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdWeights for time and distance, respectively;
further comprising the steps of:
step 6-1, acquiring the satellite space position and the satellite down-pointing position at the next moment based on the ephemeris;
step 6-2, using each satellite sub-satellite point position area, searching the position area covered by the satellite through a database table, and generating a position area service dynamic database;
6-3, searching a necessary service position area of each satellite by using a position area coverage database, and calculating the traffic while searching; the location areas allocated to the location areas of the necessary service areas are aggregated into
Figure FDA0002830856560000031
The unallocated location area is set as
Figure FDA0002830856560000032
6-4, calculating according to the location area, the user distribution and the service distribution
Figure FDA0002830856560000033
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure FDA0002830856560000034
Which corresponds to a traffic distribution of
Figure FDA0002830856560000035
6-5, defining d through loop iteration, and judging whether d is positioned in the position area set
Figure FDA0002830856560000036
Internal; if yes, entering step 5-8, otherwise, jumping out of the loop; where d represents the corresponding location area within the set of location areas.
5. The method of claim 4, wherein step 6 further comprises the steps of:
6-6, firstly finding a satellite set with the visible time exceeding a preset threshold value from the satellite sets in the coverage area, or finding 1-3 satellite sets with the longest visible time;
6-7, selecting a satellite with the closest distance from the satellite set obtained in the step 6-6 as a service satellite, wherein the corresponding position area d is a service area of the satellite;
6-8, searching a satellite set which can cover d and has residual resources
Figure FDA0002830856560000037
Step 6-9, calculating d and
Figure FDA0002830856560000038
epsilon between middle satellitessdIn a
Figure FDA0002830856560000039
In selecting epsilonsdLargest and sufficient resource satellite smAssigning d to smService, i.e. d from
Figure FDA00028308565600000310
To form a new unallocated location area set
Figure FDA00028308565600000311
Step 6-10, updating the satellite smIs left over resource Rsm←Rsm-Rd；
6-11, defining d through loop iteration, and judging whether d is positioned in the unallocated position area set
Figure FDA00028308565600000312
Internal; if yes, entering step 6-12, otherwise, jumping out of the loop;
step 6-12, calculating epsilon between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d.
6. A service area scheduling method of a low earth orbit constellation satellite communication system is characterized by comprising the following modules:
the first module is used for inputting time or reading time from a system time service and synchronization system;
the second module is used for reading ephemeris data from the control center or the Mongo basic database and calculating the real-time position and the motion direction of each satellite in the system according to the ephemeris data;
the third module is used for calculating and shutting down part of satellite loads in the high-latitude area according to the real-time position, the motion direction and the orbit number of the satellite;
a fourth module for reading the real-time coverage area of each satellite from the Mongo database and judging whether instruction scheduling exists;
a fifth module for scheduling the emergency area for a service area;
a sixth module for performing service area scheduling for the single-satellite coverage area and the multi-satellite coverage area;
a seventh module for saving the service area scheduling data to a Redis cache database.
7. The method of claim 6, wherein the method comprises: the first module further reads user service data and user position information from the network management system through a Redis cache database, and reads a scheduling instruction from the network management system through the Redis cache database;
the fourth module is further used for judging whether instruction scheduling exists or not, and if so, switching to the fifth module; if not, the operation is switched to a sixth module.
8. The method of claim 6, wherein the method comprises: the fifth module and the sixth module are further used for establishing a parameter epsilon when service area scheduling is carried out on the emergency areasdTo measure the location area, when a plurality of satellites cover, the standard of the satellite is selected as follows:
Figure FDA0002830856560000041
selecting epsilon larger than a predetermined valuesdAccessing; wherein T issdFor visible time, DsdIs the distance between the satellite and the location area, λtAnd λdRespectively, the weights of time and distance.
9. The method of claim 8, wherein the method comprises: the fifth module and the sixth module further acquire the satellite space position and the satellite down-pointing position at the next moment on the basis of ephemeris; searching a position area covered by the satellite by using each satellite sub-satellite position area through a database table to generate a position area service dynamic database; searching a necessary service position area of each satellite by using a position area coverage database, and calculating the service volume while searching; the location areas allocated to the location areas of the necessary service areas are aggregated into
Figure FDA0002830856560000042
The unallocated location area is set as
Figure FDA0002830856560000043
According to location area and user classificationDistribution, business distribution calculation
Figure FDA0002830856560000044
The service volume of each position area in the position area is sorted according to the service volume and stored in a set to form a position area set with the service
Figure FDA0002830856560000045
Which corresponds to a traffic distribution of
Figure FDA0002830856560000046
D is defined through loop iteration, and whether d is positioned in the position area set is judged
Figure FDA0002830856560000047
Internal; if so, searching a satellite set which can cover d and has residual resources
Figure FDA0002830856560000051
Otherwise, jumping out of the cycle; where d represents the corresponding location area within the set of location areas.
10. The method of claim 9, wherein the method comprises: the fifth module and the sixth module further find a set of satellites with a visible time exceeding a predetermined threshold value from the set of satellites in the coverage area, or find a set of 1-3 satellites with the longest visible time; selecting a satellite with the closest distance from the obtained satellite set as a service satellite, wherein the corresponding position area d is a service area of the satellite; calculating d and
Figure FDA0002830856560000052
epsilon between middle satellitessdIn a
Figure FDA0002830856560000053
In selecting epsilonsdLargest and sufficient resource satellite smD is distributedTo smService, i.e. d from
Figure FDA0002830856560000054
To form a new unallocated location area set
Figure FDA0002830856560000055
Updating satellites smIs left over resource Rsm←Rsm-Rd(ii) a D is defined through loop iteration, and whether d is positioned in the unallocated position area set or not is judged
Figure FDA0002830856560000056
Internal; if so, then calculate ε between d and the satellite s covering dsdSelecting epsilonsdThe largest satellite serves as the serving satellite for d, otherwise the loop is skipped.
CN202011459441.XA 2020-12-11 2020-12-11 Service area scheduling method and system for low-earth-orbit constellation satellite communication system Active CN112564774B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011459441.XA CN112564774B (en) 2020-12-11 2020-12-11 Service area scheduling method and system for low-earth-orbit constellation satellite communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011459441.XA CN112564774B (en) 2020-12-11 2020-12-11 Service area scheduling method and system for low-earth-orbit constellation satellite communication system

Publications (2)

Publication Number Publication Date
CN112564774A true CN112564774A (en) 2021-03-26
CN112564774B CN112564774B (en) 2022-08-12

Family

ID=75062357

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011459441.XA Active CN112564774B (en) 2020-12-11 2020-12-11 Service area scheduling method and system for low-earth-orbit constellation satellite communication system

Country Status (1)

Country Link
CN (1) CN112564774B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114244419A (en) * 2021-11-16 2022-03-25 中国科学院计算技术研究所 Communication method for low-earth-orbit satellite
CN114884553A (en) * 2021-05-17 2022-08-09 银河航天(北京)网络技术有限公司 Method for mobility management of satellite communication system and method for managing wave position parameter set
CN115333610A (en) * 2022-08-26 2022-11-11 北京理工大学 Multi-satellite dynamic resource allocation method
CN116865842A (en) * 2023-09-05 2023-10-10 武汉能钠智能装备技术股份有限公司 Resource allocation system and method for communication multiple access edge computing server

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109660293A (en) * 2019-03-05 2019-04-19 航天恒星科技有限公司 For determining the method, equipment and storage device in Low-Orbit Satellite Communication system position area
US20190181946A1 (en) * 2016-04-14 2019-06-13 Telesat Canada Dual leo satellite system and method for global coverage
CN111525950A (en) * 2020-07-06 2020-08-11 南京凯瑞得信息科技有限公司 Terminal access and switching method for low-orbit mobile satellite communication system
CN111912412A (en) * 2020-06-05 2020-11-10 中国空间技术研究院 Application-oriented heterogeneous constellation space-ground integrated task planning method and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190181946A1 (en) * 2016-04-14 2019-06-13 Telesat Canada Dual leo satellite system and method for global coverage
CN109660293A (en) * 2019-03-05 2019-04-19 航天恒星科技有限公司 For determining the method, equipment and storage device in Low-Orbit Satellite Communication system position area
CN111912412A (en) * 2020-06-05 2020-11-10 中国空间技术研究院 Application-oriented heterogeneous constellation space-ground integrated task planning method and device
CN111525950A (en) * 2020-07-06 2020-08-11 南京凯瑞得信息科技有限公司 Terminal access and switching method for low-orbit mobile satellite communication system

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114884553A (en) * 2021-05-17 2022-08-09 银河航天(北京)网络技术有限公司 Method for mobility management of satellite communication system and method for managing wave position parameter set
CN114884553B (en) * 2021-05-17 2023-08-22 银河航天(北京)网络技术有限公司 Method for managing mobility of satellite communication system and method for managing wave position parameter set
CN114244419A (en) * 2021-11-16 2022-03-25 中国科学院计算技术研究所 Communication method for low-earth-orbit satellite
CN114244419B (en) * 2021-11-16 2023-01-24 中国科学院计算技术研究所 Communication method for low-orbit satellite
CN115333610A (en) * 2022-08-26 2022-11-11 北京理工大学 Multi-satellite dynamic resource allocation method
CN115333610B (en) * 2022-08-26 2023-07-18 北京理工大学 Multi-star dynamic resource allocation method
CN116865842A (en) * 2023-09-05 2023-10-10 武汉能钠智能装备技术股份有限公司 Resource allocation system and method for communication multiple access edge computing server
CN116865842B (en) * 2023-09-05 2023-11-28 武汉能钠智能装备技术股份有限公司 Resource allocation system and method for communication multiple access edge computing server

Also Published As

Publication number Publication date
CN112564774B (en) 2022-08-12

Similar Documents

Publication Publication Date Title
CN112564774B (en) Service area scheduling method and system for low-earth-orbit constellation satellite communication system
Zhang et al. Satellite mobile edge computing: Improving QoS of high-speed satellite-terrestrial networks using edge computing techniques
Alsharoa et al. Improvement of the global connectivity using integrated satellite-airborne-terrestrial networks with resource optimization
Zhang et al. Aerial edge computing on orbit: A task offloading and allocation scheme
CN112929074B (en) Satellite and high-altitude platform assisted satellite-ground edge computing task unloading method
CN113179120B (en) Space-ground integrated telecommunication satellite mobile communication system architecture and implementation method
CN108923838A (en) The master-salve distributed GEO communication satellite system framework of common rail
CN114665952B (en) Low-orbit satellite network beam-jumping optimization method based on star-ground fusion architecture
Zheng et al. Leo satellite channel allocation scheme based on reinforcement learning
Zhu et al. Creating efficient integrated satellite-terrestrial networks in the 6G era
RU2614049C2 (en) Global satellite communication and data transmission system with spacecraft at low circular orbit
Tuck et al. The CallingSM Network: a global wireless communication system
Darnopykh et al. Operative planning of functional sessions for multisatellite observation and communication systems
CN1119876C (en) Integrated satellite communication system frame and constellation
Wang et al. Hybrid satellite-aerial-terrestrial networks for public safety
Zhang et al. Hybrid GEO and IGSO satellite constellation design with ground supporting constraint for space information networks
Kashitani Development and application of an analysis methodology for satellite broadband network architectures
Zheng et al. Research on Key Technologies of Satellite Mobile Communication System
Mubarak et al. Techno-economic analysis of satellite implementation as a broadband internet provider in Indonesia
CN113543149B (en) Control method, device, system and storage medium for establishing feeder link
Zaglauer et al. Integrated satellite access to 5G/6G systems-an overview of the 5G space infrastructure study
Terziev et al. The Impact of Innovation in the Satellite Industry on the Telecommunications Services Market
Zhang et al. A Resource-Saving Multi-layer Fault-Tolerant Low Orbit Satellite Network
Fu et al. Optimal Computation Resource Allocation Scheme for LEO Satellite Networks
Mi et al. Multi-resource management for multi-tier space information networks: A cooperative game

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