Inter-Mesh Routing Algorithms in LEO Satellite Constellations Networks

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Abstract In the quest for the sixth-generation (6G) mobile communication system, global coverage is paramount. Low-Earth orbit (LEO) satellite constellations (SatCon) play a pivotal role. The Walker-Delta SatCon architecture, with satellites in opposing meshes, shows promise. However, high satellite speeds often neglect inter-mesh connections, impacting end-to-end delay. This study explores inter-mesh link scheduling algorithms like uniform cost search (UCS) and Bellman-Ford (BMF) to enhance SatCon performance. Filtering possible inter-mesh links based on distance and angular velocity maximizes topology duration. Linkages, via Edmond’s, UCS, or BMF algorithms, are constructed, and Dijkstra’s algorithm determines the end-to-end route. Key considerations include connection distance, rotational velocity, link setup time, and switching frequency. Simulations demonstrate significantly reduced average end-to-end time with manageable system overhead. Integrating IoT with LEO satellites improves global connectivity, crucial in remote areas. LEO satellites' low latency and broad coverage meet IoT’s connectivity needs, ensuring reliable communication for smart cities, agriculture, logistics, and environmental monitoring. This integration enables seamless connectivity, reduces delays, and enhances data transmission reliability, fostering real-time monitoring and innovation across sectors.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-30T02:00:01.510937+00:00
License: CC-BY-4.0