Search arXivSearch

arXiv · 1506.08248

Handover Count Based Velocity Estimation and Mobility State Detection in Dense HetNets

Abstract

In wireless cellular networks with densely deployed base stations, knowing the velocities of mobile devices is a key to avoid call drops and improve the quality of service to the user equipments (UEs). A simple and efficient way to estimate a UE's velocity is by counting the number of handovers made by the UE during a predefined time window. Indeed, handover-count based mobility state detection has been standardized since Long Term Evolution (LTE) Release-8 specifications. The increasing density of small cells in wireless networks can help in accurate estimation of velocity and mobility state of a UE. In this paper, we model densely deployed small cells using stochastic geometry, and then analyze the statistics of the number of handovers as a function of UE velocity, small-cell density, and handover count measurement time window. Using these statistics, we derive approximations to the Cramer-Rao lower bound (CRLB) for the velocity estimate of a UE. Also, we determine a minimum variance unbiased (MVU) velocity estimator whose variance tightly matches with the CRLB. Using this velocity estimator, we formulate the problem of detecting the mobility state of a UE as low, medium, or high-mobility, as in LTE specifications. Subsequently, we derive the probability of correctly detecting the mobility state of a UE. Finally, we evaluate the accuracy of the velocity estimator under more realistic scenarios such as clustered deployment of small cells, random way point (RWP) mobility model for UEs, and variable UE velocity. Our analysis shows that the accuracy of velocity estimation and mobility state detection increases with increasing small cell density and with increasing handover count measurement time window.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arvind Merwaday, Ismail Guvenc. 2016-04-05. Handover Count Based Velocity Estimation and Mobility State Detection in Dense HetNets. https://arxiv.org/abs/1506.08248

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