Search arXivSearch

arXiv · 1511.07903

Flexible Design for $α$-Duplex Communications in Multi-Tier Cellular Networks

Abstract

Backward compatibility is an essential ingredient for the success of new technologies. In the context of in-band full-duplex (FD) communication, FD base stations (BSs) should support half-duplex (HD) users' equipment (UEs) without sacrificing the foreseen FD gains. This paper presents flexible and tractable modeling framework for multi-tier cellular networks with FD BSs and FD/HD UEs. The presented model is based on stochastic geometry and accounts for the intrinsic vulnerability of uplink transmissions. The results show that FD UEs are not necessarily required to harvest rate gains from FD BSs. In particular, the results show that adding FD UEs to FD BSs offers a maximum of $5\%$ rate gain over FD BSs and HD UEs case if multi-user diversity is exploited, which is a marginal gain compared to the burden required to implement FD transceivers at the UEs' side. To this end, we shed light on practical scenarios where HD UEs operation with FD BSs outperforms the operation when both the BSs and UEs are FD and we find a closed form expression for the critical value of the self-interference attenuation power required for the FD UEs to outperform HD UEs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmad AlAmmouri, Hesham ElSawy, Mohamed-Slim Alouini. 2016-04-20. Flexible Design for $α$-Duplex Communications in Multi-Tier Cellular Networks. https://arxiv.org/abs/1511.07903

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