Search arXivSearch

arXiv · 1510.01392

Modeling and Analyzing the Coexistence of Wi-Fi and LTE in Unlicensed Spectrum

Abstract

We leverage stochastic geometry to characterize key performance metrics for neighboring Wi-Fi and LTE networks in unlicensed spectrum. Our analysis focuses on a single unlicensed frequency band, where the locations for the Wi-Fi access points (APs) and LTE eNodeBs (eNBs) are modeled as two independent homogeneous Poisson point processes. Three LTE coexistence mechanisms are investigated: (1) LTE with continuous transmission and no protocol modifications; (2) LTE with discontinuous transmission; and (3) LTE with listen-before-talk (LBT) and random back-off (BO). For each scenario, we have derived the medium access probability (MAP), the signal-to-interference-plus-noise ratio (SINR) coverage probability, the density of successful transmissions (DST), and the rate coverage probability for both Wi-Fi and LTE. Compared to the baseline scenario where one Wi-Fi network coexists with an additional Wi-Fi network, our results show that Wi-Fi performance is severely degraded when LTE transmits continuously. However, LTE is able to improve the DST and rate coverage probability of Wi-Fi while maintaining acceptable data rate performance when it adopts one or more of the following coexistence features: a shorter transmission duty cycle, lower channel access priority, or more sensitive clear channel assessment (CCA) thresholds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yingzhe Li, Francois Baccelli, Jeffrey G. Andrews, Thomas D. Novlan, Jianzhong Charlie Zhang. 2016-02-19. Modeling and Analyzing the Coexistence of Wi-Fi and LTE in Unlicensed Spectrum. https://doi.org/10.1109/twc.2016.2582866

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