Building a coverage hole-free communication tree

Abstract : Wireless networks are present everywhere but their management can be tricky since their coverage may contain holes even if the network is fully connected. In this paper we propose an algorithm that can build a communication tree between nodes of a wireless network with guarantee that there is no coverage hole in the tree. We use simplicial homology to compute mathematically the coverage, and Prim's algorithm principle to build the communication tree. Some simulation results are given to study the performance of the algorithm and compare different metrics. In the end, we show that our algorithm can be used to create coverage hole-free communication groups with a limited number of hops.
Keywords : Homology
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01715596
Contributor : Laurent Decreusefond <>
Submitted on : Thursday, February 22, 2018 - 6:48:59 PM
Last modification on : Wednesday, December 18, 2019 - 5:20:33 PM
Long-term archiving on: Wednesday, May 23, 2018 - 3:10:30 PM

Files

prim.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01715596, version 1
  • ARXIV : 1802.08442

Citation

Anais Vergne, Laurent Decreusefond, Philippe Martins. Building a coverage hole-free communication tree. ACM Q2SWinet Symposium, 2018, Montréal, Canada. ⟨hal-01715596⟩

Share

Metrics

Record views

291

Files downloads

120