4 research outputs found
Simplicial Homology for Future Cellular Networks
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
Computing the -coverage of a wireless network
Coverage is one of the main quality of service of a wirelessnetwork.
-coverage, that is to be covered simultaneously by network nodes, is
synonym of reliability and numerous applicationssuch as multiple site MIMO
features, or handovers. We introduce here anew algorithm for computing the
-coverage of a wirelessnetwork. Our method is based on the observation that
-coverage canbe interpreted as layers of -coverage, or simply
coverage. Weuse simplicial homology to compute the network's topology and
areduction algorithm to indentify the layers of -coverage. Weprovide figures
and simulation results to illustrate our algorithm.Comment: Valuetools 2019, Mar 2019, Palma de Mallorca, Spain. 2019. arXiv
admin note: text overlap with arXiv:1802.0844