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 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.