arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.0135cs.ITmath.IT
收藏

大规模无线系统的设计(附详细证明)

On the Design of Large Scale Wireless Systems (with detailed proofs)

Rohit Aggarwal, Can Emre Koksal, Philip Schniter

摘要:

在本文中,我们认为大型OFDMA网络的下行链路,并研究其性能界限作为一个功能的发射机$B$,用户$K$,和资源块$N$的数量。这里,资源块是子载波的集合,使得不相交的所有这样的集合具有相关联的独立衰落信道。特别是,我们分析了预期可实现的和率作为上述变量的函数,并推导出新的上限和下限的一般空间几何形状的发射机,截断路径损耗模型,和各种衰落模型。我们建立了相关的缩放定律的密集和扩展的网络,并提出设计准则的监管机构,以保证各种QoS约束,并在同一时间,最大限度地提高收入的服务提供商。此后,我们开发了一个分布式资源分配方案,实现了相同的和率缩放的建议的上限范围广泛的$K, B, N$。在此基础上,我们比较了低功率对等网络和高功率单发送器网络,并给出了一个额外的设计原则。最后,我们还展示了如何我们的结果可以扩展到的情况下,每个$B$发射机有$M (>1)$共置天线。

英文摘要:

In this paper, we consider the downlink of large OFDMA-based networks and study their performance bounds as a function of the number of - transmitters $B$, users $K$, and resource-blocks $N$. Here, a resource block is a collection of subcarriers such that all such collections, that are disjoint have associated independently fading channels. In particular, we analyze the expected achievable sum-rate as a function of above variables and derive novel upper and lower bounds for a general spatial geometry of transmitters, a truncated path-loss model, and a variety of fading models. We establish the associated scaling laws for dense and extended networks, and propose design guidelines for the regulators to guarantee various QoS constraints and, at the same time, maximize revenue for the service providers. Thereafter, we develop a distributed resource allocation scheme that achieves the same sum-rate scaling as that of the proposed upper bound for a wide range of $K, B, N$. Based on it, we compare low-powered peer-to-peer networks to high-powered single-transmitter networks and give an additional design principle. Finally, we also show how our results can be extended to the scenario where each of the $B$ transmitters have $M (>1)$ co-located antennas.

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

↑