arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.00337eess.SP
收藏

具有随机干扰的超密集无线网络中的快速容量估计

Fast Capacity Estimation in Ultra-dense Wireless Networks with Random Interference

Dandan Jiang, Rui Wang, Jiang Xue

AI总结:

针对超密集无线网络中容量计算成本极高的问题,本文提出基于Fisher矩阵的FISE算法和闭式表达式快速估计方法,在低复杂度下实现高精度容量估计,且不受网络形状和分布限制。

摘要:

在无线通信系统中,对信道容量进行准确可靠的评估被认为是终端面临的一个基本且关键的问题。然而,随着无线技术的快速发展,具有显著随机干扰的大规模通信网络已经出现,导致容量计算的计算成本极高。在基站和用户数量极其庞大的超密集无线网络中,我们提供了用于确定容量的快速估计方法。我们根据用户数与基站数之比 $β_m$ 考虑两种场景。首先,当 $β_m\leq1$ 时,提出 FIsher-Spiked Estimation (FISE) 算法,通过将具有随机干扰的信道矩阵建模为 Fisher 矩阵来确定容量。其次,当 $β_m>1$ 时,基于仅需简单计算的容量估计闭式表达式,我们证明该估计随着 $β_m$ 的增大而趋于稳定并保持不变。我们的方法能够在低复杂度下保证容量估计的高精度,并且比现有方法更快。此外,我们的方法展现出优异的通用性,不受网络区域形状、基站和用户分布以及子网络位置的影响。跨多种场景的大量仿真实验证明了我们方法的高精度和鲁棒性。

英文摘要:

In wireless communication systems, the accurate and reliable evaluation of channel capacity is believed to be a fundamental and critical issue for terminals. However, with the rapid development of wireless technology, large-scale communication networks with significant random interference have emerged, resulting in extremely high computational costs for capacity calculation. In ultra-dense wireless networks with extremely large numbers of base stations (BSs) and users, we provide fast estimation methods for determining the capacity. We consider two scenarios according to the ratio of the number of users to the number of BSs, $β_m$. First, when $β_m\leq1$, the FIsher-Spiked Estimation (FISE) algorithm is proposed to determine the capacity by modeling the channel matrix with random interference as a Fisher matrix. Second, when $β_m>1$, based on a closed-form expression for capacity estimation requiring solely simple computations, we prove that this estimation stabilizes and remains invariant with increasing $β_m$. Our methods can guarantee high accuracy on capacity estimation with low complexity, which is faster than the existing methods. Furthermore, our approaches exhibit excellent generality, free of network area shapes, BS and user distributions, and sub-network locations. Extensive simulation experiments across various scenarios demonstrate the high accuracy and robustness of our methods.

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

↑