Search arXivSearch

arXiv · 2312.15987

Full-Stack End-to-End Sub-THz Simulations at 140 GHz using NYUSIM Channel Model in ns-3

Abstract

The next generation of wireless communication is expected to harness the potential of the sub-THz bands to achieve exceptional performance and ubiquitous connectivity. However, network simulators such as ns-3 currently lack support for channel models above 100 GHz. This limits the ability of researchers to study, design, and evaluate systems operating above 100 GHz. Here, we use the drop-based NYUSIM channel model to simulate channels above 100 GHz in all 3GPP scenarios including urban microcell (UMi), urban macrocell (UMa), rural macrocell (RMa), indoor hotspot (InH), and indoor factory (InF). We evaluate the full stack downlink end-to-end performance (throughput, latency, and packet drop) experienced by a single user equipment (UE) connected to a Next Generation Node B (gNB) operating in the sub-THz bands for three gNB--UE antenna configurations: 8x8--4x4, 16x16--4x4, and 64x64--8x8 by using the NYUSIM channel model at 140 GHz in the ns-3 mmWave module. Our simulations demonstrate that sub-THz bands can enable high-fidelity applications that require data rates exceeding 1 Gbps and latency below 15 milliseconds (ms) using the current mmWave protocol stack, and large antenna arrays. In addition, we show the variation in throughput vs number of realizations and find the optimal number of realizations required to obtain statistically significant results. We strongly encourage researchers worldwide to adopt a similar approach, as it enables the readers to assess the accuracy and reliability of the reported results and enhance the findings' overall interpretability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hitesh Poddar, Akhileswar Chowdary, Theodore S. Rappaport, Marwa Chafii. 2024-01-11. Full-Stack End-to-End Sub-THz Simulations at 140 GHz using NYUSIM Channel Model in ns-3. https://arxiv.org/abs/2312.15987

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