Work

Computing the $k$-coverage of a wireless network

Year: 2018

Type: preprint

Abstract: Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or handovers. We introduce here anew algorithm for computing the $k$-coverage of a wirelessnetwork. Our method is based on the observation that $k$-coverage canbe interpreted as $k$ layers of $1$-coverage, or simply coverage. Weuse simplicial homology to compute the network's topology and areduction algorithm to indentify the layers of $1$-coverage. Weprovide figures and simulation results to illustrate our algorithm.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1901.00375

Authors: Vergne, Anaïs, Decreusefond, Laurent, Martins, Philippe

Institution: Laboratoire Traitement et Communication de l’Information

Language: English

Topic: Mobile Ad Hoc Networks

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W4289086629

Cites:

Cited by:

Related to: 10