Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.02192

Dynamic Standalone Drone-Mounted Small Cells

Igor Donevski·Jimmy Jessen Nielsen
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates the feasibility of Dynamic Horizontal Opportunistic Positioning (D-HOP) use in Drone Small Cells (DSCs), with a central analysis on the impact of antenna equipment efficiency onto the optimal DSC altitude that has been chosen in favor of maximizing coverage. We extend the common urban propagation model of an isotropic antenna to account for a directional antenna, making it dependent on the antenna's ability to fit the ideal propagation pattern. This leads us to define a closed-form expression for calculating the Rate improvement of D-HOP implementations that maintain constant coverage through antenna tilting. Assuming full knowledge of the uniformly distributed active users' locations, three D-HOP techniques were tested: in the center of the Smallest Bounding Circle (SBC); the point of Maximum Aggregated Rate (MAR); and the Center-Most Point (CMP) out of the two aforementioned. Through analytic study and simulation we infer that DSC D-HOP implementations are feasible when using electrically small and tiltable antennas. Nonetheless, it is possible to achieve average per user average rate increases of up to 20-35% in low user density scenarios, or 3-5% in user-dense scenarios, even when using efficient antennas in a DSC that has been designed for standalone coverage.

Explore related subjects

cs.ITcs.NIeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor Donevski, Jimmy Jessen Nielsen. 2020-09-04. Dynamic Standalone Drone-Mounted Small Cells. https://arxiv.org/abs/2009.02192

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↗