标题： 异构网络中的机会调度：分布式算法与系统容量 显示英文标题

标题： Opportunistic Scheduling in Heterogeneous Networks: Distributed Algorithms and System Capacity

摘要： 在本工作中，我们设计并分析了多用户MIMO系统的新型分布式调度算法。 特别是，我们考虑了不需要将信道状态信息发送到中央处理单元，也不需要用户之间进行通信的算法，然而，我们证明了它们的性能可以紧密逼近一个能够每段时间槽调度最强用户的集中式系统。 我们的分析基于点过程近似的创新应用。 这种新方法使我们能够检查非齐次情况，例如非同分布的用户，或处理各种服务质量考虑因素，并给出这些方案下系统容量的精确表达式，从而解析地解决了至今仍开放的问题。 可能的应用包括但不限于现代4G网络，如3GPP LTE，或随机接入协议。 显示英文摘要

摘要： In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they require communication between the users themselves, yet, we prove their performance closely approximates that of a centrally-controlled system, which is able to schedule the strongest user in each time-slot. Our analysis is based on a novel application of the Point-Process approximation. This novel technique allows us to examine non-homogeneous cases, such as non-identically distributed users, or handling various QoS considerations, and give exact expressions for the capacity of the system under these schemes, solving analytically problems which to date had been open. Possible application include, but are not limited to, modern 4G networks such as 3GPP LTE, or random access protocols.