arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6731cs.NIcs.GT
收藏

大规模MIMO无线网络中的最优用户-小区关联

Optimal User-Cell Association for Massive MIMO Wireless Networks

Dilip Bethanabhotla, Ozgun Bursalioglu, Haralabos Papadopoulos, Giuseppe Caire

摘要:

在每个基站站点处使用非常大量的天线(称为“大规模MIMO”)是应对预测的无线数据业务爆炸的最有前途的方法之一。结合时分双工和简单的每小区处理,它实现了每小区的大吞吐量、低延迟和有吸引力的功率效率性能。遵循移动到更高频带和更密集的小小区部署的当前无线技术趋势,即使在小小区基站中,也可以在小形状因子内实现大量天线。在由大型(宏)和小型小区BS形成的异构网络中,关键的系统优化问题包括“负载均衡“,即,将用户与BS相关联以便避免拥塞的热点和/或未充分利用的基础设施。在本文中,我们考虑了大规模MIMO异构网络的用户-BS关联问题。我们制定的问题作为一个网络效用最大化,并提供了一个集中的解决方案,在传输资源(时频隙)的分数,每个用户由一个给定的BS服务。此外,我们表明,这样的解决方案是物理上可实现的,即,存在(通过分时)实现最优分数的整数调度配置序列。虽然这种解决方案是最佳的,但它需要集中计算。然后,我们还考虑分散的以用户为中心的计划,制定为非合作游戏,每个用户只根据其本地信息做出个人自私的关联决策。我们确定了一类计划,使他们的纳什均衡是非常接近的全球集中式最优。因此,这些以用户为中心的算法是有吸引力的,不仅因为它们的简单性和完全分散的实现,而且因为它们的操作接近系统的“社会”最优。

英文摘要:

The use of a very large number of antennas at each base station site (referred to as "Massive MIMO") is one of the most promising approaches to cope with the predicted wireless data traffic explosion. In combination with Time Division Duplex and with simple per-cell processing, it achieves large throughput per cell, low latency, and attractive power efficiency performance. Following the current wireless technology trend of moving to higher frequency bands and denser small cell deployments, a large number of antennas can be implemented within a small form factor even in small cell base stations. In a heterogeneous network formed by large (macro) and small cell BSs, a key system optimization problem consists of "load balancing", that is, associating users to BSs in order to avoid congested hot-spots and/or under-utilized infrastructure. In this paper, we consider the user-BS association problem for a massive MIMO heterogeneous network. We formulate the problem as a network utility maximization, and provide a centralized solution in terms of the fraction of transmission resources (time-frequency slots) over which each user is served by a given BS. Furthermore, we show that such a solution is physically realizable, i.e., there exists a sequence of integer scheduling configurations realizing (by time-sharing) the optimal fractions. While this solution is optimal, it requires centralized computation. Then, we also consider decentralized user-centric schemes, formulated as non-cooperative games where each user makes individual selfish association decisions based only on its local information. We identify a class of schemes such that their Nash equilibrium is very close to the global centralized optimum. Hence, these user-centric algorithms are attractive not only for their simplicity and fully decentralized implementation, but also because they operate near the system "social" optimum.

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

↑