Skip to Main content Skip to Navigation
Conference papers

Computing the $k$-coverage of a wireless network

Abstract : 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.
Keywords : Homology
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Laurent Decreusefond <>
Submitted on : Saturday, December 29, 2018 - 6:09:06 PM
Last modification on : Tuesday, December 8, 2020 - 10:22:46 AM
Long-term archiving on: : Saturday, March 30, 2019 - 12:37:03 PM


Files produced by the author(s)


  • HAL Id : hal-01966097, version 1
  • ARXIV : 1901.00375



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⟩



Record views


Files downloads