Search arXivSearch

arXiv · 2006.15591

Stochastic Geometry-based Analysis of LEO Satellite Communication Systems

Abstract

This letter studies the performance of a low-earth orbit (LEO) satellite communication system where the locations of the LEO satellites are modeled as a binomial point process (BPP) on a spherical surface. In particular, we study the user coverage probability for a scenario where satellite gateways (GWs) are deployed on the ground to act as a relay between the users and the LEO satellites. We use tools from stochastic geometry to derive the coverage probability for the described setup assuming that LEO satellites are placed at n different altitudes, given that the number of satellites at each altitude ak is Nk for all k. To resemble practical scenarios where satellite communication can play an important role in coverage enhancement, we compare the performance of the considered setup with a scenario where the users are solely covered by a fiber-connected base station (referred to as anchored base station or ABS in the rest of the paper) at a relatively far distance, which is a common challenge in rural and remote areas. Using numerical results, we show the performance gain, in terms of coverage probability, at rural and remote areas when LEO satellite communication systems are adopted. Finally, we draw multiple system-level insights regarding the density of GWs required to outperform the ABS, as well as the number of LEO satellites and their altitudes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Talgat, Mustafa A. Kishk, Mohamed-Slim Alouini. 2020-06-28. Stochastic Geometry-based Analysis of LEO Satellite Communication Systems. https://arxiv.org/abs/2006.15591

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT