Poisson蜂窝网络中遍历速率的一种易处理闭式近似
A Tractable Closed-Form Approximation of the Ergodic Rate in Poisson Cellular Networks
AI总结:
本文针对Poisson蜂窝网络提出聚合其他小区干扰MGF的精确闭式近似,并据此推导干扰受限下行遍历容量,经Monte Carlo仿真验证,可为网络密集化提供依据。
摘要:
随机几何在超密集网络(UDNs)分析与设计中的应用,为网络密集化提供了重要洞见。除了刻画网络性能与行为之外,这些工具还可用于解决复杂优化问题,从而最大化UDNs中产生的容量收益。然而,其前提是所考虑的性能指标存在易处理的闭式表达式。在此过程中,本文针对由位置服从给定空间密度Poisson点过程的基站所产生的聚合其他小区干扰,提出了其矩生成函数(MGF)的一种精确近似。鉴于聚合干扰MGF在随机几何中的关键作用以及所推导MGF的易处理性,后者可用于大幅简化后续随机几何分析。随后,本文利用所提出的MGF给出了干扰受限情形下下行链路遍历容量的闭式表达式,并通过大量Monte Carlo仿真验证了这些表达式的准确性。所推导的表达式依赖于用户和基站的密度,为网络运营商和设计人员制定了极具价值的密集化路线图。
英文摘要:
The employment of stochastic geometry for the analysis and design of ultra dense networks (UDNs) has provided significant insights into network densification. In addition to the characterization of the network performance and behavior, these tools can also be exploited toward solving complex optimization problems that could maximize the capacity benefits arising in UDNs. However, this is preconditioned on the existence of tractable closed form expressions for the considered figures of merit. In this course, the present paper introduces an accurate approximation for the moment generating function (MGF) of the aggregate other-cell interference created by base stations whose positions follow a Poisson point process of given spatial density. Given the pivotal role of the MGF of the aggregate interference in stochastic geometry and the tractability of the derived MGF, the latter can be employed to substantially simplify ensuing stochastic geometry analyses. Subsequently, the present paper employs the introduced MGF to provide closed form expressions for the downlink ergodic capacity for the interference limited case, and validates the accuracy of these expressions by the use of extensive Monte Carlo simulations. The derived expressions depend on the density of users and base stations, setting out a densification road map for network operators and designers of significant value.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。