Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.04694

Interference Characterization in Downlink Li-Fi Optical Attocell Networks

Atchutananda Surampudi·Radha Krishna Ganti
View original source ↗Read source document ↗Export metadata ↓

Abstract

Wireless access to data using visible light, popularly known as light-fidelity (Li-Fi), is one of the key emerging technologies which promises huge bandwidths and data rates. In Li-Fi, the data is modulated on optical intensities and transmitted and detected using light-emitting-diodes (LED) and photodiodes respectively. A network of such LED access points illuminates a given region in the form of attocells. Akin, to wireless networks, co-channel interference or simply interference is a major impediment in Li-Fi attocell networks. Also, when in such networks, the field-of-view (FOV) of a photodiode is limited, the network interference distribution gets affected significantly. So, for any given network scenario, interference characterization is critical for good system design. Currently, there are no good closed-form approximations to interference in Li-Fi attocell networks, that can be used for the analysis of signal-to-interference-plus-noise-ratio (or coverage), particularly for the case of limited FOVs. In this paper, using a technique from Fourier analysis, we provide a very close approximation to interference in one and two dimension Li-Fi attocell networks for any given finite inter-LED separation. We validate the interference approximation by providing theoretical error bounds using asymptotics and by performing numerical simulations. We show that our method of approximation can be extended to characterize interference in limited FOV scenarios as well.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atchutananda Surampudi, Radha Krishna Ganti. 2017-12-13. Interference Characterization in Downlink Li-Fi Optical Attocell Networks. https://doi.org/10.1109/jlt.2018.2836932

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗