Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Building a coverage hole-free communication tree   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.

24
The categories of this paper are: dg-ga
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ