Building a Coverage Hole-free Communication Tree

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

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.

Original languageEnglish
Title of host publicationQ2SWinet 2018 - Proceedings of the 14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks
PublisherAssociation for Computing Machinery, Inc
Pages100-107
Number of pages8
ISBN (Electronic)9781450359634
DOIs
Publication statusPublished - 25 Oct 2018
Externally publishedYes
Event14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2018 - Montreal, Canada
Duration: 28 Oct 20182 Nov 2018

Publication series

NameQ2SWinet 2018 - Proceedings of the 14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks

Conference

Conference14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2018
Country/TerritoryCanada
CityMontreal
Period28/10/182/11/18

Fingerprint

Dive into the research topics of 'Building a Coverage Hole-free Communication Tree'. Together they form a unique fingerprint.

Cite this