Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1801.01663

Energy Efficiency Analysis of Heterogeneous Cellular Networks With Extra Cell Range Expansion

Yuhao Zhang·Zhiyan Cui·Qimei Cui·Xinlei Yu·Yinjun Liu·Weiliang Xie·Yong Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

The split control and user plane is key to the future heterogeneous cellular network (HCN), where the small cells are dedicated for the most data transmission while the macrocells are mainly responsible for the control signaling. Adapting to this technology, we propose a general and tractable framework of extra cell range expansion (CRE) by introducing an additional bias factor to enlarge the range of small cells flexibly for the extra offloaded macrousers in a two-tier HCN, where the macrocell and small cell users have different required data rates. Using stochastic geometry, we analyze the energy efficiency (EE) of the extra CRE with joint low power transmission and resource partitioning, where the coverages of EE and data rate are formulated theoretically. Numerical simulations verify that the proposed extra CRE can improve the EE performance of HCN, and also show that deploying more small cells can provide benefits for EE coverage, but the EE improvement becomes saturated if the small cell density exceeds a threshold. Instead of establishing the detail configuration, this paper can provide some valuable insights and guidelines to the practical design of future networks, especially for the traffic offloading in HCN.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhao Zhang, Zhiyan Cui, Qimei Cui, Xinlei Yu, Yinjun Liu, Weiliang Xie, Yong Zhao. 2018-01-05. Energy Efficiency Analysis of Heterogeneous Cellular Networks With Extra Cell Range Expansion. https://doi.org/10.1109/access.2017.2713814

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↗