Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.18440

Performance of Modified Fractional Frequency Reuse Algorithm in Random Ultra Dense Networks

Bach Hung Luu·Samuel Harry Gardner·Sinh Cong Lam·Trong Minh Hoang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mitigating intercell interference by employing fractional frequency reuse algorithms is one of the important approaches to improving user performance in 5G and Beyond 5G cellular network systems, which typically have a high density of Base Stations (BSs). While most frequency reuse algorithms are based on the downlink Signal-to-Interference-plus-Noise Ratio (SINR) or the distance between the user and its serving BS to classify Cell-Edge Users (CEUs) and Cell-Center Users (CCUs), this paper discusses a modified algorithm that uses the power ratio between the signal strengths from the serving BS and the second nearest BS for user classification. Specifically, if the power ratio is below a predefined threshold, the user is classified as a CEU and is served with higher transmission power. Simulation results show that increasing transmission power is necessary to enhance CEU performance, but it also degrades the performance of typical users. The use of frequency reuse algorithms is particularly feasible in environments with a high density of obstacles, where intercell interference can be effectively suppressed.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bach Hung Luu, Samuel Harry Gardner, Sinh Cong Lam, Trong Minh Hoang. 2025-10-21. Performance of Modified Fractional Frequency Reuse Algorithm in Random Ultra Dense Networks. https://arxiv.org/abs/2510.18440

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗