Search arXivSearch

arXiv · 1407.1066

Adaptive Multicell 3D Beamforming in Multi-Antenna Cellular Networks

Abstract

We consider a cellular network with multi-antenna base stations (BSs) and single-antenna users, multicell cooperation, imperfect channel state information, and directional antennas each with a vertically adjustable beam. We investigate the impact of the elevation angle of the BS antenna pattern, denoted as tilt, on the performance of the considered network when employing either a conventional single-cell transmission or a fully cooperative multicell transmission. Using the results of this investigation, we propose a novel hybrid multicell cooperation technique in which the intercell interference is controlled via either cooperative beamforming in the horizontal plane or coordinated beamfroming in the vertical plane of the wireless channel, denoted as adaptive multicell 3D beamforming. The main idea is to divide the coverage area into two disjoint vertical regions and adapt the multicell cooperation strategy at the BSs when serving each region. A fair scheduler is used to share the time-slots between the vertical regions. It is shown that the proposed technique can achieve performance comparable to that of a fully cooperative transmission but with a significantly lower complexity and signaling requirements. To make the performance analysis computationally efficient, analytical expressions for the user ergodic rates under different beamforming strategies are also derived.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nima Seifi, Robert W. Heath Jr., Mikael Coldrey, Tommy Svensson. 2015-09-07. Adaptive Multicell 3D Beamforming in Multi-Antenna Cellular Networks. https://arxiv.org/abs/1407.1066

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