Degrees-Of-Freedom in Multi-Cloud Based Sectored Cellular Networks.

This paper investigates the achievable per-user (DoF) in multi-cloud based sectored hexagonal cellular networks (M-CRAN) at uplink. The network consists of base stations (BS) and K ≤ N s (BBUP), which function as independent cloud centers. The communication between BSs and BBUPs occurs by means of finite-capacity fronthaul links of capacities C F = μ F · 1 2 log ( 1 + P ) with denoting transmit power. In the system model, BBUPs have limited C BBU = μ BBU · 1 2 log ( 1 + P ) . We propose two different achievability schemes based on dividing the network into non-interfering parallelogram and hexagonal clusters, respectively. The minimum number of users in a cluster is determined by the ratio of BBUPs to BSs, r = K / N . Both of the parallelogram and hexagonal schemes are based on practically implementable beamforming and adapt the way of forming clusters to the sectorization of the cells. Proposed coding schemes improve the sum-rate over naive approaches that ignore cell sectorization, both at finite signal-to-noise ratio (SNR) and in the high-SNR limit. We derive a lower bound on per-user DoF which is a function of μ BBU , μ F , and . We show that cut-set bound are attained for several cases, the achievability gap between lower and cut-set bounds decreases with the inverse of BBUP-BS ratio 1 r for μ F ≤ 2 M irrespective of μ BBU , and that per-user DoF achieved through hexagonal clustering can not exceed the per-user DoF of parallelogram clustering for any value of μ BBU and as long as μ F ≤ 2 M . Since the achievability gap decreases with inverse of the BBUP-BS ratio for small and moderate fronthaul capacities, the cut-set bound is almost achieved even for small cluster sizes for this range of fronthaul capacities. For higher fronthaul capacities, the achievability gap is not always tight but decreases with processing capacity. However, the cut-set bound, e.g., at 5 M 6 , can be achieved with a moderate clustering size.