Computing the $k$-coverage of a wireless network - Département Informatique et Réseaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Computing the $k$-coverage of a wireless network

Résumé

Coverage is one of the main quality of service of a wireless network. $k$-coverage, that is to be covered simultaneously by $k$ network nodes, is synonym of reliability and numerous applications such as multiple site MIMO features, or handovers. We introduce here a new algorithm for computing the $k$-coverage of a wireless network. Our method is based on the observation that $k$-coverage can be interpreted as $k$ layers of $1$-coverage, or simply coverage. We use simplicial homology to compute the network's topology and a reduction algorithm to indentify the layers of $1$-coverage. We provide figures and simulation results to illustrate our algorithm.

Mots clés

Fichier principal
Vignette du fichier
k-couverture.pdf (1 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01966097 , version 1 (29-12-2018)

Identifiants

Citer

Anaïs Vergne, Laurent Decreusefond, Philippe Martins. Computing the $k$-coverage of a wireless network. Valuetools 2019, Mar 2019, Palma de Mallorca, Spain. ⟨hal-01966097⟩
208 Consultations
159 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More