This paper investigates the low earth orbit(LEO)satellite-enabled coded compressed sensing(CCS)unsourced random access(URA)in orthogonal frequency division multiple access(OFDMA)framework,where a massive uniform plana...This paper investigates the low earth orbit(LEO)satellite-enabled coded compressed sensing(CCS)unsourced random access(URA)in orthogonal frequency division multiple access(OFDMA)framework,where a massive uniform planar array(UPA)is equipped on the satellite.In LEO satellite communications,unavoidable timing and frequency offsets cause phase shifts in the transmitted signals,substantially diminishing the decoding performance of current terrestrial CCS URA receiver.To cope with this issue,we expand the inner codebook with predefined timing and frequency offsets and formulate the inner decoding as a tractable compressed sensing(CS)problem.Additionally,we leverage the inherent sparsity of the UPA-equipped LEO satellite angular domain channels,thereby enabling the outer decoder to support more active devices.Furthermore,the outputs of the outer decoder are used to reduce the search space of the inner decoder,which cuts down the computational complexity and accelerates the convergence of the inner decoding.Simulation results verify the effectiveness of the proposed scheme.展开更多
Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO sate...Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO satellite communication system cannot meet the requirements of users when the satellite-terrestrial link is blocked by obstacles. To solve this problem, we introduce Intelligent reflect surface(IRS) for improving the achievable rate of terrestrial users in LEO satellite communication. We investigated joint IRS scheduling, user scheduling, power and bandwidth allocation(JIRPB) optimization algorithm for improving LEO satellite system throughput.The optimization problem of joint user scheduling and resource allocation is formulated as a non-convex optimization problem. To cope with this problem, the nonconvex optimization problem is divided into resource allocation optimization sub-problem and scheduling optimization sub-problem firstly. Second, we optimize the resource allocation sub-problem via alternating direction multiplier method(ADMM) and scheduling sub-problem via Lagrangian dual method repeatedly.Third, we prove that the proposed resource allocation algorithm based ADMM approaches sublinear convergence theoretically. Finally, we demonstrate that the proposed JIRPB optimization algorithm improves the LEO satellite communication system throughput.展开更多
In LEO satellite communication networks,the number of satellites has increased sharply, the relative velocity of satellites is very fast, then electronic signal aliasing occurs from time to time. Those aliasing signal...In LEO satellite communication networks,the number of satellites has increased sharply, the relative velocity of satellites is very fast, then electronic signal aliasing occurs from time to time. Those aliasing signals make the receiving ability of the signal receiver worse, the signal processing ability weaker,and the anti-interference ability of the communication system lower. Aiming at the above problems, to save communication resources and improve communication efficiency, and considering the irregularity of interference signals, the underdetermined blind separation technology can effectively deal with the problem of interference sensing and signal reconstruction in this scenario. In order to improve the stability of source signal separation and the security of information transmission, a greedy optimization algorithm can be executed. At the same time, to improve network information transmission efficiency and prevent algorithms from getting trapped in local optima, delete low-energy points during each iteration process. Ultimately, simulation experiments validate that the algorithm presented in this paper enhances both the transmission efficiency of the network transmission system and the security of the communication system, achieving the process of interference sensing and signal reconstruction in the LEO satellite communication system.展开更多
The ultra-dense low earth orbit(LEO)integrated satellite-terrestrial networks(UDLEO-ISTN)can bring lots of benefits in terms of wide coverage,high capacity,and strong robustness.Meanwhile,the broadcasting and open nat...The ultra-dense low earth orbit(LEO)integrated satellite-terrestrial networks(UDLEO-ISTN)can bring lots of benefits in terms of wide coverage,high capacity,and strong robustness.Meanwhile,the broadcasting and open natures of satellite links also reveal many challenges for transmission security protection,especially for eavesdropping defence.How to efficiently take advantage of the LEO satellite’s density and ensure the secure communication by leveraging physical layer security with the cooperation of jammers deserves further investigation.To our knowledge,using satellites as jammers in UDLEO-ISTN is still a new problem since existing works mainly focused on this issue only from the aspect of terrestrial networks.To this end,we study in this paper the cooperative secrecy communication problem in UDLEOISTN by utilizing several satellites to send jamming signal to the eavesdroppers.An iterative scheme is proposed as our solution to maximize the system secrecy energy efficiency(SEE)via jointly optimizing transmit power allocation and user association.Extensive experiment results verify that our designed optimization scheme can significantly enhance the system SEE and achieve the optimal power allocation and user association strategies.展开更多
Low Earth orbit(LEO) satellite systems provide terrestrial users with services that are not limited by geographical location. However, the conflict between existing allocation schemes and the business variability betw...Low Earth orbit(LEO) satellite systems provide terrestrial users with services that are not limited by geographical location. However, the conflict between existing allocation schemes and the business variability between beams is becoming increasingly prominent. Beam hopping technology allows for a more flexible and versatile approach to satellite resource allocation. This paper proposes a beam hopping pattern optimization scheme that jointly considers the interference threshold distance and beam service priority, reducing the inter-beam co-channel interference(CCI). In the cluster area, a non-orthogonal multiple access(NOMA)-based collaborative beam hopping(NCBH) scheme is proposed to minimize the cell-edge user(CEU) interference. Since there is a difference in channel gain between the CEU and cellcenter user(CCU), this scheme forms a NOMA cluster to perform power domain multiplexing and formulates a NOMA cluster pairing strategy according to the user location to reduce the CCI of the CEU. After NOMA cluster pairing, the optimal carrier frequency of the NOMA cluster is selected by a reinforcement learning algorithm. The simulation results verify the excellent performance of the proposed NCBH scheme regarding the user’s received power, transmission rate, and outage probability.展开更多
The gradual deployment of Low-Earth Orbit(LEO)mega constellations with inter-satellite links(ISLs)promises ubiquitous,low-latency,and high-throughput satellite network services.However,networked LEO satellites with IS...The gradual deployment of Low-Earth Orbit(LEO)mega constellations with inter-satellite links(ISLs)promises ubiquitous,low-latency,and high-throughput satellite network services.However,networked LEO satellites with ISLs are also at risk of routing attacks such as hijacking.Existing defenses against route hijacking in terrestrial networks can hardly work for the LEO satellite network due to its high spatiotemporal dynamics.To deal with it,we propose RPD,a high-risk routing path detection method for LEO mega-constellation networks.RPD detects abnormal high-risk LEO network paths by checking the consistency between the path delay and the geographical distance.This is efficiently achieved by combining in-band measurements and out-of-band statistical processing to detect the anomaly of the clustering feature in the reference delay matrix.RPD avoids the recalculation of the header cryptographic marks when the handover occurs,thus greatly reducing the cost and improving the performance of highrisk path detection.Experiments showed that the proposed RPD mechanism achieves an average detection accuracy of 91.64%under normal network conditions,and maintain about 89%even when congestion occurs in multiple areas of the network and measurement noise is considered.In addition,RPD does not require any cryptographic operation on the intermediate node,only minimal communication cost with excellent scalability and deployability.展开更多
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.展开更多
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.展开更多
基金supported by the National Key R&D Program of China under Grant 2023YFB2904703the National Natural Science Foundation of China under Grant 62341110,62371122 and 62322104+1 种基金the Jiangsu Province Basic Research Project under Grant BK20192002the Fundamental Research Funds for the Central Universities under Grant 2242022k30005 and 2242023K5003。
文摘This paper investigates the low earth orbit(LEO)satellite-enabled coded compressed sensing(CCS)unsourced random access(URA)in orthogonal frequency division multiple access(OFDMA)framework,where a massive uniform planar array(UPA)is equipped on the satellite.In LEO satellite communications,unavoidable timing and frequency offsets cause phase shifts in the transmitted signals,substantially diminishing the decoding performance of current terrestrial CCS URA receiver.To cope with this issue,we expand the inner codebook with predefined timing and frequency offsets and formulate the inner decoding as a tractable compressed sensing(CS)problem.Additionally,we leverage the inherent sparsity of the UPA-equipped LEO satellite angular domain channels,thereby enabling the outer decoder to support more active devices.Furthermore,the outputs of the outer decoder are used to reduce the search space of the inner decoder,which cuts down the computational complexity and accelerates the convergence of the inner decoding.Simulation results verify the effectiveness of the proposed scheme.
基金supported by the National Key R&D Program of China under Grant 2020YFB1807900the National Natural Science Foundation of China (NSFC) under Grant 61931005Beijing University of Posts and Telecommunications-China Mobile Research Institute Joint Innovation Center。
文摘Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO satellite communication system cannot meet the requirements of users when the satellite-terrestrial link is blocked by obstacles. To solve this problem, we introduce Intelligent reflect surface(IRS) for improving the achievable rate of terrestrial users in LEO satellite communication. We investigated joint IRS scheduling, user scheduling, power and bandwidth allocation(JIRPB) optimization algorithm for improving LEO satellite system throughput.The optimization problem of joint user scheduling and resource allocation is formulated as a non-convex optimization problem. To cope with this problem, the nonconvex optimization problem is divided into resource allocation optimization sub-problem and scheduling optimization sub-problem firstly. Second, we optimize the resource allocation sub-problem via alternating direction multiplier method(ADMM) and scheduling sub-problem via Lagrangian dual method repeatedly.Third, we prove that the proposed resource allocation algorithm based ADMM approaches sublinear convergence theoretically. Finally, we demonstrate that the proposed JIRPB optimization algorithm improves the LEO satellite communication system throughput.
基金supported by National Natural Science Foundation of China (62171390)Central Universities of Southwest Minzu University (ZYN2022032,2023NYXXS034)the State Scholarship Fund of the China Scholarship Council (NO.202008510081)。
文摘In LEO satellite communication networks,the number of satellites has increased sharply, the relative velocity of satellites is very fast, then electronic signal aliasing occurs from time to time. Those aliasing signals make the receiving ability of the signal receiver worse, the signal processing ability weaker,and the anti-interference ability of the communication system lower. Aiming at the above problems, to save communication resources and improve communication efficiency, and considering the irregularity of interference signals, the underdetermined blind separation technology can effectively deal with the problem of interference sensing and signal reconstruction in this scenario. In order to improve the stability of source signal separation and the security of information transmission, a greedy optimization algorithm can be executed. At the same time, to improve network information transmission efficiency and prevent algorithms from getting trapped in local optima, delete low-energy points during each iteration process. Ultimately, simulation experiments validate that the algorithm presented in this paper enhances both the transmission efficiency of the network transmission system and the security of the communication system, achieving the process of interference sensing and signal reconstruction in the LEO satellite communication system.
基金supported by National Key R&D Program of China(2022YFB3104200)in part by National Natural Science Foundation of China(62202386)+6 种基金in part by Basic Research Programs of Taicang(TC2021JC31)in part by Fundamental Research Funds for the Central Universities(D5000210817)in part by Xi’an Unmanned System Security and Intelligent Communications ISTC Centerin part by Special Funds for Central Universities Construction of World-Class Universities(Disciplines)and Special Development Guidance(0639022GH0202237 and 0639022SH0201237)in part by the Henan Key Scientific Research Program of Higher Education(23B510003,21A510008 and 21A510009)in part by Henan Key Scientific and Technological Projects(212102210553)。
文摘The ultra-dense low earth orbit(LEO)integrated satellite-terrestrial networks(UDLEO-ISTN)can bring lots of benefits in terms of wide coverage,high capacity,and strong robustness.Meanwhile,the broadcasting and open natures of satellite links also reveal many challenges for transmission security protection,especially for eavesdropping defence.How to efficiently take advantage of the LEO satellite’s density and ensure the secure communication by leveraging physical layer security with the cooperation of jammers deserves further investigation.To our knowledge,using satellites as jammers in UDLEO-ISTN is still a new problem since existing works mainly focused on this issue only from the aspect of terrestrial networks.To this end,we study in this paper the cooperative secrecy communication problem in UDLEOISTN by utilizing several satellites to send jamming signal to the eavesdroppers.An iterative scheme is proposed as our solution to maximize the system secrecy energy efficiency(SEE)via jointly optimizing transmit power allocation and user association.Extensive experiment results verify that our designed optimization scheme can significantly enhance the system SEE and achieve the optimal power allocation and user association strategies.
基金supported by the Special Program of Guangxi Science and Technology Base and Talents under Grant No.AD18281020 and Grant No.AD18281044National Natural Science Foundation of China under Grant No.Nos.62161006 and Grant No.Nos.61662018+1 种基金Dean Project of Key Laboratory of Cognitive Radio and Information Processing of Ministry of Education under Grant No.CRKL190104 and Grant No.CRKL200107Open Foundation of State key Laboratory of Networking and Switching Technology under Grant No.SKLNST-2020-1-08(Beijing University of Posts and Telecommunications)。
文摘Low Earth orbit(LEO) satellite systems provide terrestrial users with services that are not limited by geographical location. However, the conflict between existing allocation schemes and the business variability between beams is becoming increasingly prominent. Beam hopping technology allows for a more flexible and versatile approach to satellite resource allocation. This paper proposes a beam hopping pattern optimization scheme that jointly considers the interference threshold distance and beam service priority, reducing the inter-beam co-channel interference(CCI). In the cluster area, a non-orthogonal multiple access(NOMA)-based collaborative beam hopping(NCBH) scheme is proposed to minimize the cell-edge user(CEU) interference. Since there is a difference in channel gain between the CEU and cellcenter user(CCU), this scheme forms a NOMA cluster to perform power domain multiplexing and formulates a NOMA cluster pairing strategy according to the user location to reduce the CCI of the CEU. After NOMA cluster pairing, the optimal carrier frequency of the NOMA cluster is selected by a reinforcement learning algorithm. The simulation results verify the excellent performance of the proposed NCBH scheme regarding the user’s received power, transmission rate, and outage probability.
基金supported by National Key Research and Development Plan of China under Grant 2022YFB3105203National Natural Science Foundation of China(62132009)+2 种基金key fund of National Natural Science Foundation of China(62272266)Tsinghua University-China Mobile Communications Group Co.,Ltd.Joint InstituteZhongguancun Laboratory。
文摘The gradual deployment of Low-Earth Orbit(LEO)mega constellations with inter-satellite links(ISLs)promises ubiquitous,low-latency,and high-throughput satellite network services.However,networked LEO satellites with ISLs are also at risk of routing attacks such as hijacking.Existing defenses against route hijacking in terrestrial networks can hardly work for the LEO satellite network due to its high spatiotemporal dynamics.To deal with it,we propose RPD,a high-risk routing path detection method for LEO mega-constellation networks.RPD detects abnormal high-risk LEO network paths by checking the consistency between the path delay and the geographical distance.This is efficiently achieved by combining in-band measurements and out-of-band statistical processing to detect the anomaly of the clustering feature in the reference delay matrix.RPD avoids the recalculation of the header cryptographic marks when the handover occurs,thus greatly reducing the cost and improving the performance of highrisk path detection.Experiments showed that the proposed RPD mechanism achieves an average detection accuracy of 91.64%under normal network conditions,and maintain about 89%even when congestion occurs in multiple areas of the network and measurement noise is considered.In addition,RPD does not require any cryptographic operation on the intermediate node,only minimal communication cost with excellent scalability and deployability.
基金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.
基金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.
