Homology based algorithm for disaster recovery in wireless networks - IMT - Institut Mines-Télécom Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Homology based algorithm for disaster recovery in wireless networks

Résumé

In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage holes and mend the disconnected components. In order to do thiswefirstconsiderthesimplicialcomplexrepresentationof the network, then the algorithm adds supplementary vertices in excessive number, and afterwards runs a reduction algorithm in order to reach an optimal result. One of the novelty of this work resides in the proposed method for the addition of vertices. We use a determinantal point process: the Ginibre point process which has inherent repulsion between vertices, and has never been simulated before for wireless networks representation. 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.
Fichier principal
Vignette du fichier
hbadrwn.pdf (563.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00800520 , version 1 (13-03-2013)
hal-00800520 , version 2 (05-12-2013)
hal-00800520 , version 3 (21-03-2014)

Identifiants

  • HAL Id : hal-00800520 , version 2

Citer

Anaïs Vergne, Ian Flint, Laurent Decreusefond, Philippe Martins. Homology based algorithm for disaster recovery in wireless networks. 2013. ⟨hal-00800520v2⟩
464 Consultations
398 Téléchargements

Partager

Gmail Facebook X LinkedIn More