A mathematical programming approach for full coverage hole optimization in Cloud Radio Access Networks

Abstract : This paper proposes a Branch-and-Cut algorithm for network operators and providers to propose a full coverage hole in the context of Cloud Radio Access Networks (C-RAN). In this context, and to optimize the network coverage when reducing interferences, network operators need new algorithms that enable to consolidate and re-optimize the antennas radii. This paper provides an NP-Hardness complexity proof of the full coverage hole problem and proposes a deep Branch-and-Cut algorithm based on the description of new cutting planes to accelerate the convergence time even for large problem sizes. Simulation results and comparison to the state of the art highlight the eciency and the usefulness of our approach.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01965280
Contributeur : Niezi Mharsi <>
Soumis le : mardi 25 décembre 2018 - 20:13:12
Dernière modification le : mercredi 26 décembre 2018 - 11:32:08

Identifiants

  • HAL Id : hal-01965280, version 1

Collections

Citation

Niezi Mharsi, Makhlouf Hadji. A mathematical programming approach for full coverage hole optimization in Cloud Radio Access Networks. Computer Networks, Elsevier, 2018. 〈hal-01965280〉

Partager

Métriques

Consultations de la notice

25