Computing the k-coverage of a wireless network

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2019
PublisherAssociation for Computing Machinery
Pages175-178
Number of pages4
ISBN (Electronic)9781450365963
DOIs
Publication statusPublished - 12 Mar 2019
Externally publishedYes
Event12th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2019 - Palma de Mallorca, Spain
Duration: 13 Mar 201915 Mar 2019

Publication series

NameACM International Conference Proceeding Series

Conference

Conference12th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2019
Country/TerritorySpain
CityPalma de Mallorca
Period13/03/1915/03/19

Keywords

  • K-coverage
  • Simplicial homology
  • Wireless networks

Fingerprint

Dive into the research topics of 'Computing the k-coverage of a wireless network'. Together they form a unique fingerprint.

Cite this