DeepAI AI Chat
Log In Sign Up

Building a coverage hole-free communication tree

by   Anais Vergne, et al.

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.


page 1

page 2

page 3

page 4


Computing the k-coverage of a wireless network

Coverage is one of the main quality of service of a wirelessnetwork. k-c...

Toward Performance Optimization in IoT-based Next-Gen Wireless Sensor Networks

In this paper, we propose a novel framework for performance optimization...

Performance Analysis of Centralized and Distributed Massive MIMO for MTC

Massive Multiple-Input Multiple-Output (mMIMO) is one of the essential t...

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage

Given an undirected graph G whose edge weights change over s time slots,...

Coverage hole detection in WSN with force-directed algorithm and transfer learning

Coverage hole detection is an important research problem in wireless sen...

Optimal multiple FSO transceiver configuration for using on High-altitude platforms

Free-space optical (FSO) communication requires light of sight (LoS) bet...