Scholarlink

<p>With a worldwide research race to build the sixth-generation (6&#xa0;G) mobile communication system, it is imperative to seek technologies that can provide the ultimate global coverage for all environments. To this end, the low-earth orbit (LEO) satellite constellation (SatCon) is a key pillar for such a vision. Walker-Delta SatCon is one of the promising architectures, where Satellites are arranged into two meshes traveling in opposite directions. However, as a consequence of the relative high speed, inter-mesh connections between satellites in different meshes are often ignored, which limits the end-to-end delay performance. In this work, multiple inter-mesh link scheduling algorithms are investigated, including the uniform cost search (UCS) and the Bellman-Ford (BMF) algorithms in order to improve the constellation performance. A collection of possible inter-mesh links satisfying the link distance and angular velocity constraints are first filtered for a given set of satellites to maximize topological duration. Then, inter-mesh linkages are constructed using either Edmond’s, UCS, or BMF algorithms. Finally, the end-to-end route is determined using the Dijkstra algorithm. We consider several key factors including the connection distance, rotational velocity, link setup time, and link switching frequency. The benefits of the suggested technique are demonstrated by simulation, where the average end-to-end time is dramatically decreased with tolerable system overhead.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Inter-mesh routing algorithms in LEO satellite constellations networks

  • 期刊论文

  • 发表日期：

    2025年1月18日

查看全文
  • Eman Adel Elbehiry,
  • Ahmed Fares,
  • Basem M. Elhalawany,
  • Heba A. TagElDein

摘要

With a worldwide research race to build the sixth-generation (6 G) mobile communication system, it is imperative to seek technologies that can provide the ultimate global coverage for all environments. To this end, the low-earth orbit (LEO) satellite constellation (SatCon) is a key pillar for such a vision. Walker-Delta SatCon is one of the promising architectures, where Satellites are arranged into two meshes traveling in opposite directions. However, as a consequence of the relative high speed, inter-mesh connections between satellites in different meshes are often ignored, which limits the end-to-end delay performance. In this work, multiple inter-mesh link scheduling algorithms are investigated, including the uniform cost search (UCS) and the Bellman-Ford (BMF) algorithms in order to improve the constellation performance. A collection of possible inter-mesh links satisfying the link distance and angular velocity constraints are first filtered for a given set of satellites to maximize topological duration. Then, inter-mesh linkages are constructed using either Edmond’s, UCS, or BMF algorithms. Finally, the end-to-end route is determined using the Dijkstra algorithm. We consider several key factors including the connection distance, rotational velocity, link setup time, and link switching frequency. The benefits of the suggested technique are demonstrated by simulation, where the average end-to-end time is dramatically decreased with tolerable system overhead.