arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.03906cs.NIcs.ITmath.IT
收藏

如何将无线节点分组在一起?

How to group wireless nodes together?

Anastasios Giovanidis

摘要:

这份报告提出了一个调查如何组在一起,在一个静态的方式平面节点,可能属于一个无线网络(ad hoc或蜂窝)。其目的是确定也可以应用于点过程的适当方法。具体匹配对和算法进行了初步讨论。接下来,特别是点过程,最近邻和Lilypond模型。两个模型的属性和结果。原始的界限给出了所谓的世代数的值,这是相关的最近邻簇的大小。最后,最近邻分组的一个变化,提出了一个原始的度量,这里命名为祖先数。这是用来方便分析集群大小的分布。在此基础上,导出了某些相关的界限。该报告和分析清楚地表明,在点过程中工作的困难与静态集群的大小大于两个,当这些是由邻近标准定义。

英文摘要:

This report presents a survey on how to group together in a static way planar nodes, that may belong to a wireless network (ad hoc or cellular). The aim is to identify appropriate methods that could also be applied for Point Processes. Specifically matching pairs and algorithms are initially discussed. Next, specifically for Point Processes, the Nearest Neighbour and Lilypond models are presented. Properties and results for the two models are stated. Original bounds are given for the value of the so-called generation number, which is related to the size of the nearest neighbour cluster. Finally, a variation of the nearest neighbour grouping is proposed and an original metric is introduced, named here the ancestor number. This is used to facilitate the analysis of the distribution of cluster size. Based on this certain related bounds are derived. The report and the analysis included show clearly the difficulty of working in point processes with static clusters of size greater than two, when these are defined by proximity criteria.

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

↑