English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, the routing in massive low earth orbit (LEO) satellitenetworks is studied. When the satellite-to-satellite communication distance islimited, we choose different relay satellites to minimize the latency in aconstellation at a constant altitude. Firstly, the global optimum solution isobtained in the ideal scenario when there are available satellites at all theideal locations. Next, we propose a nearest neighbor search algorithm forrealistic (non-ideal) scenarios with a limited number of satellites. Theproposed algorithm can approach the global optimum solution under an idealscenario through a finite number of iterations and a tiny range of searches.Compared with other routing strategies, the proposed algorithm showssignificant advantages in terms of latency. Furthermore, we provide twoapproximation techniques that can give tight lower and upper bounds for thelatency of the proposed algorithm, respectively. Finally, the relationshipsbetween latency and constellation height, satellites' number, and communicationdistance are investigated.

Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks