Homology based algorithm for disaster recovery in wireless networks

Considering a damaged wireless network, presenting coverage holes or disconnected components, we propose a disaster recovery algorithm repairing the network. It provides the list of locations where to put new nodes to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of the network, then the algorithm adds supplementary nodes in excessive number, and afterwards runs a reduction algorithm in order to reach a unimprovable result. One of the novelty of this work resides in the proposed method for the addition of nodes. We use a determinantal point process: the Ginibre point process which has inherent repulsion between vertices, which simulation is new in wireless networks application. We compare both the determinantal point process addition method with other vertices addition methods, and the whole disaster recovery algorithm to the greedy algorithm for the set cover problem.