arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.04405cs.ITcs.NImath.IT
收藏

使用二项式点过程建模有限无线网络的基础

Fundamentals of Modeling Finite Wireless Networks using Binomial Point Process

Mehrnaz Afshang, Harpreet S. Dhillon

摘要:

将节点的位置建模为均匀二项点过程(BPP),提出了一个通用的数学框架来表征有限无线网络中任意位置的参考接收机的性能。与大多数现有工作中服务发送器(TX)节点位于距参考接收器固定距离处不同,我们考虑两种一般TX选择策略:i)均匀TX选择:在发送节点中均匀随机地选择服务节点,以及ii)k最近TX选择:服务节点是发送节点中距参考接收器第k最近的节点。在我们的分析中,关键的中间步骤是推导出一组新的距离分布,这不仅导致易于处理的覆盖概率分析,而且还使广泛的经典和当前趋势的无线网络问题的分析。使用这组新的距离分布,我们首先调查的分集损失,由于SIR相关性在有限的网络。然后,我们得到的最佳数量的链接,可以同时激活,以最大限度地提高网络的频谱效率。最后,我们评估最佳的缓存概率,以最大限度地提高缓存启用有限网络中的总命中概率。

英文摘要:

Modeling the locations of nodes as a uniform binomial point process (BPP), we present a generic mathematical framework to characterize the performance of an arbitrarily-located reference receiver in a finite wireless network. Different from most of the prior works where the serving transmitter (TX) node is located at the fixed distance from the reference receiver, we consider two general TX-selection policies: i) uniform TX-selection: the serving node is chosen uniformly at random amongst transmitting nodes, and ii) k-closest TX-selection: the serving node is the k-th closest node out of transmitting nodes to the reference receiver. The key intermediate step in our analysis is the derivation of a new set of distance distributions that lead not only to the tractable analysis of coverage probability but also enable the analyses of wide range of classical and currently trending problems in wireless networks. Using this new set of distance distributions, we first investigate the diversity loss due to SIR correlation in a finite network. We then obtain the optimal number of links that can be simultaneously activated to maximize network spectral efficiency. Finally, we evaluate optimal caching probability to maximize the total hit probability in cache-enabled finite networks.

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

↑