Search arXivSearch

arXiv · 2606.19497

Lightweight Non-Line-of-Sight Channel Detection for ML-assisted Bluetooth Direction Finding

Abstract

Bluetooth Low Energy (BLE) direction-finding is promising for indoor industrial localization, but its accuracy degrades in multipath environments where reflections and scattering bias angle estimates. Although line-of-sight (LOS) and non-line-of-sight (NLOS) detection is well studied for wide-band radios, BLE direction-finding still lacks narrow-band channel-feature representations, scalable kernel-based feature transformations, and dedicated datasets for data-driven, lightweight channel classification. To address this gap, the work introduces a controlled BLE measurement setup that generates labeled LOS/NLOS data in two distinct propagation environments. A quality-driven machine learning (ML)-based pipeline is then developed for BLE Constant Tone Extension (CTE) In-phase-Quadrature (IQ) features. First, robust quantile-based standardization is applied to reduce the influence of outliers and heavy-tailed effects. The standardized features are then analyzed using Principal Component Analysis (PCA) and Adaptive Kernel Density Estimation (AKDE) to verify scenario-dependent statistics and reveal LOS/NLOS separability. Next, Nyström Kernel Approximation (NKA) constructs low-rank nonlinear feature maps followed by a lightweight Support Vector Classifier (SVC) head for LOS/NLOS detection. This classifier is compared with Random Forest (RF) and Multilayer Perceptron (MLP) models. Results show that NKA improves accuracy by about 7-14% relative to the raw baseline. Although the MLP achieves higher absolute accuracy, the Nyström--SVC approach offers a more favorable trade-off between training complexity, inference cost, and memory footprint. Finally, several pipeline-calibrated posterior probabilities are utilized for cost-aware threshold selection and efficient real-time LOS/NLOS detection in resource-constrained localization systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamed Talebian, Aamir Mahmood, Mehdi Haghshenas, Stefani Rydbloom, Peter Karlsson, Mikael Gidlund. 2026-06-17. Lightweight Non-Line-of-Sight Channel Detection for ML-assisted Bluetooth Direction Finding. https://arxiv.org/abs/2606.19497

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