Computing the $k$-coverage of a wireless network
Networking and Internet Architecture
2019-01-03 v1 Performance
Abstract
Coverage is one of the main quality of service of a wirelessnetwork. -coverage, that is to be covered simultaneously by network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or handovers. We introduce here anew algorithm for computing the -coverage of a wirelessnetwork. Our method is based on the observation that -coverage canbe interpreted as layers of -coverage, or simply coverage. Weuse simplicial homology to compute the network's topology and areduction algorithm to indentify the layers of -coverage. Weprovide figures and simulation results to illustrate our algorithm.
Cite
@article{arxiv.1901.00375,
title = {Computing the $k$-coverage of a wireless network},
author = {Anaïs Vergne and Laurent Decreusefond and Philippe Martins},
journal= {arXiv preprint arXiv:1901.00375},
year = {2019}
}
Comments
Valuetools 2019, Mar 2019, Palma de Mallorca, Spain. 2019. arXiv admin note: text overlap with arXiv:1802.08442