TY - GEN
T1 - Coverage and Rate Analysis of Mega-Constellations Under Generalized Serving Satellite Selection
AU - Okati, Niloofar
AU - Riihonen, Taneli
N1 - Funding Information:
This research work was supported by a Nokia University Donation.
Publisher Copyright:
© 2022 IEEE.
JUFOID=57592
PY - 2022
Y1 - 2022
N2 - The dream of having ubiquitous and high-capacity connectivity is coming true by emerging low Earth orbit (LEO) Internet constellations through several commercial plans, e.g., Starlink, Telesat, and Oneweb. The analytical understanding of these networks is crucial for accurate network assessment and, consequently, acceleration in their design and development. In this paper, we derive the coverage probability and the data rate of a massive LEO network under arbitrarily distributed fading and shadowing. The conventional user association techniques, based on the shortest distance between the ground terminal and the satellite, result in a suboptimal performance of the network since the signal from the nearest server may be subject to severe shadowing due the blockage by nearby obstacles surrounding the ground terminal. Thus, we take into account the effect of shadowing on the serving satellite selection by assigning the ground terminal to the satellite which provides the highest signal-to-noise ratio at the terminal's place, resulting in a more generalized association technique, namely the best server policy (BSP). To maintain tractability of our derivations and consider the latitude-dependent distribution of satellites, we model the satellites as a nonhomogeneous Poisson point process. The numerical results reveal that implementing the BSP for serving satellite selection leads to significantly better performance compared to the conventional nearest server policy (NSP).
AB - The dream of having ubiquitous and high-capacity connectivity is coming true by emerging low Earth orbit (LEO) Internet constellations through several commercial plans, e.g., Starlink, Telesat, and Oneweb. The analytical understanding of these networks is crucial for accurate network assessment and, consequently, acceleration in their design and development. In this paper, we derive the coverage probability and the data rate of a massive LEO network under arbitrarily distributed fading and shadowing. The conventional user association techniques, based on the shortest distance between the ground terminal and the satellite, result in a suboptimal performance of the network since the signal from the nearest server may be subject to severe shadowing due the blockage by nearby obstacles surrounding the ground terminal. Thus, we take into account the effect of shadowing on the serving satellite selection by assigning the ground terminal to the satellite which provides the highest signal-to-noise ratio at the terminal's place, resulting in a more generalized association technique, namely the best server policy (BSP). To maintain tractability of our derivations and consider the latitude-dependent distribution of satellites, we model the satellites as a nonhomogeneous Poisson point process. The numerical results reveal that implementing the BSP for serving satellite selection leads to significantly better performance compared to the conventional nearest server policy (NSP).
U2 - 10.1109/WCNC51071.2022.9771936
DO - 10.1109/WCNC51071.2022.9771936
M3 - Conference contribution
AN - SCOPUS:85130703840
SN - 9781665442671
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 2214
EP - 2219
BT - 2022 IEEE Wireless Communications and Networking Conference, WCNC 2022
PB - IEEE
T2 - IEEE Wireless Communications and Networking Conference
Y2 - 10 April 2022 through 13 April 2022
ER -