天地一体化信息网络 ›› 2023, Vol. 4 ›› Issue (4): 1-10.doi: 10.11959/j.issn.2096-8930.2023037

• 研究 •    

基于用户分组的低轨卫星动态跳波束算法

舒晴1, 李维彪1, 金作霖1, 郑重1, 张永波2, 费泽松1   

  1. 1 北京理工大学信息与电子学院,北京 100081
    2 延安大学物理与电子信息学院,陕西 延安 716000
  • 修回日期:2023-11-01 出版日期:2023-12-01 发布日期:2023-12-01
  • 作者简介:舒晴(1997- ),女,北京理工大学硕士生,主要研究方向为低轨卫星通信
    李维彪(1995- ),男,北京理工大学硕士生,主要研究方向为低轨卫星通信
    金作霖(1999- ),男,北京理工大学博士生,主要研究方向为无线通信
    郑重(1984- ),男,博士,北京理工大学信息与电子学院特别研究员、博士生导师,主要研究方向为多天线通信技术、智能反射表面和随机矩阵理论
    张永波(1980- ),男,硕士,延安大学物理与电子信息学院讲师,主要研究方向为移动通信中的多天线技术
    费泽松(1977- ),男,博士,北京理工大学信息与电子学院教授、博士生导师,主要研究方向为信道编码、5G/6G移动通信关键技术、雷达通信一体化、低轨卫星接入与组网、MIMO等
  • 基金资助:
    国家重点研发计划资助项目(2020YFB1806900);北京理工大学研究生院博士生论坛(2023BSLT004)

Dynamic Beam Hopping Algorithm for LEO Satellite Systems Based on User Grouping

Qing SHU1, Weibiao LI1, Zuolin JIN1, Zhong ZHENG1, Yongbo ZHANG2, Zesong FEI1   

  1. 1 School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China
    2 School of Physics and Electronic Information, Yan’an University, Yan’an 716000, China
  • Revised:2023-11-01 Online:2023-12-01 Published:2023-12-01
  • Supported by:
    National Key Research and Development Program of China(2020YFB1806900);Doctoral Forum of Graduate School of BIT(2023BSLT004)

摘要:

在部署了大规模 MIMO 的卫星通信系统中,当用户数量远超卫星的波束数时,即便增加射频链的数量,即增加同时服务用户的数量,仍然难以满足卫星通信系统的时延要求。针对以上问题,提出一种基于用户分组的动态跳波束方案,根据用户组进行通信服务覆盖。所提方法利用信道角域分布的稀疏性,根据用户能量最大的波束方向自适应划分用户分组。由于卫星上功率限制使得射频链数量受限,且增加同时服务的用户组会增加用户组间的干扰,因此共信道用户组的数量受到功率和干扰约束,限制了通信业务服务时延减小。于是进一步提出波束簇分组的跳波束方案,此时波束簇通过增加同一时刻服务用户的数量,来减小用户的时延。由于以上问题是非凸的,采用数据驱动的行列式点过程方法简化跳波束方案中的波束调度。仿真结果表明,基于用户分组的动态跳波束算法能够有效减小用户的平均时延,与单波束方案相比,平均时延减少超过52%。同时在仿真结果中也验证了行列式点过程模型的泛用性。

关键词: 低轨卫星, 跳波束技术, 资源分配, 行列式点过程

Abstract:

In a satellite communication system deployed with massive MIMO, when the number of users far exceeds the number of beams of the satellite, it is still difficult to satisfy the delay requirements of the satellite communication system even if the number of RF chains is increased, i.e., the number of concurrently serving users is increased.To address the above problems, it proposed a dynamic beam hopping (BH) scheme based on user grouping for communication service coverage.The proposed method utilized the sparsity of the angular domain channel distribution to adaptively divide user groups accorded to the beam direction where the user energy is maximum.The number of co-channel user groups was constrained by power and interference constraints, limiting the reduction of communication traffic delay, as power limitations on the satellite make the number of RF chains limited and increased the number of simultaneously served user groups increased the interference between user groups.So the BH scheme with beam cluster grouping was further proposed, when the beam clusters reduced the user delay by increased the number of users served at the same moment.Since the above problem was non-convex, it adopt a data-driven determinantal point process (DPP) learning method to simplify the beam scheduling in BH scheme.Simulation results showed that the dynamic BH algorithm based on user grouping could effectively reduce the average user delay by more than 52% compared with the single-beam scheme, also verifies the versatility of the DPP learning.

Key words: LEO satellite, beam-hopping technology, resource allocation, determinantal point process learning

中图分类号: 

No Suggested Reading articles found!