Pilot Clustering in Asymmetric Massive MIMO Networks
Abstract
We consider the uplink of a cellular massive MIMO network. Since the spectral efficiency of these networks is limited by pilot contamination, the pilot allocation across cells is of paramount importance. However, finding efficient pilot reuse patterns is non-trivial especially in practical asymmetric base station deployments. In this paper, we approach this problem using coalitional game theory. Each cell has its own unique pilots and can form coalitions with other cells to gain access to more pilots. We develop a low-complexity distributed algorithm and prove convergence to an individually stable coalition structure. Simulations reveal fast algorithmic convergence and substantial performance gains over one-cell coalitions and full pilot reuse.
Keywords
Cite
@article{arxiv.1507.03773,
title = {Pilot Clustering in Asymmetric Massive MIMO Networks},
author = {Rami Mochaourab and Emil Björnson and Mats Bengtsson},
journal= {arXiv preprint arXiv:1507.03773},
year = {2015}
}
Comments
Published in Proc. of IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC '15), 5 pages, 1 tables, 5 figures