The presence of the debris in the Earth’s orbit poses a significant risk to human activity in outer space.This debris population continues to grow due to ground launches,the loss of external parts from space ships,an...The presence of the debris in the Earth’s orbit poses a significant risk to human activity in outer space.This debris population continues to grow due to ground launches,the loss of external parts from space ships,and uncontrollable collisions between objects.A computationally feasible continuum model for the growth of the debris population and its spatial distribution is therefore critical.Here we propose a diffusion-collision model for the evolution of the debris density in the low-Earth orbit and its dependence on the ground-launch policy.We parametrize this model and test it against data from publicly available object catalogs to examine timescales for the uncontrolled growth.Finally,we consider sensible launch policies and cleanup strategies and how they reduce the future risk of collisions with active satellites or space ships.展开更多
By deploying the ubiquitous and reliable coverage of low Earth orbit(LEO)satellite networks using optical inter satel-lite link(OISL),computation offloading services can be provided for any users without proximal serv...By deploying the ubiquitous and reliable coverage of low Earth orbit(LEO)satellite networks using optical inter satel-lite link(OISL),computation offloading services can be provided for any users without proximal servers,while the resource limita-tion of both computation and storage on satellites is the impor-tant factor affecting the maximum task completion time.In this paper,we study a delay-optimal multi-satellite collaborative computation offloading scheme that allows satellites to actively migrate tasks among themselves by employing the high-speed OISLs,such that tasks with long queuing delay will be served as quickly as possible by utilizing idle computation resources in the neighborhood.To satisfy the delay requirement of delay-sensi-tive task,we first propose a deadline-aware task scheduling scheme in which a priority model is constructed to sort the order of tasks being served based on its deadline,and then a delay-optimal collaborative offloading scheme is derived such that the tasks which cannot be completed locally can be migrated to other idle satellites.Simulation results demonstrate the effective-ness of our multi-satellite collaborative computation offloading strategy in reducing task complement time and improving resource utilization of the LEO satellite network.展开更多
Survivability is used to evaluate the ability of the satellite to complete the mission after failure,while the duration of maintaining performance is often ignored.An effective backup strategy can restore the constell...Survivability is used to evaluate the ability of the satellite to complete the mission after failure,while the duration of maintaining performance is often ignored.An effective backup strategy can restore the constellation performance timely,and maintain good network communication performance in case of satellite failure.From the perspective of network utility,the low Earth orbit(LEO)satellite constellation survivable graphical eva-luation and review technology(GERT)network with backup satel-lites is constructed.A network utility transfer function algorithm based on moment generating function and Mason formula is proposed,the network survivability evaluation models of on-orbit backup strategy and ground backup strategy are established.The survivable GERT model can deduce the expected mainte-nance time of LEO satellite constellation under different fault states and the network utility generated during the state mainte-nance period.The case analysis shows that the proposed surviv-able GERT model can consider the satellite failure rate,backup satellite replacement rate,maneuver control replacement ability and life requirement,and effectively determine the optimal sur-vivable backup strategy for LEO satellite constellation with limi-ted resources according to the expected network utility.展开更多
This paper addresses the problem of sensor search scheduling in the complicated space environment faced by the low-earth orbit constellation.Several search scheduling methods based on the commonly used information gai...This paper addresses the problem of sensor search scheduling in the complicated space environment faced by the low-earth orbit constellation.Several search scheduling methods based on the commonly used information gain are compared via simulations first.Then a novel search scheduling method in the scenarios of uncertainty observation is proposed based on the global Shannon information gain and beta density based uncertainty model.Simulation results indicate that the beta density model serves a good option for solving the problem of target acquisition in the complicated space environments.展开更多
Focusing on carrying out GPS occultation observat io ns with a receiver set on LEO satellite, this paper develops the LEO orbit simul ation system based on which the occultation events can be simulated taking into acc...Focusing on carrying out GPS occultation observat io ns with a receiver set on LEO satellite, this paper develops the LEO orbit simul ation system based on which the occultation events can be simulated taking into account the geometric relationship of the satellites and the field of view of th e receiver antenna. In this paper, the impacts of 4 types of LEO orbit parameter s including argument of latitude (AOL), right ascension of ascending node (RAAN) , orbit height and orbit inclination on the distribution and number of occultati on events observed with a single LEO satellite are discussed through simulat ion and some conclusions are drawn.展开更多
Low earth orbit satellites,with unique advantages,are prosperous types of navigation augmentation satellites for the GNSS satellites constellations.The broadcast ephemeris element needs to be designed as an important ...Low earth orbit satellites,with unique advantages,are prosperous types of navigation augmentation satellites for the GNSS satellites constellations.The broadcast ephemeris element needs to be designed as an important index of the augmented LEOs.The GPS ephemerides of 16/18 elements cannot be directly applied to the LEOs because of the poor fitting accuracies in along-track positional component.Besides,the ill-conditioned problem of the normal-matrix exists in fitting algorithm due to the small eccentricity of the LEO orbits.Based on the nonsingular orbital elements,5 sets of ephemerides with element numbers from 16 to 19 were designed respectively by adding or modifying orbital elements magnifying the along-track and radial positional components.The fitting experiments based on the LEO of 300 to 1500 km altitudes show that the fitting UREs of the proposed 16/17/18/18*/19-element ephemerides are better than 10/6/4/5/2.5 cm,respectively.According to the dynamical range of the fitting elements,the interfaces were designed for the 5 sets of ephemerides.The effects of data truncation on fitting UREs are at millimeter level.The total bits are 329/343/376/379/396,respectively.29/15 bits are saved for the 16/17-element ephemerides compared with the GPS16 ephemeris,while 64/61/41 bits can be saved for the 18/18*/19-element ephemerides compared with the GPS18 elements ephemeris.展开更多
The low earth orbit(LEO) satellite system provides a promising solution for the global coverage of Internet of Things(IoT) services.Confronted with the sporadic uplink transmission from massive IoT terminals, this wor...The low earth orbit(LEO) satellite system provides a promising solution for the global coverage of Internet of Things(IoT) services.Confronted with the sporadic uplink transmission from massive IoT terminals, this work investigates the grant-free access scheme and resource allocation algorithm for the beam-hopping(BH) based LEO satellite systems.To improve the packet success rate, the time slots are pre-allocated to each cell according to the number of terrestrial terminals and the probability of packet arrival.When the packets arrive, the terrestrial terminals perform contention-free or contention-based grant-free access with packet repetition in the time slots allocated to their cells.The analytical expression of the packet collision probability for the grant-free access scheme is derived to provide reference for the resource allocation.To reduce the computational complexity, a heuristic resource allocation algorithm is proposed to minimize the maximum cell packet collision probability in the system.Simulation results show that the proposed resource allocation scheme achieves lower packet collision probability and higher resource utilization ratio when compared with the uniform resource allocation scheme.展开更多
The numbers of beam positions(BPs)and time slots for beam hopping(BH)dominate the latency of LEO satellite communications.Aiming at minimizing the number of BPs subject to a predefined requirement on the radius of BP,...The numbers of beam positions(BPs)and time slots for beam hopping(BH)dominate the latency of LEO satellite communications.Aiming at minimizing the number of BPs subject to a predefined requirement on the radius of BP,a low-complexity user density-based BP design scheme is proposed,where the original problem is decomposed into two subproblems,with the first one to find the sparsest user and the second one to determine the corresponding best BP.In particular,for the second subproblem,a user selection and smallest BP radius algorithm is proposed,where the nearby users are sequentially selected until the constraint of the given BP radius is no longer satisfied.These two subproblems are iteratively solved until all the users are selected.To further reduce the BP radius,a duplicated user removal algorithm is proposed to decrease the number of the users covered by two or more BPs.Aiming at minimizing the number of time slots subject to the no co-channel interference(CCI)constraint and the traffic demand constraint,a low-complexity CCI-free BH design scheme is proposed,where the BPs having difficulty in satisfying the constraints are considered to be illuminated in priory.Simulation results verify the effectiveness of the proposed schemes.展开更多
基金supported by a graduate fellowship from the Department of Mathematical Sciences at the University of Wisconsin-Milwaukee.
文摘The presence of the debris in the Earth’s orbit poses a significant risk to human activity in outer space.This debris population continues to grow due to ground launches,the loss of external parts from space ships,and uncontrollable collisions between objects.A computationally feasible continuum model for the growth of the debris population and its spatial distribution is therefore critical.Here we propose a diffusion-collision model for the evolution of the debris density in the low-Earth orbit and its dependence on the ground-launch policy.We parametrize this model and test it against data from publicly available object catalogs to examine timescales for the uncontrolled growth.Finally,we consider sensible launch policies and cleanup strategies and how they reduce the future risk of collisions with active satellites or space ships.
基金This work was supported by the National Key Research and Development Program of China(2021YFB2900600)the National Natural Science Foundation of China(61971041+2 种基金62001027)the Beijing Natural Science Foundation(M22001)the Technological Innovation Program of Beijing Institute of Technology(2022CX01027).
文摘By deploying the ubiquitous and reliable coverage of low Earth orbit(LEO)satellite networks using optical inter satel-lite link(OISL),computation offloading services can be provided for any users without proximal servers,while the resource limita-tion of both computation and storage on satellites is the impor-tant factor affecting the maximum task completion time.In this paper,we study a delay-optimal multi-satellite collaborative computation offloading scheme that allows satellites to actively migrate tasks among themselves by employing the high-speed OISLs,such that tasks with long queuing delay will be served as quickly as possible by utilizing idle computation resources in the neighborhood.To satisfy the delay requirement of delay-sensi-tive task,we first propose a deadline-aware task scheduling scheme in which a priority model is constructed to sort the order of tasks being served based on its deadline,and then a delay-optimal collaborative offloading scheme is derived such that the tasks which cannot be completed locally can be migrated to other idle satellites.Simulation results demonstrate the effective-ness of our multi-satellite collaborative computation offloading strategy in reducing task complement time and improving resource utilization of the LEO satellite network.
基金This work was supported by the National Natural Science Foundation of China(72271124,52232014,72071111,71801127,71671091).
文摘Survivability is used to evaluate the ability of the satellite to complete the mission after failure,while the duration of maintaining performance is often ignored.An effective backup strategy can restore the constellation performance timely,and maintain good network communication performance in case of satellite failure.From the perspective of network utility,the low Earth orbit(LEO)satellite constellation survivable graphical eva-luation and review technology(GERT)network with backup satel-lites is constructed.A network utility transfer function algorithm based on moment generating function and Mason formula is proposed,the network survivability evaluation models of on-orbit backup strategy and ground backup strategy are established.The survivable GERT model can deduce the expected mainte-nance time of LEO satellite constellation under different fault states and the network utility generated during the state mainte-nance period.The case analysis shows that the proposed surviv-able GERT model can consider the satellite failure rate,backup satellite replacement rate,maneuver control replacement ability and life requirement,and effectively determine the optimal sur-vivable backup strategy for LEO satellite constellation with limi-ted resources according to the expected network utility.
基金supported by the National Defense Pre-research Foundation (9140A21041110KG0148)
文摘This paper addresses the problem of sensor search scheduling in the complicated space environment faced by the low-earth orbit constellation.Several search scheduling methods based on the commonly used information gain are compared via simulations first.Then a novel search scheduling method in the scenarios of uncertainty observation is proposed based on the global Shannon information gain and beta density based uncertainty model.Simulation results indicate that the beta density model serves a good option for solving the problem of target acquisition in the complicated space environments.
文摘Focusing on carrying out GPS occultation observat io ns with a receiver set on LEO satellite, this paper develops the LEO orbit simul ation system based on which the occultation events can be simulated taking into account the geometric relationship of the satellites and the field of view of th e receiver antenna. In this paper, the impacts of 4 types of LEO orbit parameter s including argument of latitude (AOL), right ascension of ascending node (RAAN) , orbit height and orbit inclination on the distribution and number of occultati on events observed with a single LEO satellite are discussed through simulat ion and some conclusions are drawn.
文摘Low earth orbit satellites,with unique advantages,are prosperous types of navigation augmentation satellites for the GNSS satellites constellations.The broadcast ephemeris element needs to be designed as an important index of the augmented LEOs.The GPS ephemerides of 16/18 elements cannot be directly applied to the LEOs because of the poor fitting accuracies in along-track positional component.Besides,the ill-conditioned problem of the normal-matrix exists in fitting algorithm due to the small eccentricity of the LEO orbits.Based on the nonsingular orbital elements,5 sets of ephemerides with element numbers from 16 to 19 were designed respectively by adding or modifying orbital elements magnifying the along-track and radial positional components.The fitting experiments based on the LEO of 300 to 1500 km altitudes show that the fitting UREs of the proposed 16/17/18/18*/19-element ephemerides are better than 10/6/4/5/2.5 cm,respectively.According to the dynamical range of the fitting elements,the interfaces were designed for the 5 sets of ephemerides.The effects of data truncation on fitting UREs are at millimeter level.The total bits are 329/343/376/379/396,respectively.29/15 bits are saved for the 16/17-element ephemerides compared with the GPS16 ephemeris,while 64/61/41 bits can be saved for the 18/18*/19-element ephemerides compared with the GPS18 elements ephemeris.
基金Supported by the Science and Technology Innovation Action Plan of Shanghai (No. 21DZ2200200)the Science and Technology Cooperation Funding of Chengdu and CASthe National Key Research and Development Program of China (No. 2019YFB1803101)。
文摘The low earth orbit(LEO) satellite system provides a promising solution for the global coverage of Internet of Things(IoT) services.Confronted with the sporadic uplink transmission from massive IoT terminals, this work investigates the grant-free access scheme and resource allocation algorithm for the beam-hopping(BH) based LEO satellite systems.To improve the packet success rate, the time slots are pre-allocated to each cell according to the number of terrestrial terminals and the probability of packet arrival.When the packets arrive, the terrestrial terminals perform contention-free or contention-based grant-free access with packet repetition in the time slots allocated to their cells.The analytical expression of the packet collision probability for the grant-free access scheme is derived to provide reference for the resource allocation.To reduce the computational complexity, a heuristic resource allocation algorithm is proposed to minimize the maximum cell packet collision probability in the system.Simulation results show that the proposed resource allocation scheme achieves lower packet collision probability and higher resource utilization ratio when compared with the uniform resource allocation scheme.
基金supported in part by National Key Research and Development Program of China under Grant 2021YFB2900404。
文摘The numbers of beam positions(BPs)and time slots for beam hopping(BH)dominate the latency of LEO satellite communications.Aiming at minimizing the number of BPs subject to a predefined requirement on the radius of BP,a low-complexity user density-based BP design scheme is proposed,where the original problem is decomposed into two subproblems,with the first one to find the sparsest user and the second one to determine the corresponding best BP.In particular,for the second subproblem,a user selection and smallest BP radius algorithm is proposed,where the nearby users are sequentially selected until the constraint of the given BP radius is no longer satisfied.These two subproblems are iteratively solved until all the users are selected.To further reduce the BP radius,a duplicated user removal algorithm is proposed to decrease the number of the users covered by two or more BPs.Aiming at minimizing the number of time slots subject to the no co-channel interference(CCI)constraint and the traffic demand constraint,a low-complexity CCI-free BH design scheme is proposed,where the BPs having difficulty in satisfying the constraints are considered to be illuminated in priory.Simulation results verify the effectiveness of the proposed schemes.
