Simplicial Homology for Future Cellular Networks

Anaïs Vergne (1) , Laurent Decreusefond (2, 3) , Philippe Martins (2, 3)

1 GEOMETRICA - Geometric computing
2 LTCI - Laboratoire Traitement et Communication de l'Information
3 Télécom ParisTech

Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies while maximizing the usage of each one. Then, our energy conservation algorithm falls into the self-optimization feature of future cellular networks. It optimizes the energy consumption of the cellular network during off-peak hours while taking into account both coverage and user traffic. Finally, we present and discuss the performance of a disaster recovery algorithm using determinantal point processes to patch coverage holes.

Mots clés: Future cellular networks; Self-Organizing Networks; simplicial homology

Domaines: Réseaux et télécommunications [cs.NI]

Anaïs Vergne, Laurent Decreusefond, Philippe Martins. Simplicial Homology for Future Cellular Networks. IEEE Transactions on Mobile Computing, 2014, pp.1-14. ⟨10.1109/TMC.2014.2360389⟩. ⟨hal-00914659v4⟩