Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1801.01648

Energy-Efficient User Access Control and Resource Allocation in HCNs with Non-Ideal Circuitry

Yuhao Zhang·Qimei Cui·Ning Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the energy-efficient user access control (UAC) based on resource allocation (RA) in heterogeneous cellular networks (HCNs) with the required downlink data rate under non-ideal power amplifiers (PAs) and circuit power. It is proved that the energy consumption minimization is achieved when the typical user accesses only one base station (BS), while the other BSs remain in idle mode on the transmission resource allocated to this user. For this purpose, we reformulate the original non-convex optimization problem into a series of convex optimization problems where, in each case, the transmit power and duration of the accessed BS are determined. Then, the BS with the minimal energy consumption is selected for transmission. Considering the approximate situation, it is showed that the optimal transmit duration of the accessed BS can be estimated in closed form. The benefits of our proposed UAC and RA schemes are validated using numerical simulations, which also characterize the effect that non-ideal PAs have on the total energy consumption of different transmission schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhao Zhang, Qimei Cui, Ning Wang. 2018-01-05. Energy-Efficient User Access Control and Resource Allocation in HCNs with Non-Ideal Circuitry. https://doi.org/10.1109/wcsp.2017.8171187

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↗