Search arXivSearch

arXiv · 1804.05211

Hybrid RF/VLC Systems under QoS Constraints

Abstract

The coexistence of radio frequency (RF) and visible light communications (VLC) in typical indoor environments can be leveraged to support vast user quality-of-service (QoS) needs. In this paper, we target a hybrid RF/VLC network in which data transmission is provided via either an RF access point or a VLC luminary based on a selection process. We employ the concept of effective capacity, which defines the maximum constant arrival data rate at the transmitter buffer when the QoS needs are imposed as limits on the buffer overflow and delay violation probabilities, as the main selection criteria. We initially formulate the effective capacity of both channels with respect to channel gains and user distribution. Under the assumption of uniform user distribution within the VLC cell, we then provide a closed-form approximation for the effective capacity of the VLC channel. We further investigate the effects of illumination needs and line-of-sight blockage on the VLC performance. In addition, we explore the non-asymptotic bounds regarding the buffering delay by capitalizing on the effective capacity. Through simulation results, we show the impacts of different physical aspects and data-link QoS needs on the effective capacity and delay bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marwan Hammouda, Sami Akın, Anna Maria Vegni, Harald Haas, Jürgen Peissig. 2018-04-14. Hybrid RF/VLC Systems under QoS Constraints. https://arxiv.org/abs/1804.05211

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