Study on Scheduling Techniques for Ultra Dense Small Cell Networks

The most promising approach to enhance network capacity for the next generation of wireless cellular networks (5G) is densification, which benefits from the extensive spatial reuse of the spectrum and the reduced distance between transmitters and receivers. In this paper, we examine the performance of different schedulers in ultra dense small cell deployments. Due to the stronger line of sight (LOS) at low inter-site distances (ISDs), we discuss that the Rician fading channel model is more suitable to study network performance than the Rayleigh one, and model the Rician K factor as a function of distance between the user equipment (UE) and its serving base station (BS). We also construct a cross-correlation shadowing model that takes into account the ISD, and finally investigate potential multi-user diversity gains in ultra dense small cell deployments by comparing the performances of proportional fair (PF) and round robin (RR) schedulers. Our study shows that as network becomes denser, the LOS component starts to dominate the path loss model which significantly increases the interference. Simulation results also show that multi-user diversity is considerably reduced at low ISDs, and thus the PF scheduling gain over the RR one is small, around 10% in terms of cell throughput. As a result, the RR scheduling may be preferred for dense small cell deployments due to its simplicity. Despite both the interference aggravation as well as the multi-user diversity loss, network densification is still worth it from a capacity view point.Comment: 6 pages, 7 figures, Accepted to IEEE VTC-Fall 2015 Bosto

Ultra Dense Small Cell Networks: Turning Density into Energy Efficiency

In this paper, a novel approach for joint power control and user scheduling is proposed for optimizing energy efficiency (EE), in terms of bits per unit energy, in ultra dense small cell networks (UDNs). Due to severe coupling in interference, this problem is formulated as a dynamic stochastic game (DSG) between small cell base stations (SBSs). This game enables to capture the dynamics of both the queues and channel states of the system. To solve this game, assuming a large homogeneous UDN deployment, the problem is cast as a mean-field game (MFG) in which the MFG equilibrium is analyzed with the aid of low-complexity tractable partial differential equations. Exploiting the stochastic nature of the problem, user scheduling is formulated as a stochastic optimization problem and solved using the drift plus penalty (DPP) approach in the framework of Lyapunov optimization. Remarkably, it is shown that by weaving notions from Lyapunov optimization and mean-field theory, the proposed solution yields an equilibrium control policy per SBS which maximizes the network utility while ensuring users' quality-of-service. Simulation results show that the proposed approach achieves up to 70.7% gains in EE and 99.5% reductions in the network's outage probabilities compared to a baseline model which focuses on improving EE while attempting to satisfy the users' instantaneous quality-of-service requirements.Comment: 15 pages, 21 figures (sub-figures are counted separately), IEEE Journal on Selected Areas in Communications - Series on Green Communications and Networking (Issue 2

Pulse Shaping Diversity to Enhance Throughput in Ultra-Dense Small Cell Networks

Spatial multiplexing (SM) gains in multiple input multiple output (MIMO) cellular networks are limited when used in combination with ultra-dense small cell networks. This limitation is due to large spatial correlation among channel pairs. More specifically, it is due to i) line-of-sight (LOS) communication between user equipment (UE) and base station (BS) and ii) in-sufficient spacing between antenna elements. We propose to shape transmit signals at adjacent antennas with distinct interpolating filters which introduces pulse shaping diversity eventually leading to improved SINR and throughput at the UEs. In this technique, each antenna transmits its own data stream with a relative offset with respect to adjacent antenna. The delay which must be a fraction of symbol period is interpolated with the pulse shaped signal and generates a virtual MIMO channel that leads to improved diversity and SINR at the receiver. Note that non-integral sampling periods with inter-symbol interference (ISI) should be mitigated at the receiver. For this, we propose to use a fractionally spaced equalizer (FSE) designed based on the minimum mean squared error (MMSE) criterion. Simulation results show that for a 2x2 MIMO and with inter-site-distance (ISD) of 50 m, the median received SINR and throughput at the UE improves by a factor of 11 dB and 2x, respectively, which verifies that pulse shaping can overcome poor SM gains in ultra-dense small cell networks.Comment: Accepted to 17th IEEE International Workshop on Signal Processing Advances in Wireless Communication

Mean-Field Games for Distributed Caching in Ultra-Dense Small Cell Networks

In this paper, the problem of distributed caching in dense wireless small cell networks (SCNs) is studied using mean field games (MFGs). In the considered SCN, small base stations (SBSs) are equipped with data storage units and cooperate to serve users' requests either from files cached in the storage or directly from the capacity-limited backhaul. The aim of the SBSs is to define a caching policy that reduces the load on the capacity-limited backhaul links. This cache control problem is formulated as a stochastic differential game (SDG). In this game, each SBS takes into consideration the storage state of the other SBSs to decide on the fraction of content it should cache. To solve this problem, the formulated SDG is reduced to an MFG by considering an ultra-dense network of SBSs in which the existence and uniqueness of the mean-field equilibrium is shown to be guaranteed. Simulation results show that this framework allows an efficient use of the available storage space at the SBSs while properly tracking the files' popularity. The results also show that, compared to a baseline model in which SBSs are not aware of the instantaneous system state, the proposed framework increases the number of served files from the SBSs by more than 69%.Comment: Accepted for publication at American Control Conference 201