Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.5676

How to Upgrade Wireless Networks: Small Cells or Massive MIMO?

Xiangxiang Xu·Xiujun Zhang·Walid Saad·Yifei Zhao·Shidong Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Radio network deployment and coverage optimization are critical to next-generation wireless networks. In this paper, the problem of optimally deciding on whether to install additional small cells or to upgrade current macrocell base stations (BSs) with massive antenna arrays is studied. This integrated deployment problem is cast as a general integer optimization model by using the facility location framework. The capacity limits of both the radio access link and the backhaul link are considered. The problem is shown to be an extension of the modular capacitated location problem (MCLP) which is known to be NP-hard. To solve the problem, a novel deployment algorithm that uses Lagrangian relaxation and tabu local search is proposed. The developed tabu search is shown to have a two-level structure and to be able to search the solution space thoroughly. Simulation results show how the proposed, optimal approach to upgrading an existing wireless network infrastructure can make use of a combination of both small cells and BSs with massive antennas. The results also show that the proposed algorithm can find the optimal solution effectively while having a computational time that is up to 30% lower than that of conventional algorithms.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiangxiang Xu, Xiujun Zhang, Walid Saad, Yifei Zhao, Shidong Zhou. 2014-06-22. How to Upgrade Wireless Networks: Small Cells or Massive MIMO?. https://arxiv.org/abs/1406.5676

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↗