Search arXivSearch

arXiv · 2301.08109

Predicting the Channel Access of Bluetooth Low Energy

Abstract

Bluetooth Low Energy (BLE) is one of the key enablers for low-power and low-cost applications in consumer electronics and the Internet of Things. The latest features such as audio and direction finding will introduce more and more devices that rely on BLE for communication. However, like many other wireless standards, BLE relies on the unlicensed 2.4 GHz frequency band where the spectrum is already very crowded and a channel access without collisions with other devices is difficult to guarantee. For applications with high reliability requirements, it will be beneficial to actively consider channel access from other devices or standards. In this work, we present an approach to estimate the connection parameters of multiple BLE connections outside our control and knowledge by passively listening to the channel. With this, we are able to predict future channel access of these BLE connections that can be used by other wireless networks to avoid collisions. We show the applicability of our algorithm with measurements from which we are able to identify unknown BLE connections, reconstruct their specific connection parameters, and predict their future channel access.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Julian Karoliny, Thomas Blazek, Andreas Springer, Hans-Peter Bernhard. 2023-01-19. Predicting the Channel Access of Bluetooth Low Energy. https://arxiv.org/abs/2301.08109

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