Search arXivSearch

arXiv · 2008.06160

User Association in Coexisting RF and TeraHertz Networks in 6G

Abstract

While fifth generation (5G) networks are ready for deployment, discussions over sixth generation (6G) networks are down the road. Since high frequencies like terahertz (THz) will be central to 6G, in this paper, we propose two user association (UE) algorithms considering a coexisting RF and THz network that balances the traffic load across the network by minimizing the standard deviation of the network traffic load. Our algorithms capture the heterogeneity observed at RF and THz frequencies such as transmission bandwidth, molecular absorption, transmit powers, etc. Unlike typical unsupervised clustering algorithms (e.g. k-means, k-medoid, etc.) that search for appropriate cluster centers' locations, our algorithms identify the appropriate UEs to be associated to a certain BS such that the overall network load standard deviation (STD) can be minimized subject to users' rate constraints. In particular, our algorithms cluster UEs to every base station (BS) such that the traffic load across the network can be balanced, i.e., by minimizing the STD of network traffic load. Numerical results show that the proposed algorithms outperform the classical user association algorithms in terms of data rate, traffic load balancing, and user's fairness.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noha Hassan, Md Tanvir Hossan, Hina Tabassum. 2020-08-14. User Association in Coexisting RF and TeraHertz Networks in 6G. https://arxiv.org/abs/2008.06160

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