街道系统上D2D网络的渗流
Percolation for D2D Networks on Street Systems
摘要:
我们研究多跳D2D网络的连接的基本特征。设备随机分布在街道系统上,只要它们的间隔小于某个连接阈值,它们就能够相互通信。我们模拟的街道系统泊松沃罗诺伊或泊松德劳内镶嵌不同的街道长度。我们解释的存在足够的D2D连通渗流的基础随机图。我们推导和比较近似的临界设备的渗透强度,渗透概率和图形距离。我们的研究结果表明,对于城市地区,泊松布尔模型给出了一个很好的近似,而对于农村地区,渗透概率保持远离1,甚至远远高于渗透阈值。
英文摘要:
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity threshold. We model the street systems as Poisson-Voronoi or Poisson-Delaunay tessellations with varying street lengths. We interpret the existence of adequate D2D connectivity as percolation of the underlying random graph. We derive and compare approximations for the critical device-intensity for percolation, the percolation probability and the graph distance. Our results show that for urban areas, the Poisson Boolean Model gives a very good approximation, while for rural areas, the percolation probability stays far from 1 even far above the percolation threshold.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。