Millimeter-wave (mmWave) networks rely on directional transmissions, in both control plane and data plane, to overcome severe path-loss. Nevertheless, the use of narrow beams complicates the initial cell-search procedure where we lack sufficient information for beamforming. In this paper, we investigate the feasibility of random beamforming for cell-search. We develop a stochastic geometry framework to analyze the performance in terms of failure probability and expected latency of cell-search. Meanwhile, we compare our results with the naive, but heavily used, exhaustive search scheme. Numerical results show that, for a given discovery failure probability, random beamforming can substantially reduce the latency of exhaustive search, especially in dense networks. Our work demonstrates that developing complex cell-discovery algorithms may be unnecessary in dense mmWave networks and thus shed new lights on mmWave system design.
@article{arxiv.1802.06450,
title = {Reducing Initial Cell-search Latency in mmWave Networks},
author = {Yanpeng Yang and Hossein S. Ghadikolaei and Carlo Fischione and Marina Petrova and Ki Won Sung},
journal= {arXiv preprint arXiv:1802.06450},
year = {2018}
}
Comments
6 pages, 5 figures, accepted by mmSys workshop at Infocom 2018