Search arXivSearch

arXiv · 2001.00914

Novel Wake-up Scheme for Energy-Efficient Low-Latency Mobile Devices in 5G Networks

Abstract

Improved mobile device battery lifetime and latency mini-mization are critical requirements for enhancing the mobile broadband services and user experience. Long-term evolution (LTE) networks have adopted discontinuous reception (DRX) as the baseline solution for prolonged battery lifetime. However, in every DRX cycle, the mobile device baseband processing unit monitors and decodes the control signaling, and thus all instances without any actual data allocation leads to unnecessary energy consumption. This fact together with the long start-up and power-down times can prevent adopting frequent wake-up instants, which in turn leads to considerable latency. In this work,a novel wake-up scheme is described and studied, to tackle the trade-off between latency and battery lifetime in future 5G networks, seeking thus to facilitate an always-available experience, rather than always-on. Analytical and simulation-based results show that the proposed scheme is a promising approach to control the user plane latency and energy consumption, when the device is operating in the power saving mode. The aim of this article is to describe the overall wake-up system operating principle and the associated signaling methods,receiver processing solutions and essential implementation aspects. Additionally, the advantages compared to DRX-based systems are shown and demonstrated, through the analysis of the system energy-efficiency and latency characteristics, with special emphasis on future 5G-grade mobile devices

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soheil Rostami, Kari Heiska, Oleksandr Puchko, Kari Leppanen, Mikko Valkama. 2020-01-03. Novel Wake-up Scheme for Energy-Efficient Low-Latency Mobile Devices in 5G Networks. https://arxiv.org/abs/2001.00914

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

KEEP EXPLORING

Related papers

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

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

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