环上软随机几何图的连通性
Connectivity of Soft Random Geometric Graphs Over Annuli
摘要：
节点随机分布在一个环内（然后是一个壳），以形成一个点模式的通信终端，这些通信终端根据射频数据信号的瑞利衰落随机链接。然后，我们提出了这些空间嵌入图的连接概率的解析公式，描述的连接行为作为一个密集的网络限制接近。这扩展了最近的工作建模ad hoc网络在非凸区域。
英文摘要：
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
