Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = non-terrestrial-satellite-network (NTSN)

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
16 pages, 10922 KiB  
Technical Note
An Energy Sensitive and Congestion Balance Routing Scheme for Non-Terrestrial-Satellite-Network (NTSN)
by Yifei Jiang, Shufan Wu, Qiankun Mo, Wenzheng Liu and Xiao Wei
Remote Sens. 2023, 15(3), 585; https://doi.org/10.3390/rs15030585 - 18 Jan 2023
Cited by 82 | Viewed by 2515
Abstract
Recently, non-terrestrial-satellite-networks (NTSN) have attracted more attention due to excellent performance. NTSN specifically refers to a mega satellite constellation network. Global coverage, low latency and high data rate make global interconnection possible. However, the lack of on-board energy degrades the efficiency of the [...] Read more.
Recently, non-terrestrial-satellite-networks (NTSN) have attracted more attention due to excellent performance. NTSN specifically refers to a mega satellite constellation network. Global coverage, low latency and high data rate make global interconnection possible. However, the lack of on-board energy degrades the efficiency of the network system. To solve those pressing problems, an energy sensitive and congestion balance (ESCB) routing scheme is proposed in this paper. To compensate for the limited energy of satellites, a tubular sliding time window (TSTW) model is proposed. The residual energy can be predicted by it and a multi-objective algorithm is applied to calculate the routing path. Energy constraints, network congestion and latency are taken into account in the specific algorithm. A traffic model consisting of two different services is introduced as a verification system. Simulations demonstrate that the specific routing scheme achieves energy balance and congestion avoidance. In addition, comparison results demonstrate that ESCB is superior to the virtual-topology-based shortest path (VT-SP) routing algorithm. Full article
Show Figures

Graphical abstract

Back to TopTop