Search arXivSearch

arXiv · 1302.1592

Required Base Station Density in Coordinated Multi-Point Uplink with Rate Constraints

Abstract

In this paper we obtain the required spatial density of base stations (BSs) in a coordinated multi-point uplink cellular network to meet a chosen quality of service metric. Our model assumes cooperation amongst two BSs and the required density is obtained under shadowing and Rayleigh fading for different LTE-A path loss models. The proposed approach guarantees that the worst-case achievable rate in the entire coverage region is above a target rate with chosen probability. Two models for the position of the BSs are considered: a hexagonal grid and a Poisson point process (PPP) modified to set a minimum cell size. First, for each cooperation region, the location with the minimum rate coverage probability - the worst-case point - is determined. Next, accurate closed-form approximations are obtained for the worst-case rate coverage probability. The approximations presented are useful for the quick assessment of network performance and can be utilized in parametric studies for network design. Here, they are applied to obtain the required density of BSs to achieve a target rate coverage probability. As an added benefit, the formulation here quantifies the penalty in moving from a regular BS deployment (the grid model) to a random BS deployment (the PPP model).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Alireza Banani, Raviraj S. Adve. 2013-09-27. Required Base Station Density in Coordinated Multi-Point Uplink with Rate Constraints. https://arxiv.org/abs/1302.1592

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