5,859 research outputs found

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

    Get PDF
    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

    The Simulation Model Partitioning Problem: an Adaptive Solution Based on Self-Clustering (Extended Version)

    Full text link
    This paper is about partitioning in parallel and distributed simulation. That means decomposing the simulation model into a numberof components and to properly allocate them on the execution units. An adaptive solution based on self-clustering, that considers both communication reduction and computational load-balancing, is proposed. The implementation of the proposed mechanism is tested using a simulation model that is challenging both in terms of structure and dynamicity. Various configurations of the simulation model and the execution environment have been considered. The obtained performance results are analyzed using a reference cost model. The results demonstrate that the proposed approach is promising and that it can reduce the simulation execution time in both parallel and distributed architectures

    Practical large-scale coordinated scheduling in LTE-Advanced networks

    Get PDF
    In LTE-Advanced, the same spectrum can be re-used in neighboring cells, hence coordinated scheduling is employed to improve the overall network performance (cell throughput, fairness, and energy efficiency) by reducing inter-cell interference. In this paper, we advocate that large-scale coordination can be obtained through a layered solution: a cluster of few (i.e., three) cells is coordinated at the first level, and clusters of coordinated cells are then coordinated at a larger scale (e.g., tens of cells). We model both small-scale coordination and large-scale coordination as optimization problems, show that solving them at optimality is prohibitive, and propose two efficient heuristics that achieve good results, and yet are simple enough to be run at every Transmission Time Interval (TTI). Detailed packet-level simulations show that our layered approach outperforms the existing ones, both static and dynamic
    • …
    corecore