In recent years, we have witnessed the booming development of low earth orbit (LEO) satellite networks. In terms of low latency and ultra-long distance communication, the LEO satellite network has excellent advantages over ground networks and high orbit satellite networks. In ultra-long distance communication, multiple satellites are used as relays to complete multi-hop routing. How to select the relay satellite to achieve the minimum latency routing becomes one of the challenges.
CTL researchers studied the routing in massive low earth orbit (LEO) satellites. They proposed a nearest-neighbor search algorithm that minimizes the latency by choosing different relay satellites. Compared with other routing strategies, the proposed algorithm shows significant advantages in terms of latency. Furthermore, CTL researchers provided two approximation techniques that can give tight lower and upper bounds for the latency of the proposed algorithm, respectively.
More information can be found in the video given below and the paper:
R. Wang, M.A. Kishk and M. -S. Alouini, "Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks", IEEE Transactions on Aerospace and Electronic Systems, 2022
Related Persons
