Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.06572

Radio Resource Allocation in LTE-Advanced Cellular Networks with M2M Communications

Kan Zheng·Fanglong Hu·Wei Xiang·Mischa Dohler·Wenbo Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Machine-to-machine (M2M) communications are expected to provide ubiquitous connectivity between machines without the need of human intervention. To support such a large number of autonomous devices, the M2M system architecture needs to be extremely power and spectrally efficient. This article thus briefly reviews the features of M2M services in the third generation (3G) long-term evolution and its advancement (LTE-Advanced) networks. Architectural enhancements are then presented for supporting M2M services in LTE-Advanced cellular networks. To increase spectral efficiency, the same spectrum is expected to be utilized for human-to-human (H2H) communications as well as M2M communications. We therefore present various radio resource allocation schemes and quantify their utility in LTE-Advanced cellular networks. System-level simulation results are provided to validate the performance effectiveness of M2M communications in LTE-Advanced cellular networks.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kan Zheng, Fanglong Hu, Wei Xiang, Mischa Dohler, Wenbo Wang. 2015-10-22. Radio Resource Allocation in LTE-Advanced Cellular Networks with M2M Communications. https://arxiv.org/abs/1510.06572

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↗