We formulate a linear programming problem to find the minimum clearing time in HetNets. Although this program is NP hard in general, we consider particular topologies that arise in HetNets, including a two cell HetNet and a linear chain of HetNets, both with wireless backhaul, and we provide an efficient, greedy algorithm that provably solves the minimum clearing time problem for these networks. We show how this algorithm can be applied to jointly optimize the ABS time across multiple macros in a HetNet, and we demonstrate capacity gains of the algorithm, compared to standard approaches to Inter Cell Interference Coordination. This paper provides insight into how to manage interference in presence of more than one macro, and how to efficiently operate wireless backhaul in HetNets.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Greedy Scheme for Optimal Resource Allocation in HetNets with Wireless Backhaul


    Beteiligte:


    Erscheinungsdatum :

    01.06.2017


    Format / Umfang :

    408497 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    On the Resource Allocation in HetNets with Massive MIMO Wireless Backhaul

    Hamdi, Rami / Driouch, Elmahdi / Ajib, Wessam | IEEE | 2018


    Fuzzy-Based Joint User Association and Resource Allocation in HetNets

    Alnoman, Ali / Ferdouse, Lilatul / Anpalagan, Alagan | IEEE | 2017


    Cooperative MARL for Resource Allocation in High Mobility NGMA-enabled HetNets

    Yang, Leyou / Jia, Jie / Chen, Jian et al. | IEEE | 2022



    Resource Allocation and User Association in Massive MIMO Enabled Wireless Backhaul Network

    Rajoria, Shweta / Trivedi, Aditya / Godfrey, W. Wilfred et al. | IEEE | 2019