随机部署节点网络中的局部化问题:渐近分析和有限分析,以及假设
The Problem of Localization in Networks of Randomly Deployed Nodes: Asymptotic and Finite Analysis, and Thresholds
摘要:
我们推导出概率,随机选择的NL节点在$S$得到本地化的各种参数的函数。然后,我们推导出整个网络的NL节点在$S$得到本地化的概率。在连接的渐近阈值,我们表明存在的渐近阈值的网络本地化概率在两种不同的情况下。第一种是指密集网络,当域$S$是有界的并且两种节点的密度趋向于无限增长时,这种网络就产生了。第二种阈值表现在所考虑的域的增加,但节点的数量以这样一种方式增长,L-节点密度保持恒定的整个调查域。在这种情况下,重要的是在衰落过程上平均的最大传输范围的最小值,表示为$d_{max}$,在该最小值之上,NL节点的网络几乎肯定会渐近局部化。
英文摘要:
We derive the probability that a randomly chosen NL-node over $S$ gets localized as a function of a variety of parameters. Then, we derive the probability that the whole network of NL-nodes over $S$ gets localized. In connection with the asymptotic thresholds, we show the presence of asymptotic thresholds on the network localization probability in two different scenarios. The first refers to dense networks, which arise when the domain $S$ is bounded and the densities of the two kinds of nodes tend to grow unboundedly. The second kind of thresholds manifest themselves when the considered domain increases but the number of nodes grow in such a way that the L-node density remains constant throughout the investigated domain. In this scenario, what matters is the minimum value of the maximum transmission range averaged over the fading process, denoted as $d_{max}$, above which the network of NL-nodes almost surely gets asymptotically localized.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。