arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.08442cs.NIcs.CG
收藏

构建覆盖无洞通信树

Building a coverage hole-free communication tree

Anais Vergne, Laurent Decreusefond, Philippe Martins

摘要:

无线网络无处不在,但它们的管理可能很棘手,因为即使网络完全连接,它们的覆盖范围也可能包含漏洞。在本文中,我们提出了一种算法,可以建立一个无线网络的节点之间的通信树,保证有没有覆盖空洞的树。我们利用单纯同调来计算覆盖率,并利用Prim算法原理来建立通信树。仿真结果表明,该算法具有较好的性能,并对不同的度量进行了比较。最后,我们表明,我们的算法可以用来创建覆盖空洞无通信组与有限的跳数。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑