首页> 外文会议>IEEE Global Communications Conference >Optimal Coverage and Rate in Downlink Cellular Networks: A SIR Meta-Distribution Based Approach
【24h】

Optimal Coverage and Rate in Downlink Cellular Networks: A SIR Meta-Distribution Based Approach

机译:下行蜂窝网络中的最佳覆盖率和速率:一种基于SIR元分布的方法

获取原文

摘要

In this paper, we present a detailed analysis of the coverage and spectral efficiency of a downlink cellular network. Rather than relying on the first order statistics of received signal-to- interference-ratio (SIR) such as coverage probability, we focus on characterizing its meta- distribution. Our analysis is based on the alpha- beta-gamma (ABG) path-loss model which provides us with the flexibility to analyze urban macro (UMa) and urban micro (UMi) deployments. With the help of an analytical framework, we demonstrate that selection of underlying degrees-of-freedom such as BS height for optimization of first order statistics such as coverage probability is not optimal in the network-wide sense. Consequently, the SIR meta-distribution must be employed to select appropriate operational points which will ensure consistent user experiences across the network. Our design framework reveals that the traditional results which advocate lowering of BS heights or even optimal selection of BS height do not yield consistent service experience across users. By employing the developed framework we also demonstrate how available spectral resources in terms of time slots/channel partitions can be optimized by considering the meta-distribution of the SIR.
机译:在本文中,我们对下行蜂窝网络的覆盖范围和频谱效率进行了详细分析。我们专注于表征其元分布,而不是依赖于接收信号与干扰比(SIR)的一阶统计信息(例如覆盖率)。我们的分析基于α-β-伽玛(ABG)路径损耗模型,该模型为我们提供了分析城市宏(UMa)和城市微(UMi)部署的灵活性。借助分析框架,我们证明了为优化一阶统计数据(如覆盖率)而对诸如BS高度之类的基础自由度的选择在整个网络范围内并不是最佳的。因此,必须采用SIR元分配来选择适当的操作点,以确保整个网络上一致的用户体验。我们的设计框架表明,提倡降低BS高度甚至优化选择BS高度的传统结果无法在用户之间产生一致的服务体验。通过采用开发的框架,我们还演示了如何通过考虑SIR的元分布来优化时隙/信道分区方面的可用频谱资源。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号