A survey of machine learning techniques applied to self organizing cellular networks

In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future

Hierarchical Resource Allocation Framework for Hyper-Dense Small Cell Networks

This paper considers joint power control and subchannel allocation for co-tier interference mitigation in extremely dense small cell networks, which is formulated as a combinatorial optimization problem. Since it is intractable to obtain the globally optimum assignment policy for existing techniques due to the huge computation and communication overheads in ultra-dense scenario, in this paper, we propose a hierarchical resource allocation framework to achieve a desirable solution. Speci cally, the solution is obtained by dividing the original optimization problem into four stages in partially distributed manner. First, we propose a divide-and-conquer strategy by invoking clustering technique to decompose the dense network into smaller disjoint clusters. Then, within each cluster, one of the small cell access points is elected as a cluster head to carry out intra-cluster subchannel allocation with a low-complexity algorithm. To tackle the issue of inter-cluster interference, we further develop a distributed learning-base coordination mechanism. Moreover, a local power adjustment scheme is also presented to improve the system performance. Numerical results verify the ef ciency of the proposed hierarchical scheme, and demonstrate that our solution outperforms the state-of-the-art methods, especially for hyper-dense networks

Distributed Resource Allocation and Performance Analysis in 5G Wireless Cellular Networks

This thesis focuses on the study of Heterogeneous Networks (HetNets), Device-to-device (D2D) communication networks, and unmanned aerial vehicle (UAV) networks in fifth generation wireless communication (5G) systems. HetNets that consist of macro-cells and small-cells have become increasingly popular in current wireless networks and 5G systems to meet the exponentially growing demand for higher data rates. Compared to conventional homogeneous cellular networks, the disparity of transmission power among different types of base stations (BSs), the relatively random deployment of SBSs, and the densifying networks, bring new challenges, such as the imbalanced load between macro and small cells and severe inter-cell interference. In the other hand, with the skyrocketing number of tablets and smart phones, the notion of caching popular content in the storage of BSs and users' devices is proposed to reduce duplicated wireless transmissions. To fulfill multi-fold communication requirements from humans, machine, and things, the 5G systems which include D2D communications, UAV communications, and so on, can improve the network performance. Among them, the performance analyses of these emerging technologies are attracting much attention and should be investigated first. This thesis focuses on these hot issues and emerging technologies in 5G systems, analyzing the network performance and conducting the allocation of available resources, such as serving BSs, spectrum resources, and storage resources. Specifically, three main research focuses are included in the thesis. The first focus of this thesis is the impact of the BS idle mode capacity (IMC) on the network performance of multi-tier and dense HCNs with both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions. I consider a more practical set-up with a finite number of UEs in the analysis. Moreover, the SBSs apply a positive power bias in the cell association procedure, so that macrocell UEs are actively encouraged to use the more lightly loaded SBSs. In addition, to address the severe interference that these cell range expanded UEs may suffer, the MBSs apply enhanced inter-cell interference coordination (eICIC), in the form of almost blank subframe (ABS) mechanism. For this model, I derive the coverage probability and the rate of a typical UE in the whole network or a certain tier. The impact of the IMC on the performance of the network is shown to be significant. In particular, it is important to note that there will be a surplus of BSs when the BS density exceeds the UE density, and thus a large number of BSs switch off. As a result, the overall coverage probability, as well as the area spectral efficiency (ASE), will continuously increase with the BS density, addressing the network outage that occurs when all BSs are active and the interference becomes LoS dominated. Finally, the optimal ABS factors are investigated in different BS density regions. One of major findings is that MBSs should give up all resources in favor of the SBSs when the small cell networks go ultra-dense. This reinforces the need for orthogonal deployments, shedding new light on the design and deployment of the future 5G dense HCNs. The second focus of this thesis is the content caching in D2D communication networks. In practical deployment, D2D content caching has its own problem that is not all of the user devices are willing to share the content with others due to numerous concerns such as security, battery life, and social relationship. To solve this problem, I consider the factor of social relationship in the deployment of D2D content caching. First, I apply stochastic geometry theory to derive an analytical expression of downloading performance for the D2D caching network. Specifically, a social relationship model with respect to the physical distance is adopted in the analysis to obtain the average downloading delay performance using random and deterministic caching strategies. Second, to achieve a better performance in more practical and specific scenarios, I develop a socially aware distributed caching strategy based on a decentralized learning automaton, to optimize the cache placement operation in D2D networks. Different from the existing caching schemes, the proposed algorithm not only considers the file request probability and the closeness of devices as measured by their physical distance, but also takes into account the social relationship between D2D users. The simulation results show that the proposed algorithm can converge quickly and outperforms the random and deterministic caching strategies. With these results, the work sheds insights on the design of D2D caching in the practical deployment of 5G networks. The third focus of this thesis is the performance analysis for practical UAV-enabled networks. By considering both LoS and NLoS transmissions between aerial BSs and ground users, the coverage probability and the ASE are derived. Considering that there is no consensus on the path loss model for studying UAVs in the literature, in this focus, three path loss models, i.e., high-altitude model, low-altitude model, and ultra-low-altitude model, are investigated and compared. Moreover, the lower bound of the network performance is obtained assuming that UAVs are hovering randomly according to homogeneous Poisson point process (HPPP), while the upper bound is derived assuming that UAVs can instantaneously move to the positions directly overhead ground users. From the analytical and simulation results for a practical UAV height of 50 meters, I find that the network performance of the high-altitude model and the low-altitude model exhibit similar trends, while that of the ultra-low-altitude model deviates significantly from the above two models. In addition, the optimal density of UAVs to maximize the coverage probability performance has also been investigated

Centralized Spectrum Sharing and Coordination Between Terrestrial and Aerial Base Stations of 3GPP-Based 5G Networks

The objective of this paper is to estimate performance of a new approach for spectrum sharing and coordination between terrestrial base stations (BS) and On-board radio access nodes (UxNB) carried by Unmanned Aerial Vehicles (UAV). This approach employs an artificial intelligence (AI) based algorithm implemented in centralized controller. According to the assessment based on the latest specifications of 3rd Generation Partnership Project (3GPP) the newly defined Unmanned Aerial System Traffic Management (UTM) is feasible to implement and utilize an algorithm for dynamic and efficient distribution of available radio resources between all radio nodes involved in process of optimization. An example of proprietary algorithm has been described, which is based on the principles of Kohonen neural networks. The algorithm has been used in simulation scenario to illustrate the performance of novel approach of centralized radio channels allocation between terrestrial BSs and UxNBs deployed in 3GPP-defined rural macro (RMa) environment. Simulation results indicate that at least 85% of simulated downlink (DL) transmissions are gaining additional channel bandwidth if presented algorithm is used for spectrum distribution between terrestrial BSs and UxNBs instead of baseline soft frequency re-use (SFR) approach

Approximations of the aggregated interference statistics for outage analysis in massive MTC

This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type-communications (mMTC), taking into account the random activity of the sensors. Given its discrete nature and the large number of devices involved, a continuous approximation based on the Gram–Charlier series expansion of a truncated Gaussian kernel is proposed. We use this approximation to derive an analytic closed-form expression for the outage probability, corresponding to the event of the signal-to-interference-and-noise ratio being below a detection threshold. This metric is useful since it can be used for evaluating the performance of mMTC systems. We analyze, as an illustrative application of the previous approximation, a scenario with several multi-antenna collector nodes, each equipped with a set of predefined spatial beams. We consider two setups, namely single- and multiple-resource, in reference to the number of resources that are allocated to each beam. A graph-based approach that minimizes the average outage probability, and that is based on the statistics approximation, is used as allocation strategy. Finally, we describe an access protocol where the resource identifiers are broadcast (distributed) through the beams. Numerical simulations prove the accuracy of the approximations and the benefits of the allocation strategy.Peer ReviewedPostprint (published version