arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.15233cs.ITmath.IT
收藏

n维Matérn簇过程的k阶距离分布

kth Distance Distributions of n-Dimensional Matérn Cluster Process

Kaushlendra Pandey, Abhishek K. Gupta

摘要:

本文导出了$n$维($n$-D)Matérn集团过程(MCP)的PDMATHABMM_th接触距离(CD)和最近邻距离(NND)的累积分布函数(CDF).提出了一种基于随机变量(RV)的概率母函数(PGF)推导其概率质量函数(PMF)的新方法。该方法具有一般性,可用于概率母函数(PGFL)已知的任意点过程。我们还通过数值模拟验证了我们的分析,并使用所提出的分析提供见解。我们还讨论了两个应用程序,即:蜂窝网络中的宏分集和D2 D网络中的缓存,研究聚类对性能的影响。

英文摘要:

In this letter, we derive the CDF (cumulative distribution function) of $k$th contact distance (CD) and nearest neighbor distance (NND) of the $n$-dimensional ($n$-D) Matérn cluster process (MCP). We present a new approach based on the probability generating function (PGF) of the random variable (RV) denoting the number of points in a ball of arbitrary radius to derive its probability mass function (PMF). The proposed method is general and can be used for any point process with known probability generating functional (PGFL). We also validate our analysis via numerical simulations and provide insights using the presented analysis. We also discuss two applications, namely: macro-diversity in cellular networks and caching in D2D networks, to study the impact of clustering on the performance.

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

↑